| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | CmpInstAnalysis.cpp | 60 (CmpInst::isSigned(P1) && ICmpInst::isEquality(P2)) || in predicatesFoldable() 61 (CmpInst::isSigned(P2) && ICmpInst::isEquality(P1)); in predicatesFoldable() 83 if ((ICmpInst::isEquality(Pred) && !DecomposeAnd) || in decomposeBitTestICmp()
|
| H A D | ValueLattice.cpp | 31 if (ICmpInst::isEquality(Pred)) { in getCompare()
|
| H A D | CaptureTracking.cpp | 366 cast<ICmpInst>(I)->isEquality()) { in DetermineUseCaptureKind()
|
| H A D | BranchProbabilityInfo.cpp | 518 if (!CI || !CI->isEquality()) in calcPointerHeuristics() 1037 if (FCmp->isEquality()) { in calcFloatingPointHeuristics()
|
| H A D | InstructionSimplify.cpp | 1515 !ICmpInst::isEquality(EqPred)) in simplifyUnsignedRangeCheck() 1907 !ICmpInst::isEquality(Pred)) in simplifyAndOrWithICmpEq() 2707 bool AllowNonInbounds = ICmpInst::isEquality(Pred); in computePointerICmp() 2720 if (ICmpInst::isEquality(Pred)) { in computePointerICmp() 3021 if (Q.IIQ.UseInstrInfo && ICmpInst::isEquality(Pred) && in simplifyICmpWithConstant() 3209 (*C & 1) == 1 && ICmpInst::isEquality(Pred)) in simplifyICmpWithBinOpOnLHS() 3266 ICmpInst::isEquality(Pred) || in simplifyICmpWithBinOp() 3276 ICmpInst::isEquality(Pred) || in simplifyICmpWithBinOp() 3453 if (!ICmpInst::isEquality(Pred) || !Q.IIQ.isExact(LBO) || in simplifyICmpWithBinOp() 3766 if (Q.isUndefValue(RHS) && ICmpInst::isEquality(Pred)) in simplifyICmpInst() [all …]
|
| H A D | LazyValueInfo.cpp | 1205 if (ICI->isEquality() && LHS == Val) { in getValueFromICmpCondition() 1283 if (ICI->isEquality() && match(Val, m_Sub(m_Value(X), m_Value(Y)))) { in getValueFromICmpCondition()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineCompares.cpp | 692 if (ICmpInst::isEquality(Cond)) in foldGEPICmp() 721 if (GEPLHS->isInBounds() && ICmpInst::isEquality(Cond) && in foldGEPICmp() 895 if (ICmp && ICmp->isEquality() && getUnderlyingObject(*U) == Alloca) { in foldAllocaCmp() 993 assert(I.isEquality() && "Cannot fold icmp gt/lt"); in foldICmpShrConstConst() 1052 assert(I.isEquality() && "Cannot fold icmp gt/lt"); in foldICmpShlConstConst() 1182 if (!I.isEquality()) in foldIRemByPowerOfTwoToBitTest() 1202 if (!I.isEquality() || !match(&I, m_ICmp(Pred, m_Instruction(Val), m_Zero()))) in foldSignBitTest() 1255 ICmpInst::isEquality(Pred)) { in foldICmpWithZero() 1265 ICmpInst::isEquality(Pred)) { in foldICmpWithZero() 1307 if (ICmpInst::isEquality(Pred)) in foldICmpWithZero() [all …]
|
| H A D | InstCombineAndOrXor.cpp | 245 if (!ICmpInst::isEquality(PredL)) in getMaskedTypeForICmpPair() 318 if (!ICmpInst::isEquality(PredR)) in getMaskedTypeForICmpPair() 500 assert(ICmpInst::isEquality(PredL) && ICmpInst::isEquality(PredR) && in foldLogOpOfMaskedICmpsAsymmetric() 537 assert(ICmpInst::isEquality(PredL) && ICmpInst::isEquality(PredR) && in foldLogOpOfMaskedICmps() 1011 assert(ICmpInst::isEquality(PredL) && ICmpInst::isEquality(PredR) && in foldNegativePower2AndShiftedMask() 1113 !ICmpInst::isEquality(EqPred)) in foldUnsignedUnderflowCheck() 3643 assert(ICmpInst::isEquality(ICmpDecompose->Pred) && in matchBitmaskMul() 4161 (ICmpInst::isEquality(Pred) || in visitOr() 4170 if (!Overflow || ICmpInst::isEquality(Pred)) { in visitOr() 4422 if (ICmpInst::isEquality(PredL) && ICmpInst::isEquality(PredR) && in foldXorOfICmps()
|
| H A D | InstCombineSelect.cpp | 67 if (ICmpInst::isEquality(Pred)) in foldSelectBinOpIdentity() 402 auto *MatchOp = getCommonOp(TI, FI, ICmpInst::isEquality(*P), in foldSelectOpOp() 892 !ICmpInst::isEquality(Predicate)) in foldSelectZeroOrMul() 1150 if (!ICI->isEquality() || !match(ICI->getOperand(1), m_Zero())) in foldSelectCtlzToCttz() 1196 if (!ICI->isEquality()) in foldSelectCttzCtlz() 1674 if (ICmpInst::isEquality(Pred)) in tryToReuseConstantFromSelectInComparison() 1862 if (!ICmpInst::isEquality(Pred)) in foldSelectICmpEq() 3032 !ICmpInst::isEquality(Pred)) in foldRoundUpIntegerWithPow2Alignment() 3867 if (ICmpInst::isEquality(Pred)) { in foldSelectBitTest() 3878 assert(ICmpInst::isEquality(Res->Pred) && "Not equality test?"); in foldSelectBitTest()
|
| H A D | InstCombineCasts.cpp | 1003 if (Op1CV->isZero() && Cmp->isEquality()) { in transformZExtICmp() 1035 if (Cmp->isEquality()) { in transformZExtICmp() 1371 Cmp->isEquality() && (Op1C->isZero() || Op1C->getValue().isPowerOf2())){ in transformSExtICmp()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/GISel/ |
| H A D | AArch64GlobalISelUtils.cpp | 54 !CmpInst::isEquality(Pred)) in isCMN()
|
| H A D | AArch64PreLegalizerCombiner.cpp | 80 if (!ICmpInst::isEquality(Pred)) in matchICmpRedundantTrunc()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | InstrTypes.h | 914 LLVM_ABI static bool isEquality(Predicate pred); 917 bool isEquality() const { return isEquality(getPredicate()); } 925 static bool isRelational(Predicate P) { return !isEquality(P); } 928 bool isRelational() const { return !isEquality(); }
|
| H A D | Instructions.h | 1316 static bool isEquality(Predicate P) { 1322 bool isEquality() const { 1323 return isEquality(getPredicate()); 1328 static bool isCommutative(Predicate P) { return isEquality(P); } 1337 return !isEquality(); 1343 return !isEquality(P); 1453 static bool isEquality(Predicate Pred) { 1460 bool isEquality() const { return isEquality(getPredicate()); } 1465 return isEquality(Pred) || Pred == FCMP_FALSE || Pred == FCMP_TRUE || 1475 bool isRelational() const { return !isEquality(); }
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopIdiomRecognize.cpp | 2758 return ICmpInst::isEquality(Pred) && match(CmpRHS, m_Zero()) && in detectShiftUntilBitTestIdiom() 2772 assert(ICmpInst::isEquality(Res->Pred)); in detectShiftUntilBitTestIdiom() 2809 assert(ICmpInst::isEquality(Pred) && in detectShiftUntilBitTestIdiom() 3113 !ICmpInst::isEquality(Pred)) { in detectShiftUntilZeroIdiom() 3161 assert(ICmpInst::isEquality(Pred) && in detectShiftUntilZeroIdiom()
|
| H A D | LoopPredication.cpp | 642 if (ICmpInst::isEquality(RC.Pred) && in normalizePredicate()
|
| H A D | ConstraintElimination.cpp | 676 assert((!ForceSignedSystem || CmpInst::isEquality(Pred)) && in getConstraint() 1660 if (CmpInst::isEquality(Pred)) in addFact()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | LoopPeel.cpp | 470 if (!(ICmpInst::isEquality(Pred) && LeftAR->hasNoSelfWrap()) && in countToEliminateCompares() 499 if (ICmpInst::isEquality(Pred) && in countToEliminateCompares()
|
| H A D | LoopConstrainer.cpp | 241 if (ICI->isEquality() && !HasNoSignedWrap(IndVarBase)) { in parseLoopStructure()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | HardwareLoops.cpp | 417 if (!ICmp->isEquality()) in CanGenerateTest()
|
| H A D | TypePromotion.cpp | 339 if (CI->isSigned() || CI->isEquality()) in isSafeWrap()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/SandboxIR/ |
| H A D | Instruction.h | 2521 WRAP_BOTH(isEquality); 2558 WRAP_BOTH(isEquality); 2592 WRAP_BOTH(isEquality);
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | Instructions.cpp | 3539 bool CmpInst::isEquality(Predicate P) { in isEquality() function in CmpInst 3541 return ICmpInst::isEquality(P); in isEquality() 3543 return FCmpInst::isEquality(P); in isEquality() 3908 if (CmpInst::isEquality(pred)) in getFlippedSignednessPredicate()
|
| H A D | ConstantFold.cpp | 1126 if (ICmpInst::isEquality(Predicate) || (isIntegerPredicate && C1 == C2)) in ConstantFoldCompareInstruction()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/ |
| H A D | AggressiveInstCombine.cpp | 881 !ICmpInst::isEquality(Pred)) in foldICmpOrChain()
|