2505 bool ScalarEvolution::isAvailableAtLoopEntry(const SCEV *S, const Loop *L) {  in isAvailableAtLoopEntry()  function in ScalarEvolution
2878       if (isAvailableAtLoopEntry(Ops[i], AddRecLoop)) {  in getAddExpr()
3261       if (isAvailableAtLoopEntry(Ops[i], AddRec->getLoop())) {  in getMulExpr()
3675     assert(isAvailableAtLoopEntry(Operands[i], L) &&  in getAddRecExpr()
10845   if (!isAvailableAtLoopEntry(SplitLHS.first, MDL) ||  in isKnownViaInduction()
10846       !isAvailableAtLoopEntry(SplitRHS.first, MDL))  in isKnownViaInduction()
11539   assert(isAvailableAtLoopEntry(LHS, L) &&  in isLoopEntryGuardedByCond()
11541   assert(isAvailableAtLoopEntry(RHS, L) &&  in isLoopEntryGuardedByCond()
11951     if (!isAvailableAtLoopEntry(FoundRHS, AR->getLoop()))  in isImpliedCondOperandsViaAddRecStart()
11962     if (!isAvailableAtLoopEntry(FoundLHS, AR->getLoop()))  in isImpliedCondOperandsViaAddRecStart()
12042   return isAvailableAtLoopEntry(FoundRHS, L) &&  in isImpliedCondOperandsViaNoOverflow()
12946   assert(isAvailableAtLoopEntry(OrigStartMinusStride, L) && "Must be!");  in howManyLessThans()
12947   assert(isAvailableAtLoopEntry(OrigStart, L) && "Must be!");  in howManyLessThans()
12948   assert(isAvailableAtLoopEntry(OrigRHS, L) && "Must be!");  in howManyLessThans()