| /freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | DependenceAnalysis.cpp | 486 if (isKnownPredicate(CmpInst::ICMP_EQ, Prod1, Prod2)) { in intersectConstraints() 491 if (isKnownPredicate(CmpInst::ICMP_EQ, Prod1, Prod2)) in intersectConstraints() 984 if (SE->isKnownPredicate(Pred, X, Y)) in isKnownPredicate() 1103 if (isKnownPredicate(CmpInst::ICMP_EQ, Src, Dst)) { in testZIV() 1107 if (isKnownPredicate(CmpInst::ICMP_NE, Src, Dst)) { in testZIV() 1349 if (isKnownPredicate(CmpInst::ICMP_SGT, Delta, ML)) { in weakCrossingSIVtest() 1355 if (isKnownPredicate(CmpInst::ICMP_EQ, Delta, ML)) { in weakCrossingSIVtest() 3145 else if (isKnownPredicate(CmpInst::ICMP_EQ, A, B)) { in propagateLine() 3227 if (!isKnownPredicate(CmpInst::ICMP_NE, in updateDirection() 3232 if (!isKnownPredicate(CmpInst::ICMP_SLE, in updateDirection() [all …]
|
| H A D | LoopCacheAnalysis.cpp | 423 return SE.isKnownPredicate(ICmpInst::ICMP_ULT, Stride, CacheLineSize); in isConsecutive()
|
| H A D | ScalarEvolution.cpp | 1531 if (Limit && isKnownPredicate(Pred, PreAR, Limit)) // proves (1) in proveNoWrapByVaryingStart() 5152 isKnownPredicate(ICmpInst::ICMP_NE, Expr, ExtendedExpr); in createAddRecFromPHIWithCastsImpl() 5172 !isKnownPredicate(ICmpInst::ICMP_EQ, Expr, ExtendedExpr)) { in createAddRecFromPHIWithCastsImpl() 9887 bool ScalarEvolution::isKnownPredicate(ICmpInst::Predicate Pred, in isKnownPredicate() function in ScalarEvolution 9905 if (isKnownPredicate(Pred, LHS, RHS)) in evaluatePredicate() 9907 else if (isKnownPredicate(ICmpInst::getInversePredicate(Pred), LHS, RHS)) in evaluatePredicate() 9916 return isKnownPredicate(Pred, LHS, RHS) || in isKnownPredicateAt() 10265 isKnownPredicate(CmpInst::ICMP_SLT, LHS, RHS); in isKnownPredicateViaSplitting() 10586 if (isKnownPredicate(ICmpInst::ICMP_ULE, FoundLHS, MaxValue) && in isImpliedCond() 10587 isKnownPredicate(ICmpInst::ICMP_ULE, FoundRHS, MaxValue)) { in isImpliedCond() [all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | LoopPeel.cpp | 247 if (!SE.isKnownPredicate(Pred, IterVal, RightSCEV)) in countToEliminateCompares() 264 SE.isKnownPredicate(Pred, IterVal, RightSCEV)) in countToEliminateCompares() 269 if (!SE.isKnownPredicate(ICmpInst::getInversePredicate(Pred), IterVal, in countToEliminateCompares() 277 !SE.isKnownPredicate(ICmpInst::getInversePredicate(Pred), NextIterVal, in countToEliminateCompares() 279 !SE.isKnownPredicate(Pred, IterVal, RightSCEV) && in countToEliminateCompares() 280 SE.isKnownPredicate(Pred, NextIterVal, RightSCEV)) { in countToEliminateCompares()
|
| H A D | SimplifyIndVar.cpp | 404 if (SE->isKnownPredicate(LT, N, D)) { in simplifyIVRemainder() 411 if (SE->isKnownPredicate(LT, NLessOne, D)) { in simplifyIVRemainder() 1801 SE->isKnownPredicate(ICmpInst::ICMP_SGE, NarrowSCEV, in pushNarrowIVUsers()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | InductiveRangeCheckElimination.cpp | 203 return SE.isKnownPredicate(ICmpInst::ICMP_SGE, Begin, End); in isEmpty() 205 return SE.isKnownPredicate(ICmpInst::ICMP_UGE, Begin, End); in isEmpty() 1132 SE.isKnownPredicate(PredLE, Range.getBegin(), Smallest); in calculateSubRanges() 1137 SE.isKnownPredicate(PredLT, GreatestSeen, Range.getEnd()); in calculateSubRanges()
|
| H A D | LoopBoundSplit.cpp | 104 if (SE.isKnownPredicate(Pred, Cond.BoundSCEV, MaxSCEV)) { in calculateUpperBound()
|
| H A D | LoopPredication.cpp | 666 SE->isKnownPredicate(ICmpInst::ICMP_ULE, RC.IV->getStart(), RC.Limit)) in normalizePredicate()
|
| H A D | IndVarSimplify.cpp | 1911 assert(!SE->isKnownPredicate(ICmpInst::ICMP_ULT, BackedgeTakenCount, in run()
|
| H A D | LoopFuse.cpp | 1105 bool IsAlwaysGE = SE.isKnownPredicate(Pred, SCEVPtr0, SCEVPtr1); in accessDiffIsPositive()
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | DependenceAnalysis.h | 560 bool isKnownPredicate(ICmpInst::Predicate Pred,
|
| H A D | ScalarEvolution.h | 979 bool isKnownPredicate(ICmpInst::Predicate Pred, const SCEV *LHS,
|