2 * Copyright 2011 Leiden University. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above
12 * copyright notice, this list of conditions and the following
13 * disclaimer in the documentation and/or other materials provided
14 * with the distribution.
16 * THIS SOFTWARE IS PROVIDED BY LEIDEN UNIVERSITY ''AS IS'' AND ANY
17 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
19 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL LEIDEN UNIVERSITY OR
20 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
21 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
22 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
23 * OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 * The views and conclusions contained in the software and documentation
29 * are those of the authors and should not be interpreted as
30 * representing official policies, either expressed or implied, of
37 #include <clang/AST/ASTDiagnostic.h>
38 #include <clang/AST/Expr.h>
39 #include <clang/AST/RecursiveASTVisitor.h>
42 #include <isl/space.h>
48 #include "scop_plus.h"
53 using namespace clang
;
56 /* Check if the element type corresponding to the given array type
57 * has a const qualifier.
59 static bool const_base(QualType qt
)
61 const Type
*type
= qt
.getTypePtr();
63 if (type
->isPointerType())
64 return const_base(type
->getPointeeType());
65 if (type
->isArrayType()) {
66 const ArrayType
*atype
;
67 type
= type
->getCanonicalTypeInternal().getTypePtr();
68 atype
= cast
<ArrayType
>(type
);
69 return const_base(atype
->getElementType());
72 return qt
.isConstQualified();
75 /* Look for any assignments to scalar variables in part of the parse
76 * tree and set assigned_value to NULL for each of them.
77 * Also reset assigned_value if the address of a scalar variable
78 * is being taken. As an exception, if the address is passed to a function
79 * that is declared to receive a const pointer, then assigned_value is
82 * This ensures that we won't use any previously stored value
83 * in the current subtree and its parents.
85 struct clear_assignments
: RecursiveASTVisitor
<clear_assignments
> {
86 map
<ValueDecl
*, Expr
*> &assigned_value
;
87 set
<UnaryOperator
*> skip
;
89 clear_assignments(map
<ValueDecl
*, Expr
*> &assigned_value
) :
90 assigned_value(assigned_value
) {}
92 /* Check for "address of" operators whose value is passed
93 * to a const pointer argument and add them to "skip", so that
94 * we can skip them in VisitUnaryOperator.
96 bool VisitCallExpr(CallExpr
*expr
) {
98 fd
= expr
->getDirectCallee();
101 for (int i
= 0; i
< expr
->getNumArgs(); ++i
) {
102 Expr
*arg
= expr
->getArg(i
);
104 if (arg
->getStmtClass() == Stmt::ImplicitCastExprClass
) {
105 ImplicitCastExpr
*ice
;
106 ice
= cast
<ImplicitCastExpr
>(arg
);
107 arg
= ice
->getSubExpr();
109 if (arg
->getStmtClass() != Stmt::UnaryOperatorClass
)
111 op
= cast
<UnaryOperator
>(arg
);
112 if (op
->getOpcode() != UO_AddrOf
)
114 if (const_base(fd
->getParamDecl(i
)->getType()))
120 bool VisitUnaryOperator(UnaryOperator
*expr
) {
125 if (expr
->getOpcode() != UO_AddrOf
)
127 if (skip
.find(expr
) != skip
.end())
130 arg
= expr
->getSubExpr();
131 if (arg
->getStmtClass() != Stmt::DeclRefExprClass
)
133 ref
= cast
<DeclRefExpr
>(arg
);
134 decl
= ref
->getDecl();
135 assigned_value
[decl
] = NULL
;
139 bool VisitBinaryOperator(BinaryOperator
*expr
) {
144 if (!expr
->isAssignmentOp())
146 lhs
= expr
->getLHS();
147 if (lhs
->getStmtClass() != Stmt::DeclRefExprClass
)
149 ref
= cast
<DeclRefExpr
>(lhs
);
150 decl
= ref
->getDecl();
151 assigned_value
[decl
] = NULL
;
156 /* Keep a copy of the currently assigned values.
158 * Any variable that is assigned a value inside the current scope
159 * is removed again when we leave the scope (either because it wasn't
160 * stored in the cache or because it has a different value in the cache).
162 struct assigned_value_cache
{
163 map
<ValueDecl
*, Expr
*> &assigned_value
;
164 map
<ValueDecl
*, Expr
*> cache
;
166 assigned_value_cache(map
<ValueDecl
*, Expr
*> &assigned_value
) :
167 assigned_value(assigned_value
), cache(assigned_value
) {}
168 ~assigned_value_cache() {
169 map
<ValueDecl
*, Expr
*>::iterator it
= cache
.begin();
170 for (it
= assigned_value
.begin(); it
!= assigned_value
.end();
173 (cache
.find(it
->first
) != cache
.end() &&
174 cache
[it
->first
] != it
->second
))
175 cache
[it
->first
] = NULL
;
177 assigned_value
= cache
;
181 /* Called if we found something we (currently) cannot handle.
182 * We'll provide more informative warnings later.
184 * We only actually complain if autodetect is false.
186 void PetScan::unsupported(Stmt
*stmt
)
191 SourceLocation loc
= stmt
->getLocStart();
192 DiagnosticsEngine
&diag
= PP
.getDiagnostics();
193 unsigned id
= diag
.getCustomDiagID(DiagnosticsEngine::Warning
,
195 DiagnosticBuilder B
= diag
.Report(loc
, id
) << stmt
->getSourceRange();
198 /* Extract an integer from "expr" and store it in "v".
200 int PetScan::extract_int(IntegerLiteral
*expr
, isl_int
*v
)
202 const Type
*type
= expr
->getType().getTypePtr();
203 int is_signed
= type
->hasSignedIntegerRepresentation();
206 int64_t i
= expr
->getValue().getSExtValue();
207 isl_int_set_si(*v
, i
);
209 uint64_t i
= expr
->getValue().getZExtValue();
210 isl_int_set_ui(*v
, i
);
216 /* Extract an affine expression from the IntegerLiteral "expr".
218 __isl_give isl_pw_aff
*PetScan::extract_affine(IntegerLiteral
*expr
)
220 isl_space
*dim
= isl_space_params_alloc(ctx
, 0);
221 isl_local_space
*ls
= isl_local_space_from_space(isl_space_copy(dim
));
222 isl_aff
*aff
= isl_aff_zero_on_domain(ls
);
223 isl_set
*dom
= isl_set_universe(dim
);
227 extract_int(expr
, &v
);
228 aff
= isl_aff_add_constant(aff
, v
);
231 return isl_pw_aff_alloc(dom
, aff
);
234 /* Extract an affine expression from the APInt "val".
236 __isl_give isl_pw_aff
*PetScan::extract_affine(const llvm::APInt
&val
)
238 isl_space
*dim
= isl_space_params_alloc(ctx
, 0);
239 isl_local_space
*ls
= isl_local_space_from_space(isl_space_copy(dim
));
240 isl_aff
*aff
= isl_aff_zero_on_domain(ls
);
241 isl_set
*dom
= isl_set_universe(dim
);
245 isl_int_set_ui(v
, val
.getZExtValue());
246 aff
= isl_aff_add_constant(aff
, v
);
249 return isl_pw_aff_alloc(dom
, aff
);
252 __isl_give isl_pw_aff
*PetScan::extract_affine(ImplicitCastExpr
*expr
)
254 return extract_affine(expr
->getSubExpr());
257 /* Extract an affine expression from the DeclRefExpr "expr".
259 * If the variable has been assigned a value, then we check whether
260 * we know what expression was assigned and whether this expression
261 * is affine. If so, we convert the expression to an isl_pw_aff
262 * and to an extra parameter otherwise (provided nesting_enabled is set).
264 * Otherwise, we simply return an expression that is equal
265 * to a parameter corresponding to the referenced variable.
267 __isl_give isl_pw_aff
*PetScan::extract_affine(DeclRefExpr
*expr
)
269 ValueDecl
*decl
= expr
->getDecl();
270 const Type
*type
= decl
->getType().getTypePtr();
276 if (!type
->isIntegerType()) {
281 if (assigned_value
.find(decl
) != assigned_value
.end()) {
282 if (assigned_value
[decl
] && is_affine(assigned_value
[decl
]))
283 return extract_affine(assigned_value
[decl
]);
285 return nested_access(expr
);
288 id
= isl_id_alloc(ctx
, decl
->getName().str().c_str(), decl
);
289 dim
= isl_space_params_alloc(ctx
, 1);
291 dim
= isl_space_set_dim_id(dim
, isl_dim_param
, 0, id
);
293 dom
= isl_set_universe(isl_space_copy(dim
));
294 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
295 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_param
, 0, 1);
297 return isl_pw_aff_alloc(dom
, aff
);
300 /* Extract an affine expression from an integer division operation.
301 * In particular, if "expr" is lhs/rhs, then return
303 * lhs >= 0 ? floor(lhs/rhs) : ceil(lhs/rhs)
305 * The second argument (rhs) is required to be a (positive) integer constant.
307 __isl_give isl_pw_aff
*PetScan::extract_affine_div(BinaryOperator
*expr
)
310 isl_pw_aff
*lhs
, *lhs_f
, *lhs_c
;
315 rhs_expr
= expr
->getRHS();
316 if (rhs_expr
->getStmtClass() != Stmt::IntegerLiteralClass
) {
321 lhs
= extract_affine(expr
->getLHS());
322 cond
= isl_pw_aff_nonneg_set(isl_pw_aff_copy(lhs
));
325 extract_int(cast
<IntegerLiteral
>(rhs_expr
), &v
);
326 lhs
= isl_pw_aff_scale_down(lhs
, v
);
329 lhs_f
= isl_pw_aff_floor(isl_pw_aff_copy(lhs
));
330 lhs_c
= isl_pw_aff_ceil(lhs
);
331 res
= isl_pw_aff_cond(cond
, lhs_f
, lhs_c
);
336 /* Extract an affine expression from a modulo operation.
337 * In particular, if "expr" is lhs/rhs, then return
339 * lhs - rhs * (lhs >= 0 ? floor(lhs/rhs) : ceil(lhs/rhs))
341 * The second argument (rhs) is required to be a (positive) integer constant.
343 __isl_give isl_pw_aff
*PetScan::extract_affine_mod(BinaryOperator
*expr
)
346 isl_pw_aff
*lhs
, *lhs_f
, *lhs_c
;
351 rhs_expr
= expr
->getRHS();
352 if (rhs_expr
->getStmtClass() != Stmt::IntegerLiteralClass
) {
357 lhs
= extract_affine(expr
->getLHS());
358 cond
= isl_pw_aff_nonneg_set(isl_pw_aff_copy(lhs
));
361 extract_int(cast
<IntegerLiteral
>(rhs_expr
), &v
);
362 res
= isl_pw_aff_scale_down(isl_pw_aff_copy(lhs
), v
);
364 lhs_f
= isl_pw_aff_floor(isl_pw_aff_copy(res
));
365 lhs_c
= isl_pw_aff_ceil(res
);
366 res
= isl_pw_aff_cond(cond
, lhs_f
, lhs_c
);
368 res
= isl_pw_aff_scale(res
, v
);
371 res
= isl_pw_aff_sub(lhs
, res
);
376 /* Extract an affine expression from a multiplication operation.
377 * This is only allowed if at least one of the two arguments
378 * is a (piecewise) constant.
380 __isl_give isl_pw_aff
*PetScan::extract_affine_mul(BinaryOperator
*expr
)
385 lhs
= extract_affine(expr
->getLHS());
386 rhs
= extract_affine(expr
->getRHS());
388 if (!isl_pw_aff_is_cst(lhs
) && !isl_pw_aff_is_cst(rhs
)) {
389 isl_pw_aff_free(lhs
);
390 isl_pw_aff_free(rhs
);
395 return isl_pw_aff_mul(lhs
, rhs
);
398 /* Extract an affine expression from an addition or subtraction operation.
400 __isl_give isl_pw_aff
*PetScan::extract_affine_add(BinaryOperator
*expr
)
405 lhs
= extract_affine(expr
->getLHS());
406 rhs
= extract_affine(expr
->getRHS());
408 switch (expr
->getOpcode()) {
410 return isl_pw_aff_add(lhs
, rhs
);
412 return isl_pw_aff_sub(lhs
, rhs
);
414 isl_pw_aff_free(lhs
);
415 isl_pw_aff_free(rhs
);
425 static __isl_give isl_pw_aff
*wrap(__isl_take isl_pw_aff
*pwaff
,
431 isl_int_set_si(mod
, 1);
432 isl_int_mul_2exp(mod
, mod
, width
);
434 pwaff
= isl_pw_aff_mod(pwaff
, mod
);
441 /* Extract an affine expression from some binary operations.
442 * If the result of the expression is unsigned, then we wrap it
443 * based on the size of the type.
445 __isl_give isl_pw_aff
*PetScan::extract_affine(BinaryOperator
*expr
)
449 switch (expr
->getOpcode()) {
452 res
= extract_affine_add(expr
);
455 res
= extract_affine_div(expr
);
458 res
= extract_affine_mod(expr
);
461 res
= extract_affine_mul(expr
);
468 if (expr
->getType()->isUnsignedIntegerType())
469 res
= wrap(res
, ast_context
.getIntWidth(expr
->getType()));
474 /* Extract an affine expression from a negation operation.
476 __isl_give isl_pw_aff
*PetScan::extract_affine(UnaryOperator
*expr
)
478 if (expr
->getOpcode() == UO_Minus
)
479 return isl_pw_aff_neg(extract_affine(expr
->getSubExpr()));
485 __isl_give isl_pw_aff
*PetScan::extract_affine(ParenExpr
*expr
)
487 return extract_affine(expr
->getSubExpr());
490 /* Extract an affine expression from some special function calls.
491 * In particular, we handle "min", "max", "ceild" and "floord".
492 * In case of the latter two, the second argument needs to be
493 * a (positive) integer constant.
495 __isl_give isl_pw_aff
*PetScan::extract_affine(CallExpr
*expr
)
499 isl_pw_aff
*aff1
, *aff2
;
501 fd
= expr
->getDirectCallee();
507 name
= fd
->getDeclName().getAsString();
508 if (!(expr
->getNumArgs() == 2 && name
== "min") &&
509 !(expr
->getNumArgs() == 2 && name
== "max") &&
510 !(expr
->getNumArgs() == 2 && name
== "floord") &&
511 !(expr
->getNumArgs() == 2 && name
== "ceild")) {
516 if (name
== "min" || name
== "max") {
517 aff1
= extract_affine(expr
->getArg(0));
518 aff2
= extract_affine(expr
->getArg(1));
521 aff1
= isl_pw_aff_min(aff1
, aff2
);
523 aff1
= isl_pw_aff_max(aff1
, aff2
);
524 } else if (name
== "floord" || name
== "ceild") {
526 Expr
*arg2
= expr
->getArg(1);
528 if (arg2
->getStmtClass() != Stmt::IntegerLiteralClass
) {
532 aff1
= extract_affine(expr
->getArg(0));
534 extract_int(cast
<IntegerLiteral
>(arg2
), &v
);
535 aff1
= isl_pw_aff_scale_down(aff1
, v
);
537 if (name
== "floord")
538 aff1
= isl_pw_aff_floor(aff1
);
540 aff1
= isl_pw_aff_ceil(aff1
);
550 /* This method is called when we come across an access that is
551 * nested in what is supposed to be an affine expression.
552 * If nesting is allowed, we return a new parameter that corresponds
553 * to this nested access. Otherwise, we simply complain.
555 * The new parameter is resolved in resolve_nested.
557 isl_pw_aff
*PetScan::nested_access(Expr
*expr
)
564 if (!nesting_enabled
) {
569 id
= isl_id_alloc(ctx
, NULL
, expr
);
570 dim
= isl_space_params_alloc(ctx
, 1);
572 dim
= isl_space_set_dim_id(dim
, isl_dim_param
, 0, id
);
574 dom
= isl_set_universe(isl_space_copy(dim
));
575 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
576 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_param
, 0, 1);
578 return isl_pw_aff_alloc(dom
, aff
);
581 /* Affine expressions are not supposed to contain array accesses,
582 * but if nesting is allowed, we return a parameter corresponding
583 * to the array access.
585 __isl_give isl_pw_aff
*PetScan::extract_affine(ArraySubscriptExpr
*expr
)
587 return nested_access(expr
);
590 /* Extract an affine expression from a conditional operation.
592 __isl_give isl_pw_aff
*PetScan::extract_affine(ConditionalOperator
*expr
)
595 isl_pw_aff
*lhs
, *rhs
;
597 cond
= extract_condition(expr
->getCond());
598 lhs
= extract_affine(expr
->getTrueExpr());
599 rhs
= extract_affine(expr
->getFalseExpr());
601 return isl_pw_aff_cond(cond
, lhs
, rhs
);
604 /* Extract an affine expression, if possible, from "expr".
605 * Otherwise return NULL.
607 __isl_give isl_pw_aff
*PetScan::extract_affine(Expr
*expr
)
609 switch (expr
->getStmtClass()) {
610 case Stmt::ImplicitCastExprClass
:
611 return extract_affine(cast
<ImplicitCastExpr
>(expr
));
612 case Stmt::IntegerLiteralClass
:
613 return extract_affine(cast
<IntegerLiteral
>(expr
));
614 case Stmt::DeclRefExprClass
:
615 return extract_affine(cast
<DeclRefExpr
>(expr
));
616 case Stmt::BinaryOperatorClass
:
617 return extract_affine(cast
<BinaryOperator
>(expr
));
618 case Stmt::UnaryOperatorClass
:
619 return extract_affine(cast
<UnaryOperator
>(expr
));
620 case Stmt::ParenExprClass
:
621 return extract_affine(cast
<ParenExpr
>(expr
));
622 case Stmt::CallExprClass
:
623 return extract_affine(cast
<CallExpr
>(expr
));
624 case Stmt::ArraySubscriptExprClass
:
625 return extract_affine(cast
<ArraySubscriptExpr
>(expr
));
626 case Stmt::ConditionalOperatorClass
:
627 return extract_affine(cast
<ConditionalOperator
>(expr
));
634 __isl_give isl_map
*PetScan::extract_access(ImplicitCastExpr
*expr
)
636 return extract_access(expr
->getSubExpr());
639 /* Return the depth of an array of the given type.
641 static int array_depth(const Type
*type
)
643 if (type
->isPointerType())
644 return 1 + array_depth(type
->getPointeeType().getTypePtr());
645 if (type
->isArrayType()) {
646 const ArrayType
*atype
;
647 type
= type
->getCanonicalTypeInternal().getTypePtr();
648 atype
= cast
<ArrayType
>(type
);
649 return 1 + array_depth(atype
->getElementType().getTypePtr());
654 /* Return the element type of the given array type.
656 static QualType
base_type(QualType qt
)
658 const Type
*type
= qt
.getTypePtr();
660 if (type
->isPointerType())
661 return base_type(type
->getPointeeType());
662 if (type
->isArrayType()) {
663 const ArrayType
*atype
;
664 type
= type
->getCanonicalTypeInternal().getTypePtr();
665 atype
= cast
<ArrayType
>(type
);
666 return base_type(atype
->getElementType());
671 /* Extract an access relation from a reference to a variable.
672 * If the variable has name "A" and its type corresponds to an
673 * array of depth d, then the returned access relation is of the
676 * { [] -> A[i_1,...,i_d] }
678 __isl_give isl_map
*PetScan::extract_access(DeclRefExpr
*expr
)
680 ValueDecl
*decl
= expr
->getDecl();
681 int depth
= array_depth(decl
->getType().getTypePtr());
682 isl_id
*id
= isl_id_alloc(ctx
, decl
->getName().str().c_str(), decl
);
683 isl_space
*dim
= isl_space_alloc(ctx
, 0, 0, depth
);
686 dim
= isl_space_set_tuple_id(dim
, isl_dim_out
, id
);
688 access_rel
= isl_map_universe(dim
);
693 /* Extract an access relation from an integer contant.
694 * If the value of the constant is "v", then the returned access relation
699 __isl_give isl_map
*PetScan::extract_access(IntegerLiteral
*expr
)
701 return isl_map_from_range(isl_set_from_pw_aff(extract_affine(expr
)));
704 /* Try and extract an access relation from the given Expr.
705 * Return NULL if it doesn't work out.
707 __isl_give isl_map
*PetScan::extract_access(Expr
*expr
)
709 switch (expr
->getStmtClass()) {
710 case Stmt::ImplicitCastExprClass
:
711 return extract_access(cast
<ImplicitCastExpr
>(expr
));
712 case Stmt::DeclRefExprClass
:
713 return extract_access(cast
<DeclRefExpr
>(expr
));
714 case Stmt::ArraySubscriptExprClass
:
715 return extract_access(cast
<ArraySubscriptExpr
>(expr
));
722 /* Assign the affine expression "index" to the output dimension "pos" of "map"
723 * and return the result.
725 __isl_give isl_map
*set_index(__isl_take isl_map
*map
, int pos
,
726 __isl_take isl_pw_aff
*index
)
729 int len
= isl_map_dim(map
, isl_dim_out
);
732 index_map
= isl_map_from_range(isl_set_from_pw_aff(index
));
733 index_map
= isl_map_insert_dims(index_map
, isl_dim_out
, 0, pos
);
734 index_map
= isl_map_add_dims(index_map
, isl_dim_out
, len
- pos
- 1);
735 id
= isl_map_get_tuple_id(map
, isl_dim_out
);
736 index_map
= isl_map_set_tuple_id(index_map
, isl_dim_out
, id
);
738 map
= isl_map_intersect(map
, index_map
);
743 /* Extract an access relation from the given array subscript expression.
744 * If nesting is allowed in general, then we turn it on while
745 * examining the index expression.
747 * We first extract an access relation from the base.
748 * This will result in an access relation with a range that corresponds
749 * to the array being accessed and with earlier indices filled in already.
750 * We then extract the current index and fill that in as well.
751 * The position of the current index is based on the type of base.
752 * If base is the actual array variable, then the depth of this type
753 * will be the same as the depth of the array and we will fill in
754 * the first array index.
755 * Otherwise, the depth of the base type will be smaller and we will fill
758 __isl_give isl_map
*PetScan::extract_access(ArraySubscriptExpr
*expr
)
760 Expr
*base
= expr
->getBase();
761 Expr
*idx
= expr
->getIdx();
763 isl_map
*base_access
;
765 int depth
= array_depth(base
->getType().getTypePtr());
767 bool save_nesting
= nesting_enabled
;
769 nesting_enabled
= allow_nested
;
771 base_access
= extract_access(base
);
772 index
= extract_affine(idx
);
774 nesting_enabled
= save_nesting
;
776 pos
= isl_map_dim(base_access
, isl_dim_out
) - depth
;
777 access
= set_index(base_access
, pos
, index
);
782 /* Check if "expr" calls function "minmax" with two arguments and if so
783 * make lhs and rhs refer to these two arguments.
785 static bool is_minmax(Expr
*expr
, const char *minmax
, Expr
*&lhs
, Expr
*&rhs
)
791 if (expr
->getStmtClass() != Stmt::CallExprClass
)
794 call
= cast
<CallExpr
>(expr
);
795 fd
= call
->getDirectCallee();
799 if (call
->getNumArgs() != 2)
802 name
= fd
->getDeclName().getAsString();
806 lhs
= call
->getArg(0);
807 rhs
= call
->getArg(1);
812 /* Check if "expr" is of the form min(lhs, rhs) and if so make
813 * lhs and rhs refer to the two arguments.
815 static bool is_min(Expr
*expr
, Expr
*&lhs
, Expr
*&rhs
)
817 return is_minmax(expr
, "min", lhs
, rhs
);
820 /* Check if "expr" is of the form max(lhs, rhs) and if so make
821 * lhs and rhs refer to the two arguments.
823 static bool is_max(Expr
*expr
, Expr
*&lhs
, Expr
*&rhs
)
825 return is_minmax(expr
, "max", lhs
, rhs
);
828 /* Extract a set of values satisfying the comparison "LHS op RHS"
829 * "comp" is the original statement that "LHS op RHS" is derived from
830 * and is used for diagnostics.
832 * If the comparison is of the form
836 * then the set is constructed as the intersection of the set corresponding
841 * A similar optimization is performed for max(a,b) <= c.
842 * We do this because that will lead to simpler representations of the set.
843 * If isl is ever enhanced to explicitly deal with min and max expressions,
844 * this optimization can be removed.
846 __isl_give isl_set
*PetScan::extract_comparison(BinaryOperatorKind op
,
847 Expr
*LHS
, Expr
*RHS
, Stmt
*comp
)
854 return extract_comparison(BO_LT
, RHS
, LHS
, comp
);
856 return extract_comparison(BO_LE
, RHS
, LHS
, comp
);
858 if (op
== BO_LT
|| op
== BO_LE
) {
860 isl_set
*set1
, *set2
;
861 if (is_min(RHS
, expr1
, expr2
)) {
862 set1
= extract_comparison(op
, LHS
, expr1
, comp
);
863 set2
= extract_comparison(op
, LHS
, expr2
, comp
);
864 return isl_set_intersect(set1
, set2
);
866 if (is_max(LHS
, expr1
, expr2
)) {
867 set1
= extract_comparison(op
, expr1
, RHS
, comp
);
868 set2
= extract_comparison(op
, expr2
, RHS
, comp
);
869 return isl_set_intersect(set1
, set2
);
873 lhs
= extract_affine(LHS
);
874 rhs
= extract_affine(RHS
);
878 cond
= isl_pw_aff_lt_set(lhs
, rhs
);
881 cond
= isl_pw_aff_le_set(lhs
, rhs
);
884 cond
= isl_pw_aff_eq_set(lhs
, rhs
);
887 cond
= isl_pw_aff_ne_set(lhs
, rhs
);
890 isl_pw_aff_free(lhs
);
891 isl_pw_aff_free(rhs
);
896 cond
= isl_set_coalesce(cond
);
901 __isl_give isl_set
*PetScan::extract_comparison(BinaryOperator
*comp
)
903 return extract_comparison(comp
->getOpcode(), comp
->getLHS(),
904 comp
->getRHS(), comp
);
907 /* Extract a set of values satisfying the negation (logical not)
908 * of a subexpression.
910 __isl_give isl_set
*PetScan::extract_boolean(UnaryOperator
*op
)
914 cond
= extract_condition(op
->getSubExpr());
916 return isl_set_complement(cond
);
919 /* Extract a set of values satisfying the union (logical or)
920 * or intersection (logical and) of two subexpressions.
922 __isl_give isl_set
*PetScan::extract_boolean(BinaryOperator
*comp
)
928 lhs
= extract_condition(comp
->getLHS());
929 rhs
= extract_condition(comp
->getRHS());
931 switch (comp
->getOpcode()) {
933 cond
= isl_set_intersect(lhs
, rhs
);
936 cond
= isl_set_union(lhs
, rhs
);
948 __isl_give isl_set
*PetScan::extract_condition(UnaryOperator
*expr
)
950 switch (expr
->getOpcode()) {
952 return extract_boolean(expr
);
959 /* Extract a set of values satisfying the condition "expr != 0".
961 __isl_give isl_set
*PetScan::extract_implicit_condition(Expr
*expr
)
963 return isl_pw_aff_non_zero_set(extract_affine(expr
));
966 /* Extract a set of values satisfying the condition expressed by "expr".
968 * If the expression doesn't look like a condition, we assume it
969 * is an affine expression and return the condition "expr != 0".
971 __isl_give isl_set
*PetScan::extract_condition(Expr
*expr
)
973 BinaryOperator
*comp
;
976 return isl_set_universe(isl_space_params_alloc(ctx
, 0));
978 if (expr
->getStmtClass() == Stmt::ParenExprClass
)
979 return extract_condition(cast
<ParenExpr
>(expr
)->getSubExpr());
981 if (expr
->getStmtClass() == Stmt::UnaryOperatorClass
)
982 return extract_condition(cast
<UnaryOperator
>(expr
));
984 if (expr
->getStmtClass() != Stmt::BinaryOperatorClass
)
985 return extract_implicit_condition(expr
);
987 comp
= cast
<BinaryOperator
>(expr
);
988 switch (comp
->getOpcode()) {
995 return extract_comparison(comp
);
998 return extract_boolean(comp
);
1000 return extract_implicit_condition(expr
);
1004 static enum pet_op_type
UnaryOperatorKind2pet_op_type(UnaryOperatorKind kind
)
1008 return pet_op_minus
;
1014 static enum pet_op_type
BinaryOperatorKind2pet_op_type(BinaryOperatorKind kind
)
1018 return pet_op_add_assign
;
1020 return pet_op_sub_assign
;
1022 return pet_op_mul_assign
;
1024 return pet_op_div_assign
;
1026 return pet_op_assign
;
1048 /* Construct a pet_expr representing a unary operator expression.
1050 struct pet_expr
*PetScan::extract_expr(UnaryOperator
*expr
)
1052 struct pet_expr
*arg
;
1053 enum pet_op_type op
;
1055 op
= UnaryOperatorKind2pet_op_type(expr
->getOpcode());
1056 if (op
== pet_op_last
) {
1061 arg
= extract_expr(expr
->getSubExpr());
1063 return pet_expr_new_unary(ctx
, op
, arg
);
1066 /* Mark the given access pet_expr as a write.
1067 * If a scalar is being accessed, then mark its value
1068 * as unknown in assigned_value.
1070 void PetScan::mark_write(struct pet_expr
*access
)
1075 access
->acc
.write
= 1;
1076 access
->acc
.read
= 0;
1078 if (isl_map_dim(access
->acc
.access
, isl_dim_out
) != 0)
1081 id
= isl_map_get_tuple_id(access
->acc
.access
, isl_dim_out
);
1082 decl
= (ValueDecl
*) isl_id_get_user(id
);
1083 assigned_value
[decl
] = NULL
;
1087 /* Construct a pet_expr representing a binary operator expression.
1089 * If the top level operator is an assignment and the LHS is an access,
1090 * then we mark that access as a write. If the operator is a compound
1091 * assignment, the access is marked as both a read and a write.
1093 * If "expr" assigns something to a scalar variable, then we keep track
1094 * of the assigned expression in assigned_value so that we can plug
1095 * it in when we later come across the same variable.
1097 struct pet_expr
*PetScan::extract_expr(BinaryOperator
*expr
)
1099 struct pet_expr
*lhs
, *rhs
;
1100 enum pet_op_type op
;
1102 op
= BinaryOperatorKind2pet_op_type(expr
->getOpcode());
1103 if (op
== pet_op_last
) {
1108 lhs
= extract_expr(expr
->getLHS());
1109 rhs
= extract_expr(expr
->getRHS());
1111 if (expr
->isAssignmentOp() && lhs
&& lhs
->type
== pet_expr_access
) {
1113 if (expr
->isCompoundAssignmentOp())
1117 if (expr
->getOpcode() == BO_Assign
&&
1118 lhs
&& lhs
->type
== pet_expr_access
&&
1119 isl_map_dim(lhs
->acc
.access
, isl_dim_out
) == 0) {
1120 isl_id
*id
= isl_map_get_tuple_id(lhs
->acc
.access
, isl_dim_out
);
1121 ValueDecl
*decl
= (ValueDecl
*) isl_id_get_user(id
);
1122 assigned_value
[decl
] = expr
->getRHS();
1126 return pet_expr_new_binary(ctx
, op
, lhs
, rhs
);
1129 /* Construct a pet_expr representing a conditional operation.
1131 struct pet_expr
*PetScan::extract_expr(ConditionalOperator
*expr
)
1133 struct pet_expr
*cond
, *lhs
, *rhs
;
1135 cond
= extract_expr(expr
->getCond());
1136 lhs
= extract_expr(expr
->getTrueExpr());
1137 rhs
= extract_expr(expr
->getFalseExpr());
1139 return pet_expr_new_ternary(ctx
, cond
, lhs
, rhs
);
1142 struct pet_expr
*PetScan::extract_expr(ImplicitCastExpr
*expr
)
1144 return extract_expr(expr
->getSubExpr());
1147 /* Construct a pet_expr representing a floating point value.
1149 struct pet_expr
*PetScan::extract_expr(FloatingLiteral
*expr
)
1151 return pet_expr_new_double(ctx
, expr
->getValueAsApproximateDouble());
1154 /* Extract an access relation from "expr" and then convert it into
1157 struct pet_expr
*PetScan::extract_access_expr(Expr
*expr
)
1160 struct pet_expr
*pe
;
1162 switch (expr
->getStmtClass()) {
1163 case Stmt::ArraySubscriptExprClass
:
1164 access
= extract_access(cast
<ArraySubscriptExpr
>(expr
));
1166 case Stmt::DeclRefExprClass
:
1167 access
= extract_access(cast
<DeclRefExpr
>(expr
));
1169 case Stmt::IntegerLiteralClass
:
1170 access
= extract_access(cast
<IntegerLiteral
>(expr
));
1177 pe
= pet_expr_from_access(access
);
1182 struct pet_expr
*PetScan::extract_expr(ParenExpr
*expr
)
1184 return extract_expr(expr
->getSubExpr());
1187 /* Construct a pet_expr representing a function call.
1189 * If we are passing along a pointer to an array element
1190 * or an entire row or even higher dimensional slice of an array,
1191 * then the function being called may write into the array.
1193 * We assume here that if the function is declared to take a pointer
1194 * to a const type, then the function will perform a read
1195 * and that otherwise, it will perform a write.
1197 struct pet_expr
*PetScan::extract_expr(CallExpr
*expr
)
1199 struct pet_expr
*res
= NULL
;
1203 fd
= expr
->getDirectCallee();
1209 name
= fd
->getDeclName().getAsString();
1210 res
= pet_expr_new_call(ctx
, name
.c_str(), expr
->getNumArgs());
1214 for (int i
= 0; i
< expr
->getNumArgs(); ++i
) {
1215 Expr
*arg
= expr
->getArg(i
);
1218 if (arg
->getStmtClass() == Stmt::ImplicitCastExprClass
) {
1219 ImplicitCastExpr
*ice
= cast
<ImplicitCastExpr
>(arg
);
1220 arg
= ice
->getSubExpr();
1222 if (arg
->getStmtClass() == Stmt::UnaryOperatorClass
) {
1223 UnaryOperator
*op
= cast
<UnaryOperator
>(arg
);
1224 if (op
->getOpcode() == UO_AddrOf
) {
1226 arg
= op
->getSubExpr();
1229 res
->args
[i
] = PetScan::extract_expr(arg
);
1232 if (arg
->getStmtClass() == Stmt::ArraySubscriptExprClass
&&
1233 array_depth(arg
->getType().getTypePtr()) > 0)
1235 if (is_addr
&& res
->args
[i
]->type
== pet_expr_access
) {
1236 ParmVarDecl
*parm
= fd
->getParamDecl(i
);
1237 if (!const_base(parm
->getType()))
1238 mark_write(res
->args
[i
]);
1248 /* Try and onstruct a pet_expr representing "expr".
1250 struct pet_expr
*PetScan::extract_expr(Expr
*expr
)
1252 switch (expr
->getStmtClass()) {
1253 case Stmt::UnaryOperatorClass
:
1254 return extract_expr(cast
<UnaryOperator
>(expr
));
1255 case Stmt::CompoundAssignOperatorClass
:
1256 case Stmt::BinaryOperatorClass
:
1257 return extract_expr(cast
<BinaryOperator
>(expr
));
1258 case Stmt::ImplicitCastExprClass
:
1259 return extract_expr(cast
<ImplicitCastExpr
>(expr
));
1260 case Stmt::ArraySubscriptExprClass
:
1261 case Stmt::DeclRefExprClass
:
1262 case Stmt::IntegerLiteralClass
:
1263 return extract_access_expr(expr
);
1264 case Stmt::FloatingLiteralClass
:
1265 return extract_expr(cast
<FloatingLiteral
>(expr
));
1266 case Stmt::ParenExprClass
:
1267 return extract_expr(cast
<ParenExpr
>(expr
));
1268 case Stmt::ConditionalOperatorClass
:
1269 return extract_expr(cast
<ConditionalOperator
>(expr
));
1270 case Stmt::CallExprClass
:
1271 return extract_expr(cast
<CallExpr
>(expr
));
1278 /* Check if the given initialization statement is an assignment.
1279 * If so, return that assignment. Otherwise return NULL.
1281 BinaryOperator
*PetScan::initialization_assignment(Stmt
*init
)
1283 BinaryOperator
*ass
;
1285 if (init
->getStmtClass() != Stmt::BinaryOperatorClass
)
1288 ass
= cast
<BinaryOperator
>(init
);
1289 if (ass
->getOpcode() != BO_Assign
)
1295 /* Check if the given initialization statement is a declaration
1296 * of a single variable.
1297 * If so, return that declaration. Otherwise return NULL.
1299 Decl
*PetScan::initialization_declaration(Stmt
*init
)
1303 if (init
->getStmtClass() != Stmt::DeclStmtClass
)
1306 decl
= cast
<DeclStmt
>(init
);
1308 if (!decl
->isSingleDecl())
1311 return decl
->getSingleDecl();
1314 /* Given the assignment operator in the initialization of a for loop,
1315 * extract the induction variable, i.e., the (integer)variable being
1318 ValueDecl
*PetScan::extract_induction_variable(BinaryOperator
*init
)
1325 lhs
= init
->getLHS();
1326 if (lhs
->getStmtClass() != Stmt::DeclRefExprClass
) {
1331 ref
= cast
<DeclRefExpr
>(lhs
);
1332 decl
= ref
->getDecl();
1333 type
= decl
->getType().getTypePtr();
1335 if (!type
->isIntegerType()) {
1343 /* Given the initialization statement of a for loop and the single
1344 * declaration in this initialization statement,
1345 * extract the induction variable, i.e., the (integer) variable being
1348 VarDecl
*PetScan::extract_induction_variable(Stmt
*init
, Decl
*decl
)
1352 vd
= cast
<VarDecl
>(decl
);
1354 const QualType type
= vd
->getType();
1355 if (!type
->isIntegerType()) {
1360 if (!vd
->getInit()) {
1368 /* Check that op is of the form iv++ or iv--.
1369 * "inc" is accordingly set to 1 or -1.
1371 bool PetScan::check_unary_increment(UnaryOperator
*op
, clang::ValueDecl
*iv
,
1377 if (!op
->isIncrementDecrementOp()) {
1382 if (op
->isIncrementOp())
1383 isl_int_set_si(inc
, 1);
1385 isl_int_set_si(inc
, -1);
1387 sub
= op
->getSubExpr();
1388 if (sub
->getStmtClass() != Stmt::DeclRefExprClass
) {
1393 ref
= cast
<DeclRefExpr
>(sub
);
1394 if (ref
->getDecl() != iv
) {
1402 /* If the isl_pw_aff on which isl_pw_aff_foreach_piece is called
1403 * has a single constant expression on a universe domain, then
1404 * put this constant in *user.
1406 static int extract_cst(__isl_take isl_set
*set
, __isl_take isl_aff
*aff
,
1409 isl_int
*inc
= (isl_int
*)user
;
1412 if (!isl_set_plain_is_universe(set
) || !isl_aff_is_cst(aff
))
1415 isl_aff_get_constant(aff
, inc
);
1423 /* Check if op is of the form
1427 * with inc a constant and set "inc" accordingly.
1429 * We extract an affine expression from the RHS and the subtract iv.
1430 * The result should be a constant.
1432 bool PetScan::check_binary_increment(BinaryOperator
*op
, clang::ValueDecl
*iv
,
1442 if (op
->getOpcode() != BO_Assign
) {
1448 if (lhs
->getStmtClass() != Stmt::DeclRefExprClass
) {
1453 ref
= cast
<DeclRefExpr
>(lhs
);
1454 if (ref
->getDecl() != iv
) {
1459 val
= extract_affine(op
->getRHS());
1461 id
= isl_id_alloc(ctx
, iv
->getName().str().c_str(), iv
);
1463 dim
= isl_space_params_alloc(ctx
, 1);
1464 dim
= isl_space_set_dim_id(dim
, isl_dim_param
, 0, id
);
1465 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
1466 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_param
, 0, 1);
1468 val
= isl_pw_aff_sub(val
, isl_pw_aff_from_aff(aff
));
1470 if (isl_pw_aff_foreach_piece(val
, &extract_cst
, &inc
) < 0) {
1471 isl_pw_aff_free(val
);
1476 isl_pw_aff_free(val
);
1481 /* Check that op is of the form iv += cst or iv -= cst.
1482 * "inc" is set to cst or -cst accordingly.
1484 bool PetScan::check_compound_increment(CompoundAssignOperator
*op
,
1485 clang::ValueDecl
*iv
, isl_int
&inc
)
1491 BinaryOperatorKind opcode
;
1493 opcode
= op
->getOpcode();
1494 if (opcode
!= BO_AddAssign
&& opcode
!= BO_SubAssign
) {
1498 if (opcode
== BO_SubAssign
)
1502 if (lhs
->getStmtClass() != Stmt::DeclRefExprClass
) {
1507 ref
= cast
<DeclRefExpr
>(lhs
);
1508 if (ref
->getDecl() != iv
) {
1515 if (rhs
->getStmtClass() == Stmt::UnaryOperatorClass
) {
1516 UnaryOperator
*op
= cast
<UnaryOperator
>(rhs
);
1517 if (op
->getOpcode() != UO_Minus
) {
1524 rhs
= op
->getSubExpr();
1527 if (rhs
->getStmtClass() != Stmt::IntegerLiteralClass
) {
1532 extract_int(cast
<IntegerLiteral
>(rhs
), &inc
);
1534 isl_int_neg(inc
, inc
);
1539 /* Check that the increment of the given for loop increments
1540 * (or decrements) the induction variable "iv".
1541 * "up" is set to true if the induction variable is incremented.
1543 bool PetScan::check_increment(ForStmt
*stmt
, ValueDecl
*iv
, isl_int
&v
)
1545 Stmt
*inc
= stmt
->getInc();
1552 if (inc
->getStmtClass() == Stmt::UnaryOperatorClass
)
1553 return check_unary_increment(cast
<UnaryOperator
>(inc
), iv
, v
);
1554 if (inc
->getStmtClass() == Stmt::CompoundAssignOperatorClass
)
1555 return check_compound_increment(
1556 cast
<CompoundAssignOperator
>(inc
), iv
, v
);
1557 if (inc
->getStmtClass() == Stmt::BinaryOperatorClass
)
1558 return check_binary_increment(cast
<BinaryOperator
>(inc
), iv
, v
);
1564 /* Embed the given iteration domain in an extra outer loop
1565 * with induction variable "var".
1566 * If this variable appeared as a parameter in the constraints,
1567 * it is replaced by the new outermost dimension.
1569 static __isl_give isl_set
*embed(__isl_take isl_set
*set
,
1570 __isl_take isl_id
*var
)
1574 set
= isl_set_insert_dims(set
, isl_dim_set
, 0, 1);
1575 pos
= isl_set_find_dim_by_id(set
, isl_dim_param
, var
);
1577 set
= isl_set_equate(set
, isl_dim_param
, pos
, isl_dim_set
, 0);
1578 set
= isl_set_project_out(set
, isl_dim_param
, pos
, 1);
1585 /* Construct a pet_scop for an infinite loop around the given body.
1587 * We extract a pet_scop for the body and then embed it in a loop with
1596 struct pet_scop
*PetScan::extract_infinite_loop(Stmt
*body
)
1602 struct pet_scop
*scop
;
1604 scop
= extract(body
);
1608 id
= isl_id_alloc(ctx
, "t", NULL
);
1609 domain
= isl_set_nat_universe(isl_space_set_alloc(ctx
, 0, 1));
1610 domain
= isl_set_set_dim_id(domain
, isl_dim_set
, 0, isl_id_copy(id
));
1611 dim
= isl_space_from_domain(isl_set_get_space(domain
));
1612 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
1613 sched
= isl_map_universe(dim
);
1614 sched
= isl_map_equate(sched
, isl_dim_in
, 0, isl_dim_out
, 0);
1615 scop
= pet_scop_embed(scop
, domain
, sched
, id
);
1620 /* Construct a pet_scop for an infinite loop, i.e., a loop of the form
1626 struct pet_scop
*PetScan::extract_infinite_for(ForStmt
*stmt
)
1628 return extract_infinite_loop(stmt
->getBody());
1631 /* Check if the while loop is of the form
1636 * If so, construct a scop for an infinite loop around body.
1639 struct pet_scop
*PetScan::extract(WhileStmt
*stmt
)
1645 cond
= stmt
->getCond();
1651 set
= extract_condition(cond
);
1652 is_universe
= isl_set_plain_is_universe(set
);
1660 return extract_infinite_loop(stmt
->getBody());
1663 /* Check whether "cond" expresses a simple loop bound
1664 * on the only set dimension.
1665 * In particular, if "up" is set then "cond" should contain only
1666 * upper bounds on the set dimension.
1667 * Otherwise, it should contain only lower bounds.
1669 static bool is_simple_bound(__isl_keep isl_set
*cond
, isl_int inc
)
1671 if (isl_int_is_pos(inc
))
1672 return !isl_set_dim_has_lower_bound(cond
, isl_dim_set
, 0);
1674 return !isl_set_dim_has_upper_bound(cond
, isl_dim_set
, 0);
1677 /* Extend a condition on a given iteration of a loop to one that
1678 * imposes the same condition on all previous iterations.
1679 * "domain" expresses the lower [upper] bound on the iterations
1680 * when up is set [not set].
1682 * In particular, we construct the condition (when up is set)
1684 * forall i' : (domain(i') and i' <= i) => cond(i')
1686 * which is equivalent to
1688 * not exists i' : domain(i') and i' <= i and not cond(i')
1690 * We construct this set by negating cond, applying a map
1692 * { [i'] -> [i] : domain(i') and i' <= i }
1694 * and then negating the result again.
1696 static __isl_give isl_set
*valid_for_each_iteration(__isl_take isl_set
*cond
,
1697 __isl_take isl_set
*domain
, isl_int inc
)
1699 isl_map
*previous_to_this
;
1701 if (isl_int_is_pos(inc
))
1702 previous_to_this
= isl_map_lex_le(isl_set_get_space(domain
));
1704 previous_to_this
= isl_map_lex_ge(isl_set_get_space(domain
));
1706 previous_to_this
= isl_map_intersect_domain(previous_to_this
, domain
);
1708 cond
= isl_set_complement(cond
);
1709 cond
= isl_set_apply(cond
, previous_to_this
);
1710 cond
= isl_set_complement(cond
);
1715 /* Construct a domain of the form
1717 * [id] -> { [] : exists a: id = init + a * inc and a >= 0 }
1719 static __isl_give isl_set
*strided_domain(__isl_take isl_id
*id
,
1720 __isl_take isl_pw_aff
*init
, isl_int inc
)
1726 init
= isl_pw_aff_insert_dims(init
, isl_dim_in
, 0, 1);
1727 dim
= isl_pw_aff_get_domain_space(init
);
1728 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
1729 aff
= isl_aff_add_coefficient(aff
, isl_dim_in
, 0, inc
);
1730 init
= isl_pw_aff_add(init
, isl_pw_aff_from_aff(aff
));
1732 dim
= isl_space_set_alloc(isl_pw_aff_get_ctx(init
), 1, 1);
1733 dim
= isl_space_set_dim_id(dim
, isl_dim_param
, 0, id
);
1734 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
1735 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_param
, 0, 1);
1737 set
= isl_pw_aff_eq_set(isl_pw_aff_from_aff(aff
), init
);
1739 set
= isl_set_lower_bound_si(set
, isl_dim_set
, 0, 0);
1741 return isl_set_project_out(set
, isl_dim_set
, 0, 1);
1744 static unsigned get_type_size(ValueDecl
*decl
)
1746 return decl
->getASTContext().getIntWidth(decl
->getType());
1749 /* Assuming "cond" represents a simple bound on a loop where the loop
1750 * iterator "iv" is incremented (or decremented) by one, check if wrapping
1753 * Under the given assumptions, wrapping is only possible if "cond" allows
1754 * for the last value before wrapping, i.e., 2^width - 1 in case of an
1755 * increasing iterator and 0 in case of a decreasing iterator.
1757 static bool can_wrap(__isl_keep isl_set
*cond
, ValueDecl
*iv
, isl_int inc
)
1763 test
= isl_set_copy(cond
);
1765 isl_int_init(limit
);
1766 if (isl_int_is_neg(inc
))
1767 isl_int_set_si(limit
, 0);
1769 isl_int_set_si(limit
, 1);
1770 isl_int_mul_2exp(limit
, limit
, get_type_size(iv
));
1771 isl_int_sub_ui(limit
, limit
, 1);
1774 test
= isl_set_fix(cond
, isl_dim_set
, 0, limit
);
1775 cw
= !isl_set_is_empty(test
);
1778 isl_int_clear(limit
);
1783 /* Given a one-dimensional space, construct the following mapping on this
1786 * { [v] -> [v mod 2^width] }
1788 * where width is the number of bits used to represent the values
1789 * of the unsigned variable "iv".
1791 static __isl_give isl_map
*compute_wrapping(__isl_take isl_space
*dim
,
1799 isl_int_set_si(mod
, 1);
1800 isl_int_mul_2exp(mod
, mod
, get_type_size(iv
));
1802 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
1803 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, 0, 1);
1804 aff
= isl_aff_mod(aff
, mod
);
1808 return isl_map_from_basic_map(isl_basic_map_from_aff(aff
));
1809 map
= isl_map_reverse(map
);
1812 /* Construct a pet_scop for a for statement.
1813 * The for loop is required to be of the form
1815 * for (i = init; condition; ++i)
1819 * for (i = init; condition; --i)
1821 * The initialization of the for loop should either be an assignment
1822 * to an integer variable, or a declaration of such a variable with
1825 * We extract a pet_scop for the body and then embed it in a loop with
1826 * iteration domain and schedule
1828 * { [i] : i >= init and condition' }
1833 * { [i] : i <= init and condition' }
1836 * Where condition' is equal to condition if the latter is
1837 * a simple upper [lower] bound and a condition that is extended
1838 * to apply to all previous iterations otherwise.
1840 * If the stride of the loop is not 1, then "i >= init" is replaced by
1842 * (exists a: i = init + stride * a and a >= 0)
1844 * If the loop iterator i is unsigned, then wrapping may occur.
1845 * During the computation, we work with a virtual iterator that
1846 * does not wrap. However, the condition in the code applies
1847 * to the wrapped value, so we need to change condition(i)
1848 * into condition([i % 2^width]).
1849 * After computing the virtual domain and schedule, we apply
1850 * the function { [v] -> [v % 2^width] } to the domain and the domain
1851 * of the schedule. In order not to lose any information, we also
1852 * need to intersect the domain of the schedule with the virtual domain
1853 * first, since some iterations in the wrapped domain may be scheduled
1854 * several times, typically an infinite number of times.
1855 * Note that there is no need to perform this final wrapping
1856 * if the loop condition (after wrapping) is simple.
1858 * Wrapping on unsigned iterators can be avoided entirely if
1859 * loop condition is simple, the loop iterator is incremented
1860 * [decremented] by one and the last value before wrapping cannot
1861 * possibly satisfy the loop condition.
1863 * Before extracting a pet_scop from the body we remove all
1864 * assignments in assigned_value to variables that are assigned
1865 * somewhere in the body of the loop.
1867 struct pet_scop
*PetScan::extract_for(ForStmt
*stmt
)
1869 BinaryOperator
*ass
;
1879 struct pet_scop
*scop
;
1880 assigned_value_cache
cache(assigned_value
);
1885 isl_map
*wrap
= NULL
;
1887 if (!stmt
->getInit() && !stmt
->getCond() && !stmt
->getInc())
1888 return extract_infinite_for(stmt
);
1890 init
= stmt
->getInit();
1895 if ((ass
= initialization_assignment(init
)) != NULL
) {
1896 iv
= extract_induction_variable(ass
);
1899 lhs
= ass
->getLHS();
1900 rhs
= ass
->getRHS();
1901 } else if ((decl
= initialization_declaration(init
)) != NULL
) {
1902 VarDecl
*var
= extract_induction_variable(init
, decl
);
1906 rhs
= var
->getInit();
1907 lhs
= DeclRefExpr::Create(iv
->getASTContext(),
1908 var
->getQualifierLoc(), iv
, var
->getInnerLocStart(),
1909 var
->getType(), VK_LValue
);
1911 unsupported(stmt
->getInit());
1916 if (!check_increment(stmt
, iv
, inc
)) {
1921 is_unsigned
= iv
->getType()->isUnsignedIntegerType();
1923 assigned_value
.erase(iv
);
1924 clear_assignments
clear(assigned_value
);
1925 clear
.TraverseStmt(stmt
->getBody());
1927 id
= isl_id_alloc(ctx
, iv
->getName().str().c_str(), iv
);
1929 is_one
= isl_int_is_one(inc
) || isl_int_is_negone(inc
);
1931 domain
= extract_comparison(isl_int_is_pos(inc
) ? BO_GE
: BO_LE
,
1934 isl_pw_aff
*lb
= extract_affine(rhs
);
1935 domain
= strided_domain(isl_id_copy(id
), lb
, inc
);
1938 cond
= extract_condition(stmt
->getCond());
1939 cond
= embed(cond
, isl_id_copy(id
));
1940 domain
= embed(domain
, isl_id_copy(id
));
1941 is_simple
= is_simple_bound(cond
, inc
);
1943 (!is_simple
|| !is_one
|| can_wrap(cond
, iv
, inc
))) {
1944 wrap
= compute_wrapping(isl_set_get_space(cond
), iv
);
1945 cond
= isl_set_apply(cond
, isl_map_reverse(isl_map_copy(wrap
)));
1946 is_simple
= is_simple
&& is_simple_bound(cond
, inc
);
1949 cond
= valid_for_each_iteration(cond
,
1950 isl_set_copy(domain
), inc
);
1951 domain
= isl_set_intersect(domain
, cond
);
1952 domain
= isl_set_set_dim_id(domain
, isl_dim_set
, 0, isl_id_copy(id
));
1953 dim
= isl_space_from_domain(isl_set_get_space(domain
));
1954 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
1955 sched
= isl_map_universe(dim
);
1956 if (isl_int_is_pos(inc
))
1957 sched
= isl_map_equate(sched
, isl_dim_in
, 0, isl_dim_out
, 0);
1959 sched
= isl_map_oppose(sched
, isl_dim_in
, 0, isl_dim_out
, 0);
1961 if (is_unsigned
&& !is_simple
) {
1962 wrap
= isl_map_set_dim_id(wrap
,
1963 isl_dim_out
, 0, isl_id_copy(id
));
1964 sched
= isl_map_intersect_domain(sched
, isl_set_copy(domain
));
1965 domain
= isl_set_apply(domain
, isl_map_copy(wrap
));
1966 sched
= isl_map_apply_domain(sched
, wrap
);
1970 scop
= extract(stmt
->getBody());
1971 scop
= pet_scop_embed(scop
, domain
, sched
, id
);
1972 assigned_value
[iv
] = NULL
;
1978 struct pet_scop
*PetScan::extract(CompoundStmt
*stmt
)
1980 return extract(stmt
->children());
1983 /* Does "id" refer to a nested access?
1985 static bool is_nested_parameter(__isl_keep isl_id
*id
)
1987 return id
&& isl_id_get_user(id
) && !isl_id_get_name(id
);
1990 /* Does parameter "pos" of "space" refer to a nested access?
1992 static bool is_nested_parameter(__isl_keep isl_space
*space
, int pos
)
1997 id
= isl_space_get_dim_id(space
, isl_dim_param
, pos
);
1998 nested
= is_nested_parameter(id
);
2004 /* Does parameter "pos" of "map" refer to a nested access?
2006 static bool is_nested_parameter(__isl_keep isl_map
*map
, int pos
)
2011 id
= isl_map_get_dim_id(map
, isl_dim_param
, pos
);
2012 nested
= is_nested_parameter(id
);
2018 /* How many parameters of "space" refer to nested accesses, i.e., have no name?
2020 static int n_nested_parameter(__isl_keep isl_space
*space
)
2025 nparam
= isl_space_dim(space
, isl_dim_param
);
2026 for (int i
= 0; i
< nparam
; ++i
)
2027 if (is_nested_parameter(space
, i
))
2033 /* How many parameters of "map" refer to nested accesses, i.e., have no name?
2035 static int n_nested_parameter(__isl_keep isl_map
*map
)
2040 space
= isl_map_get_space(map
);
2041 n
= n_nested_parameter(space
);
2042 isl_space_free(space
);
2047 /* For each nested access parameter in "space",
2048 * construct a corresponding pet_expr, place it in args and
2049 * record its position in "param2pos".
2050 * "n_arg" is the number of elements that are already in args.
2051 * The position recorded in "param2pos" takes this number into account.
2052 * If the pet_expr corresponding to a parameter is identical to
2053 * the pet_expr corresponding to an earlier parameter, then these two
2054 * parameters are made to refer to the same element in args.
2056 * Return the final number of elements in args or -1 if an error has occurred.
2058 int PetScan::extract_nested(__isl_keep isl_space
*space
,
2059 int n_arg
, struct pet_expr
**args
, std::map
<int,int> ¶m2pos
)
2063 nparam
= isl_space_dim(space
, isl_dim_param
);
2064 for (int i
= 0; i
< nparam
; ++i
) {
2066 isl_id
*id
= isl_space_get_dim_id(space
, isl_dim_param
, i
);
2069 if (!is_nested_parameter(id
)) {
2074 nested
= (Expr
*) isl_id_get_user(id
);
2075 args
[n_arg
] = extract_expr(nested
);
2079 for (j
= 0; j
< n_arg
; ++j
)
2080 if (pet_expr_is_equal(args
[j
], args
[n_arg
]))
2084 pet_expr_free(args
[n_arg
]);
2088 param2pos
[i
] = n_arg
++;
2096 /* For each nested access parameter in the access relations in "expr",
2097 * construct a corresponding pet_expr, place it in expr->args and
2098 * record its position in "param2pos".
2099 * n is the number of nested access parameters.
2101 struct pet_expr
*PetScan::extract_nested(struct pet_expr
*expr
, int n
,
2102 std::map
<int,int> ¶m2pos
)
2106 expr
->args
= isl_calloc_array(ctx
, struct pet_expr
*, n
);
2111 space
= isl_map_get_space(expr
->acc
.access
);
2112 n
= extract_nested(space
, 0, expr
->args
, param2pos
);
2113 isl_space_free(space
);
2121 pet_expr_free(expr
);
2125 /* Look for parameters in any access relation in "expr" that
2126 * refer to nested accesses. In particular, these are
2127 * parameters with no name.
2129 * If there are any such parameters, then the domain of the access
2130 * relation, which is still [] at this point, is replaced by
2131 * [[] -> [t_1,...,t_n]], with n the number of these parameters
2132 * (after identifying identical nested accesses).
2133 * The parameters are then equated to the corresponding t dimensions
2134 * and subsequently projected out.
2135 * param2pos maps the position of the parameter to the position
2136 * of the corresponding t dimension.
2138 struct pet_expr
*PetScan::resolve_nested(struct pet_expr
*expr
)
2145 std::map
<int,int> param2pos
;
2150 for (int i
= 0; i
< expr
->n_arg
; ++i
) {
2151 expr
->args
[i
] = resolve_nested(expr
->args
[i
]);
2152 if (!expr
->args
[i
]) {
2153 pet_expr_free(expr
);
2158 if (expr
->type
!= pet_expr_access
)
2161 n
= n_nested_parameter(expr
->acc
.access
);
2165 expr
= extract_nested(expr
, n
, param2pos
);
2170 nparam
= isl_map_dim(expr
->acc
.access
, isl_dim_param
);
2171 n_in
= isl_map_dim(expr
->acc
.access
, isl_dim_in
);
2172 dim
= isl_map_get_space(expr
->acc
.access
);
2173 dim
= isl_space_domain(dim
);
2174 dim
= isl_space_from_domain(dim
);
2175 dim
= isl_space_add_dims(dim
, isl_dim_out
, n
);
2176 map
= isl_map_universe(dim
);
2177 map
= isl_map_domain_map(map
);
2178 map
= isl_map_reverse(map
);
2179 expr
->acc
.access
= isl_map_apply_domain(expr
->acc
.access
, map
);
2181 for (int i
= nparam
- 1; i
>= 0; --i
) {
2182 isl_id
*id
= isl_map_get_dim_id(expr
->acc
.access
,
2184 if (!is_nested_parameter(id
)) {
2189 expr
->acc
.access
= isl_map_equate(expr
->acc
.access
,
2190 isl_dim_param
, i
, isl_dim_in
,
2191 n_in
+ param2pos
[i
]);
2192 expr
->acc
.access
= isl_map_project_out(expr
->acc
.access
,
2193 isl_dim_param
, i
, 1);
2200 pet_expr_free(expr
);
2204 /* Convert a top-level pet_expr to a pet_scop with one statement.
2205 * This mainly involves resolving nested expression parameters
2206 * and setting the name of the iteration space.
2207 * The name is given by "label" if it is non-NULL. Otherwise,
2208 * it is of the form S_<n_stmt>.
2210 struct pet_scop
*PetScan::extract(Stmt
*stmt
, struct pet_expr
*expr
,
2211 __isl_take isl_id
*label
)
2213 struct pet_stmt
*ps
;
2214 SourceLocation loc
= stmt
->getLocStart();
2215 int line
= PP
.getSourceManager().getExpansionLineNumber(loc
);
2217 expr
= resolve_nested(expr
);
2218 ps
= pet_stmt_from_pet_expr(ctx
, line
, label
, n_stmt
++, expr
);
2219 return pet_scop_from_pet_stmt(ctx
, ps
);
2222 /* Check whether "expr" is an affine expression.
2223 * We turn on autodetection so that we won't generate any warnings
2224 * and turn off nesting, so that we won't accept any non-affine constructs.
2226 bool PetScan::is_affine(Expr
*expr
)
2229 int save_autodetect
= autodetect
;
2230 bool save_nesting
= nesting_enabled
;
2233 nesting_enabled
= false;
2235 pwaff
= extract_affine(expr
);
2236 isl_pw_aff_free(pwaff
);
2238 autodetect
= save_autodetect
;
2239 nesting_enabled
= save_nesting
;
2241 return pwaff
!= NULL
;
2244 /* Check whether "expr" is an affine constraint.
2245 * We turn on autodetection so that we won't generate any warnings
2246 * and turn off nesting, so that we won't accept any non-affine constructs.
2248 bool PetScan::is_affine_condition(Expr
*expr
)
2251 int save_autodetect
= autodetect
;
2252 bool save_nesting
= nesting_enabled
;
2255 nesting_enabled
= false;
2257 set
= extract_condition(expr
);
2260 autodetect
= save_autodetect
;
2261 nesting_enabled
= save_nesting
;
2266 /* Check if we can extract a condition from "expr".
2267 * Return the condition as an isl_set if we can and NULL otherwise.
2268 * If allow_nested is set, then the condition may involve parameters
2269 * corresponding to nested accesses.
2270 * We turn on autodetection so that we won't generate any warnings.
2272 __isl_give isl_set
*PetScan::try_extract_nested_condition(Expr
*expr
)
2275 int save_autodetect
= autodetect
;
2276 bool save_nesting
= nesting_enabled
;
2279 nesting_enabled
= allow_nested
;
2280 set
= extract_condition(expr
);
2282 autodetect
= save_autodetect
;
2283 nesting_enabled
= save_nesting
;
2288 /* If the top-level expression of "stmt" is an assignment, then
2289 * return that assignment as a BinaryOperator.
2290 * Otherwise return NULL.
2292 static BinaryOperator
*top_assignment_or_null(Stmt
*stmt
)
2294 BinaryOperator
*ass
;
2298 if (stmt
->getStmtClass() != Stmt::BinaryOperatorClass
)
2301 ass
= cast
<BinaryOperator
>(stmt
);
2302 if(ass
->getOpcode() != BO_Assign
)
2308 /* Check if the given if statement is a conditional assignement
2309 * with a non-affine condition. If so, construct a pet_scop
2310 * corresponding to this conditional assignment. Otherwise return NULL.
2312 * In particular we check if "stmt" is of the form
2319 * where a is some array or scalar access.
2320 * The constructed pet_scop then corresponds to the expression
2322 * a = condition ? f(...) : g(...)
2324 * All access relations in f(...) are intersected with condition
2325 * while all access relation in g(...) are intersected with the complement.
2327 struct pet_scop
*PetScan::extract_conditional_assignment(IfStmt
*stmt
)
2329 BinaryOperator
*ass_then
, *ass_else
;
2330 isl_map
*write_then
, *write_else
;
2331 isl_set
*cond
, *comp
;
2332 isl_map
*map
, *map_true
, *map_false
;
2334 struct pet_expr
*pe_cond
, *pe_then
, *pe_else
, *pe
, *pe_write
;
2335 bool save_nesting
= nesting_enabled
;
2337 ass_then
= top_assignment_or_null(stmt
->getThen());
2338 ass_else
= top_assignment_or_null(stmt
->getElse());
2340 if (!ass_then
|| !ass_else
)
2343 if (is_affine_condition(stmt
->getCond()))
2346 write_then
= extract_access(ass_then
->getLHS());
2347 write_else
= extract_access(ass_else
->getLHS());
2349 equal
= isl_map_is_equal(write_then
, write_else
);
2350 isl_map_free(write_else
);
2351 if (equal
< 0 || !equal
) {
2352 isl_map_free(write_then
);
2356 nesting_enabled
= allow_nested
;
2357 cond
= extract_condition(stmt
->getCond());
2358 nesting_enabled
= save_nesting
;
2359 comp
= isl_set_complement(isl_set_copy(cond
));
2360 map_true
= isl_map_from_domain(isl_set_from_params(isl_set_copy(cond
)));
2361 map_true
= isl_map_add_dims(map_true
, isl_dim_out
, 1);
2362 map_true
= isl_map_fix_si(map_true
, isl_dim_out
, 0, 1);
2363 map_false
= isl_map_from_domain(isl_set_from_params(isl_set_copy(comp
)));
2364 map_false
= isl_map_add_dims(map_false
, isl_dim_out
, 1);
2365 map_false
= isl_map_fix_si(map_false
, isl_dim_out
, 0, 0);
2366 map
= isl_map_union_disjoint(map_true
, map_false
);
2368 pe_cond
= pet_expr_from_access(map
);
2370 pe_then
= extract_expr(ass_then
->getRHS());
2371 pe_then
= pet_expr_restrict(pe_then
, cond
);
2372 pe_else
= extract_expr(ass_else
->getRHS());
2373 pe_else
= pet_expr_restrict(pe_else
, comp
);
2375 pe
= pet_expr_new_ternary(ctx
, pe_cond
, pe_then
, pe_else
);
2376 pe_write
= pet_expr_from_access(write_then
);
2378 pe_write
->acc
.write
= 1;
2379 pe_write
->acc
.read
= 0;
2381 pe
= pet_expr_new_binary(ctx
, pet_op_assign
, pe_write
, pe
);
2382 return extract(stmt
, pe
);
2385 /* Create an access to a virtual array representing the result
2387 * Unlike other accessed data, the id of the array is NULL as
2388 * there is no ValueDecl in the program corresponding to the virtual
2390 * The array starts out as a scalar, but grows along with the
2391 * statement writing to the array in pet_scop_embed.
2393 static __isl_give isl_map
*create_test_access(isl_ctx
*ctx
, int test_nr
)
2395 isl_space
*dim
= isl_space_alloc(ctx
, 0, 0, 0);
2399 snprintf(name
, sizeof(name
), "__pet_test_%d", test_nr
);
2400 id
= isl_id_alloc(ctx
, name
, NULL
);
2401 dim
= isl_space_set_tuple_id(dim
, isl_dim_out
, id
);
2402 return isl_map_universe(dim
);
2405 /* Create a pet_scop with a single statement evaluating "cond"
2406 * and writing the result to a virtual scalar, as expressed by
2409 struct pet_scop
*PetScan::extract_non_affine_condition(Expr
*cond
,
2410 __isl_take isl_map
*access
)
2412 struct pet_expr
*expr
, *write
;
2413 struct pet_stmt
*ps
;
2414 SourceLocation loc
= cond
->getLocStart();
2415 int line
= PP
.getSourceManager().getExpansionLineNumber(loc
);
2417 write
= pet_expr_from_access(access
);
2419 write
->acc
.write
= 1;
2420 write
->acc
.read
= 0;
2422 expr
= extract_expr(cond
);
2423 expr
= pet_expr_new_binary(ctx
, pet_op_assign
, write
, expr
);
2424 ps
= pet_stmt_from_pet_expr(ctx
, line
, NULL
, n_stmt
++, expr
);
2425 return pet_scop_from_pet_stmt(ctx
, ps
);
2428 /* Add an array with the given extend ("access") to the list
2429 * of arrays in "scop" and return the extended pet_scop.
2430 * The array is marked as attaining values 0 and 1 only.
2432 static struct pet_scop
*scop_add_array(struct pet_scop
*scop
,
2433 __isl_keep isl_map
*access
)
2435 isl_ctx
*ctx
= isl_map_get_ctx(access
);
2437 struct pet_array
**arrays
;
2438 struct pet_array
*array
;
2445 arrays
= isl_realloc_array(ctx
, scop
->arrays
, struct pet_array
*,
2449 scop
->arrays
= arrays
;
2451 array
= isl_calloc_type(ctx
, struct pet_array
);
2455 array
->extent
= isl_map_range(isl_map_copy(access
));
2456 dim
= isl_space_params_alloc(ctx
, 0);
2457 array
->context
= isl_set_universe(dim
);
2458 dim
= isl_space_set_alloc(ctx
, 0, 1);
2459 array
->value_bounds
= isl_set_universe(dim
);
2460 array
->value_bounds
= isl_set_lower_bound_si(array
->value_bounds
,
2462 array
->value_bounds
= isl_set_upper_bound_si(array
->value_bounds
,
2464 array
->element_type
= strdup("int");
2466 scop
->arrays
[scop
->n_array
] = array
;
2469 if (!array
->extent
|| !array
->context
)
2474 pet_scop_free(scop
);
2479 static __isl_give isl_map
*embed_access(__isl_take isl_map
*access
,
2483 /* Apply the map pointed to by "user" to the domain of the access
2484 * relation, thereby embedding it in the range of the map.
2485 * The domain of both relations is the zero-dimensional domain.
2487 static __isl_give isl_map
*embed_access(__isl_take isl_map
*access
, void *user
)
2489 isl_map
*map
= (isl_map
*) user
;
2491 return isl_map_apply_domain(access
, isl_map_copy(map
));
2494 /* Apply "map" to all access relations in "expr".
2496 static struct pet_expr
*embed(struct pet_expr
*expr
, __isl_keep isl_map
*map
)
2498 return pet_expr_foreach_access(expr
, &embed_access
, map
);
2501 /* How many parameters of "set" refer to nested accesses, i.e., have no name?
2503 static int n_nested_parameter(__isl_keep isl_set
*set
)
2508 space
= isl_set_get_space(set
);
2509 n
= n_nested_parameter(space
);
2510 isl_space_free(space
);
2515 /* Remove all parameters from "map" that refer to nested accesses.
2517 static __isl_give isl_map
*remove_nested_parameters(__isl_take isl_map
*map
)
2522 space
= isl_map_get_space(map
);
2523 nparam
= isl_space_dim(space
, isl_dim_param
);
2524 for (int i
= nparam
- 1; i
>= 0; --i
)
2525 if (is_nested_parameter(space
, i
))
2526 map
= isl_map_project_out(map
, isl_dim_param
, i
, 1);
2527 isl_space_free(space
);
2533 static __isl_give isl_map
*access_remove_nested_parameters(
2534 __isl_take isl_map
*access
, void *user
);
2537 static __isl_give isl_map
*access_remove_nested_parameters(
2538 __isl_take isl_map
*access
, void *user
)
2540 return remove_nested_parameters(access
);
2543 /* Remove all nested access parameters from the schedule and all
2544 * accesses of "stmt".
2545 * There is no need to remove them from the domain as these parameters
2546 * have already been removed from the domain when this function is called.
2548 static struct pet_stmt
*remove_nested_parameters(struct pet_stmt
*stmt
)
2552 stmt
->schedule
= remove_nested_parameters(stmt
->schedule
);
2553 stmt
->body
= pet_expr_foreach_access(stmt
->body
,
2554 &access_remove_nested_parameters
, NULL
);
2555 if (!stmt
->schedule
|| !stmt
->body
)
2557 for (int i
= 0; i
< stmt
->n_arg
; ++i
) {
2558 stmt
->args
[i
] = pet_expr_foreach_access(stmt
->args
[i
],
2559 &access_remove_nested_parameters
, NULL
);
2566 pet_stmt_free(stmt
);
2570 /* For each nested access parameter in the domain of "stmt",
2571 * construct a corresponding pet_expr, place it in stmt->args and
2572 * record its position in "param2pos".
2573 * n is the number of nested access parameters.
2575 struct pet_stmt
*PetScan::extract_nested(struct pet_stmt
*stmt
, int n
,
2576 std::map
<int,int> ¶m2pos
)
2580 struct pet_expr
**args
;
2582 n_arg
= stmt
->n_arg
;
2583 args
= isl_realloc_array(ctx
, stmt
->args
, struct pet_expr
*, n_arg
+ n
);
2589 space
= isl_set_get_space(stmt
->domain
);
2590 n
= extract_nested(space
, n_arg
, stmt
->args
, param2pos
);
2591 isl_space_free(space
);
2599 pet_stmt_free(stmt
);
2603 /* Look for parameters in the iteration domain of "stmt" taht
2604 * refer to nested accesses. In particular, these are
2605 * parameters with no name.
2607 * If there are any such parameters, then as many extra variables
2608 * (after identifying identical nested accesses) are added to the
2609 * range of the map wrapped inside the domain.
2610 * If the original domain is not a wrapped map, then a new wrapped
2611 * map is created with zero output dimensions.
2612 * The parameters are then equated to the corresponding output dimensions
2613 * and subsequently projected out, from the iteration domain,
2614 * the schedule and the access relations.
2615 * For each of the output dimensions, a corresponding argument
2616 * expression is added. Initially they are created with
2617 * a zero-dimensional domain, so they have to be embedded
2618 * in the current iteration domain.
2619 * param2pos maps the position of the parameter to the position
2620 * of the corresponding output dimension in the wrapped map.
2622 struct pet_stmt
*PetScan::resolve_nested(struct pet_stmt
*stmt
)
2628 std::map
<int,int> param2pos
;
2633 n
= n_nested_parameter(stmt
->domain
);
2637 n_arg
= stmt
->n_arg
;
2638 stmt
= extract_nested(stmt
, n
, param2pos
);
2642 n
= stmt
->n_arg
- n_arg
;
2643 nparam
= isl_set_dim(stmt
->domain
, isl_dim_param
);
2644 if (isl_set_is_wrapping(stmt
->domain
))
2645 map
= isl_set_unwrap(stmt
->domain
);
2647 map
= isl_map_from_domain(stmt
->domain
);
2648 map
= isl_map_add_dims(map
, isl_dim_out
, n
);
2650 for (int i
= nparam
- 1; i
>= 0; --i
) {
2653 if (!is_nested_parameter(map
, i
))
2656 id
= isl_map_get_tuple_id(stmt
->args
[param2pos
[i
]]->acc
.access
,
2658 map
= isl_map_set_dim_id(map
, isl_dim_out
, param2pos
[i
], id
);
2659 map
= isl_map_equate(map
, isl_dim_param
, i
, isl_dim_out
,
2661 map
= isl_map_project_out(map
, isl_dim_param
, i
, 1);
2664 stmt
->domain
= isl_map_wrap(map
);
2666 map
= isl_set_unwrap(isl_set_copy(stmt
->domain
));
2667 map
= isl_map_from_range(isl_map_domain(map
));
2668 for (int pos
= n_arg
; pos
< stmt
->n_arg
; ++pos
)
2669 stmt
->args
[pos
] = embed(stmt
->args
[pos
], map
);
2672 stmt
= remove_nested_parameters(stmt
);
2676 pet_stmt_free(stmt
);
2680 /* For each statement in "scop", move the parameters that correspond
2681 * to nested access into the ranges of the domains and create
2682 * corresponding argument expressions.
2684 struct pet_scop
*PetScan::resolve_nested(struct pet_scop
*scop
)
2689 for (int i
= 0; i
< scop
->n_stmt
; ++i
) {
2690 scop
->stmts
[i
] = resolve_nested(scop
->stmts
[i
]);
2691 if (!scop
->stmts
[i
])
2697 pet_scop_free(scop
);
2701 /* Does "space" involve any parameters that refer to nested
2702 * accesses, i.e., parameters with no name?
2704 static bool has_nested(__isl_keep isl_space
*space
)
2708 nparam
= isl_space_dim(space
, isl_dim_param
);
2709 for (int i
= 0; i
< nparam
; ++i
)
2710 if (is_nested_parameter(space
, i
))
2716 /* Does "set" involve any parameters that refer to nested
2717 * accesses, i.e., parameters with no name?
2719 static bool has_nested(__isl_keep isl_set
*set
)
2724 space
= isl_set_get_space(set
);
2725 nested
= has_nested(space
);
2726 isl_space_free(space
);
2731 /* Given an access expression "expr", is the variable accessed by
2732 * "expr" assigned anywhere inside "scop"?
2734 static bool is_assigned(pet_expr
*expr
, pet_scop
*scop
)
2736 bool assigned
= false;
2739 id
= isl_map_get_tuple_id(expr
->acc
.access
, isl_dim_out
);
2740 assigned
= pet_scop_writes(scop
, id
);
2746 /* Are all nested access parameters in "set" allowed given "scop".
2747 * In particular, is none of them written by anywhere inside "scop".
2749 bool PetScan::is_nested_allowed(__isl_keep isl_set
*set
, pet_scop
*scop
)
2753 nparam
= isl_set_dim(set
, isl_dim_param
);
2754 for (int i
= 0; i
< nparam
; ++i
) {
2756 isl_id
*id
= isl_set_get_dim_id(set
, isl_dim_param
, i
);
2760 if (!is_nested_parameter(id
)) {
2765 nested
= (Expr
*) isl_id_get_user(id
);
2766 expr
= extract_expr(nested
);
2767 allowed
= expr
&& expr
->type
== pet_expr_access
&&
2768 !is_assigned(expr
, scop
);
2770 pet_expr_free(expr
);
2780 /* Construct a pet_scop for an if statement.
2782 * If the condition fits the pattern of a conditional assignment,
2783 * then it is handled by extract_conditional_assignment.
2784 * Otherwise, we do the following.
2786 * If the condition is affine, then the condition is added
2787 * to the iteration domains of the then branch, while the
2788 * opposite of the condition in added to the iteration domains
2789 * of the else branch, if any.
2790 * We allow the condition to be dynamic, i.e., to refer to
2791 * scalars or array elements that may be written to outside
2792 * of the given if statement. These nested accesses are then represented
2793 * as output dimensions in the wrapping iteration domain.
2794 * If it also written _inside_ the then or else branch, then
2795 * we treat the condition as non-affine.
2796 * As explained below, this will introduce an extra statement.
2797 * For aesthetic reasons, we want this statement to have a statement
2798 * number that is lower than those of the then and else branches.
2799 * In order to evaluate if will need such a statement, however, we
2800 * first construct scops for the then and else branches.
2801 * We therefore reserve a statement number if we might have to
2802 * introduce such an extra statement.
2804 * If the condition is not affine, then we create a separate
2805 * statement that write the result of the condition to a virtual scalar.
2806 * A constraint requiring the value of this virtual scalar to be one
2807 * is added to the iteration domains of the then branch.
2808 * Similarly, a constraint requiring the value of this virtual scalar
2809 * to be zero is added to the iteration domains of the else branch, if any.
2810 * We adjust the schedules to ensure that the virtual scalar is written
2811 * before it is read.
2813 struct pet_scop
*PetScan::extract(IfStmt
*stmt
)
2815 struct pet_scop
*scop_then
, *scop_else
, *scop
;
2816 assigned_value_cache
cache(assigned_value
);
2817 isl_map
*test_access
= NULL
;
2821 scop
= extract_conditional_assignment(stmt
);
2825 cond
= try_extract_nested_condition(stmt
->getCond());
2826 if (allow_nested
&& (!cond
|| has_nested(cond
)))
2829 scop_then
= extract(stmt
->getThen());
2831 if (stmt
->getElse()) {
2832 scop_else
= extract(stmt
->getElse());
2834 if (scop_then
&& !scop_else
) {
2839 if (!scop_then
&& scop_else
) {
2848 (!is_nested_allowed(cond
, scop_then
) ||
2849 (stmt
->getElse() && !is_nested_allowed(cond
, scop_else
)))) {
2853 if (allow_nested
&& !cond
) {
2854 int save_n_stmt
= n_stmt
;
2855 test_access
= create_test_access(ctx
, n_test
++);
2857 scop
= extract_non_affine_condition(stmt
->getCond(),
2858 isl_map_copy(test_access
));
2859 n_stmt
= save_n_stmt
;
2860 scop
= scop_add_array(scop
, test_access
);
2862 pet_scop_free(scop_then
);
2863 pet_scop_free(scop_else
);
2864 isl_map_free(test_access
);
2871 cond
= extract_condition(stmt
->getCond());
2872 scop
= pet_scop_restrict(scop_then
, isl_set_copy(cond
));
2874 if (stmt
->getElse()) {
2875 cond
= isl_set_complement(cond
);
2876 scop_else
= pet_scop_restrict(scop_else
, cond
);
2877 scop
= pet_scop_add(ctx
, scop
, scop_else
);
2880 scop
= resolve_nested(scop
);
2882 scop
= pet_scop_prefix(scop
, 0);
2883 scop_then
= pet_scop_prefix(scop_then
, 1);
2884 scop_then
= pet_scop_filter(scop_then
,
2885 isl_map_copy(test_access
), 1);
2886 scop
= pet_scop_add(ctx
, scop
, scop_then
);
2887 if (stmt
->getElse()) {
2888 scop_else
= pet_scop_prefix(scop_else
, 1);
2889 scop_else
= pet_scop_filter(scop_else
, test_access
, 0);
2890 scop
= pet_scop_add(ctx
, scop
, scop_else
);
2892 isl_map_free(test_access
);
2898 /* Try and construct a pet_scop for a label statement.
2899 * We currently only allow labels on expression statements.
2901 struct pet_scop
*PetScan::extract(LabelStmt
*stmt
)
2906 sub
= stmt
->getSubStmt();
2907 if (!isa
<Expr
>(sub
)) {
2912 label
= isl_id_alloc(ctx
, stmt
->getName(), NULL
);
2914 return extract(sub
, extract_expr(cast
<Expr
>(sub
)), label
);
2917 /* Try and construct a pet_scop corresponding to "stmt".
2919 struct pet_scop
*PetScan::extract(Stmt
*stmt
)
2921 if (isa
<Expr
>(stmt
))
2922 return extract(stmt
, extract_expr(cast
<Expr
>(stmt
)));
2924 switch (stmt
->getStmtClass()) {
2925 case Stmt::WhileStmtClass
:
2926 return extract(cast
<WhileStmt
>(stmt
));
2927 case Stmt::ForStmtClass
:
2928 return extract_for(cast
<ForStmt
>(stmt
));
2929 case Stmt::IfStmtClass
:
2930 return extract(cast
<IfStmt
>(stmt
));
2931 case Stmt::CompoundStmtClass
:
2932 return extract(cast
<CompoundStmt
>(stmt
));
2933 case Stmt::LabelStmtClass
:
2934 return extract(cast
<LabelStmt
>(stmt
));
2942 /* Try and construct a pet_scop corresponding to (part of)
2943 * a sequence of statements.
2945 struct pet_scop
*PetScan::extract(StmtRange stmt_range
)
2950 bool partial_range
= false;
2952 scop
= pet_scop_empty(ctx
);
2953 for (i
= stmt_range
.first
, j
= 0; i
!= stmt_range
.second
; ++i
, ++j
) {
2955 struct pet_scop
*scop_i
;
2956 scop_i
= extract(child
);
2957 if (scop
&& partial
) {
2958 pet_scop_free(scop_i
);
2961 scop_i
= pet_scop_prefix(scop_i
, j
);
2964 scop
= pet_scop_add(ctx
, scop
, scop_i
);
2966 partial_range
= true;
2967 if (scop
->n_stmt
!= 0 && !scop_i
)
2970 scop
= pet_scop_add(ctx
, scop
, scop_i
);
2976 if (scop
&& partial_range
)
2982 /* Check if the scop marked by the user is exactly this Stmt
2983 * or part of this Stmt.
2984 * If so, return a pet_scop corresponding to the marked region.
2985 * Otherwise, return NULL.
2987 struct pet_scop
*PetScan::scan(Stmt
*stmt
)
2989 SourceManager
&SM
= PP
.getSourceManager();
2990 unsigned start_off
, end_off
;
2992 start_off
= SM
.getFileOffset(stmt
->getLocStart());
2993 end_off
= SM
.getFileOffset(stmt
->getLocEnd());
2995 if (start_off
> loc
.end
)
2997 if (end_off
< loc
.start
)
2999 if (start_off
>= loc
.start
&& end_off
<= loc
.end
) {
3000 return extract(stmt
);
3004 for (start
= stmt
->child_begin(); start
!= stmt
->child_end(); ++start
) {
3005 Stmt
*child
= *start
;
3008 start_off
= SM
.getFileOffset(child
->getLocStart());
3009 end_off
= SM
.getFileOffset(child
->getLocEnd());
3010 if (start_off
< loc
.start
&& end_off
> loc
.end
)
3012 if (start_off
>= loc
.start
)
3017 for (end
= start
; end
!= stmt
->child_end(); ++end
) {
3019 start_off
= SM
.getFileOffset(child
->getLocStart());
3020 if (start_off
>= loc
.end
)
3024 return extract(StmtRange(start
, end
));
3027 /* Set the size of index "pos" of "array" to "size".
3028 * In particular, add a constraint of the form
3032 * to array->extent and a constraint of the form
3036 * to array->context.
3038 static struct pet_array
*update_size(struct pet_array
*array
, int pos
,
3039 __isl_take isl_pw_aff
*size
)
3049 valid
= isl_pw_aff_nonneg_set(isl_pw_aff_copy(size
));
3050 array
->context
= isl_set_intersect(array
->context
, valid
);
3052 dim
= isl_set_get_space(array
->extent
);
3053 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
3054 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, pos
, 1);
3055 univ
= isl_set_universe(isl_aff_get_domain_space(aff
));
3056 index
= isl_pw_aff_alloc(univ
, aff
);
3058 size
= isl_pw_aff_add_dims(size
, isl_dim_in
,
3059 isl_set_dim(array
->extent
, isl_dim_set
));
3060 id
= isl_set_get_tuple_id(array
->extent
);
3061 size
= isl_pw_aff_set_tuple_id(size
, isl_dim_in
, id
);
3062 bound
= isl_pw_aff_lt_set(index
, size
);
3064 array
->extent
= isl_set_intersect(array
->extent
, bound
);
3066 if (!array
->context
|| !array
->extent
)
3071 pet_array_free(array
);
3075 /* Figure out the size of the array at position "pos" and all
3076 * subsequent positions from "type" and update "array" accordingly.
3078 struct pet_array
*PetScan::set_upper_bounds(struct pet_array
*array
,
3079 const Type
*type
, int pos
)
3081 const ArrayType
*atype
;
3087 if (type
->isPointerType()) {
3088 type
= type
->getPointeeType().getTypePtr();
3089 return set_upper_bounds(array
, type
, pos
+ 1);
3091 if (!type
->isArrayType())
3094 type
= type
->getCanonicalTypeInternal().getTypePtr();
3095 atype
= cast
<ArrayType
>(type
);
3097 if (type
->isConstantArrayType()) {
3098 const ConstantArrayType
*ca
= cast
<ConstantArrayType
>(atype
);
3099 size
= extract_affine(ca
->getSize());
3100 array
= update_size(array
, pos
, size
);
3101 } else if (type
->isVariableArrayType()) {
3102 const VariableArrayType
*vla
= cast
<VariableArrayType
>(atype
);
3103 size
= extract_affine(vla
->getSizeExpr());
3104 array
= update_size(array
, pos
, size
);
3107 type
= atype
->getElementType().getTypePtr();
3109 return set_upper_bounds(array
, type
, pos
+ 1);
3112 /* Construct and return a pet_array corresponding to the variable "decl".
3113 * In particular, initialize array->extent to
3115 * { name[i_1,...,i_d] : i_1,...,i_d >= 0 }
3117 * and then call set_upper_bounds to set the upper bounds on the indices
3118 * based on the type of the variable.
3120 struct pet_array
*PetScan::extract_array(isl_ctx
*ctx
, ValueDecl
*decl
)
3122 struct pet_array
*array
;
3123 QualType qt
= decl
->getType();
3124 const Type
*type
= qt
.getTypePtr();
3125 int depth
= array_depth(type
);
3126 QualType base
= base_type(qt
);
3131 array
= isl_calloc_type(ctx
, struct pet_array
);
3135 id
= isl_id_alloc(ctx
, decl
->getName().str().c_str(), decl
);
3136 dim
= isl_space_set_alloc(ctx
, 0, depth
);
3137 dim
= isl_space_set_tuple_id(dim
, isl_dim_set
, id
);
3139 array
->extent
= isl_set_nat_universe(dim
);
3141 dim
= isl_space_params_alloc(ctx
, 0);
3142 array
->context
= isl_set_universe(dim
);
3144 array
= set_upper_bounds(array
, type
, 0);
3148 name
= base
.getAsString();
3149 array
->element_type
= strdup(name
.c_str());
3154 /* Construct a list of pet_arrays, one for each array (or scalar)
3155 * accessed inside "scop" add this list to "scop" and return the result.
3157 * The context of "scop" is updated with the intesection of
3158 * the contexts of all arrays, i.e., constraints on the parameters
3159 * that ensure that the arrays have a valid (non-negative) size.
3161 struct pet_scop
*PetScan::scan_arrays(struct pet_scop
*scop
)
3164 set
<ValueDecl
*> arrays
;
3165 set
<ValueDecl
*>::iterator it
;
3167 struct pet_array
**scop_arrays
;
3172 pet_scop_collect_arrays(scop
, arrays
);
3173 if (arrays
.size() == 0)
3176 n_array
= scop
->n_array
;
3178 scop_arrays
= isl_realloc_array(ctx
, scop
->arrays
, struct pet_array
*,
3179 n_array
+ arrays
.size());
3182 scop
->arrays
= scop_arrays
;
3184 for (it
= arrays
.begin(), i
= 0; it
!= arrays
.end(); ++it
, ++i
) {
3185 struct pet_array
*array
;
3186 scop
->arrays
[n_array
+ i
] = array
= extract_array(ctx
, *it
);
3187 if (!scop
->arrays
[n_array
+ i
])
3190 scop
->context
= isl_set_intersect(scop
->context
,
3191 isl_set_copy(array
->context
));
3198 pet_scop_free(scop
);
3202 /* Construct a pet_scop from the given function.
3204 struct pet_scop
*PetScan::scan(FunctionDecl
*fd
)
3209 stmt
= fd
->getBody();
3212 scop
= extract(stmt
);
3215 scop
= pet_scop_detect_parameter_accesses(scop
);
3216 scop
= scan_arrays(scop
);