Return the state of the innermost active YAML element. * Return isl_yaml_none if we are not inside any YAML element. */

Apply a binary operation to "umap1" and "umap2" based on "control". * Run over all maps in "umap1" and look for the corresponding map in "umap2" * i

* Return the isl context associated with this function. */

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

Construct an isl_access_info structure and fill it up with * the given data. The number of sources is set to 0. */

Return the constant term of "aff". */

Eliminate dimensions inner to the current dimension as well as * unknown divs and divs that depend on the current dimension. * The result then consi

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

Create a new operation expression of operation type "op", * with "n_arg" as yet unspecified arguments. */

* We don't cow, as the div is assumed to be redundant. */

Order divs such that any div only depends on previous divs */

Swap divs "a" and "b" in "bmap" and adjust the constraints and * div definitions accordingly. */

Extract the basic sets of "set" and collect them in an isl_basic_set_list. */

Modify the space of "map" through a call to "change". * If "can_change" is set (not NULL), then first call it to check * if the modification is allo

* returns range - domain */

Print "node" to "p". */

Return the domain elements that reach "node". * * If "node" is pointing at the root of the schedule tree, then * there are no domain elements reach

Return the type of the parent of "node" or isl_schedule_node_error on error. */

Return the union of universe sets of the domain elements that reach "node". * * If "node" is pointing at the root of the schedule tree, then * ther

Eliminate the specified n dimensions starting at first from the * constraints, without removing the dimensions from the space. * If the set is ratio

Is "space" the space of a map where the domain is a wrapped map space? */

Set the id of the given dimension of "space" to "id". * If the dimension already has an id, then it is replaced. * If the dimension is a parameter,

Mark column with index "col" as representing a zero variable. * If we may need to undo the operation the column is kept, * but no longer considered.

Read an isl_union_pw_multi_aff from "str". */

Check if there are any lower bounds on column variable "var", * i.e., non-negative rows where var appears with a positive coefficient. * Return 1 if

Print the name of the variable of type "type" and position "pos" * in "space" to "p". */

Note: This will not work correctly when value == MP_SMALL_MIN */

Given a map that represents a path with the length of the path * encoded as the difference between the last output coordindate * and the last input

* Algorithm: * - Compute the size of the buffer: * - TODO: Future work Use the same code that computes the needed area in compute_at, * -

Size in bytes for a single element, even if width is not 1, of this type. */

Check that "col" is a valid column position for "mat". */

Collect filter and/or prefix information from the first "n" * elements in "list" (which represent the ancestors of a node). * Store the results in "

Update the dependence relations based on the current schedule, * add the current band to "node" and then continue with the computation * of the next

Drop the basic map represented by "info". * That is, clear the memory associated to the entry and * mark it as having been removed. */

* Return the access function of the computation after transforming * it to the time-processor domain. * The domain of the access function is trans

* Return the number of arguments of the operator. */

Return the textual representation of "type" in C format. * * If there is a user-specified name in an isl_ast_op_names note * associated to "p", the

Free the given isl_access_info structure. */

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

Is the dimension at position "pos" known to attain only a single * value that, moreover, can be described by a single affine expression * in terms o

Do we need a (non-trivial) schedule map? * That is, is the internal schedule space different from * the external schedule space? * * The internal

Check that "bmap1" and "bmap2" have the same parameters, * reporting an error if they do not. */

Does local variable "div" of "bmap" have a complete explicit representation? * Having a complete explicit representation requires not only * an expl

Remove divs that are not strictly needed. * * First look for an equality constraint involving two or more * existentially quantified variables with

Return the space of "bmap". */