296     AR->getLoop()->getHeader()->printAsOperand(OS, /*PrintType=*/false);  in print()
742     const Loop *LLoop = LA->getLoop(), *RLoop = RA->getLoop();  in CompareSCEVComplexity()
1221     return getAddRecExpr(Operands, AddRec->getLoop(), SCEV::FlagAnyWrap);  in getTruncateExpr()
1334   const Loop *L = AR->getLoop();  in getPreStartForExtend()
1584       const Loop *L = AR->getLoop();  in getZeroExtendExpr()
1924       const Loop *L = AR->getLoop();  in getSignExtendExpr()
2104     return getAddRecExpr(Ops, AR->getLoop(), SCEV::FlagNW);  in getAnyExtendExpr()
2580     const Loop *AddRecLoop = AddRec->getLoop();  in getAddExpr()
2633            cast<SCEVAddRecExpr>(Ops[OtherIdx])->getLoop()->getHeader(),  in getAddExpr()
2634            AddRec->getLoop()->getHeader()) &&  in getAddExpr()
2636       if (AddRecLoop == cast<SCEVAddRecExpr>(Ops[OtherIdx])->getLoop()) {  in getAddExpr()
2643           if (OtherAddRec->getLoop() == AddRecLoop) {  in getAddExpr()
2894           return getAddRecExpr(Operands, AddRec->getLoop(),  in getMulExpr()
2937     const Loop *AddRecLoop = AddRec->getLoop();  in getMulExpr()
2996       if (!OtherAddRec || OtherAddRec->getLoop() != AddRecLoop)  in getMulExpr()
3131                             AR->getLoop(), SCEV::FlagAnyWrap)) {  in getUDivExpr()
3135             return getAddRecExpr(Operands, AR->getLoop(), SCEV::FlagNW);  in getUDivExpr()
3145                             AR->getLoop(), SCEV::FlagAnyWrap)) {  in getUDivExpr()
3151                                 AR->getLoop(), SCEV::FlagNW);  in getUDivExpr()
3320     if (StepChrec->getLoop() == L) {  in getAddRecExpr()
3360     const Loop *NestedLoop = NestedAR->getLoop();  in getAddRecExpr()
4225     if (Expr->getLoop() == L)  in visitAddRecExpr()
4266     if (Expr->getLoop() == L)  in visitAddRecExpr()
4382     if (Expr->getLoop() == L && Expr->isAffine())  in visitAddRecExpr()
4443   const Loop *L = AR->getLoop();  in proveNoSignedWrapViaInduction()
4493   const Loop *L = AR->getLoop();  in proveNoUnsignedWrapViaInduction()
5154            cast<SCEVAddRecExpr>(Accum)->getLoop() == L)) {  in createAddRecFromPHI()
5281         const auto *ARLoop = cast<SCEVAddRecExpr>(S)->getLoop();  in IsAvailableOnEntry()
5795       const SCEV *MaxBECount = getConstantMaxBackedgeTakenCount(AddRec->getLoop());  in getRangeRef()
5814             getSymbolicMaxBackedgeTakenCount(AddRec->getLoop());  in getRangeRef()
6231           if (!isLoopInvariant(OtherOp, AddRec->getLoop())) {  in isSCEVExprNeverPoison()
6238           isGuaranteedToExecuteForEveryIteration(I, AddRec->getLoop()))  in isSCEVExprNeverPoison()
7690       if (AddRec->getLoop() == L) {  in computeExitLimitFromICmp()
8626         getAddRecExpr(NewOps, AddRec->getLoop(),  in computeSCEVAtScope()
8639     if (!AddRec->getLoop()->contains(L)) {  in computeSCEVAtScope()
8642       const SCEV *BackedgeTakenCount = getBackedgeTakenCount(AddRec->getLoop());  in computeSCEVAtScope()
9037   if (!AddRec || AddRec->getLoop() != L)  in howFarToZero()
9124       loopHasNoAbnormalExits(AddRec->getLoop())) {  in howFarToZero()
9244     const Loop *L = AR->getLoop();  in SimplifyICmpOperands()
9514   const Loop *L = LHS->getLoop();  in isKnownOnEveryIteration()
9599   if (!ArLHS || ArLHS->getLoop() != L)  in getLoopInvariantPredicate()
9653   if (!AR || AR->getLoop() != L)  in getLoopInvariantExitCondDuringFirstIterations()
10333     if (LAR->getLoop() != MAR->getLoop())  in computeConstantDifference()
10400     const Loop *L = AR->getLoop();  in isImpliedCondOperandsViaAddRecStart()
10405     if (!isAvailableAtLoopEntry(FoundRHS, AR->getLoop()))  in isImpliedCondOperandsViaAddRecStart()
10411     const Loop *L = AR->getLoop();  in isImpliedCondOperandsViaAddRecStart()
10416     if (!isAvailableAtLoopEntry(FoundLHS, AR->getLoop()))  in isImpliedCondOperandsViaAddRecStart()
10442   const Loop *L = AddRecFoundLHS->getLoop();  in isImpliedCondOperandsViaNoOverflow()
10443   if (L != AddRecLHS->getLoop())  in isImpliedCondOperandsViaNoOverflow()
10575   } else if (RAR && RAR->getLoop()->getHeader() == LBB) {  in isImpliedViaMerge()
10583     auto *RLoop = RAR->getLoop();  in isImpliedViaMerge()
10661   if (LAR->getLoop() != RAR->getLoop())  in IsKnownPredicateViaAddRecStart()
11119   if (!IV || IV->getLoop() != L || !IV->isAffine())  in howManyLessThans()
11265   if (!IV || IV->getLoop() != L || !IV->isAffine())  in howManyGreaterThans()
11339       const SCEV *Shifted = SE.getAddRecExpr(Operands, getLoop(),  in getNumIterationsInRange()
11421   return cast<SCEVAddRecExpr>(SE.getAddRecExpr(Ops, getLoop(),  in getPostIncExpr()
12257     if (AR->getLoop() == L)  in computeLoopDisposition()
12265     if (DT.dominates(L->getHeader(), AR->getLoop()->getHeader()))  in computeLoopDisposition()
12267     assert(!L->contains(AR->getLoop()) && "Containing loop's header does not"  in computeLoopDisposition()
12271     if (AR->getLoop()->contains(L))  in computeLoopDisposition()
12367     if (!DT.dominates(AR->getLoop()->getHeader(), BB))  in computeBlockDisposition()
12483         LoopsUsed.insert(AR->getLoop());  in getUsedLoops()
12588     assert(ValidLoops.contains(AR->getLoop()) &&  in verify()
12746     if (AR && AR->getLoop() == L && AR->isAffine()) {  in visitZeroExtendExpr()
12762     if (AR && AR->getLoop() == L && AR->isAffine()) {  in visitSignExtendExpr()
12813         if (L != AR->getLoop())  in convertToAddRecWithPreds()