| /external/llvm/include/llvm/Analysis/ |
| LoopDependenceAnalysis.h | 40 ScalarEvolution *SE;
|
| IVUsers.h | 125 ScalarEvolution *SE;
|
| ScalarEvolutionExpander.h | 32 ScalarEvolution &SE;
83 explicit SCEVExpander(ScalarEvolution &se, const char *name)
84 : SE(se), IVName(name), IVIncInsertLoop(0), IVIncInsertPos(0),
86 Builder(se.getContext(), TargetFolder(se.TD)) {
165 LLVMContext &getContext() const { return SE.getContext(); }
|
| ScalarEvolutionExpressions.h | 309 const SCEV *getStepRecurrence(ScalarEvolution &SE) const {
311 return SE.getAddRecExpr(SmallVector<const SCEV *, 3>(op_begin()+1,
342 const SCEV *evaluateAtIteration(const SCEV *It, ScalarEvolution &SE) const;
351 ScalarEvolution &SE) const;
355 const SCEVAddRecExpr *getPostIncExpr(ScalarEvolution &SE) const {
356 return cast<SCEVAddRecExpr>(SE.getAddExpr(this, getStepRecurrence(SE)));
422 /// SE - The parent ScalarEvolution value. This is used to update
425 ScalarEvolution *SE;
432 ScalarEvolution *se, SCEVUnknown *next)
[all...] |
| ScalarEvolution.h | 204 ScalarEvolution *SE;
208 SCEVCallbackVH(Value *V, ScalarEvolution *SE = 0);
319 const SCEV *getExact(ScalarEvolution *SE) const;
325 const SCEV *getExact(BasicBlock *ExitingBlock, ScalarEvolution *SE) const;
328 const SCEV *getMax(ScalarEvolution *SE) const;
[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);
125 TransformSubExpr(AR->getStepRecurrence(SE),
127 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/clang/lib/StaticAnalyzer/Checkers/ |
| VLASizeChecker.cpp | 51 const Expr *SE = VLA->getSizeExpr();
53 SVal sizeV = state->getSVal(SE);
67 report->addRange(SE->getSourceRange());
68 report->addVisitor(bugreporter::getTrackNullOrUndefValueVisitor(N, SE));
92 report->addRange(SE->getSourceRange());
93 report->addVisitor(bugreporter::getTrackNullOrUndefValueVisitor(N, SE));
109 SE->getType()));
|
| IdempotentOperationChecker.cpp | 657 const UnaryExprOrTypeTraitExpr *SE =
659 if (SE->getKind() != UETT_SizeOf)
661 return SE->getTypeOfArgument()->isVariableArrayType();
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| SimpleConstraintManager.cpp | 27 const SymExpr *SE = SymVal->getSymbolicExpression();
29 if (isa<SymbolData>(SE))
32 if (const SymIntExpr *SIE = dyn_cast<SymIntExpr>(SE)) {
173 const SymIntExpr *SE = dyn_cast<SymIntExpr>(V.getSymbolicExpression());
174 if (!SE)
177 BinaryOperator::Opcode op = SE->getOpcode();
180 QualType T = SymMgr.getType(SE);
183 return assumeSymRel(state, SE, op, zero);
190 return assumeSymRel(state, SE->getLHS(), op, SE->getRHS())
[all...] |
| SVals.cpp | 141 SVal::symbol_iterator::symbol_iterator(const SymExpr *SE) {
142 itr.push_back(SE);
161 const SymExpr *SE = itr.back();
164 if (const SymIntExpr *SIE = dyn_cast<SymIntExpr>(SE)) {
168 else if (const SymSymExpr *SSE = dyn_cast<SymSymExpr>(SE)) {
306 const SymExpr *SE = C.getSymbolicExpression();
307 os << SE;
|
| ExprEngineC.cpp | 470 const Expr *SE = (Expr*) cast<UndefinedVal>(X).getData();
471 assert(SE);
472 X = state->getSVal(SE);
|
| ExprEngine.cpp | 769 const StmtExpr *SE = cast<StmtExpr>(S);
771 if (SE->getSubStmt()->body_empty()) {
773 assert(SE->getType() == getContext().VoidTy
779 if (Expr *LastExpr = dyn_cast<Expr>(*SE->getSubStmt()->body_rbegin())) {
781 MakeNode(Dst, SE, Pred, state->BindExpr(SE, state->getSVal(LastExpr)));
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopUnrollPass.cpp | 131 ScalarEvolution *SE = &getAnalysis<ScalarEvolution>();
156 TripCount = SE->getSmallConstantTripCount(L, LatchBlock);
157 TripMultiple = SE->getSmallConstantTripMultiple(L, LatchBlock);
|
| LoopIdiomRecognize.cpp | 70 ScalarEvolution *SE;
135 static void deleteDeadInstruction(Instruction *I, ScalarEvolution &SE) {
140 // Before we touch this instruction, remove it from SE!
146 SE.forgetValue(DeadInst);
167 static void deleteIfDeadInstruction(Value *V, ScalarEvolution &SE) {
170 deleteDeadInstruction(I, SE);
182 SE = &getAnalysis<ScalarEvolution>();
183 if (!SE->hasLoopInvariantBackedgeTakenCount(L))
185 const SCEV *BECount = SE->getBackedgeTakenCount(L);
284 dyn_cast<SCEVAddRecExpr>(SE->getSCEV(StorePtr))
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| LoopUnroll.cpp | 98 if (ScalarEvolution *SE = LPM->getAnalysisIfAvailable<ScalarEvolution>()) {
100 SE->forgetLoop(L);
170 ScalarEvolution *SE = LPM->getAnalysisIfAvailable<ScalarEvolution>();
171 if (SE)
172 SE->forgetLoop(L);
274 for (succ_iterator SI = succ_begin(*BB), SE = succ_end(*BB);
275 SI != SE; ++SI) {
356 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB);
357 SI != SE; ++SI) {
388 if (SE && !CompletelyUnroll)
[all...] |
| SimplifyIndVar.cpp | 48 ScalarEvolution *SE;
57 SimplifyIndvar(Loop *Loop, ScalarEvolution *SE, LPPassManager *LPM,
61 SE(SE),
116 assert(SE->isSCEVable(IVSrc->getType()) && "Expect SCEVable IV operand");
128 FoldedExpr = SE->getUDivExpr(SE->getSCEV(IVSrc), SE->getSCEV(D));
131 if (!SE->isSCEVable(UseInst->getType()))
135 if (SE->getSCEV(UseInst) != FoldedExpr
[all...] |
| LoopSimplify.cpp | 78 ScalarEvolution *SE;
131 SE = getAnalysisIfAvailable<ScalarEvolution>();
169 for (succ_iterator SI = succ_begin(*I), SE = succ_end(*I); SI != SE; ++SI)
270 if (SE) SE->forgetValue(PN);
333 if (SE)
334 SE->forgetLoop(L);
555 if (SE)
556 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 | 305 Stmt::child_iterator SI = scope.End, SE = compoundS->body_end();
309 if (SI != SE)
318 for (; SI != SE; ++SI) {
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| SVals.h | 150 symbol_iterator(const SymExpr *SE);
160 const SymExpr *SE = getAsSymbolicExpression();
161 if (SE)
162 return symbol_iterator(SE);
297 explicit SymExprVal(const SymExpr *SE)
298 : NonLoc(SymExprValKind, reinterpret_cast<const void*>(SE)) {}
|
| /external/llvm/lib/CodeGen/ |
| RegAllocGreedy.cpp | 173 std::auto_ptr<SplitEditor> SE;
[all...] |
| /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",
|
