37                              LoopStandardAnalysisResults &AR) {  in run()  argument
38   return IVUsers(&L, &AR.AC, &AR.LI, &AR.DT, &AR.SE);  in run()
59   if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(S)) {  in isInteresting()  local
62     if (AR->getLoop() == L)  in isInteresting()
63       return AR->isAffine() ||  in isInteresting()
65               SE->getSCEVAtScope(AR, LI->getLoopFor(I->getParent())) != AR);  in isInteresting()
69     return isInteresting(AR->getStart(), I, L, SE, LI) &&  in isInteresting()
70           !isInteresting(AR->getStepRecurrence(*SE), I, L, SE, LI);  in isInteresting()
211       auto NormalizePred = [&](const SCEVAddRecExpr *AR) {  in AddUsersIfInteresting()  argument
212         auto *L = AR->getLoop();  in AddUsersIfInteresting()
342   if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(S)) {  in findAddRecForLoop()  local
343     if (AR->getLoop() == L)  in findAddRecForLoop()
344       return AR;  in findAddRecForLoop()
345     return findAddRecForLoop(AR->getStart(), L);  in findAddRecForLoop()
350       if (const SCEVAddRecExpr *AR = findAddRecForLoop(Op, L))  in findAddRecForLoop()  local
351         return AR;  in findAddRecForLoop()
359   if (const SCEVAddRecExpr *AR = findAddRecForLoop(getExpr(IU), L))  in getStride()  local
360     return AR->getStepRecurrence(*SE);  in getStride()