isl_schedule_private.h

   1 #ifndef ISL_SCHEDLUE_PRIVATE_H
   2 #define ISL_SCHEDLUE_PRIVATE_H
   3
   4 #include <isl/aff.h>
   5 #include <isl/schedule.h>
   6 #include <isl_schedule_tree.h>
   7
   8 /* The schedule for an individual domain, plus information about the bands
   9  * and scheduling dimensions.
  10  * In particular, we keep track of the number of bands and for each
  11  * band, the starting position of the next band.  The first band starts at
  12  * position 0.
  13  * For each scheduling dimension, we keep track of whether it satisfies
  14  * the coincidence constraints (within its band).
  15  */
  16 struct isl_schedule_domain_node {
  17         isl_multi_aff *sched;
  18         int      n_band;
  19         int     *band_end;
  20         int     *band_id;
  21         int     *coincident;
  22 };
  23
  24 /* Information about the computed schedule.
  25  * n is the number of nodes/domains/statements.
  26  * n_band is the maximal number of bands.
  27  * n_total_row is the number of coordinates of the schedule.
  28  * dim contains a description of the parameters.
  29  * band_forest points to a band forest representation of the schedule
  30  * and may be NULL if the forest hasn't been created yet.
  31  *
  32  * "root" is the root of the schedule tree and may be NULL if this
  33  * schedule was not created from a schedule tree.
  34  * On the other hand, if "root" is not NULL, then the other members,
  35  * except leaf, are uninitialized.
  36  *
  37  * A pointer to "leaf" may be used to represent a leaf of the schedule.
  38  * It should not appear as a child to any other isl_schedule_tree objects,
  39  * but an isl_schedule_node may point to "leaf" if it refers to
  40  * a leaf of this schedule tree.
  41  */
  42 struct isl_schedule {
  43         int ref;
  44
  45         int n;
  46         int n_band;
  47         int n_total_row;
  48         isl_space *dim;
  49
  50         isl_band_list *band_forest;
  51         isl_schedule_tree *root;
  52
  53         struct isl_schedule_tree leaf;
  54
  55         struct isl_schedule_domain_node node[1];
  56 };
  57
  58 __isl_give isl_schedule *isl_schedule_from_schedule_tree(isl_ctx *ctx,
  59         __isl_take isl_schedule_tree *tree);
  60 __isl_give isl_schedule *isl_schedule_set_root(
  61         __isl_take isl_schedule *schedule, __isl_take isl_schedule_tree *tree);
  62 __isl_give isl_space *isl_schedule_get_space(
  63         __isl_keep isl_schedule *schedule);
  64 __isl_give isl_union_set *isl_schedule_get_domain(
  65         __isl_keep isl_schedule *schedule);
  66 __isl_keep isl_schedule_tree *isl_schedule_peek_leaf(
  67         __isl_keep isl_schedule *schedule);
  68
  69 #endif