Searched refs:isAvailableAtLoopEntry (Results 1 – 5 of 5) sorted by relevance
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | LoopUtils.cpp | 1046 return SE.isAvailableAtLoopEntry(S, L) && in isKnownNegativeInLoop()
1053 return SE.isAvailableAtLoopEntry(S, L) && in isKnownNonNegativeInLoop()
1063 return SE.isAvailableAtLoopEntry(S, L) && in cannotBeMinInLoop()
1074 return SE.isAvailableAtLoopEntry(S, L) && in cannotBeMaxInLoop()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopBoundSplit.cpp | 124 if (!SE.isAvailableAtLoopEntry(Cond.BoundSCEV, &L)) in hasProcessableCondition()
|
| H A D | InductiveRangeCheckElimination.cpp | 668 if (!SE.isAvailableAtLoopEntry(BoundSCEV, L)) in isSafeDecreasingBound()
718 if (!SE.isAvailableAtLoopEntry(BoundSCEV, L)) in isSafeIncreasingBound()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | ScalarEvolution.cpp | 2396 bool ScalarEvolution::isAvailableAtLoopEntry(const SCEV *S, const Loop *L) { in isAvailableAtLoopEntry() function in ScalarEvolution
2760 if (isAvailableAtLoopEntry(Ops[i], AddRecLoop)) { in getAddExpr()
3116 if (isAvailableAtLoopEntry(Ops[i], AddRecLoop)) { in getMulExpr()
9876 if (!isAvailableAtLoopEntry(SplitLHS.first, MDL) || in isKnownViaInduction()
9877 !isAvailableAtLoopEntry(SplitRHS.first, MDL)) in isKnownViaInduction()
10514 assert(isAvailableAtLoopEntry(LHS, L) && in isLoopEntryGuardedByCond()
10516 assert(isAvailableAtLoopEntry(RHS, L) && in isLoopEntryGuardedByCond()
10879 if (!isAvailableAtLoopEntry(FoundRHS, AR->getLoop())) in isImpliedCondOperandsViaAddRecStart()
10890 if (!isAvailableAtLoopEntry(FoundLHS, AR->getLoop())) in isImpliedCondOperandsViaAddRecStart()
10970 return isAvailableAtLoopEntry(FoundRHS, L) && in isImpliedCondOperandsViaNoOverflow()
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolution.h | 1069 bool isAvailableAtLoopEntry(const SCEV *S, const Loop *L);
|