Home
last modified time | relevance | path

Searched refs:m_Value (Results 1 – 25 of 94) sorted by relevance

1234

/freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineAddSub.cpp765 if (match(RHS, m_Add(m_Value(X), m_One()))) in checkForNegativeOperand()
768 if (match(LHS, m_Add(m_Value(X), m_One()))) { in checkForNegativeOperand()
770 if (match(RHS, m_Xor(m_Value(Y), m_APInt(C1)))) in checkForNegativeOperand()
773 if (match(X, m_Xor(m_Value(Y), m_APInt(C1)))) { in checkForNegativeOperand()
776 if (match(Y, m_Or(m_Value(Z), m_APInt(C2))) && (*C2 == ~(*C1))) { in checkForNegativeOperand()
779 } else if (match(Y, m_And(m_Value(Z), m_APInt(C2))) && (*C1 == *C2)) { in checkForNegativeOperand()
793 if (match(RHS, m_Xor(m_Value(Y), m_APInt(C1)))) in checkForNegativeOperand()
799 if (match(LHS, m_Xor(m_Value(Y), m_APInt(C1)))) in checkForNegativeOperand()
801 if (match(Y, m_And(m_Value(Z), m_APInt(C2))) && *C1 == (*C2 + 1)) { in checkForNegativeOperand()
822 match(Op0, m_ZExt(m_NUWAddLike(m_Value(X), m_APInt(C2)))) && in foldNoWrapAdd()
[all …]
H A DInstCombineAndOrXor.cpp220 if (!match(L1, m_And(m_Value(L11), m_Value(L12)))) { in getMaskedTypeForICmpPair()
227 if (!match(L2, m_And(m_Value(L21), m_Value(L22)))) { in getMaskedTypeForICmpPair()
255 if (!match(R1, m_And(m_Value(R11), m_Value(R12)))) { in getMaskedTypeForICmpPair()
281 if (!match(R2, m_And(m_Value(R11), m_Value(R12)))) { in getMaskedTypeForICmpPair()
732 if (!match(LHS, m_OneUse(m_ICmp(Pred, m_Value(Op), m_Zero()))) || in foldAndOrOfICmpsWithPow2AndWithZero()
733 !match(RHS, m_OneUse(m_c_ICmp(Pred, m_Specific(Op), m_Value(Pow2)))) || in foldAndOrOfICmpsWithPow2AndWithZero()
759 if (match(LHS->getOperand(0), m_And(m_Value(L1), m_Value(L2))) && in foldAndOrOfICmpsOfAndWithPow2()
760 match(RHS->getOperand(0), m_And(m_Value(R1), m_Value(R2)))) { in foldAndOrOfICmpsOfAndWithPow2()
824 m_ICmp(Pred, m_Add(m_Value(X), m_Power2(I01)), m_Power2(I1))) && in foldSignedTruncationCheck()
858 if (match(ICmp, m_ICmp(Pred, m_And(m_Value(X), m_APInt(Mask)), m_Zero())) && in foldSignedTruncationCheck()
[all …]
H A DInstCombineMulDivRem.cpp58 if (match(V, m_LShr(m_OneUse(m_Shl(m_Value(One), m_Value(A))), m_Value(B))) && in simplifyValueKnownNonZero()
105 if (match(&I, m_c_Mul(m_OneUse(m_Select(m_Value(Cond), m_One(), m_AllOnes())), in foldMulSelectToNegate()
106 m_Value(OtherOp)))) { in foldMulSelectToNegate()
113 if (match(&I, m_c_Mul(m_OneUse(m_Select(m_Value(Cond), m_AllOnes(), m_One())), in foldMulSelectToNegate()
114 m_Value(OtherOp)))) { in foldMulSelectToNegate()
122 if (match(&I, m_c_FMul(m_OneUse(m_Select(m_Value(Cond), m_SpecificFP(1.0), in foldMulSelectToNegate()
124 m_Value(OtherOp)))) { in foldMulSelectToNegate()
132 if (match(&I, m_c_FMul(m_OneUse(m_Select(m_Value(Cond), m_SpecificFP(-1.0), in foldMulSelectToNegate()
134 m_Value(OtherOp)))) { in foldMulSelectToNegate()
156 if (match(Y, m_Shl(m_One(), m_Value(Z)))) { in foldMulShl1()
[all …]
H A DInstCombineShifts.cpp65 m_Shift(m_Instruction(Sh0Op0), m_ZExtOrSelf(m_Value(ShAmt0))))) in reassociateShiftAmtsOfTwoSameDirectionShifts()
74 m_CombineOr(m_CombineAnd(m_Trunc(m_Instruction(Sh1)), m_Value(Trunc)), in reassociateShiftAmtsOfTwoSameDirectionShifts()
80 if (!match(Sh1, m_Shift(m_Value(X), m_ZExtOrSelf(m_Value(ShAmt1))))) in reassociateShiftAmtsOfTwoSameDirectionShifts()
88 bool HadTwoRightShifts = match(Sh0, m_Shr(m_Value(), m_Value())) && in reassociateShiftAmtsOfTwoSameDirectionShifts()
89 match(Sh1, m_Shr(m_Value(), m_Value())); in reassociateShiftAmtsOfTwoSameDirectionShifts()
105 !match(Sh0, m_c_BinOp(m_OneUse(m_Value()), m_Value()))) in reassociateShiftAmtsOfTwoSameDirectionShifts()
197 m_Shift(m_Value(Masked), m_ZExtOrSelf(m_Value(ShiftShAmt)))); in dropRedundantMaskingOfLeftShiftInput()
202 if (match(Masked, m_CombineAnd(m_Trunc(m_Value(Masked)), m_Value(Trunc))) && in dropRedundantMaskingOfLeftShiftInput()
217 auto MaskA = m_Add(m_Shl(m_One(), m_Value(MaskShAmt)), m_AllOnes()); in dropRedundantMaskingOfLeftShiftInput()
219 auto MaskB = m_Not(m_Shl(m_AllOnes(), m_Value(MaskShAmt))); in dropRedundantMaskingOfLeftShiftInput()
[all …]
H A DInstCombineSelect.cpp62 if (!match(Sel.getCondition(), m_Cmp(Pred, m_Value(X), m_Constant(C)))) in foldSelectBinOpIdentity()
93 if (!BO->isCommutative() && !match(BO, m_BinOp(m_Value(Y), m_Specific(X)))) in foldSelectBinOpIdentity()
95 if (!match(BO, m_c_BinOp(m_Value(Y), m_Specific(X)))) in foldSelectBinOpIdentity()
144 if (!match(V, m_And(m_Value(), m_Power2(AndRHS)))) in foldSelectICmpAnd()
277 if ((match(&SI, m_SMin(m_Value(), m_Value())) || in foldSelectOpOp()
278 match(&SI, m_SMax(m_Value(), m_Value())) || in foldSelectOpOp()
279 match(&SI, m_UMin(m_Value(), m_Value())) || in foldSelectOpOp()
280 match(&SI, m_UMax(m_Value(), m_Value())))) in foldSelectOpOp()
368 if (match(TI, m_FNeg(m_Value(X))) && match(FI, m_FNeg(m_Value(Y)))) { in foldSelectOpOp()
390 if (match(TII, m_MaxOrMin(m_Value(), m_Value()))) { in foldSelectOpOp()
[all …]
H A DInstCombineCalls.cpp491 if (match(Op0, m_BitReverse(m_Value(X)))) { in foldCttzCtlz()
509 match(II.user_back(), m_Shift(m_Value(), m_Specific(&II)))) { in foldCttzCtlz()
518 if (match(Op0, m_Neg(m_Value(X)))) in foldCttzCtlz()
522 if (match(Op0, m_c_And(m_Neg(m_Value(X)), m_Deferred(X)))) in foldCttzCtlz()
526 if (match(Op0, m_OneUse(m_SExt(m_Value(X))))) { in foldCttzCtlz()
535 if (match(Op0, m_OneUse(m_ZExt(m_Value(X)))) && match(Op1, m_One())) { in foldCttzCtlz()
549 if (match(Op0, m_Intrinsic<Intrinsic::abs>(m_Value(X)))) in foldCttzCtlz()
553 if (match(Op0, m_Shl(m_ImmConstant(C), m_Value(X))) && in foldCttzCtlz()
561 if (match(Op0, m_Exact(m_LShr(m_ImmConstant(C), m_Value(X)))) && in foldCttzCtlz()
569 if (match(Op0, m_Add(m_LShr(m_AllOnes(), m_Value(X)), m_One()))) { in foldCttzCtlz()
[all …]
H A DInstCombineCompares.cpp1158 if (!match(&I, m_ICmp(Pred, m_OneUse(m_IRem(m_Value(X), m_Value(Y))), in foldIRemByPowerOfTwoToBitTest()
1159 m_CombineAnd(m_Zero(), m_Value(Zero))))) in foldIRemByPowerOfTwoToBitTest()
1181 if (match(Val, m_TruncOrSelf(m_Shr(m_Value(X), m_Constant(C))))) { in foldSignBitTest()
1210 if (match(Cmp.getOperand(0), m_SMin(m_Value(A), m_Value(B)))) { in foldICmpWithZero()
1226 if (match(Cmp.getOperand(0), m_URem(m_Value(X), m_Value(Y))) && in foldICmpWithZero()
1236 if (match(Cmp.getOperand(0), m_Mul(m_Value(X), m_Value(Y))) && in foldICmpWithZero()
1301 match(Op0, m_Add(m_Add(m_Value(A), m_Value(B)), m_ConstantInt(CI2)))) in foldICmpWithConstant()
1376 match(Cmp.user_back(), m_MaxOrMin(m_Value(), m_Value()))) in foldICmpWithDominatingICmp()
1431 if (Pred == ICmpInst::ICMP_SLT && match(X, m_Signum(m_Value(V)))) in foldICmpTruncConstant()
1439 if (Cmp.isEquality() && match(X, m_Shl(m_One(), m_Value(Y)))) { in foldICmpTruncConstant()
[all …]
H A DInstCombineCasts.cpp189 match(&CI, m_ElementWiseBitCast(m_Value()))) { in commonCastTransforms()
214 if (match(Src, m_OneUse(m_Shuffle(m_Value(X), m_Undef(), m_Mask(Mask))))) { in commonCastTransforms()
236 if ((match(V, m_ZExtOrSExt(m_Value(X))) || match(V, m_Trunc(m_Value(X)))) && in canAlwaysEvaluateInType()
410 if (!match(TruncOp, m_CombineOr(m_BitCast(m_Value(VecInput)), in foldVecTruncToExtElt()
411 m_LShr(m_BitCast(m_Value(VecInput)), in foldVecTruncToExtElt()
461 if (!match(Or0, m_OneUse(m_LogicalShift(m_Value(ShVal0), m_Value(ShAmt0)))) || in narrowFunnelShift()
462 !match(Or1, m_OneUse(m_LogicalShift(m_Value(ShVal1), m_Value(ShAmt1)))) || in narrowFunnelShift()
498 if (match(L, m_And(m_Value(X), m_SpecificInt(Mask))) && in narrowFunnelShift()
503 if (match(L, m_ZExt(m_And(m_Value(X), m_SpecificInt(Mask)))) && in narrowFunnelShift()
580 if (match(BinOp0, m_ZExtOrSExt(m_Value(X))) && X->getType() == DestTy) { in narrowBinOp()
[all …]
H A DInstCombineVectorOps.cpp75 if (match(V, m_InsertElt(m_Value(), m_Value(), m_ConstantInt()))) in cheapToScalarize()
78 if (match(V, m_OneUse(m_Load(m_Value())))) in cheapToScalarize()
85 if (match(V, m_OneUse(m_BinOp(m_Value(V0), m_Value(V1))))) in cheapToScalarize()
90 if (match(V, m_OneUse(m_Cmp(UnusedPred, m_Value(V0), m_Value(V1))))) in cheapToScalarize()
186 if (!match(Ext.getVectorOperand(), m_BitCast(m_Value(X))) || in foldBitcastExtElt()
243 if (!match(X, m_InsertElt(m_Value(Vec), m_Value(Scalar), in foldBitcastExtElt()
490 if (match(SrcVec, m_Cmp(Pred, m_Value(X), m_Value(Y))) && in visitExtractElementInst()
1392 if (match(InsElt1->getOperand(0), m_Value(X)) && in hoistInsEltConst()
1393 match(InsElt1->getOperand(1), m_Value(Y)) && !isa<Constant>(Y) && in hoistInsEltConst()
1523 if (match(Vec, m_FPExt(m_Value(X))) && match(Scalar, m_FPExt(m_Value(Y)))) in narrowInsElt()
[all …]
H A DInstructionCombining.cpp551 match(Op0, m_OneUse(m_BinOp(m_Value(A), m_Constant(C1)))) && in SimplifyAssociativeOrCommutative()
552 match(Op1, m_OneUse(m_BinOp(m_Value(B), m_Constant(C2)))) && in SimplifyAssociativeOrCommutative()
645 if (match(Op, m_Shl(m_Value(), m_ImmConstant(C)))) { in getBinOpsForFactorization()
656 match(Op, m_LShr(m_NonNegative(), m_Value()))) { in getBinOpsForFactorization()
791 if (!match(I, m_DisjointOr(m_Value(), m_Value()))) in tryFoldInstWithCtpopWithNot()
801 m_OneUse(m_Intrinsic<Intrinsic::ctpop>(m_Value(Op))))) in tryFoldInstWithCtpopWithNot()
936 m_OneUse(m_Shift(m_Value(Y), m_Value(Shift))))) in foldBinOpShiftWithShift()
939 m_BinOp(m_Value(ShiftedX), m_Value(Mask)))) in foldBinOpShiftWithShift()
942 if (!match(ShiftedX, m_OneUse(m_Shift(m_Value(X), m_Specific(Shift))))) in foldBinOpShiftWithShift()
1032 return match(CastOp, m_ZExtOrSExt(m_Value(A))) && in foldBinOpOfSelectAndCastOfSelectCondition()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DIVDescriptors.cpp633 if (match(I, m_OneUse(m_Cmp(Pred, m_Value(), m_Value())))) { in isAnyOfPattern()
639 m_Select(m_Cmp(Pred, m_Value(), m_Value()), m_Value(), m_Value()))) in isAnyOfPattern()
673 if (match(I, m_OneUse(m_Cmp(Pred, m_Value(), m_Value())))) { in isMinMaxPattern()
680 !match(I, m_Select(m_OneUse(m_Cmp(Pred, m_Value(), m_Value())), m_Value(), in isMinMaxPattern()
681 m_Value()))) in isMinMaxPattern()
685 if (match(I, m_UMin(m_Value(), m_Value()))) in isMinMaxPattern()
687 if (match(I, m_UMax(m_Value(), m_Value()))) in isMinMaxPattern()
689 if (match(I, m_SMax(m_Value(), m_Value()))) in isMinMaxPattern()
691 if (match(I, m_SMin(m_Value(), m_Value()))) in isMinMaxPattern()
693 if (match(I, m_OrdFMin(m_Value(), m_Value()))) in isMinMaxPattern()
[all …]
H A DInstructionSimplify.cpp115 m_ICmp(Pred2, m_Value(X), m_Value(Y)))) || in foldSelectWithBinaryOp()
660 if (match(Op1, m_Sub(m_Value(Y), m_Specific(Op0))) || in simplifyAddInst()
661 match(Op0, m_Sub(m_Value(Y), m_Specific(Op1)))) in simplifyAddInst()
673 match(Op0, m_Xor(m_Value(Y), m_SignMask()))) in simplifyAddInst()
831 if (MaxRecurse && match(Op0, m_Add(m_Value(X), m_Value(Y)))) { // (X + Y) - Z in simplifySubInst()
853 if (MaxRecurse && match(Op1, m_Add(m_Value(Y), m_Value(Z)))) { // X - (Y + Z) in simplifySubInst()
875 if (MaxRecurse && match(Op1, m_Sub(m_Value(X), m_Value(Y)))) // Z - (X - Y) in simplifySubInst()
886 if (MaxRecurse && match(Op0, m_Trunc(m_Value(X))) && in simplifySubInst()
887 match(Op1, m_Trunc(m_Value(Y)))) in simplifySubInst()
898 if (match(Op0, m_PtrToInt(m_Value(X))) && match(Op1, m_PtrToInt(m_Value(Y)))) in simplifySubInst()
[all …]
H A DValueTracking.cpp196 if (match(LHS, m_c_And(m_Not(m_Value(M)), m_Value())) && in haveNoCommonBitsSetSpecialCases()
197 match(RHS, m_c_And(m_Specific(M), m_Value())) && in haveNoCommonBitsSetSpecialCases()
203 if (match(RHS, m_c_And(m_Not(m_Specific(LHS)), m_Value())) && in haveNoCommonBitsSetSpecialCases()
211 m_c_Xor(m_c_And(m_Specific(LHS), m_Value(Y)), m_Deferred(Y))) && in haveNoCommonBitsSetSpecialCases()
218 if (match(LHS, m_ZExtOrSExt(m_Value(Y))) && in haveNoCommonBitsSetSpecialCases()
226 if (match(LHS, m_And(m_Value(A), m_Value(B))) && in haveNoCommonBitsSetSpecialCases()
258 return match(U, m_ICmp(P, m_Value(), m_Zero())); in isOnlyUsedInZeroComparison()
265 return match(U, m_ICmp(P, m_Value(), m_Zero())) && ICmpInst::isEquality(P); in isOnlyUsedInZeroEqualityComparison()
615 if (!match(I->getArgOperand(0), m_c_ICmp(Pred, m_V, m_Value(RHS)))) in isKnownNonZeroFromAssume()
663 } else if (match(LHS, m_c_And(m_V, m_Value(Y))) && in computeKnownBitsFromCmp()
[all …]
H A DOverflowInstAnalysis.cpp28 if (!match(Op0, m_ICmp(Pred, m_Value(X), m_Zero()))) in isCheckForZeroAndMulWithOverflow()
58 match(Op1, m_Not(m_Value(NotOp1))) && matchMulOverflowCheck(NotOp1)); in isCheckForZeroAndMulWithOverflow()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLowerMatrixIntrinsics.cpp267 m_Value(), m_Value(), m_Value(M), m_Value(N), m_Value(K)))) in computeShapeInfoForInst()
269 if (match(I, m_Intrinsic<Intrinsic::matrix_transpose>(m_Value(), m_Value(M), in computeShapeInfoForInst()
270 m_Value(N)))) { in computeShapeInfoForInst()
275 m_Value(), m_Value(), m_Value(), m_Value(), m_Value(M), in computeShapeInfoForInst()
276 m_Value(N)))) in computeShapeInfoForInst()
279 m_Value(), m_Value(), m_Value(), m_Value(M), m_Value(N)))) in computeShapeInfoForInst()
282 if (match(I, m_Store(m_Value(MatrixA), m_Value()))) { in computeShapeInfoForInst()
699 m_Value(MatrixA), m_Value(MatrixB), m_Value(M), in propagateShapeBackward()
700 m_Value(N), m_Value(K)))) { in propagateShapeBackward()
708 m_Value(MatrixA), m_Value(M), m_Value(N)))) { in propagateShapeBackward()
[all …]
H A DConstraintElimination.cpp514 if (match(V, m_SExt(m_Value(Op0)))) in decompose()
516 else if (match(V, m_NNegZExt(m_Value(Op0)))) { in decompose()
521 if (match(V, m_NSWAdd(m_Value(Op0), m_Value(Op1)))) in decompose()
525 if (match(V, m_NSWMul(m_Value(Op0), m_ConstantInt(CI))) && canUseSExt(CI)) { in decompose()
533 if (match(V, m_NSWShl(m_Value(Op0), m_ConstantInt(CI)))) { in decompose()
553 if (match(V, m_ZExt(m_Value(Op0)))) { in decompose()
558 if (match(V, m_SExt(m_Value(Op0)))) { in decompose()
566 if (match(V, m_NUWAdd(m_Value(Op0), m_Value(Op1)))) { in decompose()
569 if (match(V, m_NSWAdd(m_Value(Op0), m_Value(Op1)))) { in decompose()
580 if (match(V, m_Add(m_Value(Op0), m_ConstantInt(CI))) && CI->isNegative() && in decompose()
[all …]
H A DNaryReassociate.cpp282 m_Value(LHS), m_Value(RHS)); in matchAndReassociateMinOrMax()
531 return match(V, m_Add(m_Value(Op1), m_Value(Op2))); in matchTernaryOp()
533 return match(V, m_Mul(m_Value(Op1), m_Value(Op2))); in matchTernaryOp()
614 MaxMinT m_MaxMin(m_Value(A), m_Value(B)); in tryReassociateMinOrMax()
H A DStraightLineStrengthReduce.cpp410 if (match(RHS, m_Mul(m_Value(S), m_ConstantInt(Idx)))) { in allocateCandidatesAndFindBasisForAdd()
413 } else if (match(RHS, m_Shl(m_Value(S), m_ConstantInt(Idx)))) { in allocateCandidatesAndFindBasisForAdd()
428 return match(A, m_c_Add(m_Value(B), m_ConstantInt(C))); in matchesAdd()
433 return match(A, m_c_Or(m_Value(B), m_ConstantInt(C))); in matchesOr()
508 if (match(ArrayIdx, m_NSWMul(m_Value(LHS), m_ConstantInt(RHS)))) { in factorArrayIndex()
512 } else if (match(ArrayIdx, m_NSWShl(m_Value(LHS), m_ConstantInt(RHS)))) { in factorArrayIndex()
555 if (match(ArrayIdx, m_SExt(m_Value(TruncatedArrayIdx))) && in allocateCandidatesAndFindBasisForGEP()
634 if (match(Bump, m_Neg(m_Value(NegBump)))) { in rewriteCandidateWithBasis()
H A DReassociate.cpp225 if (!match(I, m_Not(m_Value())) && !match(I, m_Neg(m_Value())) && in getRank()
226 !match(I, m_FNeg(m_Value()))) in getRank()
502 if (((Opcode == Instruction::Mul && match(Op, m_Neg(m_Value()))) || in LinearizeExprTree()
503 (Opcode == Instruction::FMul && match(Op, m_FNeg(m_Value())))) && in LinearizeExprTree()
823 if (!match(U, m_Neg(m_Value())) && !match(U, m_FNeg(m_Value()))) in NegateValue()
834 if (match(TheNeg, m_BinOp(m_Constant(C), m_Value())) && in NegateValue()
979 if (match(Sub, m_Neg(m_Value())) || match(Sub, m_FNeg(m_Value()))) in ShouldBreakUpSubtract()
1198 if (match(Ops[i].Op, m_Not(m_Value(X)))) { // Cannot occur for ^. in OptimizeAndOrXor()
1543 if (!match(TheOp, m_Neg(m_Value(X))) && !match(TheOp, m_Not(m_Value(X))) && in OptimizeAdd()
1544 !match(TheOp, m_FNeg(m_Value(X)))) in OptimizeAdd()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/
H A DAggressiveInstCombine.cpp85 m_Shl(m_Value(ShVal0), m_Value(ShAmt)), in foldGuardedFunnelShift()
86 m_LShr(m_Value(ShVal1), in foldGuardedFunnelShift()
94 m_OneUse(m_c_Or(m_Shl(m_Value(ShVal0), m_Sub(m_SpecificInt(Width), in foldGuardedFunnelShift()
95 m_Value(ShAmt))), in foldGuardedFunnelShift()
96 m_LShr(m_Value(ShVal1), m_Deferred(ShAmt)))))) { in foldGuardedFunnelShift()
210 if (match(V, m_And(m_Value(Op0), m_One()))) { in matchAndOrChain()
214 if (match(V, m_And(m_Value(Op0), m_Value(Op1)))) in matchAndOrChain()
218 if (match(V, m_Or(m_Value(Op in matchAndOrChain()
[all...]
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonGenExtract.cpp107 bool Match = match(In, m_And(m_Shl(m_LShr(m_Value(BF), m_ConstantInt(CSR)), in INITIALIZE_PASS_DEPENDENCY()
114 Match = match(In, m_And(m_Shl(m_AShr(m_Value(BF), m_ConstantInt(CSR)), in INITIALIZE_PASS_DEPENDENCY()
122 Match = match(In, m_And(m_Shl(m_Value(BF), m_ConstantInt(CSL)), in INITIALIZE_PASS_DEPENDENCY()
131 Match = match(In, m_And(m_LShr(m_Value(BF), m_ConstantInt(CSR)), in INITIALIZE_PASS_DEPENDENCY()
138 Match = match(In, m_And(m_AShr(m_Value(BF), m_ConstantInt(CSR)), in INITIALIZE_PASS_DEPENDENCY()
145 Match = match(In, m_Shl(m_LShr(m_Value(BF), m_ConstantInt(CSR)), in INITIALIZE_PASS_DEPENDENCY()
152 Match = match(In, m_Shl(m_AShr(m_Value(BF), m_ConstantInt(CSR)), in INITIALIZE_PASS_DEPENDENCY()
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86LowerAMXIntrinsics.cpp477 match(TileDP, m_Intrinsic<IntrID>(m_Value(M), m_Value(N), m_Value(K), in lowerTileDP()
478 m_Value(C), m_Value(A), m_Value(B))); in lowerTileDP()
502 if (match(I, m_BitCast(m_Value(Vec)))) { in lowerTileDP()
518 m_Value(M), m_Value(N), m_Value(Ptr), m_Value(Stride))); in lowerTileLoadStore()
521 m_Value(M), m_Value(N), m_Value(Ptr), in lowerTileLoadStore()
522 m_Value(Stride), m_Value(Tile))); in lowerTileLoadStore()
546 if (match(I, m_BitCast(m_Value(Vec)))) { in lowerTileLoadStore()
564 if (match(I, m_BitCast(m_Value(Vec)))) { in lowerTileZero()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/InstCombine/
H A DInstCombiner.h141 if (isa<CastInst>(V) || match(V, m_Neg(PatternMatch::m_Value())) || in getComplexity()
142 match(V, m_Not(PatternMatch::m_Value())) || in getComplexity()
143 match(V, m_FNeg(PatternMatch::m_Value()))) in getComplexity()
196 return match(&SI, PatternMatch::m_LogicalAnd(PatternMatch::m_Value(), in shouldAvoidAbsorbingNotIntoSelect()
197 PatternMatch::m_Value())) || in shouldAvoidAbsorbingNotIntoSelect()
198 match(&SI, PatternMatch::m_LogicalOr(PatternMatch::m_Value(), in shouldAvoidAbsorbingNotIntoSelect()
199 PatternMatch::m_Value())); in shouldAvoidAbsorbingNotIntoSelect()
267 if (!match(I, m_Not(PatternMatch::m_Value()))) in canFreelyInvertAllUsersOf()
/freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/
H A DRISCVCodeGenPrepare.cpp80 if (!match(BO.getOperand(0), m_NNegZExt(m_Value(LHSSrc)))) in visitAnd()
176 m_Value(BasePtr), m_Zero(), m_AllOnes(), m_Value(VL)))) in expandVPStrideLoad()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVectorCombine.cpp175 if (!match(&I, m_InsertElt(m_Undef(), m_Value(Scalar), m_ZeroInt())) || in vectorizeLoadInsert()
181 bool HasExtract = match(Scalar, m_ExtractElt(m_Value(X), m_ZeroInt())); in vectorizeLoadInsert()
588 if (!match(I0, m_ExtractElt(m_Value(V0), m_ConstantInt(C0))) || in foldExtractExtract()
589 !match(I1, m_ExtractElt(m_Value(V1), m_ConstantInt(C1))) || in foldExtractExtract()
603 m_InsertElt(m_Value(), m_Value(), m_ConstantInt(InsertIndex))); in foldExtractExtract()
638 if (!match(&I, m_InsertElt(m_Value(DestVec), m_OneUse(m_Instruction(FNeg)), in foldInsExtFNeg()
647 m_ExtractElt(m_Value(SrcVec), m_SpecificInt(Index)))))) in foldInsExtFNeg()
701 m_Shuffle(m_Value(V0), m_Value(V1), m_Mask(Mask)))))) in foldBitcastShuffle()
911 if (!match(&I, m_BinOp(m_Value(Ins0), m_Value(Ins1))) && in scalarizeBinopOrCmp()
912 !match(&I, m_Cmp(Pred, m_Value(Ins0), m_Value(Ins1)))) in scalarizeBinopOrCmp()
[all …]

1234