| /external/llvm/unittests/Analysis/ |
| ScalarEvolutionTest.cpp | 27 ScalarEvolutionsTest() : M("", Context), SE(*new ScalarEvolution) {}
31 SE.releaseMemory();
36 ScalarEvolution &SE;
53 PM.add(&SE);
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)
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| SimplifyIndVar.cpp | 46 ScalarEvolution *SE;
54 SimplifyIndvar(Loop *Loop, ScalarEvolution *SE, LPPassManager *LPM,
58 SE(SE),
112 assert(SE->isSCEVable(IVSrc->getType()) && "Expect SCEVable IV operand");
124 FoldedExpr = SE->getUDivExpr(SE->getSCEV(IVSrc), SE->getSCEV(D));
127 if (!SE->isSCEVable(UseInst->getType()))
131 if (SE->getSCEV(UseInst) != FoldedExpr
[all...] |
| LoopUnroll.cpp | 99 if (ScalarEvolution *SE = LPM->getAnalysisIfAvailable<ScalarEvolution>()) {
101 SE->forgetLoop(L);
210 ScalarEvolution *SE = LPM->getAnalysisIfAvailable<ScalarEvolution>();
211 if (SE)
212 SE->forgetLoop(L);
300 for (succ_iterator SI = succ_begin(*BB), SE = succ_end(*BB);
301 SI != SE; ++SI) {
386 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB);
387 SI != SE; ++SI) {
419 ScalarEvolution *SE = LPM->getAnalysisIfAvailable<ScalarEvolution>()
[all...] |
| LoopUnrollRuntime.cpp | 242 ScalarEvolution *SE = LPM->getAnalysisIfAvailable<ScalarEvolution>();
243 if (SE == 0)
248 const SCEV *BECount = SE->getBackedgeTakenCount(L);
254 SE->getAddExpr(BECount, SE->getConstant(BECount->getType(), 1));
266 SE->forgetLoop(ParentLoop);
279 SCEVExpander Expander(*SE, "loop-unroll");
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| SimplifyIndVar.h | 44 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, LPPassManager *LPM,
49 bool simplifyLoopIVs(Loop *L, ScalarEvolution *SE, LPPassManager *LPM,
|
| /external/llvm/include/llvm/ADT/ |
| SetOperations.h | 26 for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end();
27 SI != SE; ++SI)
53 for (typename S1Ty::const_iterator SI = S1.begin(), SE = S1.end();
54 SI != SE; ++SI)
64 for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end();
65 SI != SE; ++SI)
|
| /external/llvm/lib/Analysis/ |
| ScalarEvolutionAliasAnalysis.cpp | 33 ScalarEvolution *SE;
37 ScalarEvolutionAliasAnalysis() : FunctionPass(ID), SE(0) {
83 SE = &getAnalysis<ScalarEvolution>();
118 const SCEV *AS = SE->getSCEV(const_cast<Value *>(LocA.Ptr));
119 const SCEV *BS = SE->getSCEV(const_cast<Value *>(LocB.Ptr));
126 if (SE->getEffectiveSCEVType(AS->getType()) ==
127 SE->getEffectiveSCEVType(BS->getType())) {
128 unsigned BitWidth = SE->getTypeSizeInBits(AS->getType());
133 const SCEV *BA = SE->getMinusSCEV(BS, AS);
138 if (ASizeInt.ule(SE->getUnsignedRange(BA).getUnsignedMin()) &
[all...] |
| ScalarEvolutionExpander.cpp | 79 assert(SE.DT->dominates(Ret, BIP));
94 assert(SE.getTypeSizeInBits(V->getType()) == SE.getTypeSizeInBits(Ty) &&
108 SE.getTypeSizeInBits(Ty) == SE.getTypeSizeInBits(V->getType())) {
112 SE.getTypeSizeInBits(CI->getType()) ==
113 SE.getTypeSizeInBits(CI->getOperand(0)->getType()))
118 SE.getTypeSizeInBits(CE->getType()) ==
119 SE.getTypeSizeInBits(CE->getOperand(0)->getType()))
183 while (const Loop *L = SE.LI->getLoopFor(Builder.GetInsertBlock()))
[all...] |
| ScalarEvolutionNormalization.cpp | 70 ScalarEvolution &SE;
77 ScalarEvolution &se, DominatorTree &dt):
78 Kind(kind), Loops(loops), SE(se), DT(dt) {}
99 case scZeroExtend: return SE.getZeroExtendExpr(N, S->getType());
100 case scSignExtend: return SE.getSignExtendExpr(N, S->getType());
101 case scTruncate: return SE.getTruncateExpr(N, S->getType());
119 const SCEV *Result = SE.getAddRecExpr(Operands, L, SCEV::FlagAnyWrap);
124 TransformSubExpr(AR->getStepRecurrence(SE),
126 Result = SE.getMinusSCEV(Result, TransformedStep)
[all...] |
| IVUsers.cpp | 50 ScalarEvolution *SE, LoopInfo *LI) {
58 SE->getSCEVAtScope(AR, LI->getLoopFor(I->getParent())) != AR);
62 return isInteresting(AR->getStart(), I, L, SE, LI) &&
63 !isInteresting(AR->getStepRecurrence(*SE), I, L, SE, LI);
71 if (isInteresting(*OI, I, L, SE, LI)) {
121 if (!SE->isSCEVable(I->getType()))
133 uint64_t Width = SE->getTypeSizeInBits(I->getType());
138 const SCEV *ISE = SE->getSCEV(I);
142 if (!isInteresting(ISE, I, L, SE, LI)
[all...] |
| LoopDependenceAnalysis.cpp | 105 static inline const SCEV *GetZeroSCEV(ScalarEvolution *SE) {
106 return SE->getConstant(Type::getInt32Ty(SE->getContext()), 0L);
141 if (!SE->isLoopInvariant(S, L))
262 const SCEV* aSCEV = (aIdx != aEnd) ? SE->getSCEV(*aIdx) : GetZeroSCEV(SE);
263 const SCEV* bSCEV = (bIdx != bEnd) ? SE->getSCEV(*bIdx) : GetZeroSCEV(SE);
317 SE = &getAnalysis<ScalarEvolution>();
|
| ScalarEvolution.cpp | 359 SE->forgetMemoizedResults(this);
362 SE->UniqueSCEVs.RemoveNode(this);
370 SE->forgetMemoizedResults(this);
373 SE->UniqueSCEVs.RemoveNode(this);
675 ScalarEvolution &SE,
679 return SE.getTruncateOrZeroExtend(It, ResultTy);
733 return SE.getCouldNotCompute();
735 unsigned W = SE.getTypeSizeInBits(ResultTy);
766 IntegerType *CalculationTy = IntegerType::get(SE.getContext(),
768 const SCEV *Dividend = SE.getTruncateOrZeroExtend(It, CalculationTy)
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| ScalarEvolutionNormalization.h | 73 ScalarEvolution &SE,
|
| ScalarEvolutionExpressions.h | 310 const SCEV *getStepRecurrence(ScalarEvolution &SE) const {
312 return SE.getAddRecExpr(SmallVector<const SCEV *, 3>(op_begin()+1,
343 const SCEV *evaluateAtIteration(const SCEV *It, ScalarEvolution &SE) const;
352 ScalarEvolution &SE) const;
356 const SCEVAddRecExpr *getPostIncExpr(ScalarEvolution &SE) const {
357 return cast<SCEVAddRecExpr>(SE.getAddExpr(this, getStepRecurrence(SE)));
423 /// SE - The parent ScalarEvolution value. This is used to update
426 ScalarEvolution *SE;
433 ScalarEvolution *se, SCEVUnknown *next)
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| IndVarSimplify.cpp | 69 ScalarEvolution *SE;
79 IndVarSimplify() : LoopPass(ID), LI(0), SE(0), DT(0), TD(0),
173 const SCEV *FromBase = SE->getPointerBase(SE->getSCEV(FromPtr));
174 const SCEV *ToBase = SE->getPointerBase(SE->getSCEV(ToPtr));
461 SE->forgetLoop(L);
514 SE->forgetValue(PN);
536 const SCEV *ExitValue = SE->getSCEVAtScope(Inst, L->getParentLoop());
537 if (!SE->isLoopInvariant(ExitValue, L)
[all...] |
| LoopStrengthReduce.cpp | 245 void InitialMatch(const SCEV *S, Loop *L, ScalarEvolution &SE);
266 ScalarEvolution &SE) {
268 if (SE.properlyDominates(S, L->getHeader())) {
277 DoInitialMatch(*I, L, Good, Bad, SE);
284 DoInitialMatch(AR->getStart(), L, Good, Bad, SE);
285 DoInitialMatch(SE.getAddRecExpr(SE.getConstant(AR->getType(), 0),
286 AR->getStepRecurrence(SE),
289 L, Good, Bad, SE);
297 const SCEV *NewMul = SE.getMulExpr(Ops)
[all...] |
| LoopIdiomRecognize.cpp | 70 ScalarEvolution *SE;
135 static void deleteDeadInstruction(Instruction *I, ScalarEvolution &SE,
141 // Before we touch this instruction, remove it from SE!
147 SE.forgetValue(DeadInst);
168 static void deleteIfDeadInstruction(Value *V, ScalarEvolution &SE,
172 deleteDeadInstruction(I, SE, TLI);
184 SE = &getAnalysis<ScalarEvolution>();
185 if (!SE->hasLoopInvariantBackedgeTakenCount(L))
187 const SCEV *BECount = SE->getBackedgeTakenCount(L);
286 dyn_cast<SCEVAddRecExpr>(SE->getSCEV(StorePtr))
[all...] |
| LoopUnrollPass.cpp | 135 ScalarEvolution *SE = &getAnalysis<ScalarEvolution>();
159 TripCount = SE->getSmallConstantTripCount(L, LatchBlock);
160 TripMultiple = SE->getSmallConstantTripMultiple(L, LatchBlock);
|
| SimplifyCFGPass.cpp | 68 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI)
177 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI)
203 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI)
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| SimpleConstraintManager.cpp | 29 const SymExpr *SE = SymVal->getSymbol();
31 if (const SymIntExpr *SIE = dyn_cast<SymIntExpr>(SE)) {
184 const SymIntExpr *SE = dyn_cast<SymIntExpr>(sym);
185 if (!SE)
188 BinaryOperator::Opcode op = SE->getOpcode();
191 QualType T = SE->getType(BasicVals.getContext());
194 return assumeSymRel(state, SE, op, zero);
200 return assumeSymRel(state, SE->getLHS(), op, SE->getRHS());
218 if (const SymIntExpr *SE = dyn_cast<SymIntExpr>(Sym))
[all...] |
| /external/llvm/lib/CodeGen/ |
| EdgeBundles.cpp | 50 SE = MBB.succ_end(); SI != SE; ++SI)
91 SE = I->succ_end(); SI != SE; ++SI)
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| SymbolManager.h | 84 symbol_iterator(const SymExpr *SE);
120 static inline bool classof(const SymExpr *SE) {
121 Kind k = SE->getKind();
150 static inline bool classof(const SymExpr *SE) {
151 return SE->getKind() == RegionValueKind;
196 static inline bool classof(const SymExpr *SE) {
197 return SE->getKind() == ConjuredKind;
230 static inline bool classof(const SymExpr *SE) {
231 return SE->getKind() == DerivedKind;
261 static inline bool classof(const SymExpr *SE) {
[all...] |
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| VLASizeChecker.cpp | 91 const Expr *SE = VLA->getSizeExpr();
93 SVal sizeV = state->getSVal(SE, C.getLocationContext());
96 reportBug(VLA_Garbage, SE, state, C);
107 reportBug(VLA_Tainted, SE, 0, C);
118 reportBug(VLA_Zero, SE, stateZero, C);
133 SE->getType()));
|
| /external/clang/tools/diagtool/ |
| TreeView.cpp | 82 SE = I->subgroup_end();
83 SI != SE; ++SI) {
|
| /external/llvm/utils/TableGen/ |
| SequenceToOffsetTable.h | 117 SE = I->first.end(); SI != SE; ++SI) {
|
