2 * Copyright 2011 Leiden University. All rights reserved.
3 * Copyright 2012-2013 Ecole Normale Superieure. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above
13 * copyright notice, this list of conditions and the following
14 * disclaimer in the documentation and/or other materials provided
15 * with the distribution.
17 * THIS SOFTWARE IS PROVIDED BY LEIDEN UNIVERSITY ''AS IS'' AND ANY
18 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
20 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL LEIDEN UNIVERSITY OR
21 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
22 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
23 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
24 * OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 * The views and conclusions contained in the software and documentation
30 * are those of the authors and should not be interpreted as
31 * representing official policies, either expressed or implied, of
36 #include <isl/constraint.h>
37 #include <isl/union_set.h>
41 #define ARRAY_SIZE(array) (sizeof(array)/sizeof(*array))
43 static char *type_str
[] = {
44 [pet_expr_access
] = "access",
45 [pet_expr_call
] = "call",
46 [pet_expr_cast
] = "cast",
47 [pet_expr_double
] = "double",
48 [pet_expr_unary
] = "unary",
49 [pet_expr_binary
] = "binary",
50 [pet_expr_ternary
] = "ternary"
53 static char *op_str
[] = {
54 [pet_op_add_assign
] = "+=",
55 [pet_op_sub_assign
] = "-=",
56 [pet_op_mul_assign
] = "*=",
57 [pet_op_div_assign
] = "/=",
58 [pet_op_assign
] = "=",
69 [pet_op_post_inc
] = "++",
70 [pet_op_post_dec
] = "--",
71 [pet_op_pre_inc
] = "++",
72 [pet_op_pre_dec
] = "--",
73 [pet_op_address_of
] = "&",
74 [pet_op_kill
] = "kill"
77 /* pet_scop with extra information that is only used during parsing.
79 * In particular, we keep track of conditions under which we want
80 * to skip the rest of the current loop iteration (skip[pet_skip_now])
81 * and of conditions under which we want to skip subsequent
82 * loop iterations (skip[pet_skip_later]).
84 * The conditions are represented either by a variable, which
85 * is assumed to attain values zero and one, or by a boolean affine
86 * expression. The condition holds if the variable has value one
87 * or if the affine expression has value one (typically for only
88 * part of the parameter space).
90 * A missing condition (skip[type] == NULL) means that we don't want
99 const char *pet_op_str(enum pet_op_type op
)
104 int pet_op_is_inc_dec(enum pet_op_type op
)
106 return op
== pet_op_post_inc
|| op
== pet_op_post_dec
||
107 op
== pet_op_pre_inc
|| op
== pet_op_pre_dec
;
110 const char *pet_type_str(enum pet_expr_type type
)
112 return type_str
[type
];
115 enum pet_op_type
pet_str_op(const char *str
)
119 for (i
= 0; i
< ARRAY_SIZE(op_str
); ++i
)
120 if (!strcmp(op_str
[i
], str
))
126 enum pet_expr_type
pet_str_type(const char *str
)
130 for (i
= 0; i
< ARRAY_SIZE(type_str
); ++i
)
131 if (!strcmp(type_str
[i
], str
))
137 /* Construct a pet_expr from an access relation.
138 * By default, it is considered to be a read access.
140 struct pet_expr
*pet_expr_from_access(__isl_take isl_map
*access
)
142 isl_ctx
*ctx
= isl_map_get_ctx(access
);
143 struct pet_expr
*expr
;
147 expr
= isl_calloc_type(ctx
, struct pet_expr
);
151 expr
->type
= pet_expr_access
;
152 expr
->acc
.access
= access
;
158 isl_map_free(access
);
162 /* Construct a pet_expr that kills the elements specified by "access".
164 struct pet_expr
*pet_expr_kill_from_access(__isl_take isl_map
*access
)
167 struct pet_expr
*expr
;
169 ctx
= isl_map_get_ctx(access
);
170 expr
= pet_expr_from_access(access
);
174 return pet_expr_new_unary(ctx
, pet_op_kill
, expr
);
177 /* Construct a unary pet_expr that performs "op" on "arg".
179 struct pet_expr
*pet_expr_new_unary(isl_ctx
*ctx
, enum pet_op_type op
,
180 struct pet_expr
*arg
)
182 struct pet_expr
*expr
;
186 expr
= isl_alloc_type(ctx
, struct pet_expr
);
190 expr
->type
= pet_expr_unary
;
193 expr
->args
= isl_calloc_array(ctx
, struct pet_expr
*, 1);
196 expr
->args
[pet_un_arg
] = arg
;
204 /* Construct a binary pet_expr that performs "op" on "lhs" and "rhs".
206 struct pet_expr
*pet_expr_new_binary(isl_ctx
*ctx
, enum pet_op_type op
,
207 struct pet_expr
*lhs
, struct pet_expr
*rhs
)
209 struct pet_expr
*expr
;
213 expr
= isl_alloc_type(ctx
, struct pet_expr
);
217 expr
->type
= pet_expr_binary
;
220 expr
->args
= isl_calloc_array(ctx
, struct pet_expr
*, 2);
223 expr
->args
[pet_bin_lhs
] = lhs
;
224 expr
->args
[pet_bin_rhs
] = rhs
;
233 /* Construct a ternary pet_expr that performs "cond" ? "lhs" : "rhs".
235 struct pet_expr
*pet_expr_new_ternary(isl_ctx
*ctx
, struct pet_expr
*cond
,
236 struct pet_expr
*lhs
, struct pet_expr
*rhs
)
238 struct pet_expr
*expr
;
240 if (!cond
|| !lhs
|| !rhs
)
242 expr
= isl_alloc_type(ctx
, struct pet_expr
);
246 expr
->type
= pet_expr_ternary
;
248 expr
->args
= isl_calloc_array(ctx
, struct pet_expr
*, 3);
251 expr
->args
[pet_ter_cond
] = cond
;
252 expr
->args
[pet_ter_true
] = lhs
;
253 expr
->args
[pet_ter_false
] = rhs
;
263 /* Construct a call pet_expr that calls function "name" with "n_arg"
264 * arguments. The caller is responsible for filling in the arguments.
266 struct pet_expr
*pet_expr_new_call(isl_ctx
*ctx
, const char *name
,
269 struct pet_expr
*expr
;
271 expr
= isl_alloc_type(ctx
, struct pet_expr
);
275 expr
->type
= pet_expr_call
;
277 expr
->name
= strdup(name
);
278 expr
->args
= isl_calloc_array(ctx
, struct pet_expr
*, n_arg
);
279 if (!expr
->name
|| !expr
->args
)
280 return pet_expr_free(expr
);
285 /* Construct a pet_expr that represents the cast of "arg" to "type_name".
287 struct pet_expr
*pet_expr_new_cast(isl_ctx
*ctx
, const char *type_name
,
288 struct pet_expr
*arg
)
290 struct pet_expr
*expr
;
295 expr
= isl_alloc_type(ctx
, struct pet_expr
);
299 expr
->type
= pet_expr_cast
;
301 expr
->type_name
= strdup(type_name
);
302 expr
->args
= isl_calloc_array(ctx
, struct pet_expr
*, 1);
303 if (!expr
->type_name
|| !expr
->args
)
315 /* Construct a pet_expr that represents the double "d".
317 struct pet_expr
*pet_expr_new_double(isl_ctx
*ctx
, double val
, const char *s
)
319 struct pet_expr
*expr
;
321 expr
= isl_calloc_type(ctx
, struct pet_expr
);
325 expr
->type
= pet_expr_double
;
327 expr
->d
.s
= strdup(s
);
329 return pet_expr_free(expr
);
334 void *pet_expr_free(struct pet_expr
*expr
)
341 for (i
= 0; i
< expr
->n_arg
; ++i
)
342 pet_expr_free(expr
->args
[i
]);
345 switch (expr
->type
) {
346 case pet_expr_access
:
347 isl_id_free(expr
->acc
.ref_id
);
348 isl_map_free(expr
->acc
.access
);
354 free(expr
->type_name
);
356 case pet_expr_double
:
360 case pet_expr_binary
:
361 case pet_expr_ternary
:
369 static void expr_dump(struct pet_expr
*expr
, int indent
)
376 fprintf(stderr
, "%*s", indent
, "");
378 switch (expr
->type
) {
379 case pet_expr_double
:
380 fprintf(stderr
, "%s\n", expr
->d
.s
);
382 case pet_expr_access
:
383 isl_id_dump(expr
->acc
.ref_id
);
384 fprintf(stderr
, "%*s", indent
, "");
385 isl_map_dump(expr
->acc
.access
);
386 fprintf(stderr
, "%*sread: %d\n", indent
+ 2,
388 fprintf(stderr
, "%*swrite: %d\n", indent
+ 2,
389 "", expr
->acc
.write
);
390 for (i
= 0; i
< expr
->n_arg
; ++i
)
391 expr_dump(expr
->args
[i
], indent
+ 2);
394 fprintf(stderr
, "%s\n", op_str
[expr
->op
]);
395 expr_dump(expr
->args
[pet_un_arg
], indent
+ 2);
397 case pet_expr_binary
:
398 fprintf(stderr
, "%s\n", op_str
[expr
->op
]);
399 expr_dump(expr
->args
[pet_bin_lhs
], indent
+ 2);
400 expr_dump(expr
->args
[pet_bin_rhs
], indent
+ 2);
402 case pet_expr_ternary
:
403 fprintf(stderr
, "?:\n");
404 expr_dump(expr
->args
[pet_ter_cond
], indent
+ 2);
405 expr_dump(expr
->args
[pet_ter_true
], indent
+ 2);
406 expr_dump(expr
->args
[pet_ter_false
], indent
+ 2);
409 fprintf(stderr
, "%s/%d\n", expr
->name
, expr
->n_arg
);
410 for (i
= 0; i
< expr
->n_arg
; ++i
)
411 expr_dump(expr
->args
[i
], indent
+ 2);
414 fprintf(stderr
, "(%s)\n", expr
->type_name
);
415 for (i
= 0; i
< expr
->n_arg
; ++i
)
416 expr_dump(expr
->args
[i
], indent
+ 2);
421 void pet_expr_dump(struct pet_expr
*expr
)
426 /* Does "expr" represent an access to an unnamed space, i.e.,
427 * does it represent an affine expression?
429 int pet_expr_is_affine(struct pet_expr
*expr
)
435 if (expr
->type
!= pet_expr_access
)
438 has_id
= isl_map_has_tuple_id(expr
->acc
.access
, isl_dim_out
);
445 /* Return the identifier of the array accessed by "expr".
447 __isl_give isl_id
*pet_expr_access_get_id(struct pet_expr
*expr
)
451 if (expr
->type
!= pet_expr_access
)
453 return isl_map_get_tuple_id(expr
->acc
.access
, isl_dim_out
);
456 /* Does "expr" represent an access to a scalar, i.e., zero-dimensional array?
458 int pet_expr_is_scalar_access(struct pet_expr
*expr
)
462 if (expr
->type
!= pet_expr_access
)
465 return isl_map_dim(expr
->acc
.access
, isl_dim_out
) == 0;
468 /* Return 1 if the two pet_exprs are equivalent.
470 int pet_expr_is_equal(struct pet_expr
*expr1
, struct pet_expr
*expr2
)
474 if (!expr1
|| !expr2
)
477 if (expr1
->type
!= expr2
->type
)
479 if (expr1
->n_arg
!= expr2
->n_arg
)
481 for (i
= 0; i
< expr1
->n_arg
; ++i
)
482 if (!pet_expr_is_equal(expr1
->args
[i
], expr2
->args
[i
]))
484 switch (expr1
->type
) {
485 case pet_expr_double
:
486 if (strcmp(expr1
->d
.s
, expr2
->d
.s
))
488 if (expr1
->d
.val
!= expr2
->d
.val
)
491 case pet_expr_access
:
492 if (expr1
->acc
.read
!= expr2
->acc
.read
)
494 if (expr1
->acc
.write
!= expr2
->acc
.write
)
496 if (expr1
->acc
.ref_id
!= expr2
->acc
.ref_id
)
498 if (!expr1
->acc
.access
|| !expr2
->acc
.access
)
500 if (!isl_map_is_equal(expr1
->acc
.access
, expr2
->acc
.access
))
504 case pet_expr_binary
:
505 case pet_expr_ternary
:
506 if (expr1
->op
!= expr2
->op
)
510 if (strcmp(expr1
->name
, expr2
->name
))
514 if (strcmp(expr1
->type_name
, expr2
->type_name
))
522 /* Add extra conditions on the parameters to all access relations in "expr".
524 struct pet_expr
*pet_expr_restrict(struct pet_expr
*expr
,
525 __isl_take isl_set
*cond
)
532 for (i
= 0; i
< expr
->n_arg
; ++i
) {
533 expr
->args
[i
] = pet_expr_restrict(expr
->args
[i
],
539 if (expr
->type
== pet_expr_access
) {
540 expr
->acc
.access
= isl_map_intersect_params(expr
->acc
.access
,
542 if (!expr
->acc
.access
)
550 return pet_expr_free(expr
);
553 /* Modify all expressions of type pet_expr_access in "expr"
554 * by calling "fn" on them.
556 struct pet_expr
*pet_expr_map_access(struct pet_expr
*expr
,
557 struct pet_expr
*(*fn
)(struct pet_expr
*expr
, void *user
),
565 for (i
= 0; i
< expr
->n_arg
; ++i
) {
566 expr
->args
[i
] = pet_expr_map_access(expr
->args
[i
], fn
, user
);
568 return pet_expr_free(expr
);
571 if (expr
->type
== pet_expr_access
)
572 expr
= fn(expr
, user
);
577 /* Call "fn" on each of the subexpressions of "expr" of type pet_expr_access.
579 * Return -1 on error (where fn return a negative value is treated as an error).
580 * Otherwise return 0.
582 int pet_expr_foreach_access_expr(struct pet_expr
*expr
,
583 int (*fn
)(struct pet_expr
*expr
, void *user
), void *user
)
590 for (i
= 0; i
< expr
->n_arg
; ++i
)
591 if (pet_expr_foreach_access_expr(expr
->args
[i
], fn
, user
) < 0)
594 if (expr
->type
== pet_expr_access
)
595 return fn(expr
, user
);
600 /* Modify the access relation of the given access expression
601 * based on the given iteration space transformation.
602 * If the access has any arguments then the domain of the access relation
603 * is a wrapped mapping from the iteration space to the space of
604 * argument values. We only need to change the domain of this wrapped
605 * mapping, so we extend the input transformation with an identity mapping
606 * on the space of argument values.
608 static struct pet_expr
*update_domain(struct pet_expr
*expr
, void *user
)
610 isl_map
*update
= user
;
613 update
= isl_map_copy(update
);
615 dim
= isl_map_get_space(expr
->acc
.access
);
616 dim
= isl_space_domain(dim
);
617 if (!isl_space_is_wrapping(dim
))
621 dim
= isl_space_unwrap(dim
);
622 dim
= isl_space_range(dim
);
623 dim
= isl_space_map_from_set(dim
);
624 id
= isl_map_identity(dim
);
625 update
= isl_map_product(update
, id
);
628 expr
->acc
.access
= isl_map_apply_domain(expr
->acc
.access
, update
);
629 if (!expr
->acc
.access
)
630 return pet_expr_free(expr
);
635 /* Modify all access relations in "expr" based on the given iteration space
638 static struct pet_expr
*expr_update_domain(struct pet_expr
*expr
,
639 __isl_take isl_map
*update
)
641 expr
= pet_expr_map_access(expr
, &update_domain
, update
);
642 isl_map_free(update
);
646 /* Construct a pet_stmt with given line number and statement
647 * number from a pet_expr.
648 * The initial iteration domain is the zero-dimensional universe.
649 * The name of the domain is given by "label" if it is non-NULL.
650 * Otherwise, the name is constructed as S_<id>.
651 * The domains of all access relations are modified to refer
652 * to the statement iteration domain.
654 struct pet_stmt
*pet_stmt_from_pet_expr(isl_ctx
*ctx
, int line
,
655 __isl_take isl_id
*label
, int id
, struct pet_expr
*expr
)
657 struct pet_stmt
*stmt
;
667 stmt
= isl_calloc_type(ctx
, struct pet_stmt
);
671 dim
= isl_space_set_alloc(ctx
, 0, 0);
673 dim
= isl_space_set_tuple_id(dim
, isl_dim_set
, label
);
675 snprintf(name
, sizeof(name
), "S_%d", id
);
676 dim
= isl_space_set_tuple_name(dim
, isl_dim_set
, name
);
678 dom
= isl_set_universe(isl_space_copy(dim
));
679 sched
= isl_map_from_domain(isl_set_copy(dom
));
681 dim
= isl_space_from_range(dim
);
682 add_name
= isl_map_universe(dim
);
683 expr
= expr_update_domain(expr
, add_name
);
687 stmt
->schedule
= sched
;
690 if (!stmt
->domain
|| !stmt
->schedule
|| !stmt
->body
)
691 return pet_stmt_free(stmt
);
696 return pet_expr_free(expr
);
699 void *pet_stmt_free(struct pet_stmt
*stmt
)
706 isl_set_free(stmt
->domain
);
707 isl_map_free(stmt
->schedule
);
708 pet_expr_free(stmt
->body
);
710 for (i
= 0; i
< stmt
->n_arg
; ++i
)
711 pet_expr_free(stmt
->args
[i
]);
718 static void stmt_dump(struct pet_stmt
*stmt
, int indent
)
725 fprintf(stderr
, "%*s%d\n", indent
, "", stmt
->line
);
726 fprintf(stderr
, "%*s", indent
, "");
727 isl_set_dump(stmt
->domain
);
728 fprintf(stderr
, "%*s", indent
, "");
729 isl_map_dump(stmt
->schedule
);
730 expr_dump(stmt
->body
, indent
);
731 for (i
= 0; i
< stmt
->n_arg
; ++i
)
732 expr_dump(stmt
->args
[i
], indent
+ 2);
735 void pet_stmt_dump(struct pet_stmt
*stmt
)
740 struct pet_array
*pet_array_free(struct pet_array
*array
)
745 isl_set_free(array
->context
);
746 isl_set_free(array
->extent
);
747 isl_set_free(array
->value_bounds
);
748 free(array
->element_type
);
754 void pet_array_dump(struct pet_array
*array
)
759 isl_set_dump(array
->context
);
760 isl_set_dump(array
->extent
);
761 isl_set_dump(array
->value_bounds
);
762 fprintf(stderr
, "%s %s\n", array
->element_type
,
763 array
->live_out
? "live-out" : "");
766 /* Alloc a pet_scop structure, with extra room for information that
767 * is only used during parsing.
769 struct pet_scop
*pet_scop_alloc(isl_ctx
*ctx
)
771 return &isl_calloc_type(ctx
, struct pet_scop_ext
)->scop
;
774 /* Construct a pet_scop with room for n statements.
776 static struct pet_scop
*scop_alloc(isl_ctx
*ctx
, int n
)
779 struct pet_scop
*scop
;
781 scop
= pet_scop_alloc(ctx
);
785 space
= isl_space_params_alloc(ctx
, 0);
786 scop
->context
= isl_set_universe(isl_space_copy(space
));
787 scop
->context_value
= isl_set_universe(space
);
788 scop
->stmts
= isl_calloc_array(ctx
, struct pet_stmt
*, n
);
789 if (!scop
->context
|| !scop
->stmts
)
790 return pet_scop_free(scop
);
797 struct pet_scop
*pet_scop_empty(isl_ctx
*ctx
)
799 return scop_alloc(ctx
, 0);
802 /* Update "context" with respect to the valid parameter values for "access".
804 static __isl_give isl_set
*access_extract_context(__isl_keep isl_map
*access
,
805 __isl_take isl_set
*context
)
807 context
= isl_set_intersect(context
,
808 isl_map_params(isl_map_copy(access
)));
812 /* Update "context" with respect to the valid parameter values for "expr".
814 * If "expr" represents a ternary operator, then a parameter value
815 * needs to be valid for the condition and for at least one of the
816 * remaining two arguments.
817 * If the condition is an affine expression, then we can be a bit more specific.
818 * The parameter then has to be valid for the second argument for
819 * non-zero accesses and valid for the third argument for zero accesses.
821 static __isl_give isl_set
*expr_extract_context(struct pet_expr
*expr
,
822 __isl_take isl_set
*context
)
826 if (expr
->type
== pet_expr_ternary
) {
828 isl_set
*context1
, *context2
;
830 is_aff
= pet_expr_is_affine(expr
->args
[0]);
834 context
= expr_extract_context(expr
->args
[0], context
);
835 context1
= expr_extract_context(expr
->args
[1],
836 isl_set_copy(context
));
837 context2
= expr_extract_context(expr
->args
[2], context
);
843 access
= isl_map_copy(expr
->args
[0]->acc
.access
);
844 access
= isl_map_fix_si(access
, isl_dim_out
, 0, 0);
845 zero_set
= isl_map_params(access
);
846 context1
= isl_set_subtract(context1
,
847 isl_set_copy(zero_set
));
848 context2
= isl_set_intersect(context2
, zero_set
);
851 context
= isl_set_union(context1
, context2
);
852 context
= isl_set_coalesce(context
);
857 for (i
= 0; i
< expr
->n_arg
; ++i
)
858 context
= expr_extract_context(expr
->args
[i
], context
);
860 if (expr
->type
== pet_expr_access
)
861 context
= access_extract_context(expr
->acc
.access
, context
);
865 isl_set_free(context
);
869 /* Update "context" with respect to the valid parameter values for "stmt".
871 static __isl_give isl_set
*stmt_extract_context(struct pet_stmt
*stmt
,
872 __isl_take isl_set
*context
)
876 for (i
= 0; i
< stmt
->n_arg
; ++i
)
877 context
= expr_extract_context(stmt
->args
[i
], context
);
879 context
= expr_extract_context(stmt
->body
, context
);
884 /* Construct a pet_scop that contains the given pet_stmt.
886 struct pet_scop
*pet_scop_from_pet_stmt(isl_ctx
*ctx
, struct pet_stmt
*stmt
)
888 struct pet_scop
*scop
;
893 scop
= scop_alloc(ctx
, 1);
897 scop
->context
= stmt_extract_context(stmt
, scop
->context
);
901 scop
->stmts
[0] = stmt
;
910 /* Does "set" represent an element of an unnamed space, i.e.,
911 * does it represent an affine expression?
913 static int set_is_affine(__isl_keep isl_set
*set
)
917 has_id
= isl_set_has_tuple_id(set
);
924 /* Combine ext1->skip[type] and ext2->skip[type] into ext->skip[type].
925 * ext may be equal to either ext1 or ext2.
927 * The two skips that need to be combined are assumed to be affine expressions.
929 * We need to skip in ext if we need to skip in either ext1 or ext2.
930 * We don't need to skip in ext if we don't need to skip in both ext1 and ext2.
932 static struct pet_scop_ext
*combine_skips(struct pet_scop_ext
*ext
,
933 struct pet_scop_ext
*ext1
, struct pet_scop_ext
*ext2
,
936 isl_set
*set
, *skip1
, *skip2
;
940 if (!ext1
->skip
[type
] && !ext2
->skip
[type
])
942 if (!ext1
->skip
[type
]) {
945 ext
->skip
[type
] = ext2
->skip
[type
];
946 ext2
->skip
[type
] = NULL
;
949 if (!ext2
->skip
[type
]) {
952 ext
->skip
[type
] = ext1
->skip
[type
];
953 ext1
->skip
[type
] = NULL
;
957 if (!set_is_affine(ext1
->skip
[type
]) ||
958 !set_is_affine(ext2
->skip
[type
]))
959 isl_die(isl_set_get_ctx(ext1
->skip
[type
]), isl_error_internal
,
960 "can only combine affine skips",
961 return pet_scop_free(&ext
->scop
));
963 skip1
= isl_set_copy(ext1
->skip
[type
]);
964 skip2
= isl_set_copy(ext2
->skip
[type
]);
965 set
= isl_set_intersect(
966 isl_set_fix_si(isl_set_copy(skip1
), isl_dim_set
, 0, 0),
967 isl_set_fix_si(isl_set_copy(skip2
), isl_dim_set
, 0, 0));
968 set
= isl_set_union(set
, isl_set_fix_si(skip1
, isl_dim_set
, 0, 1));
969 set
= isl_set_union(set
, isl_set_fix_si(skip2
, isl_dim_set
, 0, 1));
970 set
= isl_set_coalesce(set
);
971 isl_set_free(ext1
->skip
[type
]);
972 ext1
->skip
[type
] = NULL
;
973 isl_set_free(ext2
->skip
[type
]);
974 ext2
->skip
[type
] = NULL
;
975 ext
->skip
[type
] = set
;
976 if (!ext
->skip
[type
])
977 return pet_scop_free(&ext
->scop
);
982 /* Combine scop1->skip[type] and scop2->skip[type] into scop->skip[type],
983 * where type takes on the values pet_skip_now and pet_skip_later.
984 * scop may be equal to either scop1 or scop2.
986 static struct pet_scop
*scop_combine_skips(struct pet_scop
*scop
,
987 struct pet_scop
*scop1
, struct pet_scop
*scop2
)
989 struct pet_scop_ext
*ext
= (struct pet_scop_ext
*) scop
;
990 struct pet_scop_ext
*ext1
= (struct pet_scop_ext
*) scop1
;
991 struct pet_scop_ext
*ext2
= (struct pet_scop_ext
*) scop2
;
993 ext
= combine_skips(ext
, ext1
, ext2
, pet_skip_now
);
994 ext
= combine_skips(ext
, ext1
, ext2
, pet_skip_later
);
998 /* Update scop->start and scop->end to include the region from "start"
999 * to "end". In particular, if scop->end == 0, then "scop" does not
1000 * have any offset information yet and we simply take the information
1001 * from "start" and "end". Otherwise, we update the fields if the
1002 * region from "start" to "end" is not already included.
1004 struct pet_scop
*pet_scop_update_start_end(struct pet_scop
*scop
,
1005 unsigned start
, unsigned end
)
1009 if (scop
->end
== 0) {
1010 scop
->start
= start
;
1013 if (start
< scop
->start
)
1014 scop
->start
= start
;
1015 if (end
> scop
->end
)
1022 /* Does "implication" appear in the list of implications of "scop"?
1024 static int is_known_implication(struct pet_scop
*scop
,
1025 struct pet_implication
*implication
)
1029 for (i
= 0; i
< scop
->n_implication
; ++i
) {
1030 struct pet_implication
*pi
= scop
->implications
[i
];
1033 if (pi
->satisfied
!= implication
->satisfied
)
1035 equal
= isl_map_is_equal(pi
->extension
, implication
->extension
);
1045 /* Store the concatenation of the impliciations of "scop1" and "scop2"
1046 * in "scop", removing duplicates (i.e., implications in "scop2" that
1047 * already appear in "scop1").
1049 static struct pet_scop
*scop_collect_implications(isl_ctx
*ctx
,
1050 struct pet_scop
*scop
, struct pet_scop
*scop1
, struct pet_scop
*scop2
)
1057 if (scop2
->n_implication
== 0) {
1058 scop
->n_implication
= scop1
->n_implication
;
1059 scop
->implications
= scop1
->implications
;
1060 scop1
->n_implication
= 0;
1061 scop1
->implications
= NULL
;
1065 if (scop1
->n_implication
== 0) {
1066 scop
->n_implication
= scop2
->n_implication
;
1067 scop
->implications
= scop2
->implications
;
1068 scop2
->n_implication
= 0;
1069 scop2
->implications
= NULL
;
1073 scop
->implications
= isl_calloc_array(ctx
, struct pet_implication
*,
1074 scop1
->n_implication
+ scop2
->n_implication
);
1075 if (!scop
->implications
)
1076 return pet_scop_free(scop
);
1078 for (i
= 0; i
< scop1
->n_implication
; ++i
) {
1079 scop
->implications
[i
] = scop1
->implications
[i
];
1080 scop1
->implications
[i
] = NULL
;
1083 scop
->n_implication
= scop1
->n_implication
;
1084 j
= scop1
->n_implication
;
1085 for (i
= 0; i
< scop2
->n_implication
; ++i
) {
1088 known
= is_known_implication(scop
, scop2
->implications
[i
]);
1090 return pet_scop_free(scop
);
1093 scop
->implications
[j
++] = scop2
->implications
[i
];
1094 scop2
->implications
[i
] = NULL
;
1096 scop
->n_implication
= j
;
1101 /* Combine the offset information of "scop1" and "scop2" into "scop".
1103 static struct pet_scop
*scop_combine_start_end(struct pet_scop
*scop
,
1104 struct pet_scop
*scop1
, struct pet_scop
*scop2
)
1107 scop
= pet_scop_update_start_end(scop
,
1108 scop1
->start
, scop1
->end
);
1110 scop
= pet_scop_update_start_end(scop
,
1111 scop2
->start
, scop2
->end
);
1115 /* Construct a pet_scop that contains the offset information,
1116 * arrays, statements and skip information in "scop1" and "scop2".
1118 static struct pet_scop
*pet_scop_add(isl_ctx
*ctx
, struct pet_scop
*scop1
,
1119 struct pet_scop
*scop2
)
1122 struct pet_scop
*scop
= NULL
;
1124 if (!scop1
|| !scop2
)
1127 if (scop1
->n_stmt
== 0) {
1128 scop2
= scop_combine_skips(scop2
, scop1
, scop2
);
1129 pet_scop_free(scop1
);
1133 if (scop2
->n_stmt
== 0) {
1134 scop1
= scop_combine_skips(scop1
, scop1
, scop2
);
1135 pet_scop_free(scop2
);
1139 scop
= scop_alloc(ctx
, scop1
->n_stmt
+ scop2
->n_stmt
);
1143 scop
->arrays
= isl_calloc_array(ctx
, struct pet_array
*,
1144 scop1
->n_array
+ scop2
->n_array
);
1147 scop
->n_array
= scop1
->n_array
+ scop2
->n_array
;
1149 for (i
= 0; i
< scop1
->n_stmt
; ++i
) {
1150 scop
->stmts
[i
] = scop1
->stmts
[i
];
1151 scop1
->stmts
[i
] = NULL
;
1154 for (i
= 0; i
< scop2
->n_stmt
; ++i
) {
1155 scop
->stmts
[scop1
->n_stmt
+ i
] = scop2
->stmts
[i
];
1156 scop2
->stmts
[i
] = NULL
;
1159 for (i
= 0; i
< scop1
->n_array
; ++i
) {
1160 scop
->arrays
[i
] = scop1
->arrays
[i
];
1161 scop1
->arrays
[i
] = NULL
;
1164 for (i
= 0; i
< scop2
->n_array
; ++i
) {
1165 scop
->arrays
[scop1
->n_array
+ i
] = scop2
->arrays
[i
];
1166 scop2
->arrays
[i
] = NULL
;
1169 scop
= scop_collect_implications(ctx
, scop
, scop1
, scop2
);
1170 scop
= pet_scop_restrict_context(scop
, isl_set_copy(scop1
->context
));
1171 scop
= pet_scop_restrict_context(scop
, isl_set_copy(scop2
->context
));
1172 scop
= scop_combine_skips(scop
, scop1
, scop2
);
1173 scop
= scop_combine_start_end(scop
, scop1
, scop2
);
1175 pet_scop_free(scop1
);
1176 pet_scop_free(scop2
);
1179 pet_scop_free(scop1
);
1180 pet_scop_free(scop2
);
1181 pet_scop_free(scop
);
1185 /* Apply the skip condition "skip" to "scop".
1186 * That is, make sure "scop" is not executed when the condition holds.
1188 * If "skip" is an affine expression, we add the conditions under
1189 * which the expression is zero to the iteration domains.
1190 * Otherwise, we add a filter on the variable attaining the value zero.
1192 static struct pet_scop
*restrict_skip(struct pet_scop
*scop
,
1193 __isl_take isl_set
*skip
)
1201 is_aff
= set_is_affine(skip
);
1206 return pet_scop_filter(scop
, isl_map_from_range(skip
), 0);
1208 skip
= isl_set_fix_si(skip
, isl_dim_set
, 0, 0);
1209 scop
= pet_scop_restrict(scop
, isl_set_params(skip
));
1214 return pet_scop_free(scop
);
1217 /* Construct a pet_scop that contains the arrays, statements and
1218 * skip information in "scop1" and "scop2", where the two scops
1219 * are executed "in sequence". That is, breaks and continues
1220 * in scop1 have an effect on scop2.
1222 struct pet_scop
*pet_scop_add_seq(isl_ctx
*ctx
, struct pet_scop
*scop1
,
1223 struct pet_scop
*scop2
)
1225 if (scop1
&& pet_scop_has_skip(scop1
, pet_skip_now
))
1226 scop2
= restrict_skip(scop2
,
1227 pet_scop_get_skip(scop1
, pet_skip_now
));
1228 return pet_scop_add(ctx
, scop1
, scop2
);
1231 /* Construct a pet_scop that contains the arrays, statements and
1232 * skip information in "scop1" and "scop2", where the two scops
1233 * are executed "in parallel". That is, any break or continue
1234 * in scop1 has no effect on scop2.
1236 struct pet_scop
*pet_scop_add_par(isl_ctx
*ctx
, struct pet_scop
*scop1
,
1237 struct pet_scop
*scop2
)
1239 return pet_scop_add(ctx
, scop1
, scop2
);
1242 void *pet_implication_free(struct pet_implication
*implication
)
1249 isl_map_free(implication
->extension
);
1255 void *pet_scop_free(struct pet_scop
*scop
)
1258 struct pet_scop_ext
*ext
= (struct pet_scop_ext
*) scop
;
1262 isl_set_free(scop
->context
);
1263 isl_set_free(scop
->context_value
);
1265 for (i
= 0; i
< scop
->n_array
; ++i
)
1266 pet_array_free(scop
->arrays
[i
]);
1269 for (i
= 0; i
< scop
->n_stmt
; ++i
)
1270 pet_stmt_free(scop
->stmts
[i
]);
1272 if (scop
->implications
)
1273 for (i
= 0; i
< scop
->n_implication
; ++i
)
1274 pet_implication_free(scop
->implications
[i
]);
1275 free(scop
->implications
);
1276 isl_set_free(ext
->skip
[pet_skip_now
]);
1277 isl_set_free(ext
->skip
[pet_skip_later
]);
1282 void pet_implication_dump(struct pet_implication
*implication
)
1287 fprintf(stderr
, "%d\n", implication
->satisfied
);
1288 isl_map_dump(implication
->extension
);
1291 void pet_scop_dump(struct pet_scop
*scop
)
1294 struct pet_scop_ext
*ext
= (struct pet_scop_ext
*) scop
;
1299 isl_set_dump(scop
->context
);
1300 isl_set_dump(scop
->context_value
);
1301 for (i
= 0; i
< scop
->n_array
; ++i
)
1302 pet_array_dump(scop
->arrays
[i
]);
1303 for (i
= 0; i
< scop
->n_stmt
; ++i
)
1304 pet_stmt_dump(scop
->stmts
[i
]);
1305 for (i
= 0; i
< scop
->n_implication
; ++i
)
1306 pet_implication_dump(scop
->implications
[i
]);
1309 fprintf(stderr
, "skip\n");
1310 isl_set_dump(ext
->skip
[0]);
1311 isl_set_dump(ext
->skip
[1]);
1315 /* Return 1 if the two pet_arrays are equivalent.
1317 * We don't compare element_size as this may be target dependent.
1319 int pet_array_is_equal(struct pet_array
*array1
, struct pet_array
*array2
)
1321 if (!array1
|| !array2
)
1324 if (!isl_set_is_equal(array1
->context
, array2
->context
))
1326 if (!isl_set_is_equal(array1
->extent
, array2
->extent
))
1328 if (!!array1
->value_bounds
!= !!array2
->value_bounds
)
1330 if (array1
->value_bounds
&&
1331 !isl_set_is_equal(array1
->value_bounds
, array2
->value_bounds
))
1333 if (strcmp(array1
->element_type
, array2
->element_type
))
1335 if (array1
->live_out
!= array2
->live_out
)
1337 if (array1
->uniquely_defined
!= array2
->uniquely_defined
)
1339 if (array1
->declared
!= array2
->declared
)
1341 if (array1
->exposed
!= array2
->exposed
)
1347 /* Return 1 if the two pet_stmts are equivalent.
1349 int pet_stmt_is_equal(struct pet_stmt
*stmt1
, struct pet_stmt
*stmt2
)
1353 if (!stmt1
|| !stmt2
)
1356 if (stmt1
->line
!= stmt2
->line
)
1358 if (!isl_set_is_equal(stmt1
->domain
, stmt2
->domain
))
1360 if (!isl_map_is_equal(stmt1
->schedule
, stmt2
->schedule
))
1362 if (!pet_expr_is_equal(stmt1
->body
, stmt2
->body
))
1364 if (stmt1
->n_arg
!= stmt2
->n_arg
)
1366 for (i
= 0; i
< stmt1
->n_arg
; ++i
) {
1367 if (!pet_expr_is_equal(stmt1
->args
[i
], stmt2
->args
[i
]))
1374 /* Return 1 if the two pet_implications are equivalent.
1376 int pet_implication_is_equal(struct pet_implication
*implication1
,
1377 struct pet_implication
*implication2
)
1379 if (!implication1
|| !implication2
)
1382 if (implication1
->satisfied
!= implication2
->satisfied
)
1384 if (!isl_map_is_equal(implication1
->extension
, implication2
->extension
))
1390 /* Return 1 if the two pet_scops are equivalent.
1392 int pet_scop_is_equal(struct pet_scop
*scop1
, struct pet_scop
*scop2
)
1396 if (!scop1
|| !scop2
)
1399 if (!isl_set_is_equal(scop1
->context
, scop2
->context
))
1401 if (!isl_set_is_equal(scop1
->context_value
, scop2
->context_value
))
1404 if (scop1
->n_array
!= scop2
->n_array
)
1406 for (i
= 0; i
< scop1
->n_array
; ++i
)
1407 if (!pet_array_is_equal(scop1
->arrays
[i
], scop2
->arrays
[i
]))
1410 if (scop1
->n_stmt
!= scop2
->n_stmt
)
1412 for (i
= 0; i
< scop1
->n_stmt
; ++i
)
1413 if (!pet_stmt_is_equal(scop1
->stmts
[i
], scop2
->stmts
[i
]))
1416 if (scop1
->n_implication
!= scop2
->n_implication
)
1418 for (i
= 0; i
< scop1
->n_implication
; ++i
)
1419 if (!pet_implication_is_equal(scop1
->implications
[i
],
1420 scop2
->implications
[i
]))
1426 /* Prefix the schedule of "stmt" with an extra dimension with constant
1429 struct pet_stmt
*pet_stmt_prefix(struct pet_stmt
*stmt
, int pos
)
1434 stmt
->schedule
= isl_map_insert_dims(stmt
->schedule
, isl_dim_out
, 0, 1);
1435 stmt
->schedule
= isl_map_fix_si(stmt
->schedule
, isl_dim_out
, 0, pos
);
1436 if (!stmt
->schedule
)
1437 return pet_stmt_free(stmt
);
1442 /* Prefix the schedules of all statements in "scop" with an extra
1443 * dimension with constant value "pos".
1445 struct pet_scop
*pet_scop_prefix(struct pet_scop
*scop
, int pos
)
1452 for (i
= 0; i
< scop
->n_stmt
; ++i
) {
1453 scop
->stmts
[i
] = pet_stmt_prefix(scop
->stmts
[i
], pos
);
1454 if (!scop
->stmts
[i
])
1455 return pet_scop_free(scop
);
1461 /* Given a set with a parameter at "param_pos" that refers to the
1462 * iterator, "move" the iterator to the first set dimension.
1463 * That is, essentially equate the parameter to the first set dimension
1464 * and then project it out.
1466 * The first set dimension may however refer to a virtual iterator,
1467 * while the parameter refers to the "real" iterator.
1468 * We therefore need to take into account the mapping "iv_map", which
1469 * maps the virtual iterator to the real iterator.
1470 * In particular, we equate the set dimension to the input of the map
1471 * and the parameter to the output of the map and then project out
1472 * everything we don't need anymore.
1474 static __isl_give isl_set
*internalize_iv(__isl_take isl_set
*set
,
1475 int param_pos
, __isl_take isl_map
*iv_map
)
1478 map
= isl_map_from_domain(set
);
1479 map
= isl_map_add_dims(map
, isl_dim_out
, 1);
1480 map
= isl_map_equate(map
, isl_dim_in
, 0, isl_dim_out
, 0);
1481 iv_map
= isl_map_align_params(iv_map
, isl_map_get_space(map
));
1482 map
= isl_map_apply_range(map
, iv_map
);
1483 map
= isl_map_equate(map
, isl_dim_param
, param_pos
, isl_dim_out
, 0);
1484 map
= isl_map_project_out(map
, isl_dim_param
, param_pos
, 1);
1485 return isl_map_domain(map
);
1488 /* Data used in embed_access.
1489 * extend adds an iterator to the iteration domain
1490 * iv_map maps the virtual iterator to the real iterator
1491 * var_id represents the induction variable of the corresponding loop
1493 struct pet_embed_access
{
1499 /* Given an access expression, embed the associated access relation
1500 * in an extra outer loop.
1502 * We first update the iteration domain to insert the extra dimension.
1504 * If the access refers to the induction variable, then it is
1505 * turned into an access to the set of integers with index (and value)
1506 * equal to the induction variable.
1508 * If the induction variable appears in the constraints (as a parameter),
1509 * then the parameter is equated to the newly introduced iteration
1510 * domain dimension and subsequently projected out.
1512 * Similarly, if the accessed array is a virtual array (with user
1513 * pointer equal to NULL), as created by create_test_access,
1514 * then it is extended along with the domain of the access.
1516 static struct pet_expr
*embed_access(struct pet_expr
*expr
, void *user
)
1518 struct pet_embed_access
*data
= user
;
1520 isl_id
*array_id
= NULL
;
1523 expr
= update_domain(expr
, data
->extend
);
1527 access
= expr
->acc
.access
;
1529 if (isl_map_has_tuple_id(access
, isl_dim_out
))
1530 array_id
= isl_map_get_tuple_id(access
, isl_dim_out
);
1531 if (array_id
== data
->var_id
||
1532 (array_id
&& !isl_id_get_user(array_id
))) {
1533 access
= isl_map_insert_dims(access
, isl_dim_out
, 0, 1);
1534 access
= isl_map_equate(access
,
1535 isl_dim_in
, 0, isl_dim_out
, 0);
1536 if (array_id
== data
->var_id
)
1537 access
= isl_map_apply_range(access
,
1538 isl_map_copy(data
->iv_map
));
1540 access
= isl_map_set_tuple_id(access
, isl_dim_out
,
1541 isl_id_copy(array_id
));
1543 isl_id_free(array_id
);
1545 pos
= isl_map_find_dim_by_id(access
, isl_dim_param
, data
->var_id
);
1547 isl_set
*set
= isl_map_wrap(access
);
1548 set
= internalize_iv(set
, pos
, isl_map_copy(data
->iv_map
));
1549 access
= isl_set_unwrap(set
);
1551 expr
->acc
.access
= isl_map_set_dim_id(access
, isl_dim_in
, 0,
1552 isl_id_copy(data
->var_id
));
1553 if (!expr
->acc
.access
)
1554 return pet_expr_free(expr
);
1559 /* Embed all access subexpressions of "expr" in an extra loop.
1560 * "extend" inserts an outer loop iterator in the iteration domains.
1561 * "iv_map" maps the virtual iterator to the real iterator
1562 * "var_id" represents the induction variable.
1564 static struct pet_expr
*expr_embed(struct pet_expr
*expr
,
1565 __isl_take isl_map
*extend
, __isl_take isl_map
*iv_map
,
1566 __isl_keep isl_id
*var_id
)
1568 struct pet_embed_access data
=
1569 { .extend
= extend
, .iv_map
= iv_map
, .var_id
= var_id
};
1571 expr
= pet_expr_map_access(expr
, &embed_access
, &data
);
1572 isl_map_free(iv_map
);
1573 isl_map_free(extend
);
1577 /* Embed the given pet_stmt in an extra outer loop with iteration domain
1578 * "dom" and schedule "sched". "var_id" represents the induction variable
1579 * of the loop. "iv_map" maps a possibly virtual iterator to the real iterator.
1580 * That is, it maps the iterator used in "dom" and the domain of "sched"
1581 * to the iterator that some of the parameters in "stmt" may refer to.
1583 * The iteration domain and schedule of the statement are updated
1584 * according to the iteration domain and schedule of the new loop.
1585 * If stmt->domain is a wrapped map, then the iteration domain
1586 * is the domain of this map, so we need to be careful to adjust
1589 * If the induction variable appears in the constraints (as a parameter)
1590 * of the current iteration domain or the schedule of the statement,
1591 * then the parameter is equated to the newly introduced iteration
1592 * domain dimension and subsequently projected out.
1594 * Finally, all access relations are updated based on the extra loop.
1596 static struct pet_stmt
*pet_stmt_embed(struct pet_stmt
*stmt
,
1597 __isl_take isl_set
*dom
, __isl_take isl_map
*sched
,
1598 __isl_take isl_map
*iv_map
, __isl_take isl_id
*var_id
)
1609 if (isl_set_is_wrapping(stmt
->domain
)) {
1614 map
= isl_set_unwrap(stmt
->domain
);
1615 stmt_id
= isl_map_get_tuple_id(map
, isl_dim_in
);
1616 ran_dim
= isl_space_range(isl_map_get_space(map
));
1617 ext
= isl_map_from_domain_and_range(isl_set_copy(dom
),
1618 isl_set_universe(ran_dim
));
1619 map
= isl_map_flat_domain_product(ext
, map
);
1620 map
= isl_map_set_tuple_id(map
, isl_dim_in
,
1621 isl_id_copy(stmt_id
));
1622 dim
= isl_space_domain(isl_map_get_space(map
));
1623 stmt
->domain
= isl_map_wrap(map
);
1625 stmt_id
= isl_set_get_tuple_id(stmt
->domain
);
1626 stmt
->domain
= isl_set_flat_product(isl_set_copy(dom
),
1628 stmt
->domain
= isl_set_set_tuple_id(stmt
->domain
,
1629 isl_id_copy(stmt_id
));
1630 dim
= isl_set_get_space(stmt
->domain
);
1633 pos
= isl_set_find_dim_by_id(stmt
->domain
, isl_dim_param
, var_id
);
1635 stmt
->domain
= internalize_iv(stmt
->domain
, pos
,
1636 isl_map_copy(iv_map
));
1638 stmt
->schedule
= isl_map_flat_product(sched
, stmt
->schedule
);
1639 stmt
->schedule
= isl_map_set_tuple_id(stmt
->schedule
,
1640 isl_dim_in
, stmt_id
);
1642 pos
= isl_map_find_dim_by_id(stmt
->schedule
, isl_dim_param
, var_id
);
1644 isl_set
*set
= isl_map_wrap(stmt
->schedule
);
1645 set
= internalize_iv(set
, pos
, isl_map_copy(iv_map
));
1646 stmt
->schedule
= isl_set_unwrap(set
);
1649 dim
= isl_space_map_from_set(dim
);
1650 extend
= isl_map_identity(dim
);
1651 extend
= isl_map_remove_dims(extend
, isl_dim_in
, 0, 1);
1652 extend
= isl_map_set_tuple_id(extend
, isl_dim_in
,
1653 isl_map_get_tuple_id(extend
, isl_dim_out
));
1654 for (i
= 0; i
< stmt
->n_arg
; ++i
)
1655 stmt
->args
[i
] = expr_embed(stmt
->args
[i
], isl_map_copy(extend
),
1656 isl_map_copy(iv_map
), var_id
);
1657 stmt
->body
= expr_embed(stmt
->body
, extend
, iv_map
, var_id
);
1660 isl_id_free(var_id
);
1662 for (i
= 0; i
< stmt
->n_arg
; ++i
)
1664 return pet_stmt_free(stmt
);
1665 if (!stmt
->domain
|| !stmt
->schedule
|| !stmt
->body
)
1666 return pet_stmt_free(stmt
);
1670 isl_map_free(sched
);
1671 isl_map_free(iv_map
);
1672 isl_id_free(var_id
);
1676 /* Embed the given pet_array in an extra outer loop with iteration domain
1678 * This embedding only has an effect on virtual arrays (those with
1679 * user pointer equal to NULL), which need to be extended along with
1680 * the iteration domain.
1682 static struct pet_array
*pet_array_embed(struct pet_array
*array
,
1683 __isl_take isl_set
*dom
)
1685 isl_id
*array_id
= NULL
;
1690 if (isl_set_has_tuple_id(array
->extent
))
1691 array_id
= isl_set_get_tuple_id(array
->extent
);
1693 if (array_id
&& !isl_id_get_user(array_id
)) {
1694 array
->extent
= isl_set_flat_product(dom
, array
->extent
);
1695 array
->extent
= isl_set_set_tuple_id(array
->extent
, array_id
);
1697 return pet_array_free(array
);
1700 isl_id_free(array_id
);
1709 /* Project out all unnamed parameters from "set" and return the result.
1711 static __isl_give isl_set
*set_project_out_unnamed_params(
1712 __isl_take isl_set
*set
)
1716 n
= isl_set_dim(set
, isl_dim_param
);
1717 for (i
= n
- 1; i
>= 0; --i
) {
1718 if (isl_set_has_dim_name(set
, isl_dim_param
, i
))
1720 set
= isl_set_project_out(set
, isl_dim_param
, i
, 1);
1726 /* Update the context with respect to an embedding into a loop
1727 * with iteration domain "dom" and induction variable "id".
1728 * "iv_map" maps a possibly virtual iterator (used in "dom")
1729 * to the real iterator (parameter "id").
1731 * If the current context is independent of "id", we don't need
1733 * Otherwise, a parameter value is invalid for the embedding if
1734 * any of the corresponding iterator values is invalid.
1735 * That is, a parameter value is valid only if all the corresponding
1736 * iterator values are valid.
1737 * We therefore compute the set of parameters
1739 * forall i in dom : valid (i)
1743 * not exists i in dom : not valid(i)
1747 * not exists i in dom \ valid(i)
1749 * Before we subtract valid(i) from dom, we first need to map
1750 * the real iterator to the virtual iterator.
1752 * If there are any unnamed parameters in "dom", then we consider
1753 * a parameter value to be valid if it is valid for any value of those
1754 * unnamed parameters. They are therefore projected out at the end.
1756 static __isl_give isl_set
*context_embed(__isl_take isl_set
*context
,
1757 __isl_keep isl_set
*dom
, __isl_keep isl_map
*iv_map
,
1758 __isl_keep isl_id
*id
)
1762 pos
= isl_set_find_dim_by_id(context
, isl_dim_param
, id
);
1766 context
= isl_set_from_params(context
);
1767 context
= isl_set_add_dims(context
, isl_dim_set
, 1);
1768 context
= isl_set_equate(context
, isl_dim_param
, pos
, isl_dim_set
, 0);
1769 context
= isl_set_project_out(context
, isl_dim_param
, pos
, 1);
1770 context
= isl_set_apply(context
, isl_map_reverse(isl_map_copy(iv_map
)));
1771 context
= isl_set_subtract(isl_set_copy(dom
), context
);
1772 context
= isl_set_params(context
);
1773 context
= isl_set_complement(context
);
1774 context
= set_project_out_unnamed_params(context
);
1778 /* Update the implication with respect to an embedding into a loop
1779 * with iteration domain "dom".
1781 * Since embed_access extends virtual arrays along with the domain
1782 * of the access, we need to do the same with domain and range
1783 * of the implication. Since the original implication is only valid
1784 * within a given iteration of the loop, the extended implication
1785 * maps the extra array dimension corresponding to the extra loop
1788 static struct pet_implication
*pet_implication_embed(
1789 struct pet_implication
*implication
, __isl_take isl_set
*dom
)
1797 map
= isl_set_identity(dom
);
1798 id
= isl_map_get_tuple_id(implication
->extension
, isl_dim_in
);
1799 map
= isl_map_flat_product(map
, implication
->extension
);
1800 map
= isl_map_set_tuple_id(map
, isl_dim_in
, isl_id_copy(id
));
1801 map
= isl_map_set_tuple_id(map
, isl_dim_out
, id
);
1802 implication
->extension
= map
;
1803 if (!implication
->extension
)
1804 return pet_implication_free(implication
);
1812 /* Embed all statements and arrays in "scop" in an extra outer loop
1813 * with iteration domain "dom" and schedule "sched".
1814 * "id" represents the induction variable of the loop.
1815 * "iv_map" maps a possibly virtual iterator to the real iterator.
1816 * That is, it maps the iterator used in "dom" and the domain of "sched"
1817 * to the iterator that some of the parameters in "scop" may refer to.
1819 * Any skip conditions within the loop have no effect outside of the loop.
1820 * The caller is responsible for making sure skip[pet_skip_later] has been
1821 * taken into account.
1823 struct pet_scop
*pet_scop_embed(struct pet_scop
*scop
, __isl_take isl_set
*dom
,
1824 __isl_take isl_map
*sched
, __isl_take isl_map
*iv_map
,
1825 __isl_take isl_id
*id
)
1832 pet_scop_reset_skip(scop
, pet_skip_now
);
1833 pet_scop_reset_skip(scop
, pet_skip_later
);
1835 scop
->context
= context_embed(scop
->context
, dom
, iv_map
, id
);
1839 for (i
= 0; i
< scop
->n_stmt
; ++i
) {
1840 scop
->stmts
[i
] = pet_stmt_embed(scop
->stmts
[i
],
1841 isl_set_copy(dom
), isl_map_copy(sched
),
1842 isl_map_copy(iv_map
), isl_id_copy(id
));
1843 if (!scop
->stmts
[i
])
1847 for (i
= 0; i
< scop
->n_array
; ++i
) {
1848 scop
->arrays
[i
] = pet_array_embed(scop
->arrays
[i
],
1850 if (!scop
->arrays
[i
])
1854 for (i
= 0; i
< scop
->n_implication
; ++i
) {
1855 scop
->implications
[i
] =
1856 pet_implication_embed(scop
->implications
[i
],
1858 if (!scop
->implications
[i
])
1863 isl_map_free(sched
);
1864 isl_map_free(iv_map
);
1869 isl_map_free(sched
);
1870 isl_map_free(iv_map
);
1872 return pet_scop_free(scop
);
1875 /* Add extra conditions on the parameters to iteration domain of "stmt".
1877 static struct pet_stmt
*stmt_restrict(struct pet_stmt
*stmt
,
1878 __isl_take isl_set
*cond
)
1883 stmt
->domain
= isl_set_intersect_params(stmt
->domain
, cond
);
1888 return pet_stmt_free(stmt
);
1891 /* Add extra conditions to scop->skip[type].
1893 * The new skip condition only holds if it held before
1894 * and the condition is true. It does not hold if it did not hold
1895 * before or the condition is false.
1897 * The skip condition is assumed to be an affine expression.
1899 static struct pet_scop
*pet_scop_restrict_skip(struct pet_scop
*scop
,
1900 enum pet_skip type
, __isl_keep isl_set
*cond
)
1902 struct pet_scop_ext
*ext
= (struct pet_scop_ext
*) scop
;
1908 if (!ext
->skip
[type
])
1911 if (!set_is_affine(ext
->skip
[type
]))
1912 isl_die(isl_set_get_ctx(ext
->skip
[type
]), isl_error_internal
,
1913 "can only resrict affine skips",
1914 return pet_scop_free(scop
));
1916 skip
= ext
->skip
[type
];
1917 skip
= isl_set_intersect_params(skip
, isl_set_copy(cond
));
1918 set
= isl_set_from_params(isl_set_copy(cond
));
1919 set
= isl_set_complement(set
);
1920 set
= isl_set_add_dims(set
, isl_dim_set
, 1);
1921 set
= isl_set_fix_si(set
, isl_dim_set
, 0, 0);
1922 skip
= isl_set_union(skip
, set
);
1923 ext
->skip
[type
] = skip
;
1924 if (!ext
->skip
[type
])
1925 return pet_scop_free(scop
);
1930 /* Add extra conditions on the parameters to all iteration domains
1931 * and skip conditions.
1933 * A parameter value is valid for the result if it was valid
1934 * for the original scop and satisfies "cond" or if it does
1935 * not satisfy "cond" as in this case the scop is not executed
1936 * and the original constraints on the parameters are irrelevant.
1938 struct pet_scop
*pet_scop_restrict(struct pet_scop
*scop
,
1939 __isl_take isl_set
*cond
)
1943 scop
= pet_scop_restrict_skip(scop
, pet_skip_now
, cond
);
1944 scop
= pet_scop_restrict_skip(scop
, pet_skip_later
, cond
);
1949 scop
->context
= isl_set_intersect(scop
->context
, isl_set_copy(cond
));
1950 scop
->context
= isl_set_union(scop
->context
,
1951 isl_set_complement(isl_set_copy(cond
)));
1952 scop
->context
= isl_set_coalesce(scop
->context
);
1953 scop
->context
= set_project_out_unnamed_params(scop
->context
);
1957 for (i
= 0; i
< scop
->n_stmt
; ++i
) {
1958 scop
->stmts
[i
] = stmt_restrict(scop
->stmts
[i
],
1959 isl_set_copy(cond
));
1960 if (!scop
->stmts
[i
])
1968 return pet_scop_free(scop
);
1971 /* Construct a map that inserts a filter value with name "id" and value
1972 * "satisfied" in the list of filter values embedded in the set space "space".
1974 * If "space" does not contain any filter values yet, we first create
1975 * a map that inserts 0 filter values, i.e.,
1977 * space -> [space -> []]
1979 * We can now assume that space is of the form [dom -> [filters]]
1980 * We construct an identity mapping on dom and a mapping on filters
1981 * that inserts the new filter
1984 * [filters] -> [satisfied, filters]
1986 * and then compute the cross product
1988 * [dom -> [filters]] -> [dom -> [satisfied, filters]]
1990 static __isl_give isl_map
*insert_filter_map(__isl_take isl_space
*space
,
1991 __isl_take isl_id
*id
, int satisfied
)
1994 isl_map
*map
, *map_dom
, *map_ran
;
1997 if (isl_space_is_wrapping(space
)) {
1998 space2
= isl_space_map_from_set(isl_space_copy(space
));
1999 map
= isl_map_identity(space2
);
2000 space
= isl_space_unwrap(space
);
2002 space
= isl_space_from_domain(space
);
2003 map
= isl_map_universe(isl_space_copy(space
));
2004 map
= isl_map_reverse(isl_map_domain_map(map
));
2007 space2
= isl_space_domain(isl_space_copy(space
));
2008 map_dom
= isl_map_identity(isl_space_map_from_set(space2
));
2009 space
= isl_space_range(space
);
2010 map_ran
= isl_map_identity(isl_space_map_from_set(space
));
2011 map_ran
= isl_map_insert_dims(map_ran
, isl_dim_out
, 0, 1);
2012 map_ran
= isl_map_set_dim_id(map_ran
, isl_dim_out
, 0, id
);
2013 map_ran
= isl_map_fix_si(map_ran
, isl_dim_out
, 0, satisfied
);
2015 map
= isl_map_apply_range(map
, isl_map_product(map_dom
, map_ran
));
2020 /* Insert an argument expression corresponding to "test" in front
2021 * of the list of arguments described by *n_arg and *args.
2023 static int args_insert_access(unsigned *n_arg
, struct pet_expr
***args
,
2024 __isl_keep isl_map
*test
)
2027 isl_ctx
*ctx
= isl_map_get_ctx(test
);
2033 *args
= isl_calloc_array(ctx
, struct pet_expr
*, 1);
2037 struct pet_expr
**ext
;
2038 ext
= isl_calloc_array(ctx
, struct pet_expr
*, 1 + *n_arg
);
2041 for (i
= 0; i
< *n_arg
; ++i
)
2042 ext
[1 + i
] = (*args
)[i
];
2047 (*args
)[0] = pet_expr_from_access(isl_map_copy(test
));
2054 /* Make the expression "expr" depend on the value of "test"
2055 * being equal to "satisfied".
2057 * If "test" is an affine expression, we simply add the conditions
2058 * on the expression have the value "satisfied" to all access relations.
2060 * Otherwise, we add a filter to "expr" (which is then assumed to be
2061 * an access expression) corresponding to "test" being equal to "satisfied".
2063 struct pet_expr
*pet_expr_filter(struct pet_expr
*expr
,
2064 __isl_take isl_map
*test
, int satisfied
)
2074 if (!isl_map_has_tuple_id(test
, isl_dim_out
)) {
2075 test
= isl_map_fix_si(test
, isl_dim_out
, 0, satisfied
);
2076 return pet_expr_restrict(expr
, isl_map_params(test
));
2079 ctx
= isl_map_get_ctx(test
);
2080 if (expr
->type
!= pet_expr_access
)
2081 isl_die(ctx
, isl_error_invalid
,
2082 "can only filter access expressions", goto error
);
2084 space
= isl_space_domain(isl_map_get_space(expr
->acc
.access
));
2085 id
= isl_map_get_tuple_id(test
, isl_dim_out
);
2086 map
= insert_filter_map(space
, id
, satisfied
);
2088 expr
->acc
.access
= isl_map_apply_domain(expr
->acc
.access
, map
);
2089 if (!expr
->acc
.access
)
2092 if (args_insert_access(&expr
->n_arg
, &expr
->args
, test
) < 0)
2099 return pet_expr_free(expr
);
2102 /* Look through the applications in "scop" for any that can be
2103 * applied to the filter expressed by "map" and "satisified".
2104 * If there is any, then apply it to "map" and return the result.
2105 * Otherwise, return "map".
2106 * "id" is the identifier of the virtual array.
2108 * We only introduce at most one implication for any given virtual array,
2109 * so we can apply the implication and return as soon as we find one.
2111 static __isl_give isl_map
*apply_implications(struct pet_scop
*scop
,
2112 __isl_take isl_map
*map
, __isl_keep isl_id
*id
, int satisfied
)
2116 for (i
= 0; i
< scop
->n_implication
; ++i
) {
2117 struct pet_implication
*pi
= scop
->implications
[i
];
2120 if (pi
->satisfied
!= satisfied
)
2122 pi_id
= isl_map_get_tuple_id(pi
->extension
, isl_dim_in
);
2127 return isl_map_apply_range(map
, isl_map_copy(pi
->extension
));
2133 /* Is the filter expressed by "test" and "satisfied" implied
2134 * by filter "pos" on "domain", with filter "expr", taking into
2135 * account the implications of "scop"?
2137 * For filter on domain implying that expressed by "test" and "satisfied",
2138 * the filter needs to be an access to the same (virtual) array as "test" and
2139 * the filter value needs to be equal to "satisfied".
2140 * Moreover, the filter access relation, possibly extended by
2141 * the implications in "scop" needs to contain "test".
2143 static int implies_filter(struct pet_scop
*scop
,
2144 __isl_keep isl_map
*domain
, int pos
, struct pet_expr
*expr
,
2145 __isl_keep isl_map
*test
, int satisfied
)
2147 isl_id
*test_id
, *arg_id
;
2154 if (expr
->type
!= pet_expr_access
)
2156 test_id
= isl_map_get_tuple_id(test
, isl_dim_out
);
2157 arg_id
= pet_expr_access_get_id(expr
);
2158 isl_id_free(arg_id
);
2159 isl_id_free(test_id
);
2160 if (test_id
!= arg_id
)
2162 val
= isl_map_plain_get_val_if_fixed(domain
, isl_dim_out
, pos
);
2163 is_int
= isl_val_is_int(val
);
2165 s
= isl_val_get_num_si(val
);
2174 implied
= isl_map_copy(expr
->acc
.access
);
2175 implied
= apply_implications(scop
, implied
, test_id
, satisfied
);
2176 is_subset
= isl_map_is_subset(test
, implied
);
2177 isl_map_free(implied
);
2182 /* Is the filter expressed by "test" and "satisfied" implied
2183 * by any of the filters on the domain of "stmt", taking into
2184 * account the implications of "scop"?
2186 static int filter_implied(struct pet_scop
*scop
,
2187 struct pet_stmt
*stmt
, __isl_keep isl_map
*test
, int satisfied
)
2194 if (!scop
|| !stmt
|| !test
)
2196 if (scop
->n_implication
== 0)
2198 if (stmt
->n_arg
== 0)
2201 domain
= isl_set_unwrap(isl_set_copy(stmt
->domain
));
2204 for (i
= 0; i
< stmt
->n_arg
; ++i
) {
2205 implied
= implies_filter(scop
, domain
, i
, stmt
->args
[i
],
2207 if (implied
< 0 || implied
)
2211 isl_map_free(domain
);
2215 /* Make the statement "stmt" depend on the value of "test"
2216 * being equal to "satisfied" by adjusting stmt->domain.
2218 * The domain of "test" corresponds to the (zero or more) outer dimensions
2219 * of the iteration domain.
2221 * We first extend "test" to apply to the entire iteration domain and
2222 * then check if the filter that we are about to add is implied
2223 * by any of the current filters, possibly taking into account
2224 * the implications in "scop". If so, we leave "stmt" untouched and return.
2226 * Otherwise, we insert an argument corresponding to a read to "test"
2227 * from the iteration domain of "stmt" in front of the list of arguments.
2228 * We also insert a corresponding output dimension in the wrapped
2229 * map contained in stmt->domain, with value set to "satisfied".
2231 static struct pet_stmt
*stmt_filter(struct pet_scop
*scop
,
2232 struct pet_stmt
*stmt
, __isl_take isl_map
*test
, int satisfied
)
2238 isl_map
*map
, *add_dom
;
2246 space
= isl_set_get_space(stmt
->domain
);
2247 if (isl_space_is_wrapping(space
))
2248 space
= isl_space_domain(isl_space_unwrap(space
));
2249 dom
= isl_set_universe(space
);
2250 n_test_dom
= isl_map_dim(test
, isl_dim_in
);
2251 add_dom
= isl_map_from_range(dom
);
2252 add_dom
= isl_map_add_dims(add_dom
, isl_dim_in
, n_test_dom
);
2253 for (i
= 0; i
< n_test_dom
; ++i
)
2254 add_dom
= isl_map_equate(add_dom
, isl_dim_in
, i
,
2256 test
= isl_map_apply_domain(test
, add_dom
);
2258 implied
= filter_implied(scop
, stmt
, test
, satisfied
);
2266 id
= isl_map_get_tuple_id(test
, isl_dim_out
);
2267 map
= insert_filter_map(isl_set_get_space(stmt
->domain
), id
, satisfied
);
2268 stmt
->domain
= isl_set_apply(stmt
->domain
, map
);
2270 if (args_insert_access(&stmt
->n_arg
, &stmt
->args
, test
) < 0)
2277 return pet_stmt_free(stmt
);
2280 /* Does "scop" have a skip condition of the given "type"?
2282 int pet_scop_has_skip(struct pet_scop
*scop
, enum pet_skip type
)
2284 struct pet_scop_ext
*ext
= (struct pet_scop_ext
*) scop
;
2288 return ext
->skip
[type
] != NULL
;
2291 /* Does "scop" have a skip condition of the given "type" that
2292 * is an affine expression?
2294 int pet_scop_has_affine_skip(struct pet_scop
*scop
, enum pet_skip type
)
2296 struct pet_scop_ext
*ext
= (struct pet_scop_ext
*) scop
;
2300 if (!ext
->skip
[type
])
2302 return set_is_affine(ext
->skip
[type
]);
2305 /* Does "scop" have a skip condition of the given "type" that
2306 * is not an affine expression?
2308 int pet_scop_has_var_skip(struct pet_scop
*scop
, enum pet_skip type
)
2310 struct pet_scop_ext
*ext
= (struct pet_scop_ext
*) scop
;
2315 if (!ext
->skip
[type
])
2317 aff
= set_is_affine(ext
->skip
[type
]);
2323 /* Does "scop" have a skip condition of the given "type" that
2324 * is affine and holds on the entire domain?
2326 int pet_scop_has_universal_skip(struct pet_scop
*scop
, enum pet_skip type
)
2328 struct pet_scop_ext
*ext
= (struct pet_scop_ext
*) scop
;
2333 is_aff
= pet_scop_has_affine_skip(scop
, type
);
2334 if (is_aff
< 0 || !is_aff
)
2337 set
= isl_set_copy(ext
->skip
[type
]);
2338 set
= isl_set_fix_si(set
, isl_dim_set
, 0, 1);
2339 set
= isl_set_params(set
);
2340 is_univ
= isl_set_plain_is_universe(set
);
2346 /* Replace scop->skip[type] by "skip".
2348 struct pet_scop
*pet_scop_set_skip(struct pet_scop
*scop
,
2349 enum pet_skip type
, __isl_take isl_set
*skip
)
2351 struct pet_scop_ext
*ext
= (struct pet_scop_ext
*) scop
;
2356 isl_set_free(ext
->skip
[type
]);
2357 ext
->skip
[type
] = skip
;
2362 return pet_scop_free(scop
);
2365 /* Return a copy of scop->skip[type].
2367 __isl_give isl_set
*pet_scop_get_skip(struct pet_scop
*scop
,
2370 struct pet_scop_ext
*ext
= (struct pet_scop_ext
*) scop
;
2375 return isl_set_copy(ext
->skip
[type
]);
2378 /* Assuming scop->skip[type] is an affine expression,
2379 * return the constraints on the parameters for which the skip condition
2382 __isl_give isl_set
*pet_scop_get_affine_skip_domain(struct pet_scop
*scop
,
2387 skip
= pet_scop_get_skip(scop
, type
);
2388 skip
= isl_set_fix_si(skip
, isl_dim_set
, 0, 1);
2389 skip
= isl_set_params(skip
);
2394 /* Return a map to the skip condition of the given type.
2396 __isl_give isl_map
*pet_scop_get_skip_map(struct pet_scop
*scop
,
2399 return isl_map_from_range(pet_scop_get_skip(scop
, type
));
2402 /* Return the identifier of the variable that is accessed by
2403 * the skip condition of the given type.
2405 * The skip condition is assumed not to be an affine condition.
2407 __isl_give isl_id
*pet_scop_get_skip_id(struct pet_scop
*scop
,
2410 struct pet_scop_ext
*ext
= (struct pet_scop_ext
*) scop
;
2415 return isl_set_get_tuple_id(ext
->skip
[type
]);
2418 /* Return an access pet_expr corresponding to the skip condition
2419 * of the given type.
2421 struct pet_expr
*pet_scop_get_skip_expr(struct pet_scop
*scop
,
2424 return pet_expr_from_access(pet_scop_get_skip_map(scop
, type
));
2427 /* Drop the the skip condition scop->skip[type].
2429 void pet_scop_reset_skip(struct pet_scop
*scop
, enum pet_skip type
)
2431 struct pet_scop_ext
*ext
= (struct pet_scop_ext
*) scop
;
2436 isl_set_free(ext
->skip
[type
]);
2437 ext
->skip
[type
] = NULL
;
2440 /* Make the skip condition (if any) depend on the value of "test" being
2441 * equal to "satisfied".
2443 * We only support the case where the original skip condition is universal,
2444 * i.e., where skipping is unconditional, and where satisfied == 1.
2445 * In this case, the skip condition is changed to skip only when
2446 * "test" is equal to one.
2448 static struct pet_scop
*pet_scop_filter_skip(struct pet_scop
*scop
,
2449 enum pet_skip type
, __isl_keep isl_map
*test
, int satisfied
)
2455 if (!pet_scop_has_skip(scop
, type
))
2459 is_univ
= pet_scop_has_universal_skip(scop
, type
);
2461 return pet_scop_free(scop
);
2462 if (satisfied
&& is_univ
) {
2463 scop
= pet_scop_set_skip(scop
, type
,
2464 isl_map_range(isl_map_copy(test
)));
2468 isl_die(isl_map_get_ctx(test
), isl_error_internal
,
2469 "skip expression cannot be filtered",
2470 return pet_scop_free(scop
));
2476 /* Make all statements in "scop" depend on the value of "test"
2477 * being equal to "satisfied" by adjusting their domains.
2479 struct pet_scop
*pet_scop_filter(struct pet_scop
*scop
,
2480 __isl_take isl_map
*test
, int satisfied
)
2484 scop
= pet_scop_filter_skip(scop
, pet_skip_now
, test
, satisfied
);
2485 scop
= pet_scop_filter_skip(scop
, pet_skip_later
, test
, satisfied
);
2490 for (i
= 0; i
< scop
->n_stmt
; ++i
) {
2491 scop
->stmts
[i
] = stmt_filter(scop
, scop
->stmts
[i
],
2492 isl_map_copy(test
), satisfied
);
2493 if (!scop
->stmts
[i
])
2501 return pet_scop_free(scop
);
2504 /* Add all parameters in "expr" to "dim" and return the result.
2506 static __isl_give isl_space
*expr_collect_params(struct pet_expr
*expr
,
2507 __isl_take isl_space
*dim
)
2513 for (i
= 0; i
< expr
->n_arg
; ++i
)
2515 dim
= expr_collect_params(expr
->args
[i
], dim
);
2517 if (expr
->type
== pet_expr_access
)
2518 dim
= isl_space_align_params(dim
,
2519 isl_map_get_space(expr
->acc
.access
));
2523 isl_space_free(dim
);
2524 return pet_expr_free(expr
);
2527 /* Add all parameters in "stmt" to "dim" and return the result.
2529 static __isl_give isl_space
*stmt_collect_params(struct pet_stmt
*stmt
,
2530 __isl_take isl_space
*dim
)
2535 dim
= isl_space_align_params(dim
, isl_set_get_space(stmt
->domain
));
2536 dim
= isl_space_align_params(dim
, isl_map_get_space(stmt
->schedule
));
2537 dim
= expr_collect_params(stmt
->body
, dim
);
2541 isl_space_free(dim
);
2542 return pet_stmt_free(stmt
);
2545 /* Add all parameters in "array" to "dim" and return the result.
2547 static __isl_give isl_space
*array_collect_params(struct pet_array
*array
,
2548 __isl_take isl_space
*dim
)
2553 dim
= isl_space_align_params(dim
, isl_set_get_space(array
->context
));
2554 dim
= isl_space_align_params(dim
, isl_set_get_space(array
->extent
));
2558 pet_array_free(array
);
2559 return isl_space_free(dim
);
2562 /* Add all parameters in "scop" to "dim" and return the result.
2564 static __isl_give isl_space
*scop_collect_params(struct pet_scop
*scop
,
2565 __isl_take isl_space
*dim
)
2572 for (i
= 0; i
< scop
->n_array
; ++i
)
2573 dim
= array_collect_params(scop
->arrays
[i
], dim
);
2575 for (i
= 0; i
< scop
->n_stmt
; ++i
)
2576 dim
= stmt_collect_params(scop
->stmts
[i
], dim
);
2580 isl_space_free(dim
);
2581 return pet_scop_free(scop
);
2584 /* Add all parameters in "dim" to all access relations in "expr".
2586 static struct pet_expr
*expr_propagate_params(struct pet_expr
*expr
,
2587 __isl_take isl_space
*dim
)
2594 for (i
= 0; i
< expr
->n_arg
; ++i
) {
2596 expr_propagate_params(expr
->args
[i
],
2597 isl_space_copy(dim
));
2602 if (expr
->type
== pet_expr_access
) {
2603 expr
->acc
.access
= isl_map_align_params(expr
->acc
.access
,
2604 isl_space_copy(dim
));
2605 if (!expr
->acc
.access
)
2609 isl_space_free(dim
);
2612 isl_space_free(dim
);
2613 return pet_expr_free(expr
);
2616 /* Add all parameters in "dim" to the domain, schedule and
2617 * all access relations in "stmt".
2619 static struct pet_stmt
*stmt_propagate_params(struct pet_stmt
*stmt
,
2620 __isl_take isl_space
*dim
)
2625 stmt
->domain
= isl_set_align_params(stmt
->domain
, isl_space_copy(dim
));
2626 stmt
->schedule
= isl_map_align_params(stmt
->schedule
,
2627 isl_space_copy(dim
));
2628 stmt
->body
= expr_propagate_params(stmt
->body
, isl_space_copy(dim
));
2630 if (!stmt
->domain
|| !stmt
->schedule
|| !stmt
->body
)
2633 isl_space_free(dim
);
2636 isl_space_free(dim
);
2637 return pet_stmt_free(stmt
);
2640 /* Add all parameters in "dim" to "array".
2642 static struct pet_array
*array_propagate_params(struct pet_array
*array
,
2643 __isl_take isl_space
*dim
)
2648 array
->context
= isl_set_align_params(array
->context
,
2649 isl_space_copy(dim
));
2650 array
->extent
= isl_set_align_params(array
->extent
,
2651 isl_space_copy(dim
));
2652 if (array
->value_bounds
) {
2653 array
->value_bounds
= isl_set_align_params(array
->value_bounds
,
2654 isl_space_copy(dim
));
2655 if (!array
->value_bounds
)
2659 if (!array
->context
|| !array
->extent
)
2662 isl_space_free(dim
);
2665 isl_space_free(dim
);
2666 return pet_array_free(array
);
2669 /* Add all parameters in "dim" to "scop".
2671 static struct pet_scop
*scop_propagate_params(struct pet_scop
*scop
,
2672 __isl_take isl_space
*dim
)
2679 for (i
= 0; i
< scop
->n_array
; ++i
) {
2680 scop
->arrays
[i
] = array_propagate_params(scop
->arrays
[i
],
2681 isl_space_copy(dim
));
2682 if (!scop
->arrays
[i
])
2686 for (i
= 0; i
< scop
->n_stmt
; ++i
) {
2687 scop
->stmts
[i
] = stmt_propagate_params(scop
->stmts
[i
],
2688 isl_space_copy(dim
));
2689 if (!scop
->stmts
[i
])
2693 isl_space_free(dim
);
2696 isl_space_free(dim
);
2697 return pet_scop_free(scop
);
2700 /* Update all isl_sets and isl_maps in "scop" such that they all
2701 * have the same parameters.
2703 struct pet_scop
*pet_scop_align_params(struct pet_scop
*scop
)
2710 dim
= isl_set_get_space(scop
->context
);
2711 dim
= scop_collect_params(scop
, dim
);
2713 scop
->context
= isl_set_align_params(scop
->context
, isl_space_copy(dim
));
2714 scop
= scop_propagate_params(scop
, dim
);
2719 /* Check if the given access relation accesses a (0D) array that corresponds
2720 * to one of the parameters in "dim". If so, replace the array access
2721 * by an access to the set of integers with as index (and value)
2724 static __isl_give isl_map
*access_detect_parameter(__isl_take isl_map
*access
,
2725 __isl_take isl_space
*dim
)
2727 isl_id
*array_id
= NULL
;
2730 if (isl_map_has_tuple_id(access
, isl_dim_out
)) {
2731 array_id
= isl_map_get_tuple_id(access
, isl_dim_out
);
2732 pos
= isl_space_find_dim_by_id(dim
, isl_dim_param
, array_id
);
2734 isl_space_free(dim
);
2737 isl_id_free(array_id
);
2741 pos
= isl_map_find_dim_by_id(access
, isl_dim_param
, array_id
);
2743 access
= isl_map_insert_dims(access
, isl_dim_param
, 0, 1);
2744 access
= isl_map_set_dim_id(access
, isl_dim_param
, 0, array_id
);
2747 isl_id_free(array_id
);
2749 access
= isl_map_insert_dims(access
, isl_dim_out
, 0, 1);
2750 access
= isl_map_equate(access
, isl_dim_param
, pos
, isl_dim_out
, 0);
2755 /* Replace all accesses to (0D) arrays that correspond to one of the parameters
2756 * in "dim" by a value equal to the corresponding parameter.
2758 static struct pet_expr
*expr_detect_parameter_accesses(struct pet_expr
*expr
,
2759 __isl_take isl_space
*dim
)
2766 for (i
= 0; i
< expr
->n_arg
; ++i
) {
2768 expr_detect_parameter_accesses(expr
->args
[i
],
2769 isl_space_copy(dim
));
2774 if (expr
->type
== pet_expr_access
) {
2775 expr
->acc
.access
= access_detect_parameter(expr
->acc
.access
,
2776 isl_space_copy(dim
));
2777 if (!expr
->acc
.access
)
2781 isl_space_free(dim
);
2784 isl_space_free(dim
);
2785 return pet_expr_free(expr
);
2788 /* Replace all accesses to (0D) arrays that correspond to one of the parameters
2789 * in "dim" by a value equal to the corresponding parameter.
2791 static struct pet_stmt
*stmt_detect_parameter_accesses(struct pet_stmt
*stmt
,
2792 __isl_take isl_space
*dim
)
2797 stmt
->body
= expr_detect_parameter_accesses(stmt
->body
,
2798 isl_space_copy(dim
));
2800 if (!stmt
->domain
|| !stmt
->schedule
|| !stmt
->body
)
2803 isl_space_free(dim
);
2806 isl_space_free(dim
);
2807 return pet_stmt_free(stmt
);
2810 /* Replace all accesses to (0D) arrays that correspond to one of the parameters
2811 * in "dim" by a value equal to the corresponding parameter.
2813 static struct pet_scop
*scop_detect_parameter_accesses(struct pet_scop
*scop
,
2814 __isl_take isl_space
*dim
)
2821 for (i
= 0; i
< scop
->n_stmt
; ++i
) {
2822 scop
->stmts
[i
] = stmt_detect_parameter_accesses(scop
->stmts
[i
],
2823 isl_space_copy(dim
));
2824 if (!scop
->stmts
[i
])
2828 isl_space_free(dim
);
2831 isl_space_free(dim
);
2832 return pet_scop_free(scop
);
2835 /* Replace all accesses to (0D) arrays that correspond to any of
2836 * the parameters used in "scop" by a value equal
2837 * to the corresponding parameter.
2839 struct pet_scop
*pet_scop_detect_parameter_accesses(struct pet_scop
*scop
)
2846 dim
= isl_set_get_space(scop
->context
);
2847 dim
= scop_collect_params(scop
, dim
);
2849 scop
= scop_detect_parameter_accesses(scop
, dim
);
2854 /* Add all read access relations (if "read" is set) and/or all write
2855 * access relations (if "write" is set) to "accesses" and return the result.
2857 static __isl_give isl_union_map
*expr_collect_accesses(struct pet_expr
*expr
,
2858 int read
, int write
, __isl_take isl_union_map
*accesses
)
2867 for (i
= 0; i
< expr
->n_arg
; ++i
)
2868 accesses
= expr_collect_accesses(expr
->args
[i
],
2869 read
, write
, accesses
);
2871 if (expr
->type
== pet_expr_access
&& !pet_expr_is_affine(expr
) &&
2872 ((read
&& expr
->acc
.read
) || (write
&& expr
->acc
.write
)))
2873 accesses
= isl_union_map_add_map(accesses
,
2874 isl_map_copy(expr
->acc
.access
));
2879 /* Collect and return all read access relations (if "read" is set)
2880 * and/or all write access relations (if "write" is set) in "stmt".
2882 static __isl_give isl_union_map
*stmt_collect_accesses(struct pet_stmt
*stmt
,
2883 int read
, int write
, __isl_take isl_space
*dim
)
2885 isl_union_map
*accesses
;
2890 accesses
= isl_union_map_empty(dim
);
2891 accesses
= expr_collect_accesses(stmt
->body
, read
, write
, accesses
);
2892 accesses
= isl_union_map_intersect_domain(accesses
,
2893 isl_union_set_from_set(isl_set_copy(stmt
->domain
)));
2898 /* Collect and return all read access relations (if "read" is set)
2899 * and/or all write access relations (if "write" is set) in "scop".
2901 static __isl_give isl_union_map
*scop_collect_accesses(struct pet_scop
*scop
,
2902 int read
, int write
)
2905 isl_union_map
*accesses
;
2910 accesses
= isl_union_map_empty(isl_set_get_space(scop
->context
));
2912 for (i
= 0; i
< scop
->n_stmt
; ++i
) {
2913 isl_union_map
*accesses_i
;
2914 isl_space
*dim
= isl_set_get_space(scop
->context
);
2915 accesses_i
= stmt_collect_accesses(scop
->stmts
[i
],
2917 accesses
= isl_union_map_union(accesses
, accesses_i
);
2923 __isl_give isl_union_map
*pet_scop_collect_reads(struct pet_scop
*scop
)
2925 return scop_collect_accesses(scop
, 1, 0);
2928 __isl_give isl_union_map
*pet_scop_collect_writes(struct pet_scop
*scop
)
2930 return scop_collect_accesses(scop
, 0, 1);
2933 /* Collect and return the union of iteration domains in "scop".
2935 __isl_give isl_union_set
*pet_scop_collect_domains(struct pet_scop
*scop
)
2939 isl_union_set
*domain
;
2944 domain
= isl_union_set_empty(isl_set_get_space(scop
->context
));
2946 for (i
= 0; i
< scop
->n_stmt
; ++i
) {
2947 domain_i
= isl_set_copy(scop
->stmts
[i
]->domain
);
2948 domain
= isl_union_set_add_set(domain
, domain_i
);
2954 /* Collect and return the schedules of the statements in "scop".
2955 * The range is normalized to the maximal number of scheduling
2958 __isl_give isl_union_map
*pet_scop_collect_schedule(struct pet_scop
*scop
)
2961 isl_map
*schedule_i
;
2962 isl_union_map
*schedule
;
2963 int depth
, max_depth
= 0;
2968 schedule
= isl_union_map_empty(isl_set_get_space(scop
->context
));
2970 for (i
= 0; i
< scop
->n_stmt
; ++i
) {
2971 depth
= isl_map_dim(scop
->stmts
[i
]->schedule
, isl_dim_out
);
2972 if (depth
> max_depth
)
2976 for (i
= 0; i
< scop
->n_stmt
; ++i
) {
2977 schedule_i
= isl_map_copy(scop
->stmts
[i
]->schedule
);
2978 depth
= isl_map_dim(schedule_i
, isl_dim_out
);
2979 schedule_i
= isl_map_add_dims(schedule_i
, isl_dim_out
,
2981 for (j
= depth
; j
< max_depth
; ++j
)
2982 schedule_i
= isl_map_fix_si(schedule_i
,
2984 schedule
= isl_union_map_add_map(schedule
, schedule_i
);
2990 /* Does expression "expr" write to "id"?
2992 static int expr_writes(struct pet_expr
*expr
, __isl_keep isl_id
*id
)
2997 for (i
= 0; i
< expr
->n_arg
; ++i
) {
2998 int writes
= expr_writes(expr
->args
[i
], id
);
2999 if (writes
< 0 || writes
)
3003 if (expr
->type
!= pet_expr_access
)
3005 if (!expr
->acc
.write
)
3007 if (pet_expr_is_affine(expr
))
3010 write_id
= pet_expr_access_get_id(expr
);
3011 isl_id_free(write_id
);
3016 return write_id
== id
;
3019 /* Does statement "stmt" write to "id"?
3021 static int stmt_writes(struct pet_stmt
*stmt
, __isl_keep isl_id
*id
)
3023 return expr_writes(stmt
->body
, id
);
3026 /* Is there any write access in "scop" that accesses "id"?
3028 int pet_scop_writes(struct pet_scop
*scop
, __isl_keep isl_id
*id
)
3035 for (i
= 0; i
< scop
->n_stmt
; ++i
) {
3036 int writes
= stmt_writes(scop
->stmts
[i
], id
);
3037 if (writes
< 0 || writes
)
3044 /* Add a reference identifier to access expression "expr".
3045 * "user" points to an integer that contains the sequence number
3046 * of the next reference.
3048 static struct pet_expr
*access_add_ref_id(struct pet_expr
*expr
, void *user
)
3057 ctx
= isl_map_get_ctx(expr
->acc
.access
);
3058 snprintf(name
, sizeof(name
), "__pet_ref_%d", (*n_ref
)++);
3059 expr
->acc
.ref_id
= isl_id_alloc(ctx
, name
, NULL
);
3060 if (!expr
->acc
.ref_id
)
3061 return pet_expr_free(expr
);
3066 /* Add a reference identifier to all access expressions in "stmt".
3067 * "n_ref" points to an integer that contains the sequence number
3068 * of the next reference.
3070 static struct pet_stmt
*stmt_add_ref_ids(struct pet_stmt
*stmt
, int *n_ref
)
3077 for (i
= 0; i
< stmt
->n_arg
; ++i
) {
3078 stmt
->args
[i
] = pet_expr_map_access(stmt
->args
[i
],
3079 &access_add_ref_id
, n_ref
);
3081 return pet_stmt_free(stmt
);
3084 stmt
->body
= pet_expr_map_access(stmt
->body
, &access_add_ref_id
, n_ref
);
3086 return pet_stmt_free(stmt
);
3091 /* Add a reference identifier to all access expressions in "scop".
3093 struct pet_scop
*pet_scop_add_ref_ids(struct pet_scop
*scop
)
3102 for (i
= 0; i
< scop
->n_stmt
; ++i
) {
3103 scop
->stmts
[i
] = stmt_add_ref_ids(scop
->stmts
[i
], &n_ref
);
3104 if (!scop
->stmts
[i
])
3105 return pet_scop_free(scop
);
3111 /* Reset the user pointer on the tuple id and all parameter ids in "set".
3113 static __isl_give isl_set
*set_anonymize(__isl_take isl_set
*set
)
3117 n
= isl_set_dim(set
, isl_dim_param
);
3118 for (i
= 0; i
< n
; ++i
) {
3119 isl_id
*id
= isl_set_get_dim_id(set
, isl_dim_param
, i
);
3120 const char *name
= isl_id_get_name(id
);
3121 set
= isl_set_set_dim_name(set
, isl_dim_param
, i
, name
);
3125 if (!isl_set_is_params(set
) && isl_set_has_tuple_id(set
)) {
3126 isl_id
*id
= isl_set_get_tuple_id(set
);
3127 const char *name
= isl_id_get_name(id
);
3128 set
= isl_set_set_tuple_name(set
, name
);
3135 /* Reset the user pointer on the tuple ids and all parameter ids in "map".
3137 static __isl_give isl_map
*map_anonymize(__isl_take isl_map
*map
)
3141 n
= isl_map_dim(map
, isl_dim_param
);
3142 for (i
= 0; i
< n
; ++i
) {
3143 isl_id
*id
= isl_map_get_dim_id(map
, isl_dim_param
, i
);
3144 const char *name
= isl_id_get_name(id
);
3145 map
= isl_map_set_dim_name(map
, isl_dim_param
, i
, name
);
3149 if (isl_map_has_tuple_id(map
, isl_dim_in
)) {
3150 isl_id
*id
= isl_map_get_tuple_id(map
, isl_dim_in
);
3151 const char *name
= isl_id_get_name(id
);
3152 map
= isl_map_set_tuple_name(map
, isl_dim_in
, name
);
3156 if (isl_map_has_tuple_id(map
, isl_dim_out
)) {
3157 isl_id
*id
= isl_map_get_tuple_id(map
, isl_dim_out
);
3158 const char *name
= isl_id_get_name(id
);
3159 map
= isl_map_set_tuple_name(map
, isl_dim_out
, name
);
3166 /* Reset the user pointer on all parameter ids in "array".
3168 static struct pet_array
*array_anonymize(struct pet_array
*array
)
3173 array
->context
= set_anonymize(array
->context
);
3174 array
->extent
= set_anonymize(array
->extent
);
3175 if (!array
->context
|| !array
->extent
)
3176 return pet_array_free(array
);
3181 /* Reset the user pointer on all parameter and tuple ids in
3182 * the access relation of the access expression "expr".
3184 static struct pet_expr
*access_anonymize(struct pet_expr
*expr
, void *user
)
3186 expr
->acc
.access
= map_anonymize(expr
->acc
.access
);
3187 if (!expr
->acc
.access
)
3188 return pet_expr_free(expr
);
3193 /* Reset the user pointer on all parameter and tuple ids in "stmt".
3195 static struct pet_stmt
*stmt_anonymize(struct pet_stmt
*stmt
)
3204 stmt
->domain
= set_anonymize(stmt
->domain
);
3205 stmt
->schedule
= map_anonymize(stmt
->schedule
);
3206 if (!stmt
->domain
|| !stmt
->schedule
)
3207 return pet_stmt_free(stmt
);
3209 for (i
= 0; i
< stmt
->n_arg
; ++i
) {
3210 stmt
->args
[i
] = pet_expr_map_access(stmt
->args
[i
],
3211 &access_anonymize
, NULL
);
3213 return pet_stmt_free(stmt
);
3216 stmt
->body
= pet_expr_map_access(stmt
->body
,
3217 &access_anonymize
, NULL
);
3219 return pet_stmt_free(stmt
);
3224 /* Reset the user pointer on the tuple ids and all parameter ids
3227 static struct pet_implication
*implication_anonymize(
3228 struct pet_implication
*implication
)
3233 implication
->extension
= map_anonymize(implication
->extension
);
3234 if (!implication
->extension
)
3235 return pet_implication_free(implication
);
3240 /* Reset the user pointer on all parameter and tuple ids in "scop".
3242 struct pet_scop
*pet_scop_anonymize(struct pet_scop
*scop
)
3249 scop
->context
= set_anonymize(scop
->context
);
3250 scop
->context_value
= set_anonymize(scop
->context_value
);
3251 if (!scop
->context
|| !scop
->context_value
)
3252 return pet_scop_free(scop
);
3254 for (i
= 0; i
< scop
->n_array
; ++i
) {
3255 scop
->arrays
[i
] = array_anonymize(scop
->arrays
[i
]);
3256 if (!scop
->arrays
[i
])
3257 return pet_scop_free(scop
);
3260 for (i
= 0; i
< scop
->n_stmt
; ++i
) {
3261 scop
->stmts
[i
] = stmt_anonymize(scop
->stmts
[i
]);
3262 if (!scop
->stmts
[i
])
3263 return pet_scop_free(scop
);
3266 for (i
= 0; i
< scop
->n_implication
; ++i
) {
3267 scop
->implications
[i
] =
3268 implication_anonymize(scop
->implications
[i
]);
3269 if (!scop
->implications
[i
])
3270 return pet_scop_free(scop
);
3276 /* If "value_bounds" contains any bounds on the variable accessed by "arg",
3277 * then intersect the range of "map" with the valid set of values.
3279 static __isl_give isl_map
*access_apply_value_bounds(__isl_take isl_map
*map
,
3280 struct pet_expr
*arg
, __isl_keep isl_union_map
*value_bounds
)
3285 isl_ctx
*ctx
= isl_map_get_ctx(map
);
3287 id
= pet_expr_access_get_id(arg
);
3288 space
= isl_space_alloc(ctx
, 0, 0, 1);
3289 space
= isl_space_set_tuple_id(space
, isl_dim_in
, id
);
3290 vb
= isl_union_map_extract_map(value_bounds
, space
);
3291 if (!isl_map_plain_is_empty(vb
))
3292 map
= isl_map_intersect_range(map
, isl_map_range(vb
));
3299 /* Given a set "domain", return a wrapped relation with the given set
3300 * as domain and a range of dimension "n_arg", where each coordinate
3301 * is either unbounded or, if the corresponding element of args is of
3302 * type pet_expr_access, bounded by the bounds specified by "value_bounds".
3304 static __isl_give isl_set
*apply_value_bounds(__isl_take isl_set
*domain
,
3305 unsigned n_arg
, struct pet_expr
**args
,
3306 __isl_keep isl_union_map
*value_bounds
)
3312 map
= isl_map_from_domain(domain
);
3313 space
= isl_map_get_space(map
);
3314 space
= isl_space_add_dims(space
, isl_dim_out
, 1);
3316 for (i
= 0; i
< n_arg
; ++i
) {
3318 struct pet_expr
*arg
= args
[i
];
3320 map_i
= isl_map_universe(isl_space_copy(space
));
3321 if (arg
->type
== pet_expr_access
)
3322 map_i
= access_apply_value_bounds(map_i
, arg
,
3324 map
= isl_map_flat_range_product(map
, map_i
);
3326 isl_space_free(space
);
3328 return isl_map_wrap(map
);
3331 /* Data used in access_gist() callback.
3333 struct pet_access_gist_data
{
3335 isl_union_map
*value_bounds
;
3338 /* Given an expression "expr" of type pet_expr_access, compute
3339 * the gist of the associated access relation with respect to
3340 * data->domain and the bounds on the values of the arguments
3341 * of the expression.
3343 static struct pet_expr
*access_gist(struct pet_expr
*expr
, void *user
)
3345 struct pet_access_gist_data
*data
= user
;
3348 domain
= isl_set_copy(data
->domain
);
3349 if (expr
->n_arg
> 0)
3350 domain
= apply_value_bounds(domain
, expr
->n_arg
, expr
->args
,
3351 data
->value_bounds
);
3353 expr
->acc
.access
= isl_map_gist_domain(expr
->acc
.access
, domain
);
3354 if (!expr
->acc
.access
)
3355 return pet_expr_free(expr
);
3360 /* Compute the gist of the iteration domain and all access relations
3361 * of "stmt" based on the constraints on the parameters specified by "context"
3362 * and the constraints on the values of nested accesses specified
3363 * by "value_bounds".
3365 static struct pet_stmt
*stmt_gist(struct pet_stmt
*stmt
,
3366 __isl_keep isl_set
*context
, __isl_keep isl_union_map
*value_bounds
)
3371 struct pet_access_gist_data data
;
3376 data
.domain
= isl_set_copy(stmt
->domain
);
3377 data
.value_bounds
= value_bounds
;
3378 if (stmt
->n_arg
> 0)
3379 data
.domain
= isl_map_domain(isl_set_unwrap(data
.domain
));
3381 data
.domain
= isl_set_intersect_params(data
.domain
,
3382 isl_set_copy(context
));
3384 for (i
= 0; i
< stmt
->n_arg
; ++i
) {
3385 stmt
->args
[i
] = pet_expr_map_access(stmt
->args
[i
],
3386 &access_gist
, &data
);
3391 stmt
->body
= pet_expr_map_access(stmt
->body
, &access_gist
, &data
);
3395 isl_set_free(data
.domain
);
3397 space
= isl_set_get_space(stmt
->domain
);
3398 if (isl_space_is_wrapping(space
))
3399 space
= isl_space_domain(isl_space_unwrap(space
));
3400 domain
= isl_set_universe(space
);
3401 domain
= isl_set_intersect_params(domain
, isl_set_copy(context
));
3402 if (stmt
->n_arg
> 0)
3403 domain
= apply_value_bounds(domain
, stmt
->n_arg
, stmt
->args
,
3405 stmt
->domain
= isl_set_gist(stmt
->domain
, domain
);
3407 return pet_stmt_free(stmt
);
3411 isl_set_free(data
.domain
);
3412 return pet_stmt_free(stmt
);
3415 /* Compute the gist of the extent of the array
3416 * based on the constraints on the parameters specified by "context".
3418 static struct pet_array
*array_gist(struct pet_array
*array
,
3419 __isl_keep isl_set
*context
)
3424 array
->extent
= isl_set_gist_params(array
->extent
,
3425 isl_set_copy(context
));
3427 return pet_array_free(array
);
3432 /* Compute the gist of all sets and relations in "scop"
3433 * based on the constraints on the parameters specified by "scop->context"
3434 * and the constraints on the values of nested accesses specified
3435 * by "value_bounds".
3437 struct pet_scop
*pet_scop_gist(struct pet_scop
*scop
,
3438 __isl_keep isl_union_map
*value_bounds
)
3445 scop
->context
= isl_set_coalesce(scop
->context
);
3447 return pet_scop_free(scop
);
3449 for (i
= 0; i
< scop
->n_array
; ++i
) {
3450 scop
->arrays
[i
] = array_gist(scop
->arrays
[i
], scop
->context
);
3451 if (!scop
->arrays
[i
])
3452 return pet_scop_free(scop
);
3455 for (i
= 0; i
< scop
->n_stmt
; ++i
) {
3456 scop
->stmts
[i
] = stmt_gist(scop
->stmts
[i
], scop
->context
,
3458 if (!scop
->stmts
[i
])
3459 return pet_scop_free(scop
);
3465 /* Intersect the context of "scop" with "context".
3466 * To ensure that we don't introduce any unnamed parameters in
3467 * the context of "scop", we first remove the unnamed parameters
3470 struct pet_scop
*pet_scop_restrict_context(struct pet_scop
*scop
,
3471 __isl_take isl_set
*context
)
3476 context
= set_project_out_unnamed_params(context
);
3477 scop
->context
= isl_set_intersect(scop
->context
, context
);
3479 return pet_scop_free(scop
);
3483 isl_set_free(context
);
3484 return pet_scop_free(scop
);
3487 /* Drop the current context of "scop". That is, replace the context
3488 * by a universal set.
3490 struct pet_scop
*pet_scop_reset_context(struct pet_scop
*scop
)
3497 space
= isl_set_get_space(scop
->context
);
3498 isl_set_free(scop
->context
);
3499 scop
->context
= isl_set_universe(space
);
3501 return pet_scop_free(scop
);
3506 /* Append "array" to the arrays of "scop".
3508 struct pet_scop
*pet_scop_add_array(struct pet_scop
*scop
,
3509 struct pet_array
*array
)
3512 struct pet_array
**arrays
;
3514 if (!array
|| !scop
)
3517 ctx
= isl_set_get_ctx(scop
->context
);
3518 arrays
= isl_realloc_array(ctx
, scop
->arrays
, struct pet_array
*,
3522 scop
->arrays
= arrays
;
3523 scop
->arrays
[scop
->n_array
] = array
;
3528 pet_array_free(array
);
3529 return pet_scop_free(scop
);
3532 /* Create and return an implication on filter values equal to "satisfied"
3533 * with extension "map".
3535 static struct pet_implication
*new_implication(__isl_take isl_map
*map
,
3539 struct pet_implication
*implication
;
3543 ctx
= isl_map_get_ctx(map
);
3544 implication
= isl_alloc_type(ctx
, struct pet_implication
);
3548 implication
->extension
= map
;
3549 implication
->satisfied
= satisfied
;
3557 /* Add an implication on filter values equal to "satisfied"
3558 * with extension "map" to "scop".
3560 struct pet_scop
*pet_scop_add_implication(struct pet_scop
*scop
,
3561 __isl_take isl_map
*map
, int satisfied
)
3564 struct pet_implication
*implication
;
3565 struct pet_implication
**implications
;
3567 implication
= new_implication(map
, satisfied
);
3568 if (!scop
|| !implication
)
3571 ctx
= isl_set_get_ctx(scop
->context
);
3572 implications
= isl_realloc_array(ctx
, scop
->implications
,
3573 struct pet_implication
*,
3574 scop
->n_implication
+ 1);
3577 scop
->implications
= implications
;
3578 scop
->implications
[scop
->n_implication
] = implication
;
3579 scop
->n_implication
++;
3583 pet_implication_free(implication
);
3584 return pet_scop_free(scop
);