HomeSort by: relevance | last modified time | path
    Searched refs:MaxIter (Results 1 - 9 of 9) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/
Vectorize.h 92 unsigned MaxIter;
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
IndVarSimplify.cpp 1331 const SCEV *MaxIter, bool Inverted, bool SkipLastIter,
1365 auto *MaxIterTy = MaxIter->getType();
1368 MaxIter = SE->getZeroExtendExpr(MaxIter, ARTy);
1372 if (SE->isKnownPredicateAt(ICmpInst::ICMP_ULE, MaxIter, MaxAllowedIter, BI))
1373 MaxIter = SE->getTruncateExpr(MaxIter, ARTy);
1377 const SCEV *One = SE->getOne(MaxIter->getType());
1378 MaxIter = SE->getMinusSCEV(MaxIter, One)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
ModuloSchedule.cpp 860 unsigned MaxIter = PrologBBs.size() - 1;
861 for (unsigned i = 0, j = MaxIter; i <= MaxIter; ++i, --j) {
904 LoopInfo->setPreheader(PrologBBs[MaxIter]);
905 LoopInfo->adjustTripCount(-(MaxIter + 1));
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
TargetInstrInfo.h 760 unsigned Iter, unsigned MaxIter) const {
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/
CombinerHelper.cpp 3345 const unsigned MaxIter =
3347 for (unsigned Iter = 0; Iter < MaxIter; ++Iter) {
3528 // MaxIter is chosen based off the (worst case) number of iterations it
3532 const unsigned MaxIter = 20;
3540 if (Iter++ == MaxIter)
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/
InstCombineCompares.cpp 1006 unsigned MaxIter = 32; // Break cycles and bound to constant-time.
1010 if (Worklist.size() >= MaxIter)
1017 assert(Worklist.size() <= MaxIter);
1020 --MaxIter;
1052 if (Worklist.size() >= MaxIter)
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
ScalarEvolution.h 999 /// respect to L at given Context during at least first MaxIter iterations,
1008 const SCEV *MaxIter);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
SLPVectorizer.cpp 6617 int MaxIter = MaxStoreLookup.getValue();
6622 auto &&FindConsecutiveAccess = [this, &Stores, &Tails, &IterCnt, MaxIter,
6625 if (IterCnt >= MaxIter)
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
ScalarEvolution.cpp 9804 const Instruction *Context, const SCEV *MaxIter) {
9808 // - No overflow will happen during first MaxIter iterations;
9809 // - It will not fail on the MaxIter'th iteration.
9837 // Type mismatch here means that MaxIter is potentially larger than max
9840 if (AR->getType() != MaxIter->getType())
9844 const SCEV *Last = AR->evaluateAtIteration(MaxIter, *this);
9848 // Because step is +/- 1 and MaxIter has same type as Start (i.e. it does

Completed in 47 milliseconds