Home
last modified time | relevance | path

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

1234567

/openbsd/gnu/llvm/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 …]
/openbsd/gnu/llvm/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()
467 case Instruction::Mul: { in Search()
680 if (R.getType() != Mul->getType()) { in InsertParallelMACs()
683 Mul = cast<Instruction>(Builder.CreateSExt(Mul, R.getRoot()->getType())); in InsertParallelMACs()
687 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()
H A DMVEGatherScatterLowering.cpp347 I->getOpcode() == Instruction::Mul || in getIfConst()
355 if (I->getOpcode() == Instruction::Mul) in getIfConst()
954 if ((OpCode == Instruction::Add || OpCode == Instruction::Mul || in hasAllGatScatUsers()
976 Offs->getOpcode() != Instruction::Mul && in optimiseOffsets()
1084 case Instruction::Mul: in optimiseOffsets()
/openbsd/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.pt/
H A Dttp43.C10 struct Mul { struct
11 Mul(const E1<T>& e1, const E2<T>& e2) {} in Mul() function
27 Mul < T, Id, Lit > operator*(const T& t) const {
28 return Mul < T, Id, Lit >(*this, Lit<T>(t));
/openbsd/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DReassociate.cpp603 for (User *U : Mul->users()) { in LinearizeExprTree()
1082 BinaryOperator *Mul = in ConvertShiftToMul() local
1085 Mul->takeName(Shl); in ConvertShiftToMul()
1088 Shl->replaceAllUsesWith(Mul); in ConvertShiftToMul()
1099 Mul->setHasNoSignedWrap(true); in ConvertShiftToMul()
1100 Mul->setHasNoUnsignedWrap(NUW); in ConvertShiftToMul()
1101 return Mul; in ConvertShiftToMul()
1570 RedoInsts.insert(Mul); in OptimizeAdd()
1574 return Mul; in OptimizeAdd()
1579 Ops.insert(Ops.begin(), ValueEntry(getRank(Mul), Mul)); in OptimizeAdd()
[all …]
H A DDivRemPairs.cpp336 Instruction *Mul = BinaryOperator::CreateMul(DivInst, Y); in optimizeDivRem() local
337 Instruction *Sub = BinaryOperator::CreateSub(X, Mul); in optimizeDivRem()
371 Mul->insertAfter(RemInst); in optimizeDivRem()
372 Sub->insertAfter(Mul); in optimizeDivRem()
394 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()
516 case Instruction::Mul: in tryReassociatedBinaryOp()
531 case Instruction::Mul: in matchTernaryOp()
545 case Instruction::Mul: in getBinarySCEV()
/openbsd/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.jason/
H A Dtemplate5.C10 Matrix<M,N>& Mul(Matrix<M,N>& Q,Matrix<M,H>& A,Matrix<H,N>& B) { in Mul() function
27 q = Mul (q, a, b); in f()
/openbsd/gnu/llvm/llvm/lib/Transforms/InstCombine/
H A DInstCombineMulDivRem.cpp147 Value *X = Mul.getOperand(0), *Y = Mul.getOperand(1); in foldMulShl1()
151 const bool HasNSW = Mul.hasNoSignedWrap(); in foldMulShl1()
152 const bool HasNUW = Mul.hasNoUnsignedWrap(); in foldMulShl1()
230 if (HasNUW && Mul->hasNoUnsignedWrap()) in visitMul()
993 auto *Mul = BinaryOperator::Create(Instruction::Mul, X, in commonIDivTransforms() local
998 return Mul; in commonIDivTransforms()
1020 auto *Mul = BinaryOperator::Create(Instruction::Mul, X, in commonIDivTransforms() local
1025 return Mul; in commonIDivTransforms()
1103 if (!IsSigned && Mul->hasNoUnsignedWrap()) in commonIDivTransforms()
1105 else if (IsSigned && Mul->hasNoSignedWrap()) in commonIDivTransforms()
[all …]
H A DInstCombineCompares.cpp1948 Type *MulTy = Mul->getType(); in foldICmpMulConstant()
1955 (Mul->hasNoUnsignedWrap() || Mul->hasNoSignedWrap())) in foldICmpMulConstant()
1972 if (MulC->isZero() || (!Mul->hasNoSignedWrap() && !Mul->hasNoUnsignedWrap())) in foldICmpMulConstant()
1995 if (Mul->hasNoSignedWrap()) { in foldICmpMulConstant()
3373 case Instruction::Mul: in foldICmpBinOpWithConstant()
3939 Instruction *Mul; in foldMultiplicationOverflowCheck() local
3948 Mul = nullptr; in foldMultiplicationOverflowCheck()
3978 bool MulHadOtherUses = Mul && !Mul->hasOneUse(); in foldMultiplicationOverflowCheck()
4389 case Instruction::Mul: { in foldICmpBinOp()
4999 case Instruction::Mul: in isNeutralValue()
[all …]
/openbsd/gnu/llvm/llvm/include/llvm/IR/
H A DOperator.h112 I->getOpcode() == Instruction::Mul || in classof()
118 CE->getOpcode() == Instruction::Mul || in classof()
357 : public ConcreteOperator<OverflowingBinaryOperator, Instruction::Mul> {
H A DIntrinsicsHexagon.td393 // V6_vmpyss_parts(Vu,Vv) = (MulHS(Vu,Vv), Mul(Vu,Vv))
394 // V6_vmpyuu_parts(Vu,Vv) = (MulHU(Vu,Vv), Mul(Vu,Vv))
395 // V6_vmpyus_parts(Vu,Vv) = (MulHUS(Vu,Vv), Mul(Vu,Vv))
H A DInstruction.h568 Opcode == Add || Opcode == Mul;
582 case Mul: case FMul:
/openbsd/gnu/llvm/llvm/lib/Target/SPIRV/
H A DSPIRVPrepareFunctions.cpp279 Value *Mul = IRB.CreateNUWMul(UMulFunc->getArg(0), UMulFunc->getArg(1)); in buildUMulWithOverflowFunc() local
280 Value *Div = IRB.CreateUDiv(Mul, UMulFunc->getArg(0)); in buildUMulWithOverflowFunc()
286 Value *Agg = IRB.CreateInsertValue(PoisonValue::get(StructTy), Mul, {0}); in buildUMulWithOverflowFunc()
/openbsd/gnu/llvm/llvm/lib/Analysis/
H A DScalarEvolution.cpp480 if (!Mul) return false; in isNonConstantNegative()
2300 if (Mul && isa<SCEVConstant>(Mul->getOperand(0))) { in CollectAddOperandsWithScales()
2356 case Instruction::Mul: in willNotOverflow()
2611 return Mul; in getAddExpr()
2612 Ops[i] = Mul; in getAddExpr()
2632 const auto *LastOp = Mul->getOperand(Mul->getNumOperands() - 1); in getAddExpr()
2727 if (Mul && Mul->getNumOperands() == 2 && in getAddExpr()
3606 if (!Mul || !Mul->hasNoUnsignedWrap()) in getUDivExactExpr()
3633 if (!Mul) in getUDivExactExpr()
14882 if (Mul == nullptr) in matchURem()
[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()
1083 case RecurKind::Mul: in getRecurrenceIdentity()
1134 case RecurKind::Mul: in getOpcode()
1135 return Instruction::Mul; in getOpcode()
H A DStackSafetyAnalysis.cpp170 APInt Mul = C->getValue(); in getStaticAllocaSizeRange() local
171 if (Mul.isNonPositive()) in getStaticAllocaSizeRange()
173 Mul = Mul.sextOrTrunc(PointerSize); in getStaticAllocaSizeRange()
174 APSize = APSize.smul_ov(Mul, Overflow); in getStaticAllocaSizeRange()
/openbsd/gnu/llvm/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()
/openbsd/gnu/llvm/clang/lib/StaticAnalyzer/Checkers/
H A DVLASizeChecker.cpp118 SVal Mul = SVB.evalBinOpNN(State, BO_Mul, ArrSize, IndexLength, SizeTy); in checkVLA() local
119 if (auto MulNonLoc = Mul.getAs<NonLoc>()) in checkVLA()
/openbsd/regress/lib/libcrypto/x509/bettertls/certificates/
H A D304.chain18 wV9C86FHdFuPMx+z9jDVz1AUWpayqD/TMvssHRQ294BxFO/rdJ3MiR2+Mul+e3F+
/openbsd/gnu/llvm/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()
/openbsd/gnu/llvm/llvm/lib/Target/XCore/
H A DXCoreISelLowering.cpp631 SDValue Mul; in TryExpandADDWithMul() local
634 Mul = N->getOperand(0); in TryExpandADDWithMul()
637 Mul = N->getOperand(1); in TryExpandADDWithMul()
645 Mul.getOperand(0), DAG.getConstant(0, dl, MVT::i32)); in TryExpandADDWithMul()
647 Mul.getOperand(1), DAG.getConstant(0, dl, MVT::i32)); in TryExpandADDWithMul()
653 unsigned LHSSB = DAG.ComputeNumSignBits(Mul.getOperand(0)); in TryExpandADDWithMul()
654 unsigned RHSSB = DAG.ComputeNumSignBits(Mul.getOperand(1)); in TryExpandADDWithMul()
655 if (DAG.MaskedValueIsZero(Mul.getOperand(0), HighMask) && in TryExpandADDWithMul()
656 DAG.MaskedValueIsZero(Mul.getOperand(1), HighMask)) { in TryExpandADDWithMul()
674 Mul.getOperand(0), DAG.getConstant(1, dl, MVT::i32)); in TryExpandADDWithMul()
[all …]
/openbsd/gnu/llvm/llvm/lib/CodeGen/
H A DExpandReductions.cpp38 return Instruction::Mul; in getOpcode()

1234567