Remove all divs (recursively) involving any of the given dimensions * in their definitions. */

Replace the variables x of type "type" starting at "first" in "bmap" * by x' with x = M x' with M the matrix trans. * That is, replace the correspon

We detect all the equalities first to avoid implicit equalities * being discovered during the computations. In particular, * the compression on the

Return the number of equality constraints in the description of "bset". * Return -1 on error. */

Construct a basic set containing the elements that satisfy all * affine constraints whose coefficient tuples are * contained in the given basic set.

Given a basic set, exploit the equalities in the basic set to construct * a morphism that maps the basic set to a lower-dimensional space. * Specifi

For an inequality constraint * * f >= 0 * * or an equality constraint * * f = 0 * * return the affine expression f. */

Does the given constraint represent a lower bound on the given * dimension? */

Update "hash" by hashing in the tuples of "space". * Changes in this function should be reflected in isl_hash_tuples_domain. */

Compare two isl_local_spaces. * * Return -1 if "ls1" is "smaller" than "ls2", 1 if "ls1" is "greater" * than "ls2" and 0 if they are equal. */

Does "ls" have a complete explicit representation for div "div"? */

Return true if the two local spaces are identical, with identical * expressions for the integer divisions. */

Is the local space that of a set? */

Plug in the affine expressions "subs" of length "subs_len" (including * the denominator and the constant term) into the variable at position "pos" *

Given the local space "ls" of a map, return the local space of a set * that lives in a space that wraps the space of "ls" and that has * the same di

Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D) */

Does "map" contain any rational points? */

Perform "fn" on each basic map of "map", where we may not be holding * the only reference to "map". * In particular, "fn" should be a semantics pres

Are "map1" and "map2" disjoint? * * They are disjoint if they are "obviously disjoint" or if one of them * is empty. Otherwise, they are not disjo

Is this map actually a set? * Users should never call this function. Outside of isl, * the type should indicate whether something is a set or a map

Check if the given map is obviously single-valued. */

Compute a superset of the convex hull of "map" that is described * by only the constraints in the constituents of "map". * In particular, the result

Reorder the dimensions of "map" according to given reordering. */

Compute a superset of the convex hull of map that is described * by only translates of the constraints in the constituents of map. */

Replace the variables x starting at "first_col" in the rows "rows" * of some coefficient matrix by x' with x = M x' with M the matrix mat. * That is

Project domain of morph onto its parameter domain. */

Create a(n identity) morphism between empty sets of the same dimension * a "bset". */

Project range of morph onto its parameter domain. */

Given the space of a set and a range of set dimensions, * construct an isl_multi_aff that projects out those dimensions. */

Apply "aff" to "mpa". The range of "mpa" needs to be compatible * with the domain of "aff". The domain of the result is the same * as that of "mpa

Apply "pa" to "mpa". The range of "mpa" needs to be compatible * with the domain of "pa". The domain of the result is the same * as that of "mpa".

Align the parameters of "mpa1" and "mpa2", check that the ranges * of "mpa1" and "mpa2" live in the same space, construct map space * between the do

Read an isl_multi_pw_aff from "str". */

Construct and return a multi union piecewise affine expression * that is equal to the given multi piecewise affine expression. */

Does "p" have a note with identifier "id"? */

Print "schedule" to "p". */

Return a piecewise affine expression defined on the specified domain * that represents NaN. */

Return a map containing pairs of elements in the domains of "pa1" and "pa2" * where the function values are ordered in the same way as "order", * wh

Assuming that "cond1" and "cond2" are disjoint, * return an affine expression that is equal to pwaff1 on cond1 * and to pwaff2 on cond2. */

Mark the domains of "pwaff" as rational. */

Construct and return a piecewise multi affine expression * that is equal to the given piecewise affine expression. */

Create a piecewise multi-affine expression in the given space that maps each * input dimension to the corresponding output dimension. */

Return coefficient of power "deg" of variable "t_pos" of type "type". */

Look for equalities among the variables shared by context and qp * and the integer divisions of qp, if any. * The equalities are then used to elimin

Return the union of the universe domains of the nodes in "graph" * that satisfy "pred". */

Replace the conditional validity constraints of "sc" by "condition" * and "validity". */

Remove a single node from the schedule tree, attaching the child * of "node" directly to its parent. * Return a pointer to this former child or to t