2 * Copyright 2012 Ecole Normale Superieure
4 * Use of this software is governed by the MIT license
6 * Written by Sven Verdoolaege,
7 * Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
13 #include <isl_ast_build_private.h>
14 #include <isl_ast_private.h>
16 /* Construct a map that isolates the current dimension.
18 * Essentially, the current dimension of "set" is moved to the single output
19 * dimension in the result, with the current dimension in the domain replaced
20 * by an unconstrained variable.
22 __isl_give isl_map
*isl_ast_build_map_to_iterator(
23 __isl_keep isl_ast_build
*build
, __isl_take isl_set
*set
)
27 map
= isl_map_from_domain(set
);
28 map
= isl_map_add_dims(map
, isl_dim_out
, 1);
31 return isl_map_free(map
);
33 map
= isl_map_equate(map
, isl_dim_in
, build
->depth
, isl_dim_out
, 0);
34 map
= isl_map_eliminate(map
, isl_dim_in
, build
->depth
, 1);
39 /* Initialize the information derived during the AST generation to default
40 * values for a schedule domain in "space".
42 * We also check that the remaining fields are not NULL so that
43 * the calling functions don't have to perform this test.
45 static __isl_give isl_ast_build
*isl_ast_build_init_derived(
46 __isl_take isl_ast_build
*build
, __isl_take isl_space
*space
)
51 build
= isl_ast_build_cow(build
);
52 if (!build
|| !build
->domain
)
55 ctx
= isl_ast_build_get_ctx(build
);
56 strides
= isl_vec_alloc(ctx
, isl_space_dim(space
, isl_dim_set
));
57 strides
= isl_vec_set_si(strides
, 1);
59 isl_vec_free(build
->strides
);
60 build
->strides
= strides
;
62 space
= isl_space_map_from_set(space
);
63 isl_multi_aff_free(build
->offsets
);
64 build
->offsets
= isl_multi_aff_zero(isl_space_copy(space
));
65 isl_multi_aff_free(build
->values
);
66 build
->values
= isl_multi_aff_identity(space
);
68 if (!build
->iterators
|| !build
->domain
|| !build
->generated
||
69 !build
->pending
|| !build
->values
||
70 !build
->strides
|| !build
->offsets
|| !build
->options
)
71 return isl_ast_build_free(build
);
75 isl_space_free(space
);
76 return isl_ast_build_free(build
);
79 /* Return an isl_id called "c%d", with "%d" set to "i".
80 * If an isl_id with such a name already appears among the parameters
81 * in build->domain, then adjust the name to "c%d_%d".
83 static __isl_give isl_id
*generate_name(isl_ctx
*ctx
, int i
,
84 __isl_keep isl_ast_build
*build
)
88 isl_set
*dom
= build
->domain
;
90 snprintf(name
, sizeof(name
), "c%d", i
);
92 while (isl_set_find_dim_by_name(dom
, isl_dim_param
, name
) >= 0)
93 snprintf(name
, sizeof(name
), "c%d_%d", i
, j
++);
94 return isl_id_alloc(ctx
, name
, NULL
);
97 /* Create an isl_ast_build with "set" as domain.
99 * The input set is usually a parameter domain, but we currently allow it to
100 * be any kind of set. We set the domain of the returned isl_ast_build
101 * to "set" and initialize all the other field to default values.
103 __isl_give isl_ast_build
*isl_ast_build_from_context(__isl_take isl_set
*set
)
108 isl_ast_build
*build
;
110 set
= isl_set_compute_divs(set
);
114 ctx
= isl_set_get_ctx(set
);
116 build
= isl_calloc_type(ctx
, isl_ast_build
);
122 build
->generated
= isl_set_copy(build
->domain
);
123 build
->pending
= isl_set_universe(isl_set_get_space(build
->domain
));
124 build
->options
= isl_union_map_empty(isl_space_params_alloc(ctx
, 0));
125 n
= isl_set_dim(set
, isl_dim_set
);
127 build
->iterators
= isl_id_list_alloc(ctx
, n
);
128 for (i
= 0; i
< n
; ++i
) {
130 if (isl_set_has_dim_id(set
, isl_dim_set
, i
))
131 id
= isl_set_get_dim_id(set
, isl_dim_set
, i
);
133 id
= generate_name(ctx
, i
, build
);
134 build
->iterators
= isl_id_list_add(build
->iterators
, id
);
136 space
= isl_set_get_space(set
);
137 if (isl_space_is_params(space
))
138 space
= isl_space_set_from_params(space
);
140 return isl_ast_build_init_derived(build
, space
);
146 __isl_give isl_ast_build
*isl_ast_build_copy(__isl_keep isl_ast_build
*build
)
155 __isl_give isl_ast_build
*isl_ast_build_dup(__isl_keep isl_ast_build
*build
)
163 ctx
= isl_ast_build_get_ctx(build
);
164 dup
= isl_calloc_type(ctx
, isl_ast_build
);
169 dup
->outer_pos
= build
->outer_pos
;
170 dup
->depth
= build
->depth
;
171 dup
->iterators
= isl_id_list_copy(build
->iterators
);
172 dup
->domain
= isl_set_copy(build
->domain
);
173 dup
->generated
= isl_set_copy(build
->generated
);
174 dup
->pending
= isl_set_copy(build
->pending
);
175 dup
->values
= isl_multi_aff_copy(build
->values
);
176 dup
->value
= isl_pw_aff_copy(build
->value
);
177 dup
->strides
= isl_vec_copy(build
->strides
);
178 dup
->offsets
= isl_multi_aff_copy(build
->offsets
);
179 dup
->executed
= isl_union_map_copy(build
->executed
);
180 dup
->single_valued
= build
->single_valued
;
181 dup
->options
= isl_union_map_copy(build
->options
);
182 dup
->at_each_domain
= build
->at_each_domain
;
183 dup
->at_each_domain_user
= build
->at_each_domain_user
;
184 dup
->before_each_for
= build
->before_each_for
;
185 dup
->before_each_for_user
= build
->before_each_for_user
;
186 dup
->after_each_for
= build
->after_each_for
;
187 dup
->after_each_for_user
= build
->after_each_for_user
;
188 dup
->create_leaf
= build
->create_leaf
;
189 dup
->create_leaf_user
= build
->create_leaf_user
;
191 if (!dup
->iterators
|| !dup
->domain
|| !dup
->generated
||
192 !dup
->pending
|| !dup
->values
||
193 !dup
->strides
|| !dup
->offsets
|| !dup
->options
||
194 (build
->executed
&& !dup
->executed
) ||
195 (build
->value
&& !dup
->value
))
196 return isl_ast_build_free(dup
);
201 /* Align the parameters of "build" to those of "model", introducing
202 * additional parameters if needed.
204 __isl_give isl_ast_build
*isl_ast_build_align_params(
205 __isl_take isl_ast_build
*build
, __isl_take isl_space
*model
)
207 build
= isl_ast_build_cow(build
);
211 build
->domain
= isl_set_align_params(build
->domain
,
212 isl_space_copy(model
));
213 build
->generated
= isl_set_align_params(build
->generated
,
214 isl_space_copy(model
));
215 build
->pending
= isl_set_align_params(build
->pending
,
216 isl_space_copy(model
));
217 build
->values
= isl_multi_aff_align_params(build
->values
,
218 isl_space_copy(model
));
219 build
->offsets
= isl_multi_aff_align_params(build
->offsets
,
220 isl_space_copy(model
));
221 build
->options
= isl_union_map_align_params(build
->options
,
222 isl_space_copy(model
));
223 isl_space_free(model
);
225 if (!build
->domain
|| !build
->values
|| !build
->offsets
||
227 return isl_ast_build_free(build
);
231 isl_space_free(model
);
235 __isl_give isl_ast_build
*isl_ast_build_cow(__isl_take isl_ast_build
*build
)
243 return isl_ast_build_dup(build
);
246 void *isl_ast_build_free(__isl_take isl_ast_build
*build
)
251 if (--build
->ref
> 0)
254 isl_id_list_free(build
->iterators
);
255 isl_set_free(build
->domain
);
256 isl_set_free(build
->generated
);
257 isl_set_free(build
->pending
);
258 isl_multi_aff_free(build
->values
);
259 isl_pw_aff_free(build
->value
);
260 isl_vec_free(build
->strides
);
261 isl_multi_aff_free(build
->offsets
);
262 isl_multi_aff_free(build
->schedule_map
);
263 isl_union_map_free(build
->executed
);
264 isl_union_map_free(build
->options
);
271 isl_ctx
*isl_ast_build_get_ctx(__isl_keep isl_ast_build
*build
)
273 return build
? isl_set_get_ctx(build
->domain
) : NULL
;
276 /* Replace build->options by "options".
278 __isl_give isl_ast_build
*isl_ast_build_set_options(
279 __isl_take isl_ast_build
*build
, __isl_take isl_union_map
*options
)
281 build
= isl_ast_build_cow(build
);
283 if (!build
|| !options
)
286 isl_union_map_free(build
->options
);
287 build
->options
= options
;
291 isl_union_map_free(options
);
292 return isl_ast_build_free(build
);
295 /* Set the iterators for the next code generation.
297 * If we still have some iterators left from the previous code generation
298 * (if any) or if iterators have already been set by a previous
299 * call to this function, then we remove them first.
301 __isl_give isl_ast_build
*isl_ast_build_set_iterators(
302 __isl_take isl_ast_build
*build
, __isl_take isl_id_list
*iterators
)
306 build
= isl_ast_build_cow(build
);
310 dim
= isl_set_dim(build
->domain
, isl_dim_set
);
311 n_it
= isl_id_list_n_id(build
->iterators
);
313 isl_die(isl_ast_build_get_ctx(build
), isl_error_internal
,
314 "isl_ast_build in inconsistent state", goto error
);
316 build
->iterators
= isl_id_list_drop(build
->iterators
,
318 build
->iterators
= isl_id_list_concat(build
->iterators
, iterators
);
319 if (!build
->iterators
)
320 return isl_ast_build_free(build
);
324 isl_id_list_free(iterators
);
325 return isl_ast_build_free(build
);
328 /* Set the "at_each_domain" callback of "build" to "fn".
330 __isl_give isl_ast_build
*isl_ast_build_set_at_each_domain(
331 __isl_take isl_ast_build
*build
,
332 __isl_give isl_ast_node
*(*fn
)(__isl_take isl_ast_node
*node
,
333 __isl_keep isl_ast_build
*build
, void *user
), void *user
)
335 build
= isl_ast_build_cow(build
);
340 build
->at_each_domain
= fn
;
341 build
->at_each_domain_user
= user
;
346 /* Set the "before_each_for" callback of "build" to "fn".
348 __isl_give isl_ast_build
*isl_ast_build_set_before_each_for(
349 __isl_take isl_ast_build
*build
,
350 __isl_give isl_id
*(*fn
)(__isl_keep isl_ast_build
*build
,
351 void *user
), void *user
)
353 build
= isl_ast_build_cow(build
);
358 build
->before_each_for
= fn
;
359 build
->before_each_for_user
= user
;
364 /* Set the "after_each_for" callback of "build" to "fn".
366 __isl_give isl_ast_build
*isl_ast_build_set_after_each_for(
367 __isl_take isl_ast_build
*build
,
368 __isl_give isl_ast_node
*(*fn
)(__isl_take isl_ast_node
*node
,
369 __isl_keep isl_ast_build
*build
, void *user
), void *user
)
371 build
= isl_ast_build_cow(build
);
376 build
->after_each_for
= fn
;
377 build
->after_each_for_user
= user
;
382 /* Set the "create_leaf" callback of "build" to "fn".
384 __isl_give isl_ast_build
*isl_ast_build_set_create_leaf(
385 __isl_take isl_ast_build
*build
,
386 __isl_give isl_ast_node
*(*fn
)(__isl_take isl_ast_build
*build
,
387 void *user
), void *user
)
389 build
= isl_ast_build_cow(build
);
394 build
->create_leaf
= fn
;
395 build
->create_leaf_user
= user
;
400 /* Clear all information that is specific to this code generation
401 * and that is (probably) not meaningful to any nested code generation.
403 __isl_give isl_ast_build
*isl_ast_build_clear_local_info(
404 __isl_take isl_ast_build
*build
)
408 build
= isl_ast_build_cow(build
);
412 space
= isl_union_map_get_space(build
->options
);
413 isl_union_map_free(build
->options
);
414 build
->options
= isl_union_map_empty(space
);
416 build
->at_each_domain
= NULL
;
417 build
->at_each_domain_user
= NULL
;
418 build
->before_each_for
= NULL
;
419 build
->before_each_for_user
= NULL
;
420 build
->after_each_for
= NULL
;
421 build
->after_each_for_user
= NULL
;
422 build
->create_leaf
= NULL
;
423 build
->create_leaf_user
= NULL
;
426 return isl_ast_build_free(build
);
431 /* Have any loops been eliminated?
432 * That is, do any of the original schedule dimensions have a fixed
433 * value that has been substituted?
435 static int any_eliminated(isl_ast_build
*build
)
439 for (i
= 0; i
< build
->depth
; ++i
)
440 if (isl_ast_build_has_affine_value(build
, i
))
446 /* Clear build->schedule_map.
447 * This function should be called whenever anything that might affect
448 * the result of isl_ast_build_get_schedule_map_multi_aff changes.
449 * In particular, it should be called when the depth is changed or
450 * when an iterator is determined to have a fixed value.
452 static void isl_ast_build_reset_schedule_map(__isl_keep isl_ast_build
*build
)
456 isl_multi_aff_free(build
->schedule_map
);
457 build
->schedule_map
= NULL
;
460 /* Do we need a (non-trivial) schedule map?
461 * That is, is the internal schedule space different from
462 * the external schedule space?
464 * The internal and external schedule spaces are only the same
465 * if code has been generated for the entire schedule and if none
466 * of the loops have been eliminated.
468 __isl_give
int isl_ast_build_need_schedule_map(__isl_keep isl_ast_build
*build
)
475 dim
= isl_set_dim(build
->domain
, isl_dim_set
);
476 return build
->depth
!= dim
|| any_eliminated(build
);
479 /* Return a mapping from the internal schedule space to the external
480 * schedule space in the form of an isl_multi_aff.
481 * The internal schedule space originally corresponds to that of the
482 * input schedule. This may change during the code generation if
483 * if isl_ast_build_insert_dim is ever called.
484 * The external schedule space corresponds to the
485 * loops that have been generated.
487 * Currently, the only difference between the internal schedule domain
488 * and the external schedule domain is that some dimensions are projected
489 * out in the external schedule domain. In particular, the dimensions
490 * for which no code has been generated yet and the dimensions that correspond
491 * to eliminated loops.
493 * We cache a copy of the schedule_map in build->schedule_map.
494 * The cache is cleared through isl_ast_build_reset_schedule_map
495 * whenever anything changes that might affect the result of this function.
497 __isl_give isl_multi_aff
*isl_ast_build_get_schedule_map_multi_aff(
498 __isl_keep isl_ast_build
*build
)
505 if (build
->schedule_map
)
506 return isl_multi_aff_copy(build
->schedule_map
);
508 space
= isl_ast_build_get_space(build
, 1);
509 space
= isl_space_map_from_set(space
);
510 ma
= isl_multi_aff_identity(space
);
511 if (isl_ast_build_need_schedule_map(build
)) {
513 int dim
= isl_set_dim(build
->domain
, isl_dim_set
);
514 ma
= isl_multi_aff_drop_dims(ma
, isl_dim_out
,
515 build
->depth
, dim
- build
->depth
);
516 for (i
= build
->depth
- 1; i
>= 0; --i
)
517 if (isl_ast_build_has_affine_value(build
, i
))
518 ma
= isl_multi_aff_drop_dims(ma
,
522 build
->schedule_map
= ma
;
523 return isl_multi_aff_copy(build
->schedule_map
);
526 /* Return a mapping from the internal schedule space to the external
527 * schedule space in the form of an isl_map.
529 __isl_give isl_map
*isl_ast_build_get_schedule_map(
530 __isl_keep isl_ast_build
*build
)
534 ma
= isl_ast_build_get_schedule_map_multi_aff(build
);
535 return isl_map_from_multi_aff(ma
);
538 /* Return the position of the dimension in build->domain for which
539 * an AST node is currently being generated.
541 int isl_ast_build_get_depth(__isl_keep isl_ast_build
*build
)
543 return build
? build
->depth
: -1;
546 /* Prepare for generating code for the next level.
547 * In particular, increase the depth and reset any information
548 * that is local to the current depth.
550 __isl_give isl_ast_build
*isl_ast_build_increase_depth(
551 __isl_take isl_ast_build
*build
)
553 build
= isl_ast_build_cow(build
);
557 isl_ast_build_reset_schedule_map(build
);
558 build
->value
= isl_pw_aff_free(build
->value
);
562 void isl_ast_build_dump(__isl_keep isl_ast_build
*build
)
567 fprintf(stderr
, "domain: ");
568 isl_set_dump(build
->domain
);
569 fprintf(stderr
, "generated: ");
570 isl_set_dump(build
->generated
);
571 fprintf(stderr
, "pending: ");
572 isl_set_dump(build
->pending
);
573 fprintf(stderr
, "iterators: ");
574 isl_id_list_dump(build
->iterators
);
575 fprintf(stderr
, "values: ");
576 isl_multi_aff_dump(build
->values
);
578 fprintf(stderr
, "value: ");
579 isl_pw_aff_dump(build
->value
);
581 fprintf(stderr
, "strides: ");
582 isl_vec_dump(build
->strides
);
583 fprintf(stderr
, "offsets: ");
584 isl_multi_aff_dump(build
->offsets
);
587 /* Initialize "build" for AST construction in schedule space "space"
588 * in the case that build->domain is a parameter set.
590 * build->iterators is assumed to have been updated already.
592 static __isl_give isl_ast_build
*isl_ast_build_init(
593 __isl_take isl_ast_build
*build
, __isl_take isl_space
*space
)
597 build
= isl_ast_build_cow(build
);
601 set
= isl_set_universe(isl_space_copy(space
));
602 build
->domain
= isl_set_intersect_params(isl_set_copy(set
),
604 build
->pending
= isl_set_intersect_params(isl_set_copy(set
),
606 build
->generated
= isl_set_intersect_params(set
, build
->generated
);
608 return isl_ast_build_init_derived(build
, space
);
610 isl_ast_build_free(build
);
611 isl_space_free(space
);
615 /* Assign "aff" to *user and return -1, effectively extracting
616 * the first (and presumably only) affine expression in the isl_pw_aff
617 * on which this function is used.
619 static int extract_single_piece(__isl_take isl_set
*set
,
620 __isl_take isl_aff
*aff
, void *user
)
630 /* Check if the given bounds on the current dimension imply that
631 * this current dimension attains only a single value (in terms of
632 * parameters and outer dimensions).
633 * If so, we record it in build->value.
634 * If, moreover, this value can be represented as a single affine expression,
635 * then we also update build->values, effectively marking the current
636 * dimension as "eliminated".
638 * When computing the gist of the fixed value that can be represented
639 * as a single affine expression, it is important to only take into
640 * account the domain constraints in the original AST build and
641 * not the domain of the affine expression itself.
642 * Otherwise, a [i/3] is changed into a i/3 because we know that i
643 * is a multiple of 3, but then we end up not expressing anywhere
644 * in the context that i is a multiple of 3.
646 static __isl_give isl_ast_build
*update_values(
647 __isl_take isl_ast_build
*build
, __isl_take isl_basic_set
*bounds
)
650 isl_pw_multi_aff
*pma
;
655 set
= isl_set_from_basic_set(bounds
);
656 set
= isl_set_intersect(set
, isl_set_copy(build
->domain
));
657 it_map
= isl_ast_build_map_to_iterator(build
, set
);
659 sv
= isl_map_is_single_valued(it_map
);
661 build
= isl_ast_build_free(build
);
663 isl_map_free(it_map
);
667 pma
= isl_pw_multi_aff_from_map(it_map
);
668 build
->value
= isl_pw_multi_aff_get_pw_aff(pma
, 0);
669 build
->value
= isl_ast_build_compute_gist_pw_aff(build
, build
->value
);
670 build
->value
= isl_pw_aff_coalesce(build
->value
);
671 isl_pw_multi_aff_free(pma
);
674 return isl_ast_build_free(build
);
676 if (isl_pw_aff_n_piece(build
->value
) != 1)
679 isl_pw_aff_foreach_piece(build
->value
, &extract_single_piece
, &aff
);
681 build
->values
= isl_multi_aff_set_aff(build
->values
, build
->depth
, aff
);
683 return isl_ast_build_free(build
);
684 isl_ast_build_reset_schedule_map(build
);
688 /* Update the AST build based on the given loop bounds for
689 * the current dimension.
691 * We first make sure that the bounds do not refer to any iterators
692 * that have already been eliminated.
693 * Then, we check if the bounds imply that the current iterator
695 * If they do and if this fixed value can be expressed as a single
696 * affine expression, we eliminate the iterators from the bounds.
697 * Note that we cannot simply plug in this single value using
698 * isl_basic_set_preimage_multi_aff as the single value may only
699 * be defined on a subset of the domain. Plugging in the value
700 * would restrict the build domain to this subset, while this
701 * restriction may not be reflected in the generated code.
702 * build->domain may, however, already refer to the current dimension
703 * due an earlier call to isl_ast_build_include_stride. If so, we need
704 * to eliminate the dimension so that we do not introduce it in any other sets.
705 * Finally, we intersect build->domain with the updated bounds.
707 * Note that the check for a fixed value in update_values requires
708 * us to intersect the bounds with the current build domain.
709 * When we intersect build->domain with the updated bounds in
710 * the final step, we make sure that these updated bounds have
711 * not been intersected with the old build->domain.
712 * Otherwise, we would indirectly intersect the build domain with itself,
713 * which can lead to inefficiencies, in particular if the build domain
714 * contains any unknown divs.
716 __isl_give isl_ast_build
*isl_ast_build_set_loop_bounds(
717 __isl_take isl_ast_build
*build
, __isl_take isl_basic_set
*bounds
)
721 build
= isl_ast_build_cow(build
);
725 bounds
= isl_basic_set_preimage_multi_aff(bounds
,
726 isl_multi_aff_copy(build
->values
));
727 build
= update_values(build
, isl_basic_set_copy(bounds
));
730 set
= isl_set_from_basic_set(isl_basic_set_copy(bounds
));
731 if (isl_ast_build_has_affine_value(build
, build
->depth
)) {
732 set
= isl_set_eliminate(set
, isl_dim_set
, build
->depth
, 1);
733 set
= isl_set_compute_divs(set
);
734 build
->pending
= isl_set_intersect(build
->pending
,
736 if (isl_ast_build_has_stride(build
, build
->depth
)) {
737 build
->domain
= isl_set_eliminate(build
->domain
,
738 isl_dim_set
, build
->depth
, 1);
739 build
->domain
= isl_set_compute_divs(build
->domain
);
742 isl_basic_set
*generated
, *pending
;
744 pending
= isl_basic_set_copy(bounds
);
745 pending
= isl_basic_set_drop_constraints_involving_dims(pending
,
746 isl_dim_set
, build
->depth
, 1);
747 build
->pending
= isl_set_intersect(build
->pending
,
748 isl_set_from_basic_set(pending
));
749 generated
= isl_basic_set_copy(bounds
);
750 generated
= isl_basic_set_drop_constraints_not_involving_dims(
751 generated
, isl_dim_set
, build
->depth
, 1);
752 build
->generated
= isl_set_intersect(build
->generated
,
753 isl_set_from_basic_set(generated
));
755 isl_basic_set_free(bounds
);
757 build
->domain
= isl_set_intersect(build
->domain
, set
);
758 if (!build
->domain
|| !build
->pending
|| !build
->generated
)
759 return isl_ast_build_free(build
);
763 isl_ast_build_free(build
);
764 isl_basic_set_free(bounds
);
768 /* Update build->domain based on the constraints enforced by inner loops.
770 * The constraints in build->pending may end up not getting generated
771 * if they are implied by "enforced". We therefore reconstruct
772 * build->domain from build->generated and build->pending, dropping
773 * those constraint in build->pending that may not get generated.
775 __isl_give isl_ast_build
*isl_ast_build_set_enforced(
776 __isl_take isl_ast_build
*build
, __isl_take isl_basic_set
*enforced
)
780 build
= isl_ast_build_cow(build
);
784 set
= isl_set_from_basic_set(enforced
);
785 set
= isl_set_gist(isl_set_copy(build
->pending
), set
);
786 set
= isl_set_intersect(isl_set_copy(build
->generated
), set
);
788 isl_set_free(build
->domain
);
792 return isl_ast_build_free(build
);
796 isl_basic_set_free(enforced
);
797 return isl_ast_build_free(build
);
800 /* Intersect build->domain with "set", where "set" is specified
801 * in terms of the internal schedule domain.
803 static __isl_give isl_ast_build
*isl_ast_build_restrict_internal(
804 __isl_take isl_ast_build
*build
, __isl_take isl_set
*set
)
806 build
= isl_ast_build_cow(build
);
810 set
= isl_set_compute_divs(set
);
811 build
->domain
= isl_set_intersect(build
->domain
, set
);
812 build
->domain
= isl_set_coalesce(build
->domain
);
815 return isl_ast_build_free(build
);
819 isl_ast_build_free(build
);
824 /* Intersect build->generated and build->domain with "set",
825 * where "set" is specified in terms of the internal schedule domain.
827 __isl_give isl_ast_build
*isl_ast_build_restrict_generated(
828 __isl_take isl_ast_build
*build
, __isl_take isl_set
*set
)
830 set
= isl_set_compute_divs(set
);
831 build
= isl_ast_build_restrict_internal(build
, isl_set_copy(set
));
832 build
= isl_ast_build_cow(build
);
836 build
->generated
= isl_set_intersect(build
->generated
, set
);
837 build
->generated
= isl_set_coalesce(build
->generated
);
839 if (!build
->generated
)
840 return isl_ast_build_free(build
);
844 isl_ast_build_free(build
);
849 /* Intersect build->pending and build->domain with "set",
850 * where "set" is specified in terms of the internal schedule domain.
852 __isl_give isl_ast_build
*isl_ast_build_restrict_pending(
853 __isl_take isl_ast_build
*build
, __isl_take isl_set
*set
)
855 set
= isl_set_compute_divs(set
);
856 build
= isl_ast_build_restrict_internal(build
, isl_set_copy(set
));
857 build
= isl_ast_build_cow(build
);
861 build
->pending
= isl_set_intersect(build
->pending
, set
);
862 build
->pending
= isl_set_coalesce(build
->pending
);
865 return isl_ast_build_free(build
);
869 isl_ast_build_free(build
);
874 /* Intersect build->domain with "set", where "set" is specified
875 * in terms of the external schedule domain.
877 __isl_give isl_ast_build
*isl_ast_build_restrict(
878 __isl_take isl_ast_build
*build
, __isl_take isl_set
*set
)
880 if (isl_set_is_params(set
))
881 return isl_ast_build_restrict_generated(build
, set
);
883 if (isl_ast_build_need_schedule_map(build
)) {
885 ma
= isl_ast_build_get_schedule_map_multi_aff(build
);
886 set
= isl_set_preimage_multi_aff(set
, ma
);
888 return isl_ast_build_restrict_generated(build
, set
);
891 /* Replace build->executed by "executed".
893 __isl_give isl_ast_build
*isl_ast_build_set_executed(
894 __isl_take isl_ast_build
*build
, __isl_take isl_union_map
*executed
)
896 build
= isl_ast_build_cow(build
);
900 isl_union_map_free(build
->executed
);
901 build
->executed
= executed
;
905 isl_ast_build_free(build
);
906 isl_union_map_free(executed
);
910 /* Return a copy of the current schedule domain.
912 __isl_give isl_set
*isl_ast_build_get_domain(__isl_keep isl_ast_build
*build
)
914 return build
? isl_set_copy(build
->domain
) : NULL
;
917 /* Return the (schedule) space of "build".
919 * If "internal" is set, then this space is the space of the internal
920 * representation of the entire schedule, including those parts for
921 * which no code has been generated yet.
923 * If "internal" is not set, then this space is the external representation
924 * of the loops generated so far.
926 __isl_give isl_space
*isl_ast_build_get_space(__isl_keep isl_ast_build
*build
,
936 space
= isl_set_get_space(build
->domain
);
940 if (!isl_ast_build_need_schedule_map(build
))
943 dim
= isl_set_dim(build
->domain
, isl_dim_set
);
944 space
= isl_space_drop_dims(space
, isl_dim_set
,
945 build
->depth
, dim
- build
->depth
);
946 for (i
= build
->depth
- 1; i
>= 0; --i
)
947 if (isl_ast_build_has_affine_value(build
, i
))
948 space
= isl_space_drop_dims(space
, isl_dim_set
, i
, 1);
953 /* Return the external representation of the schedule space of "build",
954 * i.e., a space with a dimension for each loop generated so far,
955 * with the names of the dimensions set to the loop iterators.
957 __isl_give isl_space
*isl_ast_build_get_schedule_space(
958 __isl_keep isl_ast_build
*build
)
966 space
= isl_ast_build_get_space(build
, 0);
969 for (i
= 0; i
< build
->depth
; ++i
) {
972 if (isl_ast_build_has_affine_value(build
, i
)) {
977 id
= isl_ast_build_get_iterator_id(build
, i
);
978 space
= isl_space_set_dim_id(space
, isl_dim_set
, i
- skip
, id
);
984 /* Return the current schedule, as stored in build->executed, in terms
985 * of the external schedule domain.
987 __isl_give isl_union_map
*isl_ast_build_get_schedule(
988 __isl_keep isl_ast_build
*build
)
990 isl_union_map
*executed
;
991 isl_union_map
*schedule
;
996 executed
= isl_union_map_copy(build
->executed
);
997 if (isl_ast_build_need_schedule_map(build
)) {
998 isl_map
*proj
= isl_ast_build_get_schedule_map(build
);
999 executed
= isl_union_map_apply_domain(executed
,
1000 isl_union_map_from_map(proj
));
1002 schedule
= isl_union_map_reverse(executed
);
1007 /* Return the iterator attached to the internal schedule dimension "pos".
1009 __isl_give isl_id
*isl_ast_build_get_iterator_id(
1010 __isl_keep isl_ast_build
*build
, int pos
)
1015 return isl_id_list_get_id(build
->iterators
, pos
);
1018 /* Set the stride and offset of the current dimension to the given
1019 * value and expression.
1021 static __isl_give isl_ast_build
*set_stride(__isl_take isl_ast_build
*build
,
1022 isl_int stride
, __isl_take isl_aff
*offset
)
1026 build
= isl_ast_build_cow(build
);
1027 if (!build
|| !offset
)
1031 build
->strides
= isl_vec_set_element(build
->strides
, pos
, stride
);
1032 build
->offsets
= isl_multi_aff_set_aff(build
->offsets
, pos
, offset
);
1033 if (!build
->strides
|| !build
->offsets
)
1034 return isl_ast_build_free(build
);
1038 isl_aff_free(offset
);
1039 return isl_ast_build_free(build
);
1042 /* Return a set expressing the stride constraint at the current depth.
1044 * In particular, if the current iterator (i) is known to attain values
1048 * where f is the offset and s is the stride, then the returned set
1049 * expresses the constraint
1053 __isl_give isl_set
*isl_ast_build_get_stride_constraint(
1054 __isl_keep isl_ast_build
*build
)
1066 if (!isl_ast_build_has_stride(build
, pos
))
1067 return isl_set_universe(isl_ast_build_get_space(build
, 1));
1069 isl_int_init(stride
);
1071 isl_ast_build_get_stride(build
, pos
, &stride
);
1072 aff
= isl_ast_build_get_offset(build
, pos
);
1073 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, pos
, -1);
1074 aff
= isl_aff_mod(aff
, stride
);
1075 set
= isl_set_from_basic_set(isl_aff_zero_basic_set(aff
));
1077 isl_int_clear(stride
);
1082 /* Return the expansion implied by the stride and offset at the current
1085 * That is, return the mapping
1087 * [i_0, ..., i_{d-1}, i_d, i_{d+1}, ...]
1088 * -> [i_0, ..., i_{d-1}, s * i_d + offset(i), i_{d+1}, ...]
1090 * where s is the stride at the current depth d and offset(i) is
1091 * the corresponding offset.
1093 __isl_give isl_multi_aff
*isl_ast_build_get_stride_expansion(
1094 __isl_keep isl_ast_build
*build
)
1099 isl_aff
*aff
, *offset
;
1105 pos
= isl_ast_build_get_depth(build
);
1106 space
= isl_ast_build_get_space(build
, 1);
1107 space
= isl_space_map_from_set(space
);
1108 ma
= isl_multi_aff_identity(space
);
1110 if (!isl_ast_build_has_stride(build
, pos
))
1113 isl_int_init(stride
);
1114 offset
= isl_ast_build_get_offset(build
, pos
);
1115 isl_ast_build_get_stride(build
, pos
, &stride
);
1116 aff
= isl_multi_aff_get_aff(ma
, pos
);
1117 aff
= isl_aff_scale(aff
, stride
);
1118 aff
= isl_aff_add(aff
, offset
);
1119 ma
= isl_multi_aff_set_aff(ma
, pos
, aff
);
1120 isl_int_clear(stride
);
1125 /* Add constraints corresponding to any previously detected
1126 * stride on the current dimension to build->domain.
1128 __isl_give isl_ast_build
*isl_ast_build_include_stride(
1129 __isl_take isl_ast_build
*build
)
1135 if (!isl_ast_build_has_stride(build
, build
->depth
))
1137 build
= isl_ast_build_cow(build
);
1141 set
= isl_ast_build_get_stride_constraint(build
);
1143 build
->domain
= isl_set_intersect(build
->domain
, isl_set_copy(set
));
1144 build
->generated
= isl_set_intersect(build
->generated
, set
);
1145 if (!build
->domain
|| !build
->generated
)
1146 return isl_ast_build_free(build
);
1151 /* Compute x, y and g such that g = gcd(a,b) and a*x+b*y = g */
1152 static void euclid(isl_int a
, isl_int b
, isl_int
*x
, isl_int
*y
, isl_int
*g
)
1154 isl_int c
, d
, e
, f
, tmp
;
1163 isl_int_set_si(e
, 1);
1164 isl_int_set_si(f
, 0);
1165 while (isl_int_is_pos(d
)) {
1166 isl_int_tdiv_q(tmp
, c
, d
);
1167 isl_int_mul(tmp
, tmp
, f
);
1168 isl_int_sub(e
, e
, tmp
);
1169 isl_int_tdiv_q(tmp
, c
, d
);
1170 isl_int_mul(tmp
, tmp
, d
);
1171 isl_int_sub(c
, c
, tmp
);
1176 if (isl_int_is_zero(a
))
1177 isl_int_set_si(*x
, 0);
1178 else if (isl_int_is_pos(a
))
1182 if (isl_int_is_zero(b
))
1183 isl_int_set_si(*y
, 0);
1185 isl_int_mul(tmp
, a
, *x
);
1186 isl_int_sub(tmp
, c
, tmp
);
1187 isl_int_divexact(*y
, tmp
, b
);
1196 /* Information used inside detect_stride.
1198 * "build" may be updated by detect_stride to include stride information.
1199 * "pos" is equal to build->depth.
1201 struct isl_detect_stride_data
{
1202 isl_ast_build
*build
;
1206 /* Check if constraint "c" imposes any stride on dimension data->pos
1207 * and, if so, update the stride information in data->build.
1209 * In order to impose a stride on the dimension, "c" needs to be an equality
1210 * and it needs to involve the dimension. Note that "c" may also be
1211 * a div constraint and thus an inequality that we cannot use.
1213 * Let c be of the form
1215 * h(p) + g * v * i + g * stride * f(alpha) = 0
1217 * with h(p) an expression in terms of the parameters and outer dimensions
1218 * and f(alpha) an expression in terms of the existentially quantified
1219 * variables. Note that the inner dimensions have been eliminated so
1220 * they do not appear in "c".
1222 * If "stride" is not zero and not one, then it represents a non-trivial stride
1223 * on "i". We compute a and b such that
1225 * a v + b stride = 1
1229 * g v i = -h(p) + g stride f(alpha)
1231 * a g v i = -a h(p) + g stride f(alpha)
1233 * a g v i + b g stride i = -a h(p) + g stride * (...)
1235 * g i = -a h(p) + g stride * (...)
1237 * i = -a h(p)/g + stride * (...)
1239 * The expression "-a h(p)/g" can therefore be used as offset.
1241 static int detect_stride(__isl_take isl_constraint
*c
, void *user
)
1243 struct isl_detect_stride_data
*data
= user
;
1245 isl_int v
, gcd
, stride
, a
, b
, m
;
1247 if (!isl_constraint_is_equality(c
) ||
1248 !isl_constraint_involves_dims(c
, isl_dim_set
, data
->pos
, 1)) {
1249 isl_constraint_free(c
);
1258 isl_int_init(stride
);
1260 isl_int_set_si(gcd
, 0);
1261 n_div
= isl_constraint_dim(c
, isl_dim_div
);
1262 for (i
= 0; i
< n_div
; ++i
) {
1263 isl_constraint_get_coefficient(c
, isl_dim_div
, i
, &v
);
1264 isl_int_gcd(gcd
, gcd
, v
);
1267 isl_constraint_get_coefficient(c
, isl_dim_set
, data
->pos
, &v
);
1268 isl_int_gcd(m
, v
, gcd
);
1269 isl_int_divexact(stride
, gcd
, m
);
1270 isl_int_divexact(v
, v
, m
);
1272 if (!isl_int_is_zero(stride
) && !isl_int_is_one(stride
)) {
1275 euclid(v
, stride
, &a
, &b
, &gcd
);
1277 aff
= isl_constraint_get_aff(c
);
1278 for (i
= 0; i
< n_div
; ++i
)
1279 aff
= isl_aff_set_coefficient_si(aff
,
1281 aff
= isl_aff_set_coefficient_si(aff
, isl_dim_in
, data
->pos
, 0);
1283 aff
= isl_aff_scale(aff
, a
);
1284 aff
= isl_aff_scale_down(aff
, m
);
1285 data
->build
= set_stride(data
->build
, stride
, aff
);
1288 isl_int_clear(stride
);
1295 isl_constraint_free(c
);
1299 /* Check if the constraints in "set" imply any stride on the current
1300 * dimension and, if so, record the stride information in "build"
1301 * and return the updated "build".
1303 * We compute the affine hull and then check if any of the constraints
1304 * in the hull imposes any stride on the current dimension.
1306 * We assume that inner dimensions have been eliminated from "set"
1307 * by the caller. This is needed because the common stride
1308 * may be imposed by different inner dimensions on different parts of
1311 __isl_give isl_ast_build
*isl_ast_build_detect_strides(
1312 __isl_take isl_ast_build
*build
, __isl_take isl_set
*set
)
1314 isl_basic_set
*hull
;
1315 struct isl_detect_stride_data data
;
1321 data
.pos
= isl_ast_build_get_depth(build
);
1322 hull
= isl_set_affine_hull(set
);
1324 if (isl_basic_set_foreach_constraint(hull
, &detect_stride
, &data
) < 0)
1325 data
.build
= isl_ast_build_free(data
.build
);
1327 isl_basic_set_free(hull
);
1334 struct isl_ast_build_involves_data
{
1339 /* Check if "map" involves the input dimension data->depth.
1341 static int involves_depth(__isl_take isl_map
*map
, void *user
)
1343 struct isl_ast_build_involves_data
*data
= user
;
1345 data
->involves
= isl_map_involves_dims(map
, isl_dim_in
, data
->depth
, 1);
1348 if (data
->involves
< 0 || data
->involves
)
1353 /* Do any options depend on the value of the dimension at the current depth?
1355 int isl_ast_build_options_involve_depth(__isl_keep isl_ast_build
*build
)
1357 struct isl_ast_build_involves_data data
;
1362 data
.depth
= build
->depth
;
1365 if (isl_union_map_foreach_map(build
->options
,
1366 &involves_depth
, &data
) < 0) {
1367 if (data
.involves
< 0 || !data
.involves
)
1371 return data
.involves
;
1374 /* Construct the map
1376 * { [i] -> [i] : i < pos; [i] -> [i + 1] : i >= pos }
1378 * with "space" the parameter space of the constructed map.
1380 static __isl_give isl_map
*construct_insertion_map(__isl_take isl_space
*space
,
1384 isl_basic_map
*bmap1
, *bmap2
;
1386 space
= isl_space_set_from_params(space
);
1387 space
= isl_space_add_dims(space
, isl_dim_set
, 1);
1388 space
= isl_space_map_from_set(space
);
1389 c
= isl_equality_alloc(isl_local_space_from_space(space
));
1390 c
= isl_constraint_set_coefficient_si(c
, isl_dim_in
, 0, 1);
1391 c
= isl_constraint_set_coefficient_si(c
, isl_dim_out
, 0, -1);
1392 bmap1
= isl_basic_map_from_constraint(isl_constraint_copy(c
));
1393 c
= isl_constraint_set_constant_si(c
, 1);
1394 bmap2
= isl_basic_map_from_constraint(c
);
1396 bmap1
= isl_basic_map_upper_bound_si(bmap1
, isl_dim_in
, 0, pos
- 1);
1397 bmap2
= isl_basic_map_lower_bound_si(bmap2
, isl_dim_in
, 0, pos
);
1399 return isl_basic_map_union(bmap1
, bmap2
);
1402 static const char *option_str
[] = {
1403 [atomic
] = "atomic",
1404 [unroll
] = "unroll",
1405 [separate
] = "separate"
1408 /* Update the "options" to reflect the insertion of a dimension
1409 * at position "pos" in the schedule domain space.
1410 * "space" is the original domain space before the insertion and
1411 * may be named and/or structured.
1413 * The (relevant) input options all have "space" as domain, which
1414 * has to be mapped to the extended space.
1415 * The values of the ranges also refer to the schedule domain positions
1416 * and they therefore also need to be adjusted. In particular, values
1417 * smaller than pos do not need to change, while values greater than or
1418 * equal to pos need to be incremented.
1419 * That is, we need to apply the following map.
1421 * { atomic[i] -> atomic[i] : i < pos; [i] -> [i + 1] : i >= pos;
1422 * unroll[i] -> unroll[i] : i < pos; [i] -> [i + 1] : i >= pos;
1423 * separate[i] -> separate[i] : i < pos; [i] -> [i + 1] : i >= pos;
1424 * separation_class[[i] -> [c]]
1425 * -> separation_class[[i] -> [c]] : i < pos;
1426 * separation_class[[i] -> [c]]
1427 * -> separation_class[[i + 1] -> [c]] : i >= pos }
1429 static __isl_give isl_union_map
*options_insert_dim(
1430 __isl_take isl_union_map
*options
, __isl_take isl_space
*space
, int pos
)
1433 isl_union_map
*insertion
;
1434 enum isl_ast_build_domain_type type
;
1435 const char *name
= "separation_class";
1437 space
= isl_space_map_from_set(space
);
1438 map
= isl_map_identity(space
);
1439 map
= isl_map_insert_dims(map
, isl_dim_out
, pos
, 1);
1440 options
= isl_union_map_apply_domain(options
,
1441 isl_union_map_from_map(map
));
1446 map
= construct_insertion_map(isl_union_map_get_space(options
), pos
);
1448 insertion
= isl_union_map_empty(isl_union_map_get_space(options
));
1450 for (type
= atomic
; type
<= separate
; ++type
) {
1451 isl_map
*map_type
= isl_map_copy(map
);
1452 const char *name
= option_str
[type
];
1453 map_type
= isl_map_set_tuple_name(map_type
, isl_dim_in
, name
);
1454 map_type
= isl_map_set_tuple_name(map_type
, isl_dim_out
, name
);
1455 insertion
= isl_union_map_add_map(insertion
, map_type
);
1458 map
= isl_map_product(map
, isl_map_identity(isl_map_get_space(map
)));
1459 map
= isl_map_set_tuple_name(map
, isl_dim_in
, name
);
1460 map
= isl_map_set_tuple_name(map
, isl_dim_out
, name
);
1461 insertion
= isl_union_map_add_map(insertion
, map
);
1463 options
= isl_union_map_apply_range(options
, insertion
);
1468 /* Insert a single dimension in the schedule domain at position "pos".
1469 * The new dimension is given an isl_id with the empty string as name.
1471 * The main difficulty is updating build->options to reflect the
1472 * extra dimension. This is handled in options_insert_dim.
1474 * Note that because of the dimension manipulations, the resulting
1475 * schedule domain space will always be unnamed and unstructured.
1476 * However, the original schedule domain space may be named and/or
1477 * structured, so we have to take this possibility into account
1478 * while performing the transformations.
1480 __isl_give isl_ast_build
*isl_ast_build_insert_dim(
1481 __isl_take isl_ast_build
*build
, int pos
)
1484 isl_space
*space
, *ma_space
;
1488 build
= isl_ast_build_cow(build
);
1492 ctx
= isl_ast_build_get_ctx(build
);
1493 id
= isl_id_alloc(ctx
, "", NULL
);
1494 space
= isl_ast_build_get_space(build
, 1);
1495 build
->iterators
= isl_id_list_insert(build
->iterators
, pos
, id
);
1496 build
->domain
= isl_set_insert_dims(build
->domain
,
1497 isl_dim_set
, pos
, 1);
1498 build
->generated
= isl_set_insert_dims(build
->generated
,
1499 isl_dim_set
, pos
, 1);
1500 build
->pending
= isl_set_insert_dims(build
->pending
,
1501 isl_dim_set
, pos
, 1);
1502 build
->strides
= isl_vec_insert_els(build
->strides
, pos
, 1);
1503 build
->strides
= isl_vec_set_element_si(build
->strides
, pos
, 1);
1504 ma_space
= isl_space_params(isl_multi_aff_get_space(build
->offsets
));
1505 ma_space
= isl_space_set_from_params(ma_space
);
1506 ma_space
= isl_space_add_dims(ma_space
, isl_dim_set
, 1);
1507 ma_space
= isl_space_map_from_set(ma_space
);
1508 ma
= isl_multi_aff_zero(isl_space_copy(ma_space
));
1509 build
->offsets
= isl_multi_aff_splice(build
->offsets
, pos
, pos
, ma
);
1510 ma
= isl_multi_aff_identity(ma_space
);
1511 build
->values
= isl_multi_aff_splice(build
->values
, pos
, pos
, ma
);
1512 build
->options
= options_insert_dim(build
->options
, space
, pos
);
1514 if (!build
->iterators
|| !build
->domain
|| !build
->generated
||
1515 !build
->pending
|| !build
->values
||
1516 !build
->strides
|| !build
->offsets
|| !build
->options
)
1517 return isl_ast_build_free(build
);
1522 /* Scale down the current dimension by a factor of "m".
1523 * "umap" is an isl_union_map that implements the scaling down.
1524 * That is, it is of the form
1526 * { [.... i ....] -> [.... i' ....] : i = m i' }
1528 * This function is called right after the strides have been
1529 * detected, but before any constraints on the current dimension
1530 * have been included in build->domain.
1531 * We therefore only need to update stride, offset and the options.
1533 __isl_give isl_ast_build
*isl_ast_build_scale_down(
1534 __isl_take isl_ast_build
*build
, isl_int m
,
1535 __isl_take isl_union_map
*umap
)
1541 build
= isl_ast_build_cow(build
);
1542 if (!build
|| !umap
)
1545 depth
= build
->depth
;
1548 if (isl_vec_get_element(build
->strides
, depth
, &v
) < 0)
1549 build
->strides
= isl_vec_free(build
->strides
);
1550 isl_int_divexact(v
, v
, m
);
1551 build
->strides
= isl_vec_set_element(build
->strides
, depth
, v
);
1554 aff
= isl_multi_aff_get_aff(build
->offsets
, depth
);
1555 aff
= isl_aff_scale_down(aff
, m
);
1556 build
->offsets
= isl_multi_aff_set_aff(build
->offsets
, depth
, aff
);
1557 build
->options
= isl_union_map_apply_domain(build
->options
, umap
);
1558 if (!build
->strides
|| !build
->offsets
|| !build
->options
)
1559 return isl_ast_build_free(build
);
1563 isl_union_map_free(umap
);
1564 return isl_ast_build_free(build
);
1567 /* Return a list of "n" isl_ids called "c%d", with "%d" starting at "first".
1568 * If an isl_id with such a name already appears among the parameters
1569 * in build->domain, then adjust the name to "c%d_%d".
1571 static __isl_give isl_id_list
*generate_names(isl_ctx
*ctx
, int n
, int first
,
1572 __isl_keep isl_ast_build
*build
)
1577 names
= isl_id_list_alloc(ctx
, n
);
1578 for (i
= 0; i
< n
; ++i
) {
1581 id
= generate_name(ctx
, first
+ i
, build
);
1582 names
= isl_id_list_add(names
, id
);
1588 /* Embed "options" into the given isl_ast_build space.
1590 * This function is called from within a nested call to
1591 * isl_ast_build_ast_from_schedule.
1592 * "options" refers to the additional schedule,
1593 * while space refers to both the space of the outer isl_ast_build and
1594 * that of the additional schedule.
1595 * Specifically, space is of the form
1599 * while options lives in the space(s)
1607 * and compose this with options, to obtain the new options
1608 * living in the space(s)
1612 static __isl_give isl_union_map
*embed_options(
1613 __isl_take isl_union_map
*options
, __isl_take isl_space
*space
)
1617 map
= isl_map_universe(isl_space_unwrap(space
));
1618 map
= isl_map_range_map(map
);
1620 options
= isl_union_map_apply_range(
1621 isl_union_map_from_map(map
), options
);
1626 /* Update "build" for use in a (possibly nested) code generation. That is,
1627 * extend "build" from an AST build on some domain O to an AST build
1628 * on domain [O -> S], with S corresponding to "space".
1629 * If the original domain is a parameter domain, then the new domain is
1631 * "iterators" is a list of iterators for S, but the number of elements
1632 * may be smaller or greater than the number of set dimensions of S.
1633 * If "keep_iterators" is set, then any extra ids in build->iterators
1634 * are reused for S. Otherwise, these extra ids are dropped.
1636 * We first update build->outer_pos to the current depth.
1637 * This depth is zero in case this is the outermost code generation.
1639 * We then add additional ids such that the number of iterators is at least
1640 * equal to the dimension of the new build domain.
1642 * If the original domain is parametric, then we are constructing
1643 * an isl_ast_build for the outer code generation and we pass control
1644 * to isl_ast_build_init.
1646 * Otherwise, we adjust the fields of "build" to include "space".
1648 __isl_give isl_ast_build
*isl_ast_build_product(
1649 __isl_take isl_ast_build
*build
, __isl_take isl_space
*space
)
1654 isl_multi_aff
*embedding
;
1657 build
= isl_ast_build_cow(build
);
1661 build
->outer_pos
= build
->depth
;
1663 ctx
= isl_ast_build_get_ctx(build
);
1664 dim
= isl_set_dim(build
->domain
, isl_dim_set
);
1665 dim
+= isl_space_dim(space
, isl_dim_set
);
1666 n_it
= isl_id_list_n_id(build
->iterators
);
1669 l
= generate_names(ctx
, dim
- n_it
, n_it
, build
);
1670 build
->iterators
= isl_id_list_concat(build
->iterators
, l
);
1673 if (isl_set_is_params(build
->domain
))
1674 return isl_ast_build_init(build
, space
);
1676 set
= isl_set_universe(isl_space_copy(space
));
1677 build
->domain
= isl_set_product(build
->domain
, isl_set_copy(set
));
1678 build
->pending
= isl_set_product(build
->pending
, isl_set_copy(set
));
1679 build
->generated
= isl_set_product(build
->generated
, set
);
1681 strides
= isl_vec_alloc(ctx
, isl_space_dim(space
, isl_dim_set
));
1682 strides
= isl_vec_set_si(strides
, 1);
1683 build
->strides
= isl_vec_concat(build
->strides
, strides
);
1685 space
= isl_space_map_from_set(space
);
1686 build
->offsets
= isl_multi_aff_align_params(build
->offsets
,
1687 isl_space_copy(space
));
1688 build
->offsets
= isl_multi_aff_product(build
->offsets
,
1689 isl_multi_aff_zero(isl_space_copy(space
)));
1690 build
->values
= isl_multi_aff_align_params(build
->values
,
1691 isl_space_copy(space
));
1692 embedding
= isl_multi_aff_identity(space
);
1693 build
->values
= isl_multi_aff_product(build
->values
, embedding
);
1695 space
= isl_ast_build_get_space(build
, 1);
1696 build
->options
= embed_options(build
->options
, space
);
1698 if (!build
->iterators
|| !build
->domain
|| !build
->generated
||
1699 !build
->pending
|| !build
->values
||
1700 !build
->strides
|| !build
->offsets
|| !build
->options
)
1701 return isl_ast_build_free(build
);
1705 isl_ast_build_free(build
);
1706 isl_space_free(space
);
1710 /* Does "aff" only attain non-negative values over build->domain?
1711 * That is, does it not attain any negative values?
1713 int isl_ast_build_aff_is_nonneg(__isl_keep isl_ast_build
*build
,
1714 __isl_keep isl_aff
*aff
)
1722 aff
= isl_aff_copy(aff
);
1723 test
= isl_set_from_basic_set(isl_aff_neg_basic_set(aff
));
1724 test
= isl_set_intersect(test
, isl_set_copy(build
->domain
));
1725 empty
= isl_set_is_empty(test
);
1731 /* Does the dimension at (internal) position "pos" have a non-trivial stride?
1733 int isl_ast_build_has_stride(__isl_keep isl_ast_build
*build
, int pos
)
1742 isl_vec_get_element(build
->strides
, pos
, &v
);
1743 has_stride
= !isl_int_is_one(v
);
1749 /* Given that the dimension at position "pos" takes on values
1753 * with a an integer, return s through *stride.
1755 int isl_ast_build_get_stride(__isl_keep isl_ast_build
*build
, int pos
,
1761 isl_vec_get_element(build
->strides
, pos
, stride
);
1766 /* Given that the dimension at position "pos" takes on values
1770 * with a an integer, return f.
1772 __isl_give isl_aff
*isl_ast_build_get_offset(
1773 __isl_keep isl_ast_build
*build
, int pos
)
1778 return isl_multi_aff_get_aff(build
->offsets
, pos
);
1781 /* Is the dimension at position "pos" known to attain only a single
1782 * value that, moreover, can be described by a single affine expression
1783 * in terms of the outer dimensions and parameters?
1785 * If not, then the correponding affine expression in build->values
1786 * is set to be equal to the same input dimension.
1787 * Otherwise, it is set to the requested expression in terms of
1788 * outer dimensions and parameters.
1790 int isl_ast_build_has_affine_value(__isl_keep isl_ast_build
*build
,
1799 aff
= isl_multi_aff_get_aff(build
->values
, pos
);
1800 involves
= isl_aff_involves_dims(aff
, isl_dim_in
, pos
, 1);
1809 /* Is the current dimension known to attain only a single value?
1811 int isl_ast_build_has_value(__isl_keep isl_ast_build
*build
)
1816 return build
->value
!= NULL
;
1819 /* Simplify the basic set "bset" based on what we know about
1820 * the iterators of already generated loops.
1822 * "bset" is assumed to live in the (internal) schedule domain.
1824 __isl_give isl_basic_set
*isl_ast_build_compute_gist_basic_set(
1825 __isl_keep isl_ast_build
*build
, __isl_take isl_basic_set
*bset
)
1830 bset
= isl_basic_set_preimage_multi_aff(bset
,
1831 isl_multi_aff_copy(build
->values
));
1832 bset
= isl_basic_set_gist(bset
,
1833 isl_set_simple_hull(isl_set_copy(build
->domain
)));
1837 isl_basic_set_free(bset
);
1841 /* Simplify the set "set" based on what we know about
1842 * the iterators of already generated loops.
1844 * "set" is assumed to live in the (internal) schedule domain.
1846 __isl_give isl_set
*isl_ast_build_compute_gist(
1847 __isl_keep isl_ast_build
*build
, __isl_take isl_set
*set
)
1852 set
= isl_set_preimage_multi_aff(set
,
1853 isl_multi_aff_copy(build
->values
));
1854 set
= isl_set_gist(set
, isl_set_copy(build
->domain
));
1862 /* Simplify the map "map" based on what we know about
1863 * the iterators of already generated loops.
1865 * The domain of "map" is assumed to live in the (internal) schedule domain.
1867 __isl_give isl_map
*isl_ast_build_compute_gist_map_domain(
1868 __isl_keep isl_ast_build
*build
, __isl_take isl_map
*map
)
1873 map
= isl_map_gist_domain(map
, isl_set_copy(build
->domain
));
1881 /* Simplify the affine expression "aff" based on what we know about
1882 * the iterators of already generated loops.
1884 * The domain of "aff" is assumed to live in the (internal) schedule domain.
1886 __isl_give isl_aff
*isl_ast_build_compute_gist_aff(
1887 __isl_keep isl_ast_build
*build
, __isl_take isl_aff
*aff
)
1892 aff
= isl_aff_gist(aff
, isl_set_copy(build
->domain
));
1900 /* Simplify the piecewise affine expression "aff" based on what we know about
1901 * the iterators of already generated loops.
1903 * The domain of "pa" is assumed to live in the (internal) schedule domain.
1905 __isl_give isl_pw_aff
*isl_ast_build_compute_gist_pw_aff(
1906 __isl_keep isl_ast_build
*build
, __isl_take isl_pw_aff
*pa
)
1911 pa
= isl_pw_aff_pullback_multi_aff(pa
,
1912 isl_multi_aff_copy(build
->values
));
1913 pa
= isl_pw_aff_gist(pa
, isl_set_copy(build
->domain
));
1917 isl_pw_aff_free(pa
);
1921 /* Simplify the piecewise multi-affine expression "aff" based on what
1922 * we know about the iterators of already generated loops.
1924 * The domain of "pma" is assumed to live in the (internal) schedule domain.
1926 __isl_give isl_pw_multi_aff
*isl_ast_build_compute_gist_pw_multi_aff(
1927 __isl_keep isl_ast_build
*build
, __isl_take isl_pw_multi_aff
*pma
)
1932 pma
= isl_pw_multi_aff_pullback_multi_aff(pma
,
1933 isl_multi_aff_copy(build
->values
));
1934 pma
= isl_pw_multi_aff_gist(pma
, isl_set_copy(build
->domain
));
1938 isl_pw_multi_aff_free(pma
);
1942 /* Extract the schedule domain of the given type from build->options
1943 * at the current depth.
1945 * In particular, find the subset of build->options that is of
1946 * the following form
1948 * schedule_domain -> type[depth]
1950 * and return the corresponding domain, after eliminating inner dimensions
1951 * and divs that depend on the current dimension.
1953 * Note that the domain of build->options has been reformulated
1954 * in terms of the internal build space in embed_options,
1955 * but the position is still that within the current code generation.
1957 __isl_give isl_set
*isl_ast_build_get_option_domain(
1958 __isl_keep isl_ast_build
*build
,
1959 enum isl_ast_build_domain_type type
)
1970 name
= option_str
[type
];
1971 local_pos
= build
->depth
- build
->outer_pos
;
1973 space
= isl_ast_build_get_space(build
, 1);
1974 space
= isl_space_from_domain(space
);
1975 space
= isl_space_add_dims(space
, isl_dim_out
, 1);
1976 space
= isl_space_set_tuple_name(space
, isl_dim_out
, name
);
1978 option
= isl_union_map_extract_map(build
->options
, space
);
1979 option
= isl_map_fix_si(option
, isl_dim_out
, 0, local_pos
);
1981 domain
= isl_map_domain(option
);
1982 domain
= isl_ast_build_eliminate(build
, domain
);
1987 /* Extract the separation class mapping at the current depth.
1989 * In particular, find and return the subset of build->options that is of
1990 * the following form
1992 * schedule_domain -> separation_class[[depth] -> [class]]
1994 * The caller is expected to eliminate inner dimensions from the domain.
1996 * Note that the domain of build->options has been reformulated
1997 * in terms of the internal build space in embed_options,
1998 * but the position is still that within the current code generation.
2000 __isl_give isl_map
*isl_ast_build_get_separation_class(
2001 __isl_keep isl_ast_build
*build
)
2004 isl_space
*space_sep
, *space
;
2011 local_pos
= build
->depth
- build
->outer_pos
;
2012 ctx
= isl_ast_build_get_ctx(build
);
2013 space_sep
= isl_space_alloc(ctx
, 0, 1, 1);
2014 space_sep
= isl_space_wrap(space_sep
);
2015 space_sep
= isl_space_set_tuple_name(space_sep
, isl_dim_set
,
2016 "separation_class");
2017 space
= isl_ast_build_get_space(build
, 1);
2018 space_sep
= isl_space_align_params(space_sep
, isl_space_copy(space
));
2019 space
= isl_space_map_from_domain_and_range(space
, space_sep
);
2021 res
= isl_union_map_extract_map(build
->options
, space
);
2022 res
= isl_map_fix_si(res
, isl_dim_out
, 0, local_pos
);
2023 res
= isl_map_coalesce(res
);
2028 /* Eliminate dimensions inner to the current dimension.
2030 __isl_give isl_set
*isl_ast_build_eliminate_inner(
2031 __isl_keep isl_ast_build
*build
, __isl_take isl_set
*set
)
2037 return isl_set_free(set
);
2039 dim
= isl_set_dim(set
, isl_dim_set
);
2040 depth
= build
->depth
;
2041 set
= isl_set_detect_equalities(set
);
2042 set
= isl_set_eliminate(set
, isl_dim_set
, depth
+ 1, dim
- (depth
+ 1));
2047 /* Eliminate unknown divs and divs that depend on the current dimension.
2049 * Note that during the elimination of unknown divs, we may discover
2050 * an explicit representation of some other unknown divs, which may
2051 * depend on the current dimension. We therefore need to eliminate
2052 * unknown divs first.
2054 __isl_give isl_set
*isl_ast_build_eliminate_divs(
2055 __isl_keep isl_ast_build
*build
, __isl_take isl_set
*set
)
2060 return isl_set_free(set
);
2062 set
= isl_set_remove_unknown_divs(set
);
2063 depth
= build
->depth
;
2064 set
= isl_set_remove_divs_involving_dims(set
, isl_dim_set
, depth
, 1);
2069 /* Eliminate dimensions inner to the current dimension as well as
2070 * unknown divs and divs that depend on the current dimension.
2071 * The result then consists only of constraints that are independent
2072 * of the current dimension and upper and lower bounds on the current
2075 __isl_give isl_set
*isl_ast_build_eliminate(
2076 __isl_keep isl_ast_build
*build
, __isl_take isl_set
*domain
)
2078 domain
= isl_ast_build_eliminate_inner(build
, domain
);
2079 domain
= isl_ast_build_eliminate_divs(build
, domain
);
2083 /* Replace build->single_valued by "sv".
2085 __isl_give isl_ast_build
*isl_ast_build_set_single_valued(
2086 __isl_take isl_ast_build
*build
, int sv
)
2090 if (build
->single_valued
== sv
)
2092 build
= isl_ast_build_cow(build
);
2095 build
->single_valued
= sv
;