| /external/llvm/include/llvm/Analysis/ |
| LoopDependenceAnalysis.h | 40 ScalarEvolution *SE;
|
| IVUsers.h | 125 ScalarEvolution *SE;
|
| ScalarEvolutionExpander.h | 38 ScalarEvolution &SE;
92 explicit SCEVExpander(ScalarEvolution &se, const char *name)
93 : SE(se), IVName(name), IVIncInsertLoop(0), IVIncInsertPos(0),
95 Builder(se.getContext(), TargetFolder(se.TD)) {
189 LLVMContext &getContext() const { return SE.getContext(); }
|
| ScalarEvolution.h | 209 ScalarEvolution *SE;
213 SCEVCallbackVH(Value *V, ScalarEvolution *SE = 0);
331 const SCEV *getExact(ScalarEvolution *SE) const;
337 const SCEV *getExact(BasicBlock *ExitingBlock, ScalarEvolution *SE) const;
340 const SCEV *getMax(ScalarEvolution *SE) const;
[all...] |
| 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/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...] |
| 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...] |
| ProfileInfo.cpp | 98 succ_const_iterator SI = succ_begin(BB), SE = succ_end(BB);
101 if (SI == SE) {
107 for (; SI != SE; ++SI)
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopUnrollPass.cpp | 135 ScalarEvolution *SE = &getAnalysis<ScalarEvolution>();
159 TripCount = SE->getSmallConstantTripCount(L, LatchBlock);
160 TripMultiple = SE->getSmallConstantTripMultiple(L, LatchBlock);
|
| 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...] |
| 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...] |
| /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()));
|
| IdempotentOperationChecker.cpp | 660 const UnaryExprOrTypeTraitExpr *SE =
662 if (SE->getKind() != UETT_SizeOf)
664 return SE->getTypeOfArgument()->isVariableArrayType();
|
| /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...] |
| SymbolManager.cpp | 118 SymExpr::symbol_iterator::symbol_iterator(const SymExpr *SE) {
119 itr.push_back(SE);
134 const SymExpr *SE = itr.back();
137 switch (SE->getKind()) {
145 itr.push_back(cast<SymbolCast>(SE)->getOperand());
148 itr.push_back(cast<SymIntExpr>(SE)->getLHS());
151 itr.push_back(cast<IntSymExpr>(SE)->getRHS());
154 const SymSymExpr *x = cast<SymSymExpr>(SE);
|
| /external/llvm/lib/Transforms/Utils/ |
| 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...] |
| 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...] |
| LoopSimplify.cpp | 78 ScalarEvolution *SE;
132 SE = getAnalysisIfAvailable<ScalarEvolution>();
170 for (succ_iterator SI = succ_begin(*I), SE = succ_end(*I); SI != SE; ++SI)
271 if (SE) SE->forgetValue(PN);
334 if (SE)
335 SE->forgetLoop(L);
570 if (SE)
571 SE->forgetLoop(L)
[all...] |
| /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/clang/lib/ARCMigrate/ |
| TransAutoreleasePool.cpp | 302 Stmt::child_iterator SI = scope.End, SE = compoundS->body_end();
306 if (SI != SE)
315 for (; SI != SE; ++SI) {
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| SVals.h | 147 const SymExpr *SE = getAsSymbolicExpression();
148 if (SE)
149 return SE->symbol_begin();
|
| /external/llvm/lib/CodeGen/ |
| RegAllocGreedy.cpp | 172 std::auto_ptr<SplitEditor> SE;
[all...] |
| /libcore/luni/src/test/java/libcore/java/util/ |
| EnumSetTest.java | 103 FE, CO, NI, CU, ZN, GA, GE, AS, SE, BR, KR, RB, SR, Y, ZR, NB, MO, TC, RU, RH, PD, AG, CD,
|
| /bionic/libc/include/arpa/ |
| telnet.h | 53 #define SE 240 /* end sub negotiation */
64 "SE", "NOP", "DMARK", "BRK", "IP", "AO", "AYT", "EC",
|
| /development/ndk/platforms/android-9/include/arpa/ |
| telnet.h | 53 #define SE 240 /* end sub negotiation */
64 "SE", "NOP", "DMARK", "BRK", "IP", "AO", "AYT", "EC",
|
