1 //===- llvm/Analysis/ScalarEvolution.h - Scalar Evolution -------*- 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 // The ScalarEvolution class is an LLVM pass which can be used to analyze and
11 // categorize scalar expressions in loops. It specializes in recognizing
12 // general induction variables, representing them with the abstract and opaque
13 // SCEV class. Given this analysis, trip counts of loops and other important
14 // properties can be obtained.
16 // This analysis is primarily useful for induction variable substitution and
17 // strength reduction.
19 //===----------------------------------------------------------------------===//
21 #ifndef LLVM_ANALYSIS_SCALAREVOLUTION_H
22 #define LLVM_ANALYSIS_SCALAREVOLUTION_H
24 #include "llvm/ADT/DenseSet.h"
25 #include "llvm/ADT/FoldingSet.h"
26 #include "llvm/IR/Function.h"
27 #include "llvm/IR/Instructions.h"
28 #include "llvm/IR/Operator.h"
29 #include "llvm/Pass.h"
30 #include "llvm/Support/Allocator.h"
31 #include "llvm/Support/ConstantRange.h"
32 #include "llvm/Support/DataTypes.h"
33 #include "llvm/Support/ValueHandle.h"
42 class ScalarEvolution;
44 class TargetLibraryInfo;
51 template<> struct FoldingSetTrait<SCEV>;
53 /// SCEV - This class represents an analyzed expression in the program. These
54 /// are opaque objects that the client is not allowed to do much with
57 class SCEV : public FoldingSetNode {
58 friend struct FoldingSetTrait<SCEV>;
60 /// FastID - A reference to an Interned FoldingSetNodeID for this node.
61 /// The ScalarEvolution's BumpPtrAllocator holds the data.
62 FoldingSetNodeIDRef FastID;
64 // The SCEV baseclass this node corresponds to
65 const unsigned short SCEVType;
68 /// SubclassData - This field is initialized to zero and may be used in
69 /// subclasses to store miscellaneous information.
70 unsigned short SubclassData;
73 SCEV(const SCEV &) LLVM_DELETED_FUNCTION;
74 void operator=(const SCEV &) LLVM_DELETED_FUNCTION;
77 /// NoWrapFlags are bitfield indices into SubclassData.
79 /// Add and Mul expressions may have no-unsigned-wrap <NUW> or
80 /// no-signed-wrap <NSW> properties, which are derived from the IR
81 /// operator. NSW is a misnomer that we use to mean no signed overflow or
84 /// AddRec expression may have a no-self-wraparound <NW> property if the
85 /// result can never reach the start value. This property is independent of
86 /// the actual start value and step direction. Self-wraparound is defined
87 /// purely in terms of the recurrence's loop, step size, and
88 /// bitwidth. Formally, a recurrence with no self-wraparound satisfies:
89 /// abs(step) * max-iteration(loop) <= unsigned-max(bitwidth).
91 /// Note that NUW and NSW are also valid properties of a recurrence, and
92 /// either implies NW. For convenience, NW will be set for a recurrence
93 /// whenever either NUW or NSW are set.
94 enum NoWrapFlags { FlagAnyWrap = 0, // No guarantee.
95 FlagNW = (1 << 0), // No self-wrap.
96 FlagNUW = (1 << 1), // No unsigned wrap.
97 FlagNSW = (1 << 2), // No signed wrap.
98 NoWrapMask = (1 << 3) -1 };
100 explicit SCEV(const FoldingSetNodeIDRef ID, unsigned SCEVTy) :
101 FastID(ID), SCEVType(SCEVTy), SubclassData(0) {}
103 unsigned getSCEVType() const { return SCEVType; }
105 /// getType - Return the LLVM type of this SCEV expression.
107 Type *getType() const;
109 /// isZero - Return true if the expression is a constant zero.
113 /// isOne - Return true if the expression is a constant one.
117 /// isAllOnesValue - Return true if the expression is a constant
120 bool isAllOnesValue() const;
122 /// isNonConstantNegative - Return true if the specified scev is negated,
123 /// but not a constant.
124 bool isNonConstantNegative() const;
126 /// print - Print out the internal representation of this scalar to the
127 /// specified stream. This should really only be used for debugging
129 void print(raw_ostream &OS) const;
131 /// dump - This method is used for debugging.
136 // Specialize FoldingSetTrait for SCEV to avoid needing to compute
137 // temporary FoldingSetNodeID values.
138 template<> struct FoldingSetTrait<SCEV> : DefaultFoldingSetTrait<SCEV> {
139 static void Profile(const SCEV &X, FoldingSetNodeID& ID) {
142 static bool Equals(const SCEV &X, const FoldingSetNodeID &ID,
143 unsigned IDHash, FoldingSetNodeID &TempID) {
144 return ID == X.FastID;
146 static unsigned ComputeHash(const SCEV &X, FoldingSetNodeID &TempID) {
147 return X.FastID.ComputeHash();
151 inline raw_ostream &operator<<(raw_ostream &OS, const SCEV &S) {
156 /// SCEVCouldNotCompute - An object of this class is returned by queries that
157 /// could not be answered. For example, if you ask for the number of
158 /// iterations of a linked-list traversal loop, you will get one of these.
159 /// None of the standard SCEV operations are valid on this class, it is just a
161 struct SCEVCouldNotCompute : public SCEV {
162 SCEVCouldNotCompute();
164 /// Methods for support type inquiry through isa, cast, and dyn_cast:
165 static bool classof(const SCEV *S);
168 /// ScalarEvolution - This class is the main scalar evolution driver. Because
169 /// client code (intentionally) can't do much with the SCEV objects directly,
170 /// they must ask this class for services.
172 class ScalarEvolution : public FunctionPass {
174 /// LoopDisposition - An enum describing the relationship between a
176 enum LoopDisposition {
177 LoopVariant, ///< The SCEV is loop-variant (unknown).
178 LoopInvariant, ///< The SCEV is loop-invariant.
179 LoopComputable ///< The SCEV varies predictably with the loop.
182 /// BlockDisposition - An enum describing the relationship between a
183 /// SCEV and a basic block.
184 enum BlockDisposition {
185 DoesNotDominateBlock, ///< The SCEV does not dominate the block.
186 DominatesBlock, ///< The SCEV dominates the block.
187 ProperlyDominatesBlock ///< The SCEV properly dominates the block.
190 /// Convenient NoWrapFlags manipulation that hides enum casts and is
191 /// visible in the ScalarEvolution name space.
192 static SCEV::NoWrapFlags maskFlags(SCEV::NoWrapFlags Flags, int Mask) {
193 return (SCEV::NoWrapFlags)(Flags & Mask);
195 static SCEV::NoWrapFlags setFlags(SCEV::NoWrapFlags Flags,
196 SCEV::NoWrapFlags OnFlags) {
197 return (SCEV::NoWrapFlags)(Flags | OnFlags);
199 static SCEV::NoWrapFlags clearFlags(SCEV::NoWrapFlags Flags,
200 SCEV::NoWrapFlags OffFlags) {
201 return (SCEV::NoWrapFlags)(Flags & ~OffFlags);
205 /// SCEVCallbackVH - A CallbackVH to arrange for ScalarEvolution to be
206 /// notified whenever a Value is deleted.
207 class SCEVCallbackVH : public CallbackVH {
209 virtual void deleted();
210 virtual void allUsesReplacedWith(Value *New);
212 SCEVCallbackVH(Value *V, ScalarEvolution *SE = 0);
215 friend class SCEVCallbackVH;
216 friend class SCEVExpander;
217 friend class SCEVUnknown;
219 /// F - The function we are analyzing.
223 /// LI - The loop information for the function we are currently analyzing.
227 /// TD - The target data information for the target we are targeting.
231 /// TLI - The target library information for the target we are targeting.
233 TargetLibraryInfo *TLI;
235 /// DT - The dominator tree.
239 /// CouldNotCompute - This SCEV is used to represent unknown trip
240 /// counts and things.
241 SCEVCouldNotCompute CouldNotCompute;
243 /// ValueExprMapType - The typedef for ValueExprMap.
245 typedef DenseMap<SCEVCallbackVH, const SCEV *, DenseMapInfo<Value *> >
248 /// ValueExprMap - This is a cache of the values we have analyzed so far.
250 ValueExprMapType ValueExprMap;
252 /// Mark predicate values currently being processed by isImpliedCond.
253 DenseSet<Value*> PendingLoopPredicates;
255 /// ExitLimit - Information about the number of loop iterations for
256 /// which a loop exit's branch condition evaluates to the not-taken path.
257 /// This is a temporary pair of exact and max expressions that are
258 /// eventually summarized in ExitNotTakenInfo and BackedgeTakenInfo.
263 /*implicit*/ ExitLimit(const SCEV *E) : Exact(E), Max(E) {}
265 ExitLimit(const SCEV *E, const SCEV *M) : Exact(E), Max(M) {}
267 /// hasAnyInfo - Test whether this ExitLimit contains any computed
268 /// information, or whether it's all SCEVCouldNotCompute values.
269 bool hasAnyInfo() const {
270 return !isa<SCEVCouldNotCompute>(Exact) ||
271 !isa<SCEVCouldNotCompute>(Max);
275 /// ExitNotTakenInfo - Information about the number of times a particular
276 /// loop exit may be reached before exiting the loop.
277 struct ExitNotTakenInfo {
278 AssertingVH<BasicBlock> ExitingBlock;
279 const SCEV *ExactNotTaken;
280 PointerIntPair<ExitNotTakenInfo*, 1> NextExit;
282 ExitNotTakenInfo() : ExitingBlock(0), ExactNotTaken(0) {}
284 /// isCompleteList - Return true if all loop exits are computable.
285 bool isCompleteList() const {
286 return NextExit.getInt() == 0;
289 void setIncomplete() { NextExit.setInt(1); }
291 /// getNextExit - Return a pointer to the next exit's not-taken info.
292 ExitNotTakenInfo *getNextExit() const {
293 return NextExit.getPointer();
296 void setNextExit(ExitNotTakenInfo *ENT) { NextExit.setPointer(ENT); }
299 /// BackedgeTakenInfo - Information about the backedge-taken count
300 /// of a loop. This currently includes an exact count and a maximum count.
302 class BackedgeTakenInfo {
303 /// ExitNotTaken - A list of computable exits and their not-taken counts.
304 /// Loops almost never have more than one computable exit.
305 ExitNotTakenInfo ExitNotTaken;
307 /// Max - An expression indicating the least maximum backedge-taken
308 /// count of the loop that is known, or a SCEVCouldNotCompute.
312 BackedgeTakenInfo() : Max(0) {}
314 /// Initialize BackedgeTakenInfo from a list of exact exit counts.
316 SmallVectorImpl< std::pair<BasicBlock *, const SCEV *> > &ExitCounts,
317 bool Complete, const SCEV *MaxCount);
319 /// hasAnyInfo - Test whether this BackedgeTakenInfo contains any
320 /// computed information, or whether it's all SCEVCouldNotCompute
322 bool hasAnyInfo() const {
323 return ExitNotTaken.ExitingBlock || !isa<SCEVCouldNotCompute>(Max);
326 /// getExact - Return an expression indicating the exact backedge-taken
327 /// count of the loop if it is known, or SCEVCouldNotCompute
328 /// otherwise. This is the number of times the loop header can be
329 /// guaranteed to execute, minus one.
330 const SCEV *getExact(ScalarEvolution *SE) const;
332 /// getExact - Return the number of times this loop exit may fall through
333 /// to the back edge, or SCEVCouldNotCompute. The loop is guaranteed not
334 /// to exit via this block before this number of iterations, but may exit
335 /// via another block.
336 const SCEV *getExact(BasicBlock *ExitingBlock, ScalarEvolution *SE) const;
338 /// getMax - Get the max backedge taken count for the loop.
339 const SCEV *getMax(ScalarEvolution *SE) const;
341 /// Return true if any backedge taken count expressions refer to the given
343 bool hasOperand(const SCEV *S, ScalarEvolution *SE) const;
345 /// clear - Invalidate this result and free associated memory.
349 /// BackedgeTakenCounts - Cache the backedge-taken count of the loops for
350 /// this function as they are computed.
351 DenseMap<const Loop*, BackedgeTakenInfo> BackedgeTakenCounts;
353 /// ConstantEvolutionLoopExitValue - This map contains entries for all of
354 /// the PHI instructions that we attempt to compute constant evolutions for.
355 /// This allows us to avoid potentially expensive recomputation of these
356 /// properties. An instruction maps to null if we are unable to compute its
358 DenseMap<PHINode*, Constant*> ConstantEvolutionLoopExitValue;
360 /// ValuesAtScopes - This map contains entries for all the expressions
361 /// that we attempt to compute getSCEVAtScope information for, which can
362 /// be expensive in extreme cases.
363 DenseMap<const SCEV *,
364 std::map<const Loop *, const SCEV *> > ValuesAtScopes;
366 /// LoopDispositions - Memoized computeLoopDisposition results.
367 DenseMap<const SCEV *,
368 std::map<const Loop *, LoopDisposition> > LoopDispositions;
370 /// computeLoopDisposition - Compute a LoopDisposition value.
371 LoopDisposition computeLoopDisposition(const SCEV *S, const Loop *L);
373 /// BlockDispositions - Memoized computeBlockDisposition results.
374 DenseMap<const SCEV *,
375 std::map<const BasicBlock *, BlockDisposition> > BlockDispositions;
377 /// computeBlockDisposition - Compute a BlockDisposition value.
378 BlockDisposition computeBlockDisposition(const SCEV *S, const BasicBlock *BB);
380 /// UnsignedRanges - Memoized results from getUnsignedRange
381 DenseMap<const SCEV *, ConstantRange> UnsignedRanges;
383 /// SignedRanges - Memoized results from getSignedRange
384 DenseMap<const SCEV *, ConstantRange> SignedRanges;
386 /// setUnsignedRange - Set the memoized unsigned range for the given SCEV.
387 const ConstantRange &setUnsignedRange(const SCEV *S,
388 const ConstantRange &CR) {
389 std::pair<DenseMap<const SCEV *, ConstantRange>::iterator, bool> Pair =
390 UnsignedRanges.insert(std::make_pair(S, CR));
392 Pair.first->second = CR;
393 return Pair.first->second;
396 /// setUnsignedRange - Set the memoized signed range for the given SCEV.
397 const ConstantRange &setSignedRange(const SCEV *S,
398 const ConstantRange &CR) {
399 std::pair<DenseMap<const SCEV *, ConstantRange>::iterator, bool> Pair =
400 SignedRanges.insert(std::make_pair(S, CR));
402 Pair.first->second = CR;
403 return Pair.first->second;
406 /// createSCEV - We know that there is no SCEV for the specified value.
407 /// Analyze the expression.
408 const SCEV *createSCEV(Value *V);
410 /// createNodeForPHI - Provide the special handling we need to analyze PHI
412 const SCEV *createNodeForPHI(PHINode *PN);
414 /// createNodeForGEP - Provide the special handling we need to analyze GEP
416 const SCEV *createNodeForGEP(GEPOperator *GEP);
418 /// computeSCEVAtScope - Implementation code for getSCEVAtScope; called
419 /// at most once for each SCEV+Loop pair.
421 const SCEV *computeSCEVAtScope(const SCEV *S, const Loop *L);
423 /// ForgetSymbolicValue - This looks up computed SCEV values for all
424 /// instructions that depend on the given instruction and removes them from
425 /// the ValueExprMap map if they reference SymName. This is used during PHI
427 void ForgetSymbolicName(Instruction *I, const SCEV *SymName);
429 /// getBECount - Subtract the end and start values and divide by the step,
430 /// rounding up, to get the number of times the backedge is executed. Return
431 /// CouldNotCompute if an intermediate computation overflows.
432 const SCEV *getBECount(const SCEV *Start,
437 /// getBackedgeTakenInfo - Return the BackedgeTakenInfo for the given
438 /// loop, lazily computing new values if the loop hasn't been analyzed
440 const BackedgeTakenInfo &getBackedgeTakenInfo(const Loop *L);
442 /// ComputeBackedgeTakenCount - Compute the number of times the specified
443 /// loop will iterate.
444 BackedgeTakenInfo ComputeBackedgeTakenCount(const Loop *L);
446 /// ComputeExitLimit - Compute the number of times the backedge of the
447 /// specified loop will execute if it exits via the specified block.
448 ExitLimit ComputeExitLimit(const Loop *L, BasicBlock *ExitingBlock);
450 /// ComputeExitLimitFromCond - Compute the number of times the backedge of
451 /// the specified loop will execute if its exit condition were a conditional
452 /// branch of ExitCond, TBB, and FBB.
453 ExitLimit ComputeExitLimitFromCond(const Loop *L,
459 /// ComputeExitLimitFromICmp - Compute the number of times the backedge of
460 /// the specified loop will execute if its exit condition were a conditional
461 /// branch of the ICmpInst ExitCond, TBB, and FBB.
462 ExitLimit ComputeExitLimitFromICmp(const Loop *L,
468 /// ComputeLoadConstantCompareExitLimit - Given an exit condition
469 /// of 'icmp op load X, cst', try to see if we can compute the
470 /// backedge-taken count.
471 ExitLimit ComputeLoadConstantCompareExitLimit(LoadInst *LI,
474 ICmpInst::Predicate p);
476 /// ComputeExitCountExhaustively - If the loop is known to execute a
477 /// constant number of times (the condition evolves only from constants),
478 /// try to evaluate a few iterations of the loop until we get the exit
479 /// condition gets a value of ExitWhen (true or false). If we cannot
480 /// evaluate the exit count of the loop, return CouldNotCompute.
481 const SCEV *ComputeExitCountExhaustively(const Loop *L,
485 /// HowFarToZero - Return the number of times an exit condition comparing
486 /// the specified value to zero will execute. If not computable, return
488 ExitLimit HowFarToZero(const SCEV *V, const Loop *L, bool IsSubExpr);
490 /// HowFarToNonZero - Return the number of times an exit condition checking
491 /// the specified value for nonzero will execute. If not computable, return
493 ExitLimit HowFarToNonZero(const SCEV *V, const Loop *L);
495 /// HowManyLessThans - Return the number of times an exit condition
496 /// containing the specified less-than comparison will execute. If not
497 /// computable, return CouldNotCompute. isSigned specifies whether the
498 /// less-than is signed.
499 ExitLimit HowManyLessThans(const SCEV *LHS, const SCEV *RHS,
500 const Loop *L, bool isSigned, bool IsSubExpr);
502 /// getPredecessorWithUniqueSuccessorForBB - Return a predecessor of BB
503 /// (which may not be an immediate predecessor) which has exactly one
504 /// successor from which BB is reachable, or null if no such block is
506 std::pair<BasicBlock *, BasicBlock *>
507 getPredecessorWithUniqueSuccessorForBB(BasicBlock *BB);
509 /// isImpliedCond - Test whether the condition described by Pred, LHS, and
510 /// RHS is true whenever the given FoundCondValue value evaluates to true.
511 bool isImpliedCond(ICmpInst::Predicate Pred,
512 const SCEV *LHS, const SCEV *RHS,
513 Value *FoundCondValue,
516 /// isImpliedCondOperands - Test whether the condition described by Pred,
517 /// LHS, and RHS is true whenever the condition described by Pred, FoundLHS,
518 /// and FoundRHS is true.
519 bool isImpliedCondOperands(ICmpInst::Predicate Pred,
520 const SCEV *LHS, const SCEV *RHS,
521 const SCEV *FoundLHS, const SCEV *FoundRHS);
523 /// isImpliedCondOperandsHelper - Test whether the condition described by
524 /// Pred, LHS, and RHS is true whenever the condition described by Pred,
525 /// FoundLHS, and FoundRHS is true.
526 bool isImpliedCondOperandsHelper(ICmpInst::Predicate Pred,
527 const SCEV *LHS, const SCEV *RHS,
528 const SCEV *FoundLHS,
529 const SCEV *FoundRHS);
531 /// getConstantEvolutionLoopExitValue - If we know that the specified Phi is
532 /// in the header of its containing loop, we know the loop executes a
533 /// constant number of times, and the PHI node is just a recurrence
534 /// involving constants, fold it.
535 Constant *getConstantEvolutionLoopExitValue(PHINode *PN, const APInt& BEs,
538 /// isKnownPredicateWithRanges - Test if the given expression is known to
539 /// satisfy the condition described by Pred and the known constant ranges
542 bool isKnownPredicateWithRanges(ICmpInst::Predicate Pred,
543 const SCEV *LHS, const SCEV *RHS);
545 /// forgetMemoizedResults - Drop memoized information computed for S.
546 void forgetMemoizedResults(const SCEV *S);
549 static char ID; // Pass identification, replacement for typeid
552 LLVMContext &getContext() const { return F->getContext(); }
554 /// isSCEVable - Test if values of the given type are analyzable within
555 /// the SCEV framework. This primarily includes integer types, and it
556 /// can optionally include pointer types if the ScalarEvolution class
557 /// has access to target-specific information.
558 bool isSCEVable(Type *Ty) const;
560 /// getTypeSizeInBits - Return the size in bits of the specified type,
561 /// for which isSCEVable must return true.
562 uint64_t getTypeSizeInBits(Type *Ty) const;
564 /// getEffectiveSCEVType - Return a type with the same bitwidth as
565 /// the given type and which represents how SCEV will treat the given
566 /// type, for which isSCEVable must return true. For pointer types,
567 /// this is the pointer-sized integer type.
568 Type *getEffectiveSCEVType(Type *Ty) const;
570 /// getSCEV - Return a SCEV expression for the full generality of the
571 /// specified expression.
572 const SCEV *getSCEV(Value *V);
574 const SCEV *getConstant(ConstantInt *V);
575 const SCEV *getConstant(const APInt& Val);
576 const SCEV *getConstant(Type *Ty, uint64_t V, bool isSigned = false);
577 const SCEV *getTruncateExpr(const SCEV *Op, Type *Ty);
578 const SCEV *getZeroExtendExpr(const SCEV *Op, Type *Ty);
579 const SCEV *getSignExtendExpr(const SCEV *Op, Type *Ty);
580 const SCEV *getAnyExtendExpr(const SCEV *Op, Type *Ty);
581 const SCEV *getAddExpr(SmallVectorImpl<const SCEV *> &Ops,
582 SCEV::NoWrapFlags Flags = SCEV::FlagAnyWrap);
583 const SCEV *getAddExpr(const SCEV *LHS, const SCEV *RHS,
584 SCEV::NoWrapFlags Flags = SCEV::FlagAnyWrap) {
585 SmallVector<const SCEV *, 2> Ops;
588 return getAddExpr(Ops, Flags);
590 const SCEV *getAddExpr(const SCEV *Op0, const SCEV *Op1, const SCEV *Op2,
591 SCEV::NoWrapFlags Flags = SCEV::FlagAnyWrap) {
592 SmallVector<const SCEV *, 3> Ops;
596 return getAddExpr(Ops, Flags);
598 const SCEV *getMulExpr(SmallVectorImpl<const SCEV *> &Ops,
599 SCEV::NoWrapFlags Flags = SCEV::FlagAnyWrap);
600 const SCEV *getMulExpr(const SCEV *LHS, const SCEV *RHS,
601 SCEV::NoWrapFlags Flags = SCEV::FlagAnyWrap)
603 SmallVector<const SCEV *, 2> Ops;
606 return getMulExpr(Ops, Flags);
608 const SCEV *getMulExpr(const SCEV *Op0, const SCEV *Op1, const SCEV *Op2,
609 SCEV::NoWrapFlags Flags = SCEV::FlagAnyWrap) {
610 SmallVector<const SCEV *, 3> Ops;
614 return getMulExpr(Ops, Flags);
616 const SCEV *getUDivExpr(const SCEV *LHS, const SCEV *RHS);
617 const SCEV *getAddRecExpr(const SCEV *Start, const SCEV *Step,
618 const Loop *L, SCEV::NoWrapFlags Flags);
619 const SCEV *getAddRecExpr(SmallVectorImpl<const SCEV *> &Operands,
620 const Loop *L, SCEV::NoWrapFlags Flags);
621 const SCEV *getAddRecExpr(const SmallVectorImpl<const SCEV *> &Operands,
622 const Loop *L, SCEV::NoWrapFlags Flags) {
623 SmallVector<const SCEV *, 4> NewOp(Operands.begin(), Operands.end());
624 return getAddRecExpr(NewOp, L, Flags);
626 const SCEV *getSMaxExpr(const SCEV *LHS, const SCEV *RHS);
627 const SCEV *getSMaxExpr(SmallVectorImpl<const SCEV *> &Operands);
628 const SCEV *getUMaxExpr(const SCEV *LHS, const SCEV *RHS);
629 const SCEV *getUMaxExpr(SmallVectorImpl<const SCEV *> &Operands);
630 const SCEV *getSMinExpr(const SCEV *LHS, const SCEV *RHS);
631 const SCEV *getUMinExpr(const SCEV *LHS, const SCEV *RHS);
632 const SCEV *getUnknown(Value *V);
633 const SCEV *getCouldNotCompute();
635 /// getSizeOfExpr - Return an expression for sizeof on the given type.
637 const SCEV *getSizeOfExpr(Type *AllocTy);
639 /// getAlignOfExpr - Return an expression for alignof on the given type.
641 const SCEV *getAlignOfExpr(Type *AllocTy);
643 /// getOffsetOfExpr - Return an expression for offsetof on the given field.
645 const SCEV *getOffsetOfExpr(StructType *STy, unsigned FieldNo);
647 /// getOffsetOfExpr - Return an expression for offsetof on the given field.
649 const SCEV *getOffsetOfExpr(Type *CTy, Constant *FieldNo);
651 /// getNegativeSCEV - Return the SCEV object corresponding to -V.
653 const SCEV *getNegativeSCEV(const SCEV *V);
655 /// getNotSCEV - Return the SCEV object corresponding to ~V.
657 const SCEV *getNotSCEV(const SCEV *V);
659 /// getMinusSCEV - Return LHS-RHS. Minus is represented in SCEV as A+B*-1.
660 const SCEV *getMinusSCEV(const SCEV *LHS, const SCEV *RHS,
661 SCEV::NoWrapFlags Flags = SCEV::FlagAnyWrap);
663 /// getTruncateOrZeroExtend - Return a SCEV corresponding to a conversion
664 /// of the input value to the specified type. If the type must be
665 /// extended, it is zero extended.
666 const SCEV *getTruncateOrZeroExtend(const SCEV *V, Type *Ty);
668 /// getTruncateOrSignExtend - Return a SCEV corresponding to a conversion
669 /// of the input value to the specified type. If the type must be
670 /// extended, it is sign extended.
671 const SCEV *getTruncateOrSignExtend(const SCEV *V, Type *Ty);
673 /// getNoopOrZeroExtend - Return a SCEV corresponding to a conversion of
674 /// the input value to the specified type. If the type must be extended,
675 /// it is zero extended. The conversion must not be narrowing.
676 const SCEV *getNoopOrZeroExtend(const SCEV *V, Type *Ty);
678 /// getNoopOrSignExtend - Return a SCEV corresponding to a conversion of
679 /// the input value to the specified type. If the type must be extended,
680 /// it is sign extended. The conversion must not be narrowing.
681 const SCEV *getNoopOrSignExtend(const SCEV *V, Type *Ty);
683 /// getNoopOrAnyExtend - Return a SCEV corresponding to a conversion of
684 /// the input value to the specified type. If the type must be extended,
685 /// it is extended with unspecified bits. The conversion must not be
687 const SCEV *getNoopOrAnyExtend(const SCEV *V, Type *Ty);
689 /// getTruncateOrNoop - Return a SCEV corresponding to a conversion of the
690 /// input value to the specified type. The conversion must not be
692 const SCEV *getTruncateOrNoop(const SCEV *V, Type *Ty);
694 /// getUMaxFromMismatchedTypes - Promote the operands to the wider of
695 /// the types using zero-extension, and then perform a umax operation
697 const SCEV *getUMaxFromMismatchedTypes(const SCEV *LHS,
700 /// getUMinFromMismatchedTypes - Promote the operands to the wider of
701 /// the types using zero-extension, and then perform a umin operation
703 const SCEV *getUMinFromMismatchedTypes(const SCEV *LHS,
706 /// getPointerBase - Transitively follow the chain of pointer-type operands
707 /// until reaching a SCEV that does not have a single pointer operand. This
708 /// returns a SCEVUnknown pointer for well-formed pointer-type expressions,
709 /// but corner cases do exist.
710 const SCEV *getPointerBase(const SCEV *V);
712 /// getSCEVAtScope - Return a SCEV expression for the specified value
713 /// at the specified scope in the program. The L value specifies a loop
714 /// nest to evaluate the expression at, where null is the top-level or a
715 /// specified loop is immediately inside of the loop.
717 /// This method can be used to compute the exit value for a variable defined
718 /// in a loop by querying what the value will hold in the parent loop.
720 /// In the case that a relevant loop exit value cannot be computed, the
721 /// original value V is returned.
722 const SCEV *getSCEVAtScope(const SCEV *S, const Loop *L);
724 /// getSCEVAtScope - This is a convenience function which does
725 /// getSCEVAtScope(getSCEV(V), L).
726 const SCEV *getSCEVAtScope(Value *V, const Loop *L);
728 /// isLoopEntryGuardedByCond - Test whether entry to the loop is protected
729 /// by a conditional between LHS and RHS. This is used to help avoid max
730 /// expressions in loop trip counts, and to eliminate casts.
731 bool isLoopEntryGuardedByCond(const Loop *L, ICmpInst::Predicate Pred,
732 const SCEV *LHS, const SCEV *RHS);
734 /// isLoopBackedgeGuardedByCond - Test whether the backedge of the loop is
735 /// protected by a conditional between LHS and RHS. This is used to
736 /// to eliminate casts.
737 bool isLoopBackedgeGuardedByCond(const Loop *L, ICmpInst::Predicate Pred,
738 const SCEV *LHS, const SCEV *RHS);
740 /// getSmallConstantTripCount - Returns the maximum trip count of this loop
741 /// as a normal unsigned value. Returns 0 if the trip count is unknown or
742 /// not constant. This "trip count" assumes that control exits via
743 /// ExitingBlock. More precisely, it is the number of times that control may
744 /// reach ExitingBlock before taking the branch. For loops with multiple
745 /// exits, it may not be the number times that the loop header executes if
746 /// the loop exits prematurely via another branch.
747 unsigned getSmallConstantTripCount(Loop *L, BasicBlock *ExitingBlock);
749 /// getSmallConstantTripMultiple - Returns the largest constant divisor of
750 /// the trip count of this loop as a normal unsigned value, if
751 /// possible. This means that the actual trip count is always a multiple of
752 /// the returned value (don't forget the trip count could very well be zero
753 /// as well!). As explained in the comments for getSmallConstantTripCount,
754 /// this assumes that control exits the loop via ExitingBlock.
755 unsigned getSmallConstantTripMultiple(Loop *L, BasicBlock *ExitingBlock);
757 // getExitCount - Get the expression for the number of loop iterations for
758 // which this loop is guaranteed not to exit via ExitingBlock. Otherwise
759 // return SCEVCouldNotCompute.
760 const SCEV *getExitCount(Loop *L, BasicBlock *ExitingBlock);
762 /// getBackedgeTakenCount - If the specified loop has a predictable
763 /// backedge-taken count, return it, otherwise return a SCEVCouldNotCompute
764 /// object. The backedge-taken count is the number of times the loop header
765 /// will be branched to from within the loop. This is one less than the
766 /// trip count of the loop, since it doesn't count the first iteration,
767 /// when the header is branched to from outside the loop.
769 /// Note that it is not valid to call this method on a loop without a
770 /// loop-invariant backedge-taken count (see
771 /// hasLoopInvariantBackedgeTakenCount).
773 const SCEV *getBackedgeTakenCount(const Loop *L);
775 /// getMaxBackedgeTakenCount - Similar to getBackedgeTakenCount, except
776 /// return the least SCEV value that is known never to be less than the
777 /// actual backedge taken count.
778 const SCEV *getMaxBackedgeTakenCount(const Loop *L);
780 /// hasLoopInvariantBackedgeTakenCount - Return true if the specified loop
781 /// has an analyzable loop-invariant backedge-taken count.
782 bool hasLoopInvariantBackedgeTakenCount(const Loop *L);
784 /// forgetLoop - This method should be called by the client when it has
785 /// changed a loop in a way that may effect ScalarEvolution's ability to
786 /// compute a trip count, or if the loop is deleted.
787 void forgetLoop(const Loop *L);
789 /// forgetValue - This method should be called by the client when it has
790 /// changed a value in a way that may effect its value, or which may
791 /// disconnect it from a def-use chain linking it to a loop.
792 void forgetValue(Value *V);
794 /// GetMinTrailingZeros - Determine the minimum number of zero bits that S
795 /// is guaranteed to end in (at every loop iteration). It is, at the same
796 /// time, the minimum number of times S is divisible by 2. For example,
797 /// given {4,+,8} it returns 2. If S is guaranteed to be 0, it returns the
799 uint32_t GetMinTrailingZeros(const SCEV *S);
801 /// getUnsignedRange - Determine the unsigned range for a particular SCEV.
803 ConstantRange getUnsignedRange(const SCEV *S);
805 /// getSignedRange - Determine the signed range for a particular SCEV.
807 ConstantRange getSignedRange(const SCEV *S);
809 /// isKnownNegative - Test if the given expression is known to be negative.
811 bool isKnownNegative(const SCEV *S);
813 /// isKnownPositive - Test if the given expression is known to be positive.
815 bool isKnownPositive(const SCEV *S);
817 /// isKnownNonNegative - Test if the given expression is known to be
820 bool isKnownNonNegative(const SCEV *S);
822 /// isKnownNonPositive - Test if the given expression is known to be
825 bool isKnownNonPositive(const SCEV *S);
827 /// isKnownNonZero - Test if the given expression is known to be
830 bool isKnownNonZero(const SCEV *S);
832 /// isKnownPredicate - Test if the given expression is known to satisfy
833 /// the condition described by Pred, LHS, and RHS.
835 bool isKnownPredicate(ICmpInst::Predicate Pred,
836 const SCEV *LHS, const SCEV *RHS);
838 /// SimplifyICmpOperands - Simplify LHS and RHS in a comparison with
839 /// predicate Pred. Return true iff any changes were made. If the
840 /// operands are provably equal or unequal, LHS and RHS are set to
841 /// the same value and Pred is set to either ICMP_EQ or ICMP_NE.
843 bool SimplifyICmpOperands(ICmpInst::Predicate &Pred,
848 /// getLoopDisposition - Return the "disposition" of the given SCEV with
849 /// respect to the given loop.
850 LoopDisposition getLoopDisposition(const SCEV *S, const Loop *L);
852 /// isLoopInvariant - Return true if the value of the given SCEV is
853 /// unchanging in the specified loop.
854 bool isLoopInvariant(const SCEV *S, const Loop *L);
856 /// hasComputableLoopEvolution - Return true if the given SCEV changes value
857 /// in a known way in the specified loop. This property being true implies
858 /// that the value is variant in the loop AND that we can emit an expression
859 /// to compute the value of the expression at any particular loop iteration.
860 bool hasComputableLoopEvolution(const SCEV *S, const Loop *L);
862 /// getLoopDisposition - Return the "disposition" of the given SCEV with
863 /// respect to the given block.
864 BlockDisposition getBlockDisposition(const SCEV *S, const BasicBlock *BB);
866 /// dominates - Return true if elements that makes up the given SCEV
867 /// dominate the specified basic block.
868 bool dominates(const SCEV *S, const BasicBlock *BB);
870 /// properlyDominates - Return true if elements that makes up the given SCEV
871 /// properly dominate the specified basic block.
872 bool properlyDominates(const SCEV *S, const BasicBlock *BB);
874 /// hasOperand - Test whether the given SCEV has Op as a direct or
875 /// indirect operand.
876 bool hasOperand(const SCEV *S, const SCEV *Op) const;
878 virtual bool runOnFunction(Function &F);
879 virtual void releaseMemory();
880 virtual void getAnalysisUsage(AnalysisUsage &AU) const;
881 virtual void print(raw_ostream &OS, const Module* = 0) const;
882 virtual void verifyAnalysis() const;
885 FoldingSet<SCEV> UniqueSCEVs;
886 BumpPtrAllocator SCEVAllocator;
888 /// FirstUnknown - The head of a linked list of all SCEVUnknown
889 /// values that have been allocated. This is used by releaseMemory
890 /// to locate them all and call their destructors.
891 SCEVUnknown *FirstUnknown;