* - Get the access function of the consumer (access to computations). * - Apply the schedule on the iteration domain and access functions. * - Keep

Read a key from "s" and return the corresponding enum. * Return KEY_ERROR on error, i.e., if the first token * on the stream does not correspond to

For each pair of basic maps in the map, check if the union of the two * can be represented by a single basic map. * If so, replace the pair by the s

Print "expr" to "p". * * Only an isl and a C format are supported. */

Return a new reference to "node". */

Return the number of ancestors of "node" in its schedule tree. */

* Return the type of the elements of the buffer. */

Replace the variables x in bset by x' given by x = M x', with * M the matrix mat. * * If there are fewer variables x' then there are x, then we per

Apply the morphism to the basic set. * We basically just compute the preimage of "bset" under the inverse mapping * in morph, add in stride constrai

Normalize "v". * * In particular, make sure that the denominator of a rational value * is positive and the numerator and denominator do not have an

For each node of the ISL AST, the corresponding computation is stored. This function retrieves that computation.

Multiple "aff" by "v". */

Return a string containing C code representing this isl_ast_expr. */

Return a pointer to the root of "schedule". */

Return the domain of the domain tree root. */

Turn the n dimensions of type type, starting at first * into existentially quantified variables. */

Get the number of an isl_int in small representation. Result is undefined if * val is not stored in that format. */

Return a reference to an isl_val representing NaN. */

Add another source to an isl_access_info structure, making * sure the "must" sources are placed before the "may" sources. * This function may be cal

Create a new integer expression representing "v". */

Is "bmap" obviously equal to the universe with the same space? * * That is, does it not have any constraints? */

Return the union of "map1" and "map2", where "map1" and "map2" are * guaranteed to be disjoint by the caller. * * Note that this functions is calle

Replace the child at position "pos" of "tree" by "child". * * If the new child is a leaf, then it is not explicitly * recorded in the list of child

Compute the preimage of "set" under the function represented by "ma". * In other words, plug in "ma" in "set". The result is a set * that lives in

Add a row to the tableau. The row is given as an affine combination * of the original variables and needs to be expressed in terms of the * column

Given a token with a string representation, return a copy of this string. */