2 * Copyright 2011 INRIA Saclay
3 * Copyright 2012-2014 Ecole Normale Superieure
5 * Use of this software is governed by the MIT license
7 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
8 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
10 * and Ecole Normale Superieure, 45 rue d'Ulm, 75230 Paris, France
14 #include <isl_aff_private.h>
17 #include <isl/schedule.h>
18 #include <isl/schedule_node.h>
20 #include <isl_schedule_private.h>
21 #include <isl_schedule_tree.h>
22 #include <isl_schedule_node_private.h>
23 #include <isl_band_private.h>
25 /* Return a schedule encapsulating the given schedule tree.
27 * We currently only allow schedule trees with a domain as root.
29 * The leaf field is initialized as a leaf node so that it can be
30 * used to represent leaves in the constructed schedule.
31 * The reference count is set to -1 since the isl_schedule_tree
32 * should never be freed. It is up to the (internal) users of
33 * these leaves to ensure that they are only used while the schedule
36 __isl_give isl_schedule
*isl_schedule_from_schedule_tree(isl_ctx
*ctx
,
37 __isl_take isl_schedule_tree
*tree
)
39 isl_schedule
*schedule
;
43 if (isl_schedule_tree_get_type(tree
) != isl_schedule_node_domain
)
44 isl_die(isl_schedule_tree_get_ctx(tree
), isl_error_unsupported
,
45 "root of schedule tree should be a domain",
48 schedule
= isl_calloc_type(ctx
, isl_schedule
);
52 schedule
->leaf
.ctx
= ctx
;
55 schedule
->root
= tree
;
56 schedule
->leaf
.ref
= -1;
57 schedule
->leaf
.type
= isl_schedule_node_leaf
;
61 isl_schedule_tree_free(tree
);
65 /* Return a pointer to a schedule with as single node
66 * a domain node with the given domain.
68 __isl_give isl_schedule
*isl_schedule_from_domain(
69 __isl_take isl_union_set
*domain
)
72 isl_schedule_tree
*tree
;
74 ctx
= isl_union_set_get_ctx(domain
);
75 tree
= isl_schedule_tree_from_domain(domain
);
76 return isl_schedule_from_schedule_tree(ctx
, tree
);
79 /* Return a pointer to a schedule with as single node
80 * a domain node with an empty domain.
82 __isl_give isl_schedule
*isl_schedule_empty(__isl_take isl_space
*space
)
84 return isl_schedule_from_domain(isl_union_set_empty(space
));
87 /* Return a new reference to "sched".
89 __isl_give isl_schedule
*isl_schedule_copy(__isl_keep isl_schedule
*sched
)
98 /* Return an isl_schedule that is equal to "schedule" and that has only
101 * We only need and support this function when the schedule is represented
102 * as a schedule tree.
104 __isl_give isl_schedule
*isl_schedule_cow(__isl_take isl_schedule
*schedule
)
107 isl_schedule_tree
*tree
;
111 if (schedule
->ref
== 1)
114 ctx
= isl_schedule_get_ctx(schedule
);
116 isl_die(ctx
, isl_error_internal
,
117 "only for schedule tree based schedules",
118 return isl_schedule_free(schedule
));
120 tree
= isl_schedule_tree_copy(schedule
->root
);
121 return isl_schedule_from_schedule_tree(ctx
, tree
);
124 __isl_null isl_schedule
*isl_schedule_free(__isl_take isl_schedule
*sched
)
129 if (--sched
->ref
> 0)
132 isl_band_list_free(sched
->band_forest
);
133 isl_schedule_tree_free(sched
->root
);
134 isl_ctx_deref(sched
->leaf
.ctx
);
139 /* Replace the root of "schedule" by "tree".
141 __isl_give isl_schedule
*isl_schedule_set_root(
142 __isl_take isl_schedule
*schedule
, __isl_take isl_schedule_tree
*tree
)
144 if (!schedule
|| !tree
)
146 if (schedule
->root
== tree
) {
147 isl_schedule_tree_free(tree
);
151 schedule
= isl_schedule_cow(schedule
);
154 isl_schedule_tree_free(schedule
->root
);
155 schedule
->root
= tree
;
159 isl_schedule_free(schedule
);
160 isl_schedule_tree_free(tree
);
164 isl_ctx
*isl_schedule_get_ctx(__isl_keep isl_schedule
*schedule
)
166 return schedule
? schedule
->leaf
.ctx
: NULL
;
169 /* Return a pointer to the leaf of "schedule".
171 * Even though these leaves are not reference counted, we still
172 * indicate that this function does not return a copy.
174 __isl_keep isl_schedule_tree
*isl_schedule_peek_leaf(
175 __isl_keep isl_schedule
*schedule
)
177 return schedule
? &schedule
->leaf
: NULL
;
180 /* Are "schedule1" and "schedule2" obviously equal to each other?
182 int isl_schedule_plain_is_equal(__isl_keep isl_schedule
*schedule1
,
183 __isl_keep isl_schedule
*schedule2
)
185 if (!schedule1
|| !schedule2
)
187 if (schedule1
== schedule2
)
189 return isl_schedule_tree_plain_is_equal(schedule1
->root
,
193 /* Return the (parameter) space of the schedule, i.e., the space
194 * of the root domain.
196 __isl_give isl_space
*isl_schedule_get_space(
197 __isl_keep isl_schedule
*schedule
)
199 enum isl_schedule_node_type type
;
201 isl_union_set
*domain
;
206 isl_die(isl_schedule_get_ctx(schedule
), isl_error_invalid
,
207 "schedule tree representation not available",
209 type
= isl_schedule_tree_get_type(schedule
->root
);
210 if (type
!= isl_schedule_node_domain
)
211 isl_die(isl_schedule_get_ctx(schedule
), isl_error_internal
,
212 "root node not a domain node", return NULL
);
214 domain
= isl_schedule_tree_domain_get_domain(schedule
->root
);
215 space
= isl_union_set_get_space(domain
);
216 isl_union_set_free(domain
);
221 /* Return a pointer to the root of "schedule".
223 __isl_give isl_schedule_node
*isl_schedule_get_root(
224 __isl_keep isl_schedule
*schedule
)
227 isl_schedule_tree
*tree
;
228 isl_schedule_tree_list
*ancestors
;
234 isl_die(isl_schedule_get_ctx(schedule
), isl_error_invalid
,
235 "schedule tree representation not available",
238 ctx
= isl_schedule_get_ctx(schedule
);
239 tree
= isl_schedule_tree_copy(schedule
->root
);
240 schedule
= isl_schedule_copy(schedule
);
241 ancestors
= isl_schedule_tree_list_alloc(ctx
, 0);
242 return isl_schedule_node_alloc(schedule
, tree
, ancestors
, NULL
);
245 /* Set max_out to the maximal number of output dimensions over
248 static int update_max_out(__isl_take isl_map
*map
, void *user
)
251 int n_out
= isl_map_dim(map
, isl_dim_out
);
253 if (n_out
> *max_out
)
260 /* Internal data structure for map_pad_range.
262 * "max_out" is the maximal schedule dimension.
263 * "res" collects the results.
265 struct isl_pad_schedule_map_data
{
270 /* Pad the range of the given map with zeros to data->max_out and
271 * then add the result to data->res.
273 static int map_pad_range(__isl_take isl_map
*map
, void *user
)
275 struct isl_pad_schedule_map_data
*data
= user
;
277 int n_out
= isl_map_dim(map
, isl_dim_out
);
279 map
= isl_map_add_dims(map
, isl_dim_out
, data
->max_out
- n_out
);
280 for (i
= n_out
; i
< data
->max_out
; ++i
)
281 map
= isl_map_fix_si(map
, isl_dim_out
, i
, 0);
283 data
->res
= isl_union_map_add_map(data
->res
, map
);
290 /* Pad the ranges of the maps in the union map with zeros such they all have
291 * the same dimension.
293 static __isl_give isl_union_map
*pad_schedule_map(
294 __isl_take isl_union_map
*umap
)
296 struct isl_pad_schedule_map_data data
;
300 if (isl_union_map_n_map(umap
) <= 1)
304 if (isl_union_map_foreach_map(umap
, &update_max_out
, &data
.max_out
) < 0)
305 return isl_union_map_free(umap
);
307 data
.res
= isl_union_map_empty(isl_union_map_get_space(umap
));
308 if (isl_union_map_foreach_map(umap
, &map_pad_range
, &data
) < 0)
309 data
.res
= isl_union_map_free(data
.res
);
311 isl_union_map_free(umap
);
315 /* Return the domain of the root domain node of "schedule".
317 __isl_give isl_union_set
*isl_schedule_get_domain(
318 __isl_keep isl_schedule
*schedule
)
323 isl_die(isl_schedule_get_ctx(schedule
), isl_error_invalid
,
324 "schedule tree representation not available",
326 return isl_schedule_tree_domain_get_domain(schedule
->root
);
329 /* Traverse all nodes of "sched" in depth first preorder.
331 * If "fn" returns -1 on any of the nodes, then the traversal is aborted.
332 * If "fn" returns 0 on any of the nodes, then the subtree rooted
333 * at that node is skipped.
335 * Return 0 on success and -1 on failure.
337 int isl_schedule_foreach_schedule_node(__isl_keep isl_schedule
*sched
,
338 int (*fn
)(__isl_keep isl_schedule_node
*node
, void *user
), void *user
)
340 isl_schedule_node
*node
;
346 node
= isl_schedule_get_root(sched
);
347 r
= isl_schedule_node_foreach_descendant(node
, fn
, user
);
348 isl_schedule_node_free(node
);
353 /* Traverse the node of "sched" in depth first postorder,
354 * allowing the user to modify the visited node.
355 * The traversal continues from the node returned by the callback function.
356 * It is the responsibility of the user to ensure that this does not
357 * lead to an infinite loop. It is safest to always return a pointer
358 * to the same position (same ancestors and child positions) as the input node.
360 __isl_give isl_schedule
*isl_schedule_map_schedule_node(
361 __isl_take isl_schedule
*schedule
,
362 __isl_give isl_schedule_node
*(*fn
)(
363 __isl_take isl_schedule_node
*node
, void *user
), void *user
)
365 isl_schedule_node
*node
;
367 node
= isl_schedule_get_root(schedule
);
368 isl_schedule_free(schedule
);
370 node
= isl_schedule_node_map_descendant(node
, fn
, user
);
371 schedule
= isl_schedule_node_get_schedule(node
);
372 isl_schedule_node_free(node
);
377 /* Return an isl_union_map representation of the schedule.
378 * If we still have access to the schedule tree, then we return
379 * an isl_union_map corresponding to the subtree schedule of the child
380 * of the root domain node. That is, we do not intersect the domain
381 * of the returned isl_union_map with the domain constraints.
382 * Otherwise, we must have removed it because we created a band forest.
383 * If so, we extract the isl_union_map from the forest.
384 * This reconstructed schedule map
385 * then needs to be padded with zeros to unify the schedule space
386 * since the result of isl_band_list_get_suffix_schedule may not have
387 * a unified schedule space.
389 __isl_give isl_union_map
*isl_schedule_get_map(__isl_keep isl_schedule
*sched
)
391 enum isl_schedule_node_type type
;
392 isl_schedule_node
*node
;
399 type
= isl_schedule_tree_get_type(sched
->root
);
400 if (type
!= isl_schedule_node_domain
)
401 isl_die(isl_schedule_get_ctx(sched
), isl_error_internal
,
402 "root node not a domain node", return NULL
);
404 node
= isl_schedule_get_root(sched
);
405 node
= isl_schedule_node_child(node
, 0);
406 umap
= isl_schedule_node_get_subtree_schedule_union_map(node
);
407 isl_schedule_node_free(node
);
412 umap
= isl_band_list_get_suffix_schedule(sched
->band_forest
);
413 return pad_schedule_map(umap
);
416 static __isl_give isl_band_list
*construct_band_list(
417 __isl_take isl_schedule_node
*node
, __isl_take isl_union_set
*domain
,
418 __isl_keep isl_band
*parent
);
420 /* Construct an isl_band structure from the given schedule tree node,
421 * which may be either a band node or a leaf node.
422 * In the latter case, construct a zero-dimensional band.
423 * "domain" is the universe set of the domain elements that reach "node".
424 * "parent" is the parent isl_band of the isl_band constructed
427 * In case of a band node, we copy the properties (except tilability,
428 * which is implicit in an isl_band) to the isl_band.
429 * We assume that the band node is not zero-dimensional.
430 * If the child of the band node is not a leaf node,
431 * then we extract the children of the isl_band from this child.
433 static __isl_give isl_band
*construct_band(__isl_take isl_schedule_node
*node
,
434 __isl_take isl_union_set
*domain
, __isl_keep isl_band
*parent
)
438 isl_band
*band
= NULL
;
439 isl_multi_union_pw_aff
*mupa
;
441 if (!node
|| !domain
)
444 ctx
= isl_schedule_node_get_ctx(node
);
445 band
= isl_band_alloc(ctx
);
449 band
->schedule
= node
->schedule
;
450 band
->parent
= parent
;
452 if (isl_schedule_node_get_type(node
) == isl_schedule_node_leaf
) {
454 band
->pma
= isl_union_pw_multi_aff_from_domain(domain
);
455 isl_schedule_node_free(node
);
459 band
->n
= isl_schedule_node_band_n_member(node
);
461 isl_die(ctx
, isl_error_unsupported
,
462 "zero-dimensional band nodes not supported",
464 band
->coincident
= isl_alloc_array(ctx
, int, band
->n
);
465 if (band
->n
&& !band
->coincident
)
467 for (i
= 0; i
< band
->n
; ++i
)
468 band
->coincident
[i
] =
469 isl_schedule_node_band_member_get_coincident(node
, i
);
470 mupa
= isl_schedule_node_band_get_partial_schedule(node
);
471 band
->pma
= isl_union_pw_multi_aff_from_multi_union_pw_aff(mupa
);
475 node
= isl_schedule_node_child(node
, 0);
476 if (isl_schedule_node_get_type(node
) == isl_schedule_node_leaf
) {
477 isl_schedule_node_free(node
);
478 isl_union_set_free(domain
);
482 band
->children
= construct_band_list(node
, domain
, band
);
484 return isl_band_free(band
);
488 isl_union_set_free(domain
);
489 isl_schedule_node_free(node
);
494 /* Construct a list of isl_band structures from the children of "node".
495 * "node" itself is a sequence or set node, so that each of the child nodes
496 * is a filter node and the list returned by node_construct_band_list
497 * consists of a single element.
498 * "domain" is the universe set of the domain elements that reach "node".
499 * "parent" is the parent isl_band of the isl_band structures constructed
502 static __isl_give isl_band_list
*construct_band_list_from_children(
503 __isl_take isl_schedule_node
*node
, __isl_take isl_union_set
*domain
,
504 __isl_keep isl_band
*parent
)
510 n
= isl_schedule_node_n_children(node
);
512 ctx
= isl_schedule_node_get_ctx(node
);
513 list
= isl_band_list_alloc(ctx
, 0);
514 for (i
= 0; i
< n
; ++i
) {
515 isl_schedule_node
*child
;
516 isl_band_list
*list_i
;
518 child
= isl_schedule_node_get_child(node
, i
);
519 list_i
= construct_band_list(child
, isl_union_set_copy(domain
),
521 list
= isl_band_list_concat(list
, list_i
);
524 isl_union_set_free(domain
);
525 isl_schedule_node_free(node
);
530 /* Construct an isl_band structure from the given sequence node
531 * (or set node that is treated as a sequence node).
532 * A single-dimensional band is created with as schedule for each of
533 * filters of the children, the corresponding child position.
534 * "domain" is the universe set of the domain elements that reach "node".
535 * "parent" is the parent isl_band of the isl_band constructed
538 static __isl_give isl_band_list
*construct_band_list_sequence(
539 __isl_take isl_schedule_node
*node
, __isl_take isl_union_set
*domain
,
540 __isl_keep isl_band
*parent
)
544 isl_band
*band
= NULL
;
546 isl_union_pw_multi_aff
*upma
;
548 if (!node
|| !domain
)
551 ctx
= isl_schedule_node_get_ctx(node
);
552 band
= isl_band_alloc(ctx
);
556 band
->schedule
= node
->schedule
;
557 band
->parent
= parent
;
559 band
->coincident
= isl_calloc_array(ctx
, int, band
->n
);
560 if (!band
->coincident
)
563 n
= isl_schedule_node_n_children(node
);
564 space
= isl_union_set_get_space(domain
);
565 upma
= isl_union_pw_multi_aff_empty(isl_space_copy(space
));
567 space
= isl_space_set_from_params(space
);
568 space
= isl_space_add_dims(space
, isl_dim_set
, 1);
570 for (i
= 0; i
< n
; ++i
) {
571 isl_schedule_node
*child
;
572 isl_union_set
*filter
;
576 isl_union_pw_multi_aff
*upma_i
;
578 child
= isl_schedule_node_get_child(node
, i
);
579 filter
= isl_schedule_node_filter_get_filter(child
);
580 isl_schedule_node_free(child
);
581 filter
= isl_union_set_intersect(filter
,
582 isl_union_set_copy(domain
));
583 v
= isl_val_int_from_si(ctx
, i
);
584 vl
= isl_val_list_from_val(v
);
585 mv
= isl_multi_val_from_val_list(isl_space_copy(space
), vl
);
586 upma_i
= isl_union_pw_multi_aff_multi_val_on_domain(filter
, mv
);
587 upma
= isl_union_pw_multi_aff_union_add(upma
, upma_i
);
590 isl_space_free(space
);
596 band
->children
= construct_band_list_from_children(node
, domain
, band
);
598 band
= isl_band_free(band
);
599 return isl_band_list_from_band(band
);
601 isl_union_set_free(domain
);
602 isl_schedule_node_free(node
);
607 /* Construct a list of isl_band structures from "node" depending
608 * on the type of "node".
609 * "domain" is the universe set of the domain elements that reach "node".
610 * "parent" is the parent isl_band of the isl_band structures constructed
613 * If schedule_separate_components is set then set nodes are treated
614 * as sequence nodes. Otherwise, we directly extract an (implicitly
615 * parallel) list of isl_band structures.
617 * If "node" is a filter, then "domain" is updated by the filter.
619 static __isl_give isl_band_list
*construct_band_list(
620 __isl_take isl_schedule_node
*node
, __isl_take isl_union_set
*domain
,
621 __isl_keep isl_band
*parent
)
623 enum isl_schedule_node_type type
;
627 isl_union_set
*filter
;
629 if (!node
|| !domain
)
632 type
= isl_schedule_node_get_type(node
);
634 case isl_schedule_node_error
:
636 case isl_schedule_node_domain
:
637 isl_die(isl_schedule_node_get_ctx(node
), isl_error_invalid
,
638 "internal domain nodes not allowed", goto error
);
639 case isl_schedule_node_filter
:
640 filter
= isl_schedule_node_filter_get_filter(node
);
641 domain
= isl_union_set_intersect(domain
, filter
);
642 node
= isl_schedule_node_child(node
, 0);
643 return construct_band_list(node
, domain
, parent
);
644 case isl_schedule_node_set
:
645 ctx
= isl_schedule_node_get_ctx(node
);
646 if (isl_options_get_schedule_separate_components(ctx
))
647 return construct_band_list_sequence(node
, domain
,
650 return construct_band_list_from_children(node
, domain
,
652 case isl_schedule_node_sequence
:
653 return construct_band_list_sequence(node
, domain
, parent
);
654 case isl_schedule_node_leaf
:
655 case isl_schedule_node_band
:
656 band
= construct_band(node
, domain
, parent
);
657 list
= isl_band_list_from_band(band
);
663 isl_union_set_free(domain
);
664 isl_schedule_node_free(node
);
668 /* Return the roots of a band forest representation of the schedule.
669 * The band forest is constructed from the schedule tree,
670 * but once such a band forest is
671 * constructed, we forget about the original schedule tree since
672 * the user may modify the schedule through the band forest.
674 __isl_give isl_band_list
*isl_schedule_get_band_forest(
675 __isl_keep isl_schedule
*schedule
)
677 isl_schedule_node
*node
;
678 isl_union_set
*domain
;
682 if (schedule
->root
) {
683 node
= isl_schedule_get_root(schedule
);
684 domain
= isl_schedule_node_domain_get_domain(node
);
685 domain
= isl_union_set_universe(domain
);
686 node
= isl_schedule_node_child(node
, 0);
688 schedule
->band_forest
= construct_band_list(node
, domain
, NULL
);
689 schedule
->root
= isl_schedule_tree_free(schedule
->root
);
691 return isl_band_list_dup(schedule
->band_forest
);
694 /* Call "fn" on each band in the schedule in depth-first post-order.
696 int isl_schedule_foreach_band(__isl_keep isl_schedule
*sched
,
697 int (*fn
)(__isl_keep isl_band
*band
, void *user
), void *user
)
700 isl_band_list
*forest
;
705 forest
= isl_schedule_get_band_forest(sched
);
706 r
= isl_band_list_foreach_band(forest
, fn
, user
);
707 isl_band_list_free(forest
);
712 static __isl_give isl_printer
*print_band_list(__isl_take isl_printer
*p
,
713 __isl_keep isl_band_list
*list
);
715 static __isl_give isl_printer
*print_band(__isl_take isl_printer
*p
,
716 __isl_keep isl_band
*band
)
718 isl_band_list
*children
;
720 p
= isl_printer_start_line(p
);
721 p
= isl_printer_print_union_pw_multi_aff(p
, band
->pma
);
722 p
= isl_printer_end_line(p
);
724 if (!isl_band_has_children(band
))
727 children
= isl_band_get_children(band
);
729 p
= isl_printer_indent(p
, 4);
730 p
= print_band_list(p
, children
);
731 p
= isl_printer_indent(p
, -4);
733 isl_band_list_free(children
);
738 static __isl_give isl_printer
*print_band_list(__isl_take isl_printer
*p
,
739 __isl_keep isl_band_list
*list
)
743 n
= isl_band_list_n_band(list
);
744 for (i
= 0; i
< n
; ++i
) {
746 band
= isl_band_list_get_band(list
, i
);
747 p
= print_band(p
, band
);
754 /* Insert a band node with partial schedule "partial" between the domain
755 * root node of "schedule" and its single child.
756 * Return a pointer to the updated schedule.
758 __isl_give isl_schedule
*isl_schedule_insert_partial_schedule(
759 __isl_take isl_schedule
*schedule
,
760 __isl_take isl_multi_union_pw_aff
*partial
)
762 isl_schedule_node
*node
;
764 node
= isl_schedule_get_root(schedule
);
765 isl_schedule_free(schedule
);
768 if (isl_schedule_node_get_type(node
) != isl_schedule_node_domain
)
769 isl_die(isl_schedule_node_get_ctx(node
), isl_error_internal
,
770 "root node not a domain node", goto error
);
772 node
= isl_schedule_node_child(node
, 0);
773 node
= isl_schedule_node_insert_partial_schedule(node
, partial
);
775 schedule
= isl_schedule_node_get_schedule(node
);
776 isl_schedule_node_free(node
);
780 isl_schedule_node_free(node
);
781 isl_multi_union_pw_aff_free(partial
);
785 /* Return a tree with as top-level node a filter corresponding to "filter" and
786 * as child, the (single) child of "tree".
787 * However, if this single child is of type "type", then the filter is inserted
788 * in the children of this single child instead.
790 static __isl_give isl_schedule_tree
*insert_filter_in_child_of_type(
791 __isl_take isl_schedule_tree
*tree
, __isl_take isl_union_set
*filter
,
792 enum isl_schedule_node_type type
)
794 if (!isl_schedule_tree_has_children(tree
)) {
795 isl_schedule_tree_free(tree
);
796 return isl_schedule_tree_from_filter(filter
);
798 tree
= isl_schedule_tree_child(tree
, 0);
801 if (isl_schedule_tree_get_type(tree
) == type
)
802 tree
= isl_schedule_tree_children_insert_filter(tree
, filter
);
804 tree
= isl_schedule_tree_insert_filter(tree
, filter
);
809 /* Construct a schedule that combines the schedules "schedule1" and "schedule2"
810 * with a top-level node (underneath the domain node) of type "type",
811 * either isl_schedule_node_sequence or isl_schedule_node_set.
812 * The domains of the two schedules are assumed to be disjoint.
814 * The new schedule has as domain the union of the domains of the two
815 * schedules. The child of the domain node is a node of type "type"
816 * with two filters corresponding to the domains of the input schedules.
817 * If one (or both) of the top-level nodes of the two schedules is itself
818 * of type "type", then the filter is pushed into the children of that
819 * node and the sequence of set is flattened.
821 __isl_give isl_schedule
*isl_schedule_pair(enum isl_schedule_node_type type
,
822 __isl_take isl_schedule
*schedule1
, __isl_take isl_schedule
*schedule2
)
826 enum isl_schedule_node_type root_type
;
827 isl_schedule_tree
*tree1
, *tree2
;
828 isl_union_set
*filter1
, *filter2
, *domain
;
830 if (!schedule1
|| !schedule2
)
833 root_type
= isl_schedule_tree_get_type(schedule1
->root
);
834 if (root_type
!= isl_schedule_node_domain
)
835 isl_die(isl_schedule_get_ctx(schedule1
), isl_error_internal
,
836 "root node not a domain node", goto error
);
837 root_type
= isl_schedule_tree_get_type(schedule2
->root
);
838 if (root_type
!= isl_schedule_node_domain
)
839 isl_die(isl_schedule_get_ctx(schedule1
), isl_error_internal
,
840 "root node not a domain node", goto error
);
842 ctx
= isl_schedule_get_ctx(schedule1
);
843 tree1
= isl_schedule_tree_copy(schedule1
->root
);
844 filter1
= isl_schedule_tree_domain_get_domain(tree1
);
845 tree2
= isl_schedule_tree_copy(schedule2
->root
);
846 filter2
= isl_schedule_tree_domain_get_domain(tree2
);
848 isl_schedule_free(schedule1
);
849 isl_schedule_free(schedule2
);
851 disjoint
= isl_union_set_is_disjoint(filter1
, filter2
);
853 filter1
= isl_union_set_free(filter1
);
855 isl_die(ctx
, isl_error_invalid
,
856 "schedule domains not disjoint",
857 filter1
= isl_union_set_free(filter1
));
859 domain
= isl_union_set_union(isl_union_set_copy(filter1
),
860 isl_union_set_copy(filter2
));
861 filter1
= isl_union_set_gist(filter1
, isl_union_set_copy(domain
));
862 filter2
= isl_union_set_gist(filter2
, isl_union_set_copy(domain
));
864 tree1
= insert_filter_in_child_of_type(tree1
, filter1
, type
);
865 tree2
= insert_filter_in_child_of_type(tree2
, filter2
, type
);
867 tree1
= isl_schedule_tree_from_pair(type
, tree1
, tree2
);
868 tree1
= isl_schedule_tree_insert_domain(tree1
, domain
);
870 return isl_schedule_from_schedule_tree(ctx
, tree1
);
872 isl_schedule_free(schedule1
);
873 isl_schedule_free(schedule2
);
877 /* Construct a schedule that combines the schedules "schedule1" and "schedule2"
878 * through a sequence node.
879 * The domains of the input schedules are assumed to be disjoint.
881 __isl_give isl_schedule
*isl_schedule_sequence(
882 __isl_take isl_schedule
*schedule1
, __isl_take isl_schedule
*schedule2
)
884 return isl_schedule_pair(isl_schedule_node_sequence
,
885 schedule1
, schedule2
);
888 /* Construct a schedule that combines the schedules "schedule1" and "schedule2"
889 * through a set node.
890 * The domains of the input schedules are assumed to be disjoint.
892 __isl_give isl_schedule
*isl_schedule_set(
893 __isl_take isl_schedule
*schedule1
, __isl_take isl_schedule
*schedule2
)
895 return isl_schedule_pair(isl_schedule_node_set
, schedule1
, schedule2
);
898 /* Print "schedule" to "p".
900 * If "schedule" was created from a schedule tree, then we print
901 * the schedule tree representation. Otherwise, we print
902 * the band forest representation.
904 __isl_give isl_printer
*isl_printer_print_schedule(__isl_take isl_printer
*p
,
905 __isl_keep isl_schedule
*schedule
)
907 isl_band_list
*forest
;
910 return isl_printer_free(p
);
913 return isl_printer_print_schedule_tree(p
, schedule
->root
);
915 forest
= isl_schedule_get_band_forest(schedule
);
917 p
= print_band_list(p
, forest
);
919 isl_band_list_free(forest
);
924 void isl_schedule_dump(__isl_keep isl_schedule
*schedule
)
926 isl_printer
*printer
;
931 printer
= isl_printer_to_file(isl_schedule_get_ctx(schedule
), stderr
);
932 printer
= isl_printer_set_yaml_style(printer
, ISL_YAML_STYLE_BLOCK
);
933 printer
= isl_printer_print_schedule(printer
, schedule
);
935 isl_printer_free(printer
);