Searched refs:MaxIter (Results 1 – 9 of 9) sorted by relevance
| /llvm-project-15.0.7/llvm/include/llvm/Transforms/ |
| H A D | Vectorize.h | 92 unsigned MaxIter; member
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Scalar/ |
| H A D | IndVarSimplify.cpp | 1364 const SCEV *MaxIter, bool Inverted, bool SkipLastIter, in optimizeLoopExitWithUnknownExitCount() argument
1397 auto *MaxIterTy = MaxIter->getType(); in optimizeLoopExitWithUnknownExitCount()
1400 MaxIter = SE->getZeroExtendExpr(MaxIter, ARTy); in optimizeLoopExitWithUnknownExitCount()
1404 if (SE->isKnownPredicateAt(ICmpInst::ICMP_ULE, MaxIter, MaxAllowedIter, BI)) in optimizeLoopExitWithUnknownExitCount()
1405 MaxIter = SE->getTruncateExpr(MaxIter, ARTy); in optimizeLoopExitWithUnknownExitCount()
1409 const SCEV *One = SE->getOne(MaxIter->getType()); in optimizeLoopExitWithUnknownExitCount()
1410 MaxIter = SE->getMinusSCEV(MaxIter, One); in optimizeLoopExitWithUnknownExitCount()
1415 L, BI, MaxIter); in optimizeLoopExitWithUnknownExitCount()
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | ModuloSchedule.cpp | 842 unsigned MaxIter = PrologBBs.size() - 1; in addBranches() local
843 for (unsigned i = 0, j = MaxIter; i <= MaxIter; ++i, --j) { in addBranches()
886 LoopInfo->setPreheader(PrologBBs[MaxIter]); in addBranches()
887 LoopInfo->adjustTripCount(-(MaxIter + 1)); in addBranches()
|
| /llvm-project-15.0.7/llvm/include/llvm/CodeGen/ |
| H A D | TargetInstrInfo.h | 786 unsigned Iter, unsigned MaxIter) const { in reduceLoopCount() argument
|
| /llvm-project-15.0.7/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolution.h | 1104 const SCEV *MaxIter);
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/GlobalISel/ |
| H A D | CombinerHelper.cpp | 3231 const unsigned MaxIter = in findCandidatesForLoadOrCombine() local
3233 for (unsigned Iter = 0; Iter < MaxIter; ++Iter) { in findCandidatesForLoadOrCombine()
3417 const unsigned MaxIter = 20; in findLoadOffsetsForLoadOrCombine() local
3425 if (Iter++ == MaxIter) in findLoadOffsetsForLoadOrCombine()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineCompares.cpp | 1028 unsigned MaxIter = 32; // Break cycles and bound to constant-time. in foldAllocaCmp() local
1032 if (Worklist.size() >= MaxIter) in foldAllocaCmp()
1039 assert(Worklist.size() <= MaxIter); in foldAllocaCmp()
1042 --MaxIter; in foldAllocaCmp()
1074 if (Worklist.size() >= MaxIter) in foldAllocaCmp()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/ |
| H A D | SLPVectorizer.cpp | 10115 int MaxIter = MaxStoreLookup.getValue(); in vectorizeStores() local
10120 auto &&FindConsecutiveAccess = [this, &Stores, &Tails, &IterCnt, MaxIter, in vectorizeStores()
10123 if (IterCnt >= MaxIter) in vectorizeStores()
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | ScalarEvolution.cpp | 10777 const Instruction *CtxI, const SCEV *MaxIter) { in getLoopInvariantExitCondDuringFirstIterations() argument
10813 if (AR->getType() != MaxIter->getType()) in getLoopInvariantExitCondDuringFirstIterations()
10817 const SCEV *Last = AR->evaluateAtIteration(MaxIter, *this); in getLoopInvariantExitCondDuringFirstIterations()
|