2452   return isLoopInvariant(S, L) && properlyDominates(S, L->getHeader());  in isAvailableAtLoopEntry()
3603     assert(isLoopInvariant(Operands[i], L) &&  in getAddRecExpr()
3633           Operands, [&](const SCEV *Op) { return isLoopInvariant(Op, L); });  in getAddRecExpr()
3645           return isLoopInvariant(Op, NestedLoop);  in getAddRecExpr()
4737     if (!SE.isLoopInvariant(Expr, L))  in visitUnknown()
4778     if (!SE.isLoopInvariant(Expr, L))  in visitUnknown()
4831     bool InvariantF = SE.isLoopInvariant(Expr, L);  in visitUnknown()
4895     if (!SE.isLoopInvariant(Expr, L))  in visitUnknown()
5347   if (!isLoopInvariant(Accum, L))  in createAddRecFromPHIWithCastsImpl()
5431     assert(isLoopInvariant(Expr, L) && "Expr is expected to be invariant");  in createAddRecFromPHIWithCastsImpl()
5570   if (BO->LHS == PN && L->isLoopInvariant(BO->RHS))  in createSimpleAffineAddRec()
5572   else if (BO->RHS == PN && L->isLoopInvariant(BO->LHS))  in createSimpleAffineAddRec()
5592     assert(isLoopInvariant(Accum, L) &&  in createSimpleAffineAddRec()
5672       if (isLoopInvariant(Accum, L) ||  in createAddRecFromPHI()
5717           if (isLoopInvariant(Accum, L) && isAddRecNeverPoison(BEInst, L))  in createAddRecFromPHI()
7996       assert(isLoopInvariant(ArrBase, L) && "See addrec definition");  in getConstantMaxTripCountFromArray()
8208     assert(isLoopInvariant(BEExact, L) &&  in getBackedgeTakenInfo()
8209            isLoopInvariant(Result.getConstantMax(this), L) &&  in getBackedgeTakenInfo()
8875   if (isLoopInvariant(LHS, L) && !isLoopInvariant(RHS, L)) {  in computeExitLimitFromICmp()
8906   if (ControllingFiniteLoop && isLoopInvariant(RHS, L)) {  in computeExitLimitFromICmp()
9622             if (CurrLoop->isLoopInvariant(BackedgeVal))  in computeSCEVAtScope()
10355     if (isLoopInvariant(LHS, L) && properlyDominates(LHS, L->getHeader())) {  in SimplifyICmpOperands()
10733   if (!isLoopInvariant(RHS, L)) {  in getLoopInvariantPredicate()
10734     if (!isLoopInvariant(LHS, L))  in getLoopInvariantPredicate()
10787   if (!isLoopInvariant(RHS, L)) {  in getLoopInvariantExitCondDuringFirstIterations()
10788     if (!isLoopInvariant(LHS, L))  in getLoopInvariantExitCondDuringFirstIterations()
12407     if (!isLoopInvariant(RHS, L))  in howManyLessThans()
12425           if (!isLoopInvariant(RHS, L))  in howManyLessThans()
12545       if (!isLoopInvariant(RHS, L))  in howManyLessThans()
12623   if (!isLoopInvariant(RHS, L)) {  in howManyLessThans()
12819   if (!isLoopInvariant(RHS, L))  in howManyGreaterThans()
13282           if (!SE.isLoopInvariant(ExitValue, L)) {  in print()
13382       if (!isLoopInvariant(Op, L))  in computeLoopDisposition()
13430 bool ScalarEvolution::isLoopInvariant(const SCEV *S, const Loop *L) {  in isLoopInvariant()  function in ScalarEvolution