Home
last modified time | relevance | path

Searched refs:isKnownPredicate (Results 1 – 16 of 16) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DDependenceAnalysis.cpp541 if (isKnownPredicate(CmpInst::ICMP_EQ, X->getD(), Y->getD())) in intersectConstraints()
543 if (isKnownPredicate(CmpInst::ICMP_NE, X->getD(), Y->getD())) { in intersectConstraints()
570 if (isKnownPredicate(CmpInst::ICMP_EQ, Prod1, Prod2)) { in intersectConstraints()
575 if (isKnownPredicate(CmpInst::ICMP_EQ, Prod1, Prod2)) in intersectConstraints()
577 if (isKnownPredicate(CmpInst::ICMP_NE, Prod1, Prod2)) { in intersectConstraints()
584 if (isKnownPredicate(CmpInst::ICMP_NE, Prod1, Prod2)) { in intersectConstraints()
656 if (isKnownPredicate(CmpInst::ICMP_EQ, Sum, Y->getC())) in intersectConstraints()
658 if (isKnownPredicate(CmpInst::ICMP_NE, Sum, Y->getC())) { in intersectConstraints()
1070 bool DependenceInfo::isKnownPredicate(ICmpInst::Predicate Pred, const SCEV *X, in isKnownPredicate() function in DependenceInfo
1088 if (SE->isKnownPredicate(Pred, X, Y)) in isKnownPredicate()
[all …]
H A DLoopAccessAnalysis.cpp237 if (!SE.isKnownPredicate(CmpInst::ICMP_UGE, AR->getStart(), StartPtr)) in evaluatePtrAddRecAtMaxBTCWillNotWrap()
259 return SE.isKnownPredicate(CmpInst::ICMP_ULE, EndBytes, in evaluatePtrAddRecAtMaxBTCWillNotWrap()
267 return SE.isKnownPredicate(CmpInst::ICMP_SGE, StartOffset, OffsetEndBytes) && in evaluatePtrAddRecAtMaxBTCWillNotWrap()
268 SE.isKnownPredicate(CmpInst::ICMP_ULE, StartOffset, in evaluatePtrAddRecAtMaxBTCWillNotWrap()
1980 if (SE.isKnownPredicate(CmpInst::ICMP_ULE, SrcEnd, SinkStart)) in areAccessesCompletelyBeforeOrAfter()
1985 return SE.isKnownPredicate(CmpInst::ICMP_ULE, SinkEnd, SrcStart); in areAccessesCompletelyBeforeOrAfter()
H A DLoopCacheAnalysis.cpp504 return SE.isKnownPredicate(ICmpInst::ICMP_ULT, Stride, CacheLineSize); in isConsecutive()
H A DScalarEvolution.cpp1488 if (Limit && isKnownPredicate(Pred, PreAR, Limit)) // proves (1) in proveNoWrapByVaryingStart()
5607 isKnownPredicate(ICmpInst::ICMP_NE, Expr, ExtendedExpr); in createAddRecFromPHIWithCastsImpl()
5627 !isKnownPredicate(ICmpInst::ICMP_EQ, Expr, ExtendedExpr)) { in createAddRecFromPHIWithCastsImpl()
10199 if (!SE.isKnownPredicate(CmpInst::ICMP_EQ, URem, Zero)) { in SolveLinEquationWithOverflow()
10205 if (SE.isKnownPredicate(CmpInst::ICMP_NE, URem, Zero)) in SolveLinEquationWithOverflow()
11005 if (isKnownPredicate(ICmpInst::ICMP_EQ, SmodM, Zero)) in isKnownMultipleOf()
11009 if (isKnownPredicate(ICmpInst::ICMP_NE, SmodM, Zero)) in isKnownMultipleOf()
11086 bool ScalarEvolution::isKnownPredicate(CmpPredicate Pred, const SCEV *LHS, in isKnownPredicate() function in ScalarEvolution
11104 if (isKnownPredicate(Pred, LHS, RHS)) in evaluatePredicate()
11106 if (isKnownPredicate(ICmpInst::getInverseCmpPredicate(Pred), LHS, RHS)) in evaluatePredicate()
[all …]
H A DLoads.cpp398 return SE.isKnownPredicate(CmpInst::ICMP_ULE, AccessSizeSCEV, in isDereferenceableAndAlignedInLoop()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopPeel.cpp384 return SE.isKnownPredicate(ICmpInst::getInversePredicate(Pred), ValAtLastIter, in shouldPeelLastIteration()
386 SE.isKnownPredicate(Pred, ValAtSecondToLastIter, RightSCEV); in shouldPeelLastIteration()
420 SE.isKnownPredicate(Pred, IterVal, BoundSCEV)) { in countToEliminateCompares()
424 return SE.isKnownPredicate(ICmpInst::getInversePredicate(Pred), IterVal, in countToEliminateCompares()
484 if (!SE.isKnownPredicate(Pred, IterVal, RightSCEV)) in countToEliminateCompares()
500 !SE.isKnownPredicate(ICmpInst::getInversePredicate(Pred), NextIterVal, in countToEliminateCompares()
502 !SE.isKnownPredicate(Pred, IterVal, RightSCEV) && in countToEliminateCompares()
503 SE.isKnownPredicate(Pred, NextIterVal, RightSCEV)) { in countToEliminateCompares()
H A DSimplifyIndVar.cpp396 if (SE->isKnownPredicate(LT, N, D)) { in simplifyIVRemainder()
403 if (SE->isKnownPredicate(LT, NLessOne, D)) { in simplifyIVRemainder()
2014 SE->isKnownPredicate(ICmpInst::ICMP_SGE, NarrowSCEV, in pushNarrowIVUsers()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DInductiveRangeCheckElimination.cpp206 return SE.isKnownPredicate(ICmpInst::ICMP_SGE, Begin, End); in isEmpty()
208 return SE.isKnownPredicate(ICmpInst::ICMP_UGE, Begin, End); in isEmpty()
651 SE.isKnownPredicate(PredLE, Range.getBegin(), Smallest); in calculateSubRanges()
656 SE.isKnownPredicate(PredLT, GreatestSeen, Range.getEnd()); in calculateSubRanges()
H A DLoopBoundSplit.cpp111 if (SE.isKnownPredicate(Pred, Cond.BoundSCEV, MaxSCEV)) { in calculateUpperBound()
H A DLoopPredication.cpp644 SE->isKnownPredicate(ICmpInst::ICMP_ULE, RC.IV->getStart(), RC.Limit)) in normalizePredicate()
H A DLoopFuse.cpp1312 bool IsAlwaysGE = SE.isKnownPredicate(Pred, SCEVPtr0, SCEVPtr1); in accessDiffIsPositive()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DDependenceAnalysis.h596 bool isKnownPredicate(ICmpInst::Predicate Pred,
H A DScalarEvolution.h1113 LLVM_ABI bool isKnownPredicate(CmpPredicate Pred, const SCEV *LHS,
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp2362 if (SE.isKnownPredicate(P, TripCountSCEV, SE.getSCEV(Step))) { in createIterationCountCheck()
2366 } else if (!SE.isKnownPredicate(CmpInst::getInversePredicate(P), in createIterationCountCheck()
3659 SE->isKnownPredicate(CmpInst::ICMP_EQ, BTC, in computeMaxVF()
4493 if (SE.isKnownPredicate(CmpInst::ICMP_ULT, RemainingIterations, in selectEpilogueVectorizationFactor()
4501 if (SE.isKnownPredicate( in selectEpilogueVectorizationFactor()
H A DVPlanTransforms.cpp1441 return SE.isKnownPredicate(CmpInst::ICMP_EQ, TripCount, C); in isConditionTrueViaVFAndUF()
1468 !SE.isKnownPredicate(CmpInst::ICMP_ULE, TripCount, C)) in simplifyBranchConditionForVFAndUF()
/freebsd/contrib/llvm-project/llvm/include/llvm/Testing/Demangle/
H A DDemangleTestCases.inc20173 …cateENS_7CmpInst9PredicateEPKNS_4SCEVES5_", "llvm::ScalarEvolution::isKnownPredicate(llvm::CmpInst…