Searched refs:isAvailableAtLoopEntry (Results 1 – 5 of 5) sorted by relevance
| /llvm-project-15.0.7/llvm/lib/Transforms/Utils/ |
| H A D | LoopUtils.cpp | 1116 return SE.isAvailableAtLoopEntry(S, L) && in isKnownNegativeInLoop()
1123 return SE.isAvailableAtLoopEntry(S, L) && in isKnownNonNegativeInLoop()
1133 return SE.isAvailableAtLoopEntry(S, L) && in cannotBeMinInLoop()
1144 return SE.isAvailableAtLoopEntry(S, L) && in cannotBeMaxInLoop()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Scalar/ |
| H A D | LoopBoundSplit.cpp | 131 if (!SE.isAvailableAtLoopEntry(Cond.BoundSCEV, &L)) in hasProcessableCondition()
|
| H A D | InductiveRangeCheckElimination.cpp | 666 if (!SE.isAvailableAtLoopEntry(BoundSCEV, L)) in isSafeDecreasingBound()
716 if (!SE.isAvailableAtLoopEntry(BoundSCEV, L)) in isSafeIncreasingBound()
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | ScalarEvolution.cpp | 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()
12637 assert(isAvailableAtLoopEntry(OrigStart, L) && "Must be!"); in howManyLessThans()
[all …]
|
| /llvm-project-15.0.7/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolution.h | 1126 bool isAvailableAtLoopEntry(const SCEV *S, const Loop *L);
|