| /src/external/mit/isl/dist/ |
| isl_schedule_band.h | 11 * coincident is an array of length n, indicating whether a scheduling dimension
33 int *coincident; member in struct:isl_schedule_band
93 __isl_take isl_schedule_band *band, int pos, int coincident);
|
| isl_scheduler.h | 53 * coincident contains a boolean for each of the rows of the schedule,
88 int *coincident; member in struct:isl_sched_node
|
| isl_schedule_read.c | 36 [isl_schedule_key_coincident] = "coincident",
457 /* Read a sequence of integers from "s" (representing the coincident
465 /* Set the (initial) coincident properties of "band" according to
466 * the (initial) elements of "coincident".
469 __isl_take isl_schedule_band *band, __isl_take isl_val_list *coincident)
475 m = isl_val_list_n_val(coincident);
482 v = isl_val_list_get_val(coincident, i);
489 isl_val_list_free(coincident);
499 isl_val_list *coincident = NULL; local
535 coincident = read_coincident(s)
[all...] |
| isl_schedule_tree.c | 1024 * marked coincident?
1039 /* Mark the given band member as being coincident or not
1040 * according to "coincident".
1043 __isl_take isl_schedule_tree *tree, int pos, int coincident)
1051 coincident)
1058 coincident);
2652 /* Are any members in "band" marked coincident?
2663 isl_bool coincident; local
2665 coincident = isl_schedule_band_member_get_coincident(band, i);
2666 if (coincident < 0 || coincident
2684 isl_bool coincident; local
[all...] |
| isl_scheduler.c | 490 * The "coincident" field is shared by nodes in a graph and its subgraph.
506 free(node->coincident);
981 int *coincident; local
1000 coincident = isl_calloc_array(ctx, int, graph->max_row);
1001 node->coincident = coincident;
1009 if (!space || !sched || (graph->max_row && !coincident))
2969 * If coincident is set, then the caller guarantees that the new
2973 __isl_take isl_vec *sol, int coincident)
3012 node->coincident[graph->n_total_row] = coincident
5682 int coincident; local
[all...] |
