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/ASTContext.h>
39 #include <clang/AST/ASTDiagnostic.h>
40 #include <clang/AST/Expr.h>
41 #include <clang/AST/RecursiveASTVisitor.h>
44 #include <isl/space.h>
51 #include "scop_plus.h"
56 using namespace clang
;
58 #if defined(DECLREFEXPR_CREATE_REQUIRES_BOOL)
59 static DeclRefExpr
*create_DeclRefExpr(VarDecl
*var
)
61 return DeclRefExpr::Create(var
->getASTContext(), var
->getQualifierLoc(),
62 SourceLocation(), var
, false, var
->getInnerLocStart(),
63 var
->getType(), VK_LValue
);
65 #elif defined(DECLREFEXPR_CREATE_REQUIRES_SOURCELOCATION)
66 static DeclRefExpr
*create_DeclRefExpr(VarDecl
*var
)
68 return DeclRefExpr::Create(var
->getASTContext(), var
->getQualifierLoc(),
69 SourceLocation(), var
, var
->getInnerLocStart(), var
->getType(),
73 static DeclRefExpr
*create_DeclRefExpr(VarDecl
*var
)
75 return DeclRefExpr::Create(var
->getASTContext(), var
->getQualifierLoc(),
76 var
, var
->getInnerLocStart(), var
->getType(), VK_LValue
);
80 /* Check if the element type corresponding to the given array type
81 * has a const qualifier.
83 static bool const_base(QualType qt
)
85 const Type
*type
= qt
.getTypePtr();
87 if (type
->isPointerType())
88 return const_base(type
->getPointeeType());
89 if (type
->isArrayType()) {
90 const ArrayType
*atype
;
91 type
= type
->getCanonicalTypeInternal().getTypePtr();
92 atype
= cast
<ArrayType
>(type
);
93 return const_base(atype
->getElementType());
96 return qt
.isConstQualified();
99 /* Mark "decl" as having an unknown value in "assigned_value".
101 * If no (known or unknown) value was assigned to "decl" before,
102 * then it may have been treated as a parameter before and may
103 * therefore appear in a value assigned to another variable.
104 * If so, this assignment needs to be turned into an unknown value too.
106 static void clear_assignment(map
<ValueDecl
*, isl_pw_aff
*> &assigned_value
,
109 map
<ValueDecl
*, isl_pw_aff
*>::iterator it
;
111 it
= assigned_value
.find(decl
);
113 assigned_value
[decl
] = NULL
;
115 if (it
== assigned_value
.end())
118 for (it
= assigned_value
.begin(); it
!= assigned_value
.end(); ++it
) {
119 isl_pw_aff
*pa
= it
->second
;
120 int nparam
= isl_pw_aff_dim(pa
, isl_dim_param
);
122 for (int i
= 0; i
< nparam
; ++i
) {
125 if (!isl_pw_aff_has_dim_id(pa
, isl_dim_param
, i
))
127 id
= isl_pw_aff_get_dim_id(pa
, isl_dim_param
, i
);
128 if (isl_id_get_user(id
) == decl
)
135 /* Look for any assignments to scalar variables in part of the parse
136 * tree and set assigned_value to NULL for each of them.
137 * Also reset assigned_value if the address of a scalar variable
138 * is being taken. As an exception, if the address is passed to a function
139 * that is declared to receive a const pointer, then assigned_value is
142 * This ensures that we won't use any previously stored value
143 * in the current subtree and its parents.
145 struct clear_assignments
: RecursiveASTVisitor
<clear_assignments
> {
146 map
<ValueDecl
*, isl_pw_aff
*> &assigned_value
;
147 set
<UnaryOperator
*> skip
;
149 clear_assignments(map
<ValueDecl
*, isl_pw_aff
*> &assigned_value
) :
150 assigned_value(assigned_value
) {}
152 /* Check for "address of" operators whose value is passed
153 * to a const pointer argument and add them to "skip", so that
154 * we can skip them in VisitUnaryOperator.
156 bool VisitCallExpr(CallExpr
*expr
) {
158 fd
= expr
->getDirectCallee();
161 for (int i
= 0; i
< expr
->getNumArgs(); ++i
) {
162 Expr
*arg
= expr
->getArg(i
);
164 if (arg
->getStmtClass() == Stmt::ImplicitCastExprClass
) {
165 ImplicitCastExpr
*ice
;
166 ice
= cast
<ImplicitCastExpr
>(arg
);
167 arg
= ice
->getSubExpr();
169 if (arg
->getStmtClass() != Stmt::UnaryOperatorClass
)
171 op
= cast
<UnaryOperator
>(arg
);
172 if (op
->getOpcode() != UO_AddrOf
)
174 if (const_base(fd
->getParamDecl(i
)->getType()))
180 bool VisitUnaryOperator(UnaryOperator
*expr
) {
185 switch (expr
->getOpcode()) {
195 if (skip
.find(expr
) != skip
.end())
198 arg
= expr
->getSubExpr();
199 if (arg
->getStmtClass() != Stmt::DeclRefExprClass
)
201 ref
= cast
<DeclRefExpr
>(arg
);
202 decl
= ref
->getDecl();
203 clear_assignment(assigned_value
, decl
);
207 bool VisitBinaryOperator(BinaryOperator
*expr
) {
212 if (!expr
->isAssignmentOp())
214 lhs
= expr
->getLHS();
215 if (lhs
->getStmtClass() != Stmt::DeclRefExprClass
)
217 ref
= cast
<DeclRefExpr
>(lhs
);
218 decl
= ref
->getDecl();
219 clear_assignment(assigned_value
, decl
);
224 /* Keep a copy of the currently assigned values.
226 * Any variable that is assigned a value inside the current scope
227 * is removed again when we leave the scope (either because it wasn't
228 * stored in the cache or because it has a different value in the cache).
230 struct assigned_value_cache
{
231 map
<ValueDecl
*, isl_pw_aff
*> &assigned_value
;
232 map
<ValueDecl
*, isl_pw_aff
*> cache
;
234 assigned_value_cache(map
<ValueDecl
*, isl_pw_aff
*> &assigned_value
) :
235 assigned_value(assigned_value
), cache(assigned_value
) {}
236 ~assigned_value_cache() {
237 map
<ValueDecl
*, isl_pw_aff
*>::iterator it
= cache
.begin();
238 for (it
= assigned_value
.begin(); it
!= assigned_value
.end();
241 (cache
.find(it
->first
) != cache
.end() &&
242 cache
[it
->first
] != it
->second
))
243 cache
[it
->first
] = NULL
;
245 assigned_value
= cache
;
249 /* Insert an expression into the collection of expressions,
250 * provided it is not already in there.
251 * The isl_pw_affs are freed in the destructor.
253 void PetScan::insert_expression(__isl_take isl_pw_aff
*expr
)
255 std::set
<isl_pw_aff
*>::iterator it
;
257 if (expressions
.find(expr
) == expressions
.end())
258 expressions
.insert(expr
);
260 isl_pw_aff_free(expr
);
265 std::set
<isl_pw_aff
*>::iterator it
;
267 for (it
= expressions
.begin(); it
!= expressions
.end(); ++it
)
268 isl_pw_aff_free(*it
);
270 isl_union_map_free(value_bounds
);
273 /* Called if we found something we (currently) cannot handle.
274 * We'll provide more informative warnings later.
276 * We only actually complain if autodetect is false.
278 void PetScan::unsupported(Stmt
*stmt
, const char *msg
)
280 if (options
->autodetect
)
283 SourceLocation loc
= stmt
->getLocStart();
284 DiagnosticsEngine
&diag
= PP
.getDiagnostics();
285 unsigned id
= diag
.getCustomDiagID(DiagnosticsEngine::Warning
,
286 msg
? msg
: "unsupported");
287 DiagnosticBuilder B
= diag
.Report(loc
, id
) << stmt
->getSourceRange();
290 /* Extract an integer from "expr" and store it in "v".
292 int PetScan::extract_int(IntegerLiteral
*expr
, isl_int
*v
)
294 const Type
*type
= expr
->getType().getTypePtr();
295 int is_signed
= type
->hasSignedIntegerRepresentation();
298 int64_t i
= expr
->getValue().getSExtValue();
299 isl_int_set_si(*v
, i
);
301 uint64_t i
= expr
->getValue().getZExtValue();
302 isl_int_set_ui(*v
, i
);
308 /* Extract an integer from "expr" and store it in "v".
309 * Return -1 if "expr" does not (obviously) represent an integer.
311 int PetScan::extract_int(clang::ParenExpr
*expr
, isl_int
*v
)
313 return extract_int(expr
->getSubExpr(), v
);
316 /* Extract an integer from "expr" and store it in "v".
317 * Return -1 if "expr" does not (obviously) represent an integer.
319 int PetScan::extract_int(clang::Expr
*expr
, isl_int
*v
)
321 if (expr
->getStmtClass() == Stmt::IntegerLiteralClass
)
322 return extract_int(cast
<IntegerLiteral
>(expr
), v
);
323 if (expr
->getStmtClass() == Stmt::ParenExprClass
)
324 return extract_int(cast
<ParenExpr
>(expr
), v
);
330 /* Extract an affine expression from the IntegerLiteral "expr".
332 __isl_give isl_pw_aff
*PetScan::extract_affine(IntegerLiteral
*expr
)
334 isl_space
*dim
= isl_space_params_alloc(ctx
, 0);
335 isl_local_space
*ls
= isl_local_space_from_space(isl_space_copy(dim
));
336 isl_aff
*aff
= isl_aff_zero_on_domain(ls
);
337 isl_set
*dom
= isl_set_universe(dim
);
341 extract_int(expr
, &v
);
342 aff
= isl_aff_add_constant(aff
, v
);
345 return isl_pw_aff_alloc(dom
, aff
);
348 /* Extract an affine expression from the APInt "val".
350 __isl_give isl_pw_aff
*PetScan::extract_affine(const llvm::APInt
&val
)
352 isl_space
*dim
= isl_space_params_alloc(ctx
, 0);
353 isl_local_space
*ls
= isl_local_space_from_space(isl_space_copy(dim
));
354 isl_aff
*aff
= isl_aff_zero_on_domain(ls
);
355 isl_set
*dom
= isl_set_universe(dim
);
359 isl_int_set_ui(v
, val
.getZExtValue());
360 aff
= isl_aff_add_constant(aff
, v
);
363 return isl_pw_aff_alloc(dom
, aff
);
366 __isl_give isl_pw_aff
*PetScan::extract_affine(ImplicitCastExpr
*expr
)
368 return extract_affine(expr
->getSubExpr());
371 static unsigned get_type_size(ValueDecl
*decl
)
373 return decl
->getASTContext().getIntWidth(decl
->getType());
376 /* Bound parameter "pos" of "set" to the possible values of "decl".
378 static __isl_give isl_set
*set_parameter_bounds(__isl_take isl_set
*set
,
379 unsigned pos
, ValueDecl
*decl
)
386 width
= get_type_size(decl
);
387 if (decl
->getType()->isUnsignedIntegerType()) {
388 set
= isl_set_lower_bound_si(set
, isl_dim_param
, pos
, 0);
389 isl_int_set_si(v
, 1);
390 isl_int_mul_2exp(v
, v
, width
);
391 isl_int_sub_ui(v
, v
, 1);
392 set
= isl_set_upper_bound(set
, isl_dim_param
, pos
, v
);
394 isl_int_set_si(v
, 1);
395 isl_int_mul_2exp(v
, v
, width
- 1);
396 isl_int_sub_ui(v
, v
, 1);
397 set
= isl_set_upper_bound(set
, isl_dim_param
, pos
, v
);
399 isl_int_sub_ui(v
, v
, 1);
400 set
= isl_set_lower_bound(set
, isl_dim_param
, pos
, v
);
408 /* Extract an affine expression from the DeclRefExpr "expr".
410 * If the variable has been assigned a value, then we check whether
411 * we know what (affine) value was assigned.
412 * If so, we return this value. Otherwise we convert "expr"
413 * to an extra parameter (provided nesting_enabled is set).
415 * Otherwise, we simply return an expression that is equal
416 * to a parameter corresponding to the referenced variable.
418 __isl_give isl_pw_aff
*PetScan::extract_affine(DeclRefExpr
*expr
)
420 ValueDecl
*decl
= expr
->getDecl();
421 const Type
*type
= decl
->getType().getTypePtr();
427 if (!type
->isIntegerType()) {
432 if (assigned_value
.find(decl
) != assigned_value
.end()) {
433 if (assigned_value
[decl
])
434 return isl_pw_aff_copy(assigned_value
[decl
]);
436 return nested_access(expr
);
439 id
= isl_id_alloc(ctx
, decl
->getName().str().c_str(), decl
);
440 dim
= isl_space_params_alloc(ctx
, 1);
442 dim
= isl_space_set_dim_id(dim
, isl_dim_param
, 0, id
);
444 dom
= isl_set_universe(isl_space_copy(dim
));
445 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
446 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_param
, 0, 1);
448 return isl_pw_aff_alloc(dom
, aff
);
451 /* Extract an affine expression from an integer division operation.
452 * In particular, if "expr" is lhs/rhs, then return
454 * lhs >= 0 ? floor(lhs/rhs) : ceil(lhs/rhs)
456 * The second argument (rhs) is required to be a (positive) integer constant.
458 __isl_give isl_pw_aff
*PetScan::extract_affine_div(BinaryOperator
*expr
)
461 isl_pw_aff
*rhs
, *lhs
;
463 rhs
= extract_affine(expr
->getRHS());
464 is_cst
= isl_pw_aff_is_cst(rhs
);
465 if (is_cst
< 0 || !is_cst
) {
466 isl_pw_aff_free(rhs
);
472 lhs
= extract_affine(expr
->getLHS());
474 return isl_pw_aff_tdiv_q(lhs
, rhs
);
477 /* Extract an affine expression from a modulo operation.
478 * In particular, if "expr" is lhs/rhs, then return
480 * lhs - rhs * (lhs >= 0 ? floor(lhs/rhs) : ceil(lhs/rhs))
482 * The second argument (rhs) is required to be a (positive) integer constant.
484 __isl_give isl_pw_aff
*PetScan::extract_affine_mod(BinaryOperator
*expr
)
487 isl_pw_aff
*rhs
, *lhs
;
489 rhs
= extract_affine(expr
->getRHS());
490 is_cst
= isl_pw_aff_is_cst(rhs
);
491 if (is_cst
< 0 || !is_cst
) {
492 isl_pw_aff_free(rhs
);
498 lhs
= extract_affine(expr
->getLHS());
500 return isl_pw_aff_tdiv_r(lhs
, rhs
);
503 /* Extract an affine expression from a multiplication operation.
504 * This is only allowed if at least one of the two arguments
505 * is a (piecewise) constant.
507 __isl_give isl_pw_aff
*PetScan::extract_affine_mul(BinaryOperator
*expr
)
512 lhs
= extract_affine(expr
->getLHS());
513 rhs
= extract_affine(expr
->getRHS());
515 if (!isl_pw_aff_is_cst(lhs
) && !isl_pw_aff_is_cst(rhs
)) {
516 isl_pw_aff_free(lhs
);
517 isl_pw_aff_free(rhs
);
522 return isl_pw_aff_mul(lhs
, rhs
);
525 /* Extract an affine expression from an addition or subtraction operation.
527 __isl_give isl_pw_aff
*PetScan::extract_affine_add(BinaryOperator
*expr
)
532 lhs
= extract_affine(expr
->getLHS());
533 rhs
= extract_affine(expr
->getRHS());
535 switch (expr
->getOpcode()) {
537 return isl_pw_aff_add(lhs
, rhs
);
539 return isl_pw_aff_sub(lhs
, rhs
);
541 isl_pw_aff_free(lhs
);
542 isl_pw_aff_free(rhs
);
552 static __isl_give isl_pw_aff
*wrap(__isl_take isl_pw_aff
*pwaff
,
558 isl_int_set_si(mod
, 1);
559 isl_int_mul_2exp(mod
, mod
, width
);
561 pwaff
= isl_pw_aff_mod(pwaff
, mod
);
568 /* Limit the domain of "pwaff" to those elements where the function
571 * 2^{width-1} <= pwaff < 2^{width-1}
573 static __isl_give isl_pw_aff
*avoid_overflow(__isl_take isl_pw_aff
*pwaff
,
577 isl_space
*space
= isl_pw_aff_get_domain_space(pwaff
);
578 isl_local_space
*ls
= isl_local_space_from_space(space
);
584 isl_int_set_si(v
, 1);
585 isl_int_mul_2exp(v
, v
, width
- 1);
587 bound
= isl_aff_zero_on_domain(ls
);
588 bound
= isl_aff_add_constant(bound
, v
);
589 b
= isl_pw_aff_from_aff(bound
);
591 dom
= isl_pw_aff_lt_set(isl_pw_aff_copy(pwaff
), isl_pw_aff_copy(b
));
592 pwaff
= isl_pw_aff_intersect_domain(pwaff
, dom
);
594 b
= isl_pw_aff_neg(b
);
595 dom
= isl_pw_aff_ge_set(isl_pw_aff_copy(pwaff
), b
);
596 pwaff
= isl_pw_aff_intersect_domain(pwaff
, dom
);
603 /* Handle potential overflows on signed computations.
605 * If options->signed_overflow is set to PET_OVERFLOW_AVOID,
606 * the we adjust the domain of "pa" to avoid overflows.
608 __isl_give isl_pw_aff
*PetScan::signed_overflow(__isl_take isl_pw_aff
*pa
,
611 if (options
->signed_overflow
== PET_OVERFLOW_AVOID
)
612 pa
= avoid_overflow(pa
, width
);
617 /* Return the piecewise affine expression "set ? 1 : 0" defined on "dom".
619 static __isl_give isl_pw_aff
*indicator_function(__isl_take isl_set
*set
,
620 __isl_take isl_set
*dom
)
623 pa
= isl_set_indicator_function(set
);
624 pa
= isl_pw_aff_intersect_domain(pa
, dom
);
628 /* Extract an affine expression from some binary operations.
629 * If the result of the expression is unsigned, then we wrap it
630 * based on the size of the type. Otherwise, we ensure that
631 * no overflow occurs.
633 __isl_give isl_pw_aff
*PetScan::extract_affine(BinaryOperator
*expr
)
638 switch (expr
->getOpcode()) {
641 res
= extract_affine_add(expr
);
644 res
= extract_affine_div(expr
);
647 res
= extract_affine_mod(expr
);
650 res
= extract_affine_mul(expr
);
660 return extract_condition(expr
);
666 width
= ast_context
.getIntWidth(expr
->getType());
667 if (expr
->getType()->isUnsignedIntegerType())
668 res
= wrap(res
, width
);
670 res
= signed_overflow(res
, width
);
675 /* Extract an affine expression from a negation operation.
677 __isl_give isl_pw_aff
*PetScan::extract_affine(UnaryOperator
*expr
)
679 if (expr
->getOpcode() == UO_Minus
)
680 return isl_pw_aff_neg(extract_affine(expr
->getSubExpr()));
681 if (expr
->getOpcode() == UO_LNot
)
682 return extract_condition(expr
);
688 __isl_give isl_pw_aff
*PetScan::extract_affine(ParenExpr
*expr
)
690 return extract_affine(expr
->getSubExpr());
693 /* Extract an affine expression from some special function calls.
694 * In particular, we handle "min", "max", "ceild" and "floord".
695 * In case of the latter two, the second argument needs to be
696 * a (positive) integer constant.
698 __isl_give isl_pw_aff
*PetScan::extract_affine(CallExpr
*expr
)
702 isl_pw_aff
*aff1
, *aff2
;
704 fd
= expr
->getDirectCallee();
710 name
= fd
->getDeclName().getAsString();
711 if (!(expr
->getNumArgs() == 2 && name
== "min") &&
712 !(expr
->getNumArgs() == 2 && name
== "max") &&
713 !(expr
->getNumArgs() == 2 && name
== "floord") &&
714 !(expr
->getNumArgs() == 2 && name
== "ceild")) {
719 if (name
== "min" || name
== "max") {
720 aff1
= extract_affine(expr
->getArg(0));
721 aff2
= extract_affine(expr
->getArg(1));
724 aff1
= isl_pw_aff_min(aff1
, aff2
);
726 aff1
= isl_pw_aff_max(aff1
, aff2
);
727 } else if (name
== "floord" || name
== "ceild") {
729 Expr
*arg2
= expr
->getArg(1);
731 if (arg2
->getStmtClass() != Stmt::IntegerLiteralClass
) {
735 aff1
= extract_affine(expr
->getArg(0));
737 extract_int(cast
<IntegerLiteral
>(arg2
), &v
);
738 aff1
= isl_pw_aff_scale_down(aff1
, v
);
740 if (name
== "floord")
741 aff1
= isl_pw_aff_floor(aff1
);
743 aff1
= isl_pw_aff_ceil(aff1
);
752 /* This method is called when we come across an access that is
753 * nested in what is supposed to be an affine expression.
754 * If nesting is allowed, we return a new parameter that corresponds
755 * to this nested access. Otherwise, we simply complain.
757 * Note that we currently don't allow nested accesses themselves
758 * to contain any nested accesses, so we check if we can extract
759 * the access without any nesting and complain if we can't.
761 * The new parameter is resolved in resolve_nested.
763 isl_pw_aff
*PetScan::nested_access(Expr
*expr
)
771 if (!nesting_enabled
) {
776 allow_nested
= false;
777 access
= extract_access(expr
);
783 isl_map_free(access
);
785 id
= isl_id_alloc(ctx
, NULL
, expr
);
786 dim
= isl_space_params_alloc(ctx
, 1);
788 dim
= isl_space_set_dim_id(dim
, isl_dim_param
, 0, id
);
790 dom
= isl_set_universe(isl_space_copy(dim
));
791 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
792 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_param
, 0, 1);
794 return isl_pw_aff_alloc(dom
, aff
);
797 /* Affine expressions are not supposed to contain array accesses,
798 * but if nesting is allowed, we return a parameter corresponding
799 * to the array access.
801 __isl_give isl_pw_aff
*PetScan::extract_affine(ArraySubscriptExpr
*expr
)
803 return nested_access(expr
);
806 /* Extract an affine expression from a conditional operation.
808 __isl_give isl_pw_aff
*PetScan::extract_affine(ConditionalOperator
*expr
)
810 isl_pw_aff
*cond
, *lhs
, *rhs
, *res
;
812 cond
= extract_condition(expr
->getCond());
813 lhs
= extract_affine(expr
->getTrueExpr());
814 rhs
= extract_affine(expr
->getFalseExpr());
816 return isl_pw_aff_cond(cond
, lhs
, rhs
);
819 /* Extract an affine expression, if possible, from "expr".
820 * Otherwise return NULL.
822 __isl_give isl_pw_aff
*PetScan::extract_affine(Expr
*expr
)
824 switch (expr
->getStmtClass()) {
825 case Stmt::ImplicitCastExprClass
:
826 return extract_affine(cast
<ImplicitCastExpr
>(expr
));
827 case Stmt::IntegerLiteralClass
:
828 return extract_affine(cast
<IntegerLiteral
>(expr
));
829 case Stmt::DeclRefExprClass
:
830 return extract_affine(cast
<DeclRefExpr
>(expr
));
831 case Stmt::BinaryOperatorClass
:
832 return extract_affine(cast
<BinaryOperator
>(expr
));
833 case Stmt::UnaryOperatorClass
:
834 return extract_affine(cast
<UnaryOperator
>(expr
));
835 case Stmt::ParenExprClass
:
836 return extract_affine(cast
<ParenExpr
>(expr
));
837 case Stmt::CallExprClass
:
838 return extract_affine(cast
<CallExpr
>(expr
));
839 case Stmt::ArraySubscriptExprClass
:
840 return extract_affine(cast
<ArraySubscriptExpr
>(expr
));
841 case Stmt::ConditionalOperatorClass
:
842 return extract_affine(cast
<ConditionalOperator
>(expr
));
849 __isl_give isl_map
*PetScan::extract_access(ImplicitCastExpr
*expr
)
851 return extract_access(expr
->getSubExpr());
854 /* Return the depth of an array of the given type.
856 static int array_depth(const Type
*type
)
858 if (type
->isPointerType())
859 return 1 + array_depth(type
->getPointeeType().getTypePtr());
860 if (type
->isArrayType()) {
861 const ArrayType
*atype
;
862 type
= type
->getCanonicalTypeInternal().getTypePtr();
863 atype
= cast
<ArrayType
>(type
);
864 return 1 + array_depth(atype
->getElementType().getTypePtr());
869 /* Return the element type of the given array type.
871 static QualType
base_type(QualType qt
)
873 const Type
*type
= qt
.getTypePtr();
875 if (type
->isPointerType())
876 return base_type(type
->getPointeeType());
877 if (type
->isArrayType()) {
878 const ArrayType
*atype
;
879 type
= type
->getCanonicalTypeInternal().getTypePtr();
880 atype
= cast
<ArrayType
>(type
);
881 return base_type(atype
->getElementType());
886 /* Extract an access relation from a reference to a variable.
887 * If the variable has name "A" and its type corresponds to an
888 * array of depth d, then the returned access relation is of the
891 * { [] -> A[i_1,...,i_d] }
893 __isl_give isl_map
*PetScan::extract_access(DeclRefExpr
*expr
)
895 ValueDecl
*decl
= expr
->getDecl();
896 int depth
= array_depth(decl
->getType().getTypePtr());
897 isl_id
*id
= isl_id_alloc(ctx
, decl
->getName().str().c_str(), decl
);
898 isl_space
*dim
= isl_space_alloc(ctx
, 0, 0, depth
);
901 dim
= isl_space_set_tuple_id(dim
, isl_dim_out
, id
);
903 access_rel
= isl_map_universe(dim
);
908 /* Extract an access relation from an integer contant.
909 * If the value of the constant is "v", then the returned access relation
914 __isl_give isl_map
*PetScan::extract_access(IntegerLiteral
*expr
)
916 return isl_map_from_range(isl_set_from_pw_aff(extract_affine(expr
)));
919 /* Try and extract an access relation from the given Expr.
920 * Return NULL if it doesn't work out.
922 __isl_give isl_map
*PetScan::extract_access(Expr
*expr
)
924 switch (expr
->getStmtClass()) {
925 case Stmt::ImplicitCastExprClass
:
926 return extract_access(cast
<ImplicitCastExpr
>(expr
));
927 case Stmt::DeclRefExprClass
:
928 return extract_access(cast
<DeclRefExpr
>(expr
));
929 case Stmt::ArraySubscriptExprClass
:
930 return extract_access(cast
<ArraySubscriptExpr
>(expr
));
931 case Stmt::IntegerLiteralClass
:
932 return extract_access(cast
<IntegerLiteral
>(expr
));
939 /* Assign the affine expression "index" to the output dimension "pos" of "map",
940 * restrict the domain to those values that result in a non-negative index
941 * and return the result.
943 __isl_give isl_map
*set_index(__isl_take isl_map
*map
, int pos
,
944 __isl_take isl_pw_aff
*index
)
947 int len
= isl_map_dim(map
, isl_dim_out
);
951 domain
= isl_pw_aff_nonneg_set(isl_pw_aff_copy(index
));
952 index
= isl_pw_aff_intersect_domain(index
, domain
);
953 index_map
= isl_map_from_range(isl_set_from_pw_aff(index
));
954 index_map
= isl_map_insert_dims(index_map
, isl_dim_out
, 0, pos
);
955 index_map
= isl_map_add_dims(index_map
, isl_dim_out
, len
- pos
- 1);
956 id
= isl_map_get_tuple_id(map
, isl_dim_out
);
957 index_map
= isl_map_set_tuple_id(index_map
, isl_dim_out
, id
);
959 map
= isl_map_intersect(map
, index_map
);
964 /* Extract an access relation from the given array subscript expression.
965 * If nesting is allowed in general, then we turn it on while
966 * examining the index expression.
968 * We first extract an access relation from the base.
969 * This will result in an access relation with a range that corresponds
970 * to the array being accessed and with earlier indices filled in already.
971 * We then extract the current index and fill that in as well.
972 * The position of the current index is based on the type of base.
973 * If base is the actual array variable, then the depth of this type
974 * will be the same as the depth of the array and we will fill in
975 * the first array index.
976 * Otherwise, the depth of the base type will be smaller and we will fill
979 __isl_give isl_map
*PetScan::extract_access(ArraySubscriptExpr
*expr
)
981 Expr
*base
= expr
->getBase();
982 Expr
*idx
= expr
->getIdx();
984 isl_map
*base_access
;
986 int depth
= array_depth(base
->getType().getTypePtr());
988 bool save_nesting
= nesting_enabled
;
990 nesting_enabled
= allow_nested
;
992 base_access
= extract_access(base
);
993 index
= extract_affine(idx
);
995 nesting_enabled
= save_nesting
;
997 pos
= isl_map_dim(base_access
, isl_dim_out
) - depth
;
998 access
= set_index(base_access
, pos
, index
);
1003 /* Check if "expr" calls function "minmax" with two arguments and if so
1004 * make lhs and rhs refer to these two arguments.
1006 static bool is_minmax(Expr
*expr
, const char *minmax
, Expr
*&lhs
, Expr
*&rhs
)
1012 if (expr
->getStmtClass() != Stmt::CallExprClass
)
1015 call
= cast
<CallExpr
>(expr
);
1016 fd
= call
->getDirectCallee();
1020 if (call
->getNumArgs() != 2)
1023 name
= fd
->getDeclName().getAsString();
1027 lhs
= call
->getArg(0);
1028 rhs
= call
->getArg(1);
1033 /* Check if "expr" is of the form min(lhs, rhs) and if so make
1034 * lhs and rhs refer to the two arguments.
1036 static bool is_min(Expr
*expr
, Expr
*&lhs
, Expr
*&rhs
)
1038 return is_minmax(expr
, "min", lhs
, rhs
);
1041 /* Check if "expr" is of the form max(lhs, rhs) and if so make
1042 * lhs and rhs refer to the two arguments.
1044 static bool is_max(Expr
*expr
, Expr
*&lhs
, Expr
*&rhs
)
1046 return is_minmax(expr
, "max", lhs
, rhs
);
1049 /* Return "lhs && rhs", defined on the shared definition domain.
1051 static __isl_give isl_pw_aff
*pw_aff_and(__isl_take isl_pw_aff
*lhs
,
1052 __isl_take isl_pw_aff
*rhs
)
1057 dom
= isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(lhs
)),
1058 isl_pw_aff_domain(isl_pw_aff_copy(rhs
)));
1059 cond
= isl_set_intersect(isl_pw_aff_non_zero_set(lhs
),
1060 isl_pw_aff_non_zero_set(rhs
));
1061 return indicator_function(cond
, dom
);
1064 /* Return "lhs && rhs", with shortcut semantics.
1065 * That is, if lhs is false, then the result is defined even if rhs is not.
1066 * In practice, we compute lhs ? rhs : lhs.
1068 static __isl_give isl_pw_aff
*pw_aff_and_then(__isl_take isl_pw_aff
*lhs
,
1069 __isl_take isl_pw_aff
*rhs
)
1071 return isl_pw_aff_cond(isl_pw_aff_copy(lhs
), rhs
, lhs
);
1074 /* Return "lhs || rhs", with shortcut semantics.
1075 * That is, if lhs is true, then the result is defined even if rhs is not.
1076 * In practice, we compute lhs ? lhs : rhs.
1078 static __isl_give isl_pw_aff
*pw_aff_or_else(__isl_take isl_pw_aff
*lhs
,
1079 __isl_take isl_pw_aff
*rhs
)
1081 return isl_pw_aff_cond(isl_pw_aff_copy(lhs
), lhs
, rhs
);
1084 /* Extract an affine expressions representing the comparison "LHS op RHS"
1085 * "comp" is the original statement that "LHS op RHS" is derived from
1086 * and is used for diagnostics.
1088 * If the comparison is of the form
1092 * then the expression is constructed as the conjunction of
1097 * A similar optimization is performed for max(a,b) <= c.
1098 * We do this because that will lead to simpler representations
1099 * of the expression.
1100 * If isl is ever enhanced to explicitly deal with min and max expressions,
1101 * this optimization can be removed.
1103 __isl_give isl_pw_aff
*PetScan::extract_comparison(BinaryOperatorKind op
,
1104 Expr
*LHS
, Expr
*RHS
, Stmt
*comp
)
1113 return extract_comparison(BO_LT
, RHS
, LHS
, comp
);
1115 return extract_comparison(BO_LE
, RHS
, LHS
, comp
);
1117 if (op
== BO_LT
|| op
== BO_LE
) {
1118 Expr
*expr1
, *expr2
;
1119 if (is_min(RHS
, expr1
, expr2
)) {
1120 lhs
= extract_comparison(op
, LHS
, expr1
, comp
);
1121 rhs
= extract_comparison(op
, LHS
, expr2
, comp
);
1122 return pw_aff_and(lhs
, rhs
);
1124 if (is_max(LHS
, expr1
, expr2
)) {
1125 lhs
= extract_comparison(op
, expr1
, RHS
, comp
);
1126 rhs
= extract_comparison(op
, expr2
, RHS
, comp
);
1127 return pw_aff_and(lhs
, rhs
);
1131 lhs
= extract_affine(LHS
);
1132 rhs
= extract_affine(RHS
);
1134 dom
= isl_pw_aff_domain(isl_pw_aff_copy(lhs
));
1135 dom
= isl_set_intersect(dom
, isl_pw_aff_domain(isl_pw_aff_copy(rhs
)));
1139 cond
= isl_pw_aff_lt_set(lhs
, rhs
);
1142 cond
= isl_pw_aff_le_set(lhs
, rhs
);
1145 cond
= isl_pw_aff_eq_set(lhs
, rhs
);
1148 cond
= isl_pw_aff_ne_set(lhs
, rhs
);
1151 isl_pw_aff_free(lhs
);
1152 isl_pw_aff_free(rhs
);
1158 cond
= isl_set_coalesce(cond
);
1159 res
= indicator_function(cond
, dom
);
1164 __isl_give isl_pw_aff
*PetScan::extract_comparison(BinaryOperator
*comp
)
1166 return extract_comparison(comp
->getOpcode(), comp
->getLHS(),
1167 comp
->getRHS(), comp
);
1170 /* Extract an affine expression representing the negation (logical not)
1171 * of a subexpression.
1173 __isl_give isl_pw_aff
*PetScan::extract_boolean(UnaryOperator
*op
)
1175 isl_set
*set_cond
, *dom
;
1176 isl_pw_aff
*cond
, *res
;
1178 cond
= extract_condition(op
->getSubExpr());
1180 dom
= isl_pw_aff_domain(isl_pw_aff_copy(cond
));
1182 set_cond
= isl_pw_aff_zero_set(cond
);
1184 res
= indicator_function(set_cond
, dom
);
1189 /* Extract an affine expression representing the disjunction (logical or)
1190 * or conjunction (logical and) of two subexpressions.
1192 __isl_give isl_pw_aff
*PetScan::extract_boolean(BinaryOperator
*comp
)
1194 isl_pw_aff
*lhs
, *rhs
;
1196 lhs
= extract_condition(comp
->getLHS());
1197 rhs
= extract_condition(comp
->getRHS());
1199 switch (comp
->getOpcode()) {
1201 return pw_aff_and_then(lhs
, rhs
);
1203 return pw_aff_or_else(lhs
, rhs
);
1205 isl_pw_aff_free(lhs
);
1206 isl_pw_aff_free(rhs
);
1213 __isl_give isl_pw_aff
*PetScan::extract_condition(UnaryOperator
*expr
)
1215 switch (expr
->getOpcode()) {
1217 return extract_boolean(expr
);
1224 /* Extract the affine expression "expr != 0 ? 1 : 0".
1226 __isl_give isl_pw_aff
*PetScan::extract_implicit_condition(Expr
*expr
)
1231 res
= extract_affine(expr
);
1233 dom
= isl_pw_aff_domain(isl_pw_aff_copy(res
));
1234 set
= isl_pw_aff_non_zero_set(res
);
1236 res
= indicator_function(set
, dom
);
1241 /* Extract an affine expression from a boolean expression.
1242 * In particular, return the expression "expr ? 1 : 0".
1244 * If the expression doesn't look like a condition, we assume it
1245 * is an affine expression and return the condition "expr != 0 ? 1 : 0".
1247 __isl_give isl_pw_aff
*PetScan::extract_condition(Expr
*expr
)
1249 BinaryOperator
*comp
;
1252 isl_set
*u
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
1253 return indicator_function(u
, isl_set_copy(u
));
1256 if (expr
->getStmtClass() == Stmt::ParenExprClass
)
1257 return extract_condition(cast
<ParenExpr
>(expr
)->getSubExpr());
1259 if (expr
->getStmtClass() == Stmt::UnaryOperatorClass
)
1260 return extract_condition(cast
<UnaryOperator
>(expr
));
1262 if (expr
->getStmtClass() != Stmt::BinaryOperatorClass
)
1263 return extract_implicit_condition(expr
);
1265 comp
= cast
<BinaryOperator
>(expr
);
1266 switch (comp
->getOpcode()) {
1273 return extract_comparison(comp
);
1276 return extract_boolean(comp
);
1278 return extract_implicit_condition(expr
);
1282 static enum pet_op_type
UnaryOperatorKind2pet_op_type(UnaryOperatorKind kind
)
1286 return pet_op_minus
;
1288 return pet_op_post_inc
;
1290 return pet_op_post_dec
;
1292 return pet_op_pre_inc
;
1294 return pet_op_pre_dec
;
1300 static enum pet_op_type
BinaryOperatorKind2pet_op_type(BinaryOperatorKind kind
)
1304 return pet_op_add_assign
;
1306 return pet_op_sub_assign
;
1308 return pet_op_mul_assign
;
1310 return pet_op_div_assign
;
1312 return pet_op_assign
;
1336 /* Construct a pet_expr representing a unary operator expression.
1338 struct pet_expr
*PetScan::extract_expr(UnaryOperator
*expr
)
1340 struct pet_expr
*arg
;
1341 enum pet_op_type op
;
1343 op
= UnaryOperatorKind2pet_op_type(expr
->getOpcode());
1344 if (op
== pet_op_last
) {
1349 arg
= extract_expr(expr
->getSubExpr());
1351 if (expr
->isIncrementDecrementOp() &&
1352 arg
&& arg
->type
== pet_expr_access
) {
1357 return pet_expr_new_unary(ctx
, op
, arg
);
1360 /* Mark the given access pet_expr as a write.
1361 * If a scalar is being accessed, then mark its value
1362 * as unknown in assigned_value.
1364 void PetScan::mark_write(struct pet_expr
*access
)
1372 access
->acc
.write
= 1;
1373 access
->acc
.read
= 0;
1375 if (isl_map_dim(access
->acc
.access
, isl_dim_out
) != 0)
1378 id
= isl_map_get_tuple_id(access
->acc
.access
, isl_dim_out
);
1379 decl
= (ValueDecl
*) isl_id_get_user(id
);
1380 clear_assignment(assigned_value
, decl
);
1384 /* Assign "rhs" to "lhs".
1386 * In particular, if "lhs" is a scalar variable, then mark
1387 * the variable as having been assigned. If, furthermore, "rhs"
1388 * is an affine expression, then keep track of this value in assigned_value
1389 * so that we can plug it in when we later come across the same variable.
1391 void PetScan::assign(struct pet_expr
*lhs
, Expr
*rhs
)
1399 if (lhs
->type
!= pet_expr_access
)
1401 if (isl_map_dim(lhs
->acc
.access
, isl_dim_out
) != 0)
1404 id
= isl_map_get_tuple_id(lhs
->acc
.access
, isl_dim_out
);
1405 decl
= (ValueDecl
*) isl_id_get_user(id
);
1408 pa
= try_extract_affine(rhs
);
1409 clear_assignment(assigned_value
, decl
);
1412 assigned_value
[decl
] = pa
;
1413 insert_expression(pa
);
1416 /* Construct a pet_expr representing a binary operator expression.
1418 * If the top level operator is an assignment and the LHS is an access,
1419 * then we mark that access as a write. If the operator is a compound
1420 * assignment, the access is marked as both a read and a write.
1422 * If "expr" assigns something to a scalar variable, then we mark
1423 * the variable as having been assigned. If, furthermore, the expression
1424 * is affine, then keep track of this value in assigned_value
1425 * so that we can plug it in when we later come across the same variable.
1427 struct pet_expr
*PetScan::extract_expr(BinaryOperator
*expr
)
1429 struct pet_expr
*lhs
, *rhs
;
1430 enum pet_op_type op
;
1432 op
= BinaryOperatorKind2pet_op_type(expr
->getOpcode());
1433 if (op
== pet_op_last
) {
1438 lhs
= extract_expr(expr
->getLHS());
1439 rhs
= extract_expr(expr
->getRHS());
1441 if (expr
->isAssignmentOp() && lhs
&& lhs
->type
== pet_expr_access
) {
1443 if (expr
->isCompoundAssignmentOp())
1447 if (expr
->getOpcode() == BO_Assign
)
1448 assign(lhs
, expr
->getRHS());
1450 return pet_expr_new_binary(ctx
, op
, lhs
, rhs
);
1453 /* Construct a pet_expr representing a conditional operation.
1455 * We first try to extract the condition as an affine expression.
1456 * If that fails, we construct a pet_expr tree representing the condition.
1458 struct pet_expr
*PetScan::extract_expr(ConditionalOperator
*expr
)
1460 struct pet_expr
*cond
, *lhs
, *rhs
;
1463 pa
= try_extract_affine(expr
->getCond());
1465 isl_set
*test
= isl_set_from_pw_aff(pa
);
1466 cond
= pet_expr_from_access(isl_map_from_range(test
));
1468 cond
= extract_expr(expr
->getCond());
1469 lhs
= extract_expr(expr
->getTrueExpr());
1470 rhs
= extract_expr(expr
->getFalseExpr());
1472 return pet_expr_new_ternary(ctx
, cond
, lhs
, rhs
);
1475 struct pet_expr
*PetScan::extract_expr(ImplicitCastExpr
*expr
)
1477 return extract_expr(expr
->getSubExpr());
1480 /* Construct a pet_expr representing a floating point value.
1482 struct pet_expr
*PetScan::extract_expr(FloatingLiteral
*expr
)
1484 return pet_expr_new_double(ctx
, expr
->getValueAsApproximateDouble());
1487 /* Extract an access relation from "expr" and then convert it into
1490 struct pet_expr
*PetScan::extract_access_expr(Expr
*expr
)
1493 struct pet_expr
*pe
;
1495 access
= extract_access(expr
);
1497 pe
= pet_expr_from_access(access
);
1502 struct pet_expr
*PetScan::extract_expr(ParenExpr
*expr
)
1504 return extract_expr(expr
->getSubExpr());
1507 /* Construct a pet_expr representing a function call.
1509 * If we are passing along a pointer to an array element
1510 * or an entire row or even higher dimensional slice of an array,
1511 * then the function being called may write into the array.
1513 * We assume here that if the function is declared to take a pointer
1514 * to a const type, then the function will perform a read
1515 * and that otherwise, it will perform a write.
1517 struct pet_expr
*PetScan::extract_expr(CallExpr
*expr
)
1519 struct pet_expr
*res
= NULL
;
1523 fd
= expr
->getDirectCallee();
1529 name
= fd
->getDeclName().getAsString();
1530 res
= pet_expr_new_call(ctx
, name
.c_str(), expr
->getNumArgs());
1534 for (int i
= 0; i
< expr
->getNumArgs(); ++i
) {
1535 Expr
*arg
= expr
->getArg(i
);
1539 if (arg
->getStmtClass() == Stmt::ImplicitCastExprClass
) {
1540 ImplicitCastExpr
*ice
= cast
<ImplicitCastExpr
>(arg
);
1541 arg
= ice
->getSubExpr();
1543 if (arg
->getStmtClass() == Stmt::UnaryOperatorClass
) {
1544 UnaryOperator
*op
= cast
<UnaryOperator
>(arg
);
1545 if (op
->getOpcode() == UO_AddrOf
) {
1547 arg
= op
->getSubExpr();
1550 res
->args
[i
] = PetScan::extract_expr(arg
);
1551 main_arg
= res
->args
[i
];
1553 res
->args
[i
] = pet_expr_new_unary(ctx
,
1554 pet_op_address_of
, res
->args
[i
]);
1557 if (arg
->getStmtClass() == Stmt::ArraySubscriptExprClass
&&
1558 array_depth(arg
->getType().getTypePtr()) > 0)
1560 if (is_addr
&& main_arg
->type
== pet_expr_access
) {
1562 if (!fd
->hasPrototype()) {
1563 unsupported(expr
, "prototype required");
1566 parm
= fd
->getParamDecl(i
);
1567 if (!const_base(parm
->getType()))
1568 mark_write(main_arg
);
1578 /* Try and onstruct a pet_expr representing "expr".
1580 struct pet_expr
*PetScan::extract_expr(Expr
*expr
)
1582 switch (expr
->getStmtClass()) {
1583 case Stmt::UnaryOperatorClass
:
1584 return extract_expr(cast
<UnaryOperator
>(expr
));
1585 case Stmt::CompoundAssignOperatorClass
:
1586 case Stmt::BinaryOperatorClass
:
1587 return extract_expr(cast
<BinaryOperator
>(expr
));
1588 case Stmt::ImplicitCastExprClass
:
1589 return extract_expr(cast
<ImplicitCastExpr
>(expr
));
1590 case Stmt::ArraySubscriptExprClass
:
1591 case Stmt::DeclRefExprClass
:
1592 case Stmt::IntegerLiteralClass
:
1593 return extract_access_expr(expr
);
1594 case Stmt::FloatingLiteralClass
:
1595 return extract_expr(cast
<FloatingLiteral
>(expr
));
1596 case Stmt::ParenExprClass
:
1597 return extract_expr(cast
<ParenExpr
>(expr
));
1598 case Stmt::ConditionalOperatorClass
:
1599 return extract_expr(cast
<ConditionalOperator
>(expr
));
1600 case Stmt::CallExprClass
:
1601 return extract_expr(cast
<CallExpr
>(expr
));
1608 /* Check if the given initialization statement is an assignment.
1609 * If so, return that assignment. Otherwise return NULL.
1611 BinaryOperator
*PetScan::initialization_assignment(Stmt
*init
)
1613 BinaryOperator
*ass
;
1615 if (init
->getStmtClass() != Stmt::BinaryOperatorClass
)
1618 ass
= cast
<BinaryOperator
>(init
);
1619 if (ass
->getOpcode() != BO_Assign
)
1625 /* Check if the given initialization statement is a declaration
1626 * of a single variable.
1627 * If so, return that declaration. Otherwise return NULL.
1629 Decl
*PetScan::initialization_declaration(Stmt
*init
)
1633 if (init
->getStmtClass() != Stmt::DeclStmtClass
)
1636 decl
= cast
<DeclStmt
>(init
);
1638 if (!decl
->isSingleDecl())
1641 return decl
->getSingleDecl();
1644 /* Given the assignment operator in the initialization of a for loop,
1645 * extract the induction variable, i.e., the (integer)variable being
1648 ValueDecl
*PetScan::extract_induction_variable(BinaryOperator
*init
)
1655 lhs
= init
->getLHS();
1656 if (lhs
->getStmtClass() != Stmt::DeclRefExprClass
) {
1661 ref
= cast
<DeclRefExpr
>(lhs
);
1662 decl
= ref
->getDecl();
1663 type
= decl
->getType().getTypePtr();
1665 if (!type
->isIntegerType()) {
1673 /* Given the initialization statement of a for loop and the single
1674 * declaration in this initialization statement,
1675 * extract the induction variable, i.e., the (integer) variable being
1678 VarDecl
*PetScan::extract_induction_variable(Stmt
*init
, Decl
*decl
)
1682 vd
= cast
<VarDecl
>(decl
);
1684 const QualType type
= vd
->getType();
1685 if (!type
->isIntegerType()) {
1690 if (!vd
->getInit()) {
1698 /* Check that op is of the form iv++ or iv--.
1699 * Return an affine expression "1" or "-1" accordingly.
1701 __isl_give isl_pw_aff
*PetScan::extract_unary_increment(
1702 clang::UnaryOperator
*op
, clang::ValueDecl
*iv
)
1709 if (!op
->isIncrementDecrementOp()) {
1714 sub
= op
->getSubExpr();
1715 if (sub
->getStmtClass() != Stmt::DeclRefExprClass
) {
1720 ref
= cast
<DeclRefExpr
>(sub
);
1721 if (ref
->getDecl() != iv
) {
1726 space
= isl_space_params_alloc(ctx
, 0);
1727 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(space
));
1729 if (op
->isIncrementOp())
1730 aff
= isl_aff_add_constant_si(aff
, 1);
1732 aff
= isl_aff_add_constant_si(aff
, -1);
1734 return isl_pw_aff_from_aff(aff
);
1737 /* If the isl_pw_aff on which isl_pw_aff_foreach_piece is called
1738 * has a single constant expression, then put this constant in *user.
1739 * The caller is assumed to have checked that this function will
1740 * be called exactly once.
1742 static int extract_cst(__isl_take isl_set
*set
, __isl_take isl_aff
*aff
,
1745 isl_int
*inc
= (isl_int
*)user
;
1748 if (isl_aff_is_cst(aff
))
1749 isl_aff_get_constant(aff
, inc
);
1759 /* Check if op is of the form
1763 * and return inc as an affine expression.
1765 * We extract an affine expression from the RHS, subtract iv and return
1768 __isl_give isl_pw_aff
*PetScan::extract_binary_increment(BinaryOperator
*op
,
1769 clang::ValueDecl
*iv
)
1778 if (op
->getOpcode() != BO_Assign
) {
1784 if (lhs
->getStmtClass() != Stmt::DeclRefExprClass
) {
1789 ref
= cast
<DeclRefExpr
>(lhs
);
1790 if (ref
->getDecl() != iv
) {
1795 val
= extract_affine(op
->getRHS());
1797 id
= isl_id_alloc(ctx
, iv
->getName().str().c_str(), iv
);
1799 dim
= isl_space_params_alloc(ctx
, 1);
1800 dim
= isl_space_set_dim_id(dim
, isl_dim_param
, 0, id
);
1801 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
1802 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_param
, 0, 1);
1804 val
= isl_pw_aff_sub(val
, isl_pw_aff_from_aff(aff
));
1809 /* Check that op is of the form iv += cst or iv -= cst
1810 * and return an affine expression corresponding oto cst or -cst accordingly.
1812 __isl_give isl_pw_aff
*PetScan::extract_compound_increment(
1813 CompoundAssignOperator
*op
, clang::ValueDecl
*iv
)
1819 BinaryOperatorKind opcode
;
1821 opcode
= op
->getOpcode();
1822 if (opcode
!= BO_AddAssign
&& opcode
!= BO_SubAssign
) {
1826 if (opcode
== BO_SubAssign
)
1830 if (lhs
->getStmtClass() != Stmt::DeclRefExprClass
) {
1835 ref
= cast
<DeclRefExpr
>(lhs
);
1836 if (ref
->getDecl() != iv
) {
1841 val
= extract_affine(op
->getRHS());
1843 val
= isl_pw_aff_neg(val
);
1848 /* Check that the increment of the given for loop increments
1849 * (or decrements) the induction variable "iv" and return
1850 * the increment as an affine expression if successful.
1852 __isl_give isl_pw_aff
*PetScan::extract_increment(clang::ForStmt
*stmt
,
1855 Stmt
*inc
= stmt
->getInc();
1862 if (inc
->getStmtClass() == Stmt::UnaryOperatorClass
)
1863 return extract_unary_increment(cast
<UnaryOperator
>(inc
), iv
);
1864 if (inc
->getStmtClass() == Stmt::CompoundAssignOperatorClass
)
1865 return extract_compound_increment(
1866 cast
<CompoundAssignOperator
>(inc
), iv
);
1867 if (inc
->getStmtClass() == Stmt::BinaryOperatorClass
)
1868 return extract_binary_increment(cast
<BinaryOperator
>(inc
), iv
);
1874 /* Embed the given iteration domain in an extra outer loop
1875 * with induction variable "var".
1876 * If this variable appeared as a parameter in the constraints,
1877 * it is replaced by the new outermost dimension.
1879 static __isl_give isl_set
*embed(__isl_take isl_set
*set
,
1880 __isl_take isl_id
*var
)
1884 set
= isl_set_insert_dims(set
, isl_dim_set
, 0, 1);
1885 pos
= isl_set_find_dim_by_id(set
, isl_dim_param
, var
);
1887 set
= isl_set_equate(set
, isl_dim_param
, pos
, isl_dim_set
, 0);
1888 set
= isl_set_project_out(set
, isl_dim_param
, pos
, 1);
1895 /* Return those elements in the space of "cond" that come after
1896 * (based on "sign") an element in "cond".
1898 static __isl_give isl_set
*after(__isl_take isl_set
*cond
, int sign
)
1900 isl_map
*previous_to_this
;
1903 previous_to_this
= isl_map_lex_lt(isl_set_get_space(cond
));
1905 previous_to_this
= isl_map_lex_gt(isl_set_get_space(cond
));
1907 cond
= isl_set_apply(cond
, previous_to_this
);
1912 /* Create the infinite iteration domain
1914 * { [id] : id >= 0 }
1916 * If "scop" has an affine skip of type pet_skip_later,
1917 * then remove those iterations i that have an earlier iteration
1918 * where the skip condition is satisfied, meaning that iteration i
1920 * Since we are dealing with a loop without loop iterator,
1921 * the skip condition cannot refer to the current loop iterator and
1922 * so effectively, the returned set is of the form
1924 * { [0]; [id] : id >= 1 and not skip }
1926 static __isl_give isl_set
*infinite_domain(__isl_take isl_id
*id
,
1927 struct pet_scop
*scop
)
1929 isl_ctx
*ctx
= isl_id_get_ctx(id
);
1933 domain
= isl_set_nat_universe(isl_space_set_alloc(ctx
, 0, 1));
1934 domain
= isl_set_set_dim_id(domain
, isl_dim_set
, 0, id
);
1936 if (!pet_scop_has_affine_skip(scop
, pet_skip_later
))
1939 skip
= pet_scop_get_skip(scop
, pet_skip_later
);
1940 skip
= isl_set_fix_si(skip
, isl_dim_set
, 0, 1);
1941 skip
= isl_set_params(skip
);
1942 skip
= embed(skip
, isl_id_copy(id
));
1943 skip
= isl_set_intersect(skip
, isl_set_copy(domain
));
1944 domain
= isl_set_subtract(domain
, after(skip
, 1));
1949 /* Create an identity mapping on the space containing "domain".
1951 static __isl_give isl_map
*identity_map(__isl_keep isl_set
*domain
)
1956 space
= isl_space_map_from_set(isl_set_get_space(domain
));
1957 id
= isl_map_identity(space
);
1962 /* Add a filter to "scop" that imposes that it is only executed
1963 * when "break_access" has a zero value for all previous iterations
1966 * The input "break_access" has a zero-dimensional domain and range.
1968 static struct pet_scop
*scop_add_break(struct pet_scop
*scop
,
1969 __isl_take isl_map
*break_access
, __isl_take isl_set
*domain
, int sign
)
1971 isl_ctx
*ctx
= isl_set_get_ctx(domain
);
1975 id_test
= isl_map_get_tuple_id(break_access
, isl_dim_out
);
1976 break_access
= isl_map_add_dims(break_access
, isl_dim_in
, 1);
1977 break_access
= isl_map_add_dims(break_access
, isl_dim_out
, 1);
1978 break_access
= isl_map_intersect_range(break_access
, domain
);
1979 break_access
= isl_map_set_tuple_id(break_access
, isl_dim_out
, id_test
);
1981 prev
= isl_map_lex_gt_first(isl_map_get_space(break_access
), 1);
1983 prev
= isl_map_lex_lt_first(isl_map_get_space(break_access
), 1);
1984 break_access
= isl_map_intersect(break_access
, prev
);
1985 scop
= pet_scop_filter(scop
, break_access
, 0);
1986 scop
= pet_scop_merge_filters(scop
);
1991 /* Construct a pet_scop for an infinite loop around the given body.
1993 * We extract a pet_scop for the body and then embed it in a loop with
2002 * If the body contains any break, then it is taken into
2003 * account in infinite_domain (if the skip condition is affine)
2004 * or in scop_add_break (if the skip condition is not affine).
2006 struct pet_scop
*PetScan::extract_infinite_loop(Stmt
*body
)
2012 struct pet_scop
*scop
;
2015 scop
= extract(body
);
2019 id
= isl_id_alloc(ctx
, "t", NULL
);
2020 domain
= infinite_domain(isl_id_copy(id
), scop
);
2021 ident
= identity_map(domain
);
2023 has_var_break
= pet_scop_has_var_skip(scop
, pet_skip_later
);
2025 access
= pet_scop_get_skip_map(scop
, pet_skip_later
);
2027 scop
= pet_scop_embed(scop
, isl_set_copy(domain
),
2028 isl_map_copy(ident
), ident
, id
);
2030 scop
= scop_add_break(scop
, access
, domain
, 1);
2032 isl_set_free(domain
);
2037 /* Construct a pet_scop for an infinite loop, i.e., a loop of the form
2043 struct pet_scop
*PetScan::extract_infinite_for(ForStmt
*stmt
)
2045 return extract_infinite_loop(stmt
->getBody());
2048 /* Create an access to a virtual array representing the result
2050 * Unlike other accessed data, the id of the array is NULL as
2051 * there is no ValueDecl in the program corresponding to the virtual
2053 * The array starts out as a scalar, but grows along with the
2054 * statement writing to the array in pet_scop_embed.
2056 static __isl_give isl_map
*create_test_access(isl_ctx
*ctx
, int test_nr
)
2058 isl_space
*dim
= isl_space_alloc(ctx
, 0, 0, 0);
2062 snprintf(name
, sizeof(name
), "__pet_test_%d", test_nr
);
2063 id
= isl_id_alloc(ctx
, name
, NULL
);
2064 dim
= isl_space_set_tuple_id(dim
, isl_dim_out
, id
);
2065 return isl_map_universe(dim
);
2068 /* Add an array with the given extent ("access") to the list
2069 * of arrays in "scop" and return the extended pet_scop.
2070 * The array is marked as attaining values 0 and 1 only and
2071 * as each element being assigned at most once.
2073 static struct pet_scop
*scop_add_array(struct pet_scop
*scop
,
2074 __isl_keep isl_map
*access
, clang::ASTContext
&ast_ctx
)
2076 isl_ctx
*ctx
= isl_map_get_ctx(access
);
2078 struct pet_array
*array
;
2085 array
= isl_calloc_type(ctx
, struct pet_array
);
2089 array
->extent
= isl_map_range(isl_map_copy(access
));
2090 dim
= isl_space_params_alloc(ctx
, 0);
2091 array
->context
= isl_set_universe(dim
);
2092 dim
= isl_space_set_alloc(ctx
, 0, 1);
2093 array
->value_bounds
= isl_set_universe(dim
);
2094 array
->value_bounds
= isl_set_lower_bound_si(array
->value_bounds
,
2096 array
->value_bounds
= isl_set_upper_bound_si(array
->value_bounds
,
2098 array
->element_type
= strdup("int");
2099 array
->element_size
= ast_ctx
.getTypeInfo(ast_ctx
.IntTy
).first
/ 8;
2100 array
->uniquely_defined
= 1;
2102 if (!array
->extent
|| !array
->context
)
2103 array
= pet_array_free(array
);
2105 scop
= pet_scop_add_array(scop
, array
);
2109 pet_scop_free(scop
);
2113 /* Construct a pet_scop for a while loop of the form
2118 * In particular, construct a scop for an infinite loop around body and
2119 * intersect the domain with the affine expression.
2120 * Note that this intersection may result in an empty loop.
2122 struct pet_scop
*PetScan::extract_affine_while(__isl_take isl_pw_aff
*pa
,
2125 struct pet_scop
*scop
;
2129 valid
= isl_pw_aff_domain(isl_pw_aff_copy(pa
));
2130 dom
= isl_pw_aff_non_zero_set(pa
);
2131 scop
= extract_infinite_loop(body
);
2132 scop
= pet_scop_restrict(scop
, dom
);
2133 scop
= pet_scop_restrict_context(scop
, valid
);
2138 /* Construct a scop for a while, given the scops for the condition
2139 * and the body, the filter access and the iteration domain of
2142 * In particular, the scop for the condition is filtered to depend
2143 * on "test_access" evaluating to true for all previous iterations
2144 * of the loop, while the scop for the body is filtered to depend
2145 * on "test_access" evaluating to true for all iterations up to the
2146 * current iteration.
2148 * These filtered scops are then combined into a single scop.
2150 * "sign" is positive if the iterator increases and negative
2153 static struct pet_scop
*scop_add_while(struct pet_scop
*scop_cond
,
2154 struct pet_scop
*scop_body
, __isl_take isl_map
*test_access
,
2155 __isl_take isl_set
*domain
, int sign
)
2157 isl_ctx
*ctx
= isl_set_get_ctx(domain
);
2161 id_test
= isl_map_get_tuple_id(test_access
, isl_dim_out
);
2162 test_access
= isl_map_add_dims(test_access
, isl_dim_in
, 1);
2163 test_access
= isl_map_add_dims(test_access
, isl_dim_out
, 1);
2164 test_access
= isl_map_intersect_range(test_access
, domain
);
2165 test_access
= isl_map_set_tuple_id(test_access
, isl_dim_out
, id_test
);
2167 prev
= isl_map_lex_ge_first(isl_map_get_space(test_access
), 1);
2169 prev
= isl_map_lex_le_first(isl_map_get_space(test_access
), 1);
2170 test_access
= isl_map_intersect(test_access
, prev
);
2171 scop_body
= pet_scop_filter(scop_body
, isl_map_copy(test_access
), 1);
2173 prev
= isl_map_lex_gt_first(isl_map_get_space(test_access
), 1);
2175 prev
= isl_map_lex_lt_first(isl_map_get_space(test_access
), 1);
2176 test_access
= isl_map_intersect(test_access
, prev
);
2177 scop_cond
= pet_scop_filter(scop_cond
, test_access
, 1);
2179 return pet_scop_add_seq(ctx
, scop_cond
, scop_body
);
2182 /* Check if the while loop is of the form
2184 * while (affine expression)
2187 * If so, call extract_affine_while to construct a scop.
2189 * Otherwise, construct a generic while scop, with iteration domain
2190 * { [t] : t >= 0 }. The scop consists of two parts, one for
2191 * evaluating the condition and one for the body.
2192 * The schedule is adjusted to reflect that the condition is evaluated
2193 * before the body is executed and the body is filtered to depend
2194 * on the result of the condition evaluating to true on all iterations
2195 * up to the current iteration, while the evaluation the condition itself
2196 * is filtered to depend on the result of the condition evaluating to true
2197 * on all previous iterations.
2198 * The context of the scop representing the body is dropped
2199 * because we don't know how many times the body will be executed,
2202 * If the body contains any break, then it is taken into
2203 * account in infinite_domain (if the skip condition is affine)
2204 * or in scop_add_break (if the skip condition is not affine).
2206 struct pet_scop
*PetScan::extract(WhileStmt
*stmt
)
2210 isl_map
*test_access
;
2214 struct pet_scop
*scop
, *scop_body
;
2216 isl_map
*break_access
;
2218 cond
= stmt
->getCond();
2224 clear_assignments
clear(assigned_value
);
2225 clear
.TraverseStmt(stmt
->getBody());
2227 pa
= try_extract_affine_condition(cond
);
2229 return extract_affine_while(pa
, stmt
->getBody());
2231 if (!allow_nested
) {
2236 test_access
= create_test_access(ctx
, n_test
++);
2237 scop
= extract_non_affine_condition(cond
, isl_map_copy(test_access
));
2238 scop
= scop_add_array(scop
, test_access
, ast_context
);
2239 scop_body
= extract(stmt
->getBody());
2241 id
= isl_id_alloc(ctx
, "t", NULL
);
2242 domain
= infinite_domain(isl_id_copy(id
), scop_body
);
2243 ident
= identity_map(domain
);
2245 has_var_break
= pet_scop_has_var_skip(scop_body
, pet_skip_later
);
2247 break_access
= pet_scop_get_skip_map(scop_body
, pet_skip_later
);
2249 scop
= pet_scop_prefix(scop
, 0);
2250 scop
= pet_scop_embed(scop
, isl_set_copy(domain
), isl_map_copy(ident
),
2251 isl_map_copy(ident
), isl_id_copy(id
));
2252 scop_body
= pet_scop_reset_context(scop_body
);
2253 scop_body
= pet_scop_prefix(scop_body
, 1);
2254 scop_body
= pet_scop_embed(scop_body
, isl_set_copy(domain
),
2255 isl_map_copy(ident
), ident
, id
);
2257 if (has_var_break
) {
2258 scop
= scop_add_break(scop
, isl_map_copy(break_access
),
2259 isl_set_copy(domain
), 1);
2260 scop_body
= scop_add_break(scop_body
, break_access
,
2261 isl_set_copy(domain
), 1);
2263 scop
= scop_add_while(scop
, scop_body
, test_access
, domain
, 1);
2268 /* Check whether "cond" expresses a simple loop bound
2269 * on the only set dimension.
2270 * In particular, if "up" is set then "cond" should contain only
2271 * upper bounds on the set dimension.
2272 * Otherwise, it should contain only lower bounds.
2274 static bool is_simple_bound(__isl_keep isl_set
*cond
, isl_int inc
)
2276 if (isl_int_is_pos(inc
))
2277 return !isl_set_dim_has_any_lower_bound(cond
, isl_dim_set
, 0);
2279 return !isl_set_dim_has_any_upper_bound(cond
, isl_dim_set
, 0);
2282 /* Extend a condition on a given iteration of a loop to one that
2283 * imposes the same condition on all previous iterations.
2284 * "domain" expresses the lower [upper] bound on the iterations
2285 * when inc is positive [negative].
2287 * In particular, we construct the condition (when inc is positive)
2289 * forall i' : (domain(i') and i' <= i) => cond(i')
2291 * which is equivalent to
2293 * not exists i' : domain(i') and i' <= i and not cond(i')
2295 * We construct this set by negating cond, applying a map
2297 * { [i'] -> [i] : domain(i') and i' <= i }
2299 * and then negating the result again.
2301 static __isl_give isl_set
*valid_for_each_iteration(__isl_take isl_set
*cond
,
2302 __isl_take isl_set
*domain
, isl_int inc
)
2304 isl_map
*previous_to_this
;
2306 if (isl_int_is_pos(inc
))
2307 previous_to_this
= isl_map_lex_le(isl_set_get_space(domain
));
2309 previous_to_this
= isl_map_lex_ge(isl_set_get_space(domain
));
2311 previous_to_this
= isl_map_intersect_domain(previous_to_this
, domain
);
2313 cond
= isl_set_complement(cond
);
2314 cond
= isl_set_apply(cond
, previous_to_this
);
2315 cond
= isl_set_complement(cond
);
2320 /* Construct a domain of the form
2322 * [id] -> { : exists a: id = init + a * inc and a >= 0 }
2324 static __isl_give isl_set
*strided_domain(__isl_take isl_id
*id
,
2325 __isl_take isl_pw_aff
*init
, isl_int inc
)
2331 init
= isl_pw_aff_insert_dims(init
, isl_dim_in
, 0, 1);
2332 dim
= isl_pw_aff_get_domain_space(init
);
2333 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
2334 aff
= isl_aff_add_coefficient(aff
, isl_dim_in
, 0, inc
);
2335 init
= isl_pw_aff_add(init
, isl_pw_aff_from_aff(aff
));
2337 dim
= isl_space_set_alloc(isl_pw_aff_get_ctx(init
), 1, 1);
2338 dim
= isl_space_set_dim_id(dim
, isl_dim_param
, 0, id
);
2339 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
2340 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_param
, 0, 1);
2342 set
= isl_pw_aff_eq_set(isl_pw_aff_from_aff(aff
), init
);
2344 set
= isl_set_lower_bound_si(set
, isl_dim_set
, 0, 0);
2346 return isl_set_params(set
);
2349 /* Assuming "cond" represents a bound on a loop where the loop
2350 * iterator "iv" is incremented (or decremented) by one, check if wrapping
2353 * Under the given assumptions, wrapping is only possible if "cond" allows
2354 * for the last value before wrapping, i.e., 2^width - 1 in case of an
2355 * increasing iterator and 0 in case of a decreasing iterator.
2357 static bool can_wrap(__isl_keep isl_set
*cond
, ValueDecl
*iv
, isl_int inc
)
2363 test
= isl_set_copy(cond
);
2365 isl_int_init(limit
);
2366 if (isl_int_is_neg(inc
))
2367 isl_int_set_si(limit
, 0);
2369 isl_int_set_si(limit
, 1);
2370 isl_int_mul_2exp(limit
, limit
, get_type_size(iv
));
2371 isl_int_sub_ui(limit
, limit
, 1);
2374 test
= isl_set_fix(cond
, isl_dim_set
, 0, limit
);
2375 cw
= !isl_set_is_empty(test
);
2378 isl_int_clear(limit
);
2383 /* Given a one-dimensional space, construct the following mapping on this
2386 * { [v] -> [v mod 2^width] }
2388 * where width is the number of bits used to represent the values
2389 * of the unsigned variable "iv".
2391 static __isl_give isl_map
*compute_wrapping(__isl_take isl_space
*dim
,
2399 isl_int_set_si(mod
, 1);
2400 isl_int_mul_2exp(mod
, mod
, get_type_size(iv
));
2402 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
2403 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, 0, 1);
2404 aff
= isl_aff_mod(aff
, mod
);
2408 return isl_map_from_basic_map(isl_basic_map_from_aff(aff
));
2409 map
= isl_map_reverse(map
);
2412 /* Project out the parameter "id" from "set".
2414 static __isl_give isl_set
*set_project_out_by_id(__isl_take isl_set
*set
,
2415 __isl_keep isl_id
*id
)
2419 pos
= isl_set_find_dim_by_id(set
, isl_dim_param
, id
);
2421 set
= isl_set_project_out(set
, isl_dim_param
, pos
, 1);
2426 /* Compute the set of parameters for which "set1" is a subset of "set2".
2428 * set1 is a subset of set2 if
2430 * forall i in set1 : i in set2
2434 * not exists i in set1 and i not in set2
2438 * not exists i in set1 \ set2
2440 static __isl_give isl_set
*enforce_subset(__isl_take isl_set
*set1
,
2441 __isl_take isl_set
*set2
)
2443 return isl_set_complement(isl_set_params(isl_set_subtract(set1
, set2
)));
2446 /* Compute the set of parameter values for which "cond" holds
2447 * on the next iteration for each element of "dom".
2449 * We first construct mapping { [i] -> [i + inc] }, apply that to "dom"
2450 * and then compute the set of parameters for which the result is a subset
2453 static __isl_give isl_set
*valid_on_next(__isl_take isl_set
*cond
,
2454 __isl_take isl_set
*dom
, isl_int inc
)
2460 space
= isl_set_get_space(dom
);
2461 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(space
));
2462 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, 0, 1);
2463 aff
= isl_aff_add_constant(aff
, inc
);
2464 next
= isl_map_from_basic_map(isl_basic_map_from_aff(aff
));
2466 dom
= isl_set_apply(dom
, next
);
2468 return enforce_subset(dom
, cond
);
2471 /* Does "id" refer to a nested access?
2473 static bool is_nested_parameter(__isl_keep isl_id
*id
)
2475 return id
&& isl_id_get_user(id
) && !isl_id_get_name(id
);
2478 /* Does parameter "pos" of "space" refer to a nested access?
2480 static bool is_nested_parameter(__isl_keep isl_space
*space
, int pos
)
2485 id
= isl_space_get_dim_id(space
, isl_dim_param
, pos
);
2486 nested
= is_nested_parameter(id
);
2492 /* Does "space" involve any parameters that refer to nested
2493 * accesses, i.e., parameters with no name?
2495 static bool has_nested(__isl_keep isl_space
*space
)
2499 nparam
= isl_space_dim(space
, isl_dim_param
);
2500 for (int i
= 0; i
< nparam
; ++i
)
2501 if (is_nested_parameter(space
, i
))
2507 /* Does "pa" involve any parameters that refer to nested
2508 * accesses, i.e., parameters with no name?
2510 static bool has_nested(__isl_keep isl_pw_aff
*pa
)
2515 space
= isl_pw_aff_get_space(pa
);
2516 nested
= has_nested(space
);
2517 isl_space_free(space
);
2522 /* Construct a pet_scop for a for statement.
2523 * The for loop is required to be of the form
2525 * for (i = init; condition; ++i)
2529 * for (i = init; condition; --i)
2531 * The initialization of the for loop should either be an assignment
2532 * to an integer variable, or a declaration of such a variable with
2535 * The condition is allowed to contain nested accesses, provided
2536 * they are not being written to inside the body of the loop.
2537 * Otherwise, or if the condition is otherwise non-affine, the for loop is
2538 * essentially treated as a while loop, with iteration domain
2539 * { [i] : i >= init }.
2541 * We extract a pet_scop for the body and then embed it in a loop with
2542 * iteration domain and schedule
2544 * { [i] : i >= init and condition' }
2549 * { [i] : i <= init and condition' }
2552 * Where condition' is equal to condition if the latter is
2553 * a simple upper [lower] bound and a condition that is extended
2554 * to apply to all previous iterations otherwise.
2556 * If the condition is non-affine, then we drop the condition from the
2557 * iteration domain and instead create a separate statement
2558 * for evaluating the condition. The body is then filtered to depend
2559 * on the result of the condition evaluating to true on all iterations
2560 * up to the current iteration, while the evaluation the condition itself
2561 * is filtered to depend on the result of the condition evaluating to true
2562 * on all previous iterations.
2563 * The context of the scop representing the body is dropped
2564 * because we don't know how many times the body will be executed,
2567 * If the stride of the loop is not 1, then "i >= init" is replaced by
2569 * (exists a: i = init + stride * a and a >= 0)
2571 * If the loop iterator i is unsigned, then wrapping may occur.
2572 * During the computation, we work with a virtual iterator that
2573 * does not wrap. However, the condition in the code applies
2574 * to the wrapped value, so we need to change condition(i)
2575 * into condition([i % 2^width]).
2576 * After computing the virtual domain and schedule, we apply
2577 * the function { [v] -> [v % 2^width] } to the domain and the domain
2578 * of the schedule. In order not to lose any information, we also
2579 * need to intersect the domain of the schedule with the virtual domain
2580 * first, since some iterations in the wrapped domain may be scheduled
2581 * several times, typically an infinite number of times.
2582 * Note that there may be no need to perform this final wrapping
2583 * if the loop condition (after wrapping) satisfies certain conditions.
2584 * However, the is_simple_bound condition is not enough since it doesn't
2585 * check if there even is an upper bound.
2587 * If the loop condition is non-affine, then we keep the virtual
2588 * iterator in the iteration domain and instead replace all accesses
2589 * to the original iterator by the wrapping of the virtual iterator.
2591 * Wrapping on unsigned iterators can be avoided entirely if
2592 * loop condition is simple, the loop iterator is incremented
2593 * [decremented] by one and the last value before wrapping cannot
2594 * possibly satisfy the loop condition.
2596 * Before extracting a pet_scop from the body we remove all
2597 * assignments in assigned_value to variables that are assigned
2598 * somewhere in the body of the loop.
2600 * Valid parameters for a for loop are those for which the initial
2601 * value itself, the increment on each domain iteration and
2602 * the condition on both the initial value and
2603 * the result of incrementing the iterator for each iteration of the domain
2605 * If the loop condition is non-affine, then we only consider validity
2606 * of the initial value.
2608 * If the body contains any break, then we keep track of it in "skip"
2609 * (if the skip condition is affine) or it is handled in scop_add_break
2610 * (if the skip condition is not affine).
2611 * Note that the affine break condition needs to be considered with
2612 * respect to previous iterations in the virtual domain (if any)
2613 * and that the domain needs to be kept virtual if there is a non-affine
2616 struct pet_scop
*PetScan::extract_for(ForStmt
*stmt
)
2618 BinaryOperator
*ass
;
2626 isl_set
*cond
= NULL
;
2627 isl_set
*skip
= NULL
;
2629 struct pet_scop
*scop
, *scop_cond
= NULL
;
2630 assigned_value_cache
cache(assigned_value
);
2636 bool keep_virtual
= false;
2637 bool has_affine_break
;
2639 isl_map
*wrap
= NULL
;
2640 isl_pw_aff
*pa
, *pa_inc
, *init_val
;
2641 isl_set
*valid_init
;
2642 isl_set
*valid_cond
;
2643 isl_set
*valid_cond_init
;
2644 isl_set
*valid_cond_next
;
2646 isl_map
*test_access
= NULL
, *break_access
= NULL
;
2649 if (!stmt
->getInit() && !stmt
->getCond() && !stmt
->getInc())
2650 return extract_infinite_for(stmt
);
2652 init
= stmt
->getInit();
2657 if ((ass
= initialization_assignment(init
)) != NULL
) {
2658 iv
= extract_induction_variable(ass
);
2661 lhs
= ass
->getLHS();
2662 rhs
= ass
->getRHS();
2663 } else if ((decl
= initialization_declaration(init
)) != NULL
) {
2664 VarDecl
*var
= extract_induction_variable(init
, decl
);
2668 rhs
= var
->getInit();
2669 lhs
= create_DeclRefExpr(var
);
2671 unsupported(stmt
->getInit());
2675 pa_inc
= extract_increment(stmt
, iv
);
2680 if (isl_pw_aff_n_piece(pa_inc
) != 1 ||
2681 isl_pw_aff_foreach_piece(pa_inc
, &extract_cst
, &inc
) < 0) {
2682 isl_pw_aff_free(pa_inc
);
2683 unsupported(stmt
->getInc());
2687 valid_inc
= isl_pw_aff_domain(pa_inc
);
2689 is_unsigned
= iv
->getType()->isUnsignedIntegerType();
2691 assigned_value
.erase(iv
);
2692 clear_assignments
clear(assigned_value
);
2693 clear
.TraverseStmt(stmt
->getBody());
2695 id
= isl_id_alloc(ctx
, iv
->getName().str().c_str(), iv
);
2697 pa
= try_extract_nested_condition(stmt
->getCond());
2698 if (allow_nested
&& (!pa
|| has_nested(pa
)))
2701 scop
= extract(stmt
->getBody());
2703 has_affine_break
= scop
&&
2704 pet_scop_has_affine_skip(scop
, pet_skip_later
);
2705 if (has_affine_break
) {
2706 skip
= pet_scop_get_skip(scop
, pet_skip_later
);
2707 skip
= isl_set_fix_si(skip
, isl_dim_set
, 0, 1);
2708 skip
= isl_set_params(skip
);
2710 has_var_break
= scop
&& pet_scop_has_var_skip(scop
, pet_skip_later
);
2711 if (has_var_break
) {
2712 break_access
= pet_scop_get_skip_map(scop
, pet_skip_later
);
2713 keep_virtual
= true;
2716 if (pa
&& !is_nested_allowed(pa
, scop
)) {
2717 isl_pw_aff_free(pa
);
2721 if (!allow_nested
&& !pa
)
2722 pa
= try_extract_affine_condition(stmt
->getCond());
2723 valid_cond
= isl_pw_aff_domain(isl_pw_aff_copy(pa
));
2724 cond
= isl_pw_aff_non_zero_set(pa
);
2725 if (allow_nested
&& !cond
) {
2726 int save_n_stmt
= n_stmt
;
2727 test_access
= create_test_access(ctx
, n_test
++);
2729 scop_cond
= extract_non_affine_condition(stmt
->getCond(),
2730 isl_map_copy(test_access
));
2731 n_stmt
= save_n_stmt
;
2732 scop_cond
= scop_add_array(scop_cond
, test_access
, ast_context
);
2733 scop_cond
= pet_scop_prefix(scop_cond
, 0);
2734 scop
= pet_scop_reset_context(scop
);
2735 scop
= pet_scop_prefix(scop
, 1);
2736 keep_virtual
= true;
2737 cond
= isl_set_universe(isl_space_set_alloc(ctx
, 0, 0));
2740 cond
= embed(cond
, isl_id_copy(id
));
2741 skip
= embed(skip
, isl_id_copy(id
));
2742 valid_cond
= isl_set_coalesce(valid_cond
);
2743 valid_cond
= embed(valid_cond
, isl_id_copy(id
));
2744 valid_inc
= embed(valid_inc
, isl_id_copy(id
));
2745 is_one
= isl_int_is_one(inc
) || isl_int_is_negone(inc
);
2746 is_virtual
= is_unsigned
&& (!is_one
|| can_wrap(cond
, iv
, inc
));
2748 init_val
= extract_affine(rhs
);
2749 valid_cond_init
= enforce_subset(
2750 isl_set_from_pw_aff(isl_pw_aff_copy(init_val
)),
2751 isl_set_copy(valid_cond
));
2752 if (is_one
&& !is_virtual
) {
2753 isl_pw_aff_free(init_val
);
2754 pa
= extract_comparison(isl_int_is_pos(inc
) ? BO_GE
: BO_LE
,
2756 valid_init
= isl_pw_aff_domain(isl_pw_aff_copy(pa
));
2757 valid_init
= set_project_out_by_id(valid_init
, id
);
2758 domain
= isl_pw_aff_non_zero_set(pa
);
2760 valid_init
= isl_pw_aff_domain(isl_pw_aff_copy(init_val
));
2761 domain
= strided_domain(isl_id_copy(id
), init_val
, inc
);
2764 domain
= embed(domain
, isl_id_copy(id
));
2767 wrap
= compute_wrapping(isl_set_get_space(cond
), iv
);
2768 rev_wrap
= isl_map_reverse(isl_map_copy(wrap
));
2769 cond
= isl_set_apply(cond
, isl_map_copy(rev_wrap
));
2770 skip
= isl_set_apply(skip
, isl_map_copy(rev_wrap
));
2771 valid_cond
= isl_set_apply(valid_cond
, isl_map_copy(rev_wrap
));
2772 valid_inc
= isl_set_apply(valid_inc
, rev_wrap
);
2774 is_simple
= is_simple_bound(cond
, inc
);
2776 cond
= isl_set_gist(cond
, isl_set_copy(domain
));
2777 is_simple
= is_simple_bound(cond
, inc
);
2780 cond
= valid_for_each_iteration(cond
,
2781 isl_set_copy(domain
), inc
);
2782 domain
= isl_set_intersect(domain
, cond
);
2783 if (has_affine_break
) {
2784 skip
= isl_set_intersect(skip
, isl_set_copy(domain
));
2785 skip
= after(skip
, isl_int_sgn(inc
));
2786 domain
= isl_set_subtract(domain
, skip
);
2788 domain
= isl_set_set_dim_id(domain
, isl_dim_set
, 0, isl_id_copy(id
));
2789 space
= isl_space_from_domain(isl_set_get_space(domain
));
2790 space
= isl_space_add_dims(space
, isl_dim_out
, 1);
2791 sched
= isl_map_universe(space
);
2792 if (isl_int_is_pos(inc
))
2793 sched
= isl_map_equate(sched
, isl_dim_in
, 0, isl_dim_out
, 0);
2795 sched
= isl_map_oppose(sched
, isl_dim_in
, 0, isl_dim_out
, 0);
2797 valid_cond_next
= valid_on_next(valid_cond
, isl_set_copy(domain
), inc
);
2798 valid_inc
= enforce_subset(isl_set_copy(domain
), valid_inc
);
2800 if (is_virtual
&& !keep_virtual
) {
2801 wrap
= isl_map_set_dim_id(wrap
,
2802 isl_dim_out
, 0, isl_id_copy(id
));
2803 sched
= isl_map_intersect_domain(sched
, isl_set_copy(domain
));
2804 domain
= isl_set_apply(domain
, isl_map_copy(wrap
));
2805 sched
= isl_map_apply_domain(sched
, wrap
);
2807 if (!(is_virtual
&& keep_virtual
)) {
2808 space
= isl_set_get_space(domain
);
2809 wrap
= isl_map_identity(isl_space_map_from_set(space
));
2812 scop_cond
= pet_scop_embed(scop_cond
, isl_set_copy(domain
),
2813 isl_map_copy(sched
), isl_map_copy(wrap
), isl_id_copy(id
));
2814 scop
= pet_scop_embed(scop
, isl_set_copy(domain
), sched
, wrap
, id
);
2815 scop
= resolve_nested(scop
);
2817 scop
= scop_add_break(scop
, break_access
, isl_set_copy(domain
),
2820 scop
= scop_add_while(scop_cond
, scop
, test_access
, domain
,
2822 isl_set_free(valid_inc
);
2824 scop
= pet_scop_restrict_context(scop
, valid_inc
);
2825 scop
= pet_scop_restrict_context(scop
, valid_cond_next
);
2826 scop
= pet_scop_restrict_context(scop
, valid_cond_init
);
2827 isl_set_free(domain
);
2829 clear_assignment(assigned_value
, iv
);
2833 scop
= pet_scop_restrict_context(scop
, valid_init
);
2838 struct pet_scop
*PetScan::extract(CompoundStmt
*stmt
)
2840 return extract(stmt
->children());
2843 /* Does parameter "pos" of "map" refer to a nested access?
2845 static bool is_nested_parameter(__isl_keep isl_map
*map
, int pos
)
2850 id
= isl_map_get_dim_id(map
, isl_dim_param
, pos
);
2851 nested
= is_nested_parameter(id
);
2857 /* How many parameters of "space" refer to nested accesses, i.e., have no name?
2859 static int n_nested_parameter(__isl_keep isl_space
*space
)
2864 nparam
= isl_space_dim(space
, isl_dim_param
);
2865 for (int i
= 0; i
< nparam
; ++i
)
2866 if (is_nested_parameter(space
, i
))
2872 /* How many parameters of "map" refer to nested accesses, i.e., have no name?
2874 static int n_nested_parameter(__isl_keep isl_map
*map
)
2879 space
= isl_map_get_space(map
);
2880 n
= n_nested_parameter(space
);
2881 isl_space_free(space
);
2886 /* For each nested access parameter in "space",
2887 * construct a corresponding pet_expr, place it in args and
2888 * record its position in "param2pos".
2889 * "n_arg" is the number of elements that are already in args.
2890 * The position recorded in "param2pos" takes this number into account.
2891 * If the pet_expr corresponding to a parameter is identical to
2892 * the pet_expr corresponding to an earlier parameter, then these two
2893 * parameters are made to refer to the same element in args.
2895 * Return the final number of elements in args or -1 if an error has occurred.
2897 int PetScan::extract_nested(__isl_keep isl_space
*space
,
2898 int n_arg
, struct pet_expr
**args
, std::map
<int,int> ¶m2pos
)
2902 nparam
= isl_space_dim(space
, isl_dim_param
);
2903 for (int i
= 0; i
< nparam
; ++i
) {
2905 isl_id
*id
= isl_space_get_dim_id(space
, isl_dim_param
, i
);
2908 if (!is_nested_parameter(id
)) {
2913 nested
= (Expr
*) isl_id_get_user(id
);
2914 args
[n_arg
] = extract_expr(nested
);
2918 for (j
= 0; j
< n_arg
; ++j
)
2919 if (pet_expr_is_equal(args
[j
], args
[n_arg
]))
2923 pet_expr_free(args
[n_arg
]);
2927 param2pos
[i
] = n_arg
++;
2935 /* For each nested access parameter in the access relations in "expr",
2936 * construct a corresponding pet_expr, place it in expr->args and
2937 * record its position in "param2pos".
2938 * n is the number of nested access parameters.
2940 struct pet_expr
*PetScan::extract_nested(struct pet_expr
*expr
, int n
,
2941 std::map
<int,int> ¶m2pos
)
2945 expr
->args
= isl_calloc_array(ctx
, struct pet_expr
*, n
);
2950 space
= isl_map_get_space(expr
->acc
.access
);
2951 n
= extract_nested(space
, 0, expr
->args
, param2pos
);
2952 isl_space_free(space
);
2960 pet_expr_free(expr
);
2964 /* Look for parameters in any access relation in "expr" that
2965 * refer to nested accesses. In particular, these are
2966 * parameters with no name.
2968 * If there are any such parameters, then the domain of the access
2969 * relation, which is still [] at this point, is replaced by
2970 * [[] -> [t_1,...,t_n]], with n the number of these parameters
2971 * (after identifying identical nested accesses).
2972 * The parameters are then equated to the corresponding t dimensions
2973 * and subsequently projected out.
2974 * param2pos maps the position of the parameter to the position
2975 * of the corresponding t dimension.
2977 struct pet_expr
*PetScan::resolve_nested(struct pet_expr
*expr
)
2984 std::map
<int,int> param2pos
;
2989 for (int i
= 0; i
< expr
->n_arg
; ++i
) {
2990 expr
->args
[i
] = resolve_nested(expr
->args
[i
]);
2991 if (!expr
->args
[i
]) {
2992 pet_expr_free(expr
);
2997 if (expr
->type
!= pet_expr_access
)
3000 n
= n_nested_parameter(expr
->acc
.access
);
3004 expr
= extract_nested(expr
, n
, param2pos
);
3009 nparam
= isl_map_dim(expr
->acc
.access
, isl_dim_param
);
3010 n_in
= isl_map_dim(expr
->acc
.access
, isl_dim_in
);
3011 dim
= isl_map_get_space(expr
->acc
.access
);
3012 dim
= isl_space_domain(dim
);
3013 dim
= isl_space_from_domain(dim
);
3014 dim
= isl_space_add_dims(dim
, isl_dim_out
, n
);
3015 map
= isl_map_universe(dim
);
3016 map
= isl_map_domain_map(map
);
3017 map
= isl_map_reverse(map
);
3018 expr
->acc
.access
= isl_map_apply_domain(expr
->acc
.access
, map
);
3020 for (int i
= nparam
- 1; i
>= 0; --i
) {
3021 isl_id
*id
= isl_map_get_dim_id(expr
->acc
.access
,
3023 if (!is_nested_parameter(id
)) {
3028 expr
->acc
.access
= isl_map_equate(expr
->acc
.access
,
3029 isl_dim_param
, i
, isl_dim_in
,
3030 n_in
+ param2pos
[i
]);
3031 expr
->acc
.access
= isl_map_project_out(expr
->acc
.access
,
3032 isl_dim_param
, i
, 1);
3039 pet_expr_free(expr
);
3043 /* Convert a top-level pet_expr to a pet_scop with one statement.
3044 * This mainly involves resolving nested expression parameters
3045 * and setting the name of the iteration space.
3046 * The name is given by "label" if it is non-NULL. Otherwise,
3047 * it is of the form S_<n_stmt>.
3049 struct pet_scop
*PetScan::extract(Stmt
*stmt
, struct pet_expr
*expr
,
3050 __isl_take isl_id
*label
)
3052 struct pet_stmt
*ps
;
3053 SourceLocation loc
= stmt
->getLocStart();
3054 int line
= PP
.getSourceManager().getExpansionLineNumber(loc
);
3056 expr
= resolve_nested(expr
);
3057 ps
= pet_stmt_from_pet_expr(ctx
, line
, label
, n_stmt
++, expr
);
3058 return pet_scop_from_pet_stmt(ctx
, ps
);
3061 /* Check if we can extract an affine expression from "expr".
3062 * Return the expressions as an isl_pw_aff if we can and NULL otherwise.
3063 * We turn on autodetection so that we won't generate any warnings
3064 * and turn off nesting, so that we won't accept any non-affine constructs.
3066 __isl_give isl_pw_aff
*PetScan::try_extract_affine(Expr
*expr
)
3069 int save_autodetect
= options
->autodetect
;
3070 bool save_nesting
= nesting_enabled
;
3072 options
->autodetect
= 1;
3073 nesting_enabled
= false;
3075 pwaff
= extract_affine(expr
);
3077 options
->autodetect
= save_autodetect
;
3078 nesting_enabled
= save_nesting
;
3083 /* Check whether "expr" is an affine expression.
3085 bool PetScan::is_affine(Expr
*expr
)
3089 pwaff
= try_extract_affine(expr
);
3090 isl_pw_aff_free(pwaff
);
3092 return pwaff
!= NULL
;
3095 /* Check if we can extract an affine constraint from "expr".
3096 * Return the constraint as an isl_set if we can and NULL otherwise.
3097 * We turn on autodetection so that we won't generate any warnings
3098 * and turn off nesting, so that we won't accept any non-affine constructs.
3100 __isl_give isl_pw_aff
*PetScan::try_extract_affine_condition(Expr
*expr
)
3103 int save_autodetect
= options
->autodetect
;
3104 bool save_nesting
= nesting_enabled
;
3106 options
->autodetect
= 1;
3107 nesting_enabled
= false;
3109 cond
= extract_condition(expr
);
3111 options
->autodetect
= save_autodetect
;
3112 nesting_enabled
= save_nesting
;
3117 /* Check whether "expr" is an affine constraint.
3119 bool PetScan::is_affine_condition(Expr
*expr
)
3123 cond
= try_extract_affine_condition(expr
);
3124 isl_pw_aff_free(cond
);
3126 return cond
!= NULL
;
3129 /* Check if we can extract a condition from "expr".
3130 * Return the condition as an isl_pw_aff if we can and NULL otherwise.
3131 * If allow_nested is set, then the condition may involve parameters
3132 * corresponding to nested accesses.
3133 * We turn on autodetection so that we won't generate any warnings.
3135 __isl_give isl_pw_aff
*PetScan::try_extract_nested_condition(Expr
*expr
)
3138 int save_autodetect
= options
->autodetect
;
3139 bool save_nesting
= nesting_enabled
;
3141 options
->autodetect
= 1;
3142 nesting_enabled
= allow_nested
;
3143 cond
= extract_condition(expr
);
3145 options
->autodetect
= save_autodetect
;
3146 nesting_enabled
= save_nesting
;
3151 /* If the top-level expression of "stmt" is an assignment, then
3152 * return that assignment as a BinaryOperator.
3153 * Otherwise return NULL.
3155 static BinaryOperator
*top_assignment_or_null(Stmt
*stmt
)
3157 BinaryOperator
*ass
;
3161 if (stmt
->getStmtClass() != Stmt::BinaryOperatorClass
)
3164 ass
= cast
<BinaryOperator
>(stmt
);
3165 if(ass
->getOpcode() != BO_Assign
)
3171 /* Check if the given if statement is a conditional assignement
3172 * with a non-affine condition. If so, construct a pet_scop
3173 * corresponding to this conditional assignment. Otherwise return NULL.
3175 * In particular we check if "stmt" is of the form
3182 * where a is some array or scalar access.
3183 * The constructed pet_scop then corresponds to the expression
3185 * a = condition ? f(...) : g(...)
3187 * All access relations in f(...) are intersected with condition
3188 * while all access relation in g(...) are intersected with the complement.
3190 struct pet_scop
*PetScan::extract_conditional_assignment(IfStmt
*stmt
)
3192 BinaryOperator
*ass_then
, *ass_else
;
3193 isl_map
*write_then
, *write_else
;
3194 isl_set
*cond
, *comp
;
3198 struct pet_expr
*pe_cond
, *pe_then
, *pe_else
, *pe
, *pe_write
;
3199 bool save_nesting
= nesting_enabled
;
3201 if (!options
->detect_conditional_assignment
)
3204 ass_then
= top_assignment_or_null(stmt
->getThen());
3205 ass_else
= top_assignment_or_null(stmt
->getElse());
3207 if (!ass_then
|| !ass_else
)
3210 if (is_affine_condition(stmt
->getCond()))
3213 write_then
= extract_access(ass_then
->getLHS());
3214 write_else
= extract_access(ass_else
->getLHS());
3216 equal
= isl_map_is_equal(write_then
, write_else
);
3217 isl_map_free(write_else
);
3218 if (equal
< 0 || !equal
) {
3219 isl_map_free(write_then
);
3223 nesting_enabled
= allow_nested
;
3224 pa
= extract_condition(stmt
->getCond());
3225 nesting_enabled
= save_nesting
;
3226 cond
= isl_pw_aff_non_zero_set(isl_pw_aff_copy(pa
));
3227 comp
= isl_pw_aff_zero_set(isl_pw_aff_copy(pa
));
3228 map
= isl_map_from_range(isl_set_from_pw_aff(pa
));
3230 pe_cond
= pet_expr_from_access(map
);
3232 pe_then
= extract_expr(ass_then
->getRHS());
3233 pe_then
= pet_expr_restrict(pe_then
, cond
);
3234 pe_else
= extract_expr(ass_else
->getRHS());
3235 pe_else
= pet_expr_restrict(pe_else
, comp
);
3237 pe
= pet_expr_new_ternary(ctx
, pe_cond
, pe_then
, pe_else
);
3238 pe_write
= pet_expr_from_access(write_then
);
3240 pe_write
->acc
.write
= 1;
3241 pe_write
->acc
.read
= 0;
3243 pe
= pet_expr_new_binary(ctx
, pet_op_assign
, pe_write
, pe
);
3244 return extract(stmt
, pe
);
3247 /* Create a pet_scop with a single statement evaluating "cond"
3248 * and writing the result to a virtual scalar, as expressed by
3251 struct pet_scop
*PetScan::extract_non_affine_condition(Expr
*cond
,
3252 __isl_take isl_map
*access
)
3254 struct pet_expr
*expr
, *write
;
3255 struct pet_stmt
*ps
;
3256 struct pet_scop
*scop
;
3257 SourceLocation loc
= cond
->getLocStart();
3258 int line
= PP
.getSourceManager().getExpansionLineNumber(loc
);
3260 write
= pet_expr_from_access(access
);
3262 write
->acc
.write
= 1;
3263 write
->acc
.read
= 0;
3265 expr
= extract_expr(cond
);
3266 expr
= resolve_nested(expr
);
3267 expr
= pet_expr_new_binary(ctx
, pet_op_assign
, write
, expr
);
3268 ps
= pet_stmt_from_pet_expr(ctx
, line
, NULL
, n_stmt
++, expr
);
3269 scop
= pet_scop_from_pet_stmt(ctx
, ps
);
3270 scop
= resolve_nested(scop
);
3276 static __isl_give isl_map
*embed_access(__isl_take isl_map
*access
,
3280 /* Apply the map pointed to by "user" to the domain of the access
3281 * relation, thereby embedding it in the range of the map.
3282 * The domain of both relations is the zero-dimensional domain.
3284 static __isl_give isl_map
*embed_access(__isl_take isl_map
*access
, void *user
)
3286 isl_map
*map
= (isl_map
*) user
;
3288 return isl_map_apply_domain(access
, isl_map_copy(map
));
3291 /* Apply "map" to all access relations in "expr".
3293 static struct pet_expr
*embed(struct pet_expr
*expr
, __isl_keep isl_map
*map
)
3295 return pet_expr_foreach_access(expr
, &embed_access
, map
);
3298 /* How many parameters of "set" refer to nested accesses, i.e., have no name?
3300 static int n_nested_parameter(__isl_keep isl_set
*set
)
3305 space
= isl_set_get_space(set
);
3306 n
= n_nested_parameter(space
);
3307 isl_space_free(space
);
3312 /* Remove all parameters from "map" that refer to nested accesses.
3314 static __isl_give isl_map
*remove_nested_parameters(__isl_take isl_map
*map
)
3319 space
= isl_map_get_space(map
);
3320 nparam
= isl_space_dim(space
, isl_dim_param
);
3321 for (int i
= nparam
- 1; i
>= 0; --i
)
3322 if (is_nested_parameter(space
, i
))
3323 map
= isl_map_project_out(map
, isl_dim_param
, i
, 1);
3324 isl_space_free(space
);
3330 static __isl_give isl_map
*access_remove_nested_parameters(
3331 __isl_take isl_map
*access
, void *user
);
3334 static __isl_give isl_map
*access_remove_nested_parameters(
3335 __isl_take isl_map
*access
, void *user
)
3337 return remove_nested_parameters(access
);
3340 /* Remove all nested access parameters from the schedule and all
3341 * accesses of "stmt".
3342 * There is no need to remove them from the domain as these parameters
3343 * have already been removed from the domain when this function is called.
3345 static struct pet_stmt
*remove_nested_parameters(struct pet_stmt
*stmt
)
3349 stmt
->schedule
= remove_nested_parameters(stmt
->schedule
);
3350 stmt
->body
= pet_expr_foreach_access(stmt
->body
,
3351 &access_remove_nested_parameters
, NULL
);
3352 if (!stmt
->schedule
|| !stmt
->body
)
3354 for (int i
= 0; i
< stmt
->n_arg
; ++i
) {
3355 stmt
->args
[i
] = pet_expr_foreach_access(stmt
->args
[i
],
3356 &access_remove_nested_parameters
, NULL
);
3363 pet_stmt_free(stmt
);
3367 /* For each nested access parameter in the domain of "stmt",
3368 * construct a corresponding pet_expr, place it before the original
3369 * elements in stmt->args and record its position in "param2pos".
3370 * n is the number of nested access parameters.
3372 struct pet_stmt
*PetScan::extract_nested(struct pet_stmt
*stmt
, int n
,
3373 std::map
<int,int> ¶m2pos
)
3378 struct pet_expr
**args
;
3380 n_arg
= stmt
->n_arg
;
3381 args
= isl_calloc_array(ctx
, struct pet_expr
*, n
+ n_arg
);
3385 space
= isl_set_get_space(stmt
->domain
);
3386 n_arg
= extract_nested(space
, 0, args
, param2pos
);
3387 isl_space_free(space
);
3392 for (i
= 0; i
< stmt
->n_arg
; ++i
)
3393 args
[n_arg
+ i
] = stmt
->args
[i
];
3396 stmt
->n_arg
+= n_arg
;
3401 for (i
= 0; i
< n
; ++i
)
3402 pet_expr_free(args
[i
]);
3405 pet_stmt_free(stmt
);
3409 /* Check whether any of the arguments i of "stmt" starting at position "n"
3410 * is equal to one of the first "n" arguments j.
3411 * If so, combine the constraints on arguments i and j and remove
3414 static struct pet_stmt
*remove_duplicate_arguments(struct pet_stmt
*stmt
, int n
)
3423 if (n
== stmt
->n_arg
)
3426 map
= isl_set_unwrap(stmt
->domain
);
3428 for (i
= stmt
->n_arg
- 1; i
>= n
; --i
) {
3429 for (j
= 0; j
< n
; ++j
)
3430 if (pet_expr_is_equal(stmt
->args
[i
], stmt
->args
[j
]))
3435 map
= isl_map_equate(map
, isl_dim_out
, i
, isl_dim_out
, j
);
3436 map
= isl_map_project_out(map
, isl_dim_out
, i
, 1);
3438 pet_expr_free(stmt
->args
[i
]);
3439 for (j
= i
; j
+ 1 < stmt
->n_arg
; ++j
)
3440 stmt
->args
[j
] = stmt
->args
[j
+ 1];
3444 stmt
->domain
= isl_map_wrap(map
);
3449 pet_stmt_free(stmt
);
3453 /* Look for parameters in the iteration domain of "stmt" that
3454 * refer to nested accesses. In particular, these are
3455 * parameters with no name.
3457 * If there are any such parameters, then as many extra variables
3458 * (after identifying identical nested accesses) are inserted in the
3459 * range of the map wrapped inside the domain, before the original variables.
3460 * If the original domain is not a wrapped map, then a new wrapped
3461 * map is created with zero output dimensions.
3462 * The parameters are then equated to the corresponding output dimensions
3463 * and subsequently projected out, from the iteration domain,
3464 * the schedule and the access relations.
3465 * For each of the output dimensions, a corresponding argument
3466 * expression is inserted. Initially they are created with
3467 * a zero-dimensional domain, so they have to be embedded
3468 * in the current iteration domain.
3469 * param2pos maps the position of the parameter to the position
3470 * of the corresponding output dimension in the wrapped map.
3472 struct pet_stmt
*PetScan::resolve_nested(struct pet_stmt
*stmt
)
3478 std::map
<int,int> param2pos
;
3483 n
= n_nested_parameter(stmt
->domain
);
3487 n_arg
= stmt
->n_arg
;
3488 stmt
= extract_nested(stmt
, n
, param2pos
);
3492 n
= stmt
->n_arg
- n_arg
;
3493 nparam
= isl_set_dim(stmt
->domain
, isl_dim_param
);
3494 if (isl_set_is_wrapping(stmt
->domain
))
3495 map
= isl_set_unwrap(stmt
->domain
);
3497 map
= isl_map_from_domain(stmt
->domain
);
3498 map
= isl_map_insert_dims(map
, isl_dim_out
, 0, n
);
3500 for (int i
= nparam
- 1; i
>= 0; --i
) {
3503 if (!is_nested_parameter(map
, i
))
3506 id
= isl_map_get_tuple_id(stmt
->args
[param2pos
[i
]]->acc
.access
,
3508 map
= isl_map_set_dim_id(map
, isl_dim_out
, param2pos
[i
], id
);
3509 map
= isl_map_equate(map
, isl_dim_param
, i
, isl_dim_out
,
3511 map
= isl_map_project_out(map
, isl_dim_param
, i
, 1);
3514 stmt
->domain
= isl_map_wrap(map
);
3516 map
= isl_set_unwrap(isl_set_copy(stmt
->domain
));
3517 map
= isl_map_from_range(isl_map_domain(map
));
3518 for (int pos
= 0; pos
< n
; ++pos
)
3519 stmt
->args
[pos
] = embed(stmt
->args
[pos
], map
);
3522 stmt
= remove_nested_parameters(stmt
);
3523 stmt
= remove_duplicate_arguments(stmt
, n
);
3527 pet_stmt_free(stmt
);
3531 /* For each statement in "scop", move the parameters that correspond
3532 * to nested access into the ranges of the domains and create
3533 * corresponding argument expressions.
3535 struct pet_scop
*PetScan::resolve_nested(struct pet_scop
*scop
)
3540 for (int i
= 0; i
< scop
->n_stmt
; ++i
) {
3541 scop
->stmts
[i
] = resolve_nested(scop
->stmts
[i
]);
3542 if (!scop
->stmts
[i
])
3548 pet_scop_free(scop
);
3552 /* Given an access expression "expr", is the variable accessed by
3553 * "expr" assigned anywhere inside "scop"?
3555 static bool is_assigned(pet_expr
*expr
, pet_scop
*scop
)
3557 bool assigned
= false;
3560 id
= isl_map_get_tuple_id(expr
->acc
.access
, isl_dim_out
);
3561 assigned
= pet_scop_writes(scop
, id
);
3567 /* Are all nested access parameters in "pa" allowed given "scop".
3568 * In particular, is none of them written by anywhere inside "scop".
3570 * If "scop" has any skip conditions, then no nested access parameters
3571 * are allowed. In particular, if there is any nested access in a guard
3572 * for a piece of code containing a "continue", then we want to introduce
3573 * a separate statement for evaluating this guard so that we can express
3574 * that the result is false for all previous iterations.
3576 bool PetScan::is_nested_allowed(__isl_keep isl_pw_aff
*pa
, pet_scop
*scop
)
3583 nparam
= isl_pw_aff_dim(pa
, isl_dim_param
);
3584 for (int i
= 0; i
< nparam
; ++i
) {
3586 isl_id
*id
= isl_pw_aff_get_dim_id(pa
, isl_dim_param
, i
);
3590 if (!is_nested_parameter(id
)) {
3595 if (pet_scop_has_skip(scop
, pet_skip_now
)) {
3600 nested
= (Expr
*) isl_id_get_user(id
);
3601 expr
= extract_expr(nested
);
3602 allowed
= expr
&& expr
->type
== pet_expr_access
&&
3603 !is_assigned(expr
, scop
);
3605 pet_expr_free(expr
);
3615 /* Do we need to construct a skip condition of the given type
3616 * on an if statement, given that the if condition is non-affine?
3618 * pet_scop_filter_skip can only handle the case where the if condition
3619 * holds (the then branch) and the skip condition is universal.
3620 * In any other case, we need to construct a new skip condition.
3622 static bool need_skip(struct pet_scop
*scop_then
, struct pet_scop
*scop_else
,
3623 bool have_else
, enum pet_skip type
)
3625 if (have_else
&& scop_else
&& pet_scop_has_skip(scop_else
, type
))
3627 if (scop_then
&& pet_scop_has_skip(scop_then
, type
) &&
3628 !pet_scop_has_universal_skip(scop_then
, type
))
3633 /* Do we need to construct a skip condition of the given type
3634 * on an if statement, given that the if condition is affine?
3636 * There is no need to construct a new skip condition if all
3637 * the skip conditions are affine.
3639 static bool need_skip_aff(struct pet_scop
*scop_then
,
3640 struct pet_scop
*scop_else
, bool have_else
, enum pet_skip type
)
3642 if (scop_then
&& pet_scop_has_var_skip(scop_then
, type
))
3644 if (have_else
&& scop_else
&& pet_scop_has_var_skip(scop_else
, type
))
3649 /* Do we need to construct a skip condition of the given type
3650 * on an if statement?
3652 static bool need_skip(struct pet_scop
*scop_then
, struct pet_scop
*scop_else
,
3653 bool have_else
, enum pet_skip type
, bool affine
)
3656 return need_skip_aff(scop_then
, scop_else
, have_else
, type
);
3658 return need_skip(scop_then
, scop_else
, have_else
, type
);
3661 /* Construct an affine expression pet_expr that is evaluates
3662 * to the constant "val".
3664 static struct pet_expr
*universally(isl_ctx
*ctx
, int val
)
3669 space
= isl_space_alloc(ctx
, 0, 0, 1);
3670 map
= isl_map_universe(space
);
3671 map
= isl_map_fix_si(map
, isl_dim_out
, 0, val
);
3673 return pet_expr_from_access(map
);
3676 /* Construct an affine expression pet_expr that is evaluates
3677 * to the constant 1.
3679 static struct pet_expr
*universally_true(isl_ctx
*ctx
)
3681 return universally(ctx
, 1);
3684 /* Construct an affine expression pet_expr that is evaluates
3685 * to the constant 0.
3687 static struct pet_expr
*universally_false(isl_ctx
*ctx
)
3689 return universally(ctx
, 0);
3692 /* Given an access relation "test_access" for the if condition,
3693 * an access relation "skip_access" for the skip condition and
3694 * scops for the then and else branches, construct a scop for
3695 * computing "skip_access".
3697 * The computed scop contains a single statement that essentially does
3699 * skip_cond = test_cond ? skip_cond_then : skip_cond_else
3701 * If the skip conditions of the then and/or else branch are not affine,
3702 * then they need to be filtered by test_access.
3703 * If they are missing, then this means the skip condition is false.
3705 * Since we are constructing a skip condition for the if statement,
3706 * the skip conditions on the then and else branches are removed.
3708 static struct pet_scop
*extract_skip(PetScan
*scan
,
3709 __isl_take isl_map
*test_access
, __isl_take isl_map
*skip_access
,
3710 struct pet_scop
*scop_then
, struct pet_scop
*scop_else
, bool have_else
,
3713 struct pet_expr
*expr_then
, *expr_else
, *expr
, *expr_skip
;
3714 struct pet_stmt
*stmt
;
3715 struct pet_scop
*scop
;
3716 isl_ctx
*ctx
= scan
->ctx
;
3720 if (have_else
&& !scop_else
)
3723 if (pet_scop_has_skip(scop_then
, type
)) {
3724 expr_then
= pet_scop_get_skip_expr(scop_then
, type
);
3725 pet_scop_reset_skip(scop_then
, type
);
3726 if (!pet_expr_is_affine(expr_then
))
3727 expr_then
= pet_expr_filter(expr_then
,
3728 isl_map_copy(test_access
), 1);
3730 expr_then
= universally_false(ctx
);
3732 if (have_else
&& pet_scop_has_skip(scop_else
, type
)) {
3733 expr_else
= pet_scop_get_skip_expr(scop_else
, type
);
3734 pet_scop_reset_skip(scop_else
, type
);
3735 if (!pet_expr_is_affine(expr_else
))
3736 expr_else
= pet_expr_filter(expr_else
,
3737 isl_map_copy(test_access
), 0);
3739 expr_else
= universally_false(ctx
);
3741 expr
= pet_expr_from_access(test_access
);
3742 expr
= pet_expr_new_ternary(ctx
, expr
, expr_then
, expr_else
);
3743 expr_skip
= pet_expr_from_access(isl_map_copy(skip_access
));
3745 expr_skip
->acc
.write
= 1;
3746 expr_skip
->acc
.read
= 0;
3748 expr
= pet_expr_new_binary(ctx
, pet_op_assign
, expr_skip
, expr
);
3749 stmt
= pet_stmt_from_pet_expr(ctx
, -1, NULL
, scan
->n_stmt
++, expr
);
3751 scop
= pet_scop_from_pet_stmt(ctx
, stmt
);
3752 scop
= scop_add_array(scop
, skip_access
, scan
->ast_context
);
3753 isl_map_free(skip_access
);
3757 isl_map_free(test_access
);
3758 isl_map_free(skip_access
);
3762 /* Is scop's skip_now condition equal to its skip_later condition?
3763 * In particular, this means that it either has no skip_now condition
3764 * or both a skip_now and a skip_later condition (that are equal to each other).
3766 static bool skip_equals_skip_later(struct pet_scop
*scop
)
3768 int has_skip_now
, has_skip_later
;
3770 isl_set
*skip_now
, *skip_later
;
3774 has_skip_now
= pet_scop_has_skip(scop
, pet_skip_now
);
3775 has_skip_later
= pet_scop_has_skip(scop
, pet_skip_later
);
3776 if (has_skip_now
!= has_skip_later
)
3781 skip_now
= pet_scop_get_skip(scop
, pet_skip_now
);
3782 skip_later
= pet_scop_get_skip(scop
, pet_skip_later
);
3783 equal
= isl_set_is_equal(skip_now
, skip_later
);
3784 isl_set_free(skip_now
);
3785 isl_set_free(skip_later
);
3790 /* Drop the skip conditions of type pet_skip_later from scop1 and scop2.
3792 static void drop_skip_later(struct pet_scop
*scop1
, struct pet_scop
*scop2
)
3794 pet_scop_reset_skip(scop1
, pet_skip_later
);
3795 pet_scop_reset_skip(scop2
, pet_skip_later
);
3798 /* Structure that handles the construction of skip conditions.
3800 * scop_then and scop_else represent the then and else branches
3801 * of the if statement
3803 * skip[type] is true if we need to construct a skip condition of that type
3804 * equal is set if the skip conditions of types pet_skip_now and pet_skip_later
3805 * are equal to each other
3806 * access[type] is the virtual array representing the skip condition
3807 * scop[type] is a scop for computing the skip condition
3809 struct pet_skip_info
{
3815 struct pet_scop
*scop
[2];
3817 pet_skip_info(isl_ctx
*ctx
) : ctx(ctx
) {}
3819 operator bool() { return skip
[pet_skip_now
] || skip
[pet_skip_later
]; }
3822 /* Structure that handles the construction of skip conditions on if statements.
3824 * scop_then and scop_else represent the then and else branches
3825 * of the if statement
3827 struct pet_skip_info_if
: public pet_skip_info
{
3828 struct pet_scop
*scop_then
, *scop_else
;
3831 pet_skip_info_if(isl_ctx
*ctx
, struct pet_scop
*scop_then
,
3832 struct pet_scop
*scop_else
, bool have_else
, bool affine
);
3833 void extract(PetScan
*scan
, __isl_keep isl_map
*access
,
3834 enum pet_skip type
);
3835 void extract(PetScan
*scan
, __isl_keep isl_map
*access
);
3836 void extract(PetScan
*scan
, __isl_keep isl_pw_aff
*cond
);
3837 struct pet_scop
*add(struct pet_scop
*scop
, enum pet_skip type
,
3839 struct pet_scop
*add(struct pet_scop
*scop
, int offset
);
3842 /* Initialize a pet_skip_info_if structure based on the then and else branches
3843 * and based on whether the if condition is affine or not.
3845 pet_skip_info_if::pet_skip_info_if(isl_ctx
*ctx
, struct pet_scop
*scop_then
,
3846 struct pet_scop
*scop_else
, bool have_else
, bool affine
) :
3847 pet_skip_info(ctx
), scop_then(scop_then
), scop_else(scop_else
),
3848 have_else(have_else
)
3850 skip
[pet_skip_now
] =
3851 need_skip(scop_then
, scop_else
, have_else
, pet_skip_now
, affine
);
3852 equal
= skip
[pet_skip_now
] && skip_equals_skip_later(scop_then
) &&
3853 (!have_else
|| skip_equals_skip_later(scop_else
));
3854 skip
[pet_skip_later
] = skip
[pet_skip_now
] && !equal
&&
3855 need_skip(scop_then
, scop_else
, have_else
, pet_skip_later
, affine
);
3858 /* If we need to construct a skip condition of the given type,
3861 * "map" represents the if condition.
3863 void pet_skip_info_if::extract(PetScan
*scan
, __isl_keep isl_map
*map
,
3869 access
[type
] = create_test_access(isl_map_get_ctx(map
), scan
->n_test
++);
3870 scop
[type
] = extract_skip(scan
, isl_map_copy(map
),
3871 isl_map_copy(access
[type
]),
3872 scop_then
, scop_else
, have_else
, type
);
3875 /* Construct the required skip conditions, given the if condition "map".
3877 void pet_skip_info_if::extract(PetScan
*scan
, __isl_keep isl_map
*map
)
3879 extract(scan
, map
, pet_skip_now
);
3880 extract(scan
, map
, pet_skip_later
);
3882 drop_skip_later(scop_then
, scop_else
);
3885 /* Construct the required skip conditions, given the if condition "cond".
3887 void pet_skip_info_if::extract(PetScan
*scan
, __isl_keep isl_pw_aff
*cond
)
3892 if (!skip
[pet_skip_now
] && !skip
[pet_skip_later
])
3895 test_set
= isl_set_from_pw_aff(isl_pw_aff_copy(cond
));
3896 test
= isl_map_from_range(test_set
);
3897 extract(scan
, test
);
3901 /* Add the computed skip condition of the give type to "main" and
3902 * add the scop for computing the condition at the given offset.
3904 * If equal is set, then we only computed a skip condition for pet_skip_now,
3905 * but we also need to set it as main's pet_skip_later.
3907 struct pet_scop
*pet_skip_info_if::add(struct pet_scop
*main
,
3908 enum pet_skip type
, int offset
)
3915 skip_set
= isl_map_range(access
[type
]);
3916 access
[type
] = NULL
;
3917 scop
[type
] = pet_scop_prefix(scop
[type
], offset
);
3918 main
= pet_scop_add_par(ctx
, main
, scop
[type
]);
3922 main
= pet_scop_set_skip(main
, pet_skip_later
,
3923 isl_set_copy(skip_set
));
3925 main
= pet_scop_set_skip(main
, type
, skip_set
);
3930 /* Add the computed skip conditions to "main" and
3931 * add the scops for computing the conditions at the given offset.
3933 struct pet_scop
*pet_skip_info_if::add(struct pet_scop
*scop
, int offset
)
3935 scop
= add(scop
, pet_skip_now
, offset
);
3936 scop
= add(scop
, pet_skip_later
, offset
);
3941 /* Construct a pet_scop for a non-affine if statement.
3943 * We create a separate statement that writes the result
3944 * of the non-affine condition to a virtual scalar.
3945 * A constraint requiring the value of this virtual scalar to be one
3946 * is added to the iteration domains of the then branch.
3947 * Similarly, a constraint requiring the value of this virtual scalar
3948 * to be zero is added to the iteration domains of the else branch, if any.
3949 * We adjust the schedules to ensure that the virtual scalar is written
3950 * before it is read.
3952 * If there are any breaks or continues in the then and/or else
3953 * branches, then we may have to compute a new skip condition.
3954 * This is handled using a pet_skip_info_if object.
3955 * On initialization, the object checks if skip conditions need
3956 * to be computed. If so, it does so in "extract" and adds them in "add".
3958 struct pet_scop
*PetScan::extract_non_affine_if(Expr
*cond
,
3959 struct pet_scop
*scop_then
, struct pet_scop
*scop_else
,
3960 bool have_else
, int stmt_id
)
3962 struct pet_scop
*scop
;
3963 isl_map
*test_access
;
3964 int save_n_stmt
= n_stmt
;
3966 test_access
= create_test_access(ctx
, n_test
++);
3968 scop
= extract_non_affine_condition(cond
, isl_map_copy(test_access
));
3969 n_stmt
= save_n_stmt
;
3970 scop
= scop_add_array(scop
, test_access
, ast_context
);
3972 pet_skip_info_if
skip(ctx
, scop_then
, scop_else
, have_else
, false);
3973 skip
.extract(this, test_access
);
3975 scop
= pet_scop_prefix(scop
, 0);
3976 scop_then
= pet_scop_prefix(scop_then
, 1);
3977 scop_then
= pet_scop_filter(scop_then
, isl_map_copy(test_access
), 1);
3979 scop_else
= pet_scop_prefix(scop_else
, 1);
3980 scop_else
= pet_scop_filter(scop_else
, test_access
, 0);
3981 scop_then
= pet_scop_add_par(ctx
, scop_then
, scop_else
);
3983 isl_map_free(test_access
);
3985 scop
= pet_scop_add_seq(ctx
, scop
, scop_then
);
3987 scop
= skip
.add(scop
, 2);
3992 /* Construct a pet_scop for an if statement.
3994 * If the condition fits the pattern of a conditional assignment,
3995 * then it is handled by extract_conditional_assignment.
3996 * Otherwise, we do the following.
3998 * If the condition is affine, then the condition is added
3999 * to the iteration domains of the then branch, while the
4000 * opposite of the condition in added to the iteration domains
4001 * of the else branch, if any.
4002 * We allow the condition to be dynamic, i.e., to refer to
4003 * scalars or array elements that may be written to outside
4004 * of the given if statement. These nested accesses are then represented
4005 * as output dimensions in the wrapping iteration domain.
4006 * If it also written _inside_ the then or else branch, then
4007 * we treat the condition as non-affine.
4008 * As explained in extract_non_affine_if, this will introduce
4009 * an extra statement.
4010 * For aesthetic reasons, we want this statement to have a statement
4011 * number that is lower than those of the then and else branches.
4012 * In order to evaluate if will need such a statement, however, we
4013 * first construct scops for the then and else branches.
4014 * We therefore reserve a statement number if we might have to
4015 * introduce such an extra statement.
4017 * If the condition is not affine, then the scop is created in
4018 * extract_non_affine_if.
4020 * If there are any breaks or continues in the then and/or else
4021 * branches, then we may have to compute a new skip condition.
4022 * This is handled using a pet_skip_info_if object.
4023 * On initialization, the object checks if skip conditions need
4024 * to be computed. If so, it does so in "extract" and adds them in "add".
4026 struct pet_scop
*PetScan::extract(IfStmt
*stmt
)
4028 struct pet_scop
*scop_then
, *scop_else
= NULL
, *scop
;
4034 scop
= extract_conditional_assignment(stmt
);
4038 cond
= try_extract_nested_condition(stmt
->getCond());
4039 if (allow_nested
&& (!cond
|| has_nested(cond
)))
4043 assigned_value_cache
cache(assigned_value
);
4044 scop_then
= extract(stmt
->getThen());
4047 if (stmt
->getElse()) {
4048 assigned_value_cache
cache(assigned_value
);
4049 scop_else
= extract(stmt
->getElse());
4050 if (options
->autodetect
) {
4051 if (scop_then
&& !scop_else
) {
4053 isl_pw_aff_free(cond
);
4056 if (!scop_then
&& scop_else
) {
4058 isl_pw_aff_free(cond
);
4065 (!is_nested_allowed(cond
, scop_then
) ||
4066 (stmt
->getElse() && !is_nested_allowed(cond
, scop_else
)))) {
4067 isl_pw_aff_free(cond
);
4070 if (allow_nested
&& !cond
)
4071 return extract_non_affine_if(stmt
->getCond(), scop_then
,
4072 scop_else
, stmt
->getElse(), stmt_id
);
4075 cond
= extract_condition(stmt
->getCond());
4077 pet_skip_info_if
skip(ctx
, scop_then
, scop_else
, stmt
->getElse(), true);
4078 skip
.extract(this, cond
);
4080 valid
= isl_pw_aff_domain(isl_pw_aff_copy(cond
));
4081 set
= isl_pw_aff_non_zero_set(cond
);
4082 scop
= pet_scop_restrict(scop_then
, isl_set_copy(set
));
4084 if (stmt
->getElse()) {
4085 set
= isl_set_subtract(isl_set_copy(valid
), set
);
4086 scop_else
= pet_scop_restrict(scop_else
, set
);
4087 scop
= pet_scop_add_par(ctx
, scop
, scop_else
);
4090 scop
= resolve_nested(scop
);
4091 scop
= pet_scop_restrict_context(scop
, valid
);
4094 scop
= pet_scop_prefix(scop
, 0);
4095 scop
= skip
.add(scop
, 1);
4100 /* Try and construct a pet_scop for a label statement.
4101 * We currently only allow labels on expression statements.
4103 struct pet_scop
*PetScan::extract(LabelStmt
*stmt
)
4108 sub
= stmt
->getSubStmt();
4109 if (!isa
<Expr
>(sub
)) {
4114 label
= isl_id_alloc(ctx
, stmt
->getName(), NULL
);
4116 return extract(sub
, extract_expr(cast
<Expr
>(sub
)), label
);
4119 /* Construct a pet_scop for a continue statement.
4121 * We simply create an empty scop with a universal pet_skip_now
4122 * skip condition. This skip condition will then be taken into
4123 * account by the enclosing loop construct, possibly after
4124 * being incorporated into outer skip conditions.
4126 struct pet_scop
*PetScan::extract(ContinueStmt
*stmt
)
4132 scop
= pet_scop_empty(ctx
);
4136 space
= isl_space_set_alloc(ctx
, 0, 1);
4137 set
= isl_set_universe(space
);
4138 set
= isl_set_fix_si(set
, isl_dim_set
, 0, 1);
4139 scop
= pet_scop_set_skip(scop
, pet_skip_now
, set
);
4144 /* Construct a pet_scop for a break statement.
4146 * We simply create an empty scop with both a universal pet_skip_now
4147 * skip condition and a universal pet_skip_later skip condition.
4148 * These skip conditions will then be taken into
4149 * account by the enclosing loop construct, possibly after
4150 * being incorporated into outer skip conditions.
4152 struct pet_scop
*PetScan::extract(BreakStmt
*stmt
)
4158 scop
= pet_scop_empty(ctx
);
4162 space
= isl_space_set_alloc(ctx
, 0, 1);
4163 set
= isl_set_universe(space
);
4164 set
= isl_set_fix_si(set
, isl_dim_set
, 0, 1);
4165 scop
= pet_scop_set_skip(scop
, pet_skip_now
, isl_set_copy(set
));
4166 scop
= pet_scop_set_skip(scop
, pet_skip_later
, set
);
4171 /* Try and construct a pet_scop corresponding to "stmt".
4173 struct pet_scop
*PetScan::extract(Stmt
*stmt
)
4175 if (isa
<Expr
>(stmt
))
4176 return extract(stmt
, extract_expr(cast
<Expr
>(stmt
)));
4178 switch (stmt
->getStmtClass()) {
4179 case Stmt::WhileStmtClass
:
4180 return extract(cast
<WhileStmt
>(stmt
));
4181 case Stmt::ForStmtClass
:
4182 return extract_for(cast
<ForStmt
>(stmt
));
4183 case Stmt::IfStmtClass
:
4184 return extract(cast
<IfStmt
>(stmt
));
4185 case Stmt::CompoundStmtClass
:
4186 return extract(cast
<CompoundStmt
>(stmt
));
4187 case Stmt::LabelStmtClass
:
4188 return extract(cast
<LabelStmt
>(stmt
));
4189 case Stmt::ContinueStmtClass
:
4190 return extract(cast
<ContinueStmt
>(stmt
));
4191 case Stmt::BreakStmtClass
:
4192 return extract(cast
<BreakStmt
>(stmt
));
4200 /* Do we need to construct a skip condition of the given type
4201 * on a sequence of statements?
4203 * There is no need to construct a new skip condition if only
4204 * only of the two statements has a skip condition or if both
4205 * of their skip conditions are affine.
4207 * In principle we also don't need a new continuation variable if
4208 * the continuation of scop2 is affine, but then we would need
4209 * to allow more complicated forms of continuations.
4211 static bool need_skip_seq(struct pet_scop
*scop1
, struct pet_scop
*scop2
,
4214 if (!scop1
|| !pet_scop_has_skip(scop1
, type
))
4216 if (!scop2
|| !pet_scop_has_skip(scop2
, type
))
4218 if (pet_scop_has_affine_skip(scop1
, type
) &&
4219 pet_scop_has_affine_skip(scop2
, type
))
4224 /* Construct a scop for computing the skip condition of the given type and
4225 * with access relation "skip_access" for a sequence of two scops "scop1"
4228 * The computed scop contains a single statement that essentially does
4230 * skip_cond = skip_cond_1 ? 1 : skip_cond_2
4232 * or, in other words, skip_cond1 || skip_cond2.
4233 * In this expression, skip_cond_2 is filtered to reflect that it is
4234 * only evaluated when skip_cond_1 is false.
4236 * The skip condition on scop1 is not removed because it still needs
4237 * to be applied to scop2 when these two scops are combined.
4239 static struct pet_scop
*extract_skip_seq(PetScan
*ps
,
4240 __isl_take isl_map
*skip_access
,
4241 struct pet_scop
*scop1
, struct pet_scop
*scop2
, enum pet_skip type
)
4244 struct pet_expr
*expr1
, *expr2
, *expr
, *expr_skip
;
4245 struct pet_stmt
*stmt
;
4246 struct pet_scop
*scop
;
4247 isl_ctx
*ctx
= ps
->ctx
;
4249 if (!scop1
|| !scop2
)
4252 expr1
= pet_scop_get_skip_expr(scop1
, type
);
4253 expr2
= pet_scop_get_skip_expr(scop2
, type
);
4254 pet_scop_reset_skip(scop2
, type
);
4256 expr2
= pet_expr_filter(expr2
, isl_map_copy(expr1
->acc
.access
), 0);
4258 expr
= universally_true(ctx
);
4259 expr
= pet_expr_new_ternary(ctx
, expr1
, expr
, expr2
);
4260 expr_skip
= pet_expr_from_access(isl_map_copy(skip_access
));
4262 expr_skip
->acc
.write
= 1;
4263 expr_skip
->acc
.read
= 0;
4265 expr
= pet_expr_new_binary(ctx
, pet_op_assign
, expr_skip
, expr
);
4266 stmt
= pet_stmt_from_pet_expr(ctx
, -1, NULL
, ps
->n_stmt
++, expr
);
4268 scop
= pet_scop_from_pet_stmt(ctx
, stmt
);
4269 scop
= scop_add_array(scop
, skip_access
, ps
->ast_context
);
4270 isl_map_free(skip_access
);
4274 isl_map_free(skip_access
);
4278 /* Structure that handles the construction of skip conditions
4279 * on sequences of statements.
4281 * scop1 and scop2 represent the two statements that are combined
4283 struct pet_skip_info_seq
: public pet_skip_info
{
4284 struct pet_scop
*scop1
, *scop2
;
4286 pet_skip_info_seq(isl_ctx
*ctx
, struct pet_scop
*scop1
,
4287 struct pet_scop
*scop2
);
4288 void extract(PetScan
*scan
, enum pet_skip type
);
4289 void extract(PetScan
*scan
);
4290 struct pet_scop
*add(struct pet_scop
*scop
, enum pet_skip type
,
4292 struct pet_scop
*add(struct pet_scop
*scop
, int offset
);
4295 /* Initialize a pet_skip_info_seq structure based on
4296 * on the two statements that are going to be combined.
4298 pet_skip_info_seq::pet_skip_info_seq(isl_ctx
*ctx
, struct pet_scop
*scop1
,
4299 struct pet_scop
*scop2
) : pet_skip_info(ctx
), scop1(scop1
), scop2(scop2
)
4301 skip
[pet_skip_now
] = need_skip_seq(scop1
, scop2
, pet_skip_now
);
4302 equal
= skip
[pet_skip_now
] && skip_equals_skip_later(scop1
) &&
4303 skip_equals_skip_later(scop2
);
4304 skip
[pet_skip_later
] = skip
[pet_skip_now
] && !equal
&&
4305 need_skip_seq(scop1
, scop2
, pet_skip_later
);
4308 /* If we need to construct a skip condition of the given type,
4311 void pet_skip_info_seq::extract(PetScan
*scan
, enum pet_skip type
)
4316 access
[type
] = create_test_access(ctx
, scan
->n_test
++);
4317 scop
[type
] = extract_skip_seq(scan
, isl_map_copy(access
[type
]),
4318 scop1
, scop2
, type
);
4321 /* Construct the required skip conditions.
4323 void pet_skip_info_seq::extract(PetScan
*scan
)
4325 extract(scan
, pet_skip_now
);
4326 extract(scan
, pet_skip_later
);
4328 drop_skip_later(scop1
, scop2
);
4331 /* Add the computed skip condition of the give type to "main" and
4332 * add the scop for computing the condition at the given offset (the statement
4333 * number). Within this offset, the condition is computed at position 1
4334 * to ensure that it is computed after the corresponding statement.
4336 * If equal is set, then we only computed a skip condition for pet_skip_now,
4337 * but we also need to set it as main's pet_skip_later.
4339 struct pet_scop
*pet_skip_info_seq::add(struct pet_scop
*main
,
4340 enum pet_skip type
, int offset
)
4347 skip_set
= isl_map_range(access
[type
]);
4348 access
[type
] = NULL
;
4349 scop
[type
] = pet_scop_prefix(scop
[type
], 1);
4350 scop
[type
] = pet_scop_prefix(scop
[type
], offset
);
4351 main
= pet_scop_add_par(ctx
, main
, scop
[type
]);
4355 main
= pet_scop_set_skip(main
, pet_skip_later
,
4356 isl_set_copy(skip_set
));
4358 main
= pet_scop_set_skip(main
, type
, skip_set
);
4363 /* Add the computed skip conditions to "main" and
4364 * add the scops for computing the conditions at the given offset.
4366 struct pet_scop
*pet_skip_info_seq::add(struct pet_scop
*scop
, int offset
)
4368 scop
= add(scop
, pet_skip_now
, offset
);
4369 scop
= add(scop
, pet_skip_later
, offset
);
4374 /* Try and construct a pet_scop corresponding to (part of)
4375 * a sequence of statements.
4377 * If there are any breaks or continues in the individual statements,
4378 * then we may have to compute a new skip condition.
4379 * This is handled using a pet_skip_info_seq object.
4380 * On initialization, the object checks if skip conditions need
4381 * to be computed. If so, it does so in "extract" and adds them in "add".
4383 struct pet_scop
*PetScan::extract(StmtRange stmt_range
)
4388 bool partial_range
= false;
4390 scop
= pet_scop_empty(ctx
);
4391 for (i
= stmt_range
.first
, j
= 0; i
!= stmt_range
.second
; ++i
, ++j
) {
4393 struct pet_scop
*scop_i
;
4395 scop_i
= extract(child
);
4396 if (scop
&& partial
) {
4397 pet_scop_free(scop_i
);
4400 pet_skip_info_seq
skip(ctx
, scop
, scop_i
);
4403 scop_i
= pet_scop_prefix(scop_i
, 0);
4404 scop_i
= pet_scop_prefix(scop_i
, j
);
4405 if (options
->autodetect
) {
4407 scop
= pet_scop_add_seq(ctx
, scop
, scop_i
);
4409 partial_range
= true;
4410 if (scop
->n_stmt
!= 0 && !scop_i
)
4413 scop
= pet_scop_add_seq(ctx
, scop
, scop_i
);
4416 scop
= skip
.add(scop
, j
);
4422 if (scop
&& partial_range
)
4428 /* Return the file offset of the expansion location of "Loc".
4430 static unsigned getExpansionOffset(SourceManager
&SM
, SourceLocation Loc
)
4432 return SM
.getFileOffset(SM
.getExpansionLoc(Loc
));
4435 /* Check if the scop marked by the user is exactly this Stmt
4436 * or part of this Stmt.
4437 * If so, return a pet_scop corresponding to the marked region.
4438 * Otherwise, return NULL.
4440 struct pet_scop
*PetScan::scan(Stmt
*stmt
)
4442 SourceManager
&SM
= PP
.getSourceManager();
4443 unsigned start_off
, end_off
;
4445 start_off
= getExpansionOffset(SM
, stmt
->getLocStart());
4446 end_off
= getExpansionOffset(SM
, stmt
->getLocEnd());
4448 if (start_off
> loc
.end
)
4450 if (end_off
< loc
.start
)
4452 if (start_off
>= loc
.start
&& end_off
<= loc
.end
) {
4453 return extract(stmt
);
4457 for (start
= stmt
->child_begin(); start
!= stmt
->child_end(); ++start
) {
4458 Stmt
*child
= *start
;
4461 start_off
= getExpansionOffset(SM
, child
->getLocStart());
4462 end_off
= getExpansionOffset(SM
, child
->getLocEnd());
4463 if (start_off
< loc
.start
&& end_off
> loc
.end
)
4465 if (start_off
>= loc
.start
)
4470 for (end
= start
; end
!= stmt
->child_end(); ++end
) {
4472 start_off
= SM
.getFileOffset(child
->getLocStart());
4473 if (start_off
>= loc
.end
)
4477 return extract(StmtRange(start
, end
));
4480 /* Set the size of index "pos" of "array" to "size".
4481 * In particular, add a constraint of the form
4485 * to array->extent and a constraint of the form
4489 * to array->context.
4491 static struct pet_array
*update_size(struct pet_array
*array
, int pos
,
4492 __isl_take isl_pw_aff
*size
)
4502 valid
= isl_pw_aff_nonneg_set(isl_pw_aff_copy(size
));
4503 array
->context
= isl_set_intersect(array
->context
, valid
);
4505 dim
= isl_set_get_space(array
->extent
);
4506 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
4507 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, pos
, 1);
4508 univ
= isl_set_universe(isl_aff_get_domain_space(aff
));
4509 index
= isl_pw_aff_alloc(univ
, aff
);
4511 size
= isl_pw_aff_add_dims(size
, isl_dim_in
,
4512 isl_set_dim(array
->extent
, isl_dim_set
));
4513 id
= isl_set_get_tuple_id(array
->extent
);
4514 size
= isl_pw_aff_set_tuple_id(size
, isl_dim_in
, id
);
4515 bound
= isl_pw_aff_lt_set(index
, size
);
4517 array
->extent
= isl_set_intersect(array
->extent
, bound
);
4519 if (!array
->context
|| !array
->extent
)
4524 pet_array_free(array
);
4528 /* Figure out the size of the array at position "pos" and all
4529 * subsequent positions from "type" and update "array" accordingly.
4531 struct pet_array
*PetScan::set_upper_bounds(struct pet_array
*array
,
4532 const Type
*type
, int pos
)
4534 const ArrayType
*atype
;
4540 if (type
->isPointerType()) {
4541 type
= type
->getPointeeType().getTypePtr();
4542 return set_upper_bounds(array
, type
, pos
+ 1);
4544 if (!type
->isArrayType())
4547 type
= type
->getCanonicalTypeInternal().getTypePtr();
4548 atype
= cast
<ArrayType
>(type
);
4550 if (type
->isConstantArrayType()) {
4551 const ConstantArrayType
*ca
= cast
<ConstantArrayType
>(atype
);
4552 size
= extract_affine(ca
->getSize());
4553 array
= update_size(array
, pos
, size
);
4554 } else if (type
->isVariableArrayType()) {
4555 const VariableArrayType
*vla
= cast
<VariableArrayType
>(atype
);
4556 size
= extract_affine(vla
->getSizeExpr());
4557 array
= update_size(array
, pos
, size
);
4560 type
= atype
->getElementType().getTypePtr();
4562 return set_upper_bounds(array
, type
, pos
+ 1);
4565 /* Is "T" the type of a variable length array with static size?
4567 static bool is_vla_with_static_size(QualType T
)
4569 const VariableArrayType
*vlatype
;
4571 if (!T
->isVariableArrayType())
4573 vlatype
= cast
<VariableArrayType
>(T
);
4574 return vlatype
->getSizeModifier() == VariableArrayType::Static
;
4577 /* Return the type of "decl" as an array.
4579 * In particular, if "decl" is a parameter declaration that
4580 * is a variable length array with a static size, then
4581 * return the original type (i.e., the variable length array).
4582 * Otherwise, return the type of decl.
4584 static QualType
get_array_type(ValueDecl
*decl
)
4589 parm
= dyn_cast
<ParmVarDecl
>(decl
);
4591 return decl
->getType();
4593 T
= parm
->getOriginalType();
4594 if (!is_vla_with_static_size(T
))
4595 return decl
->getType();
4599 /* Construct and return a pet_array corresponding to the variable "decl".
4600 * In particular, initialize array->extent to
4602 * { name[i_1,...,i_d] : i_1,...,i_d >= 0 }
4604 * and then call set_upper_bounds to set the upper bounds on the indices
4605 * based on the type of the variable.
4607 struct pet_array
*PetScan::extract_array(isl_ctx
*ctx
, ValueDecl
*decl
)
4609 struct pet_array
*array
;
4610 QualType qt
= get_array_type(decl
);
4611 const Type
*type
= qt
.getTypePtr();
4612 int depth
= array_depth(type
);
4613 QualType base
= base_type(qt
);
4618 array
= isl_calloc_type(ctx
, struct pet_array
);
4622 id
= isl_id_alloc(ctx
, decl
->getName().str().c_str(), decl
);
4623 dim
= isl_space_set_alloc(ctx
, 0, depth
);
4624 dim
= isl_space_set_tuple_id(dim
, isl_dim_set
, id
);
4626 array
->extent
= isl_set_nat_universe(dim
);
4628 dim
= isl_space_params_alloc(ctx
, 0);
4629 array
->context
= isl_set_universe(dim
);
4631 array
= set_upper_bounds(array
, type
, 0);
4635 name
= base
.getAsString();
4636 array
->element_type
= strdup(name
.c_str());
4637 array
->element_size
= decl
->getASTContext().getTypeInfo(base
).first
/ 8;
4642 /* Construct a list of pet_arrays, one for each array (or scalar)
4643 * accessed inside "scop", add this list to "scop" and return the result.
4645 * The context of "scop" is updated with the intersection of
4646 * the contexts of all arrays, i.e., constraints on the parameters
4647 * that ensure that the arrays have a valid (non-negative) size.
4649 struct pet_scop
*PetScan::scan_arrays(struct pet_scop
*scop
)
4652 set
<ValueDecl
*> arrays
;
4653 set
<ValueDecl
*>::iterator it
;
4655 struct pet_array
**scop_arrays
;
4660 pet_scop_collect_arrays(scop
, arrays
);
4661 if (arrays
.size() == 0)
4664 n_array
= scop
->n_array
;
4666 scop_arrays
= isl_realloc_array(ctx
, scop
->arrays
, struct pet_array
*,
4667 n_array
+ arrays
.size());
4670 scop
->arrays
= scop_arrays
;
4672 for (it
= arrays
.begin(), i
= 0; it
!= arrays
.end(); ++it
, ++i
) {
4673 struct pet_array
*array
;
4674 scop
->arrays
[n_array
+ i
] = array
= extract_array(ctx
, *it
);
4675 if (!scop
->arrays
[n_array
+ i
])
4678 scop
->context
= isl_set_intersect(scop
->context
,
4679 isl_set_copy(array
->context
));
4686 pet_scop_free(scop
);
4690 /* Bound all parameters in scop->context to the possible values
4691 * of the corresponding C variable.
4693 static struct pet_scop
*add_parameter_bounds(struct pet_scop
*scop
)
4700 n
= isl_set_dim(scop
->context
, isl_dim_param
);
4701 for (int i
= 0; i
< n
; ++i
) {
4705 id
= isl_set_get_dim_id(scop
->context
, isl_dim_param
, i
);
4706 if (is_nested_parameter(id
)) {
4708 isl_die(isl_set_get_ctx(scop
->context
),
4710 "unresolved nested parameter", goto error
);
4712 decl
= (ValueDecl
*) isl_id_get_user(id
);
4715 scop
->context
= set_parameter_bounds(scop
->context
, i
, decl
);
4723 pet_scop_free(scop
);
4727 /* Construct a pet_scop from the given function.
4729 struct pet_scop
*PetScan::scan(FunctionDecl
*fd
)
4734 stmt
= fd
->getBody();
4736 if (options
->autodetect
)
4737 scop
= extract(stmt
);
4740 scop
= pet_scop_detect_parameter_accesses(scop
);
4741 scop
= scan_arrays(scop
);
4742 scop
= add_parameter_bounds(scop
);
4743 scop
= pet_scop_gist(scop
, value_bounds
);