1 //===- ScalarEvolution.cpp - Scalar Evolution Analysis ----------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file contains the implementation of the scalar evolution analysis
11 // engine, which is used primarily to analyze expressions involving induction
12 // variables in loops.
14 // There are several aspects to this library. First is the representation of
15 // scalar expressions, which are represented as subclasses of the SCEV class.
16 // These classes are used to represent certain types of subexpressions that we
17 // can handle. These classes are reference counted, managed by the SCEVHandle
18 // class. We only create one SCEV of a particular shape, so pointer-comparisons
19 // for equality are legal.
21 // One important aspect of the SCEV objects is that they are never cyclic, even
22 // if there is a cycle in the dataflow for an expression (ie, a PHI node). If
23 // the PHI node is one of the idioms that we can represent (e.g., a polynomial
24 // recurrence) then we represent it directly as a recurrence node, otherwise we
25 // represent it as a SCEVUnknown node.
27 // In addition to being able to represent expressions of various types, we also
28 // have folders that are used to build the *canonical* representation for a
29 // particular expression. These folders are capable of using a variety of
30 // rewrite rules to simplify the expressions.
32 // Once the folders are defined, we can implement the more interesting
33 // higher-level code, such as the code that recognizes PHI nodes of various
34 // types, computes the execution count of a loop, etc.
36 // TODO: We should use these routines and value representations to implement
37 // dependence analysis!
39 //===----------------------------------------------------------------------===//
41 // There are several good references for the techniques used in this analysis.
43 // Chains of recurrences -- a method to expedite the evaluation
44 // of closed-form functions
45 // Olaf Bachmann, Paul S. Wang, Eugene V. Zima
47 // On computational properties of chains of recurrences
50 // Symbolic Evaluation of Chains of Recurrences for Loop Optimization
51 // Robert A. van Engelen
53 // Efficient Symbolic Analysis for Optimizing Compilers
54 // Robert A. van Engelen
56 // Using the chains of recurrences algebra for data dependence testing and
57 // induction variable substitution
58 // MS Thesis, Johnie Birch
60 //===----------------------------------------------------------------------===//
62 #define DEBUG_TYPE "scalar-evolution"
63 #include "llvm/Analysis/ScalarEvolutionExpressions.h"
64 #include "llvm/Constants.h"
65 #include "llvm/DerivedTypes.h"
66 #include "llvm/GlobalVariable.h"
67 #include "llvm/Instructions.h"
68 #include "llvm/Analysis/ConstantFolding.h"
69 #include "llvm/Analysis/Dominators.h"
70 #include "llvm/Analysis/LoopInfo.h"
71 #include "llvm/Analysis/ValueTracking.h"
72 #include "llvm/Assembly/Writer.h"
73 #include "llvm/Target/TargetData.h"
74 #include "llvm/Support/CommandLine.h"
75 #include "llvm/Support/Compiler.h"
76 #include "llvm/Support/ConstantRange.h"
77 #include "llvm/Support/GetElementPtrTypeIterator.h"
78 #include "llvm/Support/InstIterator.h"
79 #include "llvm/Support/ManagedStatic.h"
80 #include "llvm/Support/MathExtras.h"
81 #include "llvm/Support/raw_ostream.h"
82 #include "llvm/ADT/Statistic.h"
83 #include "llvm/ADT/STLExtras.h"
87 STATISTIC(NumArrayLenItCounts,
88 "Number of trip counts computed with array length");
89 STATISTIC(NumTripCountsComputed,
90 "Number of loops with predictable loop counts");
91 STATISTIC(NumTripCountsNotComputed,
92 "Number of loops without predictable loop counts");
93 STATISTIC(NumBruteForceTripCountsComputed,
94 "Number of loops with trip counts computed by force");
96 static cl::opt<unsigned>
97 MaxBruteForceIterations("scalar-evolution-max-iterations", cl::ReallyHidden,
98 cl::desc("Maximum number of iterations SCEV will "
99 "symbolically execute a constant derived loop"),
102 static RegisterPass<ScalarEvolution>
103 R("scalar-evolution", "Scalar Evolution Analysis", false, true);
104 char ScalarEvolution::ID = 0;
106 //===----------------------------------------------------------------------===//
107 // SCEV class definitions
108 //===----------------------------------------------------------------------===//
110 //===----------------------------------------------------------------------===//
111 // Implementation of the SCEV class.
114 void SCEV::dump() const {
119 void SCEV::print(std::ostream &o) const {
120 raw_os_ostream OS(o);
124 bool SCEV::isZero() const {
125 if (const SCEVConstant *SC = dyn_cast<SCEVConstant>(this))
126 return SC->getValue()->isZero();
130 bool SCEV::isOne() const {
131 if (const SCEVConstant *SC = dyn_cast<SCEVConstant>(this))
132 return SC->getValue()->isOne();
136 SCEVCouldNotCompute::SCEVCouldNotCompute(const ScalarEvolution* p) :
137 SCEV(scCouldNotCompute, p) {}
138 SCEVCouldNotCompute::~SCEVCouldNotCompute() {}
140 bool SCEVCouldNotCompute::isLoopInvariant(const Loop *L) const {
141 assert(0 && "Attempt to use a SCEVCouldNotCompute object!");
145 const Type *SCEVCouldNotCompute::getType() const {
146 assert(0 && "Attempt to use a SCEVCouldNotCompute object!");
150 bool SCEVCouldNotCompute::hasComputableLoopEvolution(const Loop *L) const {
151 assert(0 && "Attempt to use a SCEVCouldNotCompute object!");
155 SCEVHandle SCEVCouldNotCompute::
156 replaceSymbolicValuesWithConcrete(const SCEVHandle &Sym,
157 const SCEVHandle &Conc,
158 ScalarEvolution &SE) const {
162 void SCEVCouldNotCompute::print(raw_ostream &OS) const {
163 OS << "***COULDNOTCOMPUTE***";
166 bool SCEVCouldNotCompute::classof(const SCEV *S) {
167 return S->getSCEVType() == scCouldNotCompute;
171 // SCEVConstants - Only allow the creation of one SCEVConstant for any
172 // particular value. Don't use a SCEVHandle here, or else the object will
174 static ManagedStatic<std::map<ConstantInt*, SCEVConstant*> > SCEVConstants;
177 SCEVConstant::~SCEVConstant() {
178 SCEVConstants->erase(V);
181 SCEVHandle ScalarEvolution::getConstant(ConstantInt *V) {
182 SCEVConstant *&R = (*SCEVConstants)[V];
183 if (R == 0) R = new SCEVConstant(V, this);
187 SCEVHandle ScalarEvolution::getConstant(const APInt& Val) {
188 return getConstant(ConstantInt::get(Val));
192 ScalarEvolution::getConstant(const Type *Ty, uint64_t V, bool isSigned) {
193 return getConstant(ConstantInt::get(cast<IntegerType>(Ty), V, isSigned));
196 const Type *SCEVConstant::getType() const { return V->getType(); }
198 void SCEVConstant::print(raw_ostream &OS) const {
199 WriteAsOperand(OS, V, false);
202 SCEVCastExpr::SCEVCastExpr(unsigned SCEVTy,
203 const SCEVHandle &op, const Type *ty,
204 const ScalarEvolution* p)
205 : SCEV(SCEVTy, p), Op(op), Ty(ty) {}
207 SCEVCastExpr::~SCEVCastExpr() {}
209 bool SCEVCastExpr::dominates(BasicBlock *BB, DominatorTree *DT) const {
210 return Op->dominates(BB, DT);
213 // SCEVTruncates - Only allow the creation of one SCEVTruncateExpr for any
214 // particular input. Don't use a SCEVHandle here, or else the object will
216 static ManagedStatic<std::map<std::pair<const SCEV*, const Type*>,
217 SCEVTruncateExpr*> > SCEVTruncates;
219 SCEVTruncateExpr::SCEVTruncateExpr(const SCEVHandle &op, const Type *ty,
220 const ScalarEvolution* p)
221 : SCEVCastExpr(scTruncate, op, ty, p) {
222 assert((Op->getType()->isInteger() || isa<PointerType>(Op->getType())) &&
223 (Ty->isInteger() || isa<PointerType>(Ty)) &&
224 "Cannot truncate non-integer value!");
227 SCEVTruncateExpr::~SCEVTruncateExpr() {
228 SCEVTruncates->erase(std::make_pair(Op, Ty));
231 void SCEVTruncateExpr::print(raw_ostream &OS) const {
232 OS << "(trunc " << *Op->getType() << " " << *Op << " to " << *Ty << ")";
235 // SCEVZeroExtends - Only allow the creation of one SCEVZeroExtendExpr for any
236 // particular input. Don't use a SCEVHandle here, or else the object will never
238 static ManagedStatic<std::map<std::pair<const SCEV*, const Type*>,
239 SCEVZeroExtendExpr*> > SCEVZeroExtends;
241 SCEVZeroExtendExpr::SCEVZeroExtendExpr(const SCEVHandle &op, const Type *ty,
242 const ScalarEvolution* p)
243 : SCEVCastExpr(scZeroExtend, op, ty, p) {
244 assert((Op->getType()->isInteger() || isa<PointerType>(Op->getType())) &&
245 (Ty->isInteger() || isa<PointerType>(Ty)) &&
246 "Cannot zero extend non-integer value!");
249 SCEVZeroExtendExpr::~SCEVZeroExtendExpr() {
250 SCEVZeroExtends->erase(std::make_pair(Op, Ty));
253 void SCEVZeroExtendExpr::print(raw_ostream &OS) const {
254 OS << "(zext " << *Op->getType() << " " << *Op << " to " << *Ty << ")";
257 // SCEVSignExtends - Only allow the creation of one SCEVSignExtendExpr for any
258 // particular input. Don't use a SCEVHandle here, or else the object will never
260 static ManagedStatic<std::map<std::pair<const SCEV*, const Type*>,
261 SCEVSignExtendExpr*> > SCEVSignExtends;
263 SCEVSignExtendExpr::SCEVSignExtendExpr(const SCEVHandle &op, const Type *ty,
264 const ScalarEvolution* p)
265 : SCEVCastExpr(scSignExtend, op, ty, p) {
266 assert((Op->getType()->isInteger() || isa<PointerType>(Op->getType())) &&
267 (Ty->isInteger() || isa<PointerType>(Ty)) &&
268 "Cannot sign extend non-integer value!");
271 SCEVSignExtendExpr::~SCEVSignExtendExpr() {
272 SCEVSignExtends->erase(std::make_pair(Op, Ty));
275 void SCEVSignExtendExpr::print(raw_ostream &OS) const {
276 OS << "(sext " << *Op->getType() << " " << *Op << " to " << *Ty << ")";
279 // SCEVCommExprs - Only allow the creation of one SCEVCommutativeExpr for any
280 // particular input. Don't use a SCEVHandle here, or else the object will never
282 static ManagedStatic<std::map<std::pair<unsigned, std::vector<const SCEV*> >,
283 SCEVCommutativeExpr*> > SCEVCommExprs;
285 SCEVCommutativeExpr::~SCEVCommutativeExpr() {
286 std::vector<const SCEV*> SCEVOps(Operands.begin(), Operands.end());
287 SCEVCommExprs->erase(std::make_pair(getSCEVType(), SCEVOps));
290 void SCEVCommutativeExpr::print(raw_ostream &OS) const {
291 assert(Operands.size() > 1 && "This plus expr shouldn't exist!");
292 const char *OpStr = getOperationStr();
293 OS << "(" << *Operands[0];
294 for (unsigned i = 1, e = Operands.size(); i != e; ++i)
295 OS << OpStr << *Operands[i];
299 SCEVHandle SCEVCommutativeExpr::
300 replaceSymbolicValuesWithConcrete(const SCEVHandle &Sym,
301 const SCEVHandle &Conc,
302 ScalarEvolution &SE) const {
303 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
305 getOperand(i)->replaceSymbolicValuesWithConcrete(Sym, Conc, SE);
306 if (H != getOperand(i)) {
307 SmallVector<SCEVHandle, 8> NewOps;
308 NewOps.reserve(getNumOperands());
309 for (unsigned j = 0; j != i; ++j)
310 NewOps.push_back(getOperand(j));
312 for (++i; i != e; ++i)
313 NewOps.push_back(getOperand(i)->
314 replaceSymbolicValuesWithConcrete(Sym, Conc, SE));
316 if (isa<SCEVAddExpr>(this))
317 return SE.getAddExpr(NewOps);
318 else if (isa<SCEVMulExpr>(this))
319 return SE.getMulExpr(NewOps);
320 else if (isa<SCEVSMaxExpr>(this))
321 return SE.getSMaxExpr(NewOps);
322 else if (isa<SCEVUMaxExpr>(this))
323 return SE.getUMaxExpr(NewOps);
325 assert(0 && "Unknown commutative expr!");
331 bool SCEVNAryExpr::dominates(BasicBlock *BB, DominatorTree *DT) const {
332 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
333 if (!getOperand(i)->dominates(BB, DT))
340 // SCEVUDivs - Only allow the creation of one SCEVUDivExpr for any particular
341 // input. Don't use a SCEVHandle here, or else the object will never be
343 static ManagedStatic<std::map<std::pair<const SCEV*, const SCEV*>,
344 SCEVUDivExpr*> > SCEVUDivs;
346 SCEVUDivExpr::~SCEVUDivExpr() {
347 SCEVUDivs->erase(std::make_pair(LHS, RHS));
350 bool SCEVUDivExpr::dominates(BasicBlock *BB, DominatorTree *DT) const {
351 return LHS->dominates(BB, DT) && RHS->dominates(BB, DT);
354 void SCEVUDivExpr::print(raw_ostream &OS) const {
355 OS << "(" << *LHS << " /u " << *RHS << ")";
358 const Type *SCEVUDivExpr::getType() const {
359 // In most cases the types of LHS and RHS will be the same, but in some
360 // crazy cases one or the other may be a pointer. ScalarEvolution doesn't
361 // depend on the type for correctness, but handling types carefully can
362 // avoid extra casts in the SCEVExpander. The LHS is more likely to be
363 // a pointer type than the RHS, so use the RHS' type here.
364 return RHS->getType();
367 // SCEVAddRecExprs - Only allow the creation of one SCEVAddRecExpr for any
368 // particular input. Don't use a SCEVHandle here, or else the object will never
370 static ManagedStatic<std::map<std::pair<const Loop *,
371 std::vector<const SCEV*> >,
372 SCEVAddRecExpr*> > SCEVAddRecExprs;
374 SCEVAddRecExpr::~SCEVAddRecExpr() {
375 std::vector<const SCEV*> SCEVOps(Operands.begin(), Operands.end());
376 SCEVAddRecExprs->erase(std::make_pair(L, SCEVOps));
379 SCEVHandle SCEVAddRecExpr::
380 replaceSymbolicValuesWithConcrete(const SCEVHandle &Sym,
381 const SCEVHandle &Conc,
382 ScalarEvolution &SE) const {
383 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
385 getOperand(i)->replaceSymbolicValuesWithConcrete(Sym, Conc, SE);
386 if (H != getOperand(i)) {
387 SmallVector<SCEVHandle, 8> NewOps;
388 NewOps.reserve(getNumOperands());
389 for (unsigned j = 0; j != i; ++j)
390 NewOps.push_back(getOperand(j));
392 for (++i; i != e; ++i)
393 NewOps.push_back(getOperand(i)->
394 replaceSymbolicValuesWithConcrete(Sym, Conc, SE));
396 return SE.getAddRecExpr(NewOps, L);
403 bool SCEVAddRecExpr::isLoopInvariant(const Loop *QueryLoop) const {
404 // This recurrence is invariant w.r.t to QueryLoop iff QueryLoop doesn't
405 // contain L and if the start is invariant.
406 // Add recurrences are never invariant in the function-body (null loop).
408 !QueryLoop->contains(L->getHeader()) &&
409 getOperand(0)->isLoopInvariant(QueryLoop);
413 void SCEVAddRecExpr::print(raw_ostream &OS) const {
414 OS << "{" << *Operands[0];
415 for (unsigned i = 1, e = Operands.size(); i != e; ++i)
416 OS << ",+," << *Operands[i];
417 OS << "}<" << L->getHeader()->getName() + ">";
420 // SCEVUnknowns - Only allow the creation of one SCEVUnknown for any particular
421 // value. Don't use a SCEVHandle here, or else the object will never be
423 static ManagedStatic<std::map<Value*, SCEVUnknown*> > SCEVUnknowns;
425 SCEVUnknown::~SCEVUnknown() { SCEVUnknowns->erase(V); }
427 bool SCEVUnknown::isLoopInvariant(const Loop *L) const {
428 // All non-instruction values are loop invariant. All instructions are loop
429 // invariant if they are not contained in the specified loop.
430 // Instructions are never considered invariant in the function body
431 // (null loop) because they are defined within the "loop".
432 if (Instruction *I = dyn_cast<Instruction>(V))
433 return L && !L->contains(I->getParent());
437 bool SCEVUnknown::dominates(BasicBlock *BB, DominatorTree *DT) const {
438 if (Instruction *I = dyn_cast<Instruction>(getValue()))
439 return DT->dominates(I->getParent(), BB);
443 const Type *SCEVUnknown::getType() const {
447 void SCEVUnknown::print(raw_ostream &OS) const {
448 WriteAsOperand(OS, V, false);
451 //===----------------------------------------------------------------------===//
453 //===----------------------------------------------------------------------===//
456 /// SCEVComplexityCompare - Return true if the complexity of the LHS is less
457 /// than the complexity of the RHS. This comparator is used to canonicalize
459 class VISIBILITY_HIDDEN SCEVComplexityCompare {
462 explicit SCEVComplexityCompare(LoopInfo *li) : LI(li) {}
464 bool operator()(const SCEV *LHS, const SCEV *RHS) const {
465 // Primarily, sort the SCEVs by their getSCEVType().
466 if (LHS->getSCEVType() != RHS->getSCEVType())
467 return LHS->getSCEVType() < RHS->getSCEVType();
469 // Aside from the getSCEVType() ordering, the particular ordering
470 // isn't very important except that it's beneficial to be consistent,
471 // so that (a + b) and (b + a) don't end up as different expressions.
473 // Sort SCEVUnknown values with some loose heuristics. TODO: This is
474 // not as complete as it could be.
475 if (const SCEVUnknown *LU = dyn_cast<SCEVUnknown>(LHS)) {
476 const SCEVUnknown *RU = cast<SCEVUnknown>(RHS);
478 // Order pointer values after integer values. This helps SCEVExpander
480 if (isa<PointerType>(LU->getType()) && !isa<PointerType>(RU->getType()))
482 if (isa<PointerType>(RU->getType()) && !isa<PointerType>(LU->getType()))
485 // Compare getValueID values.
486 if (LU->getValue()->getValueID() != RU->getValue()->getValueID())
487 return LU->getValue()->getValueID() < RU->getValue()->getValueID();
489 // Sort arguments by their position.
490 if (const Argument *LA = dyn_cast<Argument>(LU->getValue())) {
491 const Argument *RA = cast<Argument>(RU->getValue());
492 return LA->getArgNo() < RA->getArgNo();
495 // For instructions, compare their loop depth, and their opcode.
496 // This is pretty loose.
497 if (Instruction *LV = dyn_cast<Instruction>(LU->getValue())) {
498 Instruction *RV = cast<Instruction>(RU->getValue());
500 // Compare loop depths.
501 if (LI->getLoopDepth(LV->getParent()) !=
502 LI->getLoopDepth(RV->getParent()))
503 return LI->getLoopDepth(LV->getParent()) <
504 LI->getLoopDepth(RV->getParent());
507 if (LV->getOpcode() != RV->getOpcode())
508 return LV->getOpcode() < RV->getOpcode();
510 // Compare the number of operands.
511 if (LV->getNumOperands() != RV->getNumOperands())
512 return LV->getNumOperands() < RV->getNumOperands();
518 // Compare constant values.
519 if (const SCEVConstant *LC = dyn_cast<SCEVConstant>(LHS)) {
520 const SCEVConstant *RC = cast<SCEVConstant>(RHS);
521 return LC->getValue()->getValue().ult(RC->getValue()->getValue());
524 // Compare addrec loop depths.
525 if (const SCEVAddRecExpr *LA = dyn_cast<SCEVAddRecExpr>(LHS)) {
526 const SCEVAddRecExpr *RA = cast<SCEVAddRecExpr>(RHS);
527 if (LA->getLoop()->getLoopDepth() != RA->getLoop()->getLoopDepth())
528 return LA->getLoop()->getLoopDepth() < RA->getLoop()->getLoopDepth();
531 // Lexicographically compare n-ary expressions.
532 if (const SCEVNAryExpr *LC = dyn_cast<SCEVNAryExpr>(LHS)) {
533 const SCEVNAryExpr *RC = cast<SCEVNAryExpr>(RHS);
534 for (unsigned i = 0, e = LC->getNumOperands(); i != e; ++i) {
535 if (i >= RC->getNumOperands())
537 if (operator()(LC->getOperand(i), RC->getOperand(i)))
539 if (operator()(RC->getOperand(i), LC->getOperand(i)))
542 return LC->getNumOperands() < RC->getNumOperands();
545 // Lexicographically compare udiv expressions.
546 if (const SCEVUDivExpr *LC = dyn_cast<SCEVUDivExpr>(LHS)) {
547 const SCEVUDivExpr *RC = cast<SCEVUDivExpr>(RHS);
548 if (operator()(LC->getLHS(), RC->getLHS()))
550 if (operator()(RC->getLHS(), LC->getLHS()))
552 if (operator()(LC->getRHS(), RC->getRHS()))
554 if (operator()(RC->getRHS(), LC->getRHS()))
559 // Compare cast expressions by operand.
560 if (const SCEVCastExpr *LC = dyn_cast<SCEVCastExpr>(LHS)) {
561 const SCEVCastExpr *RC = cast<SCEVCastExpr>(RHS);
562 return operator()(LC->getOperand(), RC->getOperand());
565 assert(0 && "Unknown SCEV kind!");
571 /// GroupByComplexity - Given a list of SCEV objects, order them by their
572 /// complexity, and group objects of the same complexity together by value.
573 /// When this routine is finished, we know that any duplicates in the vector are
574 /// consecutive and that complexity is monotonically increasing.
576 /// Note that we go take special precautions to ensure that we get determinstic
577 /// results from this routine. In other words, we don't want the results of
578 /// this to depend on where the addresses of various SCEV objects happened to
581 static void GroupByComplexity(SmallVectorImpl<SCEVHandle> &Ops,
583 if (Ops.size() < 2) return; // Noop
584 if (Ops.size() == 2) {
585 // This is the common case, which also happens to be trivially simple.
587 if (SCEVComplexityCompare(LI)(Ops[1], Ops[0]))
588 std::swap(Ops[0], Ops[1]);
592 // Do the rough sort by complexity.
593 std::stable_sort(Ops.begin(), Ops.end(), SCEVComplexityCompare(LI));
595 // Now that we are sorted by complexity, group elements of the same
596 // complexity. Note that this is, at worst, N^2, but the vector is likely to
597 // be extremely short in practice. Note that we take this approach because we
598 // do not want to depend on the addresses of the objects we are grouping.
599 for (unsigned i = 0, e = Ops.size(); i != e-2; ++i) {
600 const SCEV *S = Ops[i];
601 unsigned Complexity = S->getSCEVType();
603 // If there are any objects of the same complexity and same value as this
605 for (unsigned j = i+1; j != e && Ops[j]->getSCEVType() == Complexity; ++j) {
606 if (Ops[j] == S) { // Found a duplicate.
607 // Move it to immediately after i'th element.
608 std::swap(Ops[i+1], Ops[j]);
609 ++i; // no need to rescan it.
610 if (i == e-2) return; // Done!
618 //===----------------------------------------------------------------------===//
619 // Simple SCEV method implementations
620 //===----------------------------------------------------------------------===//
622 /// BinomialCoefficient - Compute BC(It, K). The result has width W.
624 static SCEVHandle BinomialCoefficient(SCEVHandle It, unsigned K,
626 const Type* ResultTy) {
627 // Handle the simplest case efficiently.
629 return SE.getTruncateOrZeroExtend(It, ResultTy);
631 // We are using the following formula for BC(It, K):
633 // BC(It, K) = (It * (It - 1) * ... * (It - K + 1)) / K!
635 // Suppose, W is the bitwidth of the return value. We must be prepared for
636 // overflow. Hence, we must assure that the result of our computation is
637 // equal to the accurate one modulo 2^W. Unfortunately, division isn't
638 // safe in modular arithmetic.
640 // However, this code doesn't use exactly that formula; the formula it uses
641 // is something like the following, where T is the number of factors of 2 in
642 // K! (i.e. trailing zeros in the binary representation of K!), and ^ is
645 // BC(It, K) = (It * (It - 1) * ... * (It - K + 1)) / 2^T / (K! / 2^T)
647 // This formula is trivially equivalent to the previous formula. However,
648 // this formula can be implemented much more efficiently. The trick is that
649 // K! / 2^T is odd, and exact division by an odd number *is* safe in modular
650 // arithmetic. To do exact division in modular arithmetic, all we have
651 // to do is multiply by the inverse. Therefore, this step can be done at
654 // The next issue is how to safely do the division by 2^T. The way this
655 // is done is by doing the multiplication step at a width of at least W + T
656 // bits. This way, the bottom W+T bits of the product are accurate. Then,
657 // when we perform the division by 2^T (which is equivalent to a right shift
658 // by T), the bottom W bits are accurate. Extra bits are okay; they'll get
659 // truncated out after the division by 2^T.
661 // In comparison to just directly using the first formula, this technique
662 // is much more efficient; using the first formula requires W * K bits,
663 // but this formula less than W + K bits. Also, the first formula requires
664 // a division step, whereas this formula only requires multiplies and shifts.
666 // It doesn't matter whether the subtraction step is done in the calculation
667 // width or the input iteration count's width; if the subtraction overflows,
668 // the result must be zero anyway. We prefer here to do it in the width of
669 // the induction variable because it helps a lot for certain cases; CodeGen
670 // isn't smart enough to ignore the overflow, which leads to much less
671 // efficient code if the width of the subtraction is wider than the native
674 // (It's possible to not widen at all by pulling out factors of 2 before
675 // the multiplication; for example, K=2 can be calculated as
676 // It/2*(It+(It*INT_MIN/INT_MIN)+-1). However, it requires
677 // extra arithmetic, so it's not an obvious win, and it gets
678 // much more complicated for K > 3.)
680 // Protection from insane SCEVs; this bound is conservative,
681 // but it probably doesn't matter.
683 return SE.getCouldNotCompute();
685 unsigned W = SE.getTypeSizeInBits(ResultTy);
687 // Calculate K! / 2^T and T; we divide out the factors of two before
688 // multiplying for calculating K! / 2^T to avoid overflow.
689 // Other overflow doesn't matter because we only care about the bottom
690 // W bits of the result.
691 APInt OddFactorial(W, 1);
693 for (unsigned i = 3; i <= K; ++i) {
695 unsigned TwoFactors = Mult.countTrailingZeros();
697 Mult = Mult.lshr(TwoFactors);
698 OddFactorial *= Mult;
701 // We need at least W + T bits for the multiplication step
702 unsigned CalculationBits = W + T;
704 // Calcuate 2^T, at width T+W.
705 APInt DivFactor = APInt(CalculationBits, 1).shl(T);
707 // Calculate the multiplicative inverse of K! / 2^T;
708 // this multiplication factor will perform the exact division by
710 APInt Mod = APInt::getSignedMinValue(W+1);
711 APInt MultiplyFactor = OddFactorial.zext(W+1);
712 MultiplyFactor = MultiplyFactor.multiplicativeInverse(Mod);
713 MultiplyFactor = MultiplyFactor.trunc(W);
715 // Calculate the product, at width T+W
716 const IntegerType *CalculationTy = IntegerType::get(CalculationBits);
717 SCEVHandle Dividend = SE.getTruncateOrZeroExtend(It, CalculationTy);
718 for (unsigned i = 1; i != K; ++i) {
719 SCEVHandle S = SE.getMinusSCEV(It, SE.getIntegerSCEV(i, It->getType()));
720 Dividend = SE.getMulExpr(Dividend,
721 SE.getTruncateOrZeroExtend(S, CalculationTy));
725 SCEVHandle DivResult = SE.getUDivExpr(Dividend, SE.getConstant(DivFactor));
727 // Truncate the result, and divide by K! / 2^T.
729 return SE.getMulExpr(SE.getConstant(MultiplyFactor),
730 SE.getTruncateOrZeroExtend(DivResult, ResultTy));
733 /// evaluateAtIteration - Return the value of this chain of recurrences at
734 /// the specified iteration number. We can evaluate this recurrence by
735 /// multiplying each element in the chain by the binomial coefficient
736 /// corresponding to it. In other words, we can evaluate {A,+,B,+,C,+,D} as:
738 /// A*BC(It, 0) + B*BC(It, 1) + C*BC(It, 2) + D*BC(It, 3)
740 /// where BC(It, k) stands for binomial coefficient.
742 SCEVHandle SCEVAddRecExpr::evaluateAtIteration(SCEVHandle It,
743 ScalarEvolution &SE) const {
744 SCEVHandle Result = getStart();
745 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
746 // The computation is correct in the face of overflow provided that the
747 // multiplication is performed _after_ the evaluation of the binomial
749 SCEVHandle Coeff = BinomialCoefficient(It, i, SE, getType());
750 if (isa<SCEVCouldNotCompute>(Coeff))
753 Result = SE.getAddExpr(Result, SE.getMulExpr(getOperand(i), Coeff));
758 //===----------------------------------------------------------------------===//
759 // SCEV Expression folder implementations
760 //===----------------------------------------------------------------------===//
762 SCEVHandle ScalarEvolution::getTruncateExpr(const SCEVHandle &Op,
764 assert(getTypeSizeInBits(Op->getType()) > getTypeSizeInBits(Ty) &&
765 "This is not a truncating conversion!");
766 assert(isSCEVable(Ty) &&
767 "This is not a conversion to a SCEVable type!");
768 Ty = getEffectiveSCEVType(Ty);
770 if (const SCEVConstant *SC = dyn_cast<SCEVConstant>(Op))
772 ConstantExpr::getTrunc(SC->getValue(), Ty));
774 // trunc(trunc(x)) --> trunc(x)
775 if (const SCEVTruncateExpr *ST = dyn_cast<SCEVTruncateExpr>(Op))
776 return getTruncateExpr(ST->getOperand(), Ty);
778 // trunc(sext(x)) --> sext(x) if widening or trunc(x) if narrowing
779 if (const SCEVSignExtendExpr *SS = dyn_cast<SCEVSignExtendExpr>(Op))
780 return getTruncateOrSignExtend(SS->getOperand(), Ty);
782 // trunc(zext(x)) --> zext(x) if widening or trunc(x) if narrowing
783 if (const SCEVZeroExtendExpr *SZ = dyn_cast<SCEVZeroExtendExpr>(Op))
784 return getTruncateOrZeroExtend(SZ->getOperand(), Ty);
786 // If the input value is a chrec scev, truncate the chrec's operands.
787 if (const SCEVAddRecExpr *AddRec = dyn_cast<SCEVAddRecExpr>(Op)) {
788 SmallVector<SCEVHandle, 4> Operands;
789 for (unsigned i = 0, e = AddRec->getNumOperands(); i != e; ++i)
790 Operands.push_back(getTruncateExpr(AddRec->getOperand(i), Ty));
791 return getAddRecExpr(Operands, AddRec->getLoop());
794 SCEVTruncateExpr *&Result = (*SCEVTruncates)[std::make_pair(Op, Ty)];
795 if (Result == 0) Result = new SCEVTruncateExpr(Op, Ty, this);
799 SCEVHandle ScalarEvolution::getZeroExtendExpr(const SCEVHandle &Op,
801 assert(getTypeSizeInBits(Op->getType()) < getTypeSizeInBits(Ty) &&
802 "This is not an extending conversion!");
803 assert(isSCEVable(Ty) &&
804 "This is not a conversion to a SCEVable type!");
805 Ty = getEffectiveSCEVType(Ty);
807 if (const SCEVConstant *SC = dyn_cast<SCEVConstant>(Op)) {
808 const Type *IntTy = getEffectiveSCEVType(Ty);
809 Constant *C = ConstantExpr::getZExt(SC->getValue(), IntTy);
810 if (IntTy != Ty) C = ConstantExpr::getIntToPtr(C, Ty);
811 return getUnknown(C);
814 // zext(zext(x)) --> zext(x)
815 if (const SCEVZeroExtendExpr *SZ = dyn_cast<SCEVZeroExtendExpr>(Op))
816 return getZeroExtendExpr(SZ->getOperand(), Ty);
818 // If the input value is a chrec scev, and we can prove that the value
819 // did not overflow the old, smaller, value, we can zero extend all of the
820 // operands (often constants). This allows analysis of something like
821 // this: for (unsigned char X = 0; X < 100; ++X) { int Y = X; }
822 if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(Op))
823 if (AR->isAffine()) {
824 // Check whether the backedge-taken count is SCEVCouldNotCompute.
825 // Note that this serves two purposes: It filters out loops that are
826 // simply not analyzable, and it covers the case where this code is
827 // being called from within backedge-taken count analysis, such that
828 // attempting to ask for the backedge-taken count would likely result
829 // in infinite recursion. In the later case, the analysis code will
830 // cope with a conservative value, and it will take care to purge
831 // that value once it has finished.
832 SCEVHandle MaxBECount = getMaxBackedgeTakenCount(AR->getLoop());
833 if (!isa<SCEVCouldNotCompute>(MaxBECount)) {
834 // Manually compute the final value for AR, checking for
836 SCEVHandle Start = AR->getStart();
837 SCEVHandle Step = AR->getStepRecurrence(*this);
839 // Check whether the backedge-taken count can be losslessly casted to
840 // the addrec's type. The count is always unsigned.
841 SCEVHandle CastedMaxBECount =
842 getTruncateOrZeroExtend(MaxBECount, Start->getType());
843 SCEVHandle RecastedMaxBECount =
844 getTruncateOrZeroExtend(CastedMaxBECount, MaxBECount->getType());
845 if (MaxBECount == RecastedMaxBECount) {
847 IntegerType::get(getTypeSizeInBits(Start->getType()) * 2);
848 // Check whether Start+Step*MaxBECount has no unsigned overflow.
850 getMulExpr(CastedMaxBECount,
851 getTruncateOrZeroExtend(Step, Start->getType()));
852 SCEVHandle Add = getAddExpr(Start, ZMul);
853 SCEVHandle OperandExtendedAdd =
854 getAddExpr(getZeroExtendExpr(Start, WideTy),
855 getMulExpr(getZeroExtendExpr(CastedMaxBECount, WideTy),
856 getZeroExtendExpr(Step, WideTy)));
857 if (getZeroExtendExpr(Add, WideTy) == OperandExtendedAdd)
858 // Return the expression with the addrec on the outside.
859 return getAddRecExpr(getZeroExtendExpr(Start, Ty),
860 getZeroExtendExpr(Step, Ty),
863 // Similar to above, only this time treat the step value as signed.
864 // This covers loops that count down.
866 getMulExpr(CastedMaxBECount,
867 getTruncateOrSignExtend(Step, Start->getType()));
868 Add = getAddExpr(Start, SMul);
870 getAddExpr(getZeroExtendExpr(Start, WideTy),
871 getMulExpr(getZeroExtendExpr(CastedMaxBECount, WideTy),
872 getSignExtendExpr(Step, WideTy)));
873 if (getZeroExtendExpr(Add, WideTy) == OperandExtendedAdd)
874 // Return the expression with the addrec on the outside.
875 return getAddRecExpr(getZeroExtendExpr(Start, Ty),
876 getSignExtendExpr(Step, Ty),
882 SCEVZeroExtendExpr *&Result = (*SCEVZeroExtends)[std::make_pair(Op, Ty)];
883 if (Result == 0) Result = new SCEVZeroExtendExpr(Op, Ty, this);
887 SCEVHandle ScalarEvolution::getSignExtendExpr(const SCEVHandle &Op,
889 assert(getTypeSizeInBits(Op->getType()) < getTypeSizeInBits(Ty) &&
890 "This is not an extending conversion!");
891 assert(isSCEVable(Ty) &&
892 "This is not a conversion to a SCEVable type!");
893 Ty = getEffectiveSCEVType(Ty);
895 if (const SCEVConstant *SC = dyn_cast<SCEVConstant>(Op)) {
896 const Type *IntTy = getEffectiveSCEVType(Ty);
897 Constant *C = ConstantExpr::getSExt(SC->getValue(), IntTy);
898 if (IntTy != Ty) C = ConstantExpr::getIntToPtr(C, Ty);
899 return getUnknown(C);
902 // sext(sext(x)) --> sext(x)
903 if (const SCEVSignExtendExpr *SS = dyn_cast<SCEVSignExtendExpr>(Op))
904 return getSignExtendExpr(SS->getOperand(), Ty);
906 // If the input value is a chrec scev, and we can prove that the value
907 // did not overflow the old, smaller, value, we can sign extend all of the
908 // operands (often constants). This allows analysis of something like
909 // this: for (signed char X = 0; X < 100; ++X) { int Y = X; }
910 if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(Op))
911 if (AR->isAffine()) {
912 // Check whether the backedge-taken count is SCEVCouldNotCompute.
913 // Note that this serves two purposes: It filters out loops that are
914 // simply not analyzable, and it covers the case where this code is
915 // being called from within backedge-taken count analysis, such that
916 // attempting to ask for the backedge-taken count would likely result
917 // in infinite recursion. In the later case, the analysis code will
918 // cope with a conservative value, and it will take care to purge
919 // that value once it has finished.
920 SCEVHandle MaxBECount = getMaxBackedgeTakenCount(AR->getLoop());
921 if (!isa<SCEVCouldNotCompute>(MaxBECount)) {
922 // Manually compute the final value for AR, checking for
924 SCEVHandle Start = AR->getStart();
925 SCEVHandle Step = AR->getStepRecurrence(*this);
927 // Check whether the backedge-taken count can be losslessly casted to
928 // the addrec's type. The count is always unsigned.
929 SCEVHandle CastedMaxBECount =
930 getTruncateOrZeroExtend(MaxBECount, Start->getType());
931 SCEVHandle RecastedMaxBECount =
932 getTruncateOrZeroExtend(CastedMaxBECount, MaxBECount->getType());
933 if (MaxBECount == RecastedMaxBECount) {
935 IntegerType::get(getTypeSizeInBits(Start->getType()) * 2);
936 // Check whether Start+Step*MaxBECount has no signed overflow.
938 getMulExpr(CastedMaxBECount,
939 getTruncateOrSignExtend(Step, Start->getType()));
940 SCEVHandle Add = getAddExpr(Start, SMul);
941 SCEVHandle OperandExtendedAdd =
942 getAddExpr(getSignExtendExpr(Start, WideTy),
943 getMulExpr(getZeroExtendExpr(CastedMaxBECount, WideTy),
944 getSignExtendExpr(Step, WideTy)));
945 if (getSignExtendExpr(Add, WideTy) == OperandExtendedAdd)
946 // Return the expression with the addrec on the outside.
947 return getAddRecExpr(getSignExtendExpr(Start, Ty),
948 getSignExtendExpr(Step, Ty),
954 SCEVSignExtendExpr *&Result = (*SCEVSignExtends)[std::make_pair(Op, Ty)];
955 if (Result == 0) Result = new SCEVSignExtendExpr(Op, Ty, this);
959 /// getAnyExtendExpr - Return a SCEV for the given operand extended with
960 /// unspecified bits out to the given type.
962 SCEVHandle ScalarEvolution::getAnyExtendExpr(const SCEVHandle &Op,
964 assert(getTypeSizeInBits(Op->getType()) < getTypeSizeInBits(Ty) &&
965 "This is not an extending conversion!");
966 assert(isSCEVable(Ty) &&
967 "This is not a conversion to a SCEVable type!");
968 Ty = getEffectiveSCEVType(Ty);
970 // Sign-extend negative constants.
971 if (const SCEVConstant *SC = dyn_cast<SCEVConstant>(Op))
972 if (SC->getValue()->getValue().isNegative())
973 return getSignExtendExpr(Op, Ty);
975 // Peel off a truncate cast.
976 if (const SCEVTruncateExpr *T = dyn_cast<SCEVTruncateExpr>(Op)) {
977 SCEVHandle NewOp = T->getOperand();
978 if (getTypeSizeInBits(NewOp->getType()) < getTypeSizeInBits(Ty))
979 return getAnyExtendExpr(NewOp, Ty);
980 return getTruncateOrNoop(NewOp, Ty);
983 // Next try a zext cast. If the cast is folded, use it.
984 SCEVHandle ZExt = getZeroExtendExpr(Op, Ty);
985 if (!isa<SCEVZeroExtendExpr>(ZExt))
988 // Next try a sext cast. If the cast is folded, use it.
989 SCEVHandle SExt = getSignExtendExpr(Op, Ty);
990 if (!isa<SCEVSignExtendExpr>(SExt))
993 // If the expression is obviously signed, use the sext cast value.
994 if (isa<SCEVSMaxExpr>(Op))
997 // Absent any other information, use the zext cast value.
1001 /// CollectAddOperandsWithScales - Process the given Ops list, which is
1002 /// a list of operands to be added under the given scale, update the given
1003 /// map. This is a helper function for getAddRecExpr. As an example of
1004 /// what it does, given a sequence of operands that would form an add
1005 /// expression like this:
1007 /// m + n + 13 + (A * (o + p + (B * q + m + 29))) + r + (-1 * r)
1009 /// where A and B are constants, update the map with these values:
1011 /// (m, 1+A*B), (n, 1), (o, A), (p, A), (q, A*B), (r, 0)
1013 /// and add 13 + A*B*29 to AccumulatedConstant.
1014 /// This will allow getAddRecExpr to produce this:
1016 /// 13+A*B*29 + n + (m * (1+A*B)) + ((o + p) * A) + (q * A*B)
1018 /// This form often exposes folding opportunities that are hidden in
1019 /// the original operand list.
1021 /// Return true iff it appears that any interesting folding opportunities
1022 /// may be exposed. This helps getAddRecExpr short-circuit extra work in
1023 /// the common case where no interesting opportunities are present, and
1024 /// is also used as a check to avoid infinite recursion.
1027 CollectAddOperandsWithScales(DenseMap<SCEVHandle, APInt> &M,
1028 SmallVector<SCEVHandle, 8> &NewOps,
1029 APInt &AccumulatedConstant,
1030 const SmallVectorImpl<SCEVHandle> &Ops,
1032 ScalarEvolution &SE) {
1033 bool Interesting = false;
1035 // Iterate over the add operands.
1036 for (unsigned i = 0, e = Ops.size(); i != e; ++i) {
1037 const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(Ops[i]);
1038 if (Mul && isa<SCEVConstant>(Mul->getOperand(0))) {
1040 Scale * cast<SCEVConstant>(Mul->getOperand(0))->getValue()->getValue();
1041 if (Mul->getNumOperands() == 2 && isa<SCEVAddExpr>(Mul->getOperand(1))) {
1042 // A multiplication of a constant with another add; recurse.
1044 CollectAddOperandsWithScales(M, NewOps, AccumulatedConstant,
1045 cast<SCEVAddExpr>(Mul->getOperand(1))
1049 // A multiplication of a constant with some other value. Update
1051 SmallVector<SCEVHandle, 4> MulOps(Mul->op_begin()+1, Mul->op_end());
1052 SCEVHandle Key = SE.getMulExpr(MulOps);
1053 std::pair<DenseMap<SCEVHandle, APInt>::iterator, bool> Pair =
1054 M.insert(std::make_pair(Key, APInt()));
1056 Pair.first->second = NewScale;
1057 NewOps.push_back(Pair.first->first);
1059 Pair.first->second += NewScale;
1060 // The map already had an entry for this value, which may indicate
1061 // a folding opportunity.
1065 } else if (const SCEVConstant *C = dyn_cast<SCEVConstant>(Ops[i])) {
1066 // Pull a buried constant out to the outside.
1067 if (Scale != 1 || AccumulatedConstant != 0 || C->isZero())
1069 AccumulatedConstant += Scale * C->getValue()->getValue();
1071 // An ordinary operand. Update the map.
1072 std::pair<DenseMap<SCEVHandle, APInt>::iterator, bool> Pair =
1073 M.insert(std::make_pair(Ops[i], APInt()));
1075 Pair.first->second = Scale;
1076 NewOps.push_back(Pair.first->first);
1078 Pair.first->second += Scale;
1079 // The map already had an entry for this value, which may indicate
1080 // a folding opportunity.
1090 struct APIntCompare {
1091 bool operator()(const APInt &LHS, const APInt &RHS) const {
1092 return LHS.ult(RHS);
1097 /// getAddExpr - Get a canonical add expression, or something simpler if
1099 SCEVHandle ScalarEvolution::getAddExpr(SmallVectorImpl<SCEVHandle> &Ops) {
1100 assert(!Ops.empty() && "Cannot get empty add!");
1101 if (Ops.size() == 1) return Ops[0];
1103 for (unsigned i = 1, e = Ops.size(); i != e; ++i)
1104 assert(getEffectiveSCEVType(Ops[i]->getType()) ==
1105 getEffectiveSCEVType(Ops[0]->getType()) &&
1106 "SCEVAddExpr operand types don't match!");
1109 // Sort by complexity, this groups all similar expression types together.
1110 GroupByComplexity(Ops, LI);
1112 // If there are any constants, fold them together.
1114 if (const SCEVConstant *LHSC = dyn_cast<SCEVConstant>(Ops[0])) {
1116 assert(Idx < Ops.size());
1117 while (const SCEVConstant *RHSC = dyn_cast<SCEVConstant>(Ops[Idx])) {
1118 // We found two constants, fold them together!
1119 Ops[0] = getConstant(LHSC->getValue()->getValue() +
1120 RHSC->getValue()->getValue());
1121 if (Ops.size() == 2) return Ops[0];
1122 Ops.erase(Ops.begin()+1); // Erase the folded element
1123 LHSC = cast<SCEVConstant>(Ops[0]);
1126 // If we are left with a constant zero being added, strip it off.
1127 if (cast<SCEVConstant>(Ops[0])->getValue()->isZero()) {
1128 Ops.erase(Ops.begin());
1133 if (Ops.size() == 1) return Ops[0];
1135 // Okay, check to see if the same value occurs in the operand list twice. If
1136 // so, merge them together into an multiply expression. Since we sorted the
1137 // list, these values are required to be adjacent.
1138 const Type *Ty = Ops[0]->getType();
1139 for (unsigned i = 0, e = Ops.size()-1; i != e; ++i)
1140 if (Ops[i] == Ops[i+1]) { // X + Y + Y --> X + Y*2
1141 // Found a match, merge the two values into a multiply, and add any
1142 // remaining values to the result.
1143 SCEVHandle Two = getIntegerSCEV(2, Ty);
1144 SCEVHandle Mul = getMulExpr(Ops[i], Two);
1145 if (Ops.size() == 2)
1147 Ops.erase(Ops.begin()+i, Ops.begin()+i+2);
1149 return getAddExpr(Ops);
1152 // Check for truncates. If all the operands are truncated from the same
1153 // type, see if factoring out the truncate would permit the result to be
1154 // folded. eg., trunc(x) + m*trunc(n) --> trunc(x + trunc(m)*n)
1155 // if the contents of the resulting outer trunc fold to something simple.
1156 for (; Idx < Ops.size() && isa<SCEVTruncateExpr>(Ops[Idx]); ++Idx) {
1157 const SCEVTruncateExpr *Trunc = cast<SCEVTruncateExpr>(Ops[Idx]);
1158 const Type *DstType = Trunc->getType();
1159 const Type *SrcType = Trunc->getOperand()->getType();
1160 SmallVector<SCEVHandle, 8> LargeOps;
1162 // Check all the operands to see if they can be represented in the
1163 // source type of the truncate.
1164 for (unsigned i = 0, e = Ops.size(); i != e; ++i) {
1165 if (const SCEVTruncateExpr *T = dyn_cast<SCEVTruncateExpr>(Ops[i])) {
1166 if (T->getOperand()->getType() != SrcType) {
1170 LargeOps.push_back(T->getOperand());
1171 } else if (const SCEVConstant *C = dyn_cast<SCEVConstant>(Ops[i])) {
1172 // This could be either sign or zero extension, but sign extension
1173 // is much more likely to be foldable here.
1174 LargeOps.push_back(getSignExtendExpr(C, SrcType));
1175 } else if (const SCEVMulExpr *M = dyn_cast<SCEVMulExpr>(Ops[i])) {
1176 SmallVector<SCEVHandle, 8> LargeMulOps;
1177 for (unsigned j = 0, f = M->getNumOperands(); j != f && Ok; ++j) {
1178 if (const SCEVTruncateExpr *T =
1179 dyn_cast<SCEVTruncateExpr>(M->getOperand(j))) {
1180 if (T->getOperand()->getType() != SrcType) {
1184 LargeMulOps.push_back(T->getOperand());
1185 } else if (const SCEVConstant *C =
1186 dyn_cast<SCEVConstant>(M->getOperand(j))) {
1187 // This could be either sign or zero extension, but sign extension
1188 // is much more likely to be foldable here.
1189 LargeMulOps.push_back(getSignExtendExpr(C, SrcType));
1196 LargeOps.push_back(getMulExpr(LargeMulOps));
1203 // Evaluate the expression in the larger type.
1204 SCEVHandle Fold = getAddExpr(LargeOps);
1205 // If it folds to something simple, use it. Otherwise, don't.
1206 if (isa<SCEVConstant>(Fold) || isa<SCEVUnknown>(Fold))
1207 return getTruncateExpr(Fold, DstType);
1211 // Skip past any other cast SCEVs.
1212 while (Idx < Ops.size() && Ops[Idx]->getSCEVType() < scAddExpr)
1215 // If there are add operands they would be next.
1216 if (Idx < Ops.size()) {
1217 bool DeletedAdd = false;
1218 while (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(Ops[Idx])) {
1219 // If we have an add, expand the add operands onto the end of the operands
1221 Ops.insert(Ops.end(), Add->op_begin(), Add->op_end());
1222 Ops.erase(Ops.begin()+Idx);
1226 // If we deleted at least one add, we added operands to the end of the list,
1227 // and they are not necessarily sorted. Recurse to resort and resimplify
1228 // any operands we just aquired.
1230 return getAddExpr(Ops);
1233 // Skip over the add expression until we get to a multiply.
1234 while (Idx < Ops.size() && Ops[Idx]->getSCEVType() < scMulExpr)
1237 // Check to see if there are any folding opportunities present with
1238 // operands multiplied by constant values.
1239 if (Idx < Ops.size() && isa<SCEVMulExpr>(Ops[Idx])) {
1240 uint64_t BitWidth = getTypeSizeInBits(Ty);
1241 DenseMap<SCEVHandle, APInt> M;
1242 SmallVector<SCEVHandle, 8> NewOps;
1243 APInt AccumulatedConstant(BitWidth, 0);
1244 if (CollectAddOperandsWithScales(M, NewOps, AccumulatedConstant,
1245 Ops, APInt(BitWidth, 1), *this)) {
1246 // Some interesting folding opportunity is present, so its worthwhile to
1247 // re-generate the operands list. Group the operands by constant scale,
1248 // to avoid multiplying by the same constant scale multiple times.
1249 std::map<APInt, SmallVector<SCEVHandle, 4>, APIntCompare> MulOpLists;
1250 for (SmallVector<SCEVHandle, 8>::iterator I = NewOps.begin(),
1251 E = NewOps.end(); I != E; ++I)
1252 MulOpLists[M.find(*I)->second].push_back(*I);
1253 // Re-generate the operands list.
1255 if (AccumulatedConstant != 0)
1256 Ops.push_back(getConstant(AccumulatedConstant));
1257 for (std::map<APInt, SmallVector<SCEVHandle, 4>, APIntCompare>::iterator I =
1258 MulOpLists.begin(), E = MulOpLists.end(); I != E; ++I)
1260 Ops.push_back(getMulExpr(getConstant(I->first), getAddExpr(I->second)));
1262 return getIntegerSCEV(0, Ty);
1263 if (Ops.size() == 1)
1265 return getAddExpr(Ops);
1269 // If we are adding something to a multiply expression, make sure the
1270 // something is not already an operand of the multiply. If so, merge it into
1272 for (; Idx < Ops.size() && isa<SCEVMulExpr>(Ops[Idx]); ++Idx) {
1273 const SCEVMulExpr *Mul = cast<SCEVMulExpr>(Ops[Idx]);
1274 for (unsigned MulOp = 0, e = Mul->getNumOperands(); MulOp != e; ++MulOp) {
1275 const SCEV *MulOpSCEV = Mul->getOperand(MulOp);
1276 for (unsigned AddOp = 0, e = Ops.size(); AddOp != e; ++AddOp)
1277 if (MulOpSCEV == Ops[AddOp] && !isa<SCEVConstant>(Ops[AddOp])) {
1278 // Fold W + X + (X * Y * Z) --> W + (X * ((Y*Z)+1))
1279 SCEVHandle InnerMul = Mul->getOperand(MulOp == 0);
1280 if (Mul->getNumOperands() != 2) {
1281 // If the multiply has more than two operands, we must get the
1283 SmallVector<SCEVHandle, 4> MulOps(Mul->op_begin(), Mul->op_end());
1284 MulOps.erase(MulOps.begin()+MulOp);
1285 InnerMul = getMulExpr(MulOps);
1287 SCEVHandle One = getIntegerSCEV(1, Ty);
1288 SCEVHandle AddOne = getAddExpr(InnerMul, One);
1289 SCEVHandle OuterMul = getMulExpr(AddOne, Ops[AddOp]);
1290 if (Ops.size() == 2) return OuterMul;
1292 Ops.erase(Ops.begin()+AddOp);
1293 Ops.erase(Ops.begin()+Idx-1);
1295 Ops.erase(Ops.begin()+Idx);
1296 Ops.erase(Ops.begin()+AddOp-1);
1298 Ops.push_back(OuterMul);
1299 return getAddExpr(Ops);
1302 // Check this multiply against other multiplies being added together.
1303 for (unsigned OtherMulIdx = Idx+1;
1304 OtherMulIdx < Ops.size() && isa<SCEVMulExpr>(Ops[OtherMulIdx]);
1306 const SCEVMulExpr *OtherMul = cast<SCEVMulExpr>(Ops[OtherMulIdx]);
1307 // If MulOp occurs in OtherMul, we can fold the two multiplies
1309 for (unsigned OMulOp = 0, e = OtherMul->getNumOperands();
1310 OMulOp != e; ++OMulOp)
1311 if (OtherMul->getOperand(OMulOp) == MulOpSCEV) {
1312 // Fold X + (A*B*C) + (A*D*E) --> X + (A*(B*C+D*E))
1313 SCEVHandle InnerMul1 = Mul->getOperand(MulOp == 0);
1314 if (Mul->getNumOperands() != 2) {
1315 SmallVector<SCEVHandle, 4> MulOps(Mul->op_begin(), Mul->op_end());
1316 MulOps.erase(MulOps.begin()+MulOp);
1317 InnerMul1 = getMulExpr(MulOps);
1319 SCEVHandle InnerMul2 = OtherMul->getOperand(OMulOp == 0);
1320 if (OtherMul->getNumOperands() != 2) {
1321 SmallVector<SCEVHandle, 4> MulOps(OtherMul->op_begin(),
1322 OtherMul->op_end());
1323 MulOps.erase(MulOps.begin()+OMulOp);
1324 InnerMul2 = getMulExpr(MulOps);
1326 SCEVHandle InnerMulSum = getAddExpr(InnerMul1,InnerMul2);
1327 SCEVHandle OuterMul = getMulExpr(MulOpSCEV, InnerMulSum);
1328 if (Ops.size() == 2) return OuterMul;
1329 Ops.erase(Ops.begin()+Idx);
1330 Ops.erase(Ops.begin()+OtherMulIdx-1);
1331 Ops.push_back(OuterMul);
1332 return getAddExpr(Ops);
1338 // If there are any add recurrences in the operands list, see if any other
1339 // added values are loop invariant. If so, we can fold them into the
1341 while (Idx < Ops.size() && Ops[Idx]->getSCEVType() < scAddRecExpr)
1344 // Scan over all recurrences, trying to fold loop invariants into them.
1345 for (; Idx < Ops.size() && isa<SCEVAddRecExpr>(Ops[Idx]); ++Idx) {
1346 // Scan all of the other operands to this add and add them to the vector if
1347 // they are loop invariant w.r.t. the recurrence.
1348 SmallVector<SCEVHandle, 8> LIOps;
1349 const SCEVAddRecExpr *AddRec = cast<SCEVAddRecExpr>(Ops[Idx]);
1350 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
1351 if (Ops[i]->isLoopInvariant(AddRec->getLoop())) {
1352 LIOps.push_back(Ops[i]);
1353 Ops.erase(Ops.begin()+i);
1357 // If we found some loop invariants, fold them into the recurrence.
1358 if (!LIOps.empty()) {
1359 // NLI + LI + {Start,+,Step} --> NLI + {LI+Start,+,Step}
1360 LIOps.push_back(AddRec->getStart());
1362 SmallVector<SCEVHandle, 4> AddRecOps(AddRec->op_begin(),
1364 AddRecOps[0] = getAddExpr(LIOps);
1366 SCEVHandle NewRec = getAddRecExpr(AddRecOps, AddRec->getLoop());
1367 // If all of the other operands were loop invariant, we are done.
1368 if (Ops.size() == 1) return NewRec;
1370 // Otherwise, add the folded AddRec by the non-liv parts.
1371 for (unsigned i = 0;; ++i)
1372 if (Ops[i] == AddRec) {
1376 return getAddExpr(Ops);
1379 // Okay, if there weren't any loop invariants to be folded, check to see if
1380 // there are multiple AddRec's with the same loop induction variable being
1381 // added together. If so, we can fold them.
1382 for (unsigned OtherIdx = Idx+1;
1383 OtherIdx < Ops.size() && isa<SCEVAddRecExpr>(Ops[OtherIdx]);++OtherIdx)
1384 if (OtherIdx != Idx) {
1385 const SCEVAddRecExpr *OtherAddRec = cast<SCEVAddRecExpr>(Ops[OtherIdx]);
1386 if (AddRec->getLoop() == OtherAddRec->getLoop()) {
1387 // Other + {A,+,B} + {C,+,D} --> Other + {A+C,+,B+D}
1388 SmallVector<SCEVHandle, 4> NewOps(AddRec->op_begin(), AddRec->op_end());
1389 for (unsigned i = 0, e = OtherAddRec->getNumOperands(); i != e; ++i) {
1390 if (i >= NewOps.size()) {
1391 NewOps.insert(NewOps.end(), OtherAddRec->op_begin()+i,
1392 OtherAddRec->op_end());
1395 NewOps[i] = getAddExpr(NewOps[i], OtherAddRec->getOperand(i));
1397 SCEVHandle NewAddRec = getAddRecExpr(NewOps, AddRec->getLoop());
1399 if (Ops.size() == 2) return NewAddRec;
1401 Ops.erase(Ops.begin()+Idx);
1402 Ops.erase(Ops.begin()+OtherIdx-1);
1403 Ops.push_back(NewAddRec);
1404 return getAddExpr(Ops);
1408 // Otherwise couldn't fold anything into this recurrence. Move onto the
1412 // Okay, it looks like we really DO need an add expr. Check to see if we
1413 // already have one, otherwise create a new one.
1414 std::vector<const SCEV*> SCEVOps(Ops.begin(), Ops.end());
1415 SCEVCommutativeExpr *&Result = (*SCEVCommExprs)[std::make_pair(scAddExpr,
1417 if (Result == 0) Result = new SCEVAddExpr(Ops, this);
1422 /// getMulExpr - Get a canonical multiply expression, or something simpler if
1424 SCEVHandle ScalarEvolution::getMulExpr(SmallVectorImpl<SCEVHandle> &Ops) {
1425 assert(!Ops.empty() && "Cannot get empty mul!");
1427 for (unsigned i = 1, e = Ops.size(); i != e; ++i)
1428 assert(getEffectiveSCEVType(Ops[i]->getType()) ==
1429 getEffectiveSCEVType(Ops[0]->getType()) &&
1430 "SCEVMulExpr operand types don't match!");
1433 // Sort by complexity, this groups all similar expression types together.
1434 GroupByComplexity(Ops, LI);
1436 // If there are any constants, fold them together.
1438 if (const SCEVConstant *LHSC = dyn_cast<SCEVConstant>(Ops[0])) {
1440 // C1*(C2+V) -> C1*C2 + C1*V
1441 if (Ops.size() == 2)
1442 if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(Ops[1]))
1443 if (Add->getNumOperands() == 2 &&
1444 isa<SCEVConstant>(Add->getOperand(0)))
1445 return getAddExpr(getMulExpr(LHSC, Add->getOperand(0)),
1446 getMulExpr(LHSC, Add->getOperand(1)));
1450 while (const SCEVConstant *RHSC = dyn_cast<SCEVConstant>(Ops[Idx])) {
1451 // We found two constants, fold them together!
1452 ConstantInt *Fold = ConstantInt::get(LHSC->getValue()->getValue() *
1453 RHSC->getValue()->getValue());
1454 Ops[0] = getConstant(Fold);
1455 Ops.erase(Ops.begin()+1); // Erase the folded element
1456 if (Ops.size() == 1) return Ops[0];
1457 LHSC = cast<SCEVConstant>(Ops[0]);
1460 // If we are left with a constant one being multiplied, strip it off.
1461 if (cast<SCEVConstant>(Ops[0])->getValue()->equalsInt(1)) {
1462 Ops.erase(Ops.begin());
1464 } else if (cast<SCEVConstant>(Ops[0])->getValue()->isZero()) {
1465 // If we have a multiply of zero, it will always be zero.
1470 // Skip over the add expression until we get to a multiply.
1471 while (Idx < Ops.size() && Ops[Idx]->getSCEVType() < scMulExpr)
1474 if (Ops.size() == 1)
1477 // If there are mul operands inline them all into this expression.
1478 if (Idx < Ops.size()) {
1479 bool DeletedMul = false;
1480 while (const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(Ops[Idx])) {
1481 // If we have an mul, expand the mul operands onto the end of the operands
1483 Ops.insert(Ops.end(), Mul->op_begin(), Mul->op_end());
1484 Ops.erase(Ops.begin()+Idx);
1488 // If we deleted at least one mul, we added operands to the end of the list,
1489 // and they are not necessarily sorted. Recurse to resort and resimplify
1490 // any operands we just aquired.
1492 return getMulExpr(Ops);
1495 // If there are any add recurrences in the operands list, see if any other
1496 // added values are loop invariant. If so, we can fold them into the
1498 while (Idx < Ops.size() && Ops[Idx]->getSCEVType() < scAddRecExpr)
1501 // Scan over all recurrences, trying to fold loop invariants into them.
1502 for (; Idx < Ops.size() && isa<SCEVAddRecExpr>(Ops[Idx]); ++Idx) {
1503 // Scan all of the other operands to this mul and add them to the vector if
1504 // they are loop invariant w.r.t. the recurrence.
1505 SmallVector<SCEVHandle, 8> LIOps;
1506 const SCEVAddRecExpr *AddRec = cast<SCEVAddRecExpr>(Ops[Idx]);
1507 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
1508 if (Ops[i]->isLoopInvariant(AddRec->getLoop())) {
1509 LIOps.push_back(Ops[i]);
1510 Ops.erase(Ops.begin()+i);
1514 // If we found some loop invariants, fold them into the recurrence.
1515 if (!LIOps.empty()) {
1516 // NLI * LI * {Start,+,Step} --> NLI * {LI*Start,+,LI*Step}
1517 SmallVector<SCEVHandle, 4> NewOps;
1518 NewOps.reserve(AddRec->getNumOperands());
1519 if (LIOps.size() == 1) {
1520 const SCEV *Scale = LIOps[0];
1521 for (unsigned i = 0, e = AddRec->getNumOperands(); i != e; ++i)
1522 NewOps.push_back(getMulExpr(Scale, AddRec->getOperand(i)));
1524 for (unsigned i = 0, e = AddRec->getNumOperands(); i != e; ++i) {
1525 SmallVector<SCEVHandle, 4> MulOps(LIOps.begin(), LIOps.end());
1526 MulOps.push_back(AddRec->getOperand(i));
1527 NewOps.push_back(getMulExpr(MulOps));
1531 SCEVHandle NewRec = getAddRecExpr(NewOps, AddRec->getLoop());
1533 // If all of the other operands were loop invariant, we are done.
1534 if (Ops.size() == 1) return NewRec;
1536 // Otherwise, multiply the folded AddRec by the non-liv parts.
1537 for (unsigned i = 0;; ++i)
1538 if (Ops[i] == AddRec) {
1542 return getMulExpr(Ops);
1545 // Okay, if there weren't any loop invariants to be folded, check to see if
1546 // there are multiple AddRec's with the same loop induction variable being
1547 // multiplied together. If so, we can fold them.
1548 for (unsigned OtherIdx = Idx+1;
1549 OtherIdx < Ops.size() && isa<SCEVAddRecExpr>(Ops[OtherIdx]);++OtherIdx)
1550 if (OtherIdx != Idx) {
1551 const SCEVAddRecExpr *OtherAddRec = cast<SCEVAddRecExpr>(Ops[OtherIdx]);
1552 if (AddRec->getLoop() == OtherAddRec->getLoop()) {
1553 // F * G --> {A,+,B} * {C,+,D} --> {A*C,+,F*D + G*B + B*D}
1554 const SCEVAddRecExpr *F = AddRec, *G = OtherAddRec;
1555 SCEVHandle NewStart = getMulExpr(F->getStart(),
1557 SCEVHandle B = F->getStepRecurrence(*this);
1558 SCEVHandle D = G->getStepRecurrence(*this);
1559 SCEVHandle NewStep = getAddExpr(getMulExpr(F, D),
1562 SCEVHandle NewAddRec = getAddRecExpr(NewStart, NewStep,
1564 if (Ops.size() == 2) return NewAddRec;
1566 Ops.erase(Ops.begin()+Idx);
1567 Ops.erase(Ops.begin()+OtherIdx-1);
1568 Ops.push_back(NewAddRec);
1569 return getMulExpr(Ops);
1573 // Otherwise couldn't fold anything into this recurrence. Move onto the
1577 // Okay, it looks like we really DO need an mul expr. Check to see if we
1578 // already have one, otherwise create a new one.
1579 std::vector<const SCEV*> SCEVOps(Ops.begin(), Ops.end());
1580 SCEVCommutativeExpr *&Result = (*SCEVCommExprs)[std::make_pair(scMulExpr,
1583 Result = new SCEVMulExpr(Ops, this);
1587 /// getUDivExpr - Get a canonical multiply expression, or something simpler if
1589 SCEVHandle ScalarEvolution::getUDivExpr(const SCEVHandle &LHS,
1590 const SCEVHandle &RHS) {
1591 assert(getEffectiveSCEVType(LHS->getType()) ==
1592 getEffectiveSCEVType(RHS->getType()) &&
1593 "SCEVUDivExpr operand types don't match!");
1595 if (const SCEVConstant *RHSC = dyn_cast<SCEVConstant>(RHS)) {
1596 if (RHSC->getValue()->equalsInt(1))
1597 return LHS; // X udiv 1 --> x
1599 return getIntegerSCEV(0, LHS->getType()); // value is undefined
1601 // Determine if the division can be folded into the operands of
1603 // TODO: Generalize this to non-constants by using known-bits information.
1604 const Type *Ty = LHS->getType();
1605 unsigned LZ = RHSC->getValue()->getValue().countLeadingZeros();
1606 unsigned MaxShiftAmt = getTypeSizeInBits(Ty) - LZ;
1607 // For non-power-of-two values, effectively round the value up to the
1608 // nearest power of two.
1609 if (!RHSC->getValue()->getValue().isPowerOf2())
1611 const IntegerType *ExtTy =
1612 IntegerType::get(getTypeSizeInBits(Ty) + MaxShiftAmt);
1613 // {X,+,N}/C --> {X/C,+,N/C} if safe and N/C can be folded.
1614 if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(LHS))
1615 if (const SCEVConstant *Step =
1616 dyn_cast<SCEVConstant>(AR->getStepRecurrence(*this)))
1617 if (!Step->getValue()->getValue()
1618 .urem(RHSC->getValue()->getValue()) &&
1619 getZeroExtendExpr(AR, ExtTy) ==
1620 getAddRecExpr(getZeroExtendExpr(AR->getStart(), ExtTy),
1621 getZeroExtendExpr(Step, ExtTy),
1623 SmallVector<SCEVHandle, 4> Operands;
1624 for (unsigned i = 0, e = AR->getNumOperands(); i != e; ++i)
1625 Operands.push_back(getUDivExpr(AR->getOperand(i), RHS));
1626 return getAddRecExpr(Operands, AR->getLoop());
1628 // (A*B)/C --> A*(B/C) if safe and B/C can be folded.
1629 if (const SCEVMulExpr *M = dyn_cast<SCEVMulExpr>(LHS)) {
1630 SmallVector<SCEVHandle, 4> Operands;
1631 for (unsigned i = 0, e = M->getNumOperands(); i != e; ++i)
1632 Operands.push_back(getZeroExtendExpr(M->getOperand(i), ExtTy));
1633 if (getZeroExtendExpr(M, ExtTy) == getMulExpr(Operands))
1634 // Find an operand that's safely divisible.
1635 for (unsigned i = 0, e = M->getNumOperands(); i != e; ++i) {
1636 SCEVHandle Op = M->getOperand(i);
1637 SCEVHandle Div = getUDivExpr(Op, RHSC);
1638 if (!isa<SCEVUDivExpr>(Div) && getMulExpr(Div, RHSC) == Op) {
1639 const SmallVectorImpl<SCEVHandle> &MOperands = M->getOperands();
1640 Operands = SmallVector<SCEVHandle, 4>(MOperands.begin(),
1643 return getMulExpr(Operands);
1647 // (A+B)/C --> (A/C + B/C) if safe and A/C and B/C can be folded.
1648 if (const SCEVAddRecExpr *A = dyn_cast<SCEVAddRecExpr>(LHS)) {
1649 SmallVector<SCEVHandle, 4> Operands;
1650 for (unsigned i = 0, e = A->getNumOperands(); i != e; ++i)
1651 Operands.push_back(getZeroExtendExpr(A->getOperand(i), ExtTy));
1652 if (getZeroExtendExpr(A, ExtTy) == getAddExpr(Operands)) {
1654 for (unsigned i = 0, e = A->getNumOperands(); i != e; ++i) {
1655 SCEVHandle Op = getUDivExpr(A->getOperand(i), RHS);
1656 if (isa<SCEVUDivExpr>(Op) || getMulExpr(Op, RHS) != A->getOperand(i))
1658 Operands.push_back(Op);
1660 if (Operands.size() == A->getNumOperands())
1661 return getAddExpr(Operands);
1665 // Fold if both operands are constant.
1666 if (const SCEVConstant *LHSC = dyn_cast<SCEVConstant>(LHS)) {
1667 Constant *LHSCV = LHSC->getValue();
1668 Constant *RHSCV = RHSC->getValue();
1669 return getUnknown(ConstantExpr::getUDiv(LHSCV, RHSCV));
1673 SCEVUDivExpr *&Result = (*SCEVUDivs)[std::make_pair(LHS, RHS)];
1674 if (Result == 0) Result = new SCEVUDivExpr(LHS, RHS, this);
1679 /// getAddRecExpr - Get an add recurrence expression for the specified loop.
1680 /// Simplify the expression as much as possible.
1681 SCEVHandle ScalarEvolution::getAddRecExpr(const SCEVHandle &Start,
1682 const SCEVHandle &Step, const Loop *L) {
1683 SmallVector<SCEVHandle, 4> Operands;
1684 Operands.push_back(Start);
1685 if (const SCEVAddRecExpr *StepChrec = dyn_cast<SCEVAddRecExpr>(Step))
1686 if (StepChrec->getLoop() == L) {
1687 Operands.insert(Operands.end(), StepChrec->op_begin(),
1688 StepChrec->op_end());
1689 return getAddRecExpr(Operands, L);
1692 Operands.push_back(Step);
1693 return getAddRecExpr(Operands, L);
1696 /// getAddRecExpr - Get an add recurrence expression for the specified loop.
1697 /// Simplify the expression as much as possible.
1698 SCEVHandle ScalarEvolution::getAddRecExpr(SmallVectorImpl<SCEVHandle> &Operands,
1700 if (Operands.size() == 1) return Operands[0];
1702 for (unsigned i = 1, e = Operands.size(); i != e; ++i)
1703 assert(getEffectiveSCEVType(Operands[i]->getType()) ==
1704 getEffectiveSCEVType(Operands[0]->getType()) &&
1705 "SCEVAddRecExpr operand types don't match!");
1708 if (Operands.back()->isZero()) {
1709 Operands.pop_back();
1710 return getAddRecExpr(Operands, L); // {X,+,0} --> X
1713 // Canonicalize nested AddRecs in by nesting them in order of loop depth.
1714 if (const SCEVAddRecExpr *NestedAR = dyn_cast<SCEVAddRecExpr>(Operands[0])) {
1715 const Loop* NestedLoop = NestedAR->getLoop();
1716 if (L->getLoopDepth() < NestedLoop->getLoopDepth()) {
1717 SmallVector<SCEVHandle, 4> NestedOperands(NestedAR->op_begin(),
1718 NestedAR->op_end());
1719 SCEVHandle NestedARHandle(NestedAR);
1720 Operands[0] = NestedAR->getStart();
1721 NestedOperands[0] = getAddRecExpr(Operands, L);
1722 return getAddRecExpr(NestedOperands, NestedLoop);
1726 std::vector<const SCEV*> SCEVOps(Operands.begin(), Operands.end());
1727 SCEVAddRecExpr *&Result = (*SCEVAddRecExprs)[std::make_pair(L, SCEVOps)];
1728 if (Result == 0) Result = new SCEVAddRecExpr(Operands, L, this);
1732 SCEVHandle ScalarEvolution::getSMaxExpr(const SCEVHandle &LHS,
1733 const SCEVHandle &RHS) {
1734 SmallVector<SCEVHandle, 2> Ops;
1737 return getSMaxExpr(Ops);
1741 ScalarEvolution::getSMaxExpr(SmallVectorImpl<SCEVHandle> &Ops) {
1742 assert(!Ops.empty() && "Cannot get empty smax!");
1743 if (Ops.size() == 1) return Ops[0];
1745 for (unsigned i = 1, e = Ops.size(); i != e; ++i)
1746 assert(getEffectiveSCEVType(Ops[i]->getType()) ==
1747 getEffectiveSCEVType(Ops[0]->getType()) &&
1748 "SCEVSMaxExpr operand types don't match!");
1751 // Sort by complexity, this groups all similar expression types together.
1752 GroupByComplexity(Ops, LI);
1754 // If there are any constants, fold them together.
1756 if (const SCEVConstant *LHSC = dyn_cast<SCEVConstant>(Ops[0])) {
1758 assert(Idx < Ops.size());
1759 while (const SCEVConstant *RHSC = dyn_cast<SCEVConstant>(Ops[Idx])) {
1760 // We found two constants, fold them together!
1761 ConstantInt *Fold = ConstantInt::get(
1762 APIntOps::smax(LHSC->getValue()->getValue(),
1763 RHSC->getValue()->getValue()));
1764 Ops[0] = getConstant(Fold);
1765 Ops.erase(Ops.begin()+1); // Erase the folded element
1766 if (Ops.size() == 1) return Ops[0];
1767 LHSC = cast<SCEVConstant>(Ops[0]);
1770 // If we are left with a constant -inf, strip it off.
1771 if (cast<SCEVConstant>(Ops[0])->getValue()->isMinValue(true)) {
1772 Ops.erase(Ops.begin());
1777 if (Ops.size() == 1) return Ops[0];
1779 // Find the first SMax
1780 while (Idx < Ops.size() && Ops[Idx]->getSCEVType() < scSMaxExpr)
1783 // Check to see if one of the operands is an SMax. If so, expand its operands
1784 // onto our operand list, and recurse to simplify.
1785 if (Idx < Ops.size()) {
1786 bool DeletedSMax = false;
1787 while (const SCEVSMaxExpr *SMax = dyn_cast<SCEVSMaxExpr>(Ops[Idx])) {
1788 Ops.insert(Ops.end(), SMax->op_begin(), SMax->op_end());
1789 Ops.erase(Ops.begin()+Idx);
1794 return getSMaxExpr(Ops);
1797 // Okay, check to see if the same value occurs in the operand list twice. If
1798 // so, delete one. Since we sorted the list, these values are required to
1800 for (unsigned i = 0, e = Ops.size()-1; i != e; ++i)
1801 if (Ops[i] == Ops[i+1]) { // X smax Y smax Y --> X smax Y
1802 Ops.erase(Ops.begin()+i, Ops.begin()+i+1);
1806 if (Ops.size() == 1) return Ops[0];
1808 assert(!Ops.empty() && "Reduced smax down to nothing!");
1810 // Okay, it looks like we really DO need an smax expr. Check to see if we
1811 // already have one, otherwise create a new one.
1812 std::vector<const SCEV*> SCEVOps(Ops.begin(), Ops.end());
1813 SCEVCommutativeExpr *&Result = (*SCEVCommExprs)[std::make_pair(scSMaxExpr,
1815 if (Result == 0) Result = new SCEVSMaxExpr(Ops, this);
1819 SCEVHandle ScalarEvolution::getUMaxExpr(const SCEVHandle &LHS,
1820 const SCEVHandle &RHS) {
1821 SmallVector<SCEVHandle, 2> Ops;
1824 return getUMaxExpr(Ops);
1828 ScalarEvolution::getUMaxExpr(SmallVectorImpl<SCEVHandle> &Ops) {
1829 assert(!Ops.empty() && "Cannot get empty umax!");
1830 if (Ops.size() == 1) return Ops[0];
1832 for (unsigned i = 1, e = Ops.size(); i != e; ++i)
1833 assert(getEffectiveSCEVType(Ops[i]->getType()) ==
1834 getEffectiveSCEVType(Ops[0]->getType()) &&
1835 "SCEVUMaxExpr operand types don't match!");
1838 // Sort by complexity, this groups all similar expression types together.
1839 GroupByComplexity(Ops, LI);
1841 // If there are any constants, fold them together.
1843 if (const SCEVConstant *LHSC = dyn_cast<SCEVConstant>(Ops[0])) {
1845 assert(Idx < Ops.size());
1846 while (const SCEVConstant *RHSC = dyn_cast<SCEVConstant>(Ops[Idx])) {
1847 // We found two constants, fold them together!
1848 ConstantInt *Fold = ConstantInt::get(
1849 APIntOps::umax(LHSC->getValue()->getValue(),
1850 RHSC->getValue()->getValue()));
1851 Ops[0] = getConstant(Fold);
1852 Ops.erase(Ops.begin()+1); // Erase the folded element
1853 if (Ops.size() == 1) return Ops[0];
1854 LHSC = cast<SCEVConstant>(Ops[0]);
1857 // If we are left with a constant zero, strip it off.
1858 if (cast<SCEVConstant>(Ops[0])->getValue()->isMinValue(false)) {
1859 Ops.erase(Ops.begin());
1864 if (Ops.size() == 1) return Ops[0];
1866 // Find the first UMax
1867 while (Idx < Ops.size() && Ops[Idx]->getSCEVType() < scUMaxExpr)
1870 // Check to see if one of the operands is a UMax. If so, expand its operands
1871 // onto our operand list, and recurse to simplify.
1872 if (Idx < Ops.size()) {
1873 bool DeletedUMax = false;
1874 while (const SCEVUMaxExpr *UMax = dyn_cast<SCEVUMaxExpr>(Ops[Idx])) {
1875 Ops.insert(Ops.end(), UMax->op_begin(), UMax->op_end());
1876 Ops.erase(Ops.begin()+Idx);
1881 return getUMaxExpr(Ops);
1884 // Okay, check to see if the same value occurs in the operand list twice. If
1885 // so, delete one. Since we sorted the list, these values are required to
1887 for (unsigned i = 0, e = Ops.size()-1; i != e; ++i)
1888 if (Ops[i] == Ops[i+1]) { // X umax Y umax Y --> X umax Y
1889 Ops.erase(Ops.begin()+i, Ops.begin()+i+1);
1893 if (Ops.size() == 1) return Ops[0];
1895 assert(!Ops.empty() && "Reduced umax down to nothing!");
1897 // Okay, it looks like we really DO need a umax expr. Check to see if we
1898 // already have one, otherwise create a new one.
1899 std::vector<const SCEV*> SCEVOps(Ops.begin(), Ops.end());
1900 SCEVCommutativeExpr *&Result = (*SCEVCommExprs)[std::make_pair(scUMaxExpr,
1902 if (Result == 0) Result = new SCEVUMaxExpr(Ops, this);
1906 SCEVHandle ScalarEvolution::getUnknown(Value *V) {
1907 if (ConstantInt *CI = dyn_cast<ConstantInt>(V))
1908 return getConstant(CI);
1909 if (isa<ConstantPointerNull>(V))
1910 return getIntegerSCEV(0, V->getType());
1911 SCEVUnknown *&Result = (*SCEVUnknowns)[V];
1912 if (Result == 0) Result = new SCEVUnknown(V, this);
1916 //===----------------------------------------------------------------------===//
1917 // Basic SCEV Analysis and PHI Idiom Recognition Code
1920 /// isSCEVable - Test if values of the given type are analyzable within
1921 /// the SCEV framework. This primarily includes integer types, and it
1922 /// can optionally include pointer types if the ScalarEvolution class
1923 /// has access to target-specific information.
1924 bool ScalarEvolution::isSCEVable(const Type *Ty) const {
1925 // Integers are always SCEVable.
1926 if (Ty->isInteger())
1929 // Pointers are SCEVable if TargetData information is available
1930 // to provide pointer size information.
1931 if (isa<PointerType>(Ty))
1934 // Otherwise it's not SCEVable.
1938 /// getTypeSizeInBits - Return the size in bits of the specified type,
1939 /// for which isSCEVable must return true.
1940 uint64_t ScalarEvolution::getTypeSizeInBits(const Type *Ty) const {
1941 assert(isSCEVable(Ty) && "Type is not SCEVable!");
1943 // If we have a TargetData, use it!
1945 return TD->getTypeSizeInBits(Ty);
1947 // Otherwise, we support only integer types.
1948 assert(Ty->isInteger() && "isSCEVable permitted a non-SCEVable type!");
1949 return Ty->getPrimitiveSizeInBits();
1952 /// getEffectiveSCEVType - Return a type with the same bitwidth as
1953 /// the given type and which represents how SCEV will treat the given
1954 /// type, for which isSCEVable must return true. For pointer types,
1955 /// this is the pointer-sized integer type.
1956 const Type *ScalarEvolution::getEffectiveSCEVType(const Type *Ty) const {
1957 assert(isSCEVable(Ty) && "Type is not SCEVable!");
1959 if (Ty->isInteger())
1962 assert(isa<PointerType>(Ty) && "Unexpected non-pointer non-integer type!");
1963 return TD->getIntPtrType();
1966 SCEVHandle ScalarEvolution::getCouldNotCompute() {
1967 return CouldNotCompute;
1970 /// hasSCEV - Return true if the SCEV for this value has already been
1972 bool ScalarEvolution::hasSCEV(Value *V) const {
1973 return Scalars.count(V);
1976 /// getSCEV - Return an existing SCEV if it exists, otherwise analyze the
1977 /// expression and create a new one.
1978 SCEVHandle ScalarEvolution::getSCEV(Value *V) {
1979 assert(isSCEVable(V->getType()) && "Value is not SCEVable!");
1981 std::map<SCEVCallbackVH, SCEVHandle>::iterator I = Scalars.find(V);
1982 if (I != Scalars.end()) return I->second;
1983 SCEVHandle S = createSCEV(V);
1984 Scalars.insert(std::make_pair(SCEVCallbackVH(V, this), S));
1988 /// getIntegerSCEV - Given an integer or FP type, create a constant for the
1989 /// specified signed integer value and return a SCEV for the constant.
1990 SCEVHandle ScalarEvolution::getIntegerSCEV(int Val, const Type *Ty) {
1991 Ty = getEffectiveSCEVType(Ty);
1994 C = Constant::getNullValue(Ty);
1995 else if (Ty->isFloatingPoint())
1996 C = ConstantFP::get(APFloat(Ty==Type::FloatTy ? APFloat::IEEEsingle :
1997 APFloat::IEEEdouble, Val));
1999 C = ConstantInt::get(Ty, Val);
2000 return getUnknown(C);
2003 /// getNegativeSCEV - Return a SCEV corresponding to -V = -1*V
2005 SCEVHandle ScalarEvolution::getNegativeSCEV(const SCEVHandle &V) {
2006 if (const SCEVConstant *VC = dyn_cast<SCEVConstant>(V))
2007 return getUnknown(ConstantExpr::getNeg(VC->getValue()));
2009 const Type *Ty = V->getType();
2010 Ty = getEffectiveSCEVType(Ty);
2011 return getMulExpr(V, getConstant(ConstantInt::getAllOnesValue(Ty)));
2014 /// getNotSCEV - Return a SCEV corresponding to ~V = -1-V
2015 SCEVHandle ScalarEvolution::getNotSCEV(const SCEVHandle &V) {
2016 if (const SCEVConstant *VC = dyn_cast<SCEVConstant>(V))
2017 return getUnknown(ConstantExpr::getNot(VC->getValue()));
2019 const Type *Ty = V->getType();
2020 Ty = getEffectiveSCEVType(Ty);
2021 SCEVHandle AllOnes = getConstant(ConstantInt::getAllOnesValue(Ty));
2022 return getMinusSCEV(AllOnes, V);
2025 /// getMinusSCEV - Return a SCEV corresponding to LHS - RHS.
2027 SCEVHandle ScalarEvolution::getMinusSCEV(const SCEVHandle &LHS,
2028 const SCEVHandle &RHS) {
2030 return getAddExpr(LHS, getNegativeSCEV(RHS));
2033 /// getTruncateOrZeroExtend - Return a SCEV corresponding to a conversion of the
2034 /// input value to the specified type. If the type must be extended, it is zero
2037 ScalarEvolution::getTruncateOrZeroExtend(const SCEVHandle &V,
2039 const Type *SrcTy = V->getType();
2040 assert((SrcTy->isInteger() || (TD && isa<PointerType>(SrcTy))) &&
2041 (Ty->isInteger() || (TD && isa<PointerType>(Ty))) &&
2042 "Cannot truncate or zero extend with non-integer arguments!");
2043 if (getTypeSizeInBits(SrcTy) == getTypeSizeInBits(Ty))
2044 return V; // No conversion
2045 if (getTypeSizeInBits(SrcTy) > getTypeSizeInBits(Ty))
2046 return getTruncateExpr(V, Ty);
2047 return getZeroExtendExpr(V, Ty);
2050 /// getTruncateOrSignExtend - Return a SCEV corresponding to a conversion of the
2051 /// input value to the specified type. If the type must be extended, it is sign
2054 ScalarEvolution::getTruncateOrSignExtend(const SCEVHandle &V,
2056 const Type *SrcTy = V->getType();
2057 assert((SrcTy->isInteger() || (TD && isa<PointerType>(SrcTy))) &&
2058 (Ty->isInteger() || (TD && isa<PointerType>(Ty))) &&
2059 "Cannot truncate or zero extend with non-integer arguments!");
2060 if (getTypeSizeInBits(SrcTy) == getTypeSizeInBits(Ty))
2061 return V; // No conversion
2062 if (getTypeSizeInBits(SrcTy) > getTypeSizeInBits(Ty))
2063 return getTruncateExpr(V, Ty);
2064 return getSignExtendExpr(V, Ty);
2067 /// getNoopOrZeroExtend - Return a SCEV corresponding to a conversion of the
2068 /// input value to the specified type. If the type must be extended, it is zero
2069 /// extended. The conversion must not be narrowing.
2071 ScalarEvolution::getNoopOrZeroExtend(const SCEVHandle &V, const Type *Ty) {
2072 const Type *SrcTy = V->getType();
2073 assert((SrcTy->isInteger() || (TD && isa<PointerType>(SrcTy))) &&
2074 (Ty->isInteger() || (TD && isa<PointerType>(Ty))) &&
2075 "Cannot noop or zero extend with non-integer arguments!");
2076 assert(getTypeSizeInBits(SrcTy) <= getTypeSizeInBits(Ty) &&
2077 "getNoopOrZeroExtend cannot truncate!");
2078 if (getTypeSizeInBits(SrcTy) == getTypeSizeInBits(Ty))
2079 return V; // No conversion
2080 return getZeroExtendExpr(V, Ty);
2083 /// getNoopOrSignExtend - Return a SCEV corresponding to a conversion of the
2084 /// input value to the specified type. If the type must be extended, it is sign
2085 /// extended. The conversion must not be narrowing.
2087 ScalarEvolution::getNoopOrSignExtend(const SCEVHandle &V, const Type *Ty) {
2088 const Type *SrcTy = V->getType();
2089 assert((SrcTy->isInteger() || (TD && isa<PointerType>(SrcTy))) &&
2090 (Ty->isInteger() || (TD && isa<PointerType>(Ty))) &&
2091 "Cannot noop or sign extend with non-integer arguments!");
2092 assert(getTypeSizeInBits(SrcTy) <= getTypeSizeInBits(Ty) &&
2093 "getNoopOrSignExtend cannot truncate!");
2094 if (getTypeSizeInBits(SrcTy) == getTypeSizeInBits(Ty))
2095 return V; // No conversion
2096 return getSignExtendExpr(V, Ty);
2099 /// getNoopOrAnyExtend - Return a SCEV corresponding to a conversion of
2100 /// the input value to the specified type. If the type must be extended,
2101 /// it is extended with unspecified bits. The conversion must not be
2104 ScalarEvolution::getNoopOrAnyExtend(const SCEVHandle &V, const Type *Ty) {
2105 const Type *SrcTy = V->getType();
2106 assert((SrcTy->isInteger() || (TD && isa<PointerType>(SrcTy))) &&
2107 (Ty->isInteger() || (TD && isa<PointerType>(Ty))) &&
2108 "Cannot noop or any extend with non-integer arguments!");
2109 assert(getTypeSizeInBits(SrcTy) <= getTypeSizeInBits(Ty) &&
2110 "getNoopOrAnyExtend cannot truncate!");
2111 if (getTypeSizeInBits(SrcTy) == getTypeSizeInBits(Ty))
2112 return V; // No conversion
2113 return getAnyExtendExpr(V, Ty);
2116 /// getTruncateOrNoop - Return a SCEV corresponding to a conversion of the
2117 /// input value to the specified type. The conversion must not be widening.
2119 ScalarEvolution::getTruncateOrNoop(const SCEVHandle &V, const Type *Ty) {
2120 const Type *SrcTy = V->getType();
2121 assert((SrcTy->isInteger() || (TD && isa<PointerType>(SrcTy))) &&
2122 (Ty->isInteger() || (TD && isa<PointerType>(Ty))) &&
2123 "Cannot truncate or noop with non-integer arguments!");
2124 assert(getTypeSizeInBits(SrcTy) >= getTypeSizeInBits(Ty) &&
2125 "getTruncateOrNoop cannot extend!");
2126 if (getTypeSizeInBits(SrcTy) == getTypeSizeInBits(Ty))
2127 return V; // No conversion
2128 return getTruncateExpr(V, Ty);
2131 /// ReplaceSymbolicValueWithConcrete - This looks up the computed SCEV value for
2132 /// the specified instruction and replaces any references to the symbolic value
2133 /// SymName with the specified value. This is used during PHI resolution.
2134 void ScalarEvolution::
2135 ReplaceSymbolicValueWithConcrete(Instruction *I, const SCEVHandle &SymName,
2136 const SCEVHandle &NewVal) {
2137 std::map<SCEVCallbackVH, SCEVHandle>::iterator SI =
2138 Scalars.find(SCEVCallbackVH(I, this));
2139 if (SI == Scalars.end()) return;
2142 SI->second->replaceSymbolicValuesWithConcrete(SymName, NewVal, *this);
2143 if (NV == SI->second) return; // No change.
2145 SI->second = NV; // Update the scalars map!
2147 // Any instruction values that use this instruction might also need to be
2149 for (Value::use_iterator UI = I->use_begin(), E = I->use_end();
2151 ReplaceSymbolicValueWithConcrete(cast<Instruction>(*UI), SymName, NewVal);
2154 /// createNodeForPHI - PHI nodes have two cases. Either the PHI node exists in
2155 /// a loop header, making it a potential recurrence, or it doesn't.
2157 SCEVHandle ScalarEvolution::createNodeForPHI(PHINode *PN) {
2158 if (PN->getNumIncomingValues() == 2) // The loops have been canonicalized.
2159 if (const Loop *L = LI->getLoopFor(PN->getParent()))
2160 if (L->getHeader() == PN->getParent()) {
2161 // If it lives in the loop header, it has two incoming values, one
2162 // from outside the loop, and one from inside.
2163 unsigned IncomingEdge = L->contains(PN->getIncomingBlock(0));
2164 unsigned BackEdge = IncomingEdge^1;
2166 // While we are analyzing this PHI node, handle its value symbolically.
2167 SCEVHandle SymbolicName = getUnknown(PN);
2168 assert(Scalars.find(PN) == Scalars.end() &&
2169 "PHI node already processed?");
2170 Scalars.insert(std::make_pair(SCEVCallbackVH(PN, this), SymbolicName));
2172 // Using this symbolic name for the PHI, analyze the value coming around
2174 SCEVHandle BEValue = getSCEV(PN->getIncomingValue(BackEdge));
2176 // NOTE: If BEValue is loop invariant, we know that the PHI node just
2177 // has a special value for the first iteration of the loop.
2179 // If the value coming around the backedge is an add with the symbolic
2180 // value we just inserted, then we found a simple induction variable!
2181 if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(BEValue)) {
2182 // If there is a single occurrence of the symbolic value, replace it
2183 // with a recurrence.
2184 unsigned FoundIndex = Add->getNumOperands();
2185 for (unsigned i = 0, e = Add->getNumOperands(); i != e; ++i)
2186 if (Add->getOperand(i) == SymbolicName)
2187 if (FoundIndex == e) {
2192 if (FoundIndex != Add->getNumOperands()) {
2193 // Create an add with everything but the specified operand.
2194 SmallVector<SCEVHandle, 8> Ops;
2195 for (unsigned i = 0, e = Add->getNumOperands(); i != e; ++i)
2196 if (i != FoundIndex)
2197 Ops.push_back(Add->getOperand(i));
2198 SCEVHandle Accum = getAddExpr(Ops);
2200 // This is not a valid addrec if the step amount is varying each
2201 // loop iteration, but is not itself an addrec in this loop.
2202 if (Accum->isLoopInvariant(L) ||
2203 (isa<SCEVAddRecExpr>(Accum) &&
2204 cast<SCEVAddRecExpr>(Accum)->getLoop() == L)) {
2205 SCEVHandle StartVal = getSCEV(PN->getIncomingValue(IncomingEdge));
2206 SCEVHandle PHISCEV = getAddRecExpr(StartVal, Accum, L);
2208 // Okay, for the entire analysis of this edge we assumed the PHI
2209 // to be symbolic. We now need to go back and update all of the
2210 // entries for the scalars that use the PHI (except for the PHI
2211 // itself) to use the new analyzed value instead of the "symbolic"
2213 ReplaceSymbolicValueWithConcrete(PN, SymbolicName, PHISCEV);
2217 } else if (const SCEVAddRecExpr *AddRec =
2218 dyn_cast<SCEVAddRecExpr>(BEValue)) {
2219 // Otherwise, this could be a loop like this:
2220 // i = 0; for (j = 1; ..; ++j) { .... i = j; }
2221 // In this case, j = {1,+,1} and BEValue is j.
2222 // Because the other in-value of i (0) fits the evolution of BEValue
2223 // i really is an addrec evolution.
2224 if (AddRec->getLoop() == L && AddRec->isAffine()) {
2225 SCEVHandle StartVal = getSCEV(PN->getIncomingValue(IncomingEdge));
2227 // If StartVal = j.start - j.stride, we can use StartVal as the
2228 // initial step of the addrec evolution.
2229 if (StartVal == getMinusSCEV(AddRec->getOperand(0),
2230 AddRec->getOperand(1))) {
2231 SCEVHandle PHISCEV =
2232 getAddRecExpr(StartVal, AddRec->getOperand(1), L);
2234 // Okay, for the entire analysis of this edge we assumed the PHI
2235 // to be symbolic. We now need to go back and update all of the
2236 // entries for the scalars that use the PHI (except for the PHI
2237 // itself) to use the new analyzed value instead of the "symbolic"
2239 ReplaceSymbolicValueWithConcrete(PN, SymbolicName, PHISCEV);
2245 return SymbolicName;
2248 // If it's not a loop phi, we can't handle it yet.
2249 return getUnknown(PN);
2252 /// createNodeForGEP - Expand GEP instructions into add and multiply
2253 /// operations. This allows them to be analyzed by regular SCEV code.
2255 SCEVHandle ScalarEvolution::createNodeForGEP(User *GEP) {
2257 const Type *IntPtrTy = TD->getIntPtrType();
2258 Value *Base = GEP->getOperand(0);
2259 // Don't attempt to analyze GEPs over unsized objects.
2260 if (!cast<PointerType>(Base->getType())->getElementType()->isSized())
2261 return getUnknown(GEP);
2262 SCEVHandle TotalOffset = getIntegerSCEV(0, IntPtrTy);
2263 gep_type_iterator GTI = gep_type_begin(GEP);
2264 for (GetElementPtrInst::op_iterator I = next(GEP->op_begin()),
2268 // Compute the (potentially symbolic) offset in bytes for this index.
2269 if (const StructType *STy = dyn_cast<StructType>(*GTI++)) {
2270 // For a struct, add the member offset.
2271 const StructLayout &SL = *TD->getStructLayout(STy);
2272 unsigned FieldNo = cast<ConstantInt>(Index)->getZExtValue();
2273 uint64_t Offset = SL.getElementOffset(FieldNo);
2274 TotalOffset = getAddExpr(TotalOffset,
2275 getIntegerSCEV(Offset, IntPtrTy));
2277 // For an array, add the element offset, explicitly scaled.
2278 SCEVHandle LocalOffset = getSCEV(Index);
2279 if (!isa<PointerType>(LocalOffset->getType()))
2280 // Getelementptr indicies are signed.
2281 LocalOffset = getTruncateOrSignExtend(LocalOffset,
2284 getMulExpr(LocalOffset,
2285 getIntegerSCEV(TD->getTypeAllocSize(*GTI),
2287 TotalOffset = getAddExpr(TotalOffset, LocalOffset);
2290 return getAddExpr(getSCEV(Base), TotalOffset);
2293 /// GetMinTrailingZeros - Determine the minimum number of zero bits that S is
2294 /// guaranteed to end in (at every loop iteration). It is, at the same time,
2295 /// the minimum number of times S is divisible by 2. For example, given {4,+,8}
2296 /// it returns 2. If S is guaranteed to be 0, it returns the bitwidth of S.
2297 static uint32_t GetMinTrailingZeros(SCEVHandle S, const ScalarEvolution &SE) {
2298 if (const SCEVConstant *C = dyn_cast<SCEVConstant>(S))
2299 return C->getValue()->getValue().countTrailingZeros();
2301 if (const SCEVTruncateExpr *T = dyn_cast<SCEVTruncateExpr>(S))
2302 return std::min(GetMinTrailingZeros(T->getOperand(), SE),
2303 (uint32_t)SE.getTypeSizeInBits(T->getType()));
2305 if (const SCEVZeroExtendExpr *E = dyn_cast<SCEVZeroExtendExpr>(S)) {
2306 uint32_t OpRes = GetMinTrailingZeros(E->getOperand(), SE);
2307 return OpRes == SE.getTypeSizeInBits(E->getOperand()->getType()) ?
2308 SE.getTypeSizeInBits(E->getType()) : OpRes;
2311 if (const SCEVSignExtendExpr *E = dyn_cast<SCEVSignExtendExpr>(S)) {
2312 uint32_t OpRes = GetMinTrailingZeros(E->getOperand(), SE);
2313 return OpRes == SE.getTypeSizeInBits(E->getOperand()->getType()) ?
2314 SE.getTypeSizeInBits(E->getType()) : OpRes;
2317 if (const SCEVAddExpr *A = dyn_cast<SCEVAddExpr>(S)) {
2318 // The result is the min of all operands results.
2319 uint32_t MinOpRes = GetMinTrailingZeros(A->getOperand(0), SE);
2320 for (unsigned i = 1, e = A->getNumOperands(); MinOpRes && i != e; ++i)
2321 MinOpRes = std::min(MinOpRes, GetMinTrailingZeros(A->getOperand(i), SE));
2325 if (const SCEVMulExpr *M = dyn_cast<SCEVMulExpr>(S)) {
2326 // The result is the sum of all operands results.
2327 uint32_t SumOpRes = GetMinTrailingZeros(M->getOperand(0), SE);
2328 uint32_t BitWidth = SE.getTypeSizeInBits(M->getType());
2329 for (unsigned i = 1, e = M->getNumOperands();
2330 SumOpRes != BitWidth && i != e; ++i)
2331 SumOpRes = std::min(SumOpRes + GetMinTrailingZeros(M->getOperand(i), SE),
2336 if (const SCEVAddRecExpr *A = dyn_cast<SCEVAddRecExpr>(S)) {
2337 // The result is the min of all operands results.
2338 uint32_t MinOpRes = GetMinTrailingZeros(A->getOperand(0), SE);
2339 for (unsigned i = 1, e = A->getNumOperands(); MinOpRes && i != e; ++i)
2340 MinOpRes = std::min(MinOpRes, GetMinTrailingZeros(A->getOperand(i), SE));
2344 if (const SCEVSMaxExpr *M = dyn_cast<SCEVSMaxExpr>(S)) {
2345 // The result is the min of all operands results.
2346 uint32_t MinOpRes = GetMinTrailingZeros(M->getOperand(0), SE);
2347 for (unsigned i = 1, e = M->getNumOperands(); MinOpRes && i != e; ++i)
2348 MinOpRes = std::min(MinOpRes, GetMinTrailingZeros(M->getOperand(i), SE));
2352 if (const SCEVUMaxExpr *M = dyn_cast<SCEVUMaxExpr>(S)) {
2353 // The result is the min of all operands results.
2354 uint32_t MinOpRes = GetMinTrailingZeros(M->getOperand(0), SE);
2355 for (unsigned i = 1, e = M->getNumOperands(); MinOpRes && i != e; ++i)
2356 MinOpRes = std::min(MinOpRes, GetMinTrailingZeros(M->getOperand(i), SE));
2360 // SCEVUDivExpr, SCEVUnknown
2364 /// createSCEV - We know that there is no SCEV for the specified value.
2365 /// Analyze the expression.
2367 SCEVHandle ScalarEvolution::createSCEV(Value *V) {
2368 if (!isSCEVable(V->getType()))
2369 return getUnknown(V);
2371 unsigned Opcode = Instruction::UserOp1;
2372 if (Instruction *I = dyn_cast<Instruction>(V))
2373 Opcode = I->getOpcode();
2374 else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V))
2375 Opcode = CE->getOpcode();
2377 return getUnknown(V);
2379 User *U = cast<User>(V);
2381 case Instruction::Add:
2382 return getAddExpr(getSCEV(U->getOperand(0)),
2383 getSCEV(U->getOperand(1)));
2384 case Instruction::Mul:
2385 return getMulExpr(getSCEV(U->getOperand(0)),
2386 getSCEV(U->getOperand(1)));
2387 case Instruction::UDiv:
2388 return getUDivExpr(getSCEV(U->getOperand(0)),
2389 getSCEV(U->getOperand(1)));
2390 case Instruction::Sub:
2391 return getMinusSCEV(getSCEV(U->getOperand(0)),
2392 getSCEV(U->getOperand(1)));
2393 case Instruction::And:
2394 // For an expression like x&255 that merely masks off the high bits,
2395 // use zext(trunc(x)) as the SCEV expression.
2396 if (ConstantInt *CI = dyn_cast<ConstantInt>(U->getOperand(1))) {
2397 if (CI->isNullValue())
2398 return getSCEV(U->getOperand(1));
2399 if (CI->isAllOnesValue())
2400 return getSCEV(U->getOperand(0));
2401 const APInt &A = CI->getValue();
2403 // Instcombine's ShrinkDemandedConstant may strip bits out of
2404 // constants, obscuring what would otherwise be a low-bits mask.
2405 // Use ComputeMaskedBits to compute what ShrinkDemandedConstant
2406 // knew about to reconstruct a low-bits mask value.
2407 unsigned LZ = A.countLeadingZeros();
2408 unsigned BitWidth = A.getBitWidth();
2409 APInt AllOnes = APInt::getAllOnesValue(BitWidth);
2410 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
2411 ComputeMaskedBits(U->getOperand(0), AllOnes, KnownZero, KnownOne, TD);
2413 APInt EffectiveMask = APInt::getLowBitsSet(BitWidth, BitWidth - LZ);
2415 if (LZ != 0 && !((~A & ~KnownZero) & EffectiveMask))
2417 getZeroExtendExpr(getTruncateExpr(getSCEV(U->getOperand(0)),
2418 IntegerType::get(BitWidth - LZ)),
2423 case Instruction::Or:
2424 // If the RHS of the Or is a constant, we may have something like:
2425 // X*4+1 which got turned into X*4|1. Handle this as an Add so loop
2426 // optimizations will transparently handle this case.
2428 // In order for this transformation to be safe, the LHS must be of the
2429 // form X*(2^n) and the Or constant must be less than 2^n.
2430 if (ConstantInt *CI = dyn_cast<ConstantInt>(U->getOperand(1))) {
2431 SCEVHandle LHS = getSCEV(U->getOperand(0));
2432 const APInt &CIVal = CI->getValue();
2433 if (GetMinTrailingZeros(LHS, *this) >=
2434 (CIVal.getBitWidth() - CIVal.countLeadingZeros()))
2435 return getAddExpr(LHS, getSCEV(U->getOperand(1)));
2438 case Instruction::Xor:
2439 if (ConstantInt *CI = dyn_cast<ConstantInt>(U->getOperand(1))) {
2440 // If the RHS of the xor is a signbit, then this is just an add.
2441 // Instcombine turns add of signbit into xor as a strength reduction step.
2442 if (CI->getValue().isSignBit())
2443 return getAddExpr(getSCEV(U->getOperand(0)),
2444 getSCEV(U->getOperand(1)));
2446 // If the RHS of xor is -1, then this is a not operation.
2447 if (CI->isAllOnesValue())
2448 return getNotSCEV(getSCEV(U->getOperand(0)));
2450 // Model xor(and(x, C), C) as and(~x, C), if C is a low-bits mask.
2451 // This is a variant of the check for xor with -1, and it handles
2452 // the case where instcombine has trimmed non-demanded bits out
2453 // of an xor with -1.
2454 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(U->getOperand(0)))
2455 if (ConstantInt *LCI = dyn_cast<ConstantInt>(BO->getOperand(1)))
2456 if (BO->getOpcode() == Instruction::And &&
2457 LCI->getValue() == CI->getValue())
2458 if (const SCEVZeroExtendExpr *Z =
2459 dyn_cast<SCEVZeroExtendExpr>(getSCEV(U->getOperand(0)))) {
2460 const Type *UTy = U->getType();
2461 SCEVHandle Z0 = Z->getOperand();
2462 const Type *Z0Ty = Z0->getType();
2463 unsigned Z0TySize = getTypeSizeInBits(Z0Ty);
2465 // If C is a low-bits mask, the zero extend is zerving to
2466 // mask off the high bits. Complement the operand and
2467 // re-apply the zext.
2468 if (APIntOps::isMask(Z0TySize, CI->getValue()))
2469 return getZeroExtendExpr(getNotSCEV(Z0), UTy);
2471 // If C is a single bit, it may be in the sign-bit position
2472 // before the zero-extend. In this case, represent the xor
2473 // using an add, which is equivalent, and re-apply the zext.
2474 APInt Trunc = APInt(CI->getValue()).trunc(Z0TySize);
2475 if (APInt(Trunc).zext(getTypeSizeInBits(UTy)) == CI->getValue() &&
2477 return getZeroExtendExpr(getAddExpr(Z0, getConstant(Trunc)),
2483 case Instruction::Shl:
2484 // Turn shift left of a constant amount into a multiply.
2485 if (ConstantInt *SA = dyn_cast<ConstantInt>(U->getOperand(1))) {
2486 uint32_t BitWidth = cast<IntegerType>(V->getType())->getBitWidth();
2487 Constant *X = ConstantInt::get(
2488 APInt(BitWidth, 1).shl(SA->getLimitedValue(BitWidth)));
2489 return getMulExpr(getSCEV(U->getOperand(0)), getSCEV(X));
2493 case Instruction::LShr:
2494 // Turn logical shift right of a constant into a unsigned divide.
2495 if (ConstantInt *SA = dyn_cast<ConstantInt>(U->getOperand(1))) {
2496 uint32_t BitWidth = cast<IntegerType>(V->getType())->getBitWidth();
2497 Constant *X = ConstantInt::get(
2498 APInt(BitWidth, 1).shl(SA->getLimitedValue(BitWidth)));
2499 return getUDivExpr(getSCEV(U->getOperand(0)), getSCEV(X));
2503 case Instruction::AShr:
2504 // For a two-shift sext-inreg, use sext(trunc(x)) as the SCEV expression.
2505 if (ConstantInt *CI = dyn_cast<ConstantInt>(U->getOperand(1)))
2506 if (Instruction *L = dyn_cast<Instruction>(U->getOperand(0)))
2507 if (L->getOpcode() == Instruction::Shl &&
2508 L->getOperand(1) == U->getOperand(1)) {
2509 unsigned BitWidth = getTypeSizeInBits(U->getType());
2510 uint64_t Amt = BitWidth - CI->getZExtValue();
2511 if (Amt == BitWidth)
2512 return getSCEV(L->getOperand(0)); // shift by zero --> noop
2514 return getIntegerSCEV(0, U->getType()); // value is undefined
2516 getSignExtendExpr(getTruncateExpr(getSCEV(L->getOperand(0)),
2517 IntegerType::get(Amt)),
2522 case Instruction::Trunc:
2523 return getTruncateExpr(getSCEV(U->getOperand(0)), U->getType());
2525 case Instruction::ZExt:
2526 return getZeroExtendExpr(getSCEV(U->getOperand(0)), U->getType());
2528 case Instruction::SExt:
2529 return getSignExtendExpr(getSCEV(U->getOperand(0)), U->getType());
2531 case Instruction::BitCast:
2532 // BitCasts are no-op casts so we just eliminate the cast.
2533 if (isSCEVable(U->getType()) && isSCEVable(U->getOperand(0)->getType()))
2534 return getSCEV(U->getOperand(0));
2537 case Instruction::IntToPtr:
2538 if (!TD) break; // Without TD we can't analyze pointers.
2539 return getTruncateOrZeroExtend(getSCEV(U->getOperand(0)),
2540 TD->getIntPtrType());
2542 case Instruction::PtrToInt:
2543 if (!TD) break; // Without TD we can't analyze pointers.
2544 return getTruncateOrZeroExtend(getSCEV(U->getOperand(0)),
2547 case Instruction::GetElementPtr:
2548 if (!TD) break; // Without TD we can't analyze pointers.
2549 return createNodeForGEP(U);
2551 case Instruction::PHI:
2552 return createNodeForPHI(cast<PHINode>(U));
2554 case Instruction::Select:
2555 // This could be a smax or umax that was lowered earlier.
2556 // Try to recover it.
2557 if (ICmpInst *ICI = dyn_cast<ICmpInst>(U->getOperand(0))) {
2558 Value *LHS = ICI->getOperand(0);
2559 Value *RHS = ICI->getOperand(1);
2560 switch (ICI->getPredicate()) {
2561 case ICmpInst::ICMP_SLT:
2562 case ICmpInst::ICMP_SLE:
2563 std::swap(LHS, RHS);
2565 case ICmpInst::ICMP_SGT:
2566 case ICmpInst::ICMP_SGE:
2567 if (LHS == U->getOperand(1) && RHS == U->getOperand(2))
2568 return getSMaxExpr(getSCEV(LHS), getSCEV(RHS));
2569 else if (LHS == U->getOperand(2) && RHS == U->getOperand(1))
2570 // ~smax(~x, ~y) == smin(x, y).
2571 return getNotSCEV(getSMaxExpr(
2572 getNotSCEV(getSCEV(LHS)),
2573 getNotSCEV(getSCEV(RHS))));
2575 case ICmpInst::ICMP_ULT:
2576 case ICmpInst::ICMP_ULE:
2577 std::swap(LHS, RHS);
2579 case ICmpInst::ICMP_UGT:
2580 case ICmpInst::ICMP_UGE:
2581 if (LHS == U->getOperand(1) && RHS == U->getOperand(2))
2582 return getUMaxExpr(getSCEV(LHS), getSCEV(RHS));
2583 else if (LHS == U->getOperand(2) && RHS == U->getOperand(1))
2584 // ~umax(~x, ~y) == umin(x, y)
2585 return getNotSCEV(getUMaxExpr(getNotSCEV(getSCEV(LHS)),
2586 getNotSCEV(getSCEV(RHS))));
2588 case ICmpInst::ICMP_NE:
2589 // n != 0 ? n : 1 -> umax(n, 1)
2590 if (LHS == U->getOperand(1) &&
2591 isa<ConstantInt>(U->getOperand(2)) &&
2592 cast<ConstantInt>(U->getOperand(2))->isOne() &&
2593 isa<ConstantInt>(RHS) &&
2594 cast<ConstantInt>(RHS)->isZero())
2595 return getUMaxExpr(getSCEV(LHS), getSCEV(U->getOperand(2)));
2597 case ICmpInst::ICMP_EQ:
2598 // n == 0 ? 1 : n -> umax(n, 1)
2599 if (LHS == U->getOperand(2) &&
2600 isa<ConstantInt>(U->getOperand(1)) &&
2601 cast<ConstantInt>(U->getOperand(1))->isOne() &&
2602 isa<ConstantInt>(RHS) &&
2603 cast<ConstantInt>(RHS)->isZero())
2604 return getUMaxExpr(getSCEV(LHS), getSCEV(U->getOperand(1)));
2611 default: // We cannot analyze this expression.
2615 return getUnknown(V);
2620 //===----------------------------------------------------------------------===//
2621 // Iteration Count Computation Code
2624 /// getBackedgeTakenCount - If the specified loop has a predictable
2625 /// backedge-taken count, return it, otherwise return a SCEVCouldNotCompute
2626 /// object. The backedge-taken count is the number of times the loop header
2627 /// will be branched to from within the loop. This is one less than the
2628 /// trip count of the loop, since it doesn't count the first iteration,
2629 /// when the header is branched to from outside the loop.
2631 /// Note that it is not valid to call this method on a loop without a
2632 /// loop-invariant backedge-taken count (see
2633 /// hasLoopInvariantBackedgeTakenCount).
2635 SCEVHandle ScalarEvolution::getBackedgeTakenCount(const Loop *L) {
2636 return getBackedgeTakenInfo(L).Exact;
2639 /// getMaxBackedgeTakenCount - Similar to getBackedgeTakenCount, except
2640 /// return the least SCEV value that is known never to be less than the
2641 /// actual backedge taken count.
2642 SCEVHandle ScalarEvolution::getMaxBackedgeTakenCount(const Loop *L) {
2643 return getBackedgeTakenInfo(L).Max;
2646 const ScalarEvolution::BackedgeTakenInfo &
2647 ScalarEvolution::getBackedgeTakenInfo(const Loop *L) {
2648 // Initially insert a CouldNotCompute for this loop. If the insertion
2649 // succeeds, procede to actually compute a backedge-taken count and
2650 // update the value. The temporary CouldNotCompute value tells SCEV
2651 // code elsewhere that it shouldn't attempt to request a new
2652 // backedge-taken count, which could result in infinite recursion.
2653 std::pair<std::map<const Loop*, BackedgeTakenInfo>::iterator, bool> Pair =
2654 BackedgeTakenCounts.insert(std::make_pair(L, getCouldNotCompute()));
2656 BackedgeTakenInfo ItCount = ComputeBackedgeTakenCount(L);
2657 if (ItCount.Exact != CouldNotCompute) {
2658 assert(ItCount.Exact->isLoopInvariant(L) &&
2659 ItCount.Max->isLoopInvariant(L) &&
2660 "Computed trip count isn't loop invariant for loop!");
2661 ++NumTripCountsComputed;
2663 // Update the value in the map.
2664 Pair.first->second = ItCount;
2665 } else if (isa<PHINode>(L->getHeader()->begin())) {
2666 // Only count loops that have phi nodes as not being computable.
2667 ++NumTripCountsNotComputed;
2670 // Now that we know more about the trip count for this loop, forget any
2671 // existing SCEV values for PHI nodes in this loop since they are only
2672 // conservative estimates made without the benefit
2673 // of trip count information.
2674 if (ItCount.hasAnyInfo())
2677 return Pair.first->second;
2680 /// forgetLoopBackedgeTakenCount - This method should be called by the
2681 /// client when it has changed a loop in a way that may effect
2682 /// ScalarEvolution's ability to compute a trip count, or if the loop
2684 void ScalarEvolution::forgetLoopBackedgeTakenCount(const Loop *L) {
2685 BackedgeTakenCounts.erase(L);
2689 /// forgetLoopPHIs - Delete the memoized SCEVs associated with the
2690 /// PHI nodes in the given loop. This is used when the trip count of
2691 /// the loop may have changed.
2692 void ScalarEvolution::forgetLoopPHIs(const Loop *L) {
2693 BasicBlock *Header = L->getHeader();
2695 // Push all Loop-header PHIs onto the Worklist stack, except those
2696 // that are presently represented via a SCEVUnknown. SCEVUnknown for
2697 // a PHI either means that it has an unrecognized structure, or it's
2698 // a PHI that's in the progress of being computed by createNodeForPHI.
2699 // In the former case, additional loop trip count information isn't
2700 // going to change anything. In the later case, createNodeForPHI will
2701 // perform the necessary updates on its own when it gets to that point.
2702 SmallVector<Instruction *, 16> Worklist;
2703 for (BasicBlock::iterator I = Header->begin();
2704 PHINode *PN = dyn_cast<PHINode>(I); ++I) {
2705 std::map<SCEVCallbackVH, SCEVHandle>::iterator It = Scalars.find((Value*)I);
2706 if (It != Scalars.end() && !isa<SCEVUnknown>(It->second))
2707 Worklist.push_back(PN);
2710 while (!Worklist.empty()) {
2711 Instruction *I = Worklist.pop_back_val();
2712 if (Scalars.erase(I))
2713 for (Value::use_iterator UI = I->use_begin(), UE = I->use_end();
2715 Worklist.push_back(cast<Instruction>(UI));
2719 /// ComputeBackedgeTakenCount - Compute the number of times the backedge
2720 /// of the specified loop will execute.
2721 ScalarEvolution::BackedgeTakenInfo
2722 ScalarEvolution::ComputeBackedgeTakenCount(const Loop *L) {
2723 // If the loop has a non-one exit block count, we can't analyze it.
2724 BasicBlock *ExitBlock = L->getExitBlock();
2726 return CouldNotCompute;
2728 // Okay, there is one exit block. Try to find the condition that causes the
2729 // loop to be exited.
2730 BasicBlock *ExitingBlock = L->getExitingBlock();
2732 return CouldNotCompute; // More than one block exiting!
2734 // Okay, we've computed the exiting block. See what condition causes us to
2737 // FIXME: we should be able to handle switch instructions (with a single exit)
2738 BranchInst *ExitBr = dyn_cast<BranchInst>(ExitingBlock->getTerminator());
2739 if (ExitBr == 0) return CouldNotCompute;
2740 assert(ExitBr->isConditional() && "If unconditional, it can't be in loop!");
2742 // At this point, we know we have a conditional branch that determines whether
2743 // the loop is exited. However, we don't know if the branch is executed each
2744 // time through the loop. If not, then the execution count of the branch will
2745 // not be equal to the trip count of the loop.
2747 // Currently we check for this by checking to see if the Exit branch goes to
2748 // the loop header. If so, we know it will always execute the same number of
2749 // times as the loop. We also handle the case where the exit block *is* the
2750 // loop header. This is common for un-rotated loops. More extensive analysis
2751 // could be done to handle more cases here.
2752 if (ExitBr->getSuccessor(0) != L->getHeader() &&
2753 ExitBr->getSuccessor(1) != L->getHeader() &&
2754 ExitBr->getParent() != L->getHeader())
2755 return CouldNotCompute;
2757 ICmpInst *ExitCond = dyn_cast<ICmpInst>(ExitBr->getCondition());
2759 // If it's not an integer or pointer comparison then compute it the hard way.
2761 return ComputeBackedgeTakenCountExhaustively(L, ExitBr->getCondition(),
2762 ExitBr->getSuccessor(0) == ExitBlock);
2764 // If the condition was exit on true, convert the condition to exit on false
2765 ICmpInst::Predicate Cond;
2766 if (ExitBr->getSuccessor(1) == ExitBlock)
2767 Cond = ExitCond->getPredicate();
2769 Cond = ExitCond->getInversePredicate();
2771 // Handle common loops like: for (X = "string"; *X; ++X)
2772 if (LoadInst *LI = dyn_cast<LoadInst>(ExitCond->getOperand(0)))
2773 if (Constant *RHS = dyn_cast<Constant>(ExitCond->getOperand(1))) {
2775 ComputeLoadConstantCompareBackedgeTakenCount(LI, RHS, L, Cond);
2776 if (!isa<SCEVCouldNotCompute>(ItCnt)) return ItCnt;
2779 SCEVHandle LHS = getSCEV(ExitCond->getOperand(0));
2780 SCEVHandle RHS = getSCEV(ExitCond->getOperand(1));
2782 // Try to evaluate any dependencies out of the loop.
2783 LHS = getSCEVAtScope(LHS, L);
2784 RHS = getSCEVAtScope(RHS, L);
2786 // At this point, we would like to compute how many iterations of the
2787 // loop the predicate will return true for these inputs.
2788 if (LHS->isLoopInvariant(L) && !RHS->isLoopInvariant(L)) {
2789 // If there is a loop-invariant, force it into the RHS.
2790 std::swap(LHS, RHS);
2791 Cond = ICmpInst::getSwappedPredicate(Cond);
2794 // If we have a comparison of a chrec against a constant, try to use value
2795 // ranges to answer this query.
2796 if (const SCEVConstant *RHSC = dyn_cast<SCEVConstant>(RHS))
2797 if (const SCEVAddRecExpr *AddRec = dyn_cast<SCEVAddRecExpr>(LHS))
2798 if (AddRec->getLoop() == L) {
2799 // Form the constant range.
2800 ConstantRange CompRange(
2801 ICmpInst::makeConstantRange(Cond, RHSC->getValue()->getValue()));
2803 SCEVHandle Ret = AddRec->getNumIterationsInRange(CompRange, *this);
2804 if (!isa<SCEVCouldNotCompute>(Ret)) return Ret;
2808 case ICmpInst::ICMP_NE: { // while (X != Y)
2809 // Convert to: while (X-Y != 0)
2810 SCEVHandle TC = HowFarToZero(getMinusSCEV(LHS, RHS), L);
2811 if (!isa<SCEVCouldNotCompute>(TC)) return TC;
2814 case ICmpInst::ICMP_EQ: {
2815 // Convert to: while (X-Y == 0) // while (X == Y)
2816 SCEVHandle TC = HowFarToNonZero(getMinusSCEV(LHS, RHS), L);
2817 if (!isa<SCEVCouldNotCompute>(TC)) return TC;
2820 case ICmpInst::ICMP_SLT: {
2821 BackedgeTakenInfo BTI = HowManyLessThans(LHS, RHS, L, true);
2822 if (BTI.hasAnyInfo()) return BTI;
2825 case ICmpInst::ICMP_SGT: {
2826 BackedgeTakenInfo BTI = HowManyLessThans(getNotSCEV(LHS),
2827 getNotSCEV(RHS), L, true);
2828 if (BTI.hasAnyInfo()) return BTI;
2831 case ICmpInst::ICMP_ULT: {
2832 BackedgeTakenInfo BTI = HowManyLessThans(LHS, RHS, L, false);
2833 if (BTI.hasAnyInfo()) return BTI;
2836 case ICmpInst::ICMP_UGT: {
2837 BackedgeTakenInfo BTI = HowManyLessThans(getNotSCEV(LHS),
2838 getNotSCEV(RHS), L, false);
2839 if (BTI.hasAnyInfo()) return BTI;
2844 errs() << "ComputeBackedgeTakenCount ";
2845 if (ExitCond->getOperand(0)->getType()->isUnsigned())
2846 errs() << "[unsigned] ";
2847 errs() << *LHS << " "
2848 << Instruction::getOpcodeName(Instruction::ICmp)
2849 << " " << *RHS << "\n";
2854 ComputeBackedgeTakenCountExhaustively(L, ExitCond,
2855 ExitBr->getSuccessor(0) == ExitBlock);
2858 static ConstantInt *
2859 EvaluateConstantChrecAtConstant(const SCEVAddRecExpr *AddRec, ConstantInt *C,
2860 ScalarEvolution &SE) {
2861 SCEVHandle InVal = SE.getConstant(C);
2862 SCEVHandle Val = AddRec->evaluateAtIteration(InVal, SE);
2863 assert(isa<SCEVConstant>(Val) &&
2864 "Evaluation of SCEV at constant didn't fold correctly?");
2865 return cast<SCEVConstant>(Val)->getValue();
2868 /// GetAddressedElementFromGlobal - Given a global variable with an initializer
2869 /// and a GEP expression (missing the pointer index) indexing into it, return
2870 /// the addressed element of the initializer or null if the index expression is
2873 GetAddressedElementFromGlobal(GlobalVariable *GV,
2874 const std::vector<ConstantInt*> &Indices) {
2875 Constant *Init = GV->getInitializer();
2876 for (unsigned i = 0, e = Indices.size(); i != e; ++i) {
2877 uint64_t Idx = Indices[i]->getZExtValue();
2878 if (ConstantStruct *CS = dyn_cast<ConstantStruct>(Init)) {
2879 assert(Idx < CS->getNumOperands() && "Bad struct index!");
2880 Init = cast<Constant>(CS->getOperand(Idx));
2881 } else if (ConstantArray *CA = dyn_cast<ConstantArray>(Init)) {
2882 if (Idx >= CA->getNumOperands()) return 0; // Bogus program
2883 Init = cast<Constant>(CA->getOperand(Idx));
2884 } else if (isa<ConstantAggregateZero>(Init)) {
2885 if (const StructType *STy = dyn_cast<StructType>(Init->getType())) {
2886 assert(Idx < STy->getNumElements() && "Bad struct index!");
2887 Init = Constant::getNullValue(STy->getElementType(Idx));
2888 } else if (const ArrayType *ATy = dyn_cast<ArrayType>(Init->getType())) {
2889 if (Idx >= ATy->getNumElements()) return 0; // Bogus program
2890 Init = Constant::getNullValue(ATy->getElementType());
2892 assert(0 && "Unknown constant aggregate type!");
2896 return 0; // Unknown initializer type
2902 /// ComputeLoadConstantCompareBackedgeTakenCount - Given an exit condition of
2903 /// 'icmp op load X, cst', try to see if we can compute the backedge
2904 /// execution count.
2905 SCEVHandle ScalarEvolution::
2906 ComputeLoadConstantCompareBackedgeTakenCount(LoadInst *LI, Constant *RHS,
2908 ICmpInst::Predicate predicate) {
2909 if (LI->isVolatile()) return CouldNotCompute;
2911 // Check to see if the loaded pointer is a getelementptr of a global.
2912 GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(LI->getOperand(0));
2913 if (!GEP) return CouldNotCompute;
2915 // Make sure that it is really a constant global we are gepping, with an
2916 // initializer, and make sure the first IDX is really 0.
2917 GlobalVariable *GV = dyn_cast<GlobalVariable>(GEP->getOperand(0));
2918 if (!GV || !GV->isConstant() || !GV->hasInitializer() ||
2919 GEP->getNumOperands() < 3 || !isa<Constant>(GEP->getOperand(1)) ||
2920 !cast<Constant>(GEP->getOperand(1))->isNullValue())
2921 return CouldNotCompute;
2923 // Okay, we allow one non-constant index into the GEP instruction.
2925 std::vector<ConstantInt*> Indexes;
2926 unsigned VarIdxNum = 0;
2927 for (unsigned i = 2, e = GEP->getNumOperands(); i != e; ++i)
2928 if (ConstantInt *CI = dyn_cast<ConstantInt>(GEP->getOperand(i))) {
2929 Indexes.push_back(CI);
2930 } else if (!isa<ConstantInt>(GEP->getOperand(i))) {
2931 if (VarIdx) return CouldNotCompute; // Multiple non-constant idx's.
2932 VarIdx = GEP->getOperand(i);
2934 Indexes.push_back(0);
2937 // Okay, we know we have a (load (gep GV, 0, X)) comparison with a constant.
2938 // Check to see if X is a loop variant variable value now.
2939 SCEVHandle Idx = getSCEV(VarIdx);
2940 Idx = getSCEVAtScope(Idx, L);
2942 // We can only recognize very limited forms of loop index expressions, in
2943 // particular, only affine AddRec's like {C1,+,C2}.
2944 const SCEVAddRecExpr *IdxExpr = dyn_cast<SCEVAddRecExpr>(Idx);
2945 if (!IdxExpr || !IdxExpr->isAffine() || IdxExpr->isLoopInvariant(L) ||
2946 !isa<SCEVConstant>(IdxExpr->getOperand(0)) ||
2947 !isa<SCEVConstant>(IdxExpr->getOperand(1)))
2948 return CouldNotCompute;
2950 unsigned MaxSteps = MaxBruteForceIterations;
2951 for (unsigned IterationNum = 0; IterationNum != MaxSteps; ++IterationNum) {
2952 ConstantInt *ItCst =
2953 ConstantInt::get(cast<IntegerType>(IdxExpr->getType()), IterationNum);
2954 ConstantInt *Val = EvaluateConstantChrecAtConstant(IdxExpr, ItCst, *this);
2956 // Form the GEP offset.
2957 Indexes[VarIdxNum] = Val;
2959 Constant *Result = GetAddressedElementFromGlobal(GV, Indexes);
2960 if (Result == 0) break; // Cannot compute!
2962 // Evaluate the condition for this iteration.
2963 Result = ConstantExpr::getICmp(predicate, Result, RHS);
2964 if (!isa<ConstantInt>(Result)) break; // Couldn't decide for sure
2965 if (cast<ConstantInt>(Result)->getValue().isMinValue()) {
2967 errs() << "\n***\n*** Computed loop count " << *ItCst
2968 << "\n*** From global " << *GV << "*** BB: " << *L->getHeader()
2971 ++NumArrayLenItCounts;
2972 return getConstant(ItCst); // Found terminating iteration!
2975 return CouldNotCompute;
2979 /// CanConstantFold - Return true if we can constant fold an instruction of the
2980 /// specified type, assuming that all operands were constants.
2981 static bool CanConstantFold(const Instruction *I) {
2982 if (isa<BinaryOperator>(I) || isa<CmpInst>(I) ||
2983 isa<SelectInst>(I) || isa<CastInst>(I) || isa<GetElementPtrInst>(I))
2986 if (const CallInst *CI = dyn_cast<CallInst>(I))
2987 if (const Function *F = CI->getCalledFunction())
2988 return canConstantFoldCallTo(F);
2992 /// getConstantEvolvingPHI - Given an LLVM value and a loop, return a PHI node
2993 /// in the loop that V is derived from. We allow arbitrary operations along the
2994 /// way, but the operands of an operation must either be constants or a value
2995 /// derived from a constant PHI. If this expression does not fit with these
2996 /// constraints, return null.
2997 static PHINode *getConstantEvolvingPHI(Value *V, const Loop *L) {
2998 // If this is not an instruction, or if this is an instruction outside of the
2999 // loop, it can't be derived from a loop PHI.
3000 Instruction *I = dyn_cast<Instruction>(V);
3001 if (I == 0 || !L->contains(I->getParent())) return 0;
3003 if (PHINode *PN = dyn_cast<PHINode>(I)) {
3004 if (L->getHeader() == I->getParent())
3007 // We don't currently keep track of the control flow needed to evaluate
3008 // PHIs, so we cannot handle PHIs inside of loops.
3012 // If we won't be able to constant fold this expression even if the operands
3013 // are constants, return early.
3014 if (!CanConstantFold(I)) return 0;
3016 // Otherwise, we can evaluate this instruction if all of its operands are
3017 // constant or derived from a PHI node themselves.
3019 for (unsigned Op = 0, e = I->getNumOperands(); Op != e; ++Op)
3020 if (!(isa<Constant>(I->getOperand(Op)) ||
3021 isa<GlobalValue>(I->getOperand(Op)))) {
3022 PHINode *P = getConstantEvolvingPHI(I->getOperand(Op), L);
3023 if (P == 0) return 0; // Not evolving from PHI
3027 return 0; // Evolving from multiple different PHIs.
3030 // This is a expression evolving from a constant PHI!
3034 /// EvaluateExpression - Given an expression that passes the
3035 /// getConstantEvolvingPHI predicate, evaluate its value assuming the PHI node
3036 /// in the loop has the value PHIVal. If we can't fold this expression for some
3037 /// reason, return null.
3038 static Constant *EvaluateExpression(Value *V, Constant *PHIVal) {
3039 if (isa<PHINode>(V)) return PHIVal;
3040 if (Constant *C = dyn_cast<Constant>(V)) return C;
3041 if (GlobalValue *GV = dyn_cast<GlobalValue>(V)) return GV;
3042 Instruction *I = cast<Instruction>(V);
3044 std::vector<Constant*> Operands;
3045 Operands.resize(I->getNumOperands());
3047 for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i) {
3048 Operands[i] = EvaluateExpression(I->getOperand(i), PHIVal);
3049 if (Operands[i] == 0) return 0;
3052 if (const CmpInst *CI = dyn_cast<CmpInst>(I))
3053 return ConstantFoldCompareInstOperands(CI->getPredicate(),
3054 &Operands[0], Operands.size());
3056 return ConstantFoldInstOperands(I->getOpcode(), I->getType(),
3057 &Operands[0], Operands.size());
3060 /// getConstantEvolutionLoopExitValue - If we know that the specified Phi is
3061 /// in the header of its containing loop, we know the loop executes a
3062 /// constant number of times, and the PHI node is just a recurrence
3063 /// involving constants, fold it.
3064 Constant *ScalarEvolution::
3065 getConstantEvolutionLoopExitValue(PHINode *PN, const APInt& BEs, const Loop *L){
3066 std::map<PHINode*, Constant*>::iterator I =
3067 ConstantEvolutionLoopExitValue.find(PN);
3068 if (I != ConstantEvolutionLoopExitValue.end())
3071 if (BEs.ugt(APInt(BEs.getBitWidth(),MaxBruteForceIterations)))
3072 return ConstantEvolutionLoopExitValue[PN] = 0; // Not going to evaluate it.
3074 Constant *&RetVal = ConstantEvolutionLoopExitValue[PN];
3076 // Since the loop is canonicalized, the PHI node must have two entries. One
3077 // entry must be a constant (coming in from outside of the loop), and the
3078 // second must be derived from the same PHI.
3079 bool SecondIsBackedge = L->contains(PN->getIncomingBlock(1));
3080 Constant *StartCST =
3081 dyn_cast<Constant>(PN->getIncomingValue(!SecondIsBackedge));
3083 return RetVal = 0; // Must be a constant.
3085 Value *BEValue = PN->getIncomingValue(SecondIsBackedge);
3086 PHINode *PN2 = getConstantEvolvingPHI(BEValue, L);
3088 return RetVal = 0; // Not derived from same PHI.
3090 // Execute the loop symbolically to determine the exit value.
3091 if (BEs.getActiveBits() >= 32)
3092 return RetVal = 0; // More than 2^32-1 iterations?? Not doing it!
3094 unsigned NumIterations = BEs.getZExtValue(); // must be in range
3095 unsigned IterationNum = 0;
3096 for (Constant *PHIVal = StartCST; ; ++IterationNum) {
3097 if (IterationNum == NumIterations)
3098 return RetVal = PHIVal; // Got exit value!
3100 // Compute the value of the PHI node for the next iteration.
3101 Constant *NextPHI = EvaluateExpression(BEValue, PHIVal);
3102 if (NextPHI == PHIVal)
3103 return RetVal = NextPHI; // Stopped evolving!
3105 return 0; // Couldn't evaluate!
3110 /// ComputeBackedgeTakenCountExhaustively - If the trip is known to execute a
3111 /// constant number of times (the condition evolves only from constants),
3112 /// try to evaluate a few iterations of the loop until we get the exit
3113 /// condition gets a value of ExitWhen (true or false). If we cannot
3114 /// evaluate the trip count of the loop, return CouldNotCompute.
3115 SCEVHandle ScalarEvolution::
3116 ComputeBackedgeTakenCountExhaustively(const Loop *L, Value *Cond, bool ExitWhen) {
3117 PHINode *PN = getConstantEvolvingPHI(Cond, L);
3118 if (PN == 0) return CouldNotCompute;
3120 // Since the loop is canonicalized, the PHI node must have two entries. One
3121 // entry must be a constant (coming in from outside of the loop), and the
3122 // second must be derived from the same PHI.
3123 bool SecondIsBackedge = L->contains(PN->getIncomingBlock(1));
3124 Constant *StartCST =
3125 dyn_cast<Constant>(PN->getIncomingValue(!SecondIsBackedge));
3126 if (StartCST == 0) return CouldNotCompute; // Must be a constant.
3128 Value *BEValue = PN->getIncomingValue(SecondIsBackedge);
3129 PHINode *PN2 = getConstantEvolvingPHI(BEValue, L);
3130 if (PN2 != PN) return CouldNotCompute; // Not derived from same PHI.
3132 // Okay, we find a PHI node that defines the trip count of this loop. Execute
3133 // the loop symbolically to determine when the condition gets a value of
3135 unsigned IterationNum = 0;
3136 unsigned MaxIterations = MaxBruteForceIterations; // Limit analysis.
3137 for (Constant *PHIVal = StartCST;
3138 IterationNum != MaxIterations; ++IterationNum) {
3139 ConstantInt *CondVal =
3140 dyn_cast_or_null<ConstantInt>(EvaluateExpression(Cond, PHIVal));
3142 // Couldn't symbolically evaluate.
3143 if (!CondVal) return CouldNotCompute;
3145 if (CondVal->getValue() == uint64_t(ExitWhen)) {
3146 ConstantEvolutionLoopExitValue[PN] = PHIVal;
3147 ++NumBruteForceTripCountsComputed;
3148 return getConstant(Type::Int32Ty, IterationNum);
3151 // Compute the value of the PHI node for the next iteration.
3152 Constant *NextPHI = EvaluateExpression(BEValue, PHIVal);
3153 if (NextPHI == 0 || NextPHI == PHIVal)
3154 return CouldNotCompute; // Couldn't evaluate or not making progress...
3158 // Too many iterations were needed to evaluate.
3159 return CouldNotCompute;
3162 /// getSCEVAtScope - Return a SCEV expression handle for the specified value
3163 /// at the specified scope in the program. The L value specifies a loop
3164 /// nest to evaluate the expression at, where null is the top-level or a
3165 /// specified loop is immediately inside of the loop.
3167 /// This method can be used to compute the exit value for a variable defined
3168 /// in a loop by querying what the value will hold in the parent loop.
3170 /// In the case that a relevant loop exit value cannot be computed, the
3171 /// original value V is returned.
3172 SCEVHandle ScalarEvolution::getSCEVAtScope(const SCEV *V, const Loop *L) {
3173 // FIXME: this should be turned into a virtual method on SCEV!
3175 if (isa<SCEVConstant>(V)) return V;
3177 // If this instruction is evolved from a constant-evolving PHI, compute the
3178 // exit value from the loop without using SCEVs.
3179 if (const SCEVUnknown *SU = dyn_cast<SCEVUnknown>(V)) {
3180 if (Instruction *I = dyn_cast<Instruction>(SU->getValue())) {
3181 const Loop *LI = (*this->LI)[I->getParent()];
3182 if (LI && LI->getParentLoop() == L) // Looking for loop exit value.
3183 if (PHINode *PN = dyn_cast<PHINode>(I))
3184 if (PN->getParent() == LI->getHeader()) {
3185 // Okay, there is no closed form solution for the PHI node. Check
3186 // to see if the loop that contains it has a known backedge-taken
3187 // count. If so, we may be able to force computation of the exit
3189 SCEVHandle BackedgeTakenCount = getBackedgeTakenCount(LI);
3190 if (const SCEVConstant *BTCC =
3191 dyn_cast<SCEVConstant>(BackedgeTakenCount)) {
3192 // Okay, we know how many times the containing loop executes. If
3193 // this is a constant evolving PHI node, get the final value at
3194 // the specified iteration number.
3195 Constant *RV = getConstantEvolutionLoopExitValue(PN,
3196 BTCC->getValue()->getValue(),
3198 if (RV) return getUnknown(RV);
3202 // Okay, this is an expression that we cannot symbolically evaluate
3203 // into a SCEV. Check to see if it's possible to symbolically evaluate
3204 // the arguments into constants, and if so, try to constant propagate the
3205 // result. This is particularly useful for computing loop exit values.
3206 if (CanConstantFold(I)) {
3207 // Check to see if we've folded this instruction at this loop before.
3208 std::map<const Loop *, Constant *> &Values = ValuesAtScopes[I];
3209 std::pair<std::map<const Loop *, Constant *>::iterator, bool> Pair =
3210 Values.insert(std::make_pair(L, static_cast<Constant *>(0)));
3212 return Pair.first->second ? &*getUnknown(Pair.first->second) : V;
3214 std::vector<Constant*> Operands;
3215 Operands.reserve(I->getNumOperands());
3216 for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i) {
3217 Value *Op = I->getOperand(i);
3218 if (Constant *C = dyn_cast<Constant>(Op)) {
3219 Operands.push_back(C);
3221 // If any of the operands is non-constant and if they are
3222 // non-integer and non-pointer, don't even try to analyze them
3223 // with scev techniques.
3224 if (!isSCEVable(Op->getType()))
3227 SCEVHandle OpV = getSCEVAtScope(getSCEV(Op), L);
3228 if (const SCEVConstant *SC = dyn_cast<SCEVConstant>(OpV)) {
3229 Constant *C = SC->getValue();
3230 if (C->getType() != Op->getType())
3231 C = ConstantExpr::getCast(CastInst::getCastOpcode(C, false,
3235 Operands.push_back(C);
3236 } else if (const SCEVUnknown *SU = dyn_cast<SCEVUnknown>(OpV)) {
3237 if (Constant *C = dyn_cast<Constant>(SU->getValue())) {
3238 if (C->getType() != Op->getType())
3240 ConstantExpr::getCast(CastInst::getCastOpcode(C, false,
3244 Operands.push_back(C);
3254 if (const CmpInst *CI = dyn_cast<CmpInst>(I))
3255 C = ConstantFoldCompareInstOperands(CI->getPredicate(),
3256 &Operands[0], Operands.size());
3258 C = ConstantFoldInstOperands(I->getOpcode(), I->getType(),
3259 &Operands[0], Operands.size());
3260 Pair.first->second = C;
3261 return getUnknown(C);
3265 // This is some other type of SCEVUnknown, just return it.
3269 if (const SCEVCommutativeExpr *Comm = dyn_cast<SCEVCommutativeExpr>(V)) {
3270 // Avoid performing the look-up in the common case where the specified
3271 // expression has no loop-variant portions.
3272 for (unsigned i = 0, e = Comm->getNumOperands(); i != e; ++i) {
3273 SCEVHandle OpAtScope = getSCEVAtScope(Comm->getOperand(i), L);
3274 if (OpAtScope != Comm->getOperand(i)) {
3275 // Okay, at least one of these operands is loop variant but might be
3276 // foldable. Build a new instance of the folded commutative expression.
3277 SmallVector<SCEVHandle, 8> NewOps(Comm->op_begin(), Comm->op_begin()+i);
3278 NewOps.push_back(OpAtScope);
3280 for (++i; i != e; ++i) {
3281 OpAtScope = getSCEVAtScope(Comm->getOperand(i), L);
3282 NewOps.push_back(OpAtScope);
3284 if (isa<SCEVAddExpr>(Comm))
3285 return getAddExpr(NewOps);
3286 if (isa<SCEVMulExpr>(Comm))
3287 return getMulExpr(NewOps);
3288 if (isa<SCEVSMaxExpr>(Comm))
3289 return getSMaxExpr(NewOps);
3290 if (isa<SCEVUMaxExpr>(Comm))
3291 return getUMaxExpr(NewOps);
3292 assert(0 && "Unknown commutative SCEV type!");
3295 // If we got here, all operands are loop invariant.
3299 if (const SCEVUDivExpr *Div = dyn_cast<SCEVUDivExpr>(V)) {
3300 SCEVHandle LHS = getSCEVAtScope(Div->getLHS(), L);
3301 SCEVHandle RHS = getSCEVAtScope(Div->getRHS(), L);
3302 if (LHS == Div->getLHS() && RHS == Div->getRHS())
3303 return Div; // must be loop invariant
3304 return getUDivExpr(LHS, RHS);
3307 // If this is a loop recurrence for a loop that does not contain L, then we
3308 // are dealing with the final value computed by the loop.
3309 if (const SCEVAddRecExpr *AddRec = dyn_cast<SCEVAddRecExpr>(V)) {
3310 if (!L || !AddRec->getLoop()->contains(L->getHeader())) {
3311 // To evaluate this recurrence, we need to know how many times the AddRec
3312 // loop iterates. Compute this now.
3313 SCEVHandle BackedgeTakenCount = getBackedgeTakenCount(AddRec->getLoop());
3314 if (BackedgeTakenCount == CouldNotCompute) return AddRec;
3316 // Then, evaluate the AddRec.
3317 return AddRec->evaluateAtIteration(BackedgeTakenCount, *this);
3322 if (const SCEVZeroExtendExpr *Cast = dyn_cast<SCEVZeroExtendExpr>(V)) {
3323 SCEVHandle Op = getSCEVAtScope(Cast->getOperand(), L);
3324 if (Op == Cast->getOperand())
3325 return Cast; // must be loop invariant
3326 return getZeroExtendExpr(Op, Cast->getType());
3329 if (const SCEVSignExtendExpr *Cast = dyn_cast<SCEVSignExtendExpr>(V)) {
3330 SCEVHandle Op = getSCEVAtScope(Cast->getOperand(), L);
3331 if (Op == Cast->getOperand())
3332 return Cast; // must be loop invariant
3333 return getSignExtendExpr(Op, Cast->getType());
3336 if (const SCEVTruncateExpr *Cast = dyn_cast<SCEVTruncateExpr>(V)) {
3337 SCEVHandle Op = getSCEVAtScope(Cast->getOperand(), L);
3338 if (Op == Cast->getOperand())
3339 return Cast; // must be loop invariant
3340 return getTruncateExpr(Op, Cast->getType());
3343 assert(0 && "Unknown SCEV type!");
3347 /// getSCEVAtScope - This is a convenience function which does
3348 /// getSCEVAtScope(getSCEV(V), L).
3349 SCEVHandle ScalarEvolution::getSCEVAtScope(Value *V, const Loop *L) {
3350 return getSCEVAtScope(getSCEV(V), L);
3353 /// SolveLinEquationWithOverflow - Finds the minimum unsigned root of the
3354 /// following equation:
3356 /// A * X = B (mod N)
3358 /// where N = 2^BW and BW is the common bit width of A and B. The signedness of
3359 /// A and B isn't important.
3361 /// If the equation does not have a solution, SCEVCouldNotCompute is returned.
3362 static SCEVHandle SolveLinEquationWithOverflow(const APInt &A, const APInt &B,
3363 ScalarEvolution &SE) {
3364 uint32_t BW = A.getBitWidth();
3365 assert(BW == B.getBitWidth() && "Bit widths must be the same.");
3366 assert(A != 0 && "A must be non-zero.");
3370 // The gcd of A and N may have only one prime factor: 2. The number of
3371 // trailing zeros in A is its multiplicity
3372 uint32_t Mult2 = A.countTrailingZeros();
3375 // 2. Check if B is divisible by D.
3377 // B is divisible by D if and only if the multiplicity of prime factor 2 for B
3378 // is not less than multiplicity of this prime factor for D.
3379 if (B.countTrailingZeros() < Mult2)
3380 return SE.getCouldNotCompute();
3382 // 3. Compute I: the multiplicative inverse of (A / D) in arithmetic
3385 // (N / D) may need BW+1 bits in its representation. Hence, we'll use this
3386 // bit width during computations.
3387 APInt AD = A.lshr(Mult2).zext(BW + 1); // AD = A / D
3388 APInt Mod(BW + 1, 0);
3389 Mod.set(BW - Mult2); // Mod = N / D
3390 APInt I = AD.multiplicativeInverse(Mod);
3392 // 4. Compute the minimum unsigned root of the equation:
3393 // I * (B / D) mod (N / D)
3394 APInt Result = (I * B.lshr(Mult2).zext(BW + 1)).urem(Mod);
3396 // The result is guaranteed to be less than 2^BW so we may truncate it to BW
3398 return SE.getConstant(Result.trunc(BW));
3401 /// SolveQuadraticEquation - Find the roots of the quadratic equation for the
3402 /// given quadratic chrec {L,+,M,+,N}. This returns either the two roots (which
3403 /// might be the same) or two SCEVCouldNotCompute objects.
3405 static std::pair<SCEVHandle,SCEVHandle>
3406 SolveQuadraticEquation(const SCEVAddRecExpr *AddRec, ScalarEvolution &SE) {
3407 assert(AddRec->getNumOperands() == 3 && "This is not a quadratic chrec!");
3408 const SCEVConstant *LC = dyn_cast<SCEVConstant>(AddRec->getOperand(0));
3409 const SCEVConstant *MC = dyn_cast<SCEVConstant>(AddRec->getOperand(1));
3410 const SCEVConstant *NC = dyn_cast<SCEVConstant>(AddRec->getOperand(2));
3412 // We currently can only solve this if the coefficients are constants.
3413 if (!LC || !MC || !NC) {
3414 const SCEV *CNC = SE.getCouldNotCompute();
3415 return std::make_pair(CNC, CNC);
3418 uint32_t BitWidth = LC->getValue()->getValue().getBitWidth();
3419 const APInt &L = LC->getValue()->getValue();
3420 const APInt &M = MC->getValue()->getValue();
3421 const APInt &N = NC->getValue()->getValue();
3422 APInt Two(BitWidth, 2);
3423 APInt Four(BitWidth, 4);
3426 using namespace APIntOps;
3428 // Convert from chrec coefficients to polynomial coefficients AX^2+BX+C
3429 // The B coefficient is M-N/2
3433 // The A coefficient is N/2
3434 APInt A(N.sdiv(Two));
3436 // Compute the B^2-4ac term.
3439 SqrtTerm -= Four * (A * C);
3441 // Compute sqrt(B^2-4ac). This is guaranteed to be the nearest
3442 // integer value or else APInt::sqrt() will assert.
3443 APInt SqrtVal(SqrtTerm.sqrt());
3445 // Compute the two solutions for the quadratic formula.
3446 // The divisions must be performed as signed divisions.
3448 APInt TwoA( A << 1 );
3449 if (TwoA.isMinValue()) {
3450 const SCEV *CNC = SE.getCouldNotCompute();
3451 return std::make_pair(CNC, CNC);
3454 ConstantInt *Solution1 = ConstantInt::get((NegB + SqrtVal).sdiv(TwoA));
3455 ConstantInt *Solution2 = ConstantInt::get((NegB - SqrtVal).sdiv(TwoA));
3457 return std::make_pair(SE.getConstant(Solution1),
3458 SE.getConstant(Solution2));
3459 } // end APIntOps namespace
3462 /// HowFarToZero - Return the number of times a backedge comparing the specified
3463 /// value to zero will execute. If not computable, return CouldNotCompute.
3464 SCEVHandle ScalarEvolution::HowFarToZero(const SCEV *V, const Loop *L) {
3465 // If the value is a constant
3466 if (const SCEVConstant *C = dyn_cast<SCEVConstant>(V)) {
3467 // If the value is already zero, the branch will execute zero times.
3468 if (C->getValue()->isZero()) return C;
3469 return CouldNotCompute; // Otherwise it will loop infinitely.
3472 const SCEVAddRecExpr *AddRec = dyn_cast<SCEVAddRecExpr>(V);
3473 if (!AddRec || AddRec->getLoop() != L)
3474 return CouldNotCompute;
3476 if (AddRec->isAffine()) {
3477 // If this is an affine expression, the execution count of this branch is
3478 // the minimum unsigned root of the following equation:
3480 // Start + Step*N = 0 (mod 2^BW)
3484 // Step*N = -Start (mod 2^BW)
3486 // where BW is the common bit width of Start and Step.
3488 // Get the initial value for the loop.
3489 SCEVHandle Start = getSCEVAtScope(AddRec->getStart(), L->getParentLoop());
3490 SCEVHandle Step = getSCEVAtScope(AddRec->getOperand(1), L->getParentLoop());
3492 if (const SCEVConstant *StepC = dyn_cast<SCEVConstant>(Step)) {
3493 // For now we handle only constant steps.
3495 // First, handle unitary steps.
3496 if (StepC->getValue()->equalsInt(1)) // 1*N = -Start (mod 2^BW), so:
3497 return getNegativeSCEV(Start); // N = -Start (as unsigned)
3498 if (StepC->getValue()->isAllOnesValue()) // -1*N = -Start (mod 2^BW), so:
3499 return Start; // N = Start (as unsigned)
3501 // Then, try to solve the above equation provided that Start is constant.
3502 if (const SCEVConstant *StartC = dyn_cast<SCEVConstant>(Start))
3503 return SolveLinEquationWithOverflow(StepC->getValue()->getValue(),
3504 -StartC->getValue()->getValue(),
3507 } else if (AddRec->isQuadratic() && AddRec->getType()->isInteger()) {
3508 // If this is a quadratic (3-term) AddRec {L,+,M,+,N}, find the roots of
3509 // the quadratic equation to solve it.
3510 std::pair<SCEVHandle,SCEVHandle> Roots = SolveQuadraticEquation(AddRec,
3512 const SCEVConstant *R1 = dyn_cast<SCEVConstant>(Roots.first);
3513 const SCEVConstant *R2 = dyn_cast<SCEVConstant>(Roots.second);
3516 errs() << "HFTZ: " << *V << " - sol#1: " << *R1
3517 << " sol#2: " << *R2 << "\n";
3519 // Pick the smallest positive root value.
3520 if (ConstantInt *CB =
3521 dyn_cast<ConstantInt>(ConstantExpr::getICmp(ICmpInst::ICMP_ULT,
3522 R1->getValue(), R2->getValue()))) {
3523 if (CB->getZExtValue() == false)
3524 std::swap(R1, R2); // R1 is the minimum root now.
3526 // We can only use this value if the chrec ends up with an exact zero
3527 // value at this index. When solving for "X*X != 5", for example, we
3528 // should not accept a root of 2.
3529 SCEVHandle Val = AddRec->evaluateAtIteration(R1, *this);
3531 return R1; // We found a quadratic root!
3536 return CouldNotCompute;
3539 /// HowFarToNonZero - Return the number of times a backedge checking the
3540 /// specified value for nonzero will execute. If not computable, return
3542 SCEVHandle ScalarEvolution::HowFarToNonZero(const SCEV *V, const Loop *L) {
3543 // Loops that look like: while (X == 0) are very strange indeed. We don't
3544 // handle them yet except for the trivial case. This could be expanded in the
3545 // future as needed.
3547 // If the value is a constant, check to see if it is known to be non-zero
3548 // already. If so, the backedge will execute zero times.
3549 if (const SCEVConstant *C = dyn_cast<SCEVConstant>(V)) {
3550 if (!C->getValue()->isNullValue())
3551 return getIntegerSCEV(0, C->getType());
3552 return CouldNotCompute; // Otherwise it will loop infinitely.
3555 // We could implement others, but I really doubt anyone writes loops like
3556 // this, and if they did, they would already be constant folded.
3557 return CouldNotCompute;
3560 /// getLoopPredecessor - If the given loop's header has exactly one unique
3561 /// predecessor outside the loop, return it. Otherwise return null.
3563 BasicBlock *ScalarEvolution::getLoopPredecessor(const Loop *L) {
3564 BasicBlock *Header = L->getHeader();
3565 BasicBlock *Pred = 0;
3566 for (pred_iterator PI = pred_begin(Header), E = pred_end(Header);
3568 if (!L->contains(*PI)) {
3569 if (Pred && Pred != *PI) return 0; // Multiple predecessors.
3575 /// getPredecessorWithUniqueSuccessorForBB - Return a predecessor of BB
3576 /// (which may not be an immediate predecessor) which has exactly one
3577 /// successor from which BB is reachable, or null if no such block is
3581 ScalarEvolution::getPredecessorWithUniqueSuccessorForBB(BasicBlock *BB) {
3582 // If the block has a unique predecessor, then there is no path from the
3583 // predecessor to the block that does not go through the direct edge
3584 // from the predecessor to the block.
3585 if (BasicBlock *Pred = BB->getSinglePredecessor())
3588 // A loop's header is defined to be a block that dominates the loop.
3589 // If the header has a unique predecessor outside the loop, it must be
3590 // a block that has exactly one successor that can reach the loop.
3591 if (Loop *L = LI->getLoopFor(BB))
3592 return getLoopPredecessor(L);
3597 /// isLoopGuardedByCond - Test whether entry to the loop is protected by
3598 /// a conditional between LHS and RHS. This is used to help avoid max
3599 /// expressions in loop trip counts.
3600 bool ScalarEvolution::isLoopGuardedByCond(const Loop *L,
3601 ICmpInst::Predicate Pred,
3602 const SCEV *LHS, const SCEV *RHS) {
3603 // Interpret a null as meaning no loop, where there is obviously no guard
3604 // (interprocedural conditions notwithstanding).
3605 if (!L) return false;
3607 BasicBlock *Predecessor = getLoopPredecessor(L);
3608 BasicBlock *PredecessorDest = L->getHeader();
3610 // Starting at the loop predecessor, climb up the predecessor chain, as long
3611 // as there are predecessors that can be found that have unique successors
3612 // leading to the original header.
3614 PredecessorDest = Predecessor,
3615 Predecessor = getPredecessorWithUniqueSuccessorForBB(Predecessor)) {
3617 BranchInst *LoopEntryPredicate =
3618 dyn_cast<BranchInst>(Predecessor->getTerminator());
3619 if (!LoopEntryPredicate ||
3620 LoopEntryPredicate->isUnconditional())
3623 ICmpInst *ICI = dyn_cast<ICmpInst>(LoopEntryPredicate->getCondition());
3626 // Now that we found a conditional branch that dominates the loop, check to
3627 // see if it is the comparison we are looking for.
3628 Value *PreCondLHS = ICI->getOperand(0);
3629 Value *PreCondRHS = ICI->getOperand(1);
3630 ICmpInst::Predicate Cond;
3631 if (LoopEntryPredicate->getSuccessor(0) == PredecessorDest)
3632 Cond = ICI->getPredicate();
3634 Cond = ICI->getInversePredicate();
3637 ; // An exact match.
3638 else if (!ICmpInst::isTrueWhenEqual(Cond) && Pred == ICmpInst::ICMP_NE)
3639 ; // The actual condition is beyond sufficient.
3641 // Check a few special cases.
3643 case ICmpInst::ICMP_UGT:
3644 if (Pred == ICmpInst::ICMP_ULT) {
3645 std::swap(PreCondLHS, PreCondRHS);
3646 Cond = ICmpInst::ICMP_ULT;
3650 case ICmpInst::ICMP_SGT:
3651 if (Pred == ICmpInst::ICMP_SLT) {
3652 std::swap(PreCondLHS, PreCondRHS);
3653 Cond = ICmpInst::ICMP_SLT;
3657 case ICmpInst::ICMP_NE:
3658 // Expressions like (x >u 0) are often canonicalized to (x != 0),
3659 // so check for this case by checking if the NE is comparing against
3660 // a minimum or maximum constant.
3661 if (!ICmpInst::isTrueWhenEqual(Pred))
3662 if (ConstantInt *CI = dyn_cast<ConstantInt>(PreCondRHS)) {
3663 const APInt &A = CI->getValue();
3665 case ICmpInst::ICMP_SLT:
3666 if (A.isMaxSignedValue()) break;
3668 case ICmpInst::ICMP_SGT:
3669 if (A.isMinSignedValue()) break;
3671 case ICmpInst::ICMP_ULT:
3672 if (A.isMaxValue()) break;
3674 case ICmpInst::ICMP_UGT:
3675 if (A.isMinValue()) break;
3680 Cond = ICmpInst::ICMP_NE;
3681 // NE is symmetric but the original comparison may not be. Swap
3682 // the operands if necessary so that they match below.
3683 if (isa<SCEVConstant>(LHS))
3684 std::swap(PreCondLHS, PreCondRHS);
3689 // We weren't able to reconcile the condition.
3693 if (!PreCondLHS->getType()->isInteger()) continue;
3695 SCEVHandle PreCondLHSSCEV = getSCEV(PreCondLHS);
3696 SCEVHandle PreCondRHSSCEV = getSCEV(PreCondRHS);
3697 if ((LHS == PreCondLHSSCEV && RHS == PreCondRHSSCEV) ||
3698 (LHS == getNotSCEV(PreCondRHSSCEV) &&
3699 RHS == getNotSCEV(PreCondLHSSCEV)))
3706 /// HowManyLessThans - Return the number of times a backedge containing the
3707 /// specified less-than comparison will execute. If not computable, return
3708 /// CouldNotCompute.
3709 ScalarEvolution::BackedgeTakenInfo ScalarEvolution::
3710 HowManyLessThans(const SCEV *LHS, const SCEV *RHS,
3711 const Loop *L, bool isSigned) {
3712 // Only handle: "ADDREC < LoopInvariant".
3713 if (!RHS->isLoopInvariant(L)) return CouldNotCompute;
3715 const SCEVAddRecExpr *AddRec = dyn_cast<SCEVAddRecExpr>(LHS);
3716 if (!AddRec || AddRec->getLoop() != L)
3717 return CouldNotCompute;
3719 if (AddRec->isAffine()) {
3720 // FORNOW: We only support unit strides.
3721 unsigned BitWidth = getTypeSizeInBits(AddRec->getType());
3722 SCEVHandle Step = AddRec->getStepRecurrence(*this);
3723 SCEVHandle NegOne = getIntegerSCEV(-1, AddRec->getType());
3725 // TODO: handle non-constant strides.
3726 const SCEVConstant *CStep = dyn_cast<SCEVConstant>(Step);
3727 if (!CStep || CStep->isZero())
3728 return CouldNotCompute;
3729 if (CStep->isOne()) {
3730 // With unit stride, the iteration never steps past the limit value.
3731 } else if (CStep->getValue()->getValue().isStrictlyPositive()) {
3732 if (const SCEVConstant *CLimit = dyn_cast<SCEVConstant>(RHS)) {
3733 // Test whether a positive iteration iteration can step past the limit
3734 // value and past the maximum value for its type in a single step.
3736 APInt Max = APInt::getSignedMaxValue(BitWidth);
3737 if ((Max - CStep->getValue()->getValue())
3738 .slt(CLimit->getValue()->getValue()))
3739 return CouldNotCompute;
3741 APInt Max = APInt::getMaxValue(BitWidth);
3742 if ((Max - CStep->getValue()->getValue())
3743 .ult(CLimit->getValue()->getValue()))
3744 return CouldNotCompute;
3747 // TODO: handle non-constant limit values below.
3748 return CouldNotCompute;
3750 // TODO: handle negative strides below.
3751 return CouldNotCompute;
3753 // We know the LHS is of the form {n,+,s} and the RHS is some loop-invariant
3754 // m. So, we count the number of iterations in which {n,+,s} < m is true.
3755 // Note that we cannot simply return max(m-n,0)/s because it's not safe to
3756 // treat m-n as signed nor unsigned due to overflow possibility.
3758 // First, we get the value of the LHS in the first iteration: n
3759 SCEVHandle Start = AddRec->getOperand(0);
3761 // Determine the minimum constant start value.
3762 SCEVHandle MinStart = isa<SCEVConstant>(Start) ? Start :
3763 getConstant(isSigned ? APInt::getSignedMinValue(BitWidth) :
3764 APInt::getMinValue(BitWidth));
3766 // If we know that the condition is true in order to enter the loop,
3767 // then we know that it will run exactly (m-n)/s times. Otherwise, we
3768 // only know that it will execute (max(m,n)-n)/s times. In both cases,
3769 // the division must round up.
3770 SCEVHandle End = RHS;
3771 if (!isLoopGuardedByCond(L,
3772 isSigned ? ICmpInst::ICMP_SLT : ICmpInst::ICMP_ULT,
3773 getMinusSCEV(Start, Step), RHS))
3774 End = isSigned ? getSMaxExpr(RHS, Start)
3775 : getUMaxExpr(RHS, Start);
3777 // Determine the maximum constant end value.
3778 SCEVHandle MaxEnd = isa<SCEVConstant>(End) ? End :
3779 getConstant(isSigned ? APInt::getSignedMaxValue(BitWidth) :
3780 APInt::getMaxValue(BitWidth));
3782 // Finally, we subtract these two values and divide, rounding up, to get
3783 // the number of times the backedge is executed.
3784 SCEVHandle BECount = getUDivExpr(getAddExpr(getMinusSCEV(End, Start),
3785 getAddExpr(Step, NegOne)),
3788 // The maximum backedge count is similar, except using the minimum start
3789 // value and the maximum end value.
3790 SCEVHandle MaxBECount = getUDivExpr(getAddExpr(getMinusSCEV(MaxEnd,
3792 getAddExpr(Step, NegOne)),
3795 return BackedgeTakenInfo(BECount, MaxBECount);
3798 return CouldNotCompute;
3801 /// getNumIterationsInRange - Return the number of iterations of this loop that
3802 /// produce values in the specified constant range. Another way of looking at
3803 /// this is that it returns the first iteration number where the value is not in
3804 /// the condition, thus computing the exit count. If the iteration count can't
3805 /// be computed, an instance of SCEVCouldNotCompute is returned.
3806 SCEVHandle SCEVAddRecExpr::getNumIterationsInRange(ConstantRange Range,
3807 ScalarEvolution &SE) const {
3808 if (Range.isFullSet()) // Infinite loop.
3809 return SE.getCouldNotCompute();
3811 // If the start is a non-zero constant, shift the range to simplify things.
3812 if (const SCEVConstant *SC = dyn_cast<SCEVConstant>(getStart()))
3813 if (!SC->getValue()->isZero()) {
3814 SmallVector<SCEVHandle, 4> Operands(op_begin(), op_end());
3815 Operands[0] = SE.getIntegerSCEV(0, SC->getType());
3816 SCEVHandle Shifted = SE.getAddRecExpr(Operands, getLoop());
3817 if (const SCEVAddRecExpr *ShiftedAddRec =
3818 dyn_cast<SCEVAddRecExpr>(Shifted))
3819 return ShiftedAddRec->getNumIterationsInRange(
3820 Range.subtract(SC->getValue()->getValue()), SE);
3821 // This is strange and shouldn't happen.
3822 return SE.getCouldNotCompute();
3825 // The only time we can solve this is when we have all constant indices.
3826 // Otherwise, we cannot determine the overflow conditions.
3827 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
3828 if (!isa<SCEVConstant>(getOperand(i)))
3829 return SE.getCouldNotCompute();
3832 // Okay at this point we know that all elements of the chrec are constants and
3833 // that the start element is zero.
3835 // First check to see if the range contains zero. If not, the first
3837 unsigned BitWidth = SE.getTypeSizeInBits(getType());
3838 if (!Range.contains(APInt(BitWidth, 0)))
3839 return SE.getIntegerSCEV(0, getType());
3842 // If this is an affine expression then we have this situation:
3843 // Solve {0,+,A} in Range === Ax in Range
3845 // We know that zero is in the range. If A is positive then we know that
3846 // the upper value of the range must be the first possible exit value.
3847 // If A is negative then the lower of the range is the last possible loop
3848 // value. Also note that we already checked for a full range.
3849 APInt One(BitWidth,1);
3850 APInt A = cast<SCEVConstant>(getOperand(1))->getValue()->getValue();
3851 APInt End = A.sge(One) ? (Range.getUpper() - One) : Range.getLower();
3853 // The exit value should be (End+A)/A.
3854 APInt ExitVal = (End + A).udiv(A);
3855 ConstantInt *ExitValue = ConstantInt::get(ExitVal);
3857 // Evaluate at the exit value. If we really did fall out of the valid
3858 // range, then we computed our trip count, otherwise wrap around or other
3859 // things must have happened.
3860 ConstantInt *Val = EvaluateConstantChrecAtConstant(this, ExitValue, SE);
3861 if (Range.contains(Val->getValue()))
3862 return SE.getCouldNotCompute(); // Something strange happened
3864 // Ensure that the previous value is in the range. This is a sanity check.
3865 assert(Range.contains(
3866 EvaluateConstantChrecAtConstant(this,
3867 ConstantInt::get(ExitVal - One), SE)->getValue()) &&
3868 "Linear scev computation is off in a bad way!");
3869 return SE.getConstant(ExitValue);
3870 } else if (isQuadratic()) {
3871 // If this is a quadratic (3-term) AddRec {L,+,M,+,N}, find the roots of the
3872 // quadratic equation to solve it. To do this, we must frame our problem in
3873 // terms of figuring out when zero is crossed, instead of when
3874 // Range.getUpper() is crossed.
3875 SmallVector<SCEVHandle, 4> NewOps(op_begin(), op_end());
3876 NewOps[0] = SE.getNegativeSCEV(SE.getConstant(Range.getUpper()));
3877 SCEVHandle NewAddRec = SE.getAddRecExpr(NewOps, getLoop());
3879 // Next, solve the constructed addrec
3880 std::pair<SCEVHandle,SCEVHandle> Roots =
3881 SolveQuadraticEquation(cast<SCEVAddRecExpr>(NewAddRec), SE);
3882 const SCEVConstant *R1 = dyn_cast<SCEVConstant>(Roots.first);
3883 const SCEVConstant *R2 = dyn_cast<SCEVConstant>(Roots.second);
3885 // Pick the smallest positive root value.
3886 if (ConstantInt *CB =
3887 dyn_cast<ConstantInt>(ConstantExpr::getICmp(ICmpInst::ICMP_ULT,
3888 R1->getValue(), R2->getValue()))) {
3889 if (CB->getZExtValue() == false)
3890 std::swap(R1, R2); // R1 is the minimum root now.
3892 // Make sure the root is not off by one. The returned iteration should
3893 // not be in the range, but the previous one should be. When solving
3894 // for "X*X < 5", for example, we should not return a root of 2.
3895 ConstantInt *R1Val = EvaluateConstantChrecAtConstant(this,
3898 if (Range.contains(R1Val->getValue())) {
3899 // The next iteration must be out of the range...
3900 ConstantInt *NextVal = ConstantInt::get(R1->getValue()->getValue()+1);
3902 R1Val = EvaluateConstantChrecAtConstant(this, NextVal, SE);
3903 if (!Range.contains(R1Val->getValue()))
3904 return SE.getConstant(NextVal);
3905 return SE.getCouldNotCompute(); // Something strange happened
3908 // If R1 was not in the range, then it is a good return value. Make
3909 // sure that R1-1 WAS in the range though, just in case.
3910 ConstantInt *NextVal = ConstantInt::get(R1->getValue()->getValue()-1);
3911 R1Val = EvaluateConstantChrecAtConstant(this, NextVal, SE);
3912 if (Range.contains(R1Val->getValue()))
3914 return SE.getCouldNotCompute(); // Something strange happened
3919 return SE.getCouldNotCompute();
3924 //===----------------------------------------------------------------------===//
3925 // SCEVCallbackVH Class Implementation
3926 //===----------------------------------------------------------------------===//
3928 void ScalarEvolution::SCEVCallbackVH::deleted() {
3929 assert(SE && "SCEVCallbackVH called with a non-null ScalarEvolution!");
3930 if (PHINode *PN = dyn_cast<PHINode>(getValPtr()))
3931 SE->ConstantEvolutionLoopExitValue.erase(PN);
3932 if (Instruction *I = dyn_cast<Instruction>(getValPtr()))
3933 SE->ValuesAtScopes.erase(I);
3934 SE->Scalars.erase(getValPtr());
3935 // this now dangles!
3938 void ScalarEvolution::SCEVCallbackVH::allUsesReplacedWith(Value *) {
3939 assert(SE && "SCEVCallbackVH called with a non-null ScalarEvolution!");
3941 // Forget all the expressions associated with users of the old value,
3942 // so that future queries will recompute the expressions using the new
3944 SmallVector<User *, 16> Worklist;
3945 Value *Old = getValPtr();
3946 bool DeleteOld = false;
3947 for (Value::use_iterator UI = Old->use_begin(), UE = Old->use_end();
3949 Worklist.push_back(*UI);
3950 while (!Worklist.empty()) {
3951 User *U = Worklist.pop_back_val();
3952 // Deleting the Old value will cause this to dangle. Postpone
3953 // that until everything else is done.
3958 if (PHINode *PN = dyn_cast<PHINode>(U))
3959 SE->ConstantEvolutionLoopExitValue.erase(PN);
3960 if (Instruction *I = dyn_cast<Instruction>(U))
3961 SE->ValuesAtScopes.erase(I);
3962 if (SE->Scalars.erase(U))
3963 for (Value::use_iterator UI = U->use_begin(), UE = U->use_end();
3965 Worklist.push_back(*UI);
3968 if (PHINode *PN = dyn_cast<PHINode>(Old))
3969 SE->ConstantEvolutionLoopExitValue.erase(PN);
3970 if (Instruction *I = dyn_cast<Instruction>(Old))
3971 SE->ValuesAtScopes.erase(I);
3972 SE->Scalars.erase(Old);
3973 // this now dangles!
3978 ScalarEvolution::SCEVCallbackVH::SCEVCallbackVH(Value *V, ScalarEvolution *se)
3979 : CallbackVH(V), SE(se) {}
3981 //===----------------------------------------------------------------------===//
3982 // ScalarEvolution Class Implementation
3983 //===----------------------------------------------------------------------===//
3985 ScalarEvolution::ScalarEvolution()
3986 : FunctionPass(&ID), CouldNotCompute(new SCEVCouldNotCompute(0)) {
3989 bool ScalarEvolution::runOnFunction(Function &F) {
3991 LI = &getAnalysis<LoopInfo>();
3992 TD = getAnalysisIfAvailable<TargetData>();
3996 void ScalarEvolution::releaseMemory() {
3998 BackedgeTakenCounts.clear();
3999 ConstantEvolutionLoopExitValue.clear();
4000 ValuesAtScopes.clear();
4003 void ScalarEvolution::getAnalysisUsage(AnalysisUsage &AU) const {
4004 AU.setPreservesAll();
4005 AU.addRequiredTransitive<LoopInfo>();
4008 bool ScalarEvolution::hasLoopInvariantBackedgeTakenCount(const Loop *L) {
4009 return !isa<SCEVCouldNotCompute>(getBackedgeTakenCount(L));
4012 static void PrintLoopInfo(raw_ostream &OS, ScalarEvolution *SE,
4014 // Print all inner loops first
4015 for (Loop::iterator I = L->begin(), E = L->end(); I != E; ++I)
4016 PrintLoopInfo(OS, SE, *I);
4018 OS << "Loop " << L->getHeader()->getName() << ": ";
4020 SmallVector<BasicBlock*, 8> ExitBlocks;
4021 L->getExitBlocks(ExitBlocks);
4022 if (ExitBlocks.size() != 1)
4023 OS << "<multiple exits> ";
4025 if (SE->hasLoopInvariantBackedgeTakenCount(L)) {
4026 OS << "backedge-taken count is " << *SE->getBackedgeTakenCount(L);
4028 OS << "Unpredictable backedge-taken count. ";
4034 void ScalarEvolution::print(raw_ostream &OS, const Module* ) const {
4035 // ScalarEvolution's implementaiton of the print method is to print
4036 // out SCEV values of all instructions that are interesting. Doing
4037 // this potentially causes it to create new SCEV objects though,
4038 // which technically conflicts with the const qualifier. This isn't
4039 // observable from outside the class though (the hasSCEV function
4040 // notwithstanding), so casting away the const isn't dangerous.
4041 ScalarEvolution &SE = *const_cast<ScalarEvolution*>(this);
4043 OS << "Classifying expressions for: " << F->getName() << "\n";
4044 for (inst_iterator I = inst_begin(F), E = inst_end(F); I != E; ++I)
4045 if (isSCEVable(I->getType())) {
4048 SCEVHandle SV = SE.getSCEV(&*I);
4051 const Loop *L = LI->getLoopFor((*I).getParent());
4053 SCEVHandle AtUse = SE.getSCEVAtScope(SV, L);
4060 OS << "\t\t" "Exits: ";
4061 SCEVHandle ExitValue = SE.getSCEVAtScope(SV, L->getParentLoop());
4062 if (!ExitValue->isLoopInvariant(L)) {
4063 OS << "<<Unknown>>";
4072 OS << "Determining loop execution counts for: " << F->getName() << "\n";
4073 for (LoopInfo::iterator I = LI->begin(), E = LI->end(); I != E; ++I)
4074 PrintLoopInfo(OS, &SE, *I);
4077 void ScalarEvolution::print(std::ostream &o, const Module *M) const {
4078 raw_os_ostream OS(o);