| /freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineAndOrXor.cpp | 1197 : match(CmpV, m_Not(m_Trunc(m_Xor(m_Value(X), m_Value(Y)))))) in foldEqOfParts() 1708 if (match(Op0, m_OneUse(m_Not(m_Value(A)))) && in matchDeMorgansLaws() 1709 match(Op1, m_OneUse(m_Not(m_Value(B)))) && in matchDeMorgansLaws() 1723 if (match(Op0, m_OneUse(m_c_BinOp(Opcode, m_Value(A), m_Not(m_Value(B))))) && in matchDeMorgansLaws() 1724 match(Op1, m_Not(m_Value(C)))) { in matchDeMorgansLaws() 1907 m_Not(m_c_And(m_Deferred(A), m_Deferred(B)))))) in foldAndToXor() 1915 if (match(&I, m_BinOp(m_c_Or(m_Value(A), m_Not(m_Value(B))), in foldAndToXor() 1916 m_c_Or(m_Not(m_Deferred(A)), m_Deferred(B))))) in foldAndToXor() 1934 match(Op1, m_Not(m_c_Or(m_Specific(A), m_Specific(B))))) in foldOrToXor() 1942 match(Op1, m_Not(m_c_Or(m_Specific(A), m_Specific(B))))) in foldOrToXor() [all …]
|
| H A D | InstCombineSelect.cpp | 1065 if (match(Cmp0, m_Not(m_Value(X))) && in canonicalizeSaturatedAdd() 1221 (!match(X, m_Not(m_Specific(CmpLHS))) || !match(CmpRHS, m_AllOnes())) && in foldSelectCttzCtlz() 1459 m_c_LogicalAnd(m_Not(m_Specific(YeqZ)), m_Value(XeqY)))) in foldSelectEqualityTest() 2710 m_Br(m_Not(m_Specific(Cond)), m_BasicBlock(TrueSucc), in foldSelectToPhiImpl() 3132 if (match(OuterSel.Cond, m_Not(m_Value(OuterSel.Cond)))) in foldNestedSelects() 3156 if (match(InnerSel.Cond, m_Not(m_Value(InnerSel.Cond)))) in foldNestedSelects() 3178 m_Not(m_Specific(InnerSel.Cond)), m_Value(NotInnerCond)))) { in foldNestedSelects() 3346 if (match(&SI, m_LogicalAnd(m_Not(m_Value(A)), m_Not(m_Value(B)))) && in foldSelectOfBools() 3353 if (match(&SI, m_LogicalOr(m_Not(m_Value(A)), m_Not(m_Value(B)))) && in foldSelectOfBools() 3368 if (match(&SI, m_c_LogicalAnd(m_Not(m_LogicalAnd(m_Value(A), m_Value(B))), in foldSelectOfBools() [all …]
|
| H A D | InstCombineShifts.cpp | 219 auto MaskB = m_Not(m_Shl(m_AllOnes(), m_Value(MaskShAmt))); in dropRedundantMaskingOfLeftShiftInput() 779 return !(Shift.isLogicalShift() && match(BO, m_Not(m_Value()))); in canShiftBinOpWithConstantRHS() 1296 if (match(Op0, m_OneUse(m_Not(m_Value(X)))) && in visitLShr() 1491 m_Not(m_Deferred(X)))))) in visitLShr() 1788 m_Not(m_Deferred(X)))))) in visitAShr() 1839 if (match(Op0, m_OneUse(m_Not(m_Value(X))))) { in visitAShr()
|
| H A D | InstCombineAddSub.cpp | 890 if (match(Op0, m_Not(m_Value(X)))) { in foldAddWithConstant() 1249 if (match(&I, m_c_Add(m_c_UMin(m_Value(X), m_Not(m_Value(Y))), in foldToUnsignedSaturatedAdd() 1606 if (match(&I, m_c_BinOp(m_Add(m_Value(A), m_One()), m_Not(m_Value(B)))) || in visitAdd() 1607 match(&I, m_BinOp(m_c_Add(m_Not(m_Value(B)), m_Value(A)), m_One()))) in visitAdd() 1733 m_c_Add(m_OneUse(m_Not(m_OneUse(m_Mul(m_Value(A), m_APInt(C1))))), in visitAdd() 2466 if (match(Op1, m_Not(m_Value(X)))) in visitSub() 2690 if (match(Op0, m_Not(m_Value(X))) && in visitSub() 2696 if (match(Op1, m_Not(m_Value(X))) && in visitSub()
|
| H A D | InstCombineNegator.cpp | 173 if (match(I, m_Not(m_Value(X)))) in visitImpl()
|
| H A D | InstCombineCalls.cpp | 673 m_c_And(m_Not(m_Value(X)), m_Add(m_Deferred(X), m_AllOnes())))) { in foldCtpop() 868 if (!match(I->getArgOperand(0), m_Not(m_Specific(U)))) in foldIntrinsicWithOverflowCommon() 2083 if (match(X, m_OneUse(m_Not(m_Value(A)))) && in visitCallInst() 3318 if (match(IIOperand, m_Not(m_LogicalOr(m_Value(A), m_Value(B))))) { in visitCallInst() 3391 (match(IIOperand, m_Not(m_Trunc(m_Value(A)))) || in visitCallInst()
|
| H A D | InstructionCombining.cpp | 1101 if (match(A, m_Not(m_Specific(CondVal)))) { in foldBinOpOfSelectAndCastOfSelectCondition() 2756 if (match(V, m_Not(m_Value(A)))) { in getFreelyInvertedImpl() 4027 if (match(Cond, m_Not(m_Value(X))) && !isa<Constant>(X)) { in visitBranchInst() 4041 m_OneUse(m_LogicalAnd(m_Value(X), m_OneUse(m_Not(m_Value(Y))))))) { in visitBranchInst()
|
| H A D | InstCombineSimplifyDemanded.cpp | 916 match(II->getArgOperand(0), m_Not(m_Value(X)))) { in SimplifyDemandedUseBits()
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | OverflowInstAnalysis.cpp | 58 match(Op1, m_Not(m_Value(NotOp1))) && matchMulOverflowCheck(NotOp1)); in isCheckForZeroAndMulWithOverflow()
|
| H A D | InstructionSimplify.cpp | 623 if (match(Op0, m_Not(m_Specific(Op1))) || match(Op1, m_Not(m_Specific(Op0)))) in simplifyAddInst() 1977 if (match(Op0, m_Not(m_Specific(Op1)))) in simplifyAndCommutative() 1986 if (match(Op0, m_c_Or(m_Value(X), m_Not(m_Value(Y)))) && in simplifyAndCommutative() 2214 if (match(Y, m_Not(m_Specific(X)))) in simplifyOrLogic() 2218 if (match(Y, m_Not(m_c_And(m_Specific(X), m_Value())))) in simplifyOrLogic() 2235 if (match(X, m_Not(m_Xor(m_Value(A), m_Value(B)))) && in simplifyOrLogic() 2243 if (match(X, m_c_And(m_Value(A), m_Not(m_Value(B)))) && in simplifyOrLogic() 2251 if (match(X, m_c_Xor(m_Not(m_Value(A)), m_Value(B))) && in simplifyOrLogic() 2259 if (match(X, m_c_Or(m_Not(m_Value(A)), m_Value(B))) && in simplifyOrLogic() 2268 if (match(X, m_c_And(m_CombineAnd(m_Value(NotA), m_Not(m_Value(A))), in simplifyOrLogic() [all …]
|
| H A D | CmpInstAnalysis.cpp | 203 match(Cond, m_Not(m_Trunc(m_Value(X)))))) { in decomposeBitTest()
|
| H A D | ValueTracking.cpp | 181 if (match(LHS, m_c_And(m_Not(m_Value(M)), m_Value())) && in haveNoCommonBitsSetSpecialCases() 188 if (match(RHS, m_c_And(m_Not(m_Specific(LHS)), m_Value())) && in haveNoCommonBitsSetSpecialCases() 204 match(RHS, m_ZExtOrSExt(m_Not(m_Specific(Y)))) && in haveNoCommonBitsSetSpecialCases() 212 match(RHS, m_Not(m_c_Or(m_Specific(A), m_Specific(B)))) && in haveNoCommonBitsSetSpecialCases() 841 if (Depth < MaxAnalysisRecursionDepth && match(Cond, m_Not(m_Value(A)))) in computeKnownBitsFromCond() 916 if (match(Arg, m_Not(m_Specific(V))) && in computeKnownBitsFromContext() 4577 if (Depth < MaxAnalysisRecursionDepth && match(Cond, m_Not(m_Value(A)))) { in computeKnownFPClassFromCond() 8335 if ((CmpLHS == A && CmpRHS == C) || (match(C, m_Not(m_Specific(CmpLHS))) && in matchMinMaxOfMinMax() 8336 match(A, m_Not(m_Specific(CmpRHS))))) in matchMinMaxOfMinMax() 8342 if ((CmpLHS == A && CmpRHS == D) || (match(D, m_Not(m_Specific(CmpLHS))) && in matchMinMaxOfMinMax() [all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/InstCombine/ |
| H A D | InstCombiner.h | 148 match(V, m_Not(PatternMatch::m_Value())) || in getComplexity() 263 if (!match(I, m_Not(PatternMatch::m_Value()))) in canFreelyInvertAllUsersOf()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | SelectOptimize.cpp | 792 bool Inverted = match(Cond, m_Not(m_Value(Cond))); in collectSelectGroups() 796 if (match(I, m_Not(m_Value(Cond)))) { in collectSelectGroups() 802 bool Inverted = match(Cond, m_Not(m_Value(Cond))); in collectSelectGroups()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | Reassociate.cpp | 225 if (!match(I, m_Not(m_Value())) && !match(I, m_Neg(m_Value())) && in getRank() 1196 if (match(Ops[i].Op, m_Not(m_Value(X)))) { // Cannot occur for ^. in OptimizeAndOrXor() 1542 if (!match(TheOp, m_Neg(m_Value(X))) && !match(TheOp, m_Not(m_Value(X))) && in OptimizeAdd() 1556 if (Ops.size() == 2 && match(TheOp, m_Not(m_Value()))) in OptimizeAdd() 1570 if (match(TheOp, m_Not(m_Value()))) { in OptimizeAdd()
|
| H A D | StructurizeCFG.cpp | 646 if (match(PI.Pred, m_Not(m_OneUse(m_Instruction(Inverted)))) && in simplifyConditions()
|
| H A D | EarlyCSE.cpp | 184 if (match(Cond, m_Not(m_Value(CondNot)))) { in matchSelectWithOptionalNotCond()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanTransforms.cpp | 1068 m_LogicalAnd(m_Deferred(X), m_Not(m_Deferred(Y)))))) { in simplifyRecipe() 1087 if (match(Def, m_Select(m_Not(m_VPValue(C)), m_VPValue(X), m_VPValue(Y)))) { in simplifyRecipe() 1097 if (match(Def, m_Not(m_VPValue(A)))) { in simplifyRecipe() 1098 if (match(A, m_Not(m_VPValue(A)))) in simplifyRecipe() 1322 match(NewBlend->getMask(1), m_Not(m_VPValue(NewMask)))) { in simplifyBlends() 1457 m_Not(m_ActiveLaneMask(m_VPValue(), m_VPValue()))))) { in simplifyBranchConditionForVFAndUF()
|
| H A D | VPlanPatternMatch.h | 492 m_Not(const Op0_t &Op0) { in m_Not() function
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUTargetMachine.cpp | 1022 m_c_And(m_Not(m_Intrinsic<Intrinsic::amdgcn_is_shared>(m_Value(Ptr))), in getPredicatedAddrSpace() 1023 m_Not(m_Intrinsic<Intrinsic::amdgcn_is_private>( in getPredicatedAddrSpace()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/ |
| H A D | RISCVTargetTransformInfo.cpp | 2843 if (match(Op.get(), m_Not(m_Value()))) { in isProfitableToSinkOperands() 2852 if (match(Op.get(), m_Not(m_Value()))) { in isProfitableToSinkOperands() 2857 if (match(Op.get(), m_Shuffle(m_InsertElt(m_Value(), m_Not(m_Value()), in isProfitableToSinkOperands()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/ |
| H A D | MIPatternMatch.h | 905 m_Not(const SrcTy &&Src) {
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | SDPatternMatch.h | 1239 inline BinaryOpc_match<ValTy, AllOnes_match, true> m_Not(const ValTy &V) {
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | PatternMatch.h | 2523 m_Not(const ValTy &V) { in m_Not() function 2568 auto XorExpr = m_OneUse(m_Not(m_Value(Op1))); in match()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | Local.cpp | 4300 if (match(Condition, m_Not(m_Value(NotCondition)))) in invertCondition() 4314 if (I->getParent() == Parent && match(I, m_Not(m_Specific(Condition)))) in invertCondition()
|