2507 bool ScalarEvolution::isAvailableAtLoopEntry(const SCEV *S, const Loop *L) {  in isAvailableAtLoopEntry()  function in ScalarEvolution
2880       if (isAvailableAtLoopEntry(Ops[i], AddRecLoop)) {  in getAddExpr()
3263       if (isAvailableAtLoopEntry(Ops[i], AddRec->getLoop())) {  in getMulExpr()
3677     assert(isAvailableAtLoopEntry(Op, L) &&  in getAddRecExpr()
10923   if (!isAvailableAtLoopEntry(SplitLHS.first, MDL) ||  in isKnownViaInduction()
10924       !isAvailableAtLoopEntry(SplitRHS.first, MDL))  in isKnownViaInduction()
11617   assert(isAvailableAtLoopEntry(LHS, L) &&  in isLoopEntryGuardedByCond()
11619   assert(isAvailableAtLoopEntry(RHS, L) &&  in isLoopEntryGuardedByCond()
12029     if (!isAvailableAtLoopEntry(FoundRHS, AR->getLoop()))  in isImpliedCondOperandsViaAddRecStart()
12040     if (!isAvailableAtLoopEntry(FoundLHS, AR->getLoop()))  in isImpliedCondOperandsViaAddRecStart()
12120   return isAvailableAtLoopEntry(FoundRHS, L) &&  in isImpliedCondOperandsViaNoOverflow()
13067     assert(isAvailableAtLoopEntry(OrigStartMinusStride, L) && "Must be!");  in howManyLessThans()
13068     assert(isAvailableAtLoopEntry(OrigStart, L) && "Must be!");  in howManyLessThans()
13069     assert(isAvailableAtLoopEntry(OrigRHS, L) && "Must be!");  in howManyLessThans()