* Search the time-space domain (the range of the schedule) and * return the loop level number that correspond to the dimension * named \p

Free "v" and return NULL. */

Free "tree" and return NULL. */

Free "node" and return NULL. */

* Generate an object file. This object file will contain the compiled * function. * \p obj_file_name indicates the name of the generated file.

* Generate an isl AST for the function. */

Allocate a group of expressions defined over the same domain space * with domain space "domain_space" and initial size "size". */

* Get the type of the operator (tiramisu::op_t). */

Treat "bset" as a basic map. * Internally, isl_basic_set is defined to isl_basic_map, so in practice, * this function performs a redundant cast. */

* Return the function where the computation is declared. */

A pointer to one beyond the element with the highest address. */

Treat "set" as a map. * Internally, isl_set is defined to isl_map, so in practice, * this function performs a redundant cast. */

Mark "bmap" as final, after removing obviously redundant integer divisions. */

* Bind the computation to a buffer. * i.e. create a one-to-one data mapping between the computation * the buffer. */

* Return the type of the expression (tiramisu::expr_type). */

If the id has a negative refcount, then it is a static isl_id * and should not be freed. */

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

* Get the data type of the computation. */

Return a new reference to "v". */

Are the two spaces the same, including positions and names of parameters? */

* Get the data type of the expression. */

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

Check if the tuple of type "type1" of "space1" is the same as * the tuple of type "type2" of "space2". * * That is, check if the tuples have the sa

Mark the fact that the current element is finished and that * the next output belongs to the next element. * In particular, if we are printing a key

* Set the expression of the computation. */