2451 bool ScalarEvolution::isAvailableAtLoopEntry(const SCEV *S, const Loop *L) {  in isAvailableAtLoopEntry()  function in ScalarEvolution
2825       if (isAvailableAtLoopEntry(Ops[i], AddRecLoop)) {  in getAddExpr()
3199       if (isAvailableAtLoopEntry(Ops[i], AddRecLoop)) {  in getMulExpr()
10593   if (!isAvailableAtLoopEntry(SplitLHS.first, MDL) ||  in isKnownViaInduction()
10594       !isAvailableAtLoopEntry(SplitRHS.first, MDL))  in isKnownViaInduction()
11231   assert(isAvailableAtLoopEntry(LHS, L) &&  in isLoopEntryGuardedByCond()
11233   assert(isAvailableAtLoopEntry(RHS, L) &&  in isLoopEntryGuardedByCond()
11640     if (!isAvailableAtLoopEntry(FoundRHS, AR->getLoop()))  in isImpliedCondOperandsViaAddRecStart()
11651     if (!isAvailableAtLoopEntry(FoundLHS, AR->getLoop()))  in isImpliedCondOperandsViaAddRecStart()
11731   return isAvailableAtLoopEntry(FoundRHS, L) &&  in isImpliedCondOperandsViaNoOverflow()
12636   assert(isAvailableAtLoopEntry(OrigStartMinusStride, L) && "Must be!");  in howManyLessThans()
12637   assert(isAvailableAtLoopEntry(OrigStart, L) && "Must be!");  in howManyLessThans()
12638   assert(isAvailableAtLoopEntry(OrigRHS, L) && "Must be!");  in howManyLessThans()