Lines Matching refs:isLoopInvariant
2397 return isLoopInvariant(S, L) && properlyDominates(S, L->getHeader()); in isAvailableAtLoopEntry()
3524 assert(isLoopInvariant(Operands[i], L) && in getAddRecExpr()
3554 Operands, [&](const SCEV *Op) { return isLoopInvariant(Op, L); }); in getAddRecExpr()
3566 return isLoopInvariant(Op, NestedLoop); in getAddRecExpr()
4445 if (!SE.isLoopInvariant(Expr, L)) in visitUnknown()
4486 if (!SE.isLoopInvariant(Expr, L)) in visitUnknown()
4539 bool InvariantF = SE.isLoopInvariant(Expr, L); in visitUnknown()
4603 if (!SE.isLoopInvariant(Expr, L)) in visitUnknown()
5052 if (!isLoopInvariant(Accum, L)) in createAddRecFromPHIWithCastsImpl()
5136 assert(isLoopInvariant(Expr, L) && "Expr is expected to be invariant"); in createAddRecFromPHIWithCastsImpl()
5275 if (BO->LHS == PN && L->isLoopInvariant(BO->RHS)) in createSimpleAffineAddRec()
5277 else if (BO->RHS == PN && L->isLoopInvariant(BO->LHS)) in createSimpleAffineAddRec()
5298 if (isLoopInvariant(Accum, L) && isAddRecNeverPoison(BEInst, L)) in createSimpleAffineAddRec()
5375 if (isLoopInvariant(Accum, L) || in createAddRecFromPHI()
5420 if (isLoopInvariant(Accum, L) && isAddRecNeverPoison(BEInst, L)) in createAddRecFromPHI()
6594 if (!isLoopInvariant(OtherOp, AddRec->getLoop())) { in isSCEVExprNeverPoison()
7339 assert(isLoopInvariant(BEExact, L) && in getBackedgeTakenInfo()
7340 isLoopInvariant(Result.getConstantMax(this), L) && in getBackedgeTakenInfo()
8051 if (isLoopInvariant(LHS, L) && !isLoopInvariant(RHS, L)) { in computeExitLimitFromICmp()
8222 isLoopInvariant(IdxExpr, L) || in computeLoadConstantCompareExitLimit()
8883 if (CurrLoop->isLoopInvariant(BackedgeVal)) in computeSCEVAtScope()
9644 if (isLoopInvariant(LHS, L) && properlyDominates(LHS, L->getHeader())) { in SimplifyICmpOperands()
10016 if (!isLoopInvariant(RHS, L)) { in getLoopInvariantPredicate()
10017 if (!isLoopInvariant(LHS, L)) in getLoopInvariantPredicate()
10070 if (!isLoopInvariant(RHS, L)) { in getLoopInvariantExitCondDuringFirstIterations()
10071 if (!isLoopInvariant(LHS, L)) in getLoopInvariantExitCondDuringFirstIterations()
11661 if (!isLoopInvariant(RHS, L)) in howManyLessThans()
11710 if (!isLoopInvariant(RHS, L)) in howManyLessThans()
11762 if (!isLoopInvariant(RHS, L)) { in howManyLessThans()
11957 if (!isLoopInvariant(RHS, L)) in howManyGreaterThans()
12880 if (!SE.isLoopInvariant(ExitValue, L)) { in print()
12980 if (!isLoopInvariant(Op, L)) in computeLoopDisposition()
13027 bool ScalarEvolution::isLoopInvariant(const SCEV *S, const Loop *L) { in isLoopInvariant() function in ScalarEvolution