Lines Matching defs:Step

58 //       I.INC = I + Step
70 //       I.INC = I + Step
75 // One solution for M is M = forall X . (G(X) && B(X)) => G(X + Step)
95 //   So M = forall X . (G(X) && B(X)) => G(X + Step) implies G(I + Step).
273   bool isSupportedStep(const SCEV* Step);
477 bool LoopPredication::isSupportedStep(const SCEV* Step) {
478   return Step->isOne() || (Step->isAllOnesValue() && EnableCountDownLoop);
679   const SCEV *Step = RangeCheckIV->getStepRecurrence(*SE);
682   if (!isSupportedStep(Step)) {
698   assert(Step->getType() ==
701   if (Step != CurrLatchCheck.IV->getStepRecurrence(*SE)) {
706   if (Step->isOne())
710     assert(Step->isAllOnesValue() && "Step should be -1!");
847   const SCEV *Step = Result->IV->getStepRecurrence(*SE);
848   if (!isSupportedStep(Step)) {
849     LLVM_DEBUG(dbgs() << "Unsupported loop stride(" << *Step << ")!\n");
853   auto IsUnsupportedPredicate = [](const SCEV *Step, ICmpInst::Predicate Pred) {
854     if (Step->isOne()) {
858       assert(Step->isAllOnesValue() && "Step should be -1!");
865   if (IsUnsupportedPredicate(Step, Result->Pred)) {