Searched refs:isLoopEntryGuardedByCond (Results 1 – 8 of 8) sorted by relevance
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | LoopConstrainer.cpp | 46 return SE.isLoopEntryGuardedByCond(L, BoundPred, Start, BoundSCEV); in isSafeDecreasingBound() 59 return SE.isLoopEntryGuardedByCond(L, BoundPred, Start, MinusOne) && in isSafeDecreasingBound() 60 SE.isLoopEntryGuardedByCond(L, BoundPred, BoundSCEV, Limit); in isSafeDecreasingBound() 90 return SE.isLoopEntryGuardedByCond(L, BoundPred, Start, BoundSCEV); in isSafeIncreasingBound() 100 return (SE.isLoopEntryGuardedByCond(L, BoundPred, Start, in isSafeIncreasingBound() 102 SE.isLoopEntryGuardedByCond(L, BoundPred, BoundSCEV, Limit)); in isSafeIncreasingBound()
|
| H A D | LoopUtils.cpp | 1187 SE.isLoopEntryGuardedByCond(L, ICmpInst::ICMP_SLT, S, Zero); in isKnownNegativeInLoop() 1194 SE.isLoopEntryGuardedByCond(L, ICmpInst::ICMP_SGE, S, Zero); in isKnownNonNegativeInLoop() 1201 SE.isLoopEntryGuardedByCond(L, ICmpInst::ICMP_SGT, S, Zero); in isKnownPositiveInLoop() 1208 SE.isLoopEntryGuardedByCond(L, ICmpInst::ICMP_SLE, S, Zero); in isKnownNonPositiveInLoop() 1218 SE.isLoopEntryGuardedByCond(L, Predicate, S, in cannotBeMinInLoop() 1229 SE.isLoopEntryGuardedByCond(L, Predicate, S, in cannotBeMaxInLoop()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopPredication.cpp | 384 if (SE->isLoopEntryGuardedByCond(L, Pred, LHS, RHS)) in expandCheck() 386 if (SE->isLoopEntryGuardedByCond(L, ICmpInst::getInversePredicate(Pred), in expandCheck()
|
| H A D | LoopBoundSplit.cpp | 276 if (!SE.isLoopEntryGuardedByCond(&L, SplitCandidateCond.Pred, in findSplitCandidate()
|
| H A D | IndVarSimplify.cpp | 1691 if (SE->isLoopEntryGuardedByCond(L, CmpInst::ICMP_ULT, MaxBECount, in optimizeLoopExits()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | HardwareLoops.cpp | 459 if (SE.isLoopEntryGuardedByCond(L, ICmpInst::ICMP_NE, ExitCount, in InitLoopCount()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | ScalarEvolution.cpp | 1391 SE->isLoopEntryGuardedByCond(L, Pred, PreStart, OverflowLimit)) in getPreStartForExtend() 8153 return L && isLoopEntryGuardedByCond(L, ICmpInst::ICMP_NE, ExitCount, in getTripCountFromExitCount() 10909 return isLoopEntryGuardedByCond(L, Pred, LHS->getStart(), RHS) && in isKnownOnEveryIteration() 11529 bool ScalarEvolution::isLoopEntryGuardedByCond(const Loop *L, in isLoopEntryGuardedByCond() function in ScalarEvolution 12043 isLoopEntryGuardedByCond(L, Pred, FoundRHS, in isImpliedCondOperandsViaNoOverflow() 12876 return isLoopEntryGuardedByCond(L, Cond, StartIfZero, RHS); in howManyLessThans() 12950 if (isLoopEntryGuardedByCond(L, Cond, OrigStartMinusStride, OrigStart) && in howManyLessThans() 12951 isLoopEntryGuardedByCond(L, Cond, OrigStartMinusStride, OrigRHS)) { in howManyLessThans() 12983 if (isLoopEntryGuardedByCond(L, CondGE, OrigRHS, OrigStart) || in howManyLessThans() 12999 return isLoopEntryGuardedByCond(L, CondGT, OrigRHS, StartMinusOne); in howManyLessThans() [all …]
|
| /freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolution.h | 783 bool isLoopEntryGuardedByCond(const Loop *L, ICmpInst::Predicate Pred,
|