38   return IVUsers(&L, &AR.AC, &AR.LI, &AR.DT, &AR.SE);  in run()
57                           ScalarEvolution *SE, LoopInfo *LI) {  in isInteresting()  argument
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()
77       if (isInteresting(Op, I, L, SE, LI)) {  in isInteresting()
144   if (!SE->isSCEVable(I->getType()))  in AddUsersIfInteresting()
156   uint64_t Width = SE->getTypeSizeInBits(I->getType());  in AddUsersIfInteresting()
166   const SCEV *ISE = SE->getSCEV(I);  in AddUsersIfInteresting()
170   if (!isInteresting(ISE, I, L, SE, LI))  in AddUsersIfInteresting()
219       ISE = normalizeForPostIncUseIf(ISE, NormalizePred, *SE);  in AddUsersIfInteresting()
227             denormalizeForPostIncUse(ISE, NewUse.PostIncLoops, *SE);  in AddUsersIfInteresting()
239       LLVM_DEBUG(if (SE->getSCEV(I) != ISE) dbgs()  in AddUsersIfInteresting()
252                  ScalarEvolution *SE)  in IVUsers()  argument
253     : L(L), AC(AC), LI(LI), DT(DT), SE(SE) {  in IVUsers()
268   if (SE->hasLoopInvariantBackedgeTakenCount(L)) {  in print()
269     OS << " with backedge-taken count " << *SE->getBackedgeTakenCount(L);  in print()
317   auto *SE = &getAnalysis<ScalarEvolutionWrapperPass>().getSE();  in runOnLoop()  local
319   IU.reset(new IVUsers(L, AC, LI, DT, SE));  in runOnLoop()
332   return SE->getSCEV(IU.getOperandValToReplace());  in getReplacementExpr()
338                                 *SE);  in getExpr()
360     return AR->getStepRecurrence(*SE);  in getStride()