/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/include/llvm/Transforms/Utils/ |
LoopUtils.h | 36 AliasAnalysis *AA = nullptr, ScalarEvolution *SE = nullptr, 50 bool formLCSSA(Loop &L, DominatorTree &DT, ScalarEvolution *SE = nullptr); 62 ScalarEvolution *SE = nullptr);
|
SimplifyIndVar.h | 60 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, LPPassManager *LPM, 65 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/Transforms/Utils/ |
SimplifyIndVar.cpp | 50 ScalarEvolution *SE; 58 SimplifyIndvar(Loop *Loop, ScalarEvolution *SE, LPPassManager *LPM, 62 SE(SE), 120 assert(SE->isSCEVable(IVSrc->getType()) && "Expect SCEVable IV operand"); 132 FoldedExpr = SE->getUDivExpr(SE->getSCEV(IVSrc), SE->getSCEV(D)); 135 if (!SE->isSCEVable(UseInst->getType())) 139 if (SE->getSCEV(UseInst) != FoldedExpr [all...] |
LCSSA.cpp | 183 bool llvm::formLCSSA(Loop &L, DominatorTree &DT, ScalarEvolution *SE) { 222 if (SE && Changed) 223 SE->forgetLoop(&L); 232 ScalarEvolution *SE) { 237 Changed |= formLCSSARecursively(**LI, DT, SE); 239 Changed |= formLCSSA(L, DT, SE); 253 ScalarEvolution *SE; 290 SE = getAnalysisIfAvailable<ScalarEvolution>(); 294 Changed |= formLCSSARecursively(**I, *DT, SE);
|
LoopUnroll.cpp | 106 if (ScalarEvolution *SE = LPM->getAnalysisIfAvailable<ScalarEvolution>()) { 108 SE->forgetLoop(L); 218 ScalarEvolution *SE = PP->getAnalysisIfAvailable<ScalarEvolution>(); 219 if (SE) 220 SE->forgetLoop(L); 323 for (succ_iterator SI = succ_begin(*BB), SE = succ_end(*BB); 324 SI != SE; ++SI) { 409 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); 410 SI != SE; ++SI) { 446 ScalarEvolution *SE = PP->getAnalysisIfAvailable<ScalarEvolution>() [all...] |
/external/llvm/lib/Analysis/ |
ScalarEvolutionAliasAnalysis.cpp | 33 ScalarEvolution *SE; 37 ScalarEvolutionAliasAnalysis() : FunctionPass(ID), SE(nullptr) { 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...] |
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); 135 TransformSubExpr(AR->getStepRecurrence(SE), 137 Result = SE.getMinusSCEV(Result, TransformedStep) [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...] |
DependenceAnalysis.cpp | 134 SE = &getAnalysis<ScalarEvolution>(); 338 return SE->getNegativeSCEV(C); 375 A = SE->getConstant(D->getType(), 1); 376 B = SE->getNegativeSCEV(A); 377 C = SE->getNegativeSCEV(D); 388 SE = NewSE; 468 const SCEV *Prod1 = SE->getMulExpr(X->getA(), Y->getB()); 469 const SCEV *Prod2 = SE->getMulExpr(X->getB(), Y->getA()); 473 Prod1 = SE->getMulExpr(X->getC(), Y->getB()); 474 Prod2 = SE->getMulExpr(X->getB(), Y->getC()) [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...] |
Delinearization.cpp | 45 ScalarEvolution *SE; 68 SE = &getAnalysis<ScalarEvolution>(); 97 const SCEV *AccessFn = SE->getSCEVAtScope(getPointerOperand(*Inst), L); 100 dyn_cast<SCEVUnknown>(SE->getPointerBase(AccessFn)); 104 AccessFn = SE->getMinusSCEV(AccessFn, BasePointer); 118 AR->delinearize(*SE, Subscripts, Sizes, SE->getElementSize(Inst));
|
/external/llvm/include/llvm/Analysis/ |
ScalarEvolutionExpressions.h | 305 const SCEV *getStepRecurrence(ScalarEvolution &SE) const { 307 return SE.getAddRecExpr(SmallVector<const SCEV *, 3>(op_begin()+1, 338 const SCEV *evaluateAtIteration(const SCEV *It, ScalarEvolution &SE) const; 347 ScalarEvolution &SE) const; 351 const SCEVAddRecExpr *getPostIncExpr(ScalarEvolution &SE) const { 352 return cast<SCEVAddRecExpr>(SE.getAddExpr(this, getStepRecurrence(SE))); 361 void collectParametricTerms(ScalarEvolution &SE, 365 void computeAccessFunctions(ScalarEvolution &SE, 433 void delinearize(ScalarEvolution &SE, [all...] |
ScalarEvolutionNormalization.h | 73 ScalarEvolution &SE,
|
/external/llvm/lib/Transforms/Scalar/ |
IndVarSimplify.cpp | 73 ScalarEvolution *SE; 83 IndVarSimplify() : LoopPass(ID), LI(nullptr), SE(nullptr), DT(nullptr), 177 const SCEV *FromBase = SE->getPointerBase(SE->getSCEV(FromPtr)); 178 const SCEV *ToBase = SE->getPointerBase(SE->getSCEV(ToPtr)); 463 SE->forgetLoop(L); 531 SE->forgetValue(PN); 553 const SCEV *ExitValue = SE->getSCEVAtScope(Inst, L->getParentLoop()); 554 if (!SE->isLoopInvariant(ExitValue, L) | [all...] |
LoopStrengthReduce.cpp | 265 void InitialMatch(const SCEV *S, Loop *L, ScalarEvolution &SE); 292 ScalarEvolution &SE) { 294 if (SE.properlyDominates(S, L->getHeader())) { 303 DoInitialMatch(*I, L, Good, Bad, SE); 310 DoInitialMatch(AR->getStart(), L, Good, Bad, SE); 311 DoInitialMatch(SE.getAddRecExpr(SE.getConstant(AR->getType(), 0), 312 AR->getStepRecurrence(SE), 315 L, Good, Bad, SE); 323 const SCEV *NewMul = SE.getMulExpr(Ops) [all...] |
LoopIdiomRecognize.cpp | 135 ScalarEvolution *SE; 142 DL = nullptr; DT = nullptr; SE = nullptr; TLI = nullptr; TTI = nullptr; 196 return SE ? SE : (SE = &getAnalysis<ScalarEvolution>()); 235 static void deleteDeadInstruction(Instruction *I, ScalarEvolution &SE, 241 // Before we touch this instruction, remove it from SE! 247 SE.forgetValue(DeadInst); 268 static void deleteIfDeadInstruction(Value *V, ScalarEvolution &SE, 272 deleteDeadInstruction(I, SE, TLI) [all...] |
LoopRerollPass.cpp | 144 ScalarEvolution *SE; 378 dyn_cast<SCEVAddRecExpr>(SE->getSCEV(I))) { 384 dyn_cast<SCEVConstant>(PHISCEV->getStepRecurrence(*SE))) { 557 const SCEVAddRecExpr *RealIVSCEV = cast<SCEVAddRecExpr>(SE->getSCEV(RealIV)); 560 if (!SE->isSCEVable(User1->getType()) || !SE->isSCEVable(User2->getType())) 563 dyn_cast<SCEVAddRecExpr>(SE->getSCEV(User1)), 565 dyn_cast<SCEVAddRecExpr>(SE->getSCEV(User2)); 572 if (User1SCEV == RealIVSCEV->getPostIncExpr(*SE)) { 577 if (User2SCEV != RealIVSCEV->getPostIncExpr(*SE)) [all...] |
/external/llvm/lib/CodeGen/ |
EdgeBundles.cpp | 48 SE = MBB.succ_end(); SI != SE; ++SI) 85 SE = MBB.succ_end(); 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)) { 52 if (const SymSymExpr *SSE = dyn_cast<SymSymExpr>(SE)) { 140 } else if (const SymIntExpr *SE = dyn_cast<SymIntExpr>(sym)) { 143 BinaryOperator::Opcode op = SE->getOpcode(); 148 return assumeSymRel(state, SE->getLHS(), op, SE->getRHS()); 195 if (const SymIntExpr *SE = dyn_cast<SymIntExpr>(Sym)) { 196 BinaryOperator::Opcode Op = SE->getOpcode(); 198 Sym = SE->getLHS() [all...] |
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
SymbolManager.h | 81 symbol_iterator(const SymExpr *SE); 117 static inline bool classof(const SymExpr *SE) { 118 Kind k = SE->getKind(); 147 static inline bool classof(const SymExpr *SE) { 148 return SE->getKind() == RegionValueKind; 193 static inline bool classof(const SymExpr *SE) { 194 return SE->getKind() == ConjuredKind; 227 static inline bool classof(const SymExpr *SE) { 228 return SE->getKind() == DerivedKind; 258 static inline bool classof(const SymExpr *SE) { [all...] |
/external/clang/lib/StaticAnalyzer/Checkers/ |
VLASizeChecker.cpp | 93 const Expr *SE = VLA->getSizeExpr(); 95 SVal sizeV = state->getSVal(SE, C.getLocationContext()); 98 reportBug(VLA_Garbage, SE, state, C); 109 reportBug(VLA_Tainted, SE, nullptr, C); 120 reportBug(VLA_Zero, SE, stateZero, C); 135 svalBuilder.evalCast(sizeD, SizeTy, SE->getType()).castAs<NonLoc>();
|
/external/libphonenumber/java/test/com/android/i18n/phonenumbers/ |
RegionCode.java | 54 static final String SE = "SE";
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib-tk/ |
Tkconstants.py | 15 SE='se'
|