Home
last modified time | relevance | path

Searched refs:isLoopEntryGuardedByCond (Results 1 – 9 of 9) sorted by relevance

/openbsd-src/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DInductiveRangeCheckElimination.cpp685 return SE.isLoopEntryGuardedByCond(L, BoundPred, Start, BoundSCEV); in isSafeDecreasingBound()
699 return SE.isLoopEntryGuardedByCond(L, BoundPred, Start, MinusOne) && in isSafeDecreasingBound()
700 SE.isLoopEntryGuardedByCond(L, BoundPred, BoundSCEV, Limit); in isSafeDecreasingBound()
733 return SE.isLoopEntryGuardedByCond(L, BoundPred, Start, BoundSCEV); in isSafeIncreasingBound()
744 return (SE.isLoopEntryGuardedByCond(L, BoundPred, Start, in isSafeIncreasingBound()
746 SE.isLoopEntryGuardedByCond(L, BoundPred, BoundSCEV, Limit)); in isSafeIncreasingBound()
H A DLoopBoundSplit.cpp276 if (!SE.isLoopEntryGuardedByCond(&L, SplitCandidateCond.Pred, in findSplitCandidate()
H A DLoopPredication.cpp424 if (SE->isLoopEntryGuardedByCond(L, Pred, LHS, RHS)) in expandCheck()
426 if (SE->isLoopEntryGuardedByCond(L, ICmpInst::getInversePredicate(Pred), in expandCheck()
H A DIndVarSimplify.cpp1814 if (SE->isLoopEntryGuardedByCond(L, CmpInst::ICMP_ULT, MaxBECount, in optimizeLoopExits()
H A DLoopIdiomRecognize.cpp1068 SE->isLoopEntryGuardedByCond( in getTripCount()
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Utils/
H A DLoopUtils.cpp1116 SE.isLoopEntryGuardedByCond(L, ICmpInst::ICMP_SLT, S, Zero); in isKnownNegativeInLoop()
1123 SE.isLoopEntryGuardedByCond(L, ICmpInst::ICMP_SGE, S, Zero); in isKnownNonNegativeInLoop()
1133 SE.isLoopEntryGuardedByCond(L, Predicate, S, in cannotBeMinInLoop()
1144 SE.isLoopEntryGuardedByCond(L, Predicate, S, in cannotBeMaxInLoop()
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DHardwareLoops.cpp397 if (SE.isLoopEntryGuardedByCond(L, ICmpInst::ICMP_NE, ExitCount, in InitLoopCount()
/openbsd-src/gnu/llvm/llvm/lib/Analysis/
H A DScalarEvolution.cpp1451 SE->isLoopEntryGuardedByCond(L, Pred, PreStart, OverflowLimit)) in getPreStartForExtend()
10509 if (isLoopEntryGuardedByCond(L, ICmpInst::ICMP_NE, DistancePlusOne, Zero)) { in howFarToZero()
10901 isLoopEntryGuardedByCond(MDL, Pred, SplitLHS.first, SplitRHS.first); in isKnownViaInduction()
10957 return isLoopEntryGuardedByCond(L, Pred, LHS->getStart(), RHS) && in isKnownOnEveryIteration()
11569 bool ScalarEvolution::isLoopEntryGuardedByCond(const Loop *L, in isLoopEntryGuardedByCond() function in ScalarEvolution
12080 isLoopEntryGuardedByCond(L, Pred, FoundRHS, in isImpliedCondOperandsViaNoOverflow()
12907 return isLoopEntryGuardedByCond(L, Cond, StartIfZero, RHS); in howManyLessThans()
12981 if (isLoopEntryGuardedByCond(L, Cond, OrigStartMinusStride, OrigStart) && in howManyLessThans()
12982 isLoopEntryGuardedByCond(L, Cond, OrigStartMinusStride, OrigRHS)) { in howManyLessThans()
13011 if (isLoopEntryGuardedByCond(L, CondGE, OrigRHS, OrigStart)) in howManyLessThans()
[all …]
/openbsd-src/gnu/llvm/llvm/include/llvm/Analysis/
H A DScalarEvolution.h775 bool isLoopEntryGuardedByCond(const Loop *L, ICmpInst::Predicate Pred,