306     AR->getLoop()->getHeader()->printAsOperand(OS, /*PrintType=*/false);  in print()
761     const Loop *LLoop = LA->getLoop(), *RLoop = RA->getLoop();  in CompareSCEVComplexity()
1280     return getAddRecExpr(Operands, AddRec->getLoop(), SCEV::FlagAnyWrap);  in getTruncateExpr()
1398   const Loop *L = AR->getLoop();  in getPreStartForExtend()
1649       const Loop *L = AR->getLoop();  in getZeroExtendExpr()
1989       const Loop *L = AR->getLoop();  in getSignExtendExpr()
2187     return getAddRecExpr(Ops, AR->getLoop(), SCEV::FlagNW);  in getAnyExtendExpr()
2823     const Loop *AddRecLoop = AddRec->getLoop();  in getAddExpr()
2891            cast<SCEVAddRecExpr>(Ops[OtherIdx])->getLoop()->getHeader(),  in getAddExpr()
2892            AddRec->getLoop()->getHeader()) &&  in getAddExpr()
2894       if (AddRecLoop == cast<SCEVAddRecExpr>(Ops[OtherIdx])->getLoop()) {  in getAddExpr()
2900           if (OtherAddRec->getLoop() == AddRecLoop) {  in getAddExpr()
3154           return getAddRecExpr(Operands, AddRec->getLoop(),  in getMulExpr()
3197     const Loop *AddRecLoop = AddRec->getLoop();  in getMulExpr()
3256       if (!OtherAddRec || OtherAddRec->getLoop() != AddRecLoop)  in getMulExpr()
3397                             AR->getLoop(), SCEV::FlagAnyWrap)) {  in getUDivExpr()
3401             return getAddRecExpr(Operands, AR->getLoop(), SCEV::FlagNW);  in getUDivExpr()
3411                             AR->getLoop(), SCEV::FlagAnyWrap)) {  in getUDivExpr()
3417                                 AR->getLoop(), SCEV::FlagNW);  in getUDivExpr()
3580     if (StepChrec->getLoop() == L) {  in getAddRecExpr()
3622     const Loop *NestedLoop = NestedAR->getLoop();  in getAddRecExpr()
4492     return getAddRecExpr(Ops, AddRec->getLoop(), SCEV::FlagAnyWrap);  in removePointerBase()
4744     if (Expr->getLoop() == L)  in visitAddRecExpr()
4785     if (Expr->getLoop() == L)  in visitAddRecExpr()
4901     if (Expr->getLoop() == L && Expr->isAffine())  in visitAddRecExpr()
4962   const Loop *L = AR->getLoop();  in proveNoSignedWrapViaInduction()
5012   const Loop *L = AR->getLoop();  in proveNoUnsignedWrapViaInduction()
5674            cast<SCEVAddRecExpr>(Accum)->getLoop() == L)) {  in createAddRecFromPHI()
5802         const auto *ARLoop = cast<SCEVAddRecExpr>(S)->getLoop();  in IsAvailableOnEntry()
6555       const SCEV *MaxBECount = getConstantMaxBackedgeTakenCount(AddRec->getLoop());  in getRangeRef()
6574             getSymbolicMaxBackedgeTakenCount(AddRec->getLoop());  in getRangeRef()
6971     return &*AddRec->getLoop()->getHeader()->begin();  in getNonTrivialDefiningScopeBound()
8892       if (AddRec->getLoop() == L) {  in computeExitLimitFromICmp()
8914       if (!AR->hasNoSelfWrap() && AR->getLoop() == L && AR->isAffine() &&   in computeExitLimitFromICmp()
9754         getAddRecExpr(NewOps, AddRec->getLoop(),  in computeSCEVAtScope()
9767     if (!AddRec->getLoop()->contains(L)) {  in computeSCEVAtScope()
9770       const SCEV *BackedgeTakenCount = getBackedgeTakenCount(AddRec->getLoop());  in computeSCEVAtScope()
10144   if (!AddRec || AddRec->getLoop() != L)  in howFarToZero()
10229       loopHasNoAbnormalExits(AddRec->getLoop())) {  in howFarToZero()
10354     const Loop *L = AR->getLoop();  in SimplifyICmpOperands()
10657   const Loop *L = LHS->getLoop();  in isKnownOnEveryIteration()
10742   if (!ArLHS || ArLHS->getLoop() != L)  in getLoopInvariantPredicate()
10796   if (!AR || AR->getLoop() != L)  in getLoopInvariantExitCondDuringFirstIterations()
11568     if (LAR->getLoop() != MAR->getLoop())  in computeConstantDifference()
11635     const Loop *L = AR->getLoop();  in isImpliedCondOperandsViaAddRecStart()
11640     if (!isAvailableAtLoopEntry(FoundRHS, AR->getLoop()))  in isImpliedCondOperandsViaAddRecStart()
11646     const Loop *L = AR->getLoop();  in isImpliedCondOperandsViaAddRecStart()
11651     if (!isAvailableAtLoopEntry(FoundLHS, AR->getLoop()))  in isImpliedCondOperandsViaAddRecStart()
11677   const Loop *L = AddRecFoundLHS->getLoop();  in isImpliedCondOperandsViaNoOverflow()
11678   if (L != AddRecLHS->getLoop())  in isImpliedCondOperandsViaNoOverflow()
11810   } else if (RAR && RAR->getLoop()->getHeader() == LBB) {  in isImpliedViaMerge()
11818     auto *RLoop = RAR->getLoop();  in isImpliedViaMerge()
11941   if (LAR->getLoop() != RAR->getLoop())  in IsKnownPredicateViaAddRecStart()
12423       if (AR && AR->getLoop() == L && AR->isAffine()) {  in howManyLessThans()
12475   if (!IV || IV->getLoop() != L || !IV->isAffine())  in howManyLessThans()
12830   if (!IV || IV->getLoop() != L || !IV->isAffine())  in howManyGreaterThans()
12919       const SCEV *Shifted = SE.getAddRecExpr(Operands, getLoop(),  in getNumIterationsInRange()
13001   return cast<SCEVAddRecExpr>(SE.getAddRecExpr(Ops, getLoop(),  in getPostIncExpr()
13362     if (AR->getLoop() == L)  in computeLoopDisposition()
13370     if (DT.dominates(L->getHeader(), AR->getLoop()->getHeader()))  in computeLoopDisposition()
13372     assert(!L->contains(AR->getLoop()) && "Containing loop's header does not"  in computeLoopDisposition()
13376     if (AR->getLoop()->contains(L))  in computeLoopDisposition()
13473     if (!DT.dominates(AR->getLoop()->getHeader(), BB))  in computeBlockDisposition()
13633         LoopsUsed.insert(AR->getLoop());  in getUsedLoops()
13784       assert(ValidLoops.contains(AR->getLoop()) &&  in verify()
14068     if (AR && AR->getLoop() == L && AR->isAffine()) {  in visitZeroExtendExpr()
14084     if (AR && AR->getLoop() == L && AR->isAffine()) {  in visitSignExtendExpr()
14134         if (L != WP->getExpr()->getLoop())  in convertToAddRecWithPreds()