1 #ifndef ISL_SCHEDLUE_NODE_PRIVATE_H
2 #define ISL_SCHEDLUE_NODE_PRIVATE_H
4 #include <isl/schedule_node.h>
5 #include <isl_schedule_band.h>
7 /* An isl_schedule_node points to a particular location in a schedule tree.
9 * "schedule" is the schedule that the node is pointing to.
10 * "ancestors" is a list of the n ancestors of the node
11 * that is being pointed to.
12 * The first ancestor is the root of "schedule", while the last ancestor
13 * is the parent of the specified location.
14 * "child_pos" is an array of child positions of the same length as "ancestors",
15 * where ancestor i (i > 0) appears in child_pos[i - 1] of ancestor i - 1 and
16 * "tree" appears in child_pos[n - 1] of ancestor n - 1.
17 * "tree" is the subtree at the specified location.
19 * Note that the same isl_schedule_tree object may appear several times
20 * in a schedule tree and therefore does not uniquely identify a position
21 * in the schedule tree.
23 struct isl_schedule_node
{
26 isl_schedule
*schedule
;
27 isl_schedule_tree_list
*ancestors
;
29 isl_schedule_tree
*tree
;
32 __isl_give isl_schedule_node
*isl_schedule_node_alloc(
33 __isl_take isl_schedule
*schedule
, __isl_take isl_schedule_tree
*tree
,
34 __isl_take isl_schedule_tree_list
*ancestors
, int *child_pos
);
35 __isl_give isl_schedule_node
*isl_schedule_node_graft_tree(
36 __isl_take isl_schedule_node
*pos
, __isl_take isl_schedule_tree
*tree
);
38 __isl_give isl_schedule_tree
*isl_schedule_node_get_tree(
39 __isl_keep isl_schedule_node
*node
);
41 __isl_give isl_schedule_node
*isl_schedule_node_pullback_union_pw_multi_aff(
42 __isl_take isl_schedule_node
*node
,
43 __isl_take isl_union_pw_multi_aff
*upma
);
45 __isl_give isl_schedule_node
*isl_schedule_node_domain_intersect_domain(
46 __isl_take isl_schedule_node
*node
, __isl_take isl_union_set
*domain
);