Searched refs:isLoopEntryGuardedByCond (Results 1 – 8 of 8) sorted by relevance
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| D | InductiveRangeCheckElimination.cpp | 688 return SE.isLoopEntryGuardedByCond(L, BoundPred, Start, BoundSCEV); in isSafeDecreasingBound()
702 return SE.isLoopEntryGuardedByCond(L, BoundPred, Start, MinusOne) && in isSafeDecreasingBound()
703 SE.isLoopEntryGuardedByCond(L, BoundPred, BoundSCEV, Limit); in isSafeDecreasingBound()
736 return SE.isLoopEntryGuardedByCond(L, BoundPred, Start, BoundSCEV); in isSafeIncreasingBound()
747 return (SE.isLoopEntryGuardedByCond(L, BoundPred, Start, in isSafeIncreasingBound()
749 SE.isLoopEntryGuardedByCond(L, BoundPred, BoundSCEV, Limit)); in isSafeIncreasingBound()
|
| D | LoopPredication.cpp | 409 if (SE->isLoopEntryGuardedByCond(L, Pred, LHS, RHS)) in expandCheck()
411 if (SE->isLoopEntryGuardedByCond(L, ICmpInst::getInversePredicate(Pred), in expandCheck()
|
| D | IndVarSimplify.cpp | 1525 if (SE->isLoopEntryGuardedByCond(L, CmpInst::ICMP_ULT, in optimizeLoopExits()
|
| D | LoopIdiomRecognize.cpp | 1009 SE->isLoopEntryGuardedByCond( in getNumBytes()
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| D | LoopUtils.cpp | 1047 SE.isLoopEntryGuardedByCond(L, ICmpInst::ICMP_SLT, S, Zero); in isKnownNegativeInLoop()
1054 SE.isLoopEntryGuardedByCond(L, ICmpInst::ICMP_SGE, S, Zero); in isKnownNonNegativeInLoop()
1064 SE.isLoopEntryGuardedByCond(L, Predicate, S, in cannotBeMinInLoop()
1075 SE.isLoopEntryGuardedByCond(L, Predicate, S, in cannotBeMaxInLoop()
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
| D | HardwareLoops.cpp | 394 if (SE.isLoopEntryGuardedByCond(L, ICmpInst::ICMP_NE, ExitCount, in InitLoopCount()
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/ |
| D | ScalarEvolution.cpp | 1442 SE->isLoopEntryGuardedByCond(L, Pred, PreStart, OverflowLimit)) in getPreStartForExtend()
9503 if (isLoopEntryGuardedByCond(L, ICmpInst::ICMP_NE, DistancePlusOne, Zero)) { in howFarToZero()
9884 isLoopEntryGuardedByCond(MDL, Pred, SplitLHS.first, SplitRHS.first); in isKnownViaInduction()
9941 return isLoopEntryGuardedByCond(L, Pred, LHS->getStart(), RHS) && in isKnownOnEveryIteration()
10504 bool ScalarEvolution::isLoopEntryGuardedByCond(const Loop *L, in isLoopEntryGuardedByCond() function in ScalarEvolution
10971 isLoopEntryGuardedByCond(L, Pred, FoundRHS, in isImpliedCondOperandsViaNoOverflow()
11682 return isLoopEntryGuardedByCond(L, Cond, StartIfZero, RHS); in howManyLessThans()
11776 if (isLoopEntryGuardedByCond(L, Cond, StartMinusStride, Start) && in howManyLessThans()
11777 isLoopEntryGuardedByCond(L, Cond, StartMinusStride, RHS)) { in howManyLessThans()
11808 if (isLoopEntryGuardedByCond(L, CondGE, OrigRHS, OrigStart)) in howManyLessThans()
[all …]
|
| /freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| D | ScalarEvolution.h | 721 bool isLoopEntryGuardedByCond(const Loop *L, ICmpInst::Predicate Pred,
|