2 * Copyright 2011 Leiden University. All rights reserved.
3 * Copyright 2012 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
38 #include <clang/AST/ASTDiagnostic.h>
39 #include <clang/AST/Expr.h>
40 #include <clang/AST/RecursiveASTVisitor.h>
43 #include <isl/space.h>
49 #include "scop_plus.h"
54 using namespace clang
;
56 #ifdef DECLREFEXPR_CREATE_REQUIRES_SOURCELOCATION
57 static DeclRefExpr
*create_DeclRefExpr(VarDecl
*var
)
59 return DeclRefExpr::Create(var
->getASTContext(), var
->getQualifierLoc(),
60 SourceLocation(), var
, var
->getInnerLocStart(), var
->getType(),
64 static DeclRefExpr
*create_DeclRefExpr(VarDecl
*var
)
66 return DeclRefExpr::Create(var
->getASTContext(), var
->getQualifierLoc(),
67 var
, var
->getInnerLocStart(), var
->getType(), VK_LValue
);
71 /* Check if the element type corresponding to the given array type
72 * has a const qualifier.
74 static bool const_base(QualType qt
)
76 const Type
*type
= qt
.getTypePtr();
78 if (type
->isPointerType())
79 return const_base(type
->getPointeeType());
80 if (type
->isArrayType()) {
81 const ArrayType
*atype
;
82 type
= type
->getCanonicalTypeInternal().getTypePtr();
83 atype
= cast
<ArrayType
>(type
);
84 return const_base(atype
->getElementType());
87 return qt
.isConstQualified();
90 /* Mark "decl" as having an unknown value in "assigned_value".
92 * If no (known or unknown) value was assigned to "decl" before,
93 * then it may have been treated as a parameter before and may
94 * therefore appear in a value assigned to another variable.
95 * If so, this assignment needs to be turned into an unknown value too.
97 static void clear_assignment(map
<ValueDecl
*, isl_pw_aff
*> &assigned_value
,
100 map
<ValueDecl
*, isl_pw_aff
*>::iterator it
;
102 it
= assigned_value
.find(decl
);
104 assigned_value
[decl
] = NULL
;
106 if (it
== assigned_value
.end())
109 for (it
= assigned_value
.begin(); it
!= assigned_value
.end(); ++it
) {
110 isl_pw_aff
*pa
= it
->second
;
111 int nparam
= isl_pw_aff_dim(pa
, isl_dim_param
);
113 for (int i
= 0; i
< nparam
; ++i
) {
116 if (!isl_pw_aff_has_dim_id(pa
, isl_dim_param
, i
))
118 id
= isl_pw_aff_get_dim_id(pa
, isl_dim_param
, i
);
119 if (isl_id_get_user(id
) == decl
)
126 /* Look for any assignments to scalar variables in part of the parse
127 * tree and set assigned_value to NULL for each of them.
128 * Also reset assigned_value if the address of a scalar variable
129 * is being taken. As an exception, if the address is passed to a function
130 * that is declared to receive a const pointer, then assigned_value is
133 * This ensures that we won't use any previously stored value
134 * in the current subtree and its parents.
136 struct clear_assignments
: RecursiveASTVisitor
<clear_assignments
> {
137 map
<ValueDecl
*, isl_pw_aff
*> &assigned_value
;
138 set
<UnaryOperator
*> skip
;
140 clear_assignments(map
<ValueDecl
*, isl_pw_aff
*> &assigned_value
) :
141 assigned_value(assigned_value
) {}
143 /* Check for "address of" operators whose value is passed
144 * to a const pointer argument and add them to "skip", so that
145 * we can skip them in VisitUnaryOperator.
147 bool VisitCallExpr(CallExpr
*expr
) {
149 fd
= expr
->getDirectCallee();
152 for (int i
= 0; i
< expr
->getNumArgs(); ++i
) {
153 Expr
*arg
= expr
->getArg(i
);
155 if (arg
->getStmtClass() == Stmt::ImplicitCastExprClass
) {
156 ImplicitCastExpr
*ice
;
157 ice
= cast
<ImplicitCastExpr
>(arg
);
158 arg
= ice
->getSubExpr();
160 if (arg
->getStmtClass() != Stmt::UnaryOperatorClass
)
162 op
= cast
<UnaryOperator
>(arg
);
163 if (op
->getOpcode() != UO_AddrOf
)
165 if (const_base(fd
->getParamDecl(i
)->getType()))
171 bool VisitUnaryOperator(UnaryOperator
*expr
) {
176 if (expr
->getOpcode() != UO_AddrOf
)
178 if (skip
.find(expr
) != skip
.end())
181 arg
= expr
->getSubExpr();
182 if (arg
->getStmtClass() != Stmt::DeclRefExprClass
)
184 ref
= cast
<DeclRefExpr
>(arg
);
185 decl
= ref
->getDecl();
186 clear_assignment(assigned_value
, decl
);
190 bool VisitBinaryOperator(BinaryOperator
*expr
) {
195 if (!expr
->isAssignmentOp())
197 lhs
= expr
->getLHS();
198 if (lhs
->getStmtClass() != Stmt::DeclRefExprClass
)
200 ref
= cast
<DeclRefExpr
>(lhs
);
201 decl
= ref
->getDecl();
202 clear_assignment(assigned_value
, decl
);
207 /* Keep a copy of the currently assigned values.
209 * Any variable that is assigned a value inside the current scope
210 * is removed again when we leave the scope (either because it wasn't
211 * stored in the cache or because it has a different value in the cache).
213 struct assigned_value_cache
{
214 map
<ValueDecl
*, isl_pw_aff
*> &assigned_value
;
215 map
<ValueDecl
*, isl_pw_aff
*> cache
;
217 assigned_value_cache(map
<ValueDecl
*, isl_pw_aff
*> &assigned_value
) :
218 assigned_value(assigned_value
), cache(assigned_value
) {}
219 ~assigned_value_cache() {
220 map
<ValueDecl
*, isl_pw_aff
*>::iterator it
= cache
.begin();
221 for (it
= assigned_value
.begin(); it
!= assigned_value
.end();
224 (cache
.find(it
->first
) != cache
.end() &&
225 cache
[it
->first
] != it
->second
))
226 cache
[it
->first
] = NULL
;
228 assigned_value
= cache
;
232 /* Insert an expression into the collection of expressions,
233 * provided it is not already in there.
234 * The isl_pw_affs are freed in the destructor.
236 void PetScan::insert_expression(__isl_take isl_pw_aff
*expr
)
238 std::set
<isl_pw_aff
*>::iterator it
;
240 if (expressions
.find(expr
) == expressions
.end())
241 expressions
.insert(expr
);
243 isl_pw_aff_free(expr
);
248 std::set
<isl_pw_aff
*>::iterator it
;
250 for (it
= expressions
.begin(); it
!= expressions
.end(); ++it
)
251 isl_pw_aff_free(*it
);
253 isl_union_map_free(value_bounds
);
256 /* Called if we found something we (currently) cannot handle.
257 * We'll provide more informative warnings later.
259 * We only actually complain if autodetect is false.
261 void PetScan::unsupported(Stmt
*stmt
, const char *msg
)
266 SourceLocation loc
= stmt
->getLocStart();
267 DiagnosticsEngine
&diag
= PP
.getDiagnostics();
268 unsigned id
= diag
.getCustomDiagID(DiagnosticsEngine::Warning
,
269 msg
? msg
: "unsupported");
270 DiagnosticBuilder B
= diag
.Report(loc
, id
) << stmt
->getSourceRange();
273 /* Extract an integer from "expr" and store it in "v".
275 int PetScan::extract_int(IntegerLiteral
*expr
, isl_int
*v
)
277 const Type
*type
= expr
->getType().getTypePtr();
278 int is_signed
= type
->hasSignedIntegerRepresentation();
281 int64_t i
= expr
->getValue().getSExtValue();
282 isl_int_set_si(*v
, i
);
284 uint64_t i
= expr
->getValue().getZExtValue();
285 isl_int_set_ui(*v
, i
);
291 /* Extract an integer from "expr" and store it in "v".
292 * Return -1 if "expr" does not (obviously) represent an integer.
294 int PetScan::extract_int(clang::ParenExpr
*expr
, isl_int
*v
)
296 return extract_int(expr
->getSubExpr(), v
);
299 /* Extract an integer from "expr" and store it in "v".
300 * Return -1 if "expr" does not (obviously) represent an integer.
302 int PetScan::extract_int(clang::Expr
*expr
, isl_int
*v
)
304 if (expr
->getStmtClass() == Stmt::IntegerLiteralClass
)
305 return extract_int(cast
<IntegerLiteral
>(expr
), v
);
306 if (expr
->getStmtClass() == Stmt::ParenExprClass
)
307 return extract_int(cast
<ParenExpr
>(expr
), v
);
313 /* Extract an affine expression from the IntegerLiteral "expr".
315 __isl_give isl_pw_aff
*PetScan::extract_affine(IntegerLiteral
*expr
)
317 isl_space
*dim
= isl_space_params_alloc(ctx
, 0);
318 isl_local_space
*ls
= isl_local_space_from_space(isl_space_copy(dim
));
319 isl_aff
*aff
= isl_aff_zero_on_domain(ls
);
320 isl_set
*dom
= isl_set_universe(dim
);
324 extract_int(expr
, &v
);
325 aff
= isl_aff_add_constant(aff
, v
);
328 return isl_pw_aff_alloc(dom
, aff
);
331 /* Extract an affine expression from the APInt "val".
333 __isl_give isl_pw_aff
*PetScan::extract_affine(const llvm::APInt
&val
)
335 isl_space
*dim
= isl_space_params_alloc(ctx
, 0);
336 isl_local_space
*ls
= isl_local_space_from_space(isl_space_copy(dim
));
337 isl_aff
*aff
= isl_aff_zero_on_domain(ls
);
338 isl_set
*dom
= isl_set_universe(dim
);
342 isl_int_set_ui(v
, val
.getZExtValue());
343 aff
= isl_aff_add_constant(aff
, v
);
346 return isl_pw_aff_alloc(dom
, aff
);
349 __isl_give isl_pw_aff
*PetScan::extract_affine(ImplicitCastExpr
*expr
)
351 return extract_affine(expr
->getSubExpr());
354 static unsigned get_type_size(ValueDecl
*decl
)
356 return decl
->getASTContext().getIntWidth(decl
->getType());
359 /* Bound parameter "pos" of "set" to the possible values of "decl".
361 static __isl_give isl_set
*set_parameter_bounds(__isl_take isl_set
*set
,
362 unsigned pos
, ValueDecl
*decl
)
369 width
= get_type_size(decl
);
370 if (decl
->getType()->isUnsignedIntegerType()) {
371 set
= isl_set_lower_bound_si(set
, isl_dim_param
, pos
, 0);
372 isl_int_set_si(v
, 1);
373 isl_int_mul_2exp(v
, v
, width
);
374 isl_int_sub_ui(v
, v
, 1);
375 set
= isl_set_upper_bound(set
, isl_dim_param
, pos
, v
);
377 isl_int_set_si(v
, 1);
378 isl_int_mul_2exp(v
, v
, width
- 1);
379 isl_int_sub_ui(v
, v
, 1);
380 set
= isl_set_upper_bound(set
, isl_dim_param
, pos
, v
);
382 isl_int_sub_ui(v
, v
, 1);
383 set
= isl_set_lower_bound(set
, isl_dim_param
, pos
, v
);
391 /* Extract an affine expression from the DeclRefExpr "expr".
393 * If the variable has been assigned a value, then we check whether
394 * we know what (affine) value was assigned.
395 * If so, we return this value. Otherwise we convert "expr"
396 * to an extra parameter (provided nesting_enabled is set).
398 * Otherwise, we simply return an expression that is equal
399 * to a parameter corresponding to the referenced variable.
401 __isl_give isl_pw_aff
*PetScan::extract_affine(DeclRefExpr
*expr
)
403 ValueDecl
*decl
= expr
->getDecl();
404 const Type
*type
= decl
->getType().getTypePtr();
410 if (!type
->isIntegerType()) {
415 if (assigned_value
.find(decl
) != assigned_value
.end()) {
416 if (assigned_value
[decl
])
417 return isl_pw_aff_copy(assigned_value
[decl
]);
419 return nested_access(expr
);
422 id
= isl_id_alloc(ctx
, decl
->getName().str().c_str(), decl
);
423 dim
= isl_space_params_alloc(ctx
, 1);
425 dim
= isl_space_set_dim_id(dim
, isl_dim_param
, 0, id
);
427 dom
= isl_set_universe(isl_space_copy(dim
));
428 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
429 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_param
, 0, 1);
431 return isl_pw_aff_alloc(dom
, aff
);
434 /* Extract an affine expression from an integer division operation.
435 * In particular, if "expr" is lhs/rhs, then return
437 * lhs >= 0 ? floor(lhs/rhs) : ceil(lhs/rhs)
439 * The second argument (rhs) is required to be a (positive) integer constant.
441 __isl_give isl_pw_aff
*PetScan::extract_affine_div(BinaryOperator
*expr
)
444 isl_pw_aff
*lhs
, *lhs_f
, *lhs_c
;
449 rhs_expr
= expr
->getRHS();
451 if (extract_int(rhs_expr
, &v
) < 0) {
456 lhs
= extract_affine(expr
->getLHS());
457 cond
= isl_pw_aff_nonneg_set(isl_pw_aff_copy(lhs
));
459 lhs
= isl_pw_aff_scale_down(lhs
, v
);
462 lhs_f
= isl_pw_aff_floor(isl_pw_aff_copy(lhs
));
463 lhs_c
= isl_pw_aff_ceil(lhs
);
464 res
= isl_pw_aff_cond(isl_set_indicator_function(cond
), lhs_f
, lhs_c
);
469 /* Extract an affine expression from a modulo operation.
470 * In particular, if "expr" is lhs/rhs, then return
472 * lhs - rhs * (lhs >= 0 ? floor(lhs/rhs) : ceil(lhs/rhs))
474 * The second argument (rhs) is required to be a (positive) integer constant.
476 __isl_give isl_pw_aff
*PetScan::extract_affine_mod(BinaryOperator
*expr
)
479 isl_pw_aff
*lhs
, *lhs_f
, *lhs_c
;
484 rhs_expr
= expr
->getRHS();
485 if (rhs_expr
->getStmtClass() != Stmt::IntegerLiteralClass
) {
490 lhs
= extract_affine(expr
->getLHS());
491 cond
= isl_pw_aff_nonneg_set(isl_pw_aff_copy(lhs
));
494 extract_int(cast
<IntegerLiteral
>(rhs_expr
), &v
);
495 res
= isl_pw_aff_scale_down(isl_pw_aff_copy(lhs
), v
);
497 lhs_f
= isl_pw_aff_floor(isl_pw_aff_copy(res
));
498 lhs_c
= isl_pw_aff_ceil(res
);
499 res
= isl_pw_aff_cond(isl_set_indicator_function(cond
), lhs_f
, lhs_c
);
501 res
= isl_pw_aff_scale(res
, v
);
504 res
= isl_pw_aff_sub(lhs
, res
);
509 /* Extract an affine expression from a multiplication operation.
510 * This is only allowed if at least one of the two arguments
511 * is a (piecewise) constant.
513 __isl_give isl_pw_aff
*PetScan::extract_affine_mul(BinaryOperator
*expr
)
518 lhs
= extract_affine(expr
->getLHS());
519 rhs
= extract_affine(expr
->getRHS());
521 if (!isl_pw_aff_is_cst(lhs
) && !isl_pw_aff_is_cst(rhs
)) {
522 isl_pw_aff_free(lhs
);
523 isl_pw_aff_free(rhs
);
528 return isl_pw_aff_mul(lhs
, rhs
);
531 /* Extract an affine expression from an addition or subtraction operation.
533 __isl_give isl_pw_aff
*PetScan::extract_affine_add(BinaryOperator
*expr
)
538 lhs
= extract_affine(expr
->getLHS());
539 rhs
= extract_affine(expr
->getRHS());
541 switch (expr
->getOpcode()) {
543 return isl_pw_aff_add(lhs
, rhs
);
545 return isl_pw_aff_sub(lhs
, rhs
);
547 isl_pw_aff_free(lhs
);
548 isl_pw_aff_free(rhs
);
558 static __isl_give isl_pw_aff
*wrap(__isl_take isl_pw_aff
*pwaff
,
564 isl_int_set_si(mod
, 1);
565 isl_int_mul_2exp(mod
, mod
, width
);
567 pwaff
= isl_pw_aff_mod(pwaff
, mod
);
574 /* Return the piecewise affine expression "set ? 1 : 0" defined on "dom".
576 static __isl_give isl_pw_aff
*indicator_function(__isl_take isl_set
*set
,
577 __isl_take isl_set
*dom
)
580 pa
= isl_set_indicator_function(set
);
581 pa
= isl_pw_aff_intersect_domain(pa
, dom
);
585 /* Extract an affine expression from some binary operations.
586 * If the result of the expression is unsigned, then we wrap it
587 * based on the size of the type.
589 __isl_give isl_pw_aff
*PetScan::extract_affine(BinaryOperator
*expr
)
593 switch (expr
->getOpcode()) {
596 res
= extract_affine_add(expr
);
599 res
= extract_affine_div(expr
);
602 res
= extract_affine_mod(expr
);
605 res
= extract_affine_mul(expr
);
615 return extract_condition(expr
);
621 if (expr
->getType()->isUnsignedIntegerType())
622 res
= wrap(res
, ast_context
.getIntWidth(expr
->getType()));
627 /* Extract an affine expression from a negation operation.
629 __isl_give isl_pw_aff
*PetScan::extract_affine(UnaryOperator
*expr
)
631 if (expr
->getOpcode() == UO_Minus
)
632 return isl_pw_aff_neg(extract_affine(expr
->getSubExpr()));
633 if (expr
->getOpcode() == UO_LNot
)
634 return extract_condition(expr
);
640 __isl_give isl_pw_aff
*PetScan::extract_affine(ParenExpr
*expr
)
642 return extract_affine(expr
->getSubExpr());
645 /* Extract an affine expression from some special function calls.
646 * In particular, we handle "min", "max", "ceild" and "floord".
647 * In case of the latter two, the second argument needs to be
648 * a (positive) integer constant.
650 __isl_give isl_pw_aff
*PetScan::extract_affine(CallExpr
*expr
)
654 isl_pw_aff
*aff1
, *aff2
;
656 fd
= expr
->getDirectCallee();
662 name
= fd
->getDeclName().getAsString();
663 if (!(expr
->getNumArgs() == 2 && name
== "min") &&
664 !(expr
->getNumArgs() == 2 && name
== "max") &&
665 !(expr
->getNumArgs() == 2 && name
== "floord") &&
666 !(expr
->getNumArgs() == 2 && name
== "ceild")) {
671 if (name
== "min" || name
== "max") {
672 aff1
= extract_affine(expr
->getArg(0));
673 aff2
= extract_affine(expr
->getArg(1));
676 aff1
= isl_pw_aff_min(aff1
, aff2
);
678 aff1
= isl_pw_aff_max(aff1
, aff2
);
679 } else if (name
== "floord" || name
== "ceild") {
681 Expr
*arg2
= expr
->getArg(1);
683 if (arg2
->getStmtClass() != Stmt::IntegerLiteralClass
) {
687 aff1
= extract_affine(expr
->getArg(0));
689 extract_int(cast
<IntegerLiteral
>(arg2
), &v
);
690 aff1
= isl_pw_aff_scale_down(aff1
, v
);
692 if (name
== "floord")
693 aff1
= isl_pw_aff_floor(aff1
);
695 aff1
= isl_pw_aff_ceil(aff1
);
705 /* This method is called when we come across an access that is
706 * nested in what is supposed to be an affine expression.
707 * If nesting is allowed, we return a new parameter that corresponds
708 * to this nested access. Otherwise, we simply complain.
710 * The new parameter is resolved in resolve_nested.
712 isl_pw_aff
*PetScan::nested_access(Expr
*expr
)
719 if (!nesting_enabled
) {
724 id
= isl_id_alloc(ctx
, NULL
, expr
);
725 dim
= isl_space_params_alloc(ctx
, 1);
727 dim
= isl_space_set_dim_id(dim
, isl_dim_param
, 0, id
);
729 dom
= isl_set_universe(isl_space_copy(dim
));
730 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
731 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_param
, 0, 1);
733 return isl_pw_aff_alloc(dom
, aff
);
736 /* Affine expressions are not supposed to contain array accesses,
737 * but if nesting is allowed, we return a parameter corresponding
738 * to the array access.
740 __isl_give isl_pw_aff
*PetScan::extract_affine(ArraySubscriptExpr
*expr
)
742 return nested_access(expr
);
745 /* Extract an affine expression from a conditional operation.
747 __isl_give isl_pw_aff
*PetScan::extract_affine(ConditionalOperator
*expr
)
749 isl_pw_aff
*cond
, *lhs
, *rhs
, *res
;
751 cond
= extract_condition(expr
->getCond());
752 lhs
= extract_affine(expr
->getTrueExpr());
753 rhs
= extract_affine(expr
->getFalseExpr());
755 return isl_pw_aff_cond(cond
, lhs
, rhs
);
758 /* Extract an affine expression, if possible, from "expr".
759 * Otherwise return NULL.
761 __isl_give isl_pw_aff
*PetScan::extract_affine(Expr
*expr
)
763 switch (expr
->getStmtClass()) {
764 case Stmt::ImplicitCastExprClass
:
765 return extract_affine(cast
<ImplicitCastExpr
>(expr
));
766 case Stmt::IntegerLiteralClass
:
767 return extract_affine(cast
<IntegerLiteral
>(expr
));
768 case Stmt::DeclRefExprClass
:
769 return extract_affine(cast
<DeclRefExpr
>(expr
));
770 case Stmt::BinaryOperatorClass
:
771 return extract_affine(cast
<BinaryOperator
>(expr
));
772 case Stmt::UnaryOperatorClass
:
773 return extract_affine(cast
<UnaryOperator
>(expr
));
774 case Stmt::ParenExprClass
:
775 return extract_affine(cast
<ParenExpr
>(expr
));
776 case Stmt::CallExprClass
:
777 return extract_affine(cast
<CallExpr
>(expr
));
778 case Stmt::ArraySubscriptExprClass
:
779 return extract_affine(cast
<ArraySubscriptExpr
>(expr
));
780 case Stmt::ConditionalOperatorClass
:
781 return extract_affine(cast
<ConditionalOperator
>(expr
));
788 __isl_give isl_map
*PetScan::extract_access(ImplicitCastExpr
*expr
)
790 return extract_access(expr
->getSubExpr());
793 /* Return the depth of an array of the given type.
795 static int array_depth(const Type
*type
)
797 if (type
->isPointerType())
798 return 1 + array_depth(type
->getPointeeType().getTypePtr());
799 if (type
->isArrayType()) {
800 const ArrayType
*atype
;
801 type
= type
->getCanonicalTypeInternal().getTypePtr();
802 atype
= cast
<ArrayType
>(type
);
803 return 1 + array_depth(atype
->getElementType().getTypePtr());
808 /* Return the element type of the given array type.
810 static QualType
base_type(QualType qt
)
812 const Type
*type
= qt
.getTypePtr();
814 if (type
->isPointerType())
815 return base_type(type
->getPointeeType());
816 if (type
->isArrayType()) {
817 const ArrayType
*atype
;
818 type
= type
->getCanonicalTypeInternal().getTypePtr();
819 atype
= cast
<ArrayType
>(type
);
820 return base_type(atype
->getElementType());
825 /* Extract an access relation from a reference to a variable.
826 * If the variable has name "A" and its type corresponds to an
827 * array of depth d, then the returned access relation is of the
830 * { [] -> A[i_1,...,i_d] }
832 __isl_give isl_map
*PetScan::extract_access(DeclRefExpr
*expr
)
834 ValueDecl
*decl
= expr
->getDecl();
835 int depth
= array_depth(decl
->getType().getTypePtr());
836 isl_id
*id
= isl_id_alloc(ctx
, decl
->getName().str().c_str(), decl
);
837 isl_space
*dim
= isl_space_alloc(ctx
, 0, 0, depth
);
840 dim
= isl_space_set_tuple_id(dim
, isl_dim_out
, id
);
842 access_rel
= isl_map_universe(dim
);
847 /* Extract an access relation from an integer contant.
848 * If the value of the constant is "v", then the returned access relation
853 __isl_give isl_map
*PetScan::extract_access(IntegerLiteral
*expr
)
855 return isl_map_from_range(isl_set_from_pw_aff(extract_affine(expr
)));
858 /* Try and extract an access relation from the given Expr.
859 * Return NULL if it doesn't work out.
861 __isl_give isl_map
*PetScan::extract_access(Expr
*expr
)
863 switch (expr
->getStmtClass()) {
864 case Stmt::ImplicitCastExprClass
:
865 return extract_access(cast
<ImplicitCastExpr
>(expr
));
866 case Stmt::DeclRefExprClass
:
867 return extract_access(cast
<DeclRefExpr
>(expr
));
868 case Stmt::ArraySubscriptExprClass
:
869 return extract_access(cast
<ArraySubscriptExpr
>(expr
));
876 /* Assign the affine expression "index" to the output dimension "pos" of "map"
877 * and return the result.
879 __isl_give isl_map
*set_index(__isl_take isl_map
*map
, int pos
,
880 __isl_take isl_pw_aff
*index
)
883 int len
= isl_map_dim(map
, isl_dim_out
);
886 index_map
= isl_map_from_range(isl_set_from_pw_aff(index
));
887 index_map
= isl_map_insert_dims(index_map
, isl_dim_out
, 0, pos
);
888 index_map
= isl_map_add_dims(index_map
, isl_dim_out
, len
- pos
- 1);
889 id
= isl_map_get_tuple_id(map
, isl_dim_out
);
890 index_map
= isl_map_set_tuple_id(index_map
, isl_dim_out
, id
);
892 map
= isl_map_intersect(map
, index_map
);
897 /* Extract an access relation from the given array subscript expression.
898 * If nesting is allowed in general, then we turn it on while
899 * examining the index expression.
901 * We first extract an access relation from the base.
902 * This will result in an access relation with a range that corresponds
903 * to the array being accessed and with earlier indices filled in already.
904 * We then extract the current index and fill that in as well.
905 * The position of the current index is based on the type of base.
906 * If base is the actual array variable, then the depth of this type
907 * will be the same as the depth of the array and we will fill in
908 * the first array index.
909 * Otherwise, the depth of the base type will be smaller and we will fill
912 __isl_give isl_map
*PetScan::extract_access(ArraySubscriptExpr
*expr
)
914 Expr
*base
= expr
->getBase();
915 Expr
*idx
= expr
->getIdx();
917 isl_map
*base_access
;
919 int depth
= array_depth(base
->getType().getTypePtr());
921 bool save_nesting
= nesting_enabled
;
923 nesting_enabled
= allow_nested
;
925 base_access
= extract_access(base
);
926 index
= extract_affine(idx
);
928 nesting_enabled
= save_nesting
;
930 pos
= isl_map_dim(base_access
, isl_dim_out
) - depth
;
931 access
= set_index(base_access
, pos
, index
);
936 /* Check if "expr" calls function "minmax" with two arguments and if so
937 * make lhs and rhs refer to these two arguments.
939 static bool is_minmax(Expr
*expr
, const char *minmax
, Expr
*&lhs
, Expr
*&rhs
)
945 if (expr
->getStmtClass() != Stmt::CallExprClass
)
948 call
= cast
<CallExpr
>(expr
);
949 fd
= call
->getDirectCallee();
953 if (call
->getNumArgs() != 2)
956 name
= fd
->getDeclName().getAsString();
960 lhs
= call
->getArg(0);
961 rhs
= call
->getArg(1);
966 /* Check if "expr" is of the form min(lhs, rhs) and if so make
967 * lhs and rhs refer to the two arguments.
969 static bool is_min(Expr
*expr
, Expr
*&lhs
, Expr
*&rhs
)
971 return is_minmax(expr
, "min", lhs
, rhs
);
974 /* Check if "expr" is of the form max(lhs, rhs) and if so make
975 * lhs and rhs refer to the two arguments.
977 static bool is_max(Expr
*expr
, Expr
*&lhs
, Expr
*&rhs
)
979 return is_minmax(expr
, "max", lhs
, rhs
);
982 /* Return "lhs && rhs", defined on the shared definition domain.
984 static __isl_give isl_pw_aff
*pw_aff_and(__isl_take isl_pw_aff
*lhs
,
985 __isl_take isl_pw_aff
*rhs
)
990 dom
= isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(lhs
)),
991 isl_pw_aff_domain(isl_pw_aff_copy(rhs
)));
992 cond
= isl_set_intersect(isl_pw_aff_non_zero_set(lhs
),
993 isl_pw_aff_non_zero_set(rhs
));
994 return indicator_function(cond
, dom
);
997 /* Return "lhs && rhs", with shortcut semantics.
998 * That is, if lhs is false, then the result is defined even if rhs is not.
999 * In practice, we compute lhs ? rhs : lhs.
1001 static __isl_give isl_pw_aff
*pw_aff_and_then(__isl_take isl_pw_aff
*lhs
,
1002 __isl_take isl_pw_aff
*rhs
)
1004 return isl_pw_aff_cond(isl_pw_aff_copy(lhs
), rhs
, lhs
);
1007 /* Return "lhs || rhs", with shortcut semantics.
1008 * That is, if lhs is true, then the result is defined even if rhs is not.
1009 * In practice, we compute lhs ? lhs : rhs.
1011 static __isl_give isl_pw_aff
*pw_aff_or_else(__isl_take isl_pw_aff
*lhs
,
1012 __isl_take isl_pw_aff
*rhs
)
1014 return isl_pw_aff_cond(isl_pw_aff_copy(lhs
), lhs
, rhs
);
1017 /* Extract an affine expressions representing the comparison "LHS op RHS"
1018 * "comp" is the original statement that "LHS op RHS" is derived from
1019 * and is used for diagnostics.
1021 * If the comparison is of the form
1025 * then the expression is constructed as the conjunction of
1030 * A similar optimization is performed for max(a,b) <= c.
1031 * We do this because that will lead to simpler representations
1032 * of the expression.
1033 * If isl is ever enhanced to explicitly deal with min and max expressions,
1034 * this optimization can be removed.
1036 __isl_give isl_pw_aff
*PetScan::extract_comparison(BinaryOperatorKind op
,
1037 Expr
*LHS
, Expr
*RHS
, Stmt
*comp
)
1046 return extract_comparison(BO_LT
, RHS
, LHS
, comp
);
1048 return extract_comparison(BO_LE
, RHS
, LHS
, comp
);
1050 if (op
== BO_LT
|| op
== BO_LE
) {
1051 Expr
*expr1
, *expr2
;
1052 if (is_min(RHS
, expr1
, expr2
)) {
1053 lhs
= extract_comparison(op
, LHS
, expr1
, comp
);
1054 rhs
= extract_comparison(op
, LHS
, expr2
, comp
);
1055 return pw_aff_and(lhs
, rhs
);
1057 if (is_max(LHS
, expr1
, expr2
)) {
1058 lhs
= extract_comparison(op
, expr1
, RHS
, comp
);
1059 rhs
= extract_comparison(op
, expr2
, RHS
, comp
);
1060 return pw_aff_and(lhs
, rhs
);
1064 lhs
= extract_affine(LHS
);
1065 rhs
= extract_affine(RHS
);
1067 dom
= isl_pw_aff_domain(isl_pw_aff_copy(lhs
));
1068 dom
= isl_set_intersect(dom
, isl_pw_aff_domain(isl_pw_aff_copy(rhs
)));
1072 cond
= isl_pw_aff_lt_set(lhs
, rhs
);
1075 cond
= isl_pw_aff_le_set(lhs
, rhs
);
1078 cond
= isl_pw_aff_eq_set(lhs
, rhs
);
1081 cond
= isl_pw_aff_ne_set(lhs
, rhs
);
1084 isl_pw_aff_free(lhs
);
1085 isl_pw_aff_free(rhs
);
1091 cond
= isl_set_coalesce(cond
);
1092 res
= indicator_function(cond
, dom
);
1097 __isl_give isl_pw_aff
*PetScan::extract_comparison(BinaryOperator
*comp
)
1099 return extract_comparison(comp
->getOpcode(), comp
->getLHS(),
1100 comp
->getRHS(), comp
);
1103 /* Extract an affine expression representing the negation (logical not)
1104 * of a subexpression.
1106 __isl_give isl_pw_aff
*PetScan::extract_boolean(UnaryOperator
*op
)
1108 isl_set
*set_cond
, *dom
;
1109 isl_pw_aff
*cond
, *res
;
1111 cond
= extract_condition(op
->getSubExpr());
1113 dom
= isl_pw_aff_domain(isl_pw_aff_copy(cond
));
1115 set_cond
= isl_pw_aff_zero_set(cond
);
1117 res
= indicator_function(set_cond
, dom
);
1122 /* Extract an affine expression representing the disjunction (logical or)
1123 * or conjunction (logical and) of two subexpressions.
1125 __isl_give isl_pw_aff
*PetScan::extract_boolean(BinaryOperator
*comp
)
1127 isl_pw_aff
*lhs
, *rhs
;
1129 lhs
= extract_condition(comp
->getLHS());
1130 rhs
= extract_condition(comp
->getRHS());
1132 switch (comp
->getOpcode()) {
1134 return pw_aff_and_then(lhs
, rhs
);
1136 return pw_aff_or_else(lhs
, rhs
);
1138 isl_pw_aff_free(lhs
);
1139 isl_pw_aff_free(rhs
);
1146 __isl_give isl_pw_aff
*PetScan::extract_condition(UnaryOperator
*expr
)
1148 switch (expr
->getOpcode()) {
1150 return extract_boolean(expr
);
1157 /* Extract the affine expression "expr != 0 ? 1 : 0".
1159 __isl_give isl_pw_aff
*PetScan::extract_implicit_condition(Expr
*expr
)
1164 res
= extract_affine(expr
);
1166 dom
= isl_pw_aff_domain(isl_pw_aff_copy(res
));
1167 set
= isl_pw_aff_non_zero_set(res
);
1169 res
= indicator_function(set
, dom
);
1174 /* Extract an affine expression from a boolean expression.
1175 * In particular, return the expression "expr ? 1 : 0".
1177 * If the expression doesn't look like a condition, we assume it
1178 * is an affine expression and return the condition "expr != 0 ? 1 : 0".
1180 __isl_give isl_pw_aff
*PetScan::extract_condition(Expr
*expr
)
1182 BinaryOperator
*comp
;
1185 isl_set
*u
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
1186 return indicator_function(u
, isl_set_copy(u
));
1189 if (expr
->getStmtClass() == Stmt::ParenExprClass
)
1190 return extract_condition(cast
<ParenExpr
>(expr
)->getSubExpr());
1192 if (expr
->getStmtClass() == Stmt::UnaryOperatorClass
)
1193 return extract_condition(cast
<UnaryOperator
>(expr
));
1195 if (expr
->getStmtClass() != Stmt::BinaryOperatorClass
)
1196 return extract_implicit_condition(expr
);
1198 comp
= cast
<BinaryOperator
>(expr
);
1199 switch (comp
->getOpcode()) {
1206 return extract_comparison(comp
);
1209 return extract_boolean(comp
);
1211 return extract_implicit_condition(expr
);
1215 static enum pet_op_type
UnaryOperatorKind2pet_op_type(UnaryOperatorKind kind
)
1219 return pet_op_minus
;
1225 static enum pet_op_type
BinaryOperatorKind2pet_op_type(BinaryOperatorKind kind
)
1229 return pet_op_add_assign
;
1231 return pet_op_sub_assign
;
1233 return pet_op_mul_assign
;
1235 return pet_op_div_assign
;
1237 return pet_op_assign
;
1259 /* Construct a pet_expr representing a unary operator expression.
1261 struct pet_expr
*PetScan::extract_expr(UnaryOperator
*expr
)
1263 struct pet_expr
*arg
;
1264 enum pet_op_type op
;
1266 op
= UnaryOperatorKind2pet_op_type(expr
->getOpcode());
1267 if (op
== pet_op_last
) {
1272 arg
= extract_expr(expr
->getSubExpr());
1274 return pet_expr_new_unary(ctx
, op
, arg
);
1277 /* Mark the given access pet_expr as a write.
1278 * If a scalar is being accessed, then mark its value
1279 * as unknown in assigned_value.
1281 void PetScan::mark_write(struct pet_expr
*access
)
1286 access
->acc
.write
= 1;
1287 access
->acc
.read
= 0;
1289 if (isl_map_dim(access
->acc
.access
, isl_dim_out
) != 0)
1292 id
= isl_map_get_tuple_id(access
->acc
.access
, isl_dim_out
);
1293 decl
= (ValueDecl
*) isl_id_get_user(id
);
1294 clear_assignment(assigned_value
, decl
);
1298 /* Construct a pet_expr representing a binary operator expression.
1300 * If the top level operator is an assignment and the LHS is an access,
1301 * then we mark that access as a write. If the operator is a compound
1302 * assignment, the access is marked as both a read and a write.
1304 * If "expr" assigns something to a scalar variable, then we mark
1305 * the variable as having been assigned. If, furthermore, the expression
1306 * is affine, then keep track of this value in assigned_value
1307 * so that we can plug it in when we later come across the same variable.
1309 struct pet_expr
*PetScan::extract_expr(BinaryOperator
*expr
)
1311 struct pet_expr
*lhs
, *rhs
;
1312 enum pet_op_type op
;
1314 op
= BinaryOperatorKind2pet_op_type(expr
->getOpcode());
1315 if (op
== pet_op_last
) {
1320 lhs
= extract_expr(expr
->getLHS());
1321 rhs
= extract_expr(expr
->getRHS());
1323 if (expr
->isAssignmentOp() && lhs
&& lhs
->type
== pet_expr_access
) {
1325 if (expr
->isCompoundAssignmentOp())
1329 if (expr
->getOpcode() == BO_Assign
&&
1330 lhs
&& lhs
->type
== pet_expr_access
&&
1331 isl_map_dim(lhs
->acc
.access
, isl_dim_out
) == 0) {
1332 isl_id
*id
= isl_map_get_tuple_id(lhs
->acc
.access
, isl_dim_out
);
1333 ValueDecl
*decl
= (ValueDecl
*) isl_id_get_user(id
);
1334 Expr
*rhs
= expr
->getRHS();
1335 isl_pw_aff
*pa
= try_extract_affine(rhs
);
1336 clear_assignment(assigned_value
, decl
);
1338 assigned_value
[decl
] = pa
;
1339 insert_expression(pa
);
1344 return pet_expr_new_binary(ctx
, op
, lhs
, rhs
);
1347 /* Construct a pet_expr representing a conditional operation.
1349 * We first try to extract the condition as an affine expression.
1350 * If that fails, we construct a pet_expr tree representing the condition.
1352 struct pet_expr
*PetScan::extract_expr(ConditionalOperator
*expr
)
1354 struct pet_expr
*cond
, *lhs
, *rhs
;
1357 pa
= try_extract_affine(expr
->getCond());
1359 isl_set
*test
= isl_set_from_pw_aff(pa
);
1360 cond
= pet_expr_from_access(isl_map_from_range(test
));
1362 cond
= extract_expr(expr
->getCond());
1363 lhs
= extract_expr(expr
->getTrueExpr());
1364 rhs
= extract_expr(expr
->getFalseExpr());
1366 return pet_expr_new_ternary(ctx
, cond
, lhs
, rhs
);
1369 struct pet_expr
*PetScan::extract_expr(ImplicitCastExpr
*expr
)
1371 return extract_expr(expr
->getSubExpr());
1374 /* Construct a pet_expr representing a floating point value.
1376 struct pet_expr
*PetScan::extract_expr(FloatingLiteral
*expr
)
1378 return pet_expr_new_double(ctx
, expr
->getValueAsApproximateDouble());
1381 /* Extract an access relation from "expr" and then convert it into
1384 struct pet_expr
*PetScan::extract_access_expr(Expr
*expr
)
1387 struct pet_expr
*pe
;
1389 switch (expr
->getStmtClass()) {
1390 case Stmt::ArraySubscriptExprClass
:
1391 access
= extract_access(cast
<ArraySubscriptExpr
>(expr
));
1393 case Stmt::DeclRefExprClass
:
1394 access
= extract_access(cast
<DeclRefExpr
>(expr
));
1396 case Stmt::IntegerLiteralClass
:
1397 access
= extract_access(cast
<IntegerLiteral
>(expr
));
1404 pe
= pet_expr_from_access(access
);
1409 struct pet_expr
*PetScan::extract_expr(ParenExpr
*expr
)
1411 return extract_expr(expr
->getSubExpr());
1414 /* Construct a pet_expr representing a function call.
1416 * If we are passing along a pointer to an array element
1417 * or an entire row or even higher dimensional slice of an array,
1418 * then the function being called may write into the array.
1420 * We assume here that if the function is declared to take a pointer
1421 * to a const type, then the function will perform a read
1422 * and that otherwise, it will perform a write.
1424 struct pet_expr
*PetScan::extract_expr(CallExpr
*expr
)
1426 struct pet_expr
*res
= NULL
;
1430 fd
= expr
->getDirectCallee();
1436 name
= fd
->getDeclName().getAsString();
1437 res
= pet_expr_new_call(ctx
, name
.c_str(), expr
->getNumArgs());
1441 for (int i
= 0; i
< expr
->getNumArgs(); ++i
) {
1442 Expr
*arg
= expr
->getArg(i
);
1446 if (arg
->getStmtClass() == Stmt::ImplicitCastExprClass
) {
1447 ImplicitCastExpr
*ice
= cast
<ImplicitCastExpr
>(arg
);
1448 arg
= ice
->getSubExpr();
1450 if (arg
->getStmtClass() == Stmt::UnaryOperatorClass
) {
1451 UnaryOperator
*op
= cast
<UnaryOperator
>(arg
);
1452 if (op
->getOpcode() == UO_AddrOf
) {
1454 arg
= op
->getSubExpr();
1457 res
->args
[i
] = PetScan::extract_expr(arg
);
1458 main_arg
= res
->args
[i
];
1460 res
->args
[i
] = pet_expr_new_unary(ctx
,
1461 pet_op_address_of
, res
->args
[i
]);
1464 if (arg
->getStmtClass() == Stmt::ArraySubscriptExprClass
&&
1465 array_depth(arg
->getType().getTypePtr()) > 0)
1467 if (is_addr
&& main_arg
->type
== pet_expr_access
) {
1469 if (!fd
->hasPrototype()) {
1470 unsupported(expr
, "prototype required");
1473 parm
= fd
->getParamDecl(i
);
1474 if (!const_base(parm
->getType()))
1475 mark_write(main_arg
);
1485 /* Try and onstruct a pet_expr representing "expr".
1487 struct pet_expr
*PetScan::extract_expr(Expr
*expr
)
1489 switch (expr
->getStmtClass()) {
1490 case Stmt::UnaryOperatorClass
:
1491 return extract_expr(cast
<UnaryOperator
>(expr
));
1492 case Stmt::CompoundAssignOperatorClass
:
1493 case Stmt::BinaryOperatorClass
:
1494 return extract_expr(cast
<BinaryOperator
>(expr
));
1495 case Stmt::ImplicitCastExprClass
:
1496 return extract_expr(cast
<ImplicitCastExpr
>(expr
));
1497 case Stmt::ArraySubscriptExprClass
:
1498 case Stmt::DeclRefExprClass
:
1499 case Stmt::IntegerLiteralClass
:
1500 return extract_access_expr(expr
);
1501 case Stmt::FloatingLiteralClass
:
1502 return extract_expr(cast
<FloatingLiteral
>(expr
));
1503 case Stmt::ParenExprClass
:
1504 return extract_expr(cast
<ParenExpr
>(expr
));
1505 case Stmt::ConditionalOperatorClass
:
1506 return extract_expr(cast
<ConditionalOperator
>(expr
));
1507 case Stmt::CallExprClass
:
1508 return extract_expr(cast
<CallExpr
>(expr
));
1515 /* Check if the given initialization statement is an assignment.
1516 * If so, return that assignment. Otherwise return NULL.
1518 BinaryOperator
*PetScan::initialization_assignment(Stmt
*init
)
1520 BinaryOperator
*ass
;
1522 if (init
->getStmtClass() != Stmt::BinaryOperatorClass
)
1525 ass
= cast
<BinaryOperator
>(init
);
1526 if (ass
->getOpcode() != BO_Assign
)
1532 /* Check if the given initialization statement is a declaration
1533 * of a single variable.
1534 * If so, return that declaration. Otherwise return NULL.
1536 Decl
*PetScan::initialization_declaration(Stmt
*init
)
1540 if (init
->getStmtClass() != Stmt::DeclStmtClass
)
1543 decl
= cast
<DeclStmt
>(init
);
1545 if (!decl
->isSingleDecl())
1548 return decl
->getSingleDecl();
1551 /* Given the assignment operator in the initialization of a for loop,
1552 * extract the induction variable, i.e., the (integer)variable being
1555 ValueDecl
*PetScan::extract_induction_variable(BinaryOperator
*init
)
1562 lhs
= init
->getLHS();
1563 if (lhs
->getStmtClass() != Stmt::DeclRefExprClass
) {
1568 ref
= cast
<DeclRefExpr
>(lhs
);
1569 decl
= ref
->getDecl();
1570 type
= decl
->getType().getTypePtr();
1572 if (!type
->isIntegerType()) {
1580 /* Given the initialization statement of a for loop and the single
1581 * declaration in this initialization statement,
1582 * extract the induction variable, i.e., the (integer) variable being
1585 VarDecl
*PetScan::extract_induction_variable(Stmt
*init
, Decl
*decl
)
1589 vd
= cast
<VarDecl
>(decl
);
1591 const QualType type
= vd
->getType();
1592 if (!type
->isIntegerType()) {
1597 if (!vd
->getInit()) {
1605 /* Check that op is of the form iv++ or iv--.
1606 * Return an affine expression "1" or "-1" accordingly.
1608 __isl_give isl_pw_aff
*PetScan::extract_unary_increment(
1609 clang::UnaryOperator
*op
, clang::ValueDecl
*iv
)
1616 if (!op
->isIncrementDecrementOp()) {
1621 sub
= op
->getSubExpr();
1622 if (sub
->getStmtClass() != Stmt::DeclRefExprClass
) {
1627 ref
= cast
<DeclRefExpr
>(sub
);
1628 if (ref
->getDecl() != iv
) {
1633 space
= isl_space_params_alloc(ctx
, 0);
1634 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(space
));
1636 if (op
->isIncrementOp())
1637 aff
= isl_aff_add_constant_si(aff
, 1);
1639 aff
= isl_aff_add_constant_si(aff
, -1);
1641 return isl_pw_aff_from_aff(aff
);
1644 /* If the isl_pw_aff on which isl_pw_aff_foreach_piece is called
1645 * has a single constant expression on a universe domain, then
1646 * put this constant in *user.
1648 static int extract_cst(__isl_take isl_set
*set
, __isl_take isl_aff
*aff
,
1651 isl_int
*inc
= (isl_int
*)user
;
1654 if (!isl_set_plain_is_universe(set
) || !isl_aff_is_cst(aff
))
1657 isl_aff_get_constant(aff
, inc
);
1665 /* Check if op is of the form
1669 * and return inc as an affine expression.
1671 * We extract an affine expression from the RHS, subtract iv and return
1674 __isl_give isl_pw_aff
*PetScan::extract_binary_increment(BinaryOperator
*op
,
1675 clang::ValueDecl
*iv
)
1684 if (op
->getOpcode() != BO_Assign
) {
1690 if (lhs
->getStmtClass() != Stmt::DeclRefExprClass
) {
1695 ref
= cast
<DeclRefExpr
>(lhs
);
1696 if (ref
->getDecl() != iv
) {
1701 val
= extract_affine(op
->getRHS());
1703 id
= isl_id_alloc(ctx
, iv
->getName().str().c_str(), iv
);
1705 dim
= isl_space_params_alloc(ctx
, 1);
1706 dim
= isl_space_set_dim_id(dim
, isl_dim_param
, 0, id
);
1707 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
1708 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_param
, 0, 1);
1710 val
= isl_pw_aff_sub(val
, isl_pw_aff_from_aff(aff
));
1715 /* Check that op is of the form iv += cst or iv -= cst
1716 * and return an affine expression corresponding oto cst or -cst accordingly.
1718 __isl_give isl_pw_aff
*PetScan::extract_compound_increment(
1719 CompoundAssignOperator
*op
, clang::ValueDecl
*iv
)
1725 BinaryOperatorKind opcode
;
1727 opcode
= op
->getOpcode();
1728 if (opcode
!= BO_AddAssign
&& opcode
!= BO_SubAssign
) {
1732 if (opcode
== BO_SubAssign
)
1736 if (lhs
->getStmtClass() != Stmt::DeclRefExprClass
) {
1741 ref
= cast
<DeclRefExpr
>(lhs
);
1742 if (ref
->getDecl() != iv
) {
1747 val
= extract_affine(op
->getRHS());
1749 val
= isl_pw_aff_neg(val
);
1754 /* Check that the increment of the given for loop increments
1755 * (or decrements) the induction variable "iv" and return
1756 * the increment as an affine expression if successful.
1758 __isl_give isl_pw_aff
*PetScan::extract_increment(clang::ForStmt
*stmt
,
1761 Stmt
*inc
= stmt
->getInc();
1768 if (inc
->getStmtClass() == Stmt::UnaryOperatorClass
)
1769 return extract_unary_increment(cast
<UnaryOperator
>(inc
), iv
);
1770 if (inc
->getStmtClass() == Stmt::CompoundAssignOperatorClass
)
1771 return extract_compound_increment(
1772 cast
<CompoundAssignOperator
>(inc
), iv
);
1773 if (inc
->getStmtClass() == Stmt::BinaryOperatorClass
)
1774 return extract_binary_increment(cast
<BinaryOperator
>(inc
), iv
);
1780 /* Embed the given iteration domain in an extra outer loop
1781 * with induction variable "var".
1782 * If this variable appeared as a parameter in the constraints,
1783 * it is replaced by the new outermost dimension.
1785 static __isl_give isl_set
*embed(__isl_take isl_set
*set
,
1786 __isl_take isl_id
*var
)
1790 set
= isl_set_insert_dims(set
, isl_dim_set
, 0, 1);
1791 pos
= isl_set_find_dim_by_id(set
, isl_dim_param
, var
);
1793 set
= isl_set_equate(set
, isl_dim_param
, pos
, isl_dim_set
, 0);
1794 set
= isl_set_project_out(set
, isl_dim_param
, pos
, 1);
1801 /* Construct a pet_scop for an infinite loop around the given body.
1803 * We extract a pet_scop for the body and then embed it in a loop with
1812 struct pet_scop
*PetScan::extract_infinite_loop(Stmt
*body
)
1818 struct pet_scop
*scop
;
1820 scop
= extract(body
);
1824 id
= isl_id_alloc(ctx
, "t", NULL
);
1825 domain
= isl_set_nat_universe(isl_space_set_alloc(ctx
, 0, 1));
1826 domain
= isl_set_set_dim_id(domain
, isl_dim_set
, 0, isl_id_copy(id
));
1827 dim
= isl_space_from_domain(isl_set_get_space(domain
));
1828 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
1829 sched
= isl_map_universe(dim
);
1830 sched
= isl_map_equate(sched
, isl_dim_in
, 0, isl_dim_out
, 0);
1831 scop
= pet_scop_embed(scop
, domain
, sched
, id
);
1836 /* Construct a pet_scop for an infinite loop, i.e., a loop of the form
1842 struct pet_scop
*PetScan::extract_infinite_for(ForStmt
*stmt
)
1844 return extract_infinite_loop(stmt
->getBody());
1847 /* Check if the while loop is of the form
1852 * If so, construct a scop for an infinite loop around body.
1855 struct pet_scop
*PetScan::extract(WhileStmt
*stmt
)
1861 cond
= stmt
->getCond();
1867 set
= isl_pw_aff_non_zero_set(extract_condition(cond
));
1868 is_universe
= isl_set_plain_is_universe(set
);
1876 return extract_infinite_loop(stmt
->getBody());
1879 /* Check whether "cond" expresses a simple loop bound
1880 * on the only set dimension.
1881 * In particular, if "up" is set then "cond" should contain only
1882 * upper bounds on the set dimension.
1883 * Otherwise, it should contain only lower bounds.
1885 static bool is_simple_bound(__isl_keep isl_set
*cond
, isl_int inc
)
1887 if (isl_int_is_pos(inc
))
1888 return !isl_set_dim_has_lower_bound(cond
, isl_dim_set
, 0);
1890 return !isl_set_dim_has_upper_bound(cond
, isl_dim_set
, 0);
1893 /* Extend a condition on a given iteration of a loop to one that
1894 * imposes the same condition on all previous iterations.
1895 * "domain" expresses the lower [upper] bound on the iterations
1896 * when inc is positive [negative].
1898 * In particular, we construct the condition (when inc is positive)
1900 * forall i' : (domain(i') and i' <= i) => cond(i')
1902 * which is equivalent to
1904 * not exists i' : domain(i') and i' <= i and not cond(i')
1906 * We construct this set by negating cond, applying a map
1908 * { [i'] -> [i] : domain(i') and i' <= i }
1910 * and then negating the result again.
1912 static __isl_give isl_set
*valid_for_each_iteration(__isl_take isl_set
*cond
,
1913 __isl_take isl_set
*domain
, isl_int inc
)
1915 isl_map
*previous_to_this
;
1917 if (isl_int_is_pos(inc
))
1918 previous_to_this
= isl_map_lex_le(isl_set_get_space(domain
));
1920 previous_to_this
= isl_map_lex_ge(isl_set_get_space(domain
));
1922 previous_to_this
= isl_map_intersect_domain(previous_to_this
, domain
);
1924 cond
= isl_set_complement(cond
);
1925 cond
= isl_set_apply(cond
, previous_to_this
);
1926 cond
= isl_set_complement(cond
);
1931 /* Construct a domain of the form
1933 * [id] -> { : exists a: id = init + a * inc and a >= 0 }
1935 static __isl_give isl_set
*strided_domain(__isl_take isl_id
*id
,
1936 __isl_take isl_pw_aff
*init
, isl_int inc
)
1942 init
= isl_pw_aff_insert_dims(init
, isl_dim_in
, 0, 1);
1943 dim
= isl_pw_aff_get_domain_space(init
);
1944 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
1945 aff
= isl_aff_add_coefficient(aff
, isl_dim_in
, 0, inc
);
1946 init
= isl_pw_aff_add(init
, isl_pw_aff_from_aff(aff
));
1948 dim
= isl_space_set_alloc(isl_pw_aff_get_ctx(init
), 1, 1);
1949 dim
= isl_space_set_dim_id(dim
, isl_dim_param
, 0, id
);
1950 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
1951 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_param
, 0, 1);
1953 set
= isl_pw_aff_eq_set(isl_pw_aff_from_aff(aff
), init
);
1955 set
= isl_set_lower_bound_si(set
, isl_dim_set
, 0, 0);
1957 return isl_set_params(set
);
1960 /* Assuming "cond" represents a bound on a loop where the loop
1961 * iterator "iv" is incremented (or decremented) by one, check if wrapping
1964 * Under the given assumptions, wrapping is only possible if "cond" allows
1965 * for the last value before wrapping, i.e., 2^width - 1 in case of an
1966 * increasing iterator and 0 in case of a decreasing iterator.
1968 static bool can_wrap(__isl_keep isl_set
*cond
, ValueDecl
*iv
, isl_int inc
)
1974 test
= isl_set_copy(cond
);
1976 isl_int_init(limit
);
1977 if (isl_int_is_neg(inc
))
1978 isl_int_set_si(limit
, 0);
1980 isl_int_set_si(limit
, 1);
1981 isl_int_mul_2exp(limit
, limit
, get_type_size(iv
));
1982 isl_int_sub_ui(limit
, limit
, 1);
1985 test
= isl_set_fix(cond
, isl_dim_set
, 0, limit
);
1986 cw
= !isl_set_is_empty(test
);
1989 isl_int_clear(limit
);
1994 /* Given a one-dimensional space, construct the following mapping on this
1997 * { [v] -> [v mod 2^width] }
1999 * where width is the number of bits used to represent the values
2000 * of the unsigned variable "iv".
2002 static __isl_give isl_map
*compute_wrapping(__isl_take isl_space
*dim
,
2010 isl_int_set_si(mod
, 1);
2011 isl_int_mul_2exp(mod
, mod
, get_type_size(iv
));
2013 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
2014 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, 0, 1);
2015 aff
= isl_aff_mod(aff
, mod
);
2019 return isl_map_from_basic_map(isl_basic_map_from_aff(aff
));
2020 map
= isl_map_reverse(map
);
2023 /* Project out the parameter "id" from "set".
2025 static __isl_give isl_set
*set_project_out_by_id(__isl_take isl_set
*set
,
2026 __isl_keep isl_id
*id
)
2030 pos
= isl_set_find_dim_by_id(set
, isl_dim_param
, id
);
2032 set
= isl_set_project_out(set
, isl_dim_param
, pos
, 1);
2037 /* Compute the set of parameters for which "set1" is a subset of "set2".
2039 * set1 is a subset of set2 if
2041 * forall i in set1 : i in set2
2045 * not exists i in set1 and i not in set2
2049 * not exists i in set1 \ set2
2051 static __isl_give isl_set
*enforce_subset(__isl_take isl_set
*set1
,
2052 __isl_take isl_set
*set2
)
2054 return isl_set_complement(isl_set_params(isl_set_subtract(set1
, set2
)));
2057 /* Compute the set of parameter values for which "cond" holds
2058 * on the next iteration for each element of "dom".
2060 * We first construct mapping { [i] -> [i + inc] }, apply that to "dom"
2061 * and then compute the set of parameters for which the result is a subset
2064 static __isl_give isl_set
*valid_on_next(__isl_take isl_set
*cond
,
2065 __isl_take isl_set
*dom
, isl_int inc
)
2071 space
= isl_set_get_space(dom
);
2072 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(space
));
2073 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, 0, 1);
2074 aff
= isl_aff_add_constant(aff
, inc
);
2075 next
= isl_map_from_basic_map(isl_basic_map_from_aff(aff
));
2077 dom
= isl_set_apply(dom
, next
);
2079 return enforce_subset(dom
, cond
);
2082 /* Construct a pet_scop for a for statement.
2083 * The for loop is required to be of the form
2085 * for (i = init; condition; ++i)
2089 * for (i = init; condition; --i)
2091 * The initialization of the for loop should either be an assignment
2092 * to an integer variable, or a declaration of such a variable with
2095 * The condition is allowed to contain nested accesses, provided
2096 * they are not being written to inside the body of the loop.
2098 * We extract a pet_scop for the body and then embed it in a loop with
2099 * iteration domain and schedule
2101 * { [i] : i >= init and condition' }
2106 * { [i] : i <= init and condition' }
2109 * Where condition' is equal to condition if the latter is
2110 * a simple upper [lower] bound and a condition that is extended
2111 * to apply to all previous iterations otherwise.
2113 * If the stride of the loop is not 1, then "i >= init" is replaced by
2115 * (exists a: i = init + stride * a and a >= 0)
2117 * If the loop iterator i is unsigned, then wrapping may occur.
2118 * During the computation, we work with a virtual iterator that
2119 * does not wrap. However, the condition in the code applies
2120 * to the wrapped value, so we need to change condition(i)
2121 * into condition([i % 2^width]).
2122 * After computing the virtual domain and schedule, we apply
2123 * the function { [v] -> [v % 2^width] } to the domain and the domain
2124 * of the schedule. In order not to lose any information, we also
2125 * need to intersect the domain of the schedule with the virtual domain
2126 * first, since some iterations in the wrapped domain may be scheduled
2127 * several times, typically an infinite number of times.
2128 * Note that there is no need to perform this final wrapping
2129 * if the loop condition (after wrapping) is simple.
2131 * Wrapping on unsigned iterators can be avoided entirely if
2132 * loop condition is simple, the loop iterator is incremented
2133 * [decremented] by one and the last value before wrapping cannot
2134 * possibly satisfy the loop condition.
2136 * Before extracting a pet_scop from the body we remove all
2137 * assignments in assigned_value to variables that are assigned
2138 * somewhere in the body of the loop.
2140 * Valid parameters for a for loop are those for which the initial
2141 * value itself, the increment on each domain iteration and
2142 * the condition on both the initial value and
2143 * the result of incrementing the iterator for each iteration of the domain
2146 struct pet_scop
*PetScan::extract_for(ForStmt
*stmt
)
2148 BinaryOperator
*ass
;
2156 isl_set
*cond
= NULL
;
2158 struct pet_scop
*scop
;
2159 assigned_value_cache
cache(assigned_value
);
2165 isl_map
*wrap
= NULL
;
2166 isl_pw_aff
*pa
, *pa_inc
, *init_val
;
2167 isl_set
*valid_init
;
2168 isl_set
*valid_cond
;
2169 isl_set
*valid_cond_init
;
2170 isl_set
*valid_cond_next
;
2173 if (!stmt
->getInit() && !stmt
->getCond() && !stmt
->getInc())
2174 return extract_infinite_for(stmt
);
2176 init
= stmt
->getInit();
2181 if ((ass
= initialization_assignment(init
)) != NULL
) {
2182 iv
= extract_induction_variable(ass
);
2185 lhs
= ass
->getLHS();
2186 rhs
= ass
->getRHS();
2187 } else if ((decl
= initialization_declaration(init
)) != NULL
) {
2188 VarDecl
*var
= extract_induction_variable(init
, decl
);
2192 rhs
= var
->getInit();
2193 lhs
= create_DeclRefExpr(var
);
2195 unsupported(stmt
->getInit());
2199 pa_inc
= extract_increment(stmt
, iv
);
2204 if (isl_pw_aff_foreach_piece(pa_inc
, &extract_cst
, &inc
) < 0) {
2205 isl_pw_aff_free(pa_inc
);
2206 unsupported(stmt
->getInc());
2210 valid_inc
= isl_pw_aff_domain(pa_inc
);
2212 is_unsigned
= iv
->getType()->isUnsignedIntegerType();
2214 assigned_value
.erase(iv
);
2215 clear_assignments
clear(assigned_value
);
2216 clear
.TraverseStmt(stmt
->getBody());
2218 id
= isl_id_alloc(ctx
, iv
->getName().str().c_str(), iv
);
2220 scop
= extract(stmt
->getBody());
2222 pa
= try_extract_nested_condition(stmt
->getCond());
2223 if (pa
&& !is_nested_allowed(pa
, scop
)) {
2224 isl_pw_aff_free(pa
);
2229 pa
= extract_condition(stmt
->getCond());
2230 valid_cond
= isl_pw_aff_domain(isl_pw_aff_copy(pa
));
2231 cond
= isl_pw_aff_non_zero_set(pa
);
2232 cond
= embed(cond
, isl_id_copy(id
));
2233 valid_cond
= isl_set_coalesce(valid_cond
);
2234 valid_cond
= embed(valid_cond
, isl_id_copy(id
));
2235 valid_inc
= embed(valid_inc
, isl_id_copy(id
));
2236 is_one
= isl_int_is_one(inc
) || isl_int_is_negone(inc
);
2237 is_virtual
= is_unsigned
&& (!is_one
|| can_wrap(cond
, iv
, inc
));
2239 init_val
= extract_affine(rhs
);
2240 valid_cond_init
= enforce_subset(
2241 isl_set_from_pw_aff(isl_pw_aff_copy(init_val
)),
2242 isl_set_copy(valid_cond
));
2243 if (is_one
&& !is_virtual
) {
2244 isl_pw_aff_free(init_val
);
2245 pa
= extract_comparison(isl_int_is_pos(inc
) ? BO_GE
: BO_LE
,
2247 valid_init
= isl_pw_aff_domain(isl_pw_aff_copy(pa
));
2248 valid_init
= set_project_out_by_id(valid_init
, id
);
2249 domain
= isl_pw_aff_non_zero_set(pa
);
2251 valid_init
= isl_pw_aff_domain(isl_pw_aff_copy(init_val
));
2252 domain
= strided_domain(isl_id_copy(id
), init_val
, inc
);
2255 domain
= embed(domain
, isl_id_copy(id
));
2258 wrap
= compute_wrapping(isl_set_get_space(cond
), iv
);
2259 rev_wrap
= isl_map_reverse(isl_map_copy(wrap
));
2260 cond
= isl_set_apply(cond
, isl_map_copy(rev_wrap
));
2261 valid_cond
= isl_set_apply(valid_cond
, isl_map_copy(rev_wrap
));
2262 valid_inc
= isl_set_apply(valid_inc
, rev_wrap
);
2264 cond
= isl_set_gist(cond
, isl_set_copy(domain
));
2265 is_simple
= is_simple_bound(cond
, inc
);
2267 cond
= valid_for_each_iteration(cond
,
2268 isl_set_copy(domain
), inc
);
2269 domain
= isl_set_intersect(domain
, cond
);
2270 domain
= isl_set_set_dim_id(domain
, isl_dim_set
, 0, isl_id_copy(id
));
2271 dim
= isl_space_from_domain(isl_set_get_space(domain
));
2272 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
2273 sched
= isl_map_universe(dim
);
2274 if (isl_int_is_pos(inc
))
2275 sched
= isl_map_equate(sched
, isl_dim_in
, 0, isl_dim_out
, 0);
2277 sched
= isl_map_oppose(sched
, isl_dim_in
, 0, isl_dim_out
, 0);
2279 valid_cond_next
= valid_on_next(valid_cond
, isl_set_copy(domain
), inc
);
2280 valid_inc
= enforce_subset(isl_set_copy(domain
), valid_inc
);
2282 if (is_virtual
&& !is_simple
) {
2283 wrap
= isl_map_set_dim_id(wrap
,
2284 isl_dim_out
, 0, isl_id_copy(id
));
2285 sched
= isl_map_intersect_domain(sched
, isl_set_copy(domain
));
2286 domain
= isl_set_apply(domain
, isl_map_copy(wrap
));
2287 sched
= isl_map_apply_domain(sched
, wrap
);
2291 scop
= pet_scop_embed(scop
, domain
, sched
, id
);
2292 scop
= resolve_nested(scop
);
2293 clear_assignment(assigned_value
, iv
);
2297 scop
= pet_scop_restrict_context(scop
, valid_init
);
2298 scop
= pet_scop_restrict_context(scop
, valid_inc
);
2299 scop
= pet_scop_restrict_context(scop
, valid_cond_next
);
2300 scop
= pet_scop_restrict_context(scop
, valid_cond_init
);
2305 struct pet_scop
*PetScan::extract(CompoundStmt
*stmt
)
2307 return extract(stmt
->children());
2310 /* Does "id" refer to a nested access?
2312 static bool is_nested_parameter(__isl_keep isl_id
*id
)
2314 return id
&& isl_id_get_user(id
) && !isl_id_get_name(id
);
2317 /* Does parameter "pos" of "space" refer to a nested access?
2319 static bool is_nested_parameter(__isl_keep isl_space
*space
, int pos
)
2324 id
= isl_space_get_dim_id(space
, isl_dim_param
, pos
);
2325 nested
= is_nested_parameter(id
);
2331 /* Does parameter "pos" of "map" refer to a nested access?
2333 static bool is_nested_parameter(__isl_keep isl_map
*map
, int pos
)
2338 id
= isl_map_get_dim_id(map
, isl_dim_param
, pos
);
2339 nested
= is_nested_parameter(id
);
2345 /* How many parameters of "space" refer to nested accesses, i.e., have no name?
2347 static int n_nested_parameter(__isl_keep isl_space
*space
)
2352 nparam
= isl_space_dim(space
, isl_dim_param
);
2353 for (int i
= 0; i
< nparam
; ++i
)
2354 if (is_nested_parameter(space
, i
))
2360 /* How many parameters of "map" refer to nested accesses, i.e., have no name?
2362 static int n_nested_parameter(__isl_keep isl_map
*map
)
2367 space
= isl_map_get_space(map
);
2368 n
= n_nested_parameter(space
);
2369 isl_space_free(space
);
2374 /* For each nested access parameter in "space",
2375 * construct a corresponding pet_expr, place it in args and
2376 * record its position in "param2pos".
2377 * "n_arg" is the number of elements that are already in args.
2378 * The position recorded in "param2pos" takes this number into account.
2379 * If the pet_expr corresponding to a parameter is identical to
2380 * the pet_expr corresponding to an earlier parameter, then these two
2381 * parameters are made to refer to the same element in args.
2383 * Return the final number of elements in args or -1 if an error has occurred.
2385 int PetScan::extract_nested(__isl_keep isl_space
*space
,
2386 int n_arg
, struct pet_expr
**args
, std::map
<int,int> ¶m2pos
)
2390 nparam
= isl_space_dim(space
, isl_dim_param
);
2391 for (int i
= 0; i
< nparam
; ++i
) {
2393 isl_id
*id
= isl_space_get_dim_id(space
, isl_dim_param
, i
);
2396 if (!is_nested_parameter(id
)) {
2401 nested
= (Expr
*) isl_id_get_user(id
);
2402 args
[n_arg
] = extract_expr(nested
);
2406 for (j
= 0; j
< n_arg
; ++j
)
2407 if (pet_expr_is_equal(args
[j
], args
[n_arg
]))
2411 pet_expr_free(args
[n_arg
]);
2415 param2pos
[i
] = n_arg
++;
2423 /* For each nested access parameter in the access relations in "expr",
2424 * construct a corresponding pet_expr, place it in expr->args and
2425 * record its position in "param2pos".
2426 * n is the number of nested access parameters.
2428 struct pet_expr
*PetScan::extract_nested(struct pet_expr
*expr
, int n
,
2429 std::map
<int,int> ¶m2pos
)
2433 expr
->args
= isl_calloc_array(ctx
, struct pet_expr
*, n
);
2438 space
= isl_map_get_space(expr
->acc
.access
);
2439 n
= extract_nested(space
, 0, expr
->args
, param2pos
);
2440 isl_space_free(space
);
2448 pet_expr_free(expr
);
2452 /* Look for parameters in any access relation in "expr" that
2453 * refer to nested accesses. In particular, these are
2454 * parameters with no name.
2456 * If there are any such parameters, then the domain of the access
2457 * relation, which is still [] at this point, is replaced by
2458 * [[] -> [t_1,...,t_n]], with n the number of these parameters
2459 * (after identifying identical nested accesses).
2460 * The parameters are then equated to the corresponding t dimensions
2461 * and subsequently projected out.
2462 * param2pos maps the position of the parameter to the position
2463 * of the corresponding t dimension.
2465 struct pet_expr
*PetScan::resolve_nested(struct pet_expr
*expr
)
2472 std::map
<int,int> param2pos
;
2477 for (int i
= 0; i
< expr
->n_arg
; ++i
) {
2478 expr
->args
[i
] = resolve_nested(expr
->args
[i
]);
2479 if (!expr
->args
[i
]) {
2480 pet_expr_free(expr
);
2485 if (expr
->type
!= pet_expr_access
)
2488 n
= n_nested_parameter(expr
->acc
.access
);
2492 expr
= extract_nested(expr
, n
, param2pos
);
2497 nparam
= isl_map_dim(expr
->acc
.access
, isl_dim_param
);
2498 n_in
= isl_map_dim(expr
->acc
.access
, isl_dim_in
);
2499 dim
= isl_map_get_space(expr
->acc
.access
);
2500 dim
= isl_space_domain(dim
);
2501 dim
= isl_space_from_domain(dim
);
2502 dim
= isl_space_add_dims(dim
, isl_dim_out
, n
);
2503 map
= isl_map_universe(dim
);
2504 map
= isl_map_domain_map(map
);
2505 map
= isl_map_reverse(map
);
2506 expr
->acc
.access
= isl_map_apply_domain(expr
->acc
.access
, map
);
2508 for (int i
= nparam
- 1; i
>= 0; --i
) {
2509 isl_id
*id
= isl_map_get_dim_id(expr
->acc
.access
,
2511 if (!is_nested_parameter(id
)) {
2516 expr
->acc
.access
= isl_map_equate(expr
->acc
.access
,
2517 isl_dim_param
, i
, isl_dim_in
,
2518 n_in
+ param2pos
[i
]);
2519 expr
->acc
.access
= isl_map_project_out(expr
->acc
.access
,
2520 isl_dim_param
, i
, 1);
2527 pet_expr_free(expr
);
2531 /* Convert a top-level pet_expr to a pet_scop with one statement.
2532 * This mainly involves resolving nested expression parameters
2533 * and setting the name of the iteration space.
2534 * The name is given by "label" if it is non-NULL. Otherwise,
2535 * it is of the form S_<n_stmt>.
2537 struct pet_scop
*PetScan::extract(Stmt
*stmt
, struct pet_expr
*expr
,
2538 __isl_take isl_id
*label
)
2540 struct pet_stmt
*ps
;
2541 SourceLocation loc
= stmt
->getLocStart();
2542 int line
= PP
.getSourceManager().getExpansionLineNumber(loc
);
2544 expr
= resolve_nested(expr
);
2545 ps
= pet_stmt_from_pet_expr(ctx
, line
, label
, n_stmt
++, expr
);
2546 return pet_scop_from_pet_stmt(ctx
, ps
);
2549 /* Check if we can extract an affine expression from "expr".
2550 * Return the expressions as an isl_pw_aff if we can and NULL otherwise.
2551 * We turn on autodetection so that we won't generate any warnings
2552 * and turn off nesting, so that we won't accept any non-affine constructs.
2554 __isl_give isl_pw_aff
*PetScan::try_extract_affine(Expr
*expr
)
2557 int save_autodetect
= autodetect
;
2558 bool save_nesting
= nesting_enabled
;
2561 nesting_enabled
= false;
2563 pwaff
= extract_affine(expr
);
2565 autodetect
= save_autodetect
;
2566 nesting_enabled
= save_nesting
;
2571 /* Check whether "expr" is an affine expression.
2573 bool PetScan::is_affine(Expr
*expr
)
2577 pwaff
= try_extract_affine(expr
);
2578 isl_pw_aff_free(pwaff
);
2580 return pwaff
!= NULL
;
2583 /* Check whether "expr" is an affine constraint.
2584 * We turn on autodetection so that we won't generate any warnings
2585 * and turn off nesting, so that we won't accept any non-affine constructs.
2587 bool PetScan::is_affine_condition(Expr
*expr
)
2590 int save_autodetect
= autodetect
;
2591 bool save_nesting
= nesting_enabled
;
2594 nesting_enabled
= false;
2596 cond
= extract_condition(expr
);
2597 isl_pw_aff_free(cond
);
2599 autodetect
= save_autodetect
;
2600 nesting_enabled
= save_nesting
;
2602 return cond
!= NULL
;
2605 /* Check if we can extract a condition from "expr".
2606 * Return the condition as an isl_pw_aff if we can and NULL otherwise.
2607 * If allow_nested is set, then the condition may involve parameters
2608 * corresponding to nested accesses.
2609 * We turn on autodetection so that we won't generate any warnings.
2611 __isl_give isl_pw_aff
*PetScan::try_extract_nested_condition(Expr
*expr
)
2614 int save_autodetect
= autodetect
;
2615 bool save_nesting
= nesting_enabled
;
2618 nesting_enabled
= allow_nested
;
2619 cond
= extract_condition(expr
);
2621 autodetect
= save_autodetect
;
2622 nesting_enabled
= save_nesting
;
2627 /* If the top-level expression of "stmt" is an assignment, then
2628 * return that assignment as a BinaryOperator.
2629 * Otherwise return NULL.
2631 static BinaryOperator
*top_assignment_or_null(Stmt
*stmt
)
2633 BinaryOperator
*ass
;
2637 if (stmt
->getStmtClass() != Stmt::BinaryOperatorClass
)
2640 ass
= cast
<BinaryOperator
>(stmt
);
2641 if(ass
->getOpcode() != BO_Assign
)
2647 /* Check if the given if statement is a conditional assignement
2648 * with a non-affine condition. If so, construct a pet_scop
2649 * corresponding to this conditional assignment. Otherwise return NULL.
2651 * In particular we check if "stmt" is of the form
2658 * where a is some array or scalar access.
2659 * The constructed pet_scop then corresponds to the expression
2661 * a = condition ? f(...) : g(...)
2663 * All access relations in f(...) are intersected with condition
2664 * while all access relation in g(...) are intersected with the complement.
2666 struct pet_scop
*PetScan::extract_conditional_assignment(IfStmt
*stmt
)
2668 BinaryOperator
*ass_then
, *ass_else
;
2669 isl_map
*write_then
, *write_else
;
2670 isl_set
*cond
, *comp
;
2674 struct pet_expr
*pe_cond
, *pe_then
, *pe_else
, *pe
, *pe_write
;
2675 bool save_nesting
= nesting_enabled
;
2677 ass_then
= top_assignment_or_null(stmt
->getThen());
2678 ass_else
= top_assignment_or_null(stmt
->getElse());
2680 if (!ass_then
|| !ass_else
)
2683 if (is_affine_condition(stmt
->getCond()))
2686 write_then
= extract_access(ass_then
->getLHS());
2687 write_else
= extract_access(ass_else
->getLHS());
2689 equal
= isl_map_is_equal(write_then
, write_else
);
2690 isl_map_free(write_else
);
2691 if (equal
< 0 || !equal
) {
2692 isl_map_free(write_then
);
2696 nesting_enabled
= allow_nested
;
2697 pa
= extract_condition(stmt
->getCond());
2698 nesting_enabled
= save_nesting
;
2699 cond
= isl_pw_aff_non_zero_set(isl_pw_aff_copy(pa
));
2700 comp
= isl_pw_aff_zero_set(isl_pw_aff_copy(pa
));
2701 map
= isl_map_from_range(isl_set_from_pw_aff(pa
));
2703 pe_cond
= pet_expr_from_access(map
);
2705 pe_then
= extract_expr(ass_then
->getRHS());
2706 pe_then
= pet_expr_restrict(pe_then
, cond
);
2707 pe_else
= extract_expr(ass_else
->getRHS());
2708 pe_else
= pet_expr_restrict(pe_else
, comp
);
2710 pe
= pet_expr_new_ternary(ctx
, pe_cond
, pe_then
, pe_else
);
2711 pe_write
= pet_expr_from_access(write_then
);
2713 pe_write
->acc
.write
= 1;
2714 pe_write
->acc
.read
= 0;
2716 pe
= pet_expr_new_binary(ctx
, pet_op_assign
, pe_write
, pe
);
2717 return extract(stmt
, pe
);
2720 /* Create an access to a virtual array representing the result
2722 * Unlike other accessed data, the id of the array is NULL as
2723 * there is no ValueDecl in the program corresponding to the virtual
2725 * The array starts out as a scalar, but grows along with the
2726 * statement writing to the array in pet_scop_embed.
2728 static __isl_give isl_map
*create_test_access(isl_ctx
*ctx
, int test_nr
)
2730 isl_space
*dim
= isl_space_alloc(ctx
, 0, 0, 0);
2734 snprintf(name
, sizeof(name
), "__pet_test_%d", test_nr
);
2735 id
= isl_id_alloc(ctx
, name
, NULL
);
2736 dim
= isl_space_set_tuple_id(dim
, isl_dim_out
, id
);
2737 return isl_map_universe(dim
);
2740 /* Create a pet_scop with a single statement evaluating "cond"
2741 * and writing the result to a virtual scalar, as expressed by
2744 struct pet_scop
*PetScan::extract_non_affine_condition(Expr
*cond
,
2745 __isl_take isl_map
*access
)
2747 struct pet_expr
*expr
, *write
;
2748 struct pet_stmt
*ps
;
2749 SourceLocation loc
= cond
->getLocStart();
2750 int line
= PP
.getSourceManager().getExpansionLineNumber(loc
);
2752 write
= pet_expr_from_access(access
);
2754 write
->acc
.write
= 1;
2755 write
->acc
.read
= 0;
2757 expr
= extract_expr(cond
);
2758 expr
= pet_expr_new_binary(ctx
, pet_op_assign
, write
, expr
);
2759 ps
= pet_stmt_from_pet_expr(ctx
, line
, NULL
, n_stmt
++, expr
);
2760 return pet_scop_from_pet_stmt(ctx
, ps
);
2763 /* Add an array with the given extent ("access") to the list
2764 * of arrays in "scop" and return the extended pet_scop.
2765 * The array is marked as attaining values 0 and 1 only.
2767 static struct pet_scop
*scop_add_array(struct pet_scop
*scop
,
2768 __isl_keep isl_map
*access
, clang::ASTContext
&ast_ctx
)
2770 isl_ctx
*ctx
= isl_map_get_ctx(access
);
2772 struct pet_array
**arrays
;
2773 struct pet_array
*array
;
2780 arrays
= isl_realloc_array(ctx
, scop
->arrays
, struct pet_array
*,
2784 scop
->arrays
= arrays
;
2786 array
= isl_calloc_type(ctx
, struct pet_array
);
2790 array
->extent
= isl_map_range(isl_map_copy(access
));
2791 dim
= isl_space_params_alloc(ctx
, 0);
2792 array
->context
= isl_set_universe(dim
);
2793 dim
= isl_space_set_alloc(ctx
, 0, 1);
2794 array
->value_bounds
= isl_set_universe(dim
);
2795 array
->value_bounds
= isl_set_lower_bound_si(array
->value_bounds
,
2797 array
->value_bounds
= isl_set_upper_bound_si(array
->value_bounds
,
2799 array
->element_type
= strdup("int");
2800 array
->element_size
= ast_ctx
.getTypeInfo(ast_ctx
.IntTy
).first
/ 8;
2802 scop
->arrays
[scop
->n_array
] = array
;
2805 if (!array
->extent
|| !array
->context
)
2810 pet_scop_free(scop
);
2815 static __isl_give isl_map
*embed_access(__isl_take isl_map
*access
,
2819 /* Apply the map pointed to by "user" to the domain of the access
2820 * relation, thereby embedding it in the range of the map.
2821 * The domain of both relations is the zero-dimensional domain.
2823 static __isl_give isl_map
*embed_access(__isl_take isl_map
*access
, void *user
)
2825 isl_map
*map
= (isl_map
*) user
;
2827 return isl_map_apply_domain(access
, isl_map_copy(map
));
2830 /* Apply "map" to all access relations in "expr".
2832 static struct pet_expr
*embed(struct pet_expr
*expr
, __isl_keep isl_map
*map
)
2834 return pet_expr_foreach_access(expr
, &embed_access
, map
);
2837 /* How many parameters of "set" refer to nested accesses, i.e., have no name?
2839 static int n_nested_parameter(__isl_keep isl_set
*set
)
2844 space
= isl_set_get_space(set
);
2845 n
= n_nested_parameter(space
);
2846 isl_space_free(space
);
2851 /* Remove all parameters from "map" that refer to nested accesses.
2853 static __isl_give isl_map
*remove_nested_parameters(__isl_take isl_map
*map
)
2858 space
= isl_map_get_space(map
);
2859 nparam
= isl_space_dim(space
, isl_dim_param
);
2860 for (int i
= nparam
- 1; i
>= 0; --i
)
2861 if (is_nested_parameter(space
, i
))
2862 map
= isl_map_project_out(map
, isl_dim_param
, i
, 1);
2863 isl_space_free(space
);
2869 static __isl_give isl_map
*access_remove_nested_parameters(
2870 __isl_take isl_map
*access
, void *user
);
2873 static __isl_give isl_map
*access_remove_nested_parameters(
2874 __isl_take isl_map
*access
, void *user
)
2876 return remove_nested_parameters(access
);
2879 /* Remove all nested access parameters from the schedule and all
2880 * accesses of "stmt".
2881 * There is no need to remove them from the domain as these parameters
2882 * have already been removed from the domain when this function is called.
2884 static struct pet_stmt
*remove_nested_parameters(struct pet_stmt
*stmt
)
2888 stmt
->schedule
= remove_nested_parameters(stmt
->schedule
);
2889 stmt
->body
= pet_expr_foreach_access(stmt
->body
,
2890 &access_remove_nested_parameters
, NULL
);
2891 if (!stmt
->schedule
|| !stmt
->body
)
2893 for (int i
= 0; i
< stmt
->n_arg
; ++i
) {
2894 stmt
->args
[i
] = pet_expr_foreach_access(stmt
->args
[i
],
2895 &access_remove_nested_parameters
, NULL
);
2902 pet_stmt_free(stmt
);
2906 /* For each nested access parameter in the domain of "stmt",
2907 * construct a corresponding pet_expr, place it in stmt->args and
2908 * record its position in "param2pos".
2909 * n is the number of nested access parameters.
2911 struct pet_stmt
*PetScan::extract_nested(struct pet_stmt
*stmt
, int n
,
2912 std::map
<int,int> ¶m2pos
)
2916 struct pet_expr
**args
;
2918 n_arg
= stmt
->n_arg
;
2919 args
= isl_realloc_array(ctx
, stmt
->args
, struct pet_expr
*, n_arg
+ n
);
2925 space
= isl_set_get_space(stmt
->domain
);
2926 n
= extract_nested(space
, n_arg
, stmt
->args
, param2pos
);
2927 isl_space_free(space
);
2935 pet_stmt_free(stmt
);
2939 /* Look for parameters in the iteration domain of "stmt" that
2940 * refer to nested accesses. In particular, these are
2941 * parameters with no name.
2943 * If there are any such parameters, then as many extra variables
2944 * (after identifying identical nested accesses) are added to the
2945 * range of the map wrapped inside the domain.
2946 * If the original domain is not a wrapped map, then a new wrapped
2947 * map is created with zero output dimensions.
2948 * The parameters are then equated to the corresponding output dimensions
2949 * and subsequently projected out, from the iteration domain,
2950 * the schedule and the access relations.
2951 * For each of the output dimensions, a corresponding argument
2952 * expression is added. Initially they are created with
2953 * a zero-dimensional domain, so they have to be embedded
2954 * in the current iteration domain.
2955 * param2pos maps the position of the parameter to the position
2956 * of the corresponding output dimension in the wrapped map.
2958 struct pet_stmt
*PetScan::resolve_nested(struct pet_stmt
*stmt
)
2964 std::map
<int,int> param2pos
;
2969 n
= n_nested_parameter(stmt
->domain
);
2973 n_arg
= stmt
->n_arg
;
2974 stmt
= extract_nested(stmt
, n
, param2pos
);
2978 n
= stmt
->n_arg
- n_arg
;
2979 nparam
= isl_set_dim(stmt
->domain
, isl_dim_param
);
2980 if (isl_set_is_wrapping(stmt
->domain
))
2981 map
= isl_set_unwrap(stmt
->domain
);
2983 map
= isl_map_from_domain(stmt
->domain
);
2984 map
= isl_map_add_dims(map
, isl_dim_out
, n
);
2986 for (int i
= nparam
- 1; i
>= 0; --i
) {
2989 if (!is_nested_parameter(map
, i
))
2992 id
= isl_map_get_tuple_id(stmt
->args
[param2pos
[i
]]->acc
.access
,
2994 map
= isl_map_set_dim_id(map
, isl_dim_out
, param2pos
[i
], id
);
2995 map
= isl_map_equate(map
, isl_dim_param
, i
, isl_dim_out
,
2997 map
= isl_map_project_out(map
, isl_dim_param
, i
, 1);
3000 stmt
->domain
= isl_map_wrap(map
);
3002 map
= isl_set_unwrap(isl_set_copy(stmt
->domain
));
3003 map
= isl_map_from_range(isl_map_domain(map
));
3004 for (int pos
= n_arg
; pos
< stmt
->n_arg
; ++pos
)
3005 stmt
->args
[pos
] = embed(stmt
->args
[pos
], map
);
3008 stmt
= remove_nested_parameters(stmt
);
3012 pet_stmt_free(stmt
);
3016 /* For each statement in "scop", move the parameters that correspond
3017 * to nested access into the ranges of the domains and create
3018 * corresponding argument expressions.
3020 struct pet_scop
*PetScan::resolve_nested(struct pet_scop
*scop
)
3025 for (int i
= 0; i
< scop
->n_stmt
; ++i
) {
3026 scop
->stmts
[i
] = resolve_nested(scop
->stmts
[i
]);
3027 if (!scop
->stmts
[i
])
3033 pet_scop_free(scop
);
3037 /* Does "space" involve any parameters that refer to nested
3038 * accesses, i.e., parameters with no name?
3040 static bool has_nested(__isl_keep isl_space
*space
)
3044 nparam
= isl_space_dim(space
, isl_dim_param
);
3045 for (int i
= 0; i
< nparam
; ++i
)
3046 if (is_nested_parameter(space
, i
))
3052 /* Does "pa" involve any parameters that refer to nested
3053 * accesses, i.e., parameters with no name?
3055 static bool has_nested(__isl_keep isl_pw_aff
*pa
)
3060 space
= isl_pw_aff_get_space(pa
);
3061 nested
= has_nested(space
);
3062 isl_space_free(space
);
3067 /* Given an access expression "expr", is the variable accessed by
3068 * "expr" assigned anywhere inside "scop"?
3070 static bool is_assigned(pet_expr
*expr
, pet_scop
*scop
)
3072 bool assigned
= false;
3075 id
= isl_map_get_tuple_id(expr
->acc
.access
, isl_dim_out
);
3076 assigned
= pet_scop_writes(scop
, id
);
3082 /* Are all nested access parameters in "pa" allowed given "scop".
3083 * In particular, is none of them written by anywhere inside "scop".
3085 bool PetScan::is_nested_allowed(__isl_keep isl_pw_aff
*pa
, pet_scop
*scop
)
3089 nparam
= isl_pw_aff_dim(pa
, isl_dim_param
);
3090 for (int i
= 0; i
< nparam
; ++i
) {
3092 isl_id
*id
= isl_pw_aff_get_dim_id(pa
, isl_dim_param
, i
);
3096 if (!is_nested_parameter(id
)) {
3101 nested
= (Expr
*) isl_id_get_user(id
);
3102 expr
= extract_expr(nested
);
3103 allowed
= expr
&& expr
->type
== pet_expr_access
&&
3104 !is_assigned(expr
, scop
);
3106 pet_expr_free(expr
);
3116 /* Construct a pet_scop for an if statement.
3118 * If the condition fits the pattern of a conditional assignment,
3119 * then it is handled by extract_conditional_assignment.
3120 * Otherwise, we do the following.
3122 * If the condition is affine, then the condition is added
3123 * to the iteration domains of the then branch, while the
3124 * opposite of the condition in added to the iteration domains
3125 * of the else branch, if any.
3126 * We allow the condition to be dynamic, i.e., to refer to
3127 * scalars or array elements that may be written to outside
3128 * of the given if statement. These nested accesses are then represented
3129 * as output dimensions in the wrapping iteration domain.
3130 * If it also written _inside_ the then or else branch, then
3131 * we treat the condition as non-affine.
3132 * As explained below, this will introduce an extra statement.
3133 * For aesthetic reasons, we want this statement to have a statement
3134 * number that is lower than those of the then and else branches.
3135 * In order to evaluate if will need such a statement, however, we
3136 * first construct scops for the then and else branches.
3137 * We therefore reserve a statement number if we might have to
3138 * introduce such an extra statement.
3140 * If the condition is not affine, then we create a separate
3141 * statement that writes the result of the condition to a virtual scalar.
3142 * A constraint requiring the value of this virtual scalar to be one
3143 * is added to the iteration domains of the then branch.
3144 * Similarly, a constraint requiring the value of this virtual scalar
3145 * to be zero is added to the iteration domains of the else branch, if any.
3146 * We adjust the schedules to ensure that the virtual scalar is written
3147 * before it is read.
3149 struct pet_scop
*PetScan::extract(IfStmt
*stmt
)
3151 struct pet_scop
*scop_then
, *scop_else
, *scop
;
3152 assigned_value_cache
cache(assigned_value
);
3153 isl_map
*test_access
= NULL
;
3157 scop
= extract_conditional_assignment(stmt
);
3161 cond
= try_extract_nested_condition(stmt
->getCond());
3162 if (allow_nested
&& (!cond
|| has_nested(cond
)))
3165 scop_then
= extract(stmt
->getThen());
3167 if (stmt
->getElse()) {
3168 scop_else
= extract(stmt
->getElse());
3170 if (scop_then
&& !scop_else
) {
3172 isl_pw_aff_free(cond
);
3175 if (!scop_then
&& scop_else
) {
3177 isl_pw_aff_free(cond
);
3184 (!is_nested_allowed(cond
, scop_then
) ||
3185 (stmt
->getElse() && !is_nested_allowed(cond
, scop_else
)))) {
3186 isl_pw_aff_free(cond
);
3189 if (allow_nested
&& !cond
) {
3190 int save_n_stmt
= n_stmt
;
3191 test_access
= create_test_access(ctx
, n_test
++);
3193 scop
= extract_non_affine_condition(stmt
->getCond(),
3194 isl_map_copy(test_access
));
3195 n_stmt
= save_n_stmt
;
3196 scop
= scop_add_array(scop
, test_access
, ast_context
);
3198 pet_scop_free(scop_then
);
3199 pet_scop_free(scop_else
);
3200 isl_map_free(test_access
);
3210 cond
= extract_condition(stmt
->getCond());
3211 valid
= isl_pw_aff_domain(isl_pw_aff_copy(cond
));
3212 set
= isl_pw_aff_non_zero_set(cond
);
3213 scop
= pet_scop_restrict(scop_then
, isl_set_copy(set
));
3215 if (stmt
->getElse()) {
3216 set
= isl_set_subtract(isl_set_copy(valid
), set
);
3217 scop_else
= pet_scop_restrict(scop_else
, set
);
3218 scop
= pet_scop_add(ctx
, scop
, scop_else
);
3221 scop
= resolve_nested(scop
);
3222 scop
= pet_scop_restrict_context(scop
, valid
);
3224 scop
= pet_scop_prefix(scop
, 0);
3225 scop_then
= pet_scop_prefix(scop_then
, 1);
3226 scop_then
= pet_scop_filter(scop_then
,
3227 isl_map_copy(test_access
), 1);
3228 scop
= pet_scop_add(ctx
, scop
, scop_then
);
3229 if (stmt
->getElse()) {
3230 scop_else
= pet_scop_prefix(scop_else
, 1);
3231 scop_else
= pet_scop_filter(scop_else
, test_access
, 0);
3232 scop
= pet_scop_add(ctx
, scop
, scop_else
);
3234 isl_map_free(test_access
);
3240 /* Try and construct a pet_scop for a label statement.
3241 * We currently only allow labels on expression statements.
3243 struct pet_scop
*PetScan::extract(LabelStmt
*stmt
)
3248 sub
= stmt
->getSubStmt();
3249 if (!isa
<Expr
>(sub
)) {
3254 label
= isl_id_alloc(ctx
, stmt
->getName(), NULL
);
3256 return extract(sub
, extract_expr(cast
<Expr
>(sub
)), label
);
3259 /* Try and construct a pet_scop corresponding to "stmt".
3261 struct pet_scop
*PetScan::extract(Stmt
*stmt
)
3263 if (isa
<Expr
>(stmt
))
3264 return extract(stmt
, extract_expr(cast
<Expr
>(stmt
)));
3266 switch (stmt
->getStmtClass()) {
3267 case Stmt::WhileStmtClass
:
3268 return extract(cast
<WhileStmt
>(stmt
));
3269 case Stmt::ForStmtClass
:
3270 return extract_for(cast
<ForStmt
>(stmt
));
3271 case Stmt::IfStmtClass
:
3272 return extract(cast
<IfStmt
>(stmt
));
3273 case Stmt::CompoundStmtClass
:
3274 return extract(cast
<CompoundStmt
>(stmt
));
3275 case Stmt::LabelStmtClass
:
3276 return extract(cast
<LabelStmt
>(stmt
));
3284 /* Try and construct a pet_scop corresponding to (part of)
3285 * a sequence of statements.
3287 struct pet_scop
*PetScan::extract(StmtRange stmt_range
)
3292 bool partial_range
= false;
3294 scop
= pet_scop_empty(ctx
);
3295 for (i
= stmt_range
.first
, j
= 0; i
!= stmt_range
.second
; ++i
, ++j
) {
3297 struct pet_scop
*scop_i
;
3298 scop_i
= extract(child
);
3299 if (scop
&& partial
) {
3300 pet_scop_free(scop_i
);
3303 scop_i
= pet_scop_prefix(scop_i
, j
);
3306 scop
= pet_scop_add(ctx
, scop
, scop_i
);
3308 partial_range
= true;
3309 if (scop
->n_stmt
!= 0 && !scop_i
)
3312 scop
= pet_scop_add(ctx
, scop
, scop_i
);
3318 if (scop
&& partial_range
)
3324 /* Check if the scop marked by the user is exactly this Stmt
3325 * or part of this Stmt.
3326 * If so, return a pet_scop corresponding to the marked region.
3327 * Otherwise, return NULL.
3329 struct pet_scop
*PetScan::scan(Stmt
*stmt
)
3331 SourceManager
&SM
= PP
.getSourceManager();
3332 unsigned start_off
, end_off
;
3334 start_off
= SM
.getFileOffset(stmt
->getLocStart());
3335 end_off
= SM
.getFileOffset(stmt
->getLocEnd());
3337 if (start_off
> loc
.end
)
3339 if (end_off
< loc
.start
)
3341 if (start_off
>= loc
.start
&& end_off
<= loc
.end
) {
3342 return extract(stmt
);
3346 for (start
= stmt
->child_begin(); start
!= stmt
->child_end(); ++start
) {
3347 Stmt
*child
= *start
;
3350 start_off
= SM
.getFileOffset(child
->getLocStart());
3351 end_off
= SM
.getFileOffset(child
->getLocEnd());
3352 if (start_off
< loc
.start
&& end_off
> loc
.end
)
3354 if (start_off
>= loc
.start
)
3359 for (end
= start
; end
!= stmt
->child_end(); ++end
) {
3361 start_off
= SM
.getFileOffset(child
->getLocStart());
3362 if (start_off
>= loc
.end
)
3366 return extract(StmtRange(start
, end
));
3369 /* Set the size of index "pos" of "array" to "size".
3370 * In particular, add a constraint of the form
3374 * to array->extent and a constraint of the form
3378 * to array->context.
3380 static struct pet_array
*update_size(struct pet_array
*array
, int pos
,
3381 __isl_take isl_pw_aff
*size
)
3391 valid
= isl_pw_aff_nonneg_set(isl_pw_aff_copy(size
));
3392 array
->context
= isl_set_intersect(array
->context
, valid
);
3394 dim
= isl_set_get_space(array
->extent
);
3395 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
3396 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, pos
, 1);
3397 univ
= isl_set_universe(isl_aff_get_domain_space(aff
));
3398 index
= isl_pw_aff_alloc(univ
, aff
);
3400 size
= isl_pw_aff_add_dims(size
, isl_dim_in
,
3401 isl_set_dim(array
->extent
, isl_dim_set
));
3402 id
= isl_set_get_tuple_id(array
->extent
);
3403 size
= isl_pw_aff_set_tuple_id(size
, isl_dim_in
, id
);
3404 bound
= isl_pw_aff_lt_set(index
, size
);
3406 array
->extent
= isl_set_intersect(array
->extent
, bound
);
3408 if (!array
->context
|| !array
->extent
)
3413 pet_array_free(array
);
3417 /* Figure out the size of the array at position "pos" and all
3418 * subsequent positions from "type" and update "array" accordingly.
3420 struct pet_array
*PetScan::set_upper_bounds(struct pet_array
*array
,
3421 const Type
*type
, int pos
)
3423 const ArrayType
*atype
;
3429 if (type
->isPointerType()) {
3430 type
= type
->getPointeeType().getTypePtr();
3431 return set_upper_bounds(array
, type
, pos
+ 1);
3433 if (!type
->isArrayType())
3436 type
= type
->getCanonicalTypeInternal().getTypePtr();
3437 atype
= cast
<ArrayType
>(type
);
3439 if (type
->isConstantArrayType()) {
3440 const ConstantArrayType
*ca
= cast
<ConstantArrayType
>(atype
);
3441 size
= extract_affine(ca
->getSize());
3442 array
= update_size(array
, pos
, size
);
3443 } else if (type
->isVariableArrayType()) {
3444 const VariableArrayType
*vla
= cast
<VariableArrayType
>(atype
);
3445 size
= extract_affine(vla
->getSizeExpr());
3446 array
= update_size(array
, pos
, size
);
3449 type
= atype
->getElementType().getTypePtr();
3451 return set_upper_bounds(array
, type
, pos
+ 1);
3454 /* Construct and return a pet_array corresponding to the variable "decl".
3455 * In particular, initialize array->extent to
3457 * { name[i_1,...,i_d] : i_1,...,i_d >= 0 }
3459 * and then call set_upper_bounds to set the upper bounds on the indices
3460 * based on the type of the variable.
3462 struct pet_array
*PetScan::extract_array(isl_ctx
*ctx
, ValueDecl
*decl
)
3464 struct pet_array
*array
;
3465 QualType qt
= decl
->getType();
3466 const Type
*type
= qt
.getTypePtr();
3467 int depth
= array_depth(type
);
3468 QualType base
= base_type(qt
);
3473 array
= isl_calloc_type(ctx
, struct pet_array
);
3477 id
= isl_id_alloc(ctx
, decl
->getName().str().c_str(), decl
);
3478 dim
= isl_space_set_alloc(ctx
, 0, depth
);
3479 dim
= isl_space_set_tuple_id(dim
, isl_dim_set
, id
);
3481 array
->extent
= isl_set_nat_universe(dim
);
3483 dim
= isl_space_params_alloc(ctx
, 0);
3484 array
->context
= isl_set_universe(dim
);
3486 array
= set_upper_bounds(array
, type
, 0);
3490 name
= base
.getAsString();
3491 array
->element_type
= strdup(name
.c_str());
3492 array
->element_size
= decl
->getASTContext().getTypeInfo(base
).first
/ 8;
3497 /* Construct a list of pet_arrays, one for each array (or scalar)
3498 * accessed inside "scop" add this list to "scop" and return the result.
3500 * The context of "scop" is updated with the intesection of
3501 * the contexts of all arrays, i.e., constraints on the parameters
3502 * that ensure that the arrays have a valid (non-negative) size.
3504 struct pet_scop
*PetScan::scan_arrays(struct pet_scop
*scop
)
3507 set
<ValueDecl
*> arrays
;
3508 set
<ValueDecl
*>::iterator it
;
3510 struct pet_array
**scop_arrays
;
3515 pet_scop_collect_arrays(scop
, arrays
);
3516 if (arrays
.size() == 0)
3519 n_array
= scop
->n_array
;
3521 scop_arrays
= isl_realloc_array(ctx
, scop
->arrays
, struct pet_array
*,
3522 n_array
+ arrays
.size());
3525 scop
->arrays
= scop_arrays
;
3527 for (it
= arrays
.begin(), i
= 0; it
!= arrays
.end(); ++it
, ++i
) {
3528 struct pet_array
*array
;
3529 scop
->arrays
[n_array
+ i
] = array
= extract_array(ctx
, *it
);
3530 if (!scop
->arrays
[n_array
+ i
])
3533 scop
->context
= isl_set_intersect(scop
->context
,
3534 isl_set_copy(array
->context
));
3541 pet_scop_free(scop
);
3545 /* Bound all parameters in scop->context to the possible values
3546 * of the corresponding C variable.
3548 static struct pet_scop
*add_parameter_bounds(struct pet_scop
*scop
)
3555 n
= isl_set_dim(scop
->context
, isl_dim_param
);
3556 for (int i
= 0; i
< n
; ++i
) {
3560 id
= isl_set_get_dim_id(scop
->context
, isl_dim_param
, i
);
3561 decl
= (ValueDecl
*) isl_id_get_user(id
);
3564 scop
->context
= set_parameter_bounds(scop
->context
, i
, decl
);
3572 pet_scop_free(scop
);
3576 /* Construct a pet_scop from the given function.
3578 struct pet_scop
*PetScan::scan(FunctionDecl
*fd
)
3583 stmt
= fd
->getBody();
3586 scop
= extract(stmt
);
3589 scop
= pet_scop_detect_parameter_accesses(scop
);
3590 scop
= scan_arrays(scop
);
3591 scop
= add_parameter_bounds(scop
);
3592 scop
= pet_scop_gist(scop
, value_bounds
);