isl_tab_basic_set_non_trivial_lexmin: extract out better_next_side
[isl.git] / isl_band_private.h
blob8b9c0b77da750d22487be118daa3523625bb1506
1 #ifndef ISL_BAND_PRIVATE_H
2 #define ISL_BAND_PRIVATE_H
4 #include <isl/aff.h>
5 #include <isl/band.h>
6 #include <isl/list.h>
7 #include <isl/schedule.h>
9 /* Information about a band within a schedule.
11 * n is the number of scheduling dimensions within the band.
12 * coincident is an array of length n, indicating whether a scheduling dimension
13 * satisfies the coincidence constraints in the sense that
14 * the corresponding dependence distances are zero.
15 * pma is the partial schedule corresponding to this band.
16 * schedule is the schedule that contains this band.
17 * parent is the parent of this band (or NULL if the band is a root).
18 * children are the children of this band (or NULL if the band is a leaf).
20 * To avoid circular dependences in the reference counting,
21 * the schedule and parent pointers are not reference counted.
22 * isl_band_copy increments the reference count of schedule to ensure
23 * that outside references to the band keep the schedule alive.
25 struct isl_band {
26 int ref;
28 int n;
29 int *coincident;
31 isl_union_pw_multi_aff *pma;
32 isl_schedule *schedule;
33 isl_band *parent;
34 isl_band_list *children;
37 #undef EL
38 #define EL isl_band
40 #include <isl_list_templ.h>
42 __isl_give isl_band *isl_band_alloc(isl_ctx *ctx);
44 __isl_give isl_union_map *isl_band_list_get_suffix_schedule(
45 __isl_keep isl_band_list *list);
47 #endif