| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | LoopConstrainer.cpp | 49 return SE.isLoopEntryGuardedByCond(L, BoundPred, StartLG, BoundLG); in isSafeDecreasingBound()
62 return SE.isLoopEntryGuardedByCond(L, BoundPred, StartLG, MinusOne) && in isSafeDecreasingBound()
63 SE.isLoopEntryGuardedByCond(L, BoundPred, BoundLG, Limit); in isSafeDecreasingBound()
96 return SE.isLoopEntryGuardedByCond(L, BoundPred, StartLG, BoundLG); in isSafeIncreasingBound()
106 return (SE.isLoopEntryGuardedByCond(L, BoundPred, StartLG, in isSafeIncreasingBound()
108 SE.isLoopEntryGuardedByCond(L, BoundPred, BoundLG, Limit)); in isSafeIncreasingBound()
|
| H A D | LoopUtils.cpp | 1332 SE.isLoopEntryGuardedByCond(L, ICmpInst::ICMP_SLT, S, Zero); in isKnownNegativeInLoop()
1339 SE.isLoopEntryGuardedByCond(L, ICmpInst::ICMP_SGE, S, Zero); in isKnownNonNegativeInLoop()
1346 SE.isLoopEntryGuardedByCond(L, ICmpInst::ICMP_SGT, S, Zero); in isKnownPositiveInLoop()
1353 SE.isLoopEntryGuardedByCond(L, ICmpInst::ICMP_SLE, S, Zero); in isKnownNonPositiveInLoop()
1363 SE.isLoopEntryGuardedByCond(L, Predicate, S, in cannotBeMinInLoop()
1374 SE.isLoopEntryGuardedByCond(L, Predicate, S, in cannotBeMaxInLoop()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | InductiveRangeCheckElimination.cpp | |
| H A D | LoopBoundSplit.cpp | 276 if (!SE.isLoopEntryGuardedByCond(&L, SplitCandidateCond.Pred, in findSplitCandidate()
|
| H A D | LoopPredication.cpp | 384 if (SE->isLoopEntryGuardedByCond(L, Pred, LHS, RHS)) in run()
386 if (SE->isLoopEntryGuardedByCond(L, ICmpInst::getInversePredicate(Pred), in run()
|
| H A D | IndVarSimplify.cpp | 1703 if (SE->isLoopEntryGuardedByCond(L, CmpInst::ICMP_ULT, MaxBECount, in optimizeLoopExits()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | HardwareLoops.cpp | 459 if (SE.isLoopEntryGuardedByCond(L, ICmpInst::ICMP_NE, ExitCount, in InitLoopCount()
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | ScalarEvolution.cpp | 1393 SE->isLoopEntryGuardedByCond(L, Pred, PreStart, OverflowLimit)) in getPreStartForExtend()
8169 return L && isLoopEntryGuardedByCond(L, ICmpInst::ICMP_NE, ExitCount, in getTripCountFromExitCount()
10527 if (isLoopEntryGuardedByCond(L, ICmpInst::ICMP_NE, DistancePlusOne, Zero)) { in howFarToZero()
10931 isLoopEntryGuardedByCond(MDL, Pred, SplitLHS.first, SplitRHS.first); in isKnownViaInduction()
10987 return isLoopEntryGuardedByCond(L, Pred, LHS->getStart(), RHS) && in isKnownOnEveryIteration()
11607 bool ScalarEvolution::isLoopEntryGuardedByCond(const Loop *L, in isLoopEntryGuardedByCond() function in ScalarEvolution
12121 isLoopEntryGuardedByCond(L, Pred, FoundRHS, in isImpliedCondOperandsViaNoOverflow()
12954 return isLoopEntryGuardedByCond(L, Cond, StartIfZero, RHS); in howManyLessThans()
13071 if (isLoopEntryGuardedByCond(L, Cond, OrigStartMinusStride, OrigStart) && in howManyLessThans()
13072 isLoopEntryGuardedByCond(L, Cond, OrigStartMinusStride, OrigRHS)) { in howManyLessThans()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolution.h | 784 bool isLoopEntryGuardedByCond(const Loop *L, ICmpInst::Predicate Pred,
|