Home
last modified time | relevance | path

Searched refs:Mul (Results 1 – 25 of 180) sorted by relevance

12345678

/llvm-project-15.0.7/llvm/lib/Target/X86/
H A DX86PartialReduction.cpp75 Value *LHS = Mul->getOperand(0); in matchVPDPBUSDPattern()
76 Value *RHS = Mul->getOperand(1); in matchVPDPBUSDPattern()
117 auto *Mul = dyn_cast<BinaryOperator>(Op); in tryMAddReplacement() local
118 if (!Mul || Mul->getOpcode() != Instruction::Mul) in tryMAddReplacement()
121 Value *LHS = Mul->getOperand(0); in tryMAddReplacement()
122 Value *RHS = Mul->getOperand(1); in tryMAddReplacement()
169 if (BO->getParent() == Mul->getParent() && in tryMAddReplacement()
183 IRBuilder<> Builder(Mul); in tryMAddReplacement()
199 Value *NewMul = Builder.CreateMul(Mul->getOperand(0), Mul->getOperand(1)); in tryMAddReplacement()
210 Mul->replaceAllUsesWith(Concat); in tryMAddReplacement()
[all …]
/llvm-project-15.0.7/llvm/lib/Target/ARM/
H A DARMParallelDSP.cpp109 if (I->getOpcode() == Instruction::Mul) in InsertMuls()
125 InsertMul(Mul); in InsertMuls()
127 InsertMul(Mul); in InsertMuls()
189 for (auto &Mul : Muls) in dump()
190 LLVM_DEBUG(dbgs() << *Mul->Root << "\n" in dump()
191 << " " << *Mul->LHS << "\n" in dump()
468 case Instruction::Mul: { in Search()
681 if (R.getType() != Mul->getType()) { in InsertParallelMACs()
684 Mul = cast<Instruction>(Builder.CreateSExt(Mul, R.getRoot()->getType())); in InsertParallelMACs()
688 Acc = Mul; in InsertParallelMACs()
[all …]
H A DMVELaneInterleavingPass.cpp146 cast<Instruction>(*E->user_begin())->getOpcode() != Instruction::Mul) { in isProfitableToInterleave()
229 case Instruction::Mul: in tryInterleave()
/llvm-project-15.0.7/clang/test/SemaTemplate/
H A Dalias-church-numerals.cpp23 typename X> using Mul = A<PartialApply<B,F>::template R, X>; typedef
26 template<template<typename> class F, typename X> using Sixteen = Mul<Four, Four, F, X>;
27 template<template<typename> class F, typename X> using TwoHundredAndFiftySix = Mul<Sixteen, Sixteen…
/llvm-project-15.0.7/mlir/test/Integration/Dialect/PDL/CPU/
H A Dmultiroot.mlir52 pdl.erase %op2 // tf.Mul
80 %op5 = pdl.operation "tf.Mul" (%val3, %val4 : !pdl.value, !pdl.value) -> (%in_type : !pdl.type)
86 pdl.replace %op5 with (%val6_1 : !pdl.value) // tf.Mul
110 %6 = "tf.Mul"(%5, %2) : (tensor<2x10xf32>, tensor<2x1xf32>) -> tensor<2x10xf32>
112 %8 = "tf.Mul"(%7, %1) : (tensor<20x10xf32>, tensor<f32>) -> tensor<20x10xf32>
144 pdl.erase %op1 // tf.Mul
249 pdl.replace %op5 with (%val6_1 : !pdl.value) // tf.Mul
279 %9 = "tf.Mul"(%8, %2) : (tensor<2x10xf32>, tensor<2x1xf32>) -> tensor<2x10xf32>
285 %15 = "tf.Mul"(%14, %1) : (tensor<20x256xf32>, tensor<f32>) -> tensor<20x256xf32>
287 %17 = "tf.Mul"(%13, %1) : (tensor<256xf32>, tensor<f32>) -> tensor<256xf32>
[all …]
/llvm-project-15.0.7/mlir/lib/IR/
H A DAffineExpr.cpp49 if (kind == AffineExprKind::Mul) in getAffineBinaryOpExpr()
82 case AffineExprKind::Mul: in replaceDimsAndSymbols()
140 case AffineExprKind::Mul: in replace()
173 case AffineExprKind::Mul: in isSymbolicOrConstant()
198 case AffineExprKind::Mul: { in isPureAffine()
229 case AffineExprKind::Mul: { in getLargestKnownDivisor()
256 case AffineExprKind::Mul: { in isMultipleOf()
355 case AffineExprKind::Mul: { in isDivisibleBySymbol()
413 case AffineExprKind::Mul: { in symbolicDivide()
446 case AffineExprKind::Mul: { in simplifySemiAffine()
[all …]
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DReassociate.cpp603 for (User *U : Mul->users()) { in LinearizeExprTree()
1094 BinaryOperator *Mul = in ConvertShiftToMul() local
1097 Mul->takeName(Shl); in ConvertShiftToMul()
1100 Shl->replaceAllUsesWith(Mul); in ConvertShiftToMul()
1111 Mul->setHasNoSignedWrap(true); in ConvertShiftToMul()
1112 Mul->setHasNoUnsignedWrap(NUW); in ConvertShiftToMul()
1113 return Mul; in ConvertShiftToMul()
1582 RedoInsts.insert(Mul); in OptimizeAdd()
1586 return Mul; in OptimizeAdd()
1591 Ops.insert(Ops.begin(), ValueEntry(getRank(Mul), Mul)); in OptimizeAdd()
[all …]
H A DDivRemPairs.cpp315 Instruction *Mul = BinaryOperator::CreateMul(DivInst, Y); in optimizeDivRem() local
316 Instruction *Sub = BinaryOperator::CreateSub(X, Mul); in optimizeDivRem()
350 Mul->insertAfter(RemInst); in optimizeDivRem()
351 Sub->insertAfter(Mul); in optimizeDivRem()
373 Mul->setOperand(1, FrY); in optimizeDivRem()
H A DStraightLineStrengthReduce.cpp137 Mul, // (B + i) * S enumerator
327 if (C.CandidateKind == Candidate::Mul) { in isSimplestForm()
388 case Instruction::Mul: in allocateCandidatesAndFindBasis()
449 allocateCandidatesAndFindBasis(Candidate::Mul, SE->getSCEV(B), Idx, RHS, I); in allocateCandidatesAndFindBasisForMul()
455 allocateCandidatesAndFindBasis(Candidate::Mul, SE->getSCEV(B), Idx, RHS, I); in allocateCandidatesAndFindBasisForMul()
459 allocateCandidatesAndFindBasis(Candidate::Mul, SE->getSCEV(LHS), Zero, RHS, in allocateCandidatesAndFindBasisForMul()
653 case Candidate::Mul: { in rewriteCandidateWithBasis()
H A DNaryReassociate.cpp303 case Instruction::Mul: in tryReassociate()
515 case Instruction::Mul: in tryReassociatedBinaryOp()
530 case Instruction::Mul: in matchTernaryOp()
544 case Instruction::Mul: in getBinarySCEV()
/llvm-project-15.0.7/llvm/test/CodeGen/SystemZ/
H A Dstore-replicated-vals.ll118 %Mul = mul i64 %ZE, 72340172838076673
119 %tmp = insertelement <2 x i64> undef, i64 %Mul, i32 0
134 %Mul = mul i32 %ZE, 65537
135 %tmp = insertelement <4 x i32> undef, i32 %Mul, i32 0
150 %Mul = mul i32 %ZE, 65537
151 %tmp = insertelement <6 x i32> undef, i32 %Mul, i32 0
165 %Mul = mul i64 %ZE, 4294967297
166 %tmp = insertelement <2 x i64> undef, i64 %Mul, i32 0
182 %Mul = mul i64 %ZE, 4294967297
183 %tmp = insertelement <5 x i64> undef, i64 %Mul, i32 0
/llvm-project-15.0.7/polly/test/ScheduleOptimizer/
H A Dpattern-matching-based-opts_15.ll10 ; double Mul = A[i][k] * B[k][j];
11 ; D[i][j][k] += Mul;
12 ; C[i][j] += Mul;
/llvm-project-15.0.7/llvm/lib/Transforms/InstCombine/
H A DInstCombineMulDivRem.cpp184 if (I.hasNoSignedWrap() && Mul->hasNoSignedWrap() && in visitMul()
228 Value *Mul = Builder.CreateMul(C1, Op1); in visitMul() local
231 if (!match(Mul, m_Mul(m_Value(), m_Value()))) in visitMul()
835 auto *Mul = BinaryOperator::Create(Instruction::Mul, X, in commonIDivTransforms() local
839 Mul->setHasNoSignedWrap(OBO->hasNoSignedWrap()); in commonIDivTransforms()
840 return Mul; in commonIDivTransforms()
862 auto *Mul = BinaryOperator::Create(Instruction::Mul, X, in commonIDivTransforms() local
866 Mul->setHasNoSignedWrap(OBO->hasNoSignedWrap()); in commonIDivTransforms()
867 return Mul; in commonIDivTransforms()
1435 if (Instruction *Mul = foldFDivPowDivisor(I, Builder)) in visitFDiv() local
[all …]
/llvm-project-15.0.7/mlir/lib/CAPI/IR/
H A DAffineExpr.cpp130 return unwrap(affineExpr).getKind() == mlir::AffineExprKind::Mul; in mlirAffineExprIsAMul()
134 return wrap(getAffineBinaryOpExpr(mlir::AffineExprKind::Mul, unwrap(lhs), in mlirAffineMulExprGet()
/llvm-project-15.0.7/llvm/lib/Target/SPIRV/
H A DSPIRVPrepareFunctions.cpp215 Value *Mul = IRB.CreateNUWMul(UMulFunc->getArg(0), UMulFunc->getArg(1)); in buildUMulWithOverflowFunc() local
216 Value *Div = IRB.CreateUDiv(Mul, UMulFunc->getArg(0)); in buildUMulWithOverflowFunc()
222 Value *Agg = IRB.CreateInsertValue(UndefValue::get(StructTy), Mul, {0}); in buildUMulWithOverflowFunc()
/llvm-project-15.0.7/llvm/unittests/Transforms/Utils/
H A DCloningTest.cpp74 BinaryOperator *Mul = BinaryOperator::Create(Instruction::Mul, V, V); in TEST_F() local
78 BinaryOperator *MulClone = this->clone(Mul); in TEST_F()
91 Mul->setHasNoUnsignedWrap(); in TEST_F()
95 MulClone = this->clone(Mul); in TEST_F()
108 Mul->setHasNoSignedWrap(); in TEST_F()
112 MulClone = this->clone(Mul); in TEST_F()
125 Mul->setHasNoUnsignedWrap(false); in TEST_F()
129 MulClone = this->clone(Mul); in TEST_F()
/llvm-project-15.0.7/mlir/include/mlir/IR/
H A DAffineExprVisitor.h84 case AffineExprKind::Mul: { in walkPostOrder()
125 case AffineExprKind::Mul: { in visit()
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DScalarEvolution.cpp2244 if (Mul && isa<SCEVConstant>(Mul->getOperand(0))) { in CollectAddOperandsWithScales()
2530 return Mul; in getAddExpr()
2531 Ops[i] = Mul; in getAddExpr()
2646 if (Mul && Mul->getNumOperands() == 2 && in getAddExpr()
2752 MulOps.append(Mul->op_begin()+MulOp+1, Mul->op_end()); in getAddExpr()
3174 Ops.append(Mul->op_begin(), Mul->op_end()); in getMulExpr()
3527 if (!Mul || !Mul->hasNoUnsignedWrap()) in getUDivExactExpr()
3550 Operands.append(Mul->op_begin() + 1, Mul->op_end()); in getUDivExactExpr()
3554 if (!Mul) in getUDivExactExpr()
3563 Operands.append(Mul->op_begin(), Mul->op_begin() + i); in getUDivExactExpr()
[all …]
H A DIVDescriptors.cpp47 case RecurKind::Mul: in isIntegerRecurrenceKind()
773 case Instruction::Mul: in isRecurrenceInstr()
774 return InstDesc(Kind == RecurKind::Mul, I); in isRecurrenceInstr()
843 if (AddReductionVar(Phi, RecurKind::Mul, TheLoop, FMF, RedDes, DB, AC, DT, in isReductionPHI()
1059 case RecurKind::Mul: in getRecurrenceIdentity()
1106 case RecurKind::Mul: in getOpcode()
1107 return Instruction::Mul; in getOpcode()
/llvm-project-15.0.7/llvm/include/llvm/IR/
H A DOperator.h109 I->getOpcode() == Instruction::Mul || in classof()
115 CE->getOpcode() == Instruction::Mul || in classof()
354 : public ConcreteOperator<OverflowingBinaryOperator, Instruction::Mul> {
/llvm-project-15.0.7/llvm/test/Transforms/LowerMatrixIntrinsics/
H A Dpropagate-multiple-iterations.ll7 ; forward-propagate it to %Mul, and then back to %B.
78 %Mul = fmul <16 x double> %A, %B
79 ret <16 x double> %Mul
/llvm-project-15.0.7/llvm/lib/Target/Mips/
H A DMips16ISelDAGToDAG.cpp48 SDNode *Mul = CurDAG->getMachineNode(Opc, DL, MVT::Glue, N->getOperand(0), in selectMULT() local
50 SDValue InFlag = SDValue(Mul, 0); in selectMULT()
/llvm-project-15.0.7/llvm/test/Transforms/Reassociate/
H A Dotherops.ll1 ; Reassociation should apply to Add, Mul, And, Or, & Xor
/llvm-project-15.0.7/clang/lib/StaticAnalyzer/Checkers/
H A DVLASizeChecker.cpp117 SVal Mul = SVB.evalBinOpNN(State, BO_Mul, ArrSize, IndexLength, SizeTy); in checkVLA() local
118 if (auto MulNonLoc = Mul.getAs<NonLoc>()) in checkVLA()
/llvm-project-15.0.7/llvm/lib/Transforms/AggressiveInstCombine/
H A DTruncInstCombine.cpp59 case Instruction::Mul: in getRelevantOperands()
138 case Instruction::Mul: in buildTruncExpressionGraph()
428 case Instruction::Mul: in ReduceExpressionGraph()

12345678