Lines Matching refs:getLoop
316 AR->getLoop()->getHeader()->printAsOperand(OS, /*PrintType=*/false); in print()
741 const Loop *LLoop = LA->getLoop(), *RLoop = RA->getLoop(); in CompareSCEVComplexity()
1211 return getAddRecExpr(Operands, AddRec->getLoop(), SCEV::FlagAnyWrap); in getTruncateExpr()
1329 const Loop *L = AR->getLoop(); in getPreStartForExtend()
1623 const Loop *L = AR->getLoop(); in getZeroExtendExprImpl()
1997 const Loop *L = AR->getLoop(); in getSignExtendExprImpl()
2202 return getAddRecExpr(Ops, AR->getLoop(), SCEV::FlagNW); in getAnyExtendExpr()
2878 const Loop *AddRecLoop = AddRec->getLoop(); in getAddExpr()
2946 cast<SCEVAddRecExpr>(Ops[OtherIdx])->getLoop()->getHeader(), in getAddExpr()
2947 AddRec->getLoop()->getHeader()) && in getAddExpr()
2949 if (AddRecLoop == cast<SCEVAddRecExpr>(Ops[OtherIdx])->getLoop()) { in getAddExpr()
2955 if (OtherAddRec->getLoop() == AddRecLoop) { in getAddExpr()
3219 return getAddRecExpr(Operands, AddRec->getLoop(), in getMulExpr()
3263 if (isAvailableAtLoopEntry(Ops[i], AddRec->getLoop())) { in getMulExpr()
3296 const SCEV *NewRec = getAddRecExpr(NewOps, AddRec->getLoop(), Flags); in getMulExpr()
3330 if (!OtherAddRec || OtherAddRec->getLoop() != AddRec->getLoop()) in getMulExpr()
3369 const SCEV *NewAddRec = getAddRecExpr(AddRecOps, AddRec->getLoop(), in getMulExpr()
3471 AR->getLoop(), SCEV::FlagAnyWrap)) { in getUDivExpr()
3475 return getAddRecExpr(Operands, AR->getLoop(), SCEV::FlagNW); in getUDivExpr()
3485 AR->getLoop(), SCEV::FlagAnyWrap)) { in getUDivExpr()
3491 AR->getLoop(), SCEV::FlagNW); in getUDivExpr()
3654 if (StepChrec->getLoop() == L) { in getAddRecExpr()
3696 const Loop *NestedLoop = NestedAR->getLoop(); in getAddRecExpr()
4656 return getAddRecExpr(Ops, AddRec->getLoop(), SCEV::FlagAnyWrap); in removePointerBase()
4908 if (Expr->getLoop() == L) in visitAddRecExpr()
4949 if (Expr->getLoop() == L) in visitAddRecExpr()
5065 if (Expr->getLoop() == L && Expr->isAffine()) in visitAddRecExpr()
5093 const SCEV *BECount = getConstantMaxBackedgeTakenCount(AR->getLoop()); in proveNoWrapViaConstantRanges()
5142 const Loop *L = AR->getLoop(); in proveNoSignedWrapViaInduction()
5196 const Loop *L = AR->getLoop(); in proveNoUnsignedWrapViaInduction()
5874 cast<SCEVAddRecExpr>(Accum)->getLoop() == L)) { in createAddRecFromPHI()
6763 getConstantMaxBackedgeTakenCount(AddRec->getLoop()); in getRangeRef()
6791 getSymbolicMaxBackedgeTakenCount(AddRec->getLoop()); in getRangeRef()
7095 const SCEV *Start = applyLoopGuards(AddRec->getStart(), AddRec->getLoop()); in getRangeForAffineNoSelfWrappingAR()
7256 return &*AddRec->getLoop()->getHeader()->begin(); in getNonTrivialDefiningScopeBound()
8515 if (L->contains(AddRec->getLoop())) in forgetLcssaPhiWithNewPredecessor()
9163 if (AddRec->getLoop() == L) { in computeExitLimitFromICmp()
9185 if (!AR->hasNoSelfWrap() && AR->getLoop() == L && AR->isAffine() && in computeExitLimitFromICmp()
9875 return getAddRecExpr(NewOps, AddRec->getLoop(), AddRec->getNoWrapFlags()); in getWithOperands()
9927 NewOps, AddRec->getLoop(), AddRec->getNoWrapFlags(SCEV::FlagNW)); in computeSCEVAtScope()
9939 if (!AddRec->getLoop()->contains(L)) { in computeSCEVAtScope()
9942 const SCEV *BackedgeTakenCount = getBackedgeTakenCount(AddRec->getLoop()); in computeSCEVAtScope()
10456 if (!AddRec || AddRec->getLoop() != L) in howFarToZero()
10543 loopHasNoAbnormalExits(AddRec->getLoop())) { in howFarToZero()
10696 const Loop *L = AR->getLoop(); in SimplifyICmpOperands()
10986 const Loop *L = LHS->getLoop(); in isKnownOnEveryIteration()
11069 if (!ArLHS || ArLHS->getLoop() != L) in getLoopInvariantPredicate()
11182 if (!AR || AR->getLoop() != L) in getLoopInvariantExitCondDuringFirstIterationsImpl()
11957 if (LAR->getLoop() != MAR->getLoop()) in computeConstantDifference()
12024 const Loop *L = AR->getLoop(); in isImpliedCondOperandsViaAddRecStart()
12029 if (!isAvailableAtLoopEntry(FoundRHS, AR->getLoop())) in isImpliedCondOperandsViaAddRecStart()
12035 const Loop *L = AR->getLoop(); in isImpliedCondOperandsViaAddRecStart()
12040 if (!isAvailableAtLoopEntry(FoundLHS, AR->getLoop())) in isImpliedCondOperandsViaAddRecStart()
12066 const Loop *L = AddRecFoundLHS->getLoop(); in isImpliedCondOperandsViaNoOverflow()
12067 if (L != AddRecLHS->getLoop()) in isImpliedCondOperandsViaNoOverflow()
12199 } else if (RAR && RAR->getLoop()->getHeader() == LBB) { in isImpliedViaMerge()
12207 auto *RLoop = RAR->getLoop(); in isImpliedViaMerge()
12330 if (LAR->getLoop() != RAR->getLoop()) in IsKnownPredicateViaAddRecStart()
12813 if (AR && AR->getLoop() == L && AR->isAffine()) { in howManyLessThans()
12870 if (!IV || IV->getLoop() != L || !IV->isAffine()) in howManyLessThans()
13010 if (PositiveStride && RHSAddRec != nullptr && RHSAddRec->getLoop() == L && in howManyLessThans()
13272 if (!IV || IV->getLoop() != L || !IV->isAffine()) in howManyGreaterThans()
13365 const SCEV *Shifted = SE.getAddRecExpr(Operands, getLoop(), in getNumIterationsInRange()
13447 return cast<SCEVAddRecExpr>(SE.getAddRecExpr(Ops, getLoop(), in getPostIncExpr()
13862 if (AR->getLoop() == L) in computeLoopDisposition()
13870 if (DT.dominates(L->getHeader(), AR->getLoop()->getHeader())) in computeLoopDisposition()
13872 assert(!L->contains(AR->getLoop()) && "Containing loop's header does not" in computeLoopDisposition()
13876 if (AR->getLoop()->contains(L)) in computeLoopDisposition()
13963 if (!DT.dominates(AR->getLoop()->getHeader(), BB)) in computeBlockDisposition()
14128 LoopsUsed.insert(AR->getLoop()); in getUsedLoops()
14279 assert(ValidLoops.contains(AR->getLoop()) && in verify()
14636 if (AR && AR->getLoop() == L && AR->isAffine()) { in visitZeroExtendExpr()
14652 if (AR && AR->getLoop() == L && AR->isAffine()) { in visitSignExtendExpr()
14703 if (L != WP->getExpr()->getLoop()) in convertToAddRecWithPreds()