| /llvm-project-15.0.7/llvm/test/Transforms/IndVarSimplify/X86/ |
| H A D | inner-loop.ll | 5 ; and utility function isLoopEntryGuardedByCond and that leads to miscompile.
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Scalar/ |
| H A D | InductiveRangeCheckElimination.cpp | 686 return SE.isLoopEntryGuardedByCond(L, BoundPred, Start, BoundSCEV); in isSafeDecreasingBound()
700 return SE.isLoopEntryGuardedByCond(L, BoundPred, Start, MinusOne) && in isSafeDecreasingBound()
701 SE.isLoopEntryGuardedByCond(L, BoundPred, BoundSCEV, Limit); in isSafeDecreasingBound()
734 return SE.isLoopEntryGuardedByCond(L, BoundPred, Start, BoundSCEV); in isSafeIncreasingBound()
745 return (SE.isLoopEntryGuardedByCond(L, BoundPred, Start, in isSafeIncreasingBound()
747 SE.isLoopEntryGuardedByCond(L, BoundPred, BoundSCEV, Limit)); in isSafeIncreasingBound()
|
| H A D | LoopBoundSplit.cpp | 276 if (!SE.isLoopEntryGuardedByCond(&L, SplitCandidateCond.Pred, in findSplitCandidate()
|
| H A D | LoopPredication.cpp | 415 if (SE->isLoopEntryGuardedByCond(L, Pred, LHS, RHS)) in expandCheck()
417 if (SE->isLoopEntryGuardedByCond(L, ICmpInst::getInversePredicate(Pred), in expandCheck()
|
| H A D | IndVarSimplify.cpp | 1694 if (SE->isLoopEntryGuardedByCond(L, CmpInst::ICMP_ULT, in optimizeLoopExits()
|
| H A D | LoopIdiomRecognize.cpp | 1067 SE->isLoopEntryGuardedByCond( in getTripCount()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Utils/ |
| H A D | LoopUtils.cpp | 1117 SE.isLoopEntryGuardedByCond(L, ICmpInst::ICMP_SLT, S, Zero); in isKnownNegativeInLoop()
1124 SE.isLoopEntryGuardedByCond(L, ICmpInst::ICMP_SGE, S, Zero); in isKnownNonNegativeInLoop()
1134 SE.isLoopEntryGuardedByCond(L, Predicate, S, in cannotBeMinInLoop()
1145 SE.isLoopEntryGuardedByCond(L, Predicate, S, in cannotBeMaxInLoop()
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | HardwareLoops.cpp | 397 if (SE.isLoopEntryGuardedByCond(L, ICmpInst::ICMP_NE, ExitCount, in InitLoopCount()
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | ScalarEvolution.cpp | 1459 SE->isLoopEntryGuardedByCond(L, Pred, PreStart, OverflowLimit)) in getPreStartForExtend()
10658 return isLoopEntryGuardedByCond(L, Pred, LHS->getStart(), RHS) && in isKnownOnEveryIteration()
11221 bool ScalarEvolution::isLoopEntryGuardedByCond(const Loop *L, in isLoopEntryGuardedByCond() function in ScalarEvolution
11732 isLoopEntryGuardedByCond(L, Pred, FoundRHS, in isImpliedCondOperandsViaNoOverflow()
12566 return isLoopEntryGuardedByCond(L, Cond, StartIfZero, RHS); in howManyLessThans()
12640 if (isLoopEntryGuardedByCond(L, Cond, OrigStartMinusStride, OrigStart) && in howManyLessThans()
12641 isLoopEntryGuardedByCond(L, Cond, OrigStartMinusStride, OrigRHS)) { in howManyLessThans()
12670 if (isLoopEntryGuardedByCond(L, CondGE, OrigRHS, OrigStart)) in howManyLessThans()
12685 return isLoopEntryGuardedByCond(L, CondGT, OrigRHS, StartMinusOne); in howManyLessThans()
12853 if (!isLoopEntryGuardedByCond(L, Cond, getAddExpr(Start, Stride), RHS)) { in howManyGreaterThans()
[all …]
|
| /llvm-project-15.0.7/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolution.h | 766 bool isLoopEntryGuardedByCond(const Loop *L, ICmpInst::Predicate Pred,
|