| /external/llvm/include/llvm/Analysis/ |
| ScalarEvolution.h | 13 // SCEV class. Given this analysis, trip counts of loops and other important
50 class SCEV;
51 template<> struct FoldingSetTrait<SCEV>;
53 /// SCEV - This class represents an analyzed expression in the program. These
57 class SCEV : public FoldingSetNode {
58 friend struct FoldingSetTrait<SCEV>;
64 // The SCEV baseclass this node corresponds to
73 SCEV(const SCEV &); // DO NOT IMPLEMENT
74 void operator=(const SCEV &); // DO NOT IMPLEMEN
[all...] |
| LoopDependenceAnalysis.h | 34 class SCEV;
71 /// a given SCEV is variant.
72 void getLoops(const SCEV*, DenseSet<const Loop*>*) const;
74 /// isLoopInvariant - True if a given SCEV is invariant in all loops of the
76 bool isLoopInvariant(const SCEV*) const;
78 /// isAffine - An SCEV is affine with respect to the loop nest starting at
81 bool isAffine(const SCEV*) const;
84 bool isZIVPair(const SCEV*, const SCEV*) const;
85 bool isSIVPair(const SCEV*, const SCEV*) const
[all...] |
| ScalarEvolutionNormalization.h | 47 class SCEV;
68 const SCEV *TransformForPostIncUse(TransformKind Kind,
69 const SCEV *S,
|
| ScalarEvolutionExpressions.h | 1 //===- llvm/Analysis/ScalarEvolutionExpressions.h - SCEV Exprs --*- C++ -*-===//
36 class SCEVConstant : public SCEV {
41 SCEV(ID, scConstant), V(v) {}
49 static inline bool classof(const SCEV *S) {
57 class SCEVCastExpr : public SCEV {
59 const SCEV *Op;
63 unsigned SCEVTy, const SCEV *op, Type *ty);
66 const SCEV *getOperand() const { return Op; }
71 static inline bool classof(const SCEV *S) {
86 const SCEV *op, Type *ty)
[all...] |
| IVUsers.h | 29 class SCEV;
146 /// reducible SCEV, recursively add its users to the IVUsesByStride set and
152 /// getReplacementExpr - Return a SCEV expression which computes the
154 const SCEV *getReplacementExpr(const IVStrideUse &IU) const;
157 const SCEV *getExpr(const IVStrideUse &IU) const;
159 const SCEV *getStride(const IVStrideUse &IU, const Loop *L) const;
|
| ScalarEvolutionExpander.h | 1 //===---- llvm/Analysis/ScalarEvolutionExpander.h - SCEV Exprs --*- C++ -*-===//
39 std::map<std::pair<const SCEV *, Instruction *>, AssertingVH<Value> >
44 /// RelevantLoops - A memoization of the "relevant" loop for a given SCEV.
45 DenseMap<const SCEV *, const Loop *> RelevantLoops;
130 /// expandCodeFor - Insert code to directly compute the specified SCEV
133 Value *expandCodeFor(const SCEV *SH, Type *Ty, Instruction *I);
206 Value *expandAddToGEP(const SCEV *const *op_begin,
207 const SCEV *const *op_end,
210 Value *expand(const SCEV *S);
212 /// expandCodeFor - Insert code to directly compute the specified SCEV
[all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolutionNormalization.cpp | 73 DenseMap<const SCEV*, const SCEV*> Transformed;
80 const SCEV *TransformSubExpr(const SCEV *S, Instruction *User,
84 const SCEV *TransformImpl(const SCEV *S, Instruction *User,
91 const SCEV *PostIncTransform::
92 TransformImpl(const SCEV *S, Instruction *User, Value *OperandValToReplace) {
95 const SCEV *O = X->getOperand();
96 const SCEV *N = TransformSubExpr(O, User, OperandValToReplace)
[all...] |
| ScalarEvolution.cpp | 15 // scalar expressions, which are represented as subclasses of the SCEV class.
17 // can handle. We only create one SCEV of a particular shape, so
20 // One important aspect of the SCEV objects is that they are never cyclic, even
103 cl::desc("Maximum number of iterations SCEV will "
118 // SCEV class definitions
122 // Implementation of the SCEV class.
125 void SCEV::dump() const {
130 void SCEV::print(raw_ostream &OS) const {
137 const SCEV *Op = Trunc->getOperand();
144 const SCEV *Op = ZExt->getOperand()
[all...] |
| LoopDependenceAnalysis.cpp | 105 static inline const SCEV *GetZeroSCEV(ScalarEvolution *SE) {
137 void LoopDependenceAnalysis::getLoops(const SCEV *S,
145 bool LoopDependenceAnalysis::isLoopInvariant(const SCEV *S) const {
151 bool LoopDependenceAnalysis::isAffine(const SCEV *S) const {
156 bool LoopDependenceAnalysis::isZIVPair(const SCEV *A, const SCEV *B) const {
160 bool LoopDependenceAnalysis::isSIVPair(const SCEV *A, const SCEV *B) const {
168 LoopDependenceAnalysis::analyseZIV(const SCEV *A,
169 const SCEV *B
[all...] |
| ScalarEvolutionAliasAnalysis.cpp | 1 //===- ScalarEvolutionAliasAnalysis.cpp - SCEV-based Alias Analysis -------===//
57 Value *GetBaseValue(const SCEV *S);
63 INITIALIZE_AG_PASS_BEGIN(ScalarEvolutionAliasAnalysis, AliasAnalysis, "scev-aa",
66 INITIALIZE_AG_PASS_END(ScalarEvolutionAliasAnalysis, AliasAnalysis, "scev-aa",
90 ScalarEvolutionAliasAnalysis::GetBaseValue(const SCEV *S) {
97 const SCEV *Last = A->getOperand(A->getNumOperands()-1);
118 const SCEV *AS = SE->getSCEV(const_cast<Value *>(LocA.Ptr));
119 const SCEV *BS = SE->getSCEV(const_cast<Value *>(LocB.Ptr));
133 const SCEV *BA = SE->getMinusSCEV(BS, AS);
147 const SCEV *AB = SE->getMinusSCEV(AS, BS)
[all...] |
| ScalarEvolutionExpander.cpp | 211 static bool FactorOutConstant(const SCEV *&S,
212 const SCEV *&Remainder,
213 const SCEV *Factor,
241 const SCEV *Div = SE.getConstant(CI);
262 SmallVector<const SCEV *, 4> NewMulOps(M->op_begin(), M->op_end());
273 const SCEV *SOp = M->getOperand(i);
274 const SCEV *Remainder = SE.getConstant(SOp->getType(), 0);
277 SmallVector<const SCEV *, 4> NewMulOps(M->op_begin(), M->op_end());
288 const SCEV *Step = A->getStepRecurrence(SE);
289 const SCEV *StepRem = SE.getConstant(Step->getType(), 0)
[all...] |
| IVUsers.cpp | 48 static bool isInteresting(const SCEV *S, const Instruction *I, const Loop *L,
60 // do effective SCEV expansions for addrecs with interesting steps.
111 /// reducible SCEV, recursively add its users to the IVUsesByStride set and
131 const SCEV *ISE = SE->getSCEV(I);
172 << " OF SCEV: " << *ISE << '\n');
177 << " OF SCEV: " << *ISE << '\n');
278 /// getReplacementExpr - Return a SCEV expression which computes the
280 const SCEV *IVUsers::getReplacementExpr(const IVStrideUse &IU) const {
285 const SCEV *IVUsers::getExpr(const IVStrideUse &IU) const {
293 static const SCEVAddRecExpr *findAddRecForLoop(const SCEV *S, const Loop *L)
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopStrengthReduce.cpp | 29 // The SCEV for %i is {0,+,1}<%L>. The SCEV for %i.next is {1,+,1}<%L>, however
133 typedef DenseMap<const SCEV *, RegSortData> RegUsesTy;
136 SmallVector<const SCEV *, 16> RegSequence;
139 void CountRegister(const SCEV *Reg, size_t LUIdx);
140 void DropRegister(const SCEV *Reg, size_t LUIdx);
143 bool isRegUsedByUsesOtherThan(const SCEV *Reg, size_t LUIdx) const;
145 const SmallBitVector &getUsedByIndices(const SCEV *Reg) const;
149 typedef SmallVectorImpl<const SCEV *>::iterator iterator;
150 typedef SmallVectorImpl<const SCEV *>::const_iterator const_iterator
[all...] |
| LoopIdiomRecognize.cpp | 79 bool runOnLoopBlock(BasicBlock *BB, const SCEV *BECount,
82 bool processLoopStore(StoreInst *SI, const SCEV *BECount);
83 bool processLoopMemSet(MemSetInst *MSI, const SCEV *BECount);
89 const SCEV *BECount);
93 const SCEV *BECount);
145 // SCEV.
185 const SCEV *BECount = SE->getBackedgeTakenCount(L);
225 bool LoopIdiomRecognize::runOnLoopBlock(BasicBlock *BB, const SCEV *BECount,
269 bool LoopIdiomRecognize::processLoopStore(StoreInst *SI, const SCEV *BECount) {
328 processLoopMemSet(MemSetInst *MSI, const SCEV *BECount)
[all...] |
| IndVarSimplify.cpp | 59 // implement a strong expression equivalence checker in SCEV. Until then, we
110 Value *LinearFunctionTestReplace(Loop *L, const SCEV *BackedgeTakenCount,
132 /// isValidRewrite - Return true if the SCEV expansion generated by the
133 /// rewriter can replace the original value. SCEV guarantees that it
137 // If an SCEV expression subsumed multiple pointers, its expansion could
141 // could fail in a dangerous way. Ultimately, SCEV will be improved to avoid
146 // because it understands lcssa phis while SCEV does not.
160 // SCEV may have rewritten an expression that produces the GEP's pointer
163 // base of a recurrence. This handles the case in which SCEV expansion
171 const SCEV *FromBase = SE->getPointerBase(SE->getSCEV(FromPtr))
[all...] |
| LoopDeletion.cpp | 167 const SCEV *S = SE.getMaxBackedgeTakenCount(L);
|
| /external/llvm/lib/Transforms/Utils/ |
| SimplifyIndVar.cpp | 43 /// other loop passes that preserve SCEV.
94 const SCEV *FoldedExpr = 0;
132 // Bypass the operand if SCEV can prove it has no effect.
140 assert(SE->getSCEV(UseInst) == FoldedExpr && "bad SCEV with folded oper");
162 const SCEV *S = SE->getSCEV(ICmp->getOperand(IVOperIdx));
163 const SCEV *X = SE->getSCEV(ICmp->getOperand(1 - IVOperIdx));
196 const SCEV *S = SE->getSCEV(Rem->getOperand(0));
197 const SCEV *X = SE->getSCEV(Rem->getOperand(1));
211 const SCEV *LessOne =
253 // Eliminate any operation that SCEV can prove is an identity function
[all...] |
| LoopUnrollRuntime.cpp | 246 const SCEV *BECount = SE->getBackedgeTakenCount(L);
251 const SCEV *TripCountSC =
|
| /external/llvm/unittests/Analysis/ |
| ScalarEvolutionTest.cpp | 29 // Manually clean up, since we allocated new SCEV objects after the
56 const SCEV *S0 = SE.getSCEV(V0);
57 const SCEV *S1 = SE.getSCEV(V1);
58 const SCEV *S2 = SE.getSCEV(V2);
60 const SCEV *P0 = SE.getAddExpr(S0, S0);
61 const SCEV *P1 = SE.getAddExpr(S1, S1);
62 const SCEV *P2 = SE.getAddExpr(S2, S2);
109 SmallVector<const SCEV *, 5> A;
115 const SCEV *A_rec = SE.getAddRecExpr(A, &L, SCEV::FlagAnyWrap)
[all...] |
| /external/llvm/lib/Transforms/Vectorize/ |
| BBVectorize.cpp | 406 const SCEV *IPtrSCEV = SE->getSCEV(IPtr);
407 const SCEV *JPtrSCEV = SE->getSCEV(JPtr);
412 const SCEV *OffsetSCEV = SE->getMinusSCEV(JPtrSCEV, IPtrSCEV);
704 const SCEV *A1ISCEV = SE->getSCEV(A1I),
[all...] |
