Lines Matching refs:getLoop
269 AR->getLoop()->getHeader()->printAsOperand(OS, /*PrintType=*/false); in print()
684 const Loop *LLoop = LA->getLoop(), *RLoop = RA->getLoop(); in CompareSCEVComplexity()
951 Quotient = SE.getAddRecExpr(StartQ, StepQ, Numerator->getLoop(), in visitAddRecExpr()
953 Remainder = SE.getAddRecExpr(StartR, StepR, Numerator->getLoop(), in visitAddRecExpr()
1289 return getAddRecExpr(Operands, AddRec->getLoop(), SCEV::FlagAnyWrap); in getTruncateExpr()
1402 const Loop *L = AR->getLoop(); in getPreStartForExtend()
1652 const Loop *L = AR->getLoop(); in getZeroExtendExpr()
1996 const Loop *L = AR->getLoop(); in getSignExtendExpr()
2193 return getAddRecExpr(Ops, AR->getLoop(), SCEV::FlagNW); in getAnyExtendExpr()
2658 const Loop *AddRecLoop = AddRec->getLoop(); in getAddExpr()
2705 cast<SCEVAddRecExpr>(Ops[OtherIdx])->getLoop()->getHeader(), in getAddExpr()
2706 AddRec->getLoop()->getHeader()) && in getAddExpr()
2708 if (AddRecLoop == cast<SCEVAddRecExpr>(Ops[OtherIdx])->getLoop()) { in getAddExpr()
2715 if (OtherAddRec->getLoop() == AddRecLoop) { in getAddExpr()
2950 return getAddRecExpr(Operands, AddRec->getLoop(), in getMulExpr()
2996 const Loop *AddRecLoop = AddRec->getLoop(); in getMulExpr()
3054 if (!OtherAddRec || OtherAddRec->getLoop() != AddRecLoop) in getMulExpr()
3093 const SCEV *NewAddRec = getAddRecExpr(AddRecOps, AddRec->getLoop(), in getMulExpr()
3181 AR->getLoop(), SCEV::FlagAnyWrap)) { in getUDivExpr()
3185 return getAddRecExpr(Operands, AR->getLoop(), SCEV::FlagNW); in getUDivExpr()
3195 AR->getLoop(), SCEV::FlagAnyWrap)) { in getUDivExpr()
3200 AR->getLoop(), SCEV::FlagNW); in getUDivExpr()
3357 if (StepChrec->getLoop() == L) { in getAddRecExpr()
3397 const Loop *NestedLoop = NestedAR->getLoop(); in getAddRecExpr()
4241 if (Expr->getLoop() == L) in visitAddRecExpr()
4282 if (Expr->getLoop() == L) in visitAddRecExpr()
4398 if (Expr->getLoop() == L && Expr->isAffine()) in visitAddRecExpr()
5090 cast<SCEVAddRecExpr>(Accum)->getLoop() == L)) { in createAddRecFromPHI()
5208 const auto *ARLoop = cast<SCEVAddRecExpr>(S)->getLoop(); in IsAvailableOnEntry()
5663 const SCEV *MaxBECount = getMaxBackedgeTakenCount(AddRec->getLoop()); in getRangeRef()
6011 if (!isLoopInvariant(OtherOp, AddRec->getLoop())) { in isSCEVExprNeverPoison()
6018 isGuaranteedToExecuteForEveryIteration(I, AddRec->getLoop())) in isSCEVExprNeverPoison()
7340 if (AddRec->getLoop() == L) { in computeExitLimitFromICmp()
8243 getAddRecExpr(NewOps, AddRec->getLoop(), in computeSCEVAtScope()
8256 if (!AddRec->getLoop()->contains(L)) { in computeSCEVAtScope()
8259 const SCEV *BackedgeTakenCount = getBackedgeTakenCount(AddRec->getLoop()); in computeSCEVAtScope()
8647 if (!AddRec || AddRec->getLoop() != L) in howFarToZero()
8731 loopHasNoAbnormalExits(AddRec->getLoop())) { in howFarToZero()
8850 const Loop *L = AR->getLoop(); in SimplifyICmpOperands()
9110 const Loop *L = LHS->getLoop(); in isKnownOnEveryIteration()
9206 if (!ArLHS || ArLHS->getLoop() != L) in isLoopInvariantPredicate()
9797 if (LAR->getLoop() != MAR->getLoop()) in computeConstantDifference()
9861 const Loop *L = AddRecFoundLHS->getLoop(); in isImpliedCondOperandsViaNoOverflow()
9862 if (L != AddRecLHS->getLoop()) in isImpliedCondOperandsViaNoOverflow()
9994 } else if (RAR && RAR->getLoop()->getHeader() == LBB) { in isImpliedViaMerge()
10002 auto *RLoop = RAR->getLoop(); in isImpliedViaMerge()
10101 if (LAR->getLoop() != RAR->getLoop()) in IsKnownPredicateViaAddRecStart()
10508 if (!IV || IV->getLoop() != L || !IV->isAffine()) in howManyLessThans()
10648 if (!IV || IV->getLoop() != L || !IV->isAffine()) in howManyGreaterThans()
10718 const SCEV *Shifted = SE.getAddRecExpr(Operands, getLoop(), in getNumIterationsInRange()
10800 return cast<SCEVAddRecExpr>(SE.getAddRecExpr(Ops, getLoop(), in getPostIncExpr()
11585 if (AR->getLoop() == L) in computeLoopDisposition()
11593 if (DT.dominates(L->getHeader(), AR->getLoop()->getHeader())) in computeLoopDisposition()
11595 assert(!L->contains(AR->getLoop()) && "Containing loop's header does not" in computeLoopDisposition()
11599 if (AR->getLoop()->contains(L)) in computeLoopDisposition()
11692 if (!DT.dominates(AR->getLoop()->getHeader(), BB)) in computeBlockDisposition()
11806 LoopsUsed.insert(AR->getLoop()); in getUsedLoops()
12039 if (AR && AR->getLoop() == L && AR->isAffine()) { in visitZeroExtendExpr()
12055 if (AR && AR->getLoop() == L && AR->isAffine()) { in visitSignExtendExpr()
12106 if (L != AR->getLoop()) in convertToAddRecWithPreds()