51                           ScalarEvolution *SE, LoopInfo *LI) {  in isInteresting()  argument
59               SE->getSCEVAtScope(AR, LI->getLoopFor(I->getParent())) != AR);  in isInteresting()
63     return isInteresting(AR->getStart(), I, L, SE, LI) &&  in isInteresting()
64           !isInteresting(AR->getStepRecurrence(*SE), I, L, SE, LI);  in isInteresting()
72       if (isInteresting(*OI, I, L, SE, LI)) {  in isInteresting()
124   if (!SE->isSCEVable(I->getType()))  in AddUsersImpl()
136   uint64_t Width = SE->getTypeSizeInBits(I->getType());  in AddUsersImpl()
141   const SCEV *ISE = SE->getSCEV(I);  in AddUsersImpl()
145   if (!isInteresting(ISE, I, L, SE, LI))  in AddUsersImpl()
200                                    *SE, *DT);  in AddUsersImpl()
209               NewUse.PostIncLoops, *SE, *DT);  in AddUsersImpl()
220       DEBUG(if (SE->getSCEV(I) != ISE)  in AddUsersImpl()
258   SE = &getAnalysis<ScalarEvolution>();  in runOnLoop()
272   if (SE->hasLoopInvariantBackedgeTakenCount(L)) {  in print()
274        << *SE->getBackedgeTakenCount(L);  in print()
313   return SE->getSCEV(IU.getOperandValToReplace());  in getReplacementExpr()
322                            *SE, *DT);  in getExpr()
345     return AR->getStepRecurrence(*SE);  in getStride()