Does the given dimension have a name? */

Is the set bounded for each value of the parameters? */

Create a temporary IMath mp_int for an unsigned long. */

Check that "space1" and "space2" have the same parameters, * reporting an error if they do not. */

Return the hash value of the domain of "space". * That is, isl_space_get_domain_hash(space) is equal to * isl_space_get_hash(isl_space_domain(space)

Does the tuple have an id? */

Is space1 equal to the domain of space2? * * In the internal version we also allow space2 to be the space of a set, * provided space1 is a paramete

Is the given space that of a map? */

Reset the user pointer on all identifiers of parameters and tuples * of "space". */

Finish reading a YAML mapping. * Return 0 on success and -1 on error. * * If the mapping started with a '{', then we expect a '}' to close * the m

Start reading a YAML mapping. * Return 0 on success and -1 on error. * * If the first token on the stream is a '{' then we remove this token * fro

Make room for at least n_new extra variables. * Return -1 if anything went wrong. */

Check the effect of inequality "ineq" on the tableau "tab". * The result may be * isl_ineq_redundant: satisfied by all points in the tableau * isl_

Decompose the graph with "len" nodes and edges defined by "follows" * into strongly connected components (SCCs). * follows(i, j, user) should return

Replace the access relation of type "type" of "info" by "access". */

Construct a union map mapping the shared domain * of the union piecewise affine expressions to the range of "mupa" * with each dimension in the rang

Try and create an isl_union_pw_multi_aff that is equivalent * to the given isl_union_map. * The isl_union_map is required to be single-valued in eac

How does "v" compare to "i"? * * Return 1 if v is greater, -1 if v is smaller and 0 if v is equal to i. * * If v is NaN (or NULL), then the result

Given two integer values, return their greatest common divisor. */

Is "v" (strictly) positive? */

Return the maximum of "v1" and "v2". */

Return the minimum of "v1" and "v2". */

Return the sign of "v". * * The sign of NaN is undefined. */

Given a rational vector, with the denominator in the first element * of the vector, round up all coordinates. */

Construct a map with as domain the domain of pwaff and * one-dimensional range corresponding to the affine expressions. */

Return the offset of the coefficients of the parameters of "node" * within the (I)LP. * * Within each node, the coefficients have the following ord

Return the position of the pair of variables encoding * coefficient "i" of "node". * * The order of these variable pairs is the opposite of * that

Print a key, value pair for the edge of type "type" in "sc" to "p". * * If the edge relation is empty, then it is not printed since * an empty rela

Push record "u" onto the undo stack of "tab", provided "tab" * keeps track of undo information. * * If the record cannot be pushed, then mark the u

Does the sample value of row "row" of "tab" involve the big parameter, * if any? */

Given a set "set", return parametric bounds on the dimension "dim". */

Return a set that corresponds to the non-redundant constraints * (as recorded in tab) of bmap. * * It's important to remove the redundant constrain

* Set the name of the computation. */

Return the sign of the maximal value of "var". * If the sign is not negative, then on return from this function, * the sample value will also be non

Pop one partial solution from the partial solution stack and * pass it on to sol->add or sol->add_empty. */

Traverse the descendant of "node" in depth-first order, including * "node" itself. Call "enter" whenever a node is entered and "leave" * whenever a

Free the contents of the isl_wraps data structure. */

If any of the constraints is found to be impure then this function * sets *impurity to 1. * * If impurity is NULL then we are dealing with a non-pa

The implementation is based on Section 5.2 of Michael Karr, * "Affine Relationships Among Variables of a Program", * except that the echelon form we

Should we refrain from merging the cluster in "graph" with * any other cluster? * In particular, is its current schedule band empty and incomplete.

Size in bytes for a single element, even if width is not 1, of this type. */

Size in bytes for a single element, even if width is not 1, of this type. */

Size in bytes for a single element, even if width is not 1, of this type. */

Check that there are "n" columns starting at position "first" in "mat". */

Check if the context tableau of sol has any integer points. * Leave tab in empty state if no integer point can be found. * If an integer point can b

Check that there are "n" rows starting at position "first" in "mat". */

Check whether all the currently active samples also satisfy the inequality * "ineq" (treated as an equality if eq is set). * Remove those samples th

Make sure that that spaces of "node" and "mv" are the same. * Return -1 on error, reporting the error to the user. */

Compute a schedule for each group of nodes identified by node->scc * separately and then combine them in a sequence node (or as set node * if graph-

Call construct_component and, if "project" is set, project out * the final coordinates. */

Restart isl_basic_map_drop_redundant_divs after "bmap" has * been modified, simplying it if "simplify" is set. * Free the temporary data structure "