Home
last modified time | relevance | path

Searched refs:SE (Results 1 – 25 of 944) sorted by relevance

12345678910>>...38

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
DInductiveRangeCheckElimination.cpp148 static bool parseRangeCheckICmp(Loop *L, ICmpInst *ICI, ScalarEvolution &SE,
153 extractRangeChecksFromCond(Loop *L, ScalarEvolution &SE, Use &ConditionUse,
198 bool isEmpty(ScalarEvolution &SE, bool IsSigned) const { in isEmpty() argument
202 return SE.isKnownPredicate(ICmpInst::ICMP_SGE, Begin, End); in isEmpty()
204 return SE.isKnownPredicate(ICmpInst::ICMP_UGE, Begin, End); in isEmpty()
215 Optional<Range> computeSafeIterationSpace(ScalarEvolution &SE,
225 extractRangeChecksFromBranch(BranchInst *BI, Loop *L, ScalarEvolution &SE,
231 ScalarEvolution &SE; member in __anonc70288ee0111::InductiveRangeCheckElimination
237 InductiveRangeCheckElimination(ScalarEvolution &SE, in InductiveRangeCheckElimination() argument
240 : SE(SE), BPI(BPI), DT(DT), LI(LI) {} in InductiveRangeCheckElimination()
[all …]
DIndVarSimplify.cpp138 ScalarEvolution *SE; member in __anon1871b7300111::IndVarSimplify
170 IndVarSimplify(LoopInfo *LI, ScalarEvolution *SE, DominatorTree *DT, in IndVarSimplify() argument
173 : LI(LI), SE(SE), DT(DT), DL(DL), TLI(TLI), TTI(TTI) {} in IndVarSimplify()
219 const SCEV *FromBase = SE->getPointerBase(SE->getSCEV(FromPtr)); in isValidRewrite()
220 const SCEV *ToBase = SE->getPointerBase(SE->getSCEV(ToPtr)); in isValidRewrite()
521 SE->forgetLoop(L); in rewriteNonIntegerIVs()
611 if (!SE->isSCEVable(PN->getType())) in rewriteLoopExitValues()
619 SE->forgetValue(PN); in rewriteLoopExitValues()
644 const SCEV *ExitValue = SE->getSCEVAtScope(Inst, L->getParentLoop()); in rewriteLoopExitValues()
646 !SE->isLoopInvariant(ExitValue, L) || in rewriteLoopExitValues()
[all …]
DAlignmentFromAssumptions.cpp95 ScalarEvolution *SE) { in getNewAlignmentDiff() argument
97 const SCEV *DiffUnitsSCEV = SE->getURemExpr(DiffSCEV, AlignSCEV); in getNewAlignmentDiff()
128 ScalarEvolution *SE) { in getNewAlignment() argument
129 const SCEV *PtrSCEV = SE->getSCEV(Ptr); in getNewAlignment()
130 const SCEV *DiffSCEV = SE->getMinusSCEV(PtrSCEV, AASCEV); in getNewAlignment()
134 DiffSCEV = SE->getNoopOrSignExtend(DiffSCEV, OffSCEV->getType()); in getNewAlignment()
138 DiffSCEV = SE->getMinusSCEV(DiffSCEV, OffSCEV); in getNewAlignment()
144 unsigned NewAlignment = getNewAlignmentDiff(DiffSCEV, AlignSCEV, SE); in getNewAlignment()
159 const SCEV *DiffIncSCEV = DiffARSCEV->getStepRecurrence(*SE); in getNewAlignment()
168 NewAlignment = getNewAlignmentDiff(DiffStartSCEV, AlignSCEV, SE); in getNewAlignment()
[all …]
DLoopPredication.cpp255 ScalarEvolution *SE; member in __anon2bc31f8b0111::LoopPredication
312 ScalarEvolution *SE, LoopInfo *LI, in LoopPredication() argument
314 : AA(AA), DT(DT), SE(SE), LI(LI), BPI(BPI) {}; in LoopPredication()
333 auto *SE = &getAnalysis<ScalarEvolutionWrapperPass>().getSE(); in runOnLoop() local
339 LoopPredication LP(AA, DT, SE, LI, &BPI); in runOnLoop()
365 LoopPredication LP(&AR.AA, &AR.DT, &AR.SE, &AR.LI, BPI); in run()
378 const SCEV *LHSS = SE->getSCEV(LHS); in parseLoopICmp()
381 const SCEV *RHSS = SE->getSCEV(RHS); in parseLoopICmp()
386 if (SE->isLoopInvariant(LHSS, L)) { in parseLoopICmp()
406 if (SE->isLoopInvariant(LHS, L) && SE->isLoopInvariant(RHS, L)) { in expandCheck()
[all …]
DLoopStrengthReduce.cpp364 void initialMatch(const SCEV *S, Loop *L, ScalarEvolution &SE);
393 ScalarEvolution &SE) { in DoInitialMatch() argument
395 if (SE.properlyDominates(S, L->getHeader())) { in DoInitialMatch()
403 DoInitialMatch(S, L, Good, Bad, SE); in DoInitialMatch()
410 DoInitialMatch(AR->getStart(), L, Good, Bad, SE); in DoInitialMatch()
411 DoInitialMatch(SE.getAddRecExpr(SE.getConstant(AR->getType(), 0), in DoInitialMatch()
412 AR->getStepRecurrence(SE), in DoInitialMatch()
415 L, Good, Bad, SE); in DoInitialMatch()
423 const SCEV *NewMul = SE.getMulExpr(Ops); in DoInitialMatch()
427 DoInitialMatch(NewMul, L, MyGood, MyBad, SE); in DoInitialMatch()
[all …]
DLoopDataPrefetch.cpp64 LoopDataPrefetch(AssumptionCache *AC, LoopInfo *LI, ScalarEvolution *SE, in LoopDataPrefetch() argument
67 : AC(AC), LI(LI), SE(SE), TTI(TTI), ORE(ORE) {} in LoopDataPrefetch()
98 ScalarEvolution *SE; member in __anon38c73ee40111::LoopDataPrefetch
147 const auto *ConstStride = dyn_cast<SCEVConstant>(AR->getStepRecurrence(*SE)); in isStrideLargeEnough()
160 ScalarEvolution *SE = &AM.getResult<ScalarEvolutionAnalysis>(F); in run() local
166 LoopDataPrefetch LDP(AC, LI, SE, TTI, ORE); in run()
184 ScalarEvolution *SE = &getAnalysis<ScalarEvolutionWrapperPass>().getSE(); in runOnFunction() local
192 LoopDataPrefetch LDP(AC, LI, SE, TTI, ORE); in runOnFunction()
273 const SCEV *LSCEV = SE->getSCEV(PtrValue); in runOnLoop()
288 const SCEV *PtrDiff = SE->getMinusSCEV(LSCEVAddRec, PrefLoad.second); in runOnLoop()
[all …]
DLoopUnrollAndJamPass.cpp156 LoopInfo *LI, ScalarEvolution &SE, in computeUnrollAndJamCount() argument
169 L, TTI, DT, LI, SE, EphValues, ORE, OuterTripCount, MaxTripCount, in computeUnrollAndJamCount()
262 const SCEV *LSCEV = SE.getSCEVAtScope(V, L); in computeUnrollAndJamCount()
263 if (SE.isLoopInvariant(LSCEV, L)) in computeUnrollAndJamCount()
279 ScalarEvolution &SE, const TargetTransformInfo &TTI, in tryToUnrollAndJamLoop() argument
298 gatherUnrollingPreferences(L, SE, TTI, nullptr, nullptr, OptLevel, None, in tryToUnrollAndJamLoop()
326 if (!isSafeToUnrollAndJam(L, SE, DT, DI)) { in tryToUnrollAndJamLoop()
374 unsigned OuterTripCount = SE.getSmallConstantTripCount(L, Latch); in tryToUnrollAndJamLoop()
375 unsigned OuterTripMultiple = SE.getSmallConstantTripMultiple(L, Latch); in tryToUnrollAndJamLoop()
376 unsigned InnerTripCount = SE.getSmallConstantTripCount(SubLoop, SubLoopLatch); in tryToUnrollAndJamLoop()
[all …]
DNaryReassociate.cpp173 auto *SE = &getAnalysis<ScalarEvolutionWrapperPass>().getSE(); in runOnFunction() local
177 return Impl.runImpl(F, AC, DT, SE, TLI, TTI); in runOnFunction()
184 auto *SE = &AM.getResult<ScalarEvolutionAnalysis>(F); in run() local
188 if (!runImpl(F, AC, DT, SE, TLI, TTI)) in run()
203 SE = SE_; in runImpl()
237 if (SE->isSCEVable(I->getType()) && isPotentiallyNaryReassociable(&*I)) { in doOneIteration()
238 const SCEV *OldSCEV = SE->getSCEV(&*I); in doOneIteration()
241 SE->forgetValue(&*I); in doOneIteration()
258 const SCEV *NewSCEV = SE->getSCEV(&*I); in doOneIteration()
374 IndexExprs.push_back(SE->getSCEV(*Index)); in tryReassociateGEPAtIndex()
[all …]
DLoopDeletion.cpp43 static bool isLoopDead(Loop *L, ScalarEvolution &SE, in isLoopDead() argument
77 SE.forgetLoopDispositions(L); in isLoopDead()
137 ScalarEvolution &SE, LoopInfo &LI) { in deleteLoopIfDead() argument
167 deleteDeadLoop(L, &DT, &SE, &LI); in deleteLoopIfDead()
187 if (!isLoopDead(L, SE, ExitingBlocks, ExitBlock, Changed, Preheader)) { in deleteLoopIfDead()
195 const SCEV *S = SE.getConstantMaxBackedgeTakenCount(L); in deleteLoopIfDead()
203 deleteDeadLoop(L, &DT, &SE, &LI); in deleteLoopIfDead()
216 auto Result = deleteLoopIfDead(&L, AR.DT, AR.SE, AR.LI); in run()
256 ScalarEvolution &SE = getAnalysis<ScalarEvolutionWrapperPass>().getSE(); in runOnLoop() local
262 LoopDeletionResult Result = deleteLoopIfDead(L, DT, SE, LI); in runOnLoop()
/third_party/mbedtls/tests/suites/
Dtest_suite_psa_crypto_se_driver_hal_mocks.data1 SE init mock test: success
4 SE init mock test: failure
7 SE init mock test: invalid location (0)
10 SE init mock test: location not supported (INT_MAX)
13 SE key importing mock test
16 SE key importing mock test: max key bits
19 SE key importing mock test: more than max key bits
22 SE key importing mock test: alloc failed
25 SE key importing mock test: import failed
28 SE key exporting mock test
[all …]
Dtest_suite_psa_crypto_se_driver_hal.data1 Register SE driver: good
6 Register SE driver: good, again
9 Register SE driver: invalid location (0)
12 Register SE driver: invalid location (local)
15 Register SE driver: invalid version (ancient)
18 Register SE driver: invalid version (future)
21 Register SE driver: already registered
24 Register SE driver: maximum number of drivers
27 SE key import-export persistent (p_allocate allows all slots)
30 SE key import-export persistent (p_allocate allows 1 slot)
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/
DSimplifyIndVar.cpp55 ScalarEvolution *SE; member in __anon2702bc8b0111::SimplifyIndvar
63 SimplifyIndvar(Loop *Loop, ScalarEvolution *SE, DominatorTree *DT, in SimplifyIndvar() argument
66 : L(Loop), LI(LI), SE(SE), DT(DT), Rewriter(Rewriter), DeadInsts(Dead), in SimplifyIndvar()
132 assert(SE->isSCEVable(IVSrc->getType()) && "Expect SCEVable IV operand"); in foldIVUser()
144 FoldedExpr = SE->getUDivExpr(SE->getSCEV(IVSrc), SE->getSCEV(D)); in foldIVUser()
148 SE->getSCEV(IVSrc) != SE->getMulExpr(FoldedExpr, SE->getSCEV(D))) in foldIVUser()
152 if (!SE->isSCEVable(UseInst->getType())) in foldIVUser()
156 if (SE->getSCEV(UseInst) != FoldedExpr) in foldIVUser()
163 assert(SE->getSCEV(UseInst) == FoldedExpr && "bad SCEV with folded oper"); in foldIVUser()
189 const SCEV *S = SE->getSCEVAtScope(ICmp->getOperand(IVOperIdx), ICmpLoop); in makeIVComparisonInvariant()
[all …]
DLCSSA.cpp80 ScalarEvolution *SE) { in formLCSSAForInstructions() argument
142 if (SE) in formLCSSAForInstructions()
143 SE->forgetValue(I); in formLCSSAForInstructions()
322 ScalarEvolution *SE) { in formLCSSA() argument
372 Changed = formLCSSAForInstructions(Worklist, DT, *LI, SE); in formLCSSA()
377 if (SE && Changed) in formLCSSA()
378 SE->forgetLoop(&L); in formLCSSA()
387 ScalarEvolution *SE) { in formLCSSARecursively() argument
392 Changed |= formLCSSARecursively(*SubLoop, DT, LI, SE); in formLCSSARecursively()
394 Changed |= formLCSSA(L, DT, LI, SE); in formLCSSARecursively()
[all …]
DLoopUnrollPeel.cpp173 ScalarEvolution &SE) { in countToEliminateCompares() argument
192 const SCEV *LeftSCEV = SE.getSCEV(LeftVal); in countToEliminateCompares()
193 const SCEV *RightSCEV = SE.getSCEV(RightVal); in countToEliminateCompares()
197 if (SE.isKnownPredicate(Pred, LeftSCEV, RightSCEV) || in countToEliminateCompares()
198 SE.isKnownPredicate(ICmpInst::getInversePredicate(Pred), LeftSCEV, in countToEliminateCompares()
220 !SE.isMonotonicPredicate(LeftAR, Pred, Increasing)) in countToEliminateCompares()
229 SE.getConstant(LeftSCEV->getType(), NewPeelCount), SE); in countToEliminateCompares()
234 if (!SE.isKnownPredicate(Pred, IterVal, RightSCEV)) in countToEliminateCompares()
237 const SCEV *Step = LeftAR->getStepRecurrence(SE); in countToEliminateCompares()
238 const SCEV *NextIterVal = SE.getAddExpr(IterVal, Step); in countToEliminateCompares()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DScalarEvolutionExpander.cpp80 assert(SE.DT.dominates(Ret, &*BIP)); in ReuseOrCreateCast()
115 assert(SE.getTypeSizeInBits(V->getType()) == SE.getTypeSizeInBits(Ty) && in InsertNoopCastOfTo()
129 SE.getTypeSizeInBits(Ty) == SE.getTypeSizeInBits(V->getType())) { in InsertNoopCastOfTo()
133 SE.getTypeSizeInBits(CI->getType()) == in InsertNoopCastOfTo()
134 SE.getTypeSizeInBits(CI->getOperand(0)->getType())) in InsertNoopCastOfTo()
139 SE.getTypeSizeInBits(CE->getType()) == in InsertNoopCastOfTo()
140 SE.getTypeSizeInBits(CE->getOperand(0)->getType())) in InsertNoopCastOfTo()
217 while (const Loop *L = SE.LI.getLoopFor(Builder.GetInsertBlock())) { in InsertBinop()
244 const SCEV *Factor, ScalarEvolution &SE, in FactorOutConstant() argument
252 S = SE.getConstant(S->getType(), 1); in FactorOutConstant()
[all …]
DLoopCacheAnalysis.cpp76 const Loop &L, ScalarEvolution &SE) { in isOneDimensionalArray() argument
85 const SCEV *Step = AR->getStepRecurrence(SE); in isOneDimensionalArray()
90 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isOneDimensionalArray()
93 return AR->getStepRecurrence(SE) == &ElemSize; in isOneDimensionalArray()
98 static const SCEV *computeTripCount(const Loop &L, ScalarEvolution &SE) { in computeTripCount() argument
99 const SCEV *BackedgeTakenCount = SE.getBackedgeTakenCount(&L); in computeTripCount()
104 return SE.getAddExpr(BackedgeTakenCount, in computeTripCount()
105 SE.getOne(BackedgeTakenCount->getType())); in computeTripCount()
130 const LoopInfo &LI, ScalarEvolution &SE) in IndexedReference() argument
131 : StoreOrLoadInst(StoreOrLoadInst), SE(SE) { in IndexedReference()
[all …]
DDependenceAnalysis.cpp128 auto &SE = FAM.getResult<ScalarEvolutionAnalysis>(F); in run() local
130 return DependenceInfo(&F, &AA, &SE, &LI); in run()
156 auto &SE = getAnalysis<ScalarEvolutionWrapperPass>().getSE(); in runOnFunction() local
158 info.reset(new DependenceInfo(&F, &AA, &SE, &LI)); in runOnFunction()
364 return SE->getNegativeSCEV(C); in getD()
395 A = SE->getOne(D->getType()); in setDistance()
396 B = SE->getNegativeSCEV(A); in setDistance()
397 C = SE->getNegativeSCEV(D); in setDistance()
404 SE = NewSE; in setAny()
484 const SCEV *Prod1 = SE->getMulExpr(X->getA(), Y->getB()); in intersectConstraints()
[all …]
DScalarEvolutionNormalization.cpp39 ScalarEvolution &SE) in NormalizeDenormalizeRewriter()
40 : SCEVRewriteVisitor<NormalizeDenormalizeRewriter>(SE), Kind(Kind), in NormalizeDenormalizeRewriter()
54 return SE.getAddRecExpr(Operands, AR->getLoop(), SCEV::FlagAnyWrap); in visitAddRecExpr()
66 Operands[i] = SE.getAddExpr(Operands[i], Operands[i + 1]); in visitAddRecExpr()
90 Operands[i] = SE.getMinusSCEV(Operands[i], Operands[i + 1]); in visitAddRecExpr()
93 return SE.getAddRecExpr(Operands, AR->getLoop(), SCEV::FlagAnyWrap); in visitAddRecExpr()
98 ScalarEvolution &SE) { in normalizeForPostIncUse() argument
102 return NormalizeDenormalizeRewriter(Normalize, Pred, SE).visit(S); in normalizeForPostIncUse()
106 ScalarEvolution &SE) { in normalizeForPostIncUseIf() argument
107 return NormalizeDenormalizeRewriter(Normalize, Pred, SE).visit(S); in normalizeForPostIncUseIf()
[all …]
DIVUsers.cpp42 return IVUsers(&L, &AR.AC, &AR.LI, &AR.DT, &AR.SE); in run()
61 ScalarEvolution *SE, LoopInfo *LI) { in isInteresting() argument
69 SE->getSCEVAtScope(AR, LI->getLoopFor(I->getParent())) != AR); in isInteresting()
73 return isInteresting(AR->getStart(), I, L, SE, LI) && in isInteresting()
74 !isInteresting(AR->getStepRecurrence(*SE), I, L, SE, LI); in isInteresting()
81 if (isInteresting(Op, I, L, SE, LI)) { in isInteresting()
177 if (!SE->isSCEVable(I->getType())) in AddUsersImpl()
189 uint64_t Width = SE->getTypeSizeInBits(I->getType()); in AddUsersImpl()
199 const SCEV *ISE = SE->getSCEV(I); in AddUsersImpl()
203 if (!isInteresting(ISE, I, L, SE, LI)) in AddUsersImpl()
[all …]
DScalarEvolutionAliasAnalysis.cpp34 const SCEV *AS = SE.getSCEV(const_cast<Value *>(LocA.Ptr)); in alias()
35 const SCEV *BS = SE.getSCEV(const_cast<Value *>(LocB.Ptr)); in alias()
43 if (SE.getEffectiveSCEVType(AS->getType()) == in alias()
44 SE.getEffectiveSCEVType(BS->getType())) { in alias()
45 unsigned BitWidth = SE.getTypeSizeInBits(AS->getType()); in alias()
54 const SCEV *BA = SE.getMinusSCEV(BS, AS); in alias()
59 if (ASizeInt.ule(SE.getUnsignedRange(BA).getUnsignedMin()) && in alias()
60 (-BSizeInt).uge(SE.getUnsignedRange(BA).getUnsignedMax())) in alias()
68 const SCEV *AB = SE.getMinusSCEV(AS, BS); in alias()
73 if (BSizeInt.ule(SE.getUnsignedRange(AB).getUnsignedMin()) && in alias()
[all …]
DLoopAccessAnalysis.cpp160 ScalarEvolution *SE = PSE.getSE(); in replaceSymbolicStrideSCEV() local
161 const auto *U = cast<SCEVUnknown>(SE->getSCEV(StrideVal)); in replaceSymbolicStrideSCEV()
163 static_cast<const SCEVConstant *>(SE->getOne(StrideVal->getType())); in replaceSymbolicStrideSCEV()
165 PSE.addPredicate(*SE->getEqualPredicate(U, CT)); in replaceSymbolicStrideSCEV()
196 ScalarEvolution *SE = PSE.getSE(); in insert() local
201 if (SE->isLoopInvariant(Sc, Lp)) in insert()
209 ScEnd = AR->evaluateAtIteration(Ex, *SE); in insert()
210 const SCEV *Step = AR->getStepRecurrence(*SE); in insert()
221 ScStart = SE->getUMinExpr(ScStart, ScEnd); in insert()
222 ScEnd = SE->getUMaxExpr(AR->getStart(), ScEnd); in insert()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Instrumentation/
DBoundsChecking.cpp60 BuilderTy &IRB, ScalarEvolution &SE) { in getBoundsCheckCond() argument
79 auto SizeRange = SE.getUnsignedRange(SE.getSCEV(Size)); in getBoundsCheckCond()
80 auto OffsetRange = SE.getUnsignedRange(SE.getSCEV(Offset)); in getBoundsCheckCond()
81 auto NeededSizeRange = SE.getUnsignedRange(SE.getSCEV(NeededSizeVal)); in getBoundsCheckCond()
144 ScalarEvolution &SE) { in addBoundsChecking() argument
158 ObjSizeEval, IRB, SE); in addBoundsChecking()
161 DL, TLI, ObjSizeEval, IRB, SE); in addBoundsChecking()
164 DL, TLI, ObjSizeEval, IRB, SE); in addBoundsChecking()
167 TLI, ObjSizeEval, IRB, SE); in addBoundsChecking()
211 auto &SE = AM.getResult<ScalarEvolutionAnalysis>(F); in run() local
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DScalarEvolutionExpressions.h313 const SCEV *getStepRecurrence(ScalarEvolution &SE) const { in getStepRecurrence() argument
315 return SE.getAddRecExpr(SmallVector<const SCEV *, 3>(op_begin()+1, in getStepRecurrence()
346 const SCEV *evaluateAtIteration(const SCEV *It, ScalarEvolution &SE) const;
355 ScalarEvolution &SE) const;
359 const SCEVAddRecExpr *getPostIncExpr(ScalarEvolution &SE) const;
472 ScalarEvolution *SE; variable
480 SCEV(ID, scUnknown, 1), CallbackVH(V), SE(se), Next(next) {} in SCEVUnknown()
651 ScalarEvolution &SE;
660 SCEVRewriteVisitor(ScalarEvolution &SE) : SE(SE) {} in SCEVRewriteVisitor() argument
680 : SE.getTruncateExpr(Operand, Expr->getType()); in visitTruncateExpr()
[all …]
DScalarEvolutionAliasAnalysis.h27 ScalarEvolution &SE; variable
30 explicit SCEVAAResult(ScalarEvolution &SE) : AAResultBase(), SE(SE) {} in SCEVAAResult() argument
31 SCEVAAResult(SCEVAAResult &&Arg) : AAResultBase(std::move(Arg)), SE(Arg.SE) {} in SCEVAAResult()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Transforms/Utils/
DUnrollLoop.h82 ScalarEvolution *SE, DominatorTree *DT,
90 ScalarEvolution *SE, DominatorTree *DT,
96 unsigned &TripCount, ScalarEvolution &SE);
100 bool peelLoop(Loop *L, unsigned PeelCount, LoopInfo *LI, ScalarEvolution *SE,
105 LoopInfo *LI, ScalarEvolution *SE,
110 bool isSafeToUnrollAndJam(Loop *L, ScalarEvolution &SE, DominatorTree &DT,
114 DominatorTree &DT, LoopInfo *LI, ScalarEvolution &SE,
125 ScalarEvolution *SE, DominatorTree *DT,
131 Loop *L, ScalarEvolution &SE, const TargetTransformInfo &TTI,

12345678910>>...38