297     AR->getLoop()->getHeader()->printAsOperand(OS, /*PrintType=*/false);  in print()
745     const Loop *LLoop = LA->getLoop(), *RLoop = RA->getLoop();  in CompareSCEVComplexity()
1263     return getAddRecExpr(Operands, AddRec->getLoop(), SCEV::FlagAnyWrap);  in getTruncateExpr()
1381   const Loop *L = AR->getLoop();  in getPreStartForExtend()
1632       const Loop *L = AR->getLoop();  in getZeroExtendExpr()
1973       const Loop *L = AR->getLoop();  in getSignExtendExpr()
2153     return getAddRecExpr(Ops, AR->getLoop(), SCEV::FlagNW);  in getAnyExtendExpr()
2758     const Loop *AddRecLoop = AddRec->getLoop();  in getAddExpr()
2810            cast<SCEVAddRecExpr>(Ops[OtherIdx])->getLoop()->getHeader(),  in getAddExpr()
2811            AddRec->getLoop()->getHeader()) &&  in getAddExpr()
2813       if (AddRecLoop == cast<SCEVAddRecExpr>(Ops[OtherIdx])->getLoop()) {  in getAddExpr()
2819           if (OtherAddRec->getLoop() == AddRecLoop) {  in getAddExpr()
3071           return getAddRecExpr(Operands, AddRec->getLoop(),  in getMulExpr()
3114     const Loop *AddRecLoop = AddRec->getLoop();  in getMulExpr()
3173       if (!OtherAddRec || OtherAddRec->getLoop() != AddRecLoop)  in getMulExpr()
3314                             AR->getLoop(), SCEV::FlagAnyWrap)) {  in getUDivExpr()
3318             return getAddRecExpr(Operands, AR->getLoop(), SCEV::FlagNW);  in getUDivExpr()
3328                             AR->getLoop(), SCEV::FlagAnyWrap)) {  in getUDivExpr()
3334                                 AR->getLoop(), SCEV::FlagNW);  in getUDivExpr()
3501     if (StepChrec->getLoop() == L) {  in getAddRecExpr()
3543     const Loop *NestedLoop = NestedAR->getLoop();  in getAddRecExpr()
4159     return SE->getAddRecExpr(Ops, AddRec->getLoop(), SCEV::FlagAnyWrap);  in removePointerBase()
4452     if (Expr->getLoop() == L)  in visitAddRecExpr()
4493     if (Expr->getLoop() == L)  in visitAddRecExpr()
4609     if (Expr->getLoop() == L && Expr->isAffine())  in visitAddRecExpr()
4670   const Loop *L = AR->getLoop();  in proveNoSignedWrapViaInduction()
4720   const Loop *L = AR->getLoop();  in proveNoUnsignedWrapViaInduction()
5377            cast<SCEVAddRecExpr>(Accum)->getLoop() == L)) {  in createAddRecFromPHI()
5504         const auto *ARLoop = cast<SCEVAddRecExpr>(S)->getLoop();  in IsAvailableOnEntry()
6146       const SCEV *MaxBECount = getConstantMaxBackedgeTakenCount(AddRec->getLoop());  in getRangeRef()
6165             getSymbolicMaxBackedgeTakenCount(AddRec->getLoop());  in getRangeRef()
6594           if (!isLoopInvariant(OtherOp, AddRec->getLoop())) {  in isSCEVExprNeverPoison()
6601           isGuaranteedToExecuteForEveryIteration(I, AddRec->getLoop()))  in isSCEVExprNeverPoison()
8064       if (AddRec->getLoop() == L) {  in computeExitLimitFromICmp()
8221   if (!IdxExpr || IdxExpr->getLoop() != L || !IdxExpr->isAffine() ||  in computeLoadConstantCompareExitLimit()
9020         getAddRecExpr(NewOps, AddRec->getLoop(),  in computeSCEVAtScope()
9033     if (!AddRec->getLoop()->contains(L)) {  in computeSCEVAtScope()
9036       const SCEV *BackedgeTakenCount = getBackedgeTakenCount(AddRec->getLoop());  in computeSCEVAtScope()
9431   if (!AddRec || AddRec->getLoop() != L)  in howFarToZero()
9518       loopHasNoAbnormalExits(AddRec->getLoop())) {  in howFarToZero()
9643     const Loop *L = AR->getLoop();  in SimplifyICmpOperands()
9940   const Loop *L = LHS->getLoop();  in isKnownOnEveryIteration()
10025   if (!ArLHS || ArLHS->getLoop() != L)  in getLoopInvariantPredicate()
10079   if (!AR || AR->getLoop() != L)  in getLoopInvariantExitCondDuringFirstIterations()
10807     if (LAR->getLoop() != MAR->getLoop())  in computeConstantDifference()
10874     const Loop *L = AR->getLoop();  in isImpliedCondOperandsViaAddRecStart()
10879     if (!isAvailableAtLoopEntry(FoundRHS, AR->getLoop()))  in isImpliedCondOperandsViaAddRecStart()
10885     const Loop *L = AR->getLoop();  in isImpliedCondOperandsViaAddRecStart()
10890     if (!isAvailableAtLoopEntry(FoundLHS, AR->getLoop()))  in isImpliedCondOperandsViaAddRecStart()
10916   const Loop *L = AddRecFoundLHS->getLoop();  in isImpliedCondOperandsViaNoOverflow()
10917   if (L != AddRecLHS->getLoop())  in isImpliedCondOperandsViaNoOverflow()
11049   } else if (RAR && RAR->getLoop()->getHeader() == LBB) {  in isImpliedViaMerge()
11057     auto *RLoop = RAR->getLoop();  in isImpliedViaMerge()
11135   if (LAR->getLoop() != RAR->getLoop())  in IsKnownPredicateViaAddRecStart()
11588   if (!IV || IV->getLoop() != L || !IV->isAffine())  in howManyLessThans()
11968   if (!IV || IV->getLoop() != L || !IV->isAffine())  in howManyGreaterThans()
12057       const SCEV *Shifted = SE.getAddRecExpr(Operands, getLoop(),  in getNumIterationsInRange()
12139   return cast<SCEVAddRecExpr>(SE.getAddRecExpr(Ops, getLoop(),  in getPostIncExpr()
12960     if (AR->getLoop() == L)  in computeLoopDisposition()
12968     if (DT.dominates(L->getHeader(), AR->getLoop()->getHeader()))  in computeLoopDisposition()
12970     assert(!L->contains(AR->getLoop()) && "Containing loop's header does not"  in computeLoopDisposition()
12974     if (AR->getLoop()->contains(L))  in computeLoopDisposition()
13070     if (!DT.dominates(AR->getLoop()->getHeader(), BB))  in computeBlockDisposition()
13177         LoopsUsed.insert(AR->getLoop());  in getUsedLoops()
13282     assert(ValidLoops.contains(AR->getLoop()) &&  in verify()
13440     if (AR && AR->getLoop() == L && AR->isAffine()) {  in visitZeroExtendExpr()
13456     if (AR && AR->getLoop() == L && AR->isAffine()) {  in visitSignExtendExpr()
13507         if (L != AR->getLoop())  in convertToAddRecWithPreds()