Return the tableau to the state it was in when the snapshot "snap" * was taken. */

Return the basic set that was treated as the basic map "bmap". */

Take a snapshot of the tableau that can be restored by a call to * isl_tab_rollback. */

Return the set that was treated as the map "map". */

Return the isl_ctx to which "val" belongs. */

Does "v" represent an integer value? */

Return an isl_map that is equal to "map" and that has only * a single reference. * * If the original input already has only one reference, then *

Move the "node" pointer to the child at position "pos" of the node * it currently points to. */

A pointer to the element with the lowest address. If all * strides are positive, equal to the host pointer. */

* Implementation internals. * * This function gets as input a loop level and translates it * automatically to the appropriate schedule dimension

Free a reference to "band" and return NULL. */

Do "space1" and "space2" have the same parameters? */

Does "v" represent NaN? */

Return the union of "map1" and "map2", where "map1" and "map2" may * not be disjoint. */

Does "v" represent a rational value? */

Does "v" represent the integer zero? */

Is the space that of a set? */

Does "aff" represent NaN? */

Return 1 if val is stored in small representation and store its value to * small. We rely on the compiler to optimize the isl_sioimath_get_small such

Replace the subtree that "pos" points to by "tree", updating * the ancestors to maintain a consistent state. */

Get the IMath representation of an isl_int without modifying it. * For the case it is not in big representation yet, pass some scratch space we * ca

Move to the next state at the innermost level. * Return 1 if successful. * Return 0 if we are at the end of the innermost level. * Return -1 on err

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

* Return the context of the computations. */