Given a "sink" access, a list of n "source" accesses, * compute for each iteration of the sink access * and for each element accessed by that iterat

Return the common denominator of "aff". */

Return the negation of "aff". * * As a special case, -NaN = NaN. */

Return the result of scaling "aff" by a factor of "f". * * As a special case, f * NaN = NaN. */

Divide "aff" by "v". */

Construct an isl_ast_expr that evaluates the affine expression "aff", * The result is simplified in terms of build->domain. * * We first extract hi

Eliminate the specified variables from the constraints using * Fourier-Motzkin. The variables themselves are not removed. */

Turn the n dimensions of type type, starting at first * into existentially quantified variables. * * If a subset of the projected out variables are

Drop all constraints in bset that involve any of the dimensions * first to first+n-1. */

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

Iterate over all sources and for each resulting flow dependence * that is not empty, call the user specfied function. * The second argument in this

Does the given dimension have a name? */

Return the space of "map". */

Compute the preimage of the domain or range (depending on "type") * of "map" under the function represented by "ma". * In other words, plug in "ma"

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

Construct a multiple union piecewise affine expression * in the given space with value zero in each of the output dimensions. * * Since there is no

Replace the constraints of type "type" in "sc" by "c". */

Replace the proximity constraints of "sc" by "proximity". */

Return the number of members in the given band node. */

Return an isl_schedule_node that is equal to "node" and that has only * a single reference. */

Return the expansion map of expansion node "node". */

Move the "node" pointer to the first child of the node * it currently points to. */

Return the number of outer schedule dimensions of "node" * in its schedule tree. * * Return -1 on error. */

Insert a band node with partial schedule "mupa" between "node" and * its parent. * Return a pointer to the new band node. * * If any of the nodes

Insert a sequence node with child filters "filters" between "node" and * its parent. That is, the tree that "node" points to is attached * to each

Does "tree" have any children, other than an implicit leaf. */

Given two set A and B, construct its Cartesian product A x B. */

Convert to big representation while preserving the current number. */

Compare two isl_spaces. * * The order is fairly arbitrary. */

Given the space of set (domain), construct a space for a map * with as domain the given space and as range the range of "model". */

Does the given dimension have a name? */

Add a variable to the tableau at position "r" and allocate a column for it. * Return the index into the variable array "var", i.e., "r", * or -1 on

Push a record on the undo stack describing the current basic * variables, so that the this state can be restored during rollback. */

Return 1 if row "row" represents an obviously redundant inequality. * This means * - it represents an inequality or a variable * - that is the sum

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

Return a reference to an isl_val representing the integer "i". */

Given two integer values "v1" and "v2", check if "v1" is divisible by "v2". */

Read an isl_val from "str". */

Change "v" into a NaN. */

Replace the element at position "pos" of "vec" by "v". */

Remove the innermost active YAML element from the stack. * Return 0 on success and -1 on failure. */

Print the disjuncts of a map (or set) "map" to "p". * The names of the variables are taken from "space". * "latex" is set if the constraints should

Print a key-value pair of a YAML mapping to "p", * with key "name" and value "umap". */

Return a set containing those elements in the shared domain * of the elements of list1 and list2 where each element in list1 * has the relation spec

Read a first order formula from "s", add the corresponding * constraints to "map" and return the result. * * In particular, read a formula of the f

Set the state of the innermost active YAML element to "state". * Return 0 on success and -1 on failure. */