Searched refs:isAvailableAtLoopEntry (Results 1 – 4 of 4) sorted by relevance
| /freebsd-12.1/contrib/llvm/lib/Transforms/Utils/ |
| H A D | LoopUtils.cpp | 938 return SE.isAvailableAtLoopEntry(S, L) && in isKnownNegativeInLoop()
945 return SE.isAvailableAtLoopEntry(S, L) && in isKnownNonNegativeInLoop()
955 return SE.isAvailableAtLoopEntry(S, L) && in cannotBeMinInLoop()
966 return SE.isAvailableAtLoopEntry(S, L) && in cannotBeMaxInLoop()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/ |
| H A D | InductiveRangeCheckElimination.cpp | 660 if (!SE.isAvailableAtLoopEntry(BoundSCEV, L)) in isSafeDecreasingBound()
710 if (!SE.isAvailableAtLoopEntry(BoundSCEV, L)) in isSafeIncreasingBound()
|
| /freebsd-12.1/contrib/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolution.h | 934 bool isAvailableAtLoopEntry(const SCEV *S, const Loop *L);
|
| /freebsd-12.1/contrib/llvm/lib/Analysis/ |
| H A D | ScalarEvolution.cpp | 2361 bool ScalarEvolution::isAvailableAtLoopEntry(const SCEV *S, const Loop *L) { in isAvailableAtLoopEntry() function in ScalarEvolution
2660 if (isAvailableAtLoopEntry(Ops[i], AddRecLoop)) { in getAddExpr()
2998 if (isAvailableAtLoopEntry(Ops[i], AddRecLoop)) { in getMulExpr()
9083 if (!isAvailableAtLoopEntry(SplitLHS.first, MDL) || in isKnownViaInduction()
9084 !isAvailableAtLoopEntry(SplitRHS.first, MDL)) in isKnownViaInduction()
9494 assert(isAvailableAtLoopEntry(LHS, L) && in isLoopEntryGuardedByCond()
9496 assert(isAvailableAtLoopEntry(RHS, L) && in isLoopEntryGuardedByCond()
9915 return isAvailableAtLoopEntry(FoundRHS, L) && in isImpliedCondOperandsViaNoOverflow()
|