4 #include <clang/AST/ASTDiagnostic.h>
5 #include <clang/AST/Expr.h>
6 #include <clang/AST/RecursiveASTVisitor.h>
15 #include "scop_plus.h"
20 using namespace clang
;
22 /* Look for any assignments to variables in part of the parse
23 * tree and set assigned_value to NULL for each of them.
25 * This ensures that we won't use any previously stored value
26 * in the current subtree and its parents.
28 struct clear_assignments
: RecursiveASTVisitor
<clear_assignments
> {
29 map
<ValueDecl
*, Expr
*> &assigned_value
;
31 clear_assignments(map
<ValueDecl
*, Expr
*> &assigned_value
) :
32 assigned_value(assigned_value
) {}
34 bool VisitBinaryOperator(BinaryOperator
*expr
) {
39 if (!expr
->isAssignmentOp())
42 if (lhs
->getStmtClass() != Stmt::DeclRefExprClass
)
44 ref
= cast
<DeclRefExpr
>(lhs
);
45 decl
= ref
->getDecl();
46 assigned_value
[decl
] = NULL
;
51 /* Keep a copy of the currently assigned values.
53 * Any variable that is assigned a value inside the current scope
54 * is removed again when we leave the scope (either because it wasn't
55 * stored in the cache or because it has a different value in the cache).
57 struct assigned_value_cache
{
58 map
<ValueDecl
*, Expr
*> &assigned_value
;
59 map
<ValueDecl
*, Expr
*> cache
;
61 assigned_value_cache(map
<ValueDecl
*, Expr
*> &assigned_value
) :
62 assigned_value(assigned_value
), cache(assigned_value
) {}
63 ~assigned_value_cache() {
64 map
<ValueDecl
*, Expr
*>::iterator it
= cache
.begin();
65 for (it
= assigned_value
.begin(); it
!= assigned_value
.end();
68 (cache
.find(it
->first
) != cache
.end() &&
69 cache
[it
->first
] != it
->second
))
70 cache
[it
->first
] = NULL
;
72 assigned_value
= cache
;
76 /* Called if we found something we (currently) cannot handle.
77 * We'll provide more informative warnings later.
79 * We only actually complain if autodetect is false.
81 void PetScan::unsupported(Stmt
*stmt
)
86 SourceLocation loc
= stmt
->getLocStart();
87 Diagnostic
&diag
= PP
.getDiagnostics();
88 unsigned id
= diag
.getCustomDiagID(Diagnostic::Warning
, "unsupported");
89 DiagnosticBuilder B
= diag
.Report(loc
, id
) << stmt
->getSourceRange();
92 /* Extract an integer from "expr" and store it in "v".
94 int PetScan::extract_int(IntegerLiteral
*expr
, isl_int
*v
)
96 const Type
*type
= expr
->getType().getTypePtr();
97 int is_signed
= type
->hasSignedIntegerRepresentation();
100 int64_t i
= expr
->getValue().getSExtValue();
101 isl_int_set_si(*v
, i
);
103 uint64_t i
= expr
->getValue().getZExtValue();
104 isl_int_set_ui(*v
, i
);
110 /* Extract an affine expression from the IntegerLiteral "expr".
112 __isl_give isl_pw_aff
*PetScan::extract_affine(IntegerLiteral
*expr
)
114 isl_dim
*dim
= isl_dim_set_alloc(ctx
, 0, 0);
115 isl_local_space
*ls
= isl_local_space_from_dim(isl_dim_copy(dim
));
116 isl_aff
*aff
= isl_aff_zero(ls
);
117 isl_set
*dom
= isl_set_universe(dim
);
121 extract_int(expr
, &v
);
122 aff
= isl_aff_add_constant(aff
, v
);
125 return isl_pw_aff_alloc(dom
, aff
);
128 /* Extract an affine expression from the APInt "val".
130 __isl_give isl_pw_aff
*PetScan::extract_affine(const llvm::APInt
&val
)
132 isl_dim
*dim
= isl_dim_set_alloc(ctx
, 0, 0);
133 isl_local_space
*ls
= isl_local_space_from_dim(isl_dim_copy(dim
));
134 isl_aff
*aff
= isl_aff_zero(ls
);
135 isl_set
*dom
= isl_set_universe(dim
);
139 isl_int_set_ui(v
, val
.getZExtValue());
140 aff
= isl_aff_add_constant(aff
, v
);
143 return isl_pw_aff_alloc(dom
, aff
);
146 __isl_give isl_pw_aff
*PetScan::extract_affine(ImplicitCastExpr
*expr
)
148 return extract_affine(expr
->getSubExpr());
151 /* Extract an affine expression from the DeclRefExpr "expr".
153 * If we have recorded an expression that was assigned to the variable
154 * before, then we convert this expressoin to an isl_pw_aff if it is
155 * affine and to an extra parameter otherwise (provided nesting_enabled is set).
157 * Otherwise, we simply return an expression that is equal
158 * to a parameter corresponding to the referenced variable.
160 __isl_give isl_pw_aff
*PetScan::extract_affine(DeclRefExpr
*expr
)
162 ValueDecl
*decl
= expr
->getDecl();
163 const Type
*type
= decl
->getType().getTypePtr();
169 if (!type
->isIntegerType()) {
174 if (assigned_value
.find(decl
) != assigned_value
.end() &&
175 assigned_value
[decl
] != NULL
) {
176 if (is_affine(assigned_value
[decl
]))
177 return extract_affine(assigned_value
[decl
]);
179 return non_affine(expr
);
182 id
= isl_id_alloc(ctx
, decl
->getName().str().c_str(), decl
);
183 dim
= isl_dim_set_alloc(ctx
, 1, 0);
185 dim
= isl_dim_set_dim_id(dim
, isl_dim_param
, 0, id
);
187 dom
= isl_set_universe(isl_dim_copy(dim
));
188 aff
= isl_aff_zero(isl_local_space_from_dim(dim
));
189 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_param
, 0, 1);
191 return isl_pw_aff_alloc(dom
, aff
);
194 /* Extract an affine expression from an integer division operation.
195 * In particular, if "expr" is lhs/rhs, then return
197 * lhs >= 0 ? floor(lhs/rhs) : ceil(lhs/rhs)
199 * The second argument (rhs) is required to be a (positive) integer constant.
201 __isl_give isl_pw_aff
*PetScan::extract_affine_div(BinaryOperator
*expr
)
204 isl_pw_aff
*lhs
, *lhs_f
, *lhs_c
;
209 rhs_expr
= expr
->getRHS();
210 if (rhs_expr
->getStmtClass() != Stmt::IntegerLiteralClass
) {
215 lhs
= extract_affine(expr
->getLHS());
216 cond
= isl_pw_aff_nonneg_set(isl_pw_aff_copy(lhs
));
219 extract_int(cast
<IntegerLiteral
>(rhs_expr
), &v
);
220 lhs
= isl_pw_aff_scale_down(lhs
, v
);
223 lhs_f
= isl_pw_aff_floor(isl_pw_aff_copy(lhs
));
224 lhs_c
= isl_pw_aff_ceil(lhs
);
225 res
= isl_pw_aff_cond(cond
, lhs_f
, lhs_c
);
230 /* Extract an affine expression from a modulo operation.
231 * In particular, if "expr" is lhs/rhs, then return
233 * lhs - rhs * (lhs >= 0 ? floor(lhs/rhs) : ceil(lhs/rhs))
235 * The second argument (rhs) is required to be a (positive) integer constant.
237 __isl_give isl_pw_aff
*PetScan::extract_affine_mod(BinaryOperator
*expr
)
240 isl_pw_aff
*lhs
, *lhs_f
, *lhs_c
;
245 rhs_expr
= expr
->getRHS();
246 if (rhs_expr
->getStmtClass() != Stmt::IntegerLiteralClass
) {
251 lhs
= extract_affine(expr
->getLHS());
252 cond
= isl_pw_aff_nonneg_set(isl_pw_aff_copy(lhs
));
255 extract_int(cast
<IntegerLiteral
>(rhs_expr
), &v
);
256 res
= isl_pw_aff_scale_down(isl_pw_aff_copy(lhs
), v
);
258 lhs_f
= isl_pw_aff_floor(isl_pw_aff_copy(res
));
259 lhs_c
= isl_pw_aff_ceil(res
);
260 res
= isl_pw_aff_cond(cond
, lhs_f
, lhs_c
);
262 res
= isl_pw_aff_scale(res
, v
);
265 res
= isl_pw_aff_sub(lhs
, res
);
270 /* Extract an affine expression from a multiplication operation.
271 * This is only allowed if at least one of the two arguments
272 * is a (piecewise) constant.
274 __isl_give isl_pw_aff
*PetScan::extract_affine_mul(BinaryOperator
*expr
)
279 lhs
= extract_affine(expr
->getLHS());
280 rhs
= extract_affine(expr
->getRHS());
282 if (!isl_pw_aff_is_cst(lhs
) && !isl_pw_aff_is_cst(rhs
)) {
283 isl_pw_aff_free(lhs
);
284 isl_pw_aff_free(rhs
);
289 return isl_pw_aff_mul(lhs
, rhs
);
292 /* Extract an affine expression from an addition or subtraction operation.
294 __isl_give isl_pw_aff
*PetScan::extract_affine_add(BinaryOperator
*expr
)
299 lhs
= extract_affine(expr
->getLHS());
300 rhs
= extract_affine(expr
->getRHS());
302 switch (expr
->getOpcode()) {
304 return isl_pw_aff_add(lhs
, rhs
);
306 return isl_pw_aff_sub(lhs
, rhs
);
308 isl_pw_aff_free(lhs
);
309 isl_pw_aff_free(rhs
);
319 static __isl_give isl_pw_aff
*wrap(__isl_take isl_pw_aff
*pwaff
,
325 isl_int_set_si(mod
, 1);
326 isl_int_mul_2exp(mod
, mod
, width
);
328 pwaff
= isl_pw_aff_mod(pwaff
, mod
);
335 /* Extract an affine expression from some binary operations.
336 * If the result of the expression is unsigned, then we wrap it
337 * based on the size of the type.
339 __isl_give isl_pw_aff
*PetScan::extract_affine(BinaryOperator
*expr
)
343 switch (expr
->getOpcode()) {
346 res
= extract_affine_add(expr
);
349 res
= extract_affine_div(expr
);
352 res
= extract_affine_mod(expr
);
355 res
= extract_affine_mul(expr
);
362 if (expr
->getType()->isUnsignedIntegerType())
363 res
= wrap(res
, ast_context
.getIntWidth(expr
->getType()));
368 /* Extract an affine expression from a negation operation.
370 __isl_give isl_pw_aff
*PetScan::extract_affine(UnaryOperator
*expr
)
372 if (expr
->getOpcode() == UO_Minus
)
373 return isl_pw_aff_neg(extract_affine(expr
->getSubExpr()));
379 __isl_give isl_pw_aff
*PetScan::extract_affine(ParenExpr
*expr
)
381 return extract_affine(expr
->getSubExpr());
384 /* Extract an affine expression from some special function calls.
385 * In particular, we handle "min", "max", "ceild" and "floord".
386 * In case of the latter two, the second argument needs to be
387 * a (positive) integer constant.
389 __isl_give isl_pw_aff
*PetScan::extract_affine(CallExpr
*expr
)
393 isl_pw_aff
*aff1
, *aff2
;
395 fd
= expr
->getDirectCallee();
401 name
= fd
->getDeclName().getAsString();
402 if (!(expr
->getNumArgs() == 2 && name
== "min") &&
403 !(expr
->getNumArgs() == 2 && name
== "max") &&
404 !(expr
->getNumArgs() == 2 && name
== "floord") &&
405 !(expr
->getNumArgs() == 2 && name
== "ceild")) {
410 if (name
== "min" || name
== "max") {
411 aff1
= extract_affine(expr
->getArg(0));
412 aff2
= extract_affine(expr
->getArg(1));
415 aff1
= isl_pw_aff_min(aff1
, aff2
);
417 aff1
= isl_pw_aff_max(aff1
, aff2
);
418 } else if (name
== "floord" || name
== "ceild") {
420 Expr
*arg2
= expr
->getArg(1);
422 if (arg2
->getStmtClass() != Stmt::IntegerLiteralClass
) {
426 aff1
= extract_affine(expr
->getArg(0));
428 extract_int(cast
<IntegerLiteral
>(arg2
), &v
);
429 aff1
= isl_pw_aff_scale_down(aff1
, v
);
431 if (name
== "floord")
432 aff1
= isl_pw_aff_floor(aff1
);
434 aff1
= isl_pw_aff_ceil(aff1
);
444 /* This method is called when we come across a non-affine expression.
445 * If nesting is allowed, we return a new parameter that corresponds
446 * to the non-affine expression. Otherwise, we simply complain.
448 * The new parameter is resolved in resolve_nested.
450 isl_pw_aff
*PetScan::non_affine(Expr
*expr
)
457 if (!nesting_enabled
) {
462 id
= isl_id_alloc(ctx
, NULL
, expr
);
463 dim
= isl_dim_set_alloc(ctx
, 1, 0);
465 dim
= isl_dim_set_dim_id(dim
, isl_dim_param
, 0, id
);
467 dom
= isl_set_universe(isl_dim_copy(dim
));
468 aff
= isl_aff_zero(isl_local_space_from_dim(dim
));
469 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_param
, 0, 1);
471 return isl_pw_aff_alloc(dom
, aff
);
474 /* Affine expressions are not supposed to contain array accesses,
475 * but if nesting is allowed, we return a parameter corresponding
476 * to the array access.
478 __isl_give isl_pw_aff
*PetScan::extract_affine(ArraySubscriptExpr
*expr
)
480 return non_affine(expr
);
483 /* Extract an affine expression from a conditional operation.
485 __isl_give isl_pw_aff
*PetScan::extract_affine(ConditionalOperator
*expr
)
488 isl_pw_aff
*lhs
, *rhs
;
490 cond
= extract_condition(expr
->getCond());
491 lhs
= extract_affine(expr
->getTrueExpr());
492 rhs
= extract_affine(expr
->getFalseExpr());
494 return isl_pw_aff_cond(cond
, lhs
, rhs
);
497 /* Extract an affine expression, if possible, from "expr".
498 * Otherwise return NULL.
500 __isl_give isl_pw_aff
*PetScan::extract_affine(Expr
*expr
)
502 switch (expr
->getStmtClass()) {
503 case Stmt::ImplicitCastExprClass
:
504 return extract_affine(cast
<ImplicitCastExpr
>(expr
));
505 case Stmt::IntegerLiteralClass
:
506 return extract_affine(cast
<IntegerLiteral
>(expr
));
507 case Stmt::DeclRefExprClass
:
508 return extract_affine(cast
<DeclRefExpr
>(expr
));
509 case Stmt::BinaryOperatorClass
:
510 return extract_affine(cast
<BinaryOperator
>(expr
));
511 case Stmt::UnaryOperatorClass
:
512 return extract_affine(cast
<UnaryOperator
>(expr
));
513 case Stmt::ParenExprClass
:
514 return extract_affine(cast
<ParenExpr
>(expr
));
515 case Stmt::CallExprClass
:
516 return extract_affine(cast
<CallExpr
>(expr
));
517 case Stmt::ArraySubscriptExprClass
:
518 return extract_affine(cast
<ArraySubscriptExpr
>(expr
));
519 case Stmt::ConditionalOperatorClass
:
520 return extract_affine(cast
<ConditionalOperator
>(expr
));
527 __isl_give isl_map
*PetScan::extract_access(ImplicitCastExpr
*expr
)
529 return extract_access(expr
->getSubExpr());
532 /* Return the depth of an array of the given type.
534 static int array_depth(const Type
*type
)
536 if (type
->isPointerType())
537 return 1 + array_depth(type
->getPointeeType().getTypePtr());
538 if (type
->isArrayType()) {
539 const ArrayType
*atype
;
540 type
= type
->getCanonicalTypeInternal().getTypePtr();
541 atype
= cast
<ArrayType
>(type
);
542 return 1 + array_depth(atype
->getElementType().getTypePtr());
547 /* Return the element type of the given array type.
549 static QualType
base_type(QualType qt
)
551 const Type
*type
= qt
.getTypePtr();
553 if (type
->isPointerType())
554 return base_type(type
->getPointeeType());
555 if (type
->isArrayType()) {
556 const ArrayType
*atype
;
557 type
= type
->getCanonicalTypeInternal().getTypePtr();
558 atype
= cast
<ArrayType
>(type
);
559 return base_type(atype
->getElementType());
564 /* Check if the element type corresponding to the given array type
565 * has a const qualifier.
567 static bool const_base(QualType qt
)
569 const Type
*type
= qt
.getTypePtr();
571 if (type
->isPointerType())
572 return const_base(type
->getPointeeType());
573 if (type
->isArrayType()) {
574 const ArrayType
*atype
;
575 type
= type
->getCanonicalTypeInternal().getTypePtr();
576 atype
= cast
<ArrayType
>(type
);
577 return const_base(atype
->getElementType());
580 return qt
.isConstQualified();
583 /* Extract an access relation from a reference to a variable.
584 * If the variable has name "A" and its type corresponds to an
585 * array of depth d, then the returned access relation is of the
588 * { [] -> A[i_1,...,i_d] }
590 __isl_give isl_map
*PetScan::extract_access(DeclRefExpr
*expr
)
592 ValueDecl
*decl
= expr
->getDecl();
593 int depth
= array_depth(decl
->getType().getTypePtr());
594 isl_id
*id
= isl_id_alloc(ctx
, decl
->getName().str().c_str(), decl
);
595 isl_dim
*dim
= isl_dim_alloc(ctx
, 0, 0, depth
);
598 dim
= isl_dim_set_tuple_id(dim
, isl_dim_out
, id
);
600 access_rel
= isl_map_universe(dim
);
605 /* Extract an access relation from an integer contant.
606 * If the value of the constant is "v", then the returned access relation
611 __isl_give isl_map
*PetScan::extract_access(IntegerLiteral
*expr
)
613 return isl_map_from_pw_aff(extract_affine(expr
));
616 /* Try and extract an access relation from the given Expr.
617 * Return NULL if it doesn't work out.
619 __isl_give isl_map
*PetScan::extract_access(Expr
*expr
)
621 switch (expr
->getStmtClass()) {
622 case Stmt::ImplicitCastExprClass
:
623 return extract_access(cast
<ImplicitCastExpr
>(expr
));
624 case Stmt::DeclRefExprClass
:
625 return extract_access(cast
<DeclRefExpr
>(expr
));
626 case Stmt::ArraySubscriptExprClass
:
627 return extract_access(cast
<ArraySubscriptExpr
>(expr
));
634 /* Assign the affine expression "index" to the output dimension "pos" of "map"
635 * and return the result.
637 __isl_give isl_map
*set_index(__isl_take isl_map
*map
, int pos
,
638 __isl_take isl_pw_aff
*index
)
641 int len
= isl_map_dim(map
, isl_dim_out
);
644 index_map
= isl_map_from_pw_aff(index
);
645 index_map
= isl_map_insert_dims(index_map
, isl_dim_out
, 0, pos
);
646 index_map
= isl_map_add_dims(index_map
, isl_dim_out
, len
- pos
- 1);
647 id
= isl_map_get_tuple_id(map
, isl_dim_out
);
648 index_map
= isl_map_set_tuple_id(index_map
, isl_dim_out
, id
);
650 map
= isl_map_intersect(map
, index_map
);
655 /* Extract an access relation from the given array subscript expression.
656 * If nesting is allowed in general, then we turn it on while
657 * examining the index expression.
659 * We first extract an access relation from the base.
660 * This will result in an access relation with a range that corresponds
661 * to the array being accessed and with earlier indices filled in already.
662 * We then extract the current index and fill that in as well.
663 * The position of the current index is based on the type of base.
664 * If base is the actual array variable, then the depth of this type
665 * will be the same as the depth of the array and we will fill in
666 * the first array index.
667 * Otherwise, the depth of the base type will be smaller and we will fill
670 __isl_give isl_map
*PetScan::extract_access(ArraySubscriptExpr
*expr
)
672 Expr
*base
= expr
->getBase();
673 Expr
*idx
= expr
->getIdx();
675 isl_map
*base_access
;
677 int depth
= array_depth(base
->getType().getTypePtr());
679 bool save_nesting
= nesting_enabled
;
681 nesting_enabled
= allow_nested
;
683 base_access
= extract_access(base
);
684 index
= extract_affine(idx
);
686 nesting_enabled
= save_nesting
;
688 pos
= isl_map_dim(base_access
, isl_dim_out
) - depth
;
689 access
= set_index(base_access
, pos
, index
);
694 /* Check if "expr" calls function "minmax" with two arguments and if so
695 * make lhs and rhs refer to these two arguments.
697 static bool is_minmax(Expr
*expr
, const char *minmax
, Expr
*&lhs
, Expr
*&rhs
)
703 if (expr
->getStmtClass() != Stmt::CallExprClass
)
706 call
= cast
<CallExpr
>(expr
);
707 fd
= call
->getDirectCallee();
711 if (call
->getNumArgs() != 2)
714 name
= fd
->getDeclName().getAsString();
718 lhs
= call
->getArg(0);
719 rhs
= call
->getArg(1);
724 /* Check if "expr" is of the form min(lhs, rhs) and if so make
725 * lhs and rhs refer to the two arguments.
727 static bool is_min(Expr
*expr
, Expr
*&lhs
, Expr
*&rhs
)
729 return is_minmax(expr
, "min", lhs
, rhs
);
732 /* Check if "expr" is of the form max(lhs, rhs) and if so make
733 * lhs and rhs refer to the two arguments.
735 static bool is_max(Expr
*expr
, Expr
*&lhs
, Expr
*&rhs
)
737 return is_minmax(expr
, "max", lhs
, rhs
);
740 /* Extract a set of values satisfying the comparison "LHS op RHS"
741 * "comp" is the original statement that "LHS op RHS" is derived from
742 * and is used for diagnostics.
744 * If the comparison is of the form
748 * then the set is constructed as the intersection of the set corresponding
753 * A similar optimization is performed for max(a,b) <= c.
754 * We do this because that will lead to simpler representations of the set.
755 * If isl is ever enhanced to explicitly deal with min and max expressions,
756 * this optimization can be removed.
758 __isl_give isl_set
*PetScan::extract_comparison(BinaryOperatorKind op
,
759 Expr
*LHS
, Expr
*RHS
, Stmt
*comp
)
766 return extract_comparison(BO_LT
, RHS
, LHS
, comp
);
768 return extract_comparison(BO_LE
, RHS
, LHS
, comp
);
770 if (op
== BO_LT
|| op
== BO_LE
) {
772 isl_set
*set1
, *set2
;
773 if (is_min(RHS
, expr1
, expr2
)) {
774 set1
= extract_comparison(op
, LHS
, expr1
, comp
);
775 set2
= extract_comparison(op
, LHS
, expr2
, comp
);
776 return isl_set_intersect(set1
, set2
);
778 if (is_max(LHS
, expr1
, expr2
)) {
779 set1
= extract_comparison(op
, expr1
, RHS
, comp
);
780 set2
= extract_comparison(op
, expr2
, RHS
, comp
);
781 return isl_set_intersect(set1
, set2
);
785 lhs
= extract_affine(LHS
);
786 rhs
= extract_affine(RHS
);
790 cond
= isl_pw_aff_lt_set(lhs
, rhs
);
793 cond
= isl_pw_aff_le_set(lhs
, rhs
);
796 cond
= isl_pw_aff_eq_set(lhs
, rhs
);
799 cond
= isl_pw_aff_ne_set(lhs
, rhs
);
802 isl_pw_aff_free(lhs
);
803 isl_pw_aff_free(rhs
);
808 cond
= isl_set_coalesce(cond
);
813 __isl_give isl_set
*PetScan::extract_comparison(BinaryOperator
*comp
)
815 return extract_comparison(comp
->getOpcode(), comp
->getLHS(),
816 comp
->getRHS(), comp
);
819 /* Extract a set of values satisfying the negation (logical not)
820 * of a subexpression.
822 __isl_give isl_set
*PetScan::extract_boolean(UnaryOperator
*op
)
826 cond
= extract_condition(op
->getSubExpr());
828 return isl_set_complement(cond
);
831 /* Extract a set of values satisfying the union (logical or)
832 * or intersection (logical and) of two subexpressions.
834 __isl_give isl_set
*PetScan::extract_boolean(BinaryOperator
*comp
)
840 lhs
= extract_condition(comp
->getLHS());
841 rhs
= extract_condition(comp
->getRHS());
843 switch (comp
->getOpcode()) {
845 cond
= isl_set_intersect(lhs
, rhs
);
848 cond
= isl_set_union(lhs
, rhs
);
860 __isl_give isl_set
*PetScan::extract_condition(UnaryOperator
*expr
)
862 switch (expr
->getOpcode()) {
864 return extract_boolean(expr
);
871 /* Extract a set of values satisfying the condition "expr != 0".
873 __isl_give isl_set
*PetScan::extract_implicit_condition(Expr
*expr
)
875 return isl_pw_aff_non_zero_set(extract_affine(expr
));
878 /* Extract a set of values satisfying the condition expressed by "expr".
880 * If the expression doesn't look like a condition, we assume it
881 * is an affine expression and return the condition "expr != 0".
883 __isl_give isl_set
*PetScan::extract_condition(Expr
*expr
)
885 BinaryOperator
*comp
;
888 return isl_set_universe(isl_dim_set_alloc(ctx
, 0, 0));
890 if (expr
->getStmtClass() == Stmt::ParenExprClass
)
891 return extract_condition(cast
<ParenExpr
>(expr
)->getSubExpr());
893 if (expr
->getStmtClass() == Stmt::UnaryOperatorClass
)
894 return extract_condition(cast
<UnaryOperator
>(expr
));
896 if (expr
->getStmtClass() != Stmt::BinaryOperatorClass
)
897 return extract_implicit_condition(expr
);
899 comp
= cast
<BinaryOperator
>(expr
);
900 switch (comp
->getOpcode()) {
907 return extract_comparison(comp
);
910 return extract_boolean(comp
);
912 return extract_implicit_condition(expr
);
916 static enum pet_op_type
UnaryOperatorKind2pet_op_type(UnaryOperatorKind kind
)
926 static enum pet_op_type
BinaryOperatorKind2pet_op_type(BinaryOperatorKind kind
)
930 return pet_op_add_assign
;
932 return pet_op_sub_assign
;
934 return pet_op_mul_assign
;
936 return pet_op_div_assign
;
938 return pet_op_assign
;
958 /* Construct a pet_expr representing a unary operator expression.
960 struct pet_expr
*PetScan::extract_expr(UnaryOperator
*expr
)
962 struct pet_expr
*arg
;
965 op
= UnaryOperatorKind2pet_op_type(expr
->getOpcode());
966 if (op
== pet_op_last
) {
971 arg
= extract_expr(expr
->getSubExpr());
973 return pet_expr_new_unary(ctx
, op
, arg
);
976 /* Construct a pet_expr representing a binary operator expression.
978 * If the top level operator is an assignment and the LHS is an access,
979 * then we mark that access as a write. If the operator is a compound
980 * assignment, the access is marked as both a read and a write.
982 * If "expr" assigns something to a scalar variable, then we keep track
983 * of the assigned expression in assigned_value so that we can plug
984 * it in when we later come across the same variable.
986 struct pet_expr
*PetScan::extract_expr(BinaryOperator
*expr
)
988 struct pet_expr
*lhs
, *rhs
;
991 op
= BinaryOperatorKind2pet_op_type(expr
->getOpcode());
992 if (op
== pet_op_last
) {
997 lhs
= extract_expr(expr
->getLHS());
998 rhs
= extract_expr(expr
->getRHS());
1000 if (expr
->isAssignmentOp() && lhs
&& lhs
->type
== pet_expr_access
) {
1002 if (!expr
->isCompoundAssignmentOp())
1006 if (expr
->getOpcode() == BO_Assign
&&
1007 lhs
&& lhs
->type
== pet_expr_access
&&
1008 isl_map_dim(lhs
->acc
.access
, isl_dim_out
) == 0) {
1009 isl_id
*id
= isl_map_get_tuple_id(lhs
->acc
.access
, isl_dim_out
);
1010 ValueDecl
*decl
= (ValueDecl
*) isl_id_get_user(id
);
1011 assigned_value
[decl
] = expr
->getRHS();
1015 return pet_expr_new_binary(ctx
, op
, lhs
, rhs
);
1018 /* Construct a pet_expr representing a conditional operation.
1020 struct pet_expr
*PetScan::extract_expr(ConditionalOperator
*expr
)
1022 struct pet_expr
*cond
, *lhs
, *rhs
;
1024 cond
= extract_expr(expr
->getCond());
1025 lhs
= extract_expr(expr
->getTrueExpr());
1026 rhs
= extract_expr(expr
->getFalseExpr());
1028 return pet_expr_new_ternary(ctx
, cond
, lhs
, rhs
);
1031 struct pet_expr
*PetScan::extract_expr(ImplicitCastExpr
*expr
)
1033 return extract_expr(expr
->getSubExpr());
1036 /* Construct a pet_expr representing a floating point value.
1038 struct pet_expr
*PetScan::extract_expr(FloatingLiteral
*expr
)
1040 return pet_expr_new_double(ctx
, expr
->getValueAsApproximateDouble());
1043 /* Extract an access relation from "expr" and then convert it into
1046 struct pet_expr
*PetScan::extract_access_expr(Expr
*expr
)
1049 struct pet_expr
*pe
;
1051 switch (expr
->getStmtClass()) {
1052 case Stmt::ArraySubscriptExprClass
:
1053 access
= extract_access(cast
<ArraySubscriptExpr
>(expr
));
1055 case Stmt::DeclRefExprClass
:
1056 access
= extract_access(cast
<DeclRefExpr
>(expr
));
1058 case Stmt::IntegerLiteralClass
:
1059 access
= extract_access(cast
<IntegerLiteral
>(expr
));
1066 pe
= pet_expr_from_access(access
);
1071 struct pet_expr
*PetScan::extract_expr(ParenExpr
*expr
)
1073 return extract_expr(expr
->getSubExpr());
1076 /* Construct a pet_expr representing a function call.
1078 * If we are passing along a pointer to an array element
1079 * or an entire row or even higher dimensional slice of an array,
1080 * then the function being called may write into the array.
1082 * We assume here that if the function is declared to take a pointer
1083 * to a const type, then the function will perform a read
1084 * and that otherwise, it will perform a write.
1086 struct pet_expr
*PetScan::extract_expr(CallExpr
*expr
)
1088 struct pet_expr
*res
= NULL
;
1092 fd
= expr
->getDirectCallee();
1098 name
= fd
->getDeclName().getAsString();
1099 res
= pet_expr_new_call(ctx
, name
.c_str(), expr
->getNumArgs());
1103 for (int i
= 0; i
< expr
->getNumArgs(); ++i
) {
1104 Expr
*arg
= expr
->getArg(i
);
1107 if (arg
->getStmtClass() == Stmt::ImplicitCastExprClass
) {
1108 ImplicitCastExpr
*ice
= cast
<ImplicitCastExpr
>(arg
);
1109 arg
= ice
->getSubExpr();
1111 if (arg
->getStmtClass() == Stmt::UnaryOperatorClass
) {
1112 UnaryOperator
*op
= cast
<UnaryOperator
>(arg
);
1113 if (op
->getOpcode() == UO_AddrOf
) {
1115 arg
= op
->getSubExpr();
1118 res
->args
[i
] = PetScan::extract_expr(arg
);
1121 if (arg
->getStmtClass() == Stmt::ArraySubscriptExprClass
&&
1122 array_depth(arg
->getType().getTypePtr()) > 0)
1124 if (is_addr
&& res
->args
[i
]->type
== pet_expr_access
) {
1125 ParmVarDecl
*parm
= fd
->getParamDecl(i
);
1126 if (!const_base(parm
->getType())) {
1127 res
->args
[i
]->acc
.write
= 1;
1128 res
->args
[i
]->acc
.read
= 0;
1139 /* Try and onstruct a pet_expr representing "expr".
1141 struct pet_expr
*PetScan::extract_expr(Expr
*expr
)
1143 switch (expr
->getStmtClass()) {
1144 case Stmt::UnaryOperatorClass
:
1145 return extract_expr(cast
<UnaryOperator
>(expr
));
1146 case Stmt::CompoundAssignOperatorClass
:
1147 case Stmt::BinaryOperatorClass
:
1148 return extract_expr(cast
<BinaryOperator
>(expr
));
1149 case Stmt::ImplicitCastExprClass
:
1150 return extract_expr(cast
<ImplicitCastExpr
>(expr
));
1151 case Stmt::ArraySubscriptExprClass
:
1152 case Stmt::DeclRefExprClass
:
1153 case Stmt::IntegerLiteralClass
:
1154 return extract_access_expr(expr
);
1155 case Stmt::FloatingLiteralClass
:
1156 return extract_expr(cast
<FloatingLiteral
>(expr
));
1157 case Stmt::ParenExprClass
:
1158 return extract_expr(cast
<ParenExpr
>(expr
));
1159 case Stmt::ConditionalOperatorClass
:
1160 return extract_expr(cast
<ConditionalOperator
>(expr
));
1161 case Stmt::CallExprClass
:
1162 return extract_expr(cast
<CallExpr
>(expr
));
1169 /* Check if the given initialization statement is an assignment.
1170 * If so, return that assignment. Otherwise return NULL.
1172 BinaryOperator
*PetScan::initialization_assignment(Stmt
*init
)
1174 BinaryOperator
*ass
;
1176 if (init
->getStmtClass() != Stmt::BinaryOperatorClass
)
1179 ass
= cast
<BinaryOperator
>(init
);
1180 if (ass
->getOpcode() != BO_Assign
)
1186 /* Check if the given initialization statement is a declaration
1187 * of a single variable.
1188 * If so, return that declaration. Otherwise return NULL.
1190 Decl
*PetScan::initialization_declaration(Stmt
*init
)
1194 if (init
->getStmtClass() != Stmt::DeclStmtClass
)
1197 decl
= cast
<DeclStmt
>(init
);
1199 if (!decl
->isSingleDecl())
1202 return decl
->getSingleDecl();
1205 /* Given the assignment operator in the initialization of a for loop,
1206 * extract the induction variable, i.e., the (integer)variable being
1209 ValueDecl
*PetScan::extract_induction_variable(BinaryOperator
*init
)
1216 lhs
= init
->getLHS();
1217 if (lhs
->getStmtClass() != Stmt::DeclRefExprClass
) {
1222 ref
= cast
<DeclRefExpr
>(lhs
);
1223 decl
= ref
->getDecl();
1224 type
= decl
->getType().getTypePtr();
1226 if (!type
->isIntegerType()) {
1234 /* Given the initialization statement of a for loop and the single
1235 * declaration in this initialization statement,
1236 * extract the induction variable, i.e., the (integer) variable being
1239 VarDecl
*PetScan::extract_induction_variable(Stmt
*init
, Decl
*decl
)
1243 vd
= cast
<VarDecl
>(decl
);
1245 const QualType type
= vd
->getType();
1246 if (!type
->isIntegerType()) {
1251 if (!vd
->getInit()) {
1259 /* Check that op is of the form iv++ or iv--.
1260 * "inc" is accordingly set to 1 or -1.
1262 bool PetScan::check_unary_increment(UnaryOperator
*op
, clang::ValueDecl
*iv
,
1268 if (!op
->isIncrementDecrementOp()) {
1273 if (op
->isIncrementOp())
1274 isl_int_set_si(inc
, 1);
1276 isl_int_set_si(inc
, -1);
1278 sub
= op
->getSubExpr();
1279 if (sub
->getStmtClass() != Stmt::DeclRefExprClass
) {
1284 ref
= cast
<DeclRefExpr
>(sub
);
1285 if (ref
->getDecl() != iv
) {
1293 /* If the isl_pw_aff on which isl_pw_aff_foreach_piece is called
1294 * has a single constant expression on a universe domain, then
1295 * put this constant in *user.
1297 static int extract_cst(__isl_take isl_set
*set
, __isl_take isl_aff
*aff
,
1300 isl_int
*inc
= (isl_int
*)user
;
1303 if (!isl_set_plain_is_universe(set
) || !isl_aff_is_cst(aff
))
1306 isl_aff_get_constant(aff
, inc
);
1314 /* Check if op is of the form
1318 * with inc a constant and set "inc" accordingly.
1320 * We extract an affine expression from the RHS and the subtract iv.
1321 * The result should be a constant.
1323 bool PetScan::check_binary_increment(BinaryOperator
*op
, clang::ValueDecl
*iv
,
1333 if (op
->getOpcode() != BO_Assign
) {
1339 if (lhs
->getStmtClass() != Stmt::DeclRefExprClass
) {
1344 ref
= cast
<DeclRefExpr
>(lhs
);
1345 if (ref
->getDecl() != iv
) {
1350 val
= extract_affine(op
->getRHS());
1352 id
= isl_id_alloc(ctx
, iv
->getName().str().c_str(), iv
);
1354 dim
= isl_dim_set_alloc(ctx
, 1, 0);
1355 dim
= isl_dim_set_dim_id(dim
, isl_dim_param
, 0, id
);
1356 aff
= isl_aff_zero(isl_local_space_from_dim(dim
));
1357 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_param
, 0, 1);
1359 val
= isl_pw_aff_sub(val
, isl_pw_aff_from_aff(aff
));
1361 if (isl_pw_aff_foreach_piece(val
, &extract_cst
, &inc
) < 0) {
1362 isl_pw_aff_free(val
);
1367 isl_pw_aff_free(val
);
1372 /* Check that op is of the form iv += cst or iv -= cst.
1373 * "inc" is set to cst or -cst accordingly.
1375 bool PetScan::check_compound_increment(CompoundAssignOperator
*op
,
1376 clang::ValueDecl
*iv
, isl_int
&inc
)
1382 BinaryOperatorKind opcode
;
1384 opcode
= op
->getOpcode();
1385 if (opcode
!= BO_AddAssign
&& opcode
!= BO_SubAssign
) {
1389 if (opcode
== BO_SubAssign
)
1393 if (lhs
->getStmtClass() != Stmt::DeclRefExprClass
) {
1398 ref
= cast
<DeclRefExpr
>(lhs
);
1399 if (ref
->getDecl() != iv
) {
1406 if (rhs
->getStmtClass() == Stmt::UnaryOperatorClass
) {
1407 UnaryOperator
*op
= cast
<UnaryOperator
>(rhs
);
1408 if (op
->getOpcode() != UO_Minus
) {
1415 rhs
= op
->getSubExpr();
1418 if (rhs
->getStmtClass() != Stmt::IntegerLiteralClass
) {
1423 extract_int(cast
<IntegerLiteral
>(rhs
), &inc
);
1425 isl_int_neg(inc
, inc
);
1430 /* Check that the increment of the given for loop increments
1431 * (or decrements) the induction variable "iv".
1432 * "up" is set to true if the induction variable is incremented.
1434 bool PetScan::check_increment(ForStmt
*stmt
, ValueDecl
*iv
, isl_int
&v
)
1436 Stmt
*inc
= stmt
->getInc();
1443 if (inc
->getStmtClass() == Stmt::UnaryOperatorClass
)
1444 return check_unary_increment(cast
<UnaryOperator
>(inc
), iv
, v
);
1445 if (inc
->getStmtClass() == Stmt::CompoundAssignOperatorClass
)
1446 return check_compound_increment(
1447 cast
<CompoundAssignOperator
>(inc
), iv
, v
);
1448 if (inc
->getStmtClass() == Stmt::BinaryOperatorClass
)
1449 return check_binary_increment(cast
<BinaryOperator
>(inc
), iv
, v
);
1455 /* Embed the given iteration domain in an extra outer loop
1456 * with induction variable "var".
1457 * If this variable appeared as a parameter in the constraints,
1458 * it is replaced by the new outermost dimension.
1460 static __isl_give isl_set
*embed(__isl_take isl_set
*set
,
1461 __isl_take isl_id
*var
)
1465 set
= isl_set_insert_dims(set
, isl_dim_set
, 0, 1);
1466 pos
= isl_set_find_dim_by_id(set
, isl_dim_param
, var
);
1468 set
= isl_set_equate(set
, isl_dim_param
, pos
, isl_dim_set
, 0);
1469 set
= isl_set_project_out(set
, isl_dim_param
, pos
, 1);
1476 /* Construct a pet_scop for an infinite loop, i.e., a loop of the form
1481 * We extract a pet_scop for the body and then embed it in a loop with
1490 struct pet_scop
*PetScan::extract_infinite_for(ForStmt
*stmt
)
1496 struct pet_scop
*scop
;
1498 scop
= extract(stmt
->getBody());
1502 id
= isl_id_alloc(ctx
, "t", NULL
);
1503 domain
= isl_set_nat_universe(isl_dim_set_alloc(ctx
, 0, 1));
1504 domain
= isl_set_set_dim_id(domain
, isl_dim_set
, 0, isl_id_copy(id
));
1505 dim
= isl_dim_from_domain(isl_set_get_dim(domain
));
1506 dim
= isl_dim_add(dim
, isl_dim_out
, 1);
1507 sched
= isl_map_universe(dim
);
1508 sched
= isl_map_equate(sched
, isl_dim_in
, 0, isl_dim_out
, 0);
1509 scop
= pet_scop_embed(scop
, domain
, sched
, id
);
1514 /* Check whether "cond" expresses a simple loop bound
1515 * on the only set dimension.
1516 * In particular, if "up" is set then "cond" should contain only
1517 * upper bounds on the set dimension.
1518 * Otherwise, it should contain only lower bounds.
1520 static bool is_simple_bound(__isl_keep isl_set
*cond
, isl_int inc
)
1522 if (isl_int_is_pos(inc
))
1523 return !isl_set_dim_has_lower_bound(cond
, isl_dim_set
, 0);
1525 return !isl_set_dim_has_upper_bound(cond
, isl_dim_set
, 0);
1528 /* Extend a condition on a given iteration of a loop to one that
1529 * imposes the same condition on all previous iterations.
1530 * "domain" expresses the lower [upper] bound on the iterations
1531 * when up is set [not set].
1533 * In particular, we construct the condition (when up is set)
1535 * forall i' : (domain(i') and i' <= i) => cond(i')
1537 * which is equivalent to
1539 * not exists i' : domain(i') and i' <= i and not cond(i')
1541 * We construct this set by negating cond, applying a map
1543 * { [i'] -> [i] : domain(i') and i' <= i }
1545 * and then negating the result again.
1547 static __isl_give isl_set
*valid_for_each_iteration(__isl_take isl_set
*cond
,
1548 __isl_take isl_set
*domain
, isl_int inc
)
1550 isl_map
*previous_to_this
;
1552 if (isl_int_is_pos(inc
))
1553 previous_to_this
= isl_map_lex_le(isl_set_get_dim(domain
));
1555 previous_to_this
= isl_map_lex_ge(isl_set_get_dim(domain
));
1557 previous_to_this
= isl_map_intersect_domain(previous_to_this
, domain
);
1559 cond
= isl_set_complement(cond
);
1560 cond
= isl_set_apply(cond
, previous_to_this
);
1561 cond
= isl_set_complement(cond
);
1566 /* Construct a domain of the form
1568 * [id] -> { [] : exists a: id = init + a * inc and a >= 0 }
1570 static __isl_give isl_set
*strided_domain(__isl_take isl_id
*id
,
1571 __isl_take isl_pw_aff
*init
, isl_int inc
)
1577 init
= isl_pw_aff_insert_dims(init
, isl_dim_set
, 0, 1);
1578 aff
= isl_aff_zero(isl_local_space_from_dim(isl_pw_aff_get_dim(init
)));
1579 aff
= isl_aff_add_coefficient(aff
, isl_dim_set
, 0, inc
);
1580 init
= isl_pw_aff_add(init
, isl_pw_aff_from_aff(aff
));
1582 dim
= isl_dim_set_alloc(isl_pw_aff_get_ctx(init
), 1, 1);
1583 dim
= isl_dim_set_dim_id(dim
, isl_dim_param
, 0, id
);
1584 aff
= isl_aff_zero(isl_local_space_from_dim(dim
));
1585 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_param
, 0, 1);
1587 set
= isl_pw_aff_eq_set(isl_pw_aff_from_aff(aff
), init
);
1589 set
= isl_set_lower_bound_si(set
, isl_dim_set
, 0, 0);
1591 return isl_set_project_out(set
, isl_dim_set
, 0, 1);
1594 static unsigned get_type_size(ValueDecl
*decl
)
1596 return decl
->getASTContext().getIntWidth(decl
->getType());
1599 /* Assuming "cond" represents a simple bound on a loop where the loop
1600 * iterator "iv" is incremented (or decremented) by one, check if wrapping
1603 * Under the given assumptions, wrapping is only possible if "cond" allows
1604 * for the last value before wrapping, i.e., 2^width - 1 in case of an
1605 * increasing iterator and 0 in case of a decreasing iterator.
1607 static bool can_wrap(__isl_keep isl_set
*cond
, ValueDecl
*iv
, isl_int inc
)
1613 test
= isl_set_copy(cond
);
1615 isl_int_init(limit
);
1616 if (isl_int_is_neg(inc
))
1617 isl_int_set_si(limit
, 0);
1619 isl_int_set_si(limit
, 1);
1620 isl_int_mul_2exp(limit
, limit
, get_type_size(iv
));
1621 isl_int_sub_ui(limit
, limit
, 1);
1624 test
= isl_set_fix(cond
, isl_dim_set
, 0, limit
);
1625 cw
= !isl_set_is_empty(test
);
1628 isl_int_clear(limit
);
1633 /* Given a one-dimensional space, construct the following mapping on this
1636 * { [v] -> [v mod 2^width] }
1638 * where width is the number of bits used to represent the values
1639 * of the unsigned variable "iv".
1641 static __isl_give isl_map
*compute_wrapping(__isl_take isl_dim
*dim
,
1649 isl_int_set_si(mod
, 1);
1650 isl_int_mul_2exp(mod
, mod
, get_type_size(iv
));
1652 aff
= isl_aff_zero(isl_local_space_from_dim(dim
));
1653 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_set
, 0, 1);
1654 aff
= isl_aff_mod(aff
, mod
);
1658 return isl_map_from_basic_map(isl_basic_map_from_aff(aff
));
1659 map
= isl_map_reverse(map
);
1662 /* Construct a pet_scop for a for statement.
1663 * The for loop is required to be of the form
1665 * for (i = init; condition; ++i)
1669 * for (i = init; condition; --i)
1671 * The initialization of the for loop should either be an assignment
1672 * to an integer variable, or a declaration of such a variable with
1675 * We extract a pet_scop for the body and then embed it in a loop with
1676 * iteration domain and schedule
1678 * { [i] : i >= init and condition' }
1683 * { [i] : i <= init and condition' }
1686 * Where condition' is equal to condition if the latter is
1687 * a simple upper [lower] bound and a condition that is extended
1688 * to apply to all previous iterations otherwise.
1690 * If the stride of the loop is not 1, then "i >= init" is replaced by
1692 * (exists a: i = init + stride * a and a >= 0)
1694 * If the loop iterator i is unsigned, then wrapping may occur.
1695 * During the computation, we work with a virtual iterator that
1696 * does not wrap. However, the condition in the code applies
1697 * to the wrapped value, so we need to change condition(i)
1698 * into condition([i % 2^width]).
1699 * After computing the virtual domain and schedule, we apply
1700 * the function { [v] -> [v % 2^width] } to the domain and the domain
1701 * of the schedule. In order not to lose any information, we also
1702 * need to intersect the domain of the schedule with the virtual domain
1703 * first, since some iterations in the wrapped domain may be scheduled
1704 * several times, typically an infinite number of times.
1705 * Note that there is no need to perform this final wrapping
1706 * if the loop condition (after wrapping) is simple.
1708 * Wrapping on unsigned iterators can be avoided entirely if
1709 * loop condition is simple, the loop iterator is incremented
1710 * [decremented] by one and the last value before wrapping cannot
1711 * possibly satisfy the loop condition.
1713 * Before extracting a pet_scop from the body we remove all
1714 * assignments in assigned_value to variables that are assigned
1715 * somewhere in the body of the loop.
1717 struct pet_scop
*PetScan::extract_for(ForStmt
*stmt
)
1719 BinaryOperator
*ass
;
1729 struct pet_scop
*scop
;
1730 assigned_value_cache
cache(assigned_value
);
1735 isl_map
*wrap
= NULL
;
1737 if (!stmt
->getInit() && !stmt
->getCond() && !stmt
->getInc())
1738 return extract_infinite_for(stmt
);
1740 init
= stmt
->getInit();
1745 if ((ass
= initialization_assignment(init
)) != NULL
) {
1746 iv
= extract_induction_variable(ass
);
1749 lhs
= ass
->getLHS();
1750 rhs
= ass
->getRHS();
1751 } else if ((decl
= initialization_declaration(init
)) != NULL
) {
1752 VarDecl
*var
= extract_induction_variable(init
, decl
);
1756 rhs
= var
->getInit();
1757 lhs
= DeclRefExpr::Create(iv
->getASTContext(),
1758 var
->getQualifierLoc(), iv
, var
->getInnerLocStart(),
1759 var
->getType(), VK_LValue
);
1761 unsupported(stmt
->getInit());
1766 if (!check_increment(stmt
, iv
, inc
)) {
1771 is_unsigned
= iv
->getType()->isUnsignedIntegerType();
1773 assigned_value
[iv
] = NULL
;
1774 clear_assignments
clear(assigned_value
);
1775 clear
.TraverseStmt(stmt
->getBody());
1777 id
= isl_id_alloc(ctx
, iv
->getName().str().c_str(), iv
);
1779 is_one
= isl_int_is_one(inc
) || isl_int_is_negone(inc
);
1781 domain
= extract_comparison(isl_int_is_pos(inc
) ? BO_GE
: BO_LE
,
1784 isl_pw_aff
*lb
= extract_affine(rhs
);
1785 domain
= strided_domain(isl_id_copy(id
), lb
, inc
);
1788 cond
= extract_condition(stmt
->getCond());
1789 cond
= embed(cond
, isl_id_copy(id
));
1790 domain
= embed(domain
, isl_id_copy(id
));
1791 is_simple
= is_simple_bound(cond
, inc
);
1793 (!is_simple
|| !is_one
|| can_wrap(cond
, iv
, inc
))) {
1794 wrap
= compute_wrapping(isl_set_get_dim(cond
), iv
);
1795 cond
= isl_set_apply(cond
, isl_map_reverse(isl_map_copy(wrap
)));
1796 is_simple
= is_simple
&& is_simple_bound(cond
, inc
);
1799 cond
= valid_for_each_iteration(cond
,
1800 isl_set_copy(domain
), inc
);
1801 domain
= isl_set_intersect(domain
, cond
);
1802 domain
= isl_set_set_dim_id(domain
, isl_dim_set
, 0, isl_id_copy(id
));
1803 dim
= isl_dim_from_domain(isl_set_get_dim(domain
));
1804 dim
= isl_dim_add(dim
, isl_dim_out
, 1);
1805 sched
= isl_map_universe(dim
);
1806 if (isl_int_is_pos(inc
))
1807 sched
= isl_map_equate(sched
, isl_dim_in
, 0, isl_dim_out
, 0);
1809 sched
= isl_map_oppose(sched
, isl_dim_in
, 0, isl_dim_out
, 0);
1811 if (is_unsigned
&& !is_simple
) {
1812 wrap
= isl_map_set_dim_id(wrap
,
1813 isl_dim_out
, 0, isl_id_copy(id
));
1814 sched
= isl_map_intersect_domain(sched
, isl_set_copy(domain
));
1815 domain
= isl_set_apply(domain
, isl_map_copy(wrap
));
1816 sched
= isl_map_apply_domain(sched
, wrap
);
1820 scop
= extract(stmt
->getBody());
1821 scop
= pet_scop_embed(scop
, domain
, sched
, id
);
1827 struct pet_scop
*PetScan::extract(CompoundStmt
*stmt
)
1829 return extract(stmt
->children());
1832 /* Look for parameters in any access relation in "expr" that
1833 * refer to non-affine constructs. In particular, these are
1834 * parameters with no name.
1836 * If there are any such parameters, then the domain of the access
1837 * relation, which is still [] at this point, is replaced by
1838 * [[] -> [t_1,...,t_n]], with n the number of these parameters
1839 * (after identifying identical non-affine constructs).
1840 * The parameters are then equated to the corresponding t dimensions
1841 * and subsequently projected out.
1842 * param2pos maps the position of the parameter to the position
1843 * of the corresponding t dimension.
1845 struct pet_expr
*PetScan::resolve_nested(struct pet_expr
*expr
)
1852 std::map
<int,int> param2pos
;
1857 for (int i
= 0; i
< expr
->n_arg
; ++i
) {
1858 expr
->args
[i
] = resolve_nested(expr
->args
[i
]);
1859 if (!expr
->args
[i
]) {
1860 pet_expr_free(expr
);
1865 if (expr
->type
!= pet_expr_access
)
1868 nparam
= isl_map_dim(expr
->acc
.access
, isl_dim_param
);
1870 for (int i
= 0; i
< nparam
; ++i
) {
1871 isl_id
*id
= isl_map_get_dim_id(expr
->acc
.access
,
1873 if (id
&& isl_id_get_user(id
) && !isl_id_get_name(id
))
1882 expr
->args
= isl_calloc_array(ctx
, struct pet_expr
*, n
);
1886 n_in
= isl_map_dim(expr
->acc
.access
, isl_dim_in
);
1887 for (int i
= 0, pos
= 0; i
< nparam
; ++i
) {
1889 isl_id
*id
= isl_map_get_dim_id(expr
->acc
.access
,
1893 if (!(id
&& isl_id_get_user(id
) && !isl_id_get_name(id
))) {
1898 nested
= (Expr
*) isl_id_get_user(id
);
1899 expr
->args
[pos
] = extract_expr(nested
);
1901 for (j
= 0; j
< pos
; ++j
)
1902 if (pet_expr_is_equal(expr
->args
[j
], expr
->args
[pos
]))
1906 pet_expr_free(expr
->args
[pos
]);
1907 param2pos
[i
] = n_in
+ j
;
1910 param2pos
[i
] = n_in
+ pos
++;
1916 dim
= isl_map_get_dim(expr
->acc
.access
);
1917 dim
= isl_dim_domain(dim
);
1918 dim
= isl_dim_from_domain(dim
);
1919 dim
= isl_dim_add(dim
, isl_dim_out
, n
);
1920 map
= isl_map_universe(dim
);
1921 map
= isl_map_domain_map(map
);
1922 map
= isl_map_reverse(map
);
1923 expr
->acc
.access
= isl_map_apply_domain(expr
->acc
.access
, map
);
1925 for (int i
= nparam
- 1; i
>= 0; --i
) {
1926 isl_id
*id
= isl_map_get_dim_id(expr
->acc
.access
,
1928 if (!(id
&& isl_id_get_user(id
) && !isl_id_get_name(id
))) {
1933 expr
->acc
.access
= isl_map_equate(expr
->acc
.access
,
1934 isl_dim_param
, i
, isl_dim_in
,
1936 expr
->acc
.access
= isl_map_project_out(expr
->acc
.access
,
1937 isl_dim_param
, i
, 1);
1944 pet_expr_free(expr
);
1948 /* Convert a top-level pet_expr to a pet_scop with one statement.
1949 * This mainly involves resolving nested expression parameters
1950 * and setting the name of the iteration space.
1952 struct pet_scop
*PetScan::extract(Stmt
*stmt
, struct pet_expr
*expr
)
1954 struct pet_stmt
*ps
;
1955 SourceLocation loc
= stmt
->getLocStart();
1956 int line
= PP
.getSourceManager().getExpansionLineNumber(loc
);
1958 expr
= resolve_nested(expr
);
1959 ps
= pet_stmt_from_pet_expr(ctx
, line
, n_stmt
++, expr
);
1960 return pet_scop_from_pet_stmt(ctx
, ps
);
1963 /* Check whether "expr" is an affine expression.
1964 * We turn on autodetection so that we won't generate any warnings
1965 * and turn off nesting, so that we won't accept any non-affine constructs.
1967 bool PetScan::is_affine(Expr
*expr
)
1970 int save_autodetect
= autodetect
;
1971 bool save_nesting
= nesting_enabled
;
1974 nesting_enabled
= false;
1976 pwaff
= extract_affine(expr
);
1977 isl_pw_aff_free(pwaff
);
1979 autodetect
= save_autodetect
;
1980 nesting_enabled
= save_nesting
;
1982 return pwaff
!= NULL
;
1985 /* Check whether "expr" is an affine constraint.
1986 * We turn on autodetection so that we won't generate any warnings
1987 * and turn off nesting, so that we won't accept any non-affine constructs.
1989 bool PetScan::is_affine_condition(Expr
*expr
)
1992 int save_autodetect
= autodetect
;
1993 bool save_nesting
= nesting_enabled
;
1996 nesting_enabled
= false;
1998 set
= extract_condition(expr
);
2001 autodetect
= save_autodetect
;
2002 nesting_enabled
= save_nesting
;
2007 /* If the top-level expression of "stmt" is an assignment, then
2008 * return that assignment as a BinaryOperator.
2009 * Otherwise return NULL.
2011 static BinaryOperator
*top_assignment_or_null(Stmt
*stmt
)
2013 BinaryOperator
*ass
;
2017 if (stmt
->getStmtClass() != Stmt::BinaryOperatorClass
)
2020 ass
= cast
<BinaryOperator
>(stmt
);
2021 if(ass
->getOpcode() != BO_Assign
)
2027 /* Check if the given if statement is a conditional assignement
2028 * with a non-affine condition. If so, construct a pet_scop
2029 * corresponding to this conditional assignment. Otherwise return NULL.
2031 * In particular we check if "stmt" is of the form
2038 * where a is some array or scalar access.
2039 * The constructed pet_scop then corresponds to the expression
2041 * a = condition ? f(...) : g(...)
2043 * All access relations in f(...) are intersected with condition
2044 * while all access relation in g(...) are intersected with the complement.
2046 struct pet_scop
*PetScan::extract_conditional_assignment(IfStmt
*stmt
)
2048 BinaryOperator
*ass_then
, *ass_else
;
2049 isl_map
*write_then
, *write_else
;
2050 isl_set
*cond
, *comp
;
2051 isl_map
*map
, *map_true
, *map_false
;
2053 struct pet_expr
*pe_cond
, *pe_then
, *pe_else
, *pe
, *pe_write
;
2054 bool save_nesting
= nesting_enabled
;
2056 ass_then
= top_assignment_or_null(stmt
->getThen());
2057 ass_else
= top_assignment_or_null(stmt
->getElse());
2059 if (!ass_then
|| !ass_else
)
2062 if (is_affine_condition(stmt
->getCond()))
2065 write_then
= extract_access(ass_then
->getLHS());
2066 write_else
= extract_access(ass_else
->getLHS());
2068 equal
= isl_map_is_equal(write_then
, write_else
);
2069 isl_map_free(write_else
);
2070 if (equal
< 0 || !equal
) {
2071 isl_map_free(write_then
);
2075 nesting_enabled
= allow_nested
;
2076 cond
= extract_condition(stmt
->getCond());
2077 nesting_enabled
= save_nesting
;
2078 comp
= isl_set_complement(isl_set_copy(cond
));
2079 map_true
= isl_map_from_domain(isl_set_copy(cond
));
2080 map_true
= isl_map_add_dims(map_true
, isl_dim_out
, 1);
2081 map_true
= isl_map_fix_si(map_true
, isl_dim_out
, 0, 1);
2082 map_false
= isl_map_from_domain(isl_set_copy(comp
));
2083 map_false
= isl_map_add_dims(map_false
, isl_dim_out
, 1);
2084 map_false
= isl_map_fix_si(map_false
, isl_dim_out
, 0, 0);
2085 map
= isl_map_union_disjoint(map_true
, map_false
);
2087 pe_cond
= pet_expr_from_access(map
);
2089 pe_then
= extract_expr(ass_then
->getRHS());
2090 pe_then
= pet_expr_restrict(pe_then
, cond
);
2091 pe_else
= extract_expr(ass_else
->getRHS());
2092 pe_else
= pet_expr_restrict(pe_else
, comp
);
2094 pe
= pet_expr_new_ternary(ctx
, pe_cond
, pe_then
, pe_else
);
2095 pe_write
= pet_expr_from_access(write_then
);
2097 pe_write
->acc
.write
= 1;
2098 pe_write
->acc
.read
= 0;
2100 pe
= pet_expr_new_binary(ctx
, pet_op_assign
, pe_write
, pe
);
2101 return extract(stmt
, pe
);
2104 /* Construct a pet_scop for an if statement.
2106 struct pet_scop
*PetScan::extract(IfStmt
*stmt
)
2109 struct pet_scop
*scop_then
, *scop_else
, *scop
;
2110 assigned_value_cache
cache(assigned_value
);
2112 scop
= extract_conditional_assignment(stmt
);
2116 scop_then
= extract(stmt
->getThen());
2118 if (stmt
->getElse()) {
2119 scop_else
= extract(stmt
->getElse());
2121 if (scop_then
&& !scop_else
) {
2125 if (!scop_then
&& scop_else
) {
2132 cond
= extract_condition(stmt
->getCond());
2133 scop
= pet_scop_restrict(scop_then
, isl_set_copy(cond
));
2135 if (stmt
->getElse()) {
2136 cond
= isl_set_complement(cond
);
2137 scop_else
= pet_scop_restrict(scop_else
, cond
);
2138 scop
= pet_scop_add(ctx
, scop
, scop_else
);
2145 /* Try and construct a pet_scop corresponding to "stmt".
2147 struct pet_scop
*PetScan::extract(Stmt
*stmt
)
2149 if (isa
<Expr
>(stmt
))
2150 return extract(stmt
, extract_expr(cast
<Expr
>(stmt
)));
2152 switch (stmt
->getStmtClass()) {
2153 case Stmt::ForStmtClass
:
2154 return extract_for(cast
<ForStmt
>(stmt
));
2155 case Stmt::IfStmtClass
:
2156 return extract(cast
<IfStmt
>(stmt
));
2157 case Stmt::CompoundStmtClass
:
2158 return extract(cast
<CompoundStmt
>(stmt
));
2166 /* Try and construct a pet_scop corresponding to (part of)
2167 * a sequence of statements.
2169 struct pet_scop
*PetScan::extract(StmtRange stmt_range
)
2174 bool partial_range
= false;
2179 scop
= pet_scop_empty(ctx
);
2180 for (i
= stmt_range
.first
, j
= 0; i
!= stmt_range
.second
; ++i
, ++j
) {
2182 struct pet_scop
*scop_i
;
2183 scop_i
= extract(child
);
2184 if (scop
&& partial
) {
2185 pet_scop_free(scop_i
);
2188 scop_i
= pet_scop_prefix(scop_i
, j
);
2192 partial_range
= true;
2195 scop
= pet_scop_add(ctx
, scop
, scop_i
);
2199 scop
= pet_scop_add(ctx
, scop
, scop_i
);
2205 if (scop
&& partial_range
)
2211 /* Check if the scop marked by the user is exactly this Stmt
2212 * or part of this Stmt.
2213 * If so, return a pet_scop corresponding to the marked region.
2214 * Otherwise, return NULL.
2216 struct pet_scop
*PetScan::scan(Stmt
*stmt
)
2218 SourceManager
&SM
= PP
.getSourceManager();
2219 unsigned start_off
, end_off
;
2221 start_off
= SM
.getFileOffset(stmt
->getLocStart());
2222 end_off
= SM
.getFileOffset(stmt
->getLocEnd());
2224 if (start_off
> loc
.end
)
2226 if (end_off
< loc
.start
)
2228 if (start_off
>= loc
.start
&& end_off
<= loc
.end
) {
2229 return extract(stmt
);
2233 for (start
= stmt
->child_begin(); start
!= stmt
->child_end(); ++start
) {
2234 Stmt
*child
= *start
;
2235 start_off
= SM
.getFileOffset(child
->getLocStart());
2236 end_off
= SM
.getFileOffset(child
->getLocEnd());
2237 if (start_off
< loc
.start
&& end_off
> loc
.end
)
2239 if (start_off
>= loc
.start
)
2244 for (end
= start
; end
!= stmt
->child_end(); ++end
) {
2246 start_off
= SM
.getFileOffset(child
->getLocStart());
2247 if (start_off
>= loc
.end
)
2251 return extract(StmtRange(start
, end
));
2254 /* Set the size of index "pos" of "array" to "size".
2255 * In particular, add a constraint of the form
2259 * to array->extent and a constraint of the form
2263 * to array->context.
2265 static struct pet_array
*update_size(struct pet_array
*array
, int pos
,
2266 __isl_take isl_pw_aff
*size
)
2276 valid
= isl_pw_aff_nonneg_set(isl_pw_aff_copy(size
));
2277 array
->context
= isl_set_intersect(array
->context
, valid
);
2279 dim
= isl_set_get_dim(array
->extent
);
2280 aff
= isl_aff_zero(isl_local_space_from_dim(dim
));
2281 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_set
, pos
, 1);
2282 univ
= isl_set_universe(isl_aff_get_dim(aff
));
2283 index
= isl_pw_aff_alloc(univ
, aff
);
2285 size
= isl_pw_aff_add_dims(size
, isl_dim_set
,
2286 isl_set_dim(array
->extent
, isl_dim_set
));
2287 id
= isl_set_get_tuple_id(array
->extent
);
2288 size
= isl_pw_aff_set_tuple_id(size
, id
);
2289 bound
= isl_pw_aff_lt_set(index
, size
);
2291 array
->extent
= isl_set_intersect(array
->extent
, bound
);
2293 if (!array
->context
|| !array
->extent
)
2298 pet_array_free(array
);
2302 /* Figure out the size of the array at position "pos" and all
2303 * subsequent positions from "type" and update "array" accordingly.
2305 struct pet_array
*PetScan::set_upper_bounds(struct pet_array
*array
,
2306 const Type
*type
, int pos
)
2308 const ArrayType
*atype
;
2311 if (type
->isPointerType()) {
2312 type
= type
->getPointeeType().getTypePtr();
2313 return set_upper_bounds(array
, type
, pos
+ 1);
2315 if (!type
->isArrayType())
2318 type
= type
->getCanonicalTypeInternal().getTypePtr();
2319 atype
= cast
<ArrayType
>(type
);
2321 if (type
->isConstantArrayType()) {
2322 const ConstantArrayType
*ca
= cast
<ConstantArrayType
>(atype
);
2323 size
= extract_affine(ca
->getSize());
2324 array
= update_size(array
, pos
, size
);
2325 } else if (type
->isVariableArrayType()) {
2326 const VariableArrayType
*vla
= cast
<VariableArrayType
>(atype
);
2327 size
= extract_affine(vla
->getSizeExpr());
2328 array
= update_size(array
, pos
, size
);
2331 type
= atype
->getElementType().getTypePtr();
2333 return set_upper_bounds(array
, type
, pos
+ 1);
2336 /* Construct and return a pet_array corresponding to the variable "decl".
2337 * In particular, initialize array->extent to
2339 * { name[i_1,...,i_d] : i_1,...,i_d >= 0 }
2341 * and then call set_upper_bounds to set the upper bounds on the indices
2342 * based on the type of the variable.
2344 struct pet_array
*PetScan::extract_array(isl_ctx
*ctx
, ValueDecl
*decl
)
2346 struct pet_array
*array
;
2347 QualType qt
= decl
->getType();
2348 const Type
*type
= qt
.getTypePtr();
2349 int depth
= array_depth(type
);
2350 QualType base
= base_type(qt
);
2355 array
= isl_calloc_type(ctx
, struct pet_array
);
2359 id
= isl_id_alloc(ctx
, decl
->getName().str().c_str(), decl
);
2360 dim
= isl_dim_set_alloc(ctx
, 0, depth
);
2361 dim
= isl_dim_set_tuple_id(dim
, isl_dim_set
, id
);
2363 array
->extent
= isl_set_nat_universe(dim
);
2365 dim
= isl_dim_set_alloc(ctx
, 0, 0);
2366 array
->context
= isl_set_universe(dim
);
2368 array
= set_upper_bounds(array
, type
, 0);
2372 name
= base
.getAsString();
2373 array
->element_type
= strdup(name
.c_str());
2378 /* Construct a list of pet_arrays, one for each array (or scalar)
2379 * accessed inside "scop" add this list to "scop" and return the result.
2381 * The context of "scop" is updated with the intesection of
2382 * the contexts of all arrays, i.e., constraints on the parameters
2383 * that ensure that the arrays have a valid (non-negative) size.
2385 struct pet_scop
*PetScan::scan_arrays(struct pet_scop
*scop
)
2388 set
<ValueDecl
*> arrays
;
2389 set
<ValueDecl
*>::iterator it
;
2394 pet_scop_collect_arrays(scop
, arrays
);
2396 scop
->n_array
= arrays
.size();
2397 if (scop
->n_array
== 0)
2400 scop
->arrays
= isl_calloc_array(ctx
, struct pet_array
*, scop
->n_array
);
2404 for (it
= arrays
.begin(), i
= 0; it
!= arrays
.end(); ++it
, ++i
) {
2405 struct pet_array
*array
;
2406 scop
->arrays
[i
] = array
= extract_array(ctx
, *it
);
2407 if (!scop
->arrays
[i
])
2409 scop
->context
= isl_set_intersect(scop
->context
,
2410 isl_set_copy(array
->context
));
2417 pet_scop_free(scop
);
2421 /* Construct a pet_scop from the given function.
2423 struct pet_scop
*PetScan::scan(FunctionDecl
*fd
)
2428 stmt
= fd
->getBody();
2431 scop
= extract(stmt
);
2434 scop
= pet_scop_detect_parameter_accesses(scop
);
2435 scop
= scan_arrays(scop
);