* In particular, we keep track of the number of bands and for each
* band, the starting position of the next band. The first band starts at
* position 0.
- * For each scheduling dimension, we keep track of whether it is parallel
- * (within its band) with respect to the proximity edges.
+ * For each scheduling dimension, we keep track of whether it result
+ * in zero dependence distances (within its band) with respect
+ * to the proximity edges.
*/
struct isl_schedule_node {
isl_map *sched;
int n_band;
int *band_end;
int *band_id;
- int *parallel;
+ int *zero;
};
/* Information about the computed schedule.
int n;
int n_band;
int n_total_row;
- isl_dim *dim;
+ isl_space *dim;
isl_band_list *band_forest;