Compute the parameter domain of the given basic set. */

Return the coefficient of the variable of type "type" at position "pos" * of "constraint". */

Construct a map mapping the domain the multi-affine expression * to its range, with each dimension in the range equated to the * corresponding affin

Return a copy of the string constructed by the string printer "printer". */

Finish a YAML mapping and pop it from the state stack. * * In flow style, print the closing brace. * * In block style, first check if we are still

Create an isl_pw_multi_aff with the given isl_multi_aff on a universe * domain. */

Return the filter of the filter node "node". */

Return a copy of the schedule into which "node" points. */

Return the filter of the filter tree root. */

Create a new filter schedule tree with the given filter and single child. * * If the root of "tree" is itself a filter node, then the two * filter

Return the number of children of "tree", excluding implicit leaves. */

* Let d = dst[pos] and s = src[pos] * dst is replaced by |s| dst - sgn(s)d src */

Read a schedule (sub)tree from "s". * * We first determine the type of the root node based on the first * mapping key and then hand over to a funct

Is the constraint at position "con" marked as being redundant? * If it is marked as representing an equality, then it is not * considered to be redu

Free "tl" and return NULL. */

Extract the numerator of a rational value "v" as an integer. * * If "v" is not a rational value, then the result is undefined. */

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

Perform pivots until the row variable "var" has a non-negative * sample value or until no more upward pivots can be performed. * Return the sign of

Find a pivot (row and col) that will increase (sgn > 0) or decrease * (sgn < 0) the value of row variable var. * If not NULL, then skip_var is a row

* Return the trimmed schedule of the computation. * The trimmed schedule is the schedule without the * duplication dimension. */

Return a pointer to the node that lives within the given space, * an invalid node if there is no such node, or NULL in case of error. */

Is "edge" marked as a conditional validity edge? */

Is "edge" marked as being of type "type"? */

Is "edge" marked as a validity edge? */

Given f, return floor(f). * If f is an integer expression, then just return f. * If f is a constant, then return the constant floor(f). * Otherwise

Does the dimension at (internal) position "pos" have a non-trivial stride? */

Replace the space of "bmap" by "space". * * If the space of "bmap" is identical to "space" (including the identifiers * of the input and output dim

Add a constraint imposing that the given two dimensions are equal. */

Given two matrices M1 and M2, return the block matrix * * [ M1 0 ] * [ 0 M2 ] */

Given a set of equalities * * M x - c = 0 * * this function computes a unimodular transformation from a lower-dimensional * space to the origina

Read an isl_multi_union_pw_aff from "str". */

Construct a reordering that maps the parameters of "alignee" * to the corresponding parameters in a new dimension specification * that has the param

Start a YAML mapping and push a new state to reflect that we * are about to print the first key in a mapping. * * In flow style, print the opening

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

Return an isl_union_map representation of the schedule. In particular, * return an isl_union_map corresponding to the subtree schedule of the child

Return the number of members in the band tree root. */

Is this set a parameter domain? */

Assign an int64_t number using small representation if possible. */

Insert "n" dimensions of type "type" at position "pos". * If we are inserting parameters, then they are also inserted in * any nested spaces. */

Check for (near) equalities among the constraints. * A constraint is an equality if it is non-negative and if * its maximal value is either * - zer

Mark row with index "row" as being redundant. * If we may need to undo the operation or if the row represents * a variable of the original problem,

Return the minimal value of the affine expression "f" with denominator * "denom" in *opt, *opt_denom, assuming the tableau is not empty and * the ex

Free "flow" and return NULL. */

Is "v1" equal to "v2"? */

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

* Return true if the this computation is supposed to be scheduled * by Tiramisu. */

Drop the "isl_" initial part of the type name "name". */

Does "expr" represent the zero integer? */