| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | CmpInstAnalysis.cpp | 90 Pred = ICmpInst::getInversePredicate(Pred); in decomposeBitTestICmp()
173 Result.Pred = ICmpInst::getInversePredicate(Result.Pred); in decomposeBitTestICmp()
|
| H A D | ValueLattice.cpp | 50 if (CR.icmp(CmpInst::getInversePredicate(Pred), OtherCR)) in getCompare()
|
| H A D | LazyValueInfo.cpp | 1159 Pred = ICmpInst::getInversePredicate(Pred); in getRangeViaSLT()
1202 isTrueDest ? ICI->getPredicate() : ICI->getInversePredicate(); in getValueFromICmpCondition()
1875 if (CR.icmp(CmpInst::getInversePredicate(Pred), RHS)) in getPredicateResult()
|
| H A D | ValueTracking.cpp | 784 Invert ? Cmp->getInversePredicate() : Cmp->getPredicate(); in computeKnownBitsFromICmpCond()
1750 Pred = CmpInst::getInversePredicate(Pred); in computeKnownBitsFromOperator()
2400 Pred = ICmpInst::getInversePredicate(Pred); in isImpliedToBeAPowerOfTwoFromCond()
2728 else if (cmpExcludesZero(CmpInst::getInversePredicate(Pred), RHS)) in isKnownNonNullFromDominatingCondition()
3157 Pred = ICmpInst::getInversePredicate(Pred); in isKnownNonZeroFromOperator()
3190 Pred = CmpInst::getInversePredicate(Pred); in isKnownNonZeroFromOperator()
8197 Pred = CmpInst::getInversePredicate(Pred); in matchFastFloatClamp()
8493 return Pred1 == ICmpInst::getInversePredicate(Pred2); in isKnownInversion()
9280 if (CR.icmp(CmpInst::getInversePredicate(Pred), RCR)) in isImpliedCondCommonOperandWithCR()
|
| H A D | LoopInfo.cpp | 248 : LatchCmpInst->getInversePredicate(); in getCanonicalPredicate()
|
| H A D | InstructionSimplify.cpp | 3545 CmpInst::Predicate InvEqP = CmpInst::getInversePredicate(EqP); in simplifyICmpWithMinMax()
3619 CmpInst::Predicate InvEqP = CmpInst::getInversePredicate(EqP); in simplifyICmpWithMinMax()
3792 if (LhsCr->icmp(CmpInst::getInversePredicate(Pred), *RhsCr)) in simplifyICmpInst()
4555 Pred = ICmpInst::getInversePredicate(Pred); in simplifyCmpSelOfMaxMin()
4608 ICmpInst::Predicate InvPred = CmpInst::getInversePredicate(Pred); in simplifyCmpSelOfMaxMin()
4783 Pred = FCmpInst::getInversePredicate(Pred); in simplifySelectWithFCmp()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | CodeMoverUtils.cpp | 217 if (Cmp1->getPredicate() == Cmp2->getInversePredicate() && in isInverse()
223 CmpInst::getSwappedPredicate(Cmp2->getInversePredicate()) && in isInverse()
|
| H A D | LoopPeel.cpp | 384 return SE.isKnownPredicate(ICmpInst::getInversePredicate(Pred), ValAtLastIter, in shouldPeelLastIteration()
424 return SE.isKnownPredicate(ICmpInst::getInversePredicate(Pred), IterVal, in countToEliminateCompares()
485 Pred = ICmpInst::getInversePredicate(Pred); in countToEliminateCompares()
500 !SE.isKnownPredicate(ICmpInst::getInversePredicate(Pred), NextIterVal, in countToEliminateCompares()
|
| H A D | FlattenCFG.cpp | 260 CI->setPredicate(ICmpInst::getInversePredicate(Predicate)); in FlattenParallelAndOr()
|
| H A D | PredicateInfo.cpp | 766 Pred = CmpInst::getInversePredicate(Pred); in getConstraint()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/GISel/ |
| H A D | AArch64GlobalISelUtils.cpp | 210 changeFCMPPredToAArch64CC(CmpInst::getInversePredicate(P), CondCode, in changeVectorFCMPPredToAArch64CC()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | EarlyCSE.cpp | 287 if (CmpInst::getInversePredicate(Pred) < Pred) { in getHashValueImpl()
288 Pred = CmpInst::getInversePredicate(Pred); in getHashValueImpl()
457 CmpInst::getInversePredicate(PredL) == PredR) in isEqualImpl()
|
| H A D | LoopPredication.cpp | 385 if (SE->isLoopEntryGuardedByCond(L, ICmpInst::getInversePredicate(Pred), in expandCheck()
838 Result->Pred = ICmpInst::getInversePredicate(Result->Pred); in parseLoopLatchICmp()
|
| H A D | ConstraintElimination.cpp | 1447 dbgs(), *ImpliedCondition ? Pred : CmpInst::getInversePredicate(Pred), in checkCondition()
1625 Pred = CmpInst::getInversePredicate(Pred); in checkOrAndOpImpliedByOther()
|
| H A D | StructurizeCFG.cpp | 649 InvertedCmp->setPredicate(InvertedCmp->getInversePredicate()); in simplifyConditions()
|
| H A D | LoopIdiomRecognize.cpp | 2814 Pred = ICmpInst::getInversePredicate(Pred); in detectShiftUntilBitTestIdiom()
3167 Pred = ICmpInst::getInversePredicate(Pred); in detectShiftUntilZeroIdiom()
|
| H A D | LICM.cpp | 2450 P = ICmpInst::getInversePredicate(P); in hoistMinMax()
2488 P = ICmpInst::getInversePredicate(P); in hoistMinMax()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineAndOrXor.cpp | 663 CC = IsNot ? CmpInst::getInversePredicate(CC) : CC; in foldLogOpOfMaskedICmps()
725 ICmpInst::Predicate Pred0 = (Inverted ? Cmp0->getInversePredicate() : in simplifyRangeCheck()
733 ICmpInst::Predicate Pred1 = (Inverted ? Cmp1->getInversePredicate() : in simplifyRangeCheck()
767 NewPred = ICmpInst::getInversePredicate(NewPred); in simplifyRangeCheck()
3297 IsAnd ? LHS->getInversePredicate() : LHS->getPredicate(); in foldAndOrOfICmpEqConstantAndICmp()
3299 IsAnd ? RHS->getInversePredicate() : RHS->getPredicate(); in foldAndOrOfICmpEqConstantAndICmp()
4459 Y->setPredicate(Y->getInversePredicate()); in foldXorOfICmps()
4816 cast<CmpInst>(NotOp)->setPredicate(CmpInst::getInversePredicate(Pred)); in foldNot()
4873 CmpT->setPredicate(CmpT->getInversePredicate()); in foldNot()
4877 CmpF->setPredicate(CmpF->getInversePredicate()); in foldNot()
|
| H A D | InstCombineSelect.cpp | 936 Pred = ICmpInst::getInversePredicate(Pred); in canonicalizeSaturatedSubtract()
1009 Pred = CmpInst::getInversePredicate(Pred); in canonicalizeSaturatedAdd()
1502 Pred0 = ICmpInst::getInversePredicate(Pred0); in canonicalizeClampLike()
1792 CPred = ICI->getInversePredicate(); in foldSelectInstWithICmpConst()
1897 Predicate = ICmpInst::getInversePredicate(Predicate); in foldSelectWithConstOpToBinOp()
3511 CmpInst::getInversePredicate(Pred), *Cond1); in isSafeToRemoveBitCeilSelect()
3597 Pred = CmpInst::getInversePredicate(Pred); in foldBitCeil()
4002 FCmpInst::Predicate InvPred = FCmp->getInversePredicate(); in visitSelectInst()
|
| H A D | InstCombineCompares.cpp | 997 Pred = CmpInst::getInversePredicate(Pred); in foldICmpShrConstConst()
1056 Pred = CmpInst::getInversePredicate(Pred); in foldICmpShlConstConst()
1437 handleDomCond(CmpInst::getInversePredicate(DomPred), DomC)) in foldICmpWithDominatingICmp()
5711 NewPred = ICmpInst::getInversePredicate(NewPred); in foldICmpWithMinMax()
6166 return new ICmpInst(CmpInst::getInversePredicate(Pred), Op0, in foldICmpEquality()
6171 return new ICmpInst(CmpInst::getInversePredicate(Pred), Op1, in foldICmpEquality()
7014 return new ICmpInst(CmpInst::getInversePredicate(Pred), Op0, in foldICmpUsingKnownBits()
7174 I.setPredicate(CmpInst::getInversePredicate(Pred)); in canonicalizeICmpPredicate()
7801 return new ICmpInst(I.getInversePredicate(), Builder.CreateAnd(X, Y), in visitICmpInst()
|
| H A D | InstructionCombining.cpp | 2778 return Builder->CreateCmp(I->getInversePredicate(), I->getOperand(0), in getFreelyInvertedImpl()
4061 Cmp->setPredicate(CmpInst::getInversePredicate(Pred)); in visitBranchInst()
4123 Pred = ICmpInst::getInversePredicate(Pred); in simplifySwitchOnSelectUsingRanges()
4341 return new ICmpInst(ICmpInst::getInversePredicate(Pred), NewLHS, in foldExtractOfOverflowIntrinsic()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | InstrTypes.h | 791 Predicate getInversePredicate() const {
792 return getInversePredicate(getPredicate());
821 LLVM_ABI static Predicate getInversePredicate(Predicate pred);
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUPostLegalizerCombiner.cpp | 183 Info.Pred = CmpInst::getInversePredicate(Info.Pred); in matchFMinFMaxLegacy()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | StackProtector.cpp | 699 Cmp->setPredicate(Cmp->getInversePredicate()); in InsertStackProtectors()
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | ConstantRange.cpp | 165 return makeAllowedICmpRegion(CmpInst::getInversePredicate(Pred), CR) in makeSatisfyingICmpRegion()
211 return CmpInst::getInversePredicate(FlippedSignednessPred); in getEquivalentPredWithFlippedSignedness()
|