Searched refs:SE (Results 1 - 25 of 163) sorted by relevance

1234567

/external/llvm/unittests/Analysis/
H A DScalarEvolutionTest.cpp27 ScalarEvolutionsTest() : M("", Context), SE(*new ScalarEvolution) {}
31 SE.releaseMemory();
36 ScalarEvolution &SE; member in class:llvm::__anon26471::ScalarEvolutionsTest
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
[all...]
/external/llvm/include/llvm/ADT/
H A DSetOperations.h26 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/
H A DSimplifyIndVar.cpp50 ScalarEvolution *SE; member in class:__anon26364::SimplifyIndvar
58 SimplifyIndvar(Loop *Loop, ScalarEvolution *SE, LPPassManager *LPM, argument
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
362 isSimpleIVUser(Instruction *I, const Loop *L, ScalarEvolution *SE) argument
451 simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, LPPassManager *LPM, SmallVectorImpl<WeakVH> &Dead, IVVisitor *V) argument
462 simplifyLoopIVs(Loop *L, ScalarEvolution *SE, LPPassManager *LPM, SmallVectorImpl<WeakVH> &Dead) argument
[all...]
H A DLCSSA.cpp183 bool llvm::formLCSSA(Loop &L, DominatorTree &DT, ScalarEvolution *SE) { argument
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; member in struct:__anon26352::LCSSA
290 SE = getAnalysisIfAvailable<ScalarEvolution>();
294 Changed |= formLCSSARecursively(**I, *DT, SE);
231 formLCSSARecursively(Loop &L, DominatorTree &DT, ScalarEvolution *SE) argument
H A DLoopUnroll.cpp106 if (ScalarEvolution *SE = LPM->getAnalysisIfAvailable<ScalarEvolution>()) {
108 SE->forgetLoop(L);
218 ScalarEvolution *SE = PP->getAnalysisIfAvailable<ScalarEvolution>(); local
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 local
495 ScalarEvolution *SE = PP->getAnalysisIfAvailable<ScalarEvolution>(); local
[all...]
H A DLoopUnrollRuntime.cpp243 ScalarEvolution *SE = LPM->getAnalysisIfAvailable<ScalarEvolution>();
244 if (!SE)
249 const SCEV *BECount = SE->getBackedgeTakenCount(L);
255 SE->getAddExpr(BECount, SE->getConstant(BECount->getType(), 1));
267 SE->forgetLoop(ParentLoop);
280 SCEVExpander Expander(*SE, "loop-unroll");
/external/llvm/lib/Analysis/
H A DScalarEvolutionAliasAnalysis.cpp33 ScalarEvolution *SE; member in class:__anon25702::ScalarEvolutionAliasAnalysis
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
[all...]
H A DScalarEvolutionNormalization.cpp70 ScalarEvolution &SE; member in class:__anon25705::PostIncTransform
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);
166 TransformSubExpr(AR->getStepRecurrence(SE),
168 Result = SE
245 TransformForPostIncUse(TransformKind Kind, const SCEV *S, Instruction *User, Value *OperandValToReplace, PostIncLoopSet &Loops, ScalarEvolution &SE, DominatorTree &DT) argument
[all...]
H A DScalarEvolutionExpander.cpp79 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
207 FactorOutConstant(const SCEV *&S, const SCEV *&Remainder, const SCEV *Factor, ScalarEvolution &SE, const DataLayout *DL) argument
305 SimplifyAddOperands(SmallVectorImpl<const SCEV *> &Ops, Type *Ty, ScalarEvolution &SE) argument
334 SplitAddRecs(SmallVectorImpl<const SCEV *> &Ops, Type *Ty, ScalarEvolution &SE) argument
833 ExposePointerBase(const SCEV *&Base, const SCEV *&Rest, ScalarEvolution &SE) argument
1035 canBeCheaplyTransformed(ScalarEvolution &SE, const SCEVAddRecExpr *Phi, const SCEVAddRecExpr *Requested, bool &InvertStep) argument
1824 ScalarEvolution &SE; member in struct:__anon25704::SCEVFindUnsafe
1851 isSafeToExpand(const SCEV *S, ScalarEvolution &SE) argument
[all...]
H A DDependenceAnalysis.cpp134 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
[all...]
H A DIVUsers.cpp50 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, L
49 isInteresting(const SCEV *S, const Instruction *I, const Loop *L, ScalarEvolution *SE, LoopInfo *LI) argument
[all...]
H A DDelinearization.cpp45 ScalarEvolution *SE; member in class:__anon25675::Delinearization
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/Transforms/Utils/
H A DLoopUtils.h36 AliasAnalysis *AA = nullptr, ScalarEvolution *SE = nullptr,
50 bool formLCSSA(Loop &L, DominatorTree &DT, ScalarEvolution *SE = nullptr);
62 ScalarEvolution *SE = nullptr);
H A DSimplifyIndVar.h60 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, LPPassManager *LPM,
65 bool simplifyLoopIVs(Loop *L, ScalarEvolution *SE, LPPassManager *LPM,
/external/llvm/lib/Transforms/Scalar/
H A DIndVarSimplify.cpp73 ScalarEvolution *SE; member in class:__anon26282::IndVarSimplify
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
663 visitIVCast(CastInst *Cast, WideIVInfo &WI, ScalarEvolution *SE, const DataLayout *DL) argument
718 ScalarEvolution *SE; member in class:__anon26284::WidenIV
1125 ScalarEvolution *SE; member in class:__anon26285::IndVarSimplifyVisitor
1202 isHighCostExpansion(const SCEV *S, BranchInst *BI, SmallPtrSet<const SCEV*, 8> &Processed, ScalarEvolution *SE) argument
1261 canExpandBackedgeTakenCount(Loop *L, ScalarEvolution *SE) argument
1443 FindLoopCounter(Loop *L, const SCEV *BECount, ScalarEvolution *SE, DominatorTree *DT, const DataLayout *DL) argument
1525 genLoopLimit(PHINode *IndVar, const SCEV *IVCount, Loop *L, SCEVExpander &Rewriter, ScalarEvolution *SE) argument
[all...]
H A DLoopStrengthReduce.cpp265 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
289 DoInitialMatch(const SCEV *S, Loop *L, SmallVectorImpl<const SCEV *> &Good, SmallVectorImpl<const SCEV *> &Bad, ScalarEvolution &SE) argument
347 InitialMatch(const SCEV *S, Loop *L, ScalarEvolution &SE) argument
499 isAddRecSExtable(const SCEVAddRecExpr *AR, ScalarEvolution &SE) argument
507 isAddSExtable(const SCEVAddExpr *A, ScalarEvolution &SE) argument
515 isMulSExtable(const SCEVMulExpr *M, ScalarEvolution &SE) argument
528 getExactSDiv(const SCEV *LHS, const SCEV *RHS, ScalarEvolution &SE, bool IgnoreSignificantBits = false) argument
620 ExtractImmediate(const SCEV *&S, ScalarEvolution &SE) argument
647 ExtractSymbol(const SCEV *&S, ScalarEvolution &SE) argument
725 isExistingPhi(const SCEVAddRecExpr *AR, ScalarEvolution &SE) argument
746 isHighCostExpansion(const SCEV *S, SmallPtrSet<const SCEV*, 8> &Processed, ScalarEvolution &SE) argument
921 RateRegister(const SCEV *Reg, SmallPtrSet<const SCEV *, 16> &Regs, const Loop *L, ScalarEvolution &SE, DominatorTree &DT) argument
969 RatePrimaryRegister(const SCEV *Reg, SmallPtrSet<const SCEV *, 16> &Regs, const Loop *L, ScalarEvolution &SE, DominatorTree &DT, SmallPtrSet<const SCEV *, 16> *LoserRegs) argument
985 RateFormula(const TargetTransformInfo &TTI, const Formula &F, SmallPtrSet<const SCEV *, 16> &Regs, const DenseSet<const SCEV *> &VisitedRegs, const Loop *L, const SmallVectorImpl<int64_t> &Offsets, ScalarEvolution &SE, DominatorTree &DT, const LSRUse &LU, SmallPtrSet<const SCEV *, 16> *LoserRegs) argument
1562 isAlwaysFoldable(const TargetTransformInfo &TTI, ScalarEvolution &SE, int64_t MinOffset, int64_t MaxOffset, LSRUse::KindType Kind, Type *AccessTy, const SCEV *S, bool HasBaseReg) argument
1658 ScalarEvolution &SE; member in class:__anon26302::LSRInstance
2449 findIVOperand(User::op_iterator OI, User::op_iterator OE, Loop *L, ScalarEvolution &SE) argument
2530 isProfitableIncrement(const SCEV *OperExpr, const SCEV *IncExpr, ScalarEvolution &SE) argument
2560 isProfitableChain(IVChain &Chain, SmallPtrSet<Instruction*, 4> &Users, ScalarEvolution &SE, const TargetTransformInfo &TTI) argument
3205 CollectSubexprs(const SCEV *S, const SCEVConstant *C, SmallVectorImpl<const SCEV *> &Ops, const Loop *L, ScalarEvolution &SE, unsigned Depth = 0) argument
[all...]
H A DLoopIdiomRecognize.cpp135 ScalarEvolution *SE; member in class:__anon26291::LoopIdiomRecognize
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, argument
241 // Before we touch this instruction, remove it from SE!
247 SE.forgetValue(DeadInst);
268 static void deleteIfDeadInstruction(Value *V, ScalarEvolution &SE, argument
272 deleteDeadInstruction(I, SE, TL
496 ScalarEvolution *SE = LIR.getScalarEvolution(); local
[all...]
H A DLoopRerollPass.cpp144 ScalarEvolution *SE; member in class:__anon26293::LoopReroll
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/include/llvm/Analysis/
H A DScalarEvolutionNormalization.h73 ScalarEvolution &SE,
H A DScalarEvolutionExpressions.h305 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,
495 ScalarEvolution *SE; member in class:llvm::SCEVUnknown
641 rewrite(const SCEV *Scev, ScalarEvolution &SE, ValueToValueMap &Map, bool InterpretConsts = false) argument
726 ScalarEvolution &SE; member in struct:llvm::SCEVParameterRewriter
738 rewrite(const SCEV *Scev, LoopToScevMapT &Map, ScalarEvolution &SE) argument
822 ScalarEvolution &SE; member in struct:llvm::SCEVApplyRewriter
827 apply(const SCEV *Scev, LoopToScevMapT &Map, ScalarEvolution &SE) argument
[all...]
/external/llvm/lib/CodeGen/
H A DEdgeBundles.cpp48 SE = MBB.succ_end(); SI != SE; ++SI)
85 SE = MBB.succ_end(); SI != SE; ++SI)
/external/clang/lib/StaticAnalyzer/Core/
H A DSimpleConstraintManager.cpp29 const SymExpr *SE = SymVal->getSymbol(); local
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
[all...]
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DSymbolManager.h81 symbol_iterator(const SymExpr *SE);
117 static inline bool classof(const SymExpr *SE) { argument
118 Kind k = SE->getKind();
147 static inline bool classof(const SymExpr *SE) { argument
148 return SE->getKind() == RegionValueKind;
193 static inline bool classof(const SymExpr *SE) { argument
194 return SE->getKind() == ConjuredKind;
227 static inline bool classof(const SymExpr *SE) { argument
228 return SE->getKind() == DerivedKind;
258 static inline bool classof(const SymExpr *SE) { argument
303 classof(const SymExpr *SE) argument
339 classof(const SymExpr *SE) argument
361 classof(const SymExpr *SE) argument
397 classof(const SymExpr *SE) argument
432 classof(const SymExpr *SE) argument
466 classof(const SymExpr *SE) argument
670 operator <<(raw_ostream &os, const clang::ento::SymExpr *SE) argument
[all...]
/external/clang/lib/StaticAnalyzer/Checkers/
H A DVLASizeChecker.cpp93 const Expr *SE = VLA->getSizeExpr(); local
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/
H A DRegionCode.java54 static final String SE = "SE"; field in class:RegionCode

Completed in 1176 milliseconds

1234567