Lines Matching refs:getLoop
316 AR->getLoop()->getHeader()->printAsOperand(OS, /*PrintType=*/false); in print()
734 const Loop *LLoop = LA->getLoop(), *RLoop = RA->getLoop(); in CompareSCEVComplexity()
1209 return getAddRecExpr(Operands, AddRec->getLoop(), SCEV::FlagAnyWrap); in getTruncateExpr()
1327 const Loop *L = AR->getLoop(); in getPreStartForExtend()
1621 const Loop *L = AR->getLoop(); in getZeroExtendExprImpl()
1995 const Loop *L = AR->getLoop(); in getSignExtendExprImpl()
2200 return getAddRecExpr(Ops, AR->getLoop(), SCEV::FlagNW); in getAnyExtendExpr()
2876 const Loop *AddRecLoop = AddRec->getLoop(); in getAddExpr()
2944 cast<SCEVAddRecExpr>(Ops[OtherIdx])->getLoop()->getHeader(), in getAddExpr()
2945 AddRec->getLoop()->getHeader()) && in getAddExpr()
2947 if (AddRecLoop == cast<SCEVAddRecExpr>(Ops[OtherIdx])->getLoop()) { in getAddExpr()
2953 if (OtherAddRec->getLoop() == AddRecLoop) { in getAddExpr()
3217 return getAddRecExpr(Operands, AddRec->getLoop(), in getMulExpr()
3261 if (isAvailableAtLoopEntry(Ops[i], AddRec->getLoop())) { in getMulExpr()
3294 const SCEV *NewRec = getAddRecExpr(NewOps, AddRec->getLoop(), Flags); in getMulExpr()
3328 if (!OtherAddRec || OtherAddRec->getLoop() != AddRec->getLoop()) in getMulExpr()
3367 const SCEV *NewAddRec = getAddRecExpr(AddRecOps, AddRec->getLoop(), in getMulExpr()
3469 AR->getLoop(), SCEV::FlagAnyWrap)) { in getUDivExpr()
3473 return getAddRecExpr(Operands, AR->getLoop(), SCEV::FlagNW); in getUDivExpr()
3483 AR->getLoop(), SCEV::FlagAnyWrap)) { in getUDivExpr()
3489 AR->getLoop(), SCEV::FlagNW); in getUDivExpr()
3652 if (StepChrec->getLoop() == L) { in getAddRecExpr()
3694 const Loop *NestedLoop = NestedAR->getLoop(); in getAddRecExpr()
4651 return getAddRecExpr(Ops, AddRec->getLoop(), SCEV::FlagAnyWrap); in removePointerBase()
4903 if (Expr->getLoop() == L) in visitAddRecExpr()
4944 if (Expr->getLoop() == L) in visitAddRecExpr()
5060 if (Expr->getLoop() == L && Expr->isAffine()) in visitAddRecExpr()
5088 const SCEV *BECount = getConstantMaxBackedgeTakenCount(AR->getLoop()); in proveNoWrapViaConstantRanges()
5137 const Loop *L = AR->getLoop(); in proveNoSignedWrapViaInduction()
5191 const Loop *L = AR->getLoop(); in proveNoUnsignedWrapViaInduction()
5869 cast<SCEVAddRecExpr>(Accum)->getLoop() == L)) { in createAddRecFromPHI()
6747 getConstantMaxBackedgeTakenCount(AddRec->getLoop()); in getRangeRef()
6775 getSymbolicMaxBackedgeTakenCount(AddRec->getLoop()); in getRangeRef()
7079 const SCEV *Start = applyLoopGuards(AddRec->getStart(), AddRec->getLoop()); in getRangeForAffineNoSelfWrappingAR()
7240 return &*AddRec->getLoop()->getHeader()->begin(); in getNonTrivialDefiningScopeBound()
8494 if (L->contains(AddRec->getLoop())) in forgetLcssaPhiWithNewPredecessor()
9119 if (AddRec->getLoop() == L) { in computeExitLimitFromICmp()
9141 if (!AR->hasNoSelfWrap() && AR->getLoop() == L && AR->isAffine() && in computeExitLimitFromICmp()
9813 return getAddRecExpr(NewOps, AddRec->getLoop(), AddRec->getNoWrapFlags()); in getWithOperands()
9865 NewOps, AddRec->getLoop(), AddRec->getNoWrapFlags(SCEV::FlagNW)); in computeSCEVAtScope()
9877 if (!AddRec->getLoop()->contains(L)) { in computeSCEVAtScope()
9880 const SCEV *BackedgeTakenCount = getBackedgeTakenCount(AddRec->getLoop()); in computeSCEVAtScope()
10395 if (!AddRec || AddRec->getLoop() != L) in howFarToZero()
10481 loopHasNoAbnormalExits(AddRec->getLoop())) { in howFarToZero()
10608 const Loop *L = AR->getLoop(); in SimplifyICmpOperands()
10908 const Loop *L = LHS->getLoop(); in isKnownOnEveryIteration()
10991 if (!ArLHS || ArLHS->getLoop() != L) in getLoopInvariantPredicate()
11104 if (!AR || AR->getLoop() != L) in getLoopInvariantExitCondDuringFirstIterationsImpl()
11879 if (LAR->getLoop() != MAR->getLoop()) in computeConstantDifference()
11946 const Loop *L = AR->getLoop(); in isImpliedCondOperandsViaAddRecStart()
11951 if (!isAvailableAtLoopEntry(FoundRHS, AR->getLoop())) in isImpliedCondOperandsViaAddRecStart()
11957 const Loop *L = AR->getLoop(); in isImpliedCondOperandsViaAddRecStart()
11962 if (!isAvailableAtLoopEntry(FoundLHS, AR->getLoop())) in isImpliedCondOperandsViaAddRecStart()
11988 const Loop *L = AddRecFoundLHS->getLoop(); in isImpliedCondOperandsViaNoOverflow()
11989 if (L != AddRecLHS->getLoop()) in isImpliedCondOperandsViaNoOverflow()
12121 } else if (RAR && RAR->getLoop()->getHeader() == LBB) { in isImpliedViaMerge()
12129 auto *RLoop = RAR->getLoop(); in isImpliedViaMerge()
12252 if (LAR->getLoop() != RAR->getLoop()) in IsKnownPredicateViaAddRecStart()
12735 if (AR && AR->getLoop() == L && AR->isAffine()) { in howManyLessThans()
12792 if (!IV || IV->getLoop() != L || !IV->isAffine()) in howManyLessThans()
13146 if (!IV || IV->getLoop() != L || !IV->isAffine()) in howManyGreaterThans()
13239 const SCEV *Shifted = SE.getAddRecExpr(Operands, getLoop(), in getNumIterationsInRange()
13321 return cast<SCEVAddRecExpr>(SE.getAddRecExpr(Ops, getLoop(), in getPostIncExpr()
13700 if (AR->getLoop() == L) in computeLoopDisposition()
13708 if (DT.dominates(L->getHeader(), AR->getLoop()->getHeader())) in computeLoopDisposition()
13710 assert(!L->contains(AR->getLoop()) && "Containing loop's header does not" in computeLoopDisposition()
13714 if (AR->getLoop()->contains(L)) in computeLoopDisposition()
13801 if (!DT.dominates(AR->getLoop()->getHeader(), BB)) in computeBlockDisposition()
13966 LoopsUsed.insert(AR->getLoop()); in getUsedLoops()
14117 assert(ValidLoops.contains(AR->getLoop()) && in verify()
14474 if (AR && AR->getLoop() == L && AR->isAffine()) { in visitZeroExtendExpr()
14490 if (AR && AR->getLoop() == L && AR->isAffine()) { in visitSignExtendExpr()
14541 if (L != WP->getExpr()->getLoop()) in convertToAddRecWithPreds()