/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/ARM/ |
H A D | ARMParallelDSP.cpp | 99 /// Create MulCandidates, each rooted at a Mul instruction, that is a part 105 if (I->getOpcode() == Instruction::Mul) 108 if (I->getOpcode() == Instruction::Mul) 123 if (auto *Mul = GetMulOperand(Add->getOperand(0))) 124 InsertMul(Mul); 125 if (auto *Mul = GetMulOperand(Add->getOperand(1))) 126 InsertMul(Mul); 188 for (auto &Mul : Muls) 189 LLVM_DEBUG(dbgs() << *Mul->Root << "\n" 190 << " " << *Mul 677 Instruction *Mul = cast<Instruction>(MulCand->Root); local [all...] |
H A D | MVETailPredication.cpp | 386 if (auto *Mul = VisitAdd(Add)) 387 if (auto *Div = VisitMul(Mul))
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | DivRemPairs.cpp | 266 Instruction *Mul = BinaryOperator::CreateMul(DivInst, Y); local 267 Instruction *Sub = BinaryOperator::CreateSub(X, Mul); 301 Mul->insertAfter(RemInst); 302 Sub->insertAfter(Mul);
|
H A D | NaryReassociate.cpp | 221 case Instruction::Mul: 289 case Instruction::Mul: 487 case Instruction::Mul: 502 case Instruction::Mul: 516 case Instruction::Mul:
|
H A D | StraightLineStrengthReduce.cpp | 106 Mul, // (B + i) * S enumerator in enum:__anon2761::StraightLineStrengthReduce::Candidate::Kind 192 // Allocate candidates and find bases for Mul instructions. 317 if (C.CandidateKind == Candidate::Mul) { 378 case Instruction::Mul: 439 allocateCandidatesAndFindBasis(Candidate::Mul, SE->getSCEV(B), Idx, RHS, I); 445 allocateCandidatesAndFindBasis(Candidate::Mul, SE->getSCEV(B), Idx, RHS, I); 449 allocateCandidatesAndFindBasis(Candidate::Mul, SE->getSCEV(LHS), Zero, RHS, 643 case Candidate::Mul: {
|
H A D | Reassociate.cpp | 341 assert((Opcode == Instruction::Mul || Opcode == Instruction::FMul) && 583 if ((Opcode == Instruction::Mul && match(Tmp, m_Neg(m_Value()))) || 980 BinaryOperator *Mul = local 983 Mul->takeName(Shl); 986 Shl->replaceAllUsesWith(Mul); 987 Mul->setDebugLoc(Shl->getDebugLoc()); 995 Mul->setHasNoSignedWrap(true); 996 Mul->setHasNoUnsignedWrap(NUW); 997 return Mul; 1043 BinaryOperator *BO = isReassociableOp(V, Instruction::Mul, Instructio [all...] |
H A D | LowerMatrixIntrinsics.cpp | 291 case Instruction::Mul: 673 Value *Mul = Builder.CreateFMul(A, B); local 674 return Builder.CreateFAdd(Sum, Mul); 677 Value *Mul = Builder.CreateMul(A, B); local 678 return Builder.CreateAdd(Sum, Mul); 824 case Instruction::Mul:
|
H A D | SpeculativeExecution.cpp | 217 case Instruction::Mul:
|
H A D | LoopStrengthReduce.cpp | 420 if (const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(S)) 421 if (Mul->getOperand(0)->isAllOnesValue()) { 422 SmallVector<const SCEV *, 4> Ops(Mul->op_begin()+1, Mul->op_end()); 722 if (const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(LHS)) { 723 if (IgnoreSignificantBits || isMulSExtable(Mul, SE)) { 726 for (const SCEV *S : Mul->operands()) { 934 if (const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(S)) { 935 if (Mul->getNumOperands() == 2) { 937 if (isa<SCEVConstant>(Mul [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/RISCV/ |
H A D | RISCVTargetTransformInfo.cpp | 56 case Instruction::Mul:
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/ |
H A D | TruncInstCombine.cpp | 52 case Instruction::Mul: 114 case Instruction::Mul: 345 case Instruction::Mul:
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineMulDivRem.cpp | 204 BinaryOperator *Mul = cast<BinaryOperator>(I.getOperand(0)); local 206 if (I.hasNoUnsignedWrap() && Mul->hasNoUnsignedWrap()) 208 if (I.hasNoSignedWrap() && Mul->hasNoSignedWrap() && 269 Value *Mul = Builder.CreateMul(C1, Op1); local 272 if (!match(Mul, m_Mul(m_Value(), m_Value()))) 273 return BinaryOperator::CreateAdd(Builder.CreateMul(X, Op1), Mul); 724 auto *Mul = BinaryOperator::Create(Instruction::Mul, X, local 727 Mul->setHasNoUnsignedWrap(!IsSigned && OBO->hasNoUnsignedWrap()); 728 Mul 750 auto *Mul = BinaryOperator::Create(Instruction::Mul, X, local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Mips/ |
H A D | Mips16ISelDAGToDAG.cpp | 48 SDNode *Mul = CurDAG->getMachineNode(Opc, DL, MVT::Glue, N->getOperand(0), local 50 SDValue InFlag = SDValue(Mul, 0); 194 /// Mul with two results
|
H A D | MipsInstructionSelector.cpp | 266 MachineInstr *Mul = BuildMI(MBB, I, I.getDebugLoc(), TII.get(Mips::MUL)) local 270 if (!constrainSelectedInstRegOperands(*Mul, TII, TRI, RBI)) 272 Mul->getOperand(3).setIsDead(true); 273 Mul->getOperand(4).setIsDead(true);
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | Operator.h | 64 /// Mul, and Shl. It does not include SDiv, despite that operator having the 103 I->getOpcode() == Instruction::Mul || 109 CE->getOpcode() == Instruction::Mul || 433 : public ConcreteOperator<OverflowingBinaryOperator, Instruction::Mul> {
|
H A D | Instruction.h | 483 /// In LLVM, the Add, Mul, And, Or, and Xor operators are associative. 488 Opcode == Add || Opcode == Mul; 502 case Mul: case FMul:
|
H A D | PatternMatch.h | 851 inline BinaryOp_match<LHS, RHS, Instruction::Mul> m_Mul(const LHS &L, 853 return BinaryOp_match<LHS, RHS, Instruction::Mul>(L, R); 976 inline OverflowingBinaryOp_match<LHS, RHS, Instruction::Mul, 979 return OverflowingBinaryOp_match<LHS, RHS, Instruction::Mul, 1009 inline OverflowingBinaryOp_match<LHS, RHS, Instruction::Mul, 1012 return OverflowingBinaryOp_match<LHS, RHS, Instruction::Mul, 1865 /// Matches a Mul with LHS and RHS in either order. 1867 inline BinaryOp_match<LHS, RHS, Instruction::Mul, true> m_c_Mul(const LHS &L, 1869 return BinaryOp_match<LHS, RHS, Instruction::Mul, true>(L, R);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | ExpandReductions.cpp | 40 return Instruction::Mul;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | ScalarEvolution.cpp | 409 const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(this); local 410 if (!Mul) return false; 413 const SCEVConstant *SC = dyn_cast<SCEVConstant>(Mul->getOperand(0)); 2296 const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(Ops[i]); local 2297 if (Mul && isa<SCEVConstant>(Mul->getOperand(0))) { 2299 Scale * cast<SCEVConstant>(Mul->getOperand(0))->getAPInt(); 2300 if (Mul->getNumOperands() == 2 && isa<SCEVAddExpr>(Mul->getOperand(1))) { 2302 const SCEVAddExpr *Add = cast<SCEVAddExpr>(Mul 2471 const SCEV *Mul = getMulExpr(Scale, Ops[i], SCEV::FlagAnyWrap, Depth + 1); variable 2620 const SCEVMulExpr *Mul = cast<SCEVMulExpr>(Ops[Idx]); variable [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/MC/ |
H A D | MCExpr.h | 441 Mul, ///< Multiplication. enumerator in enum:llvm::MCBinaryExpr::Opcode 524 return create(Mul, LHS, RHS, Ctx);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/XCore/ |
H A D | XCoreISelLowering.cpp | 635 SDValue Mul; local 638 Mul = N->getOperand(0); 641 Mul = N->getOperand(1); 649 Mul.getOperand(0), DAG.getConstant(0, dl, MVT::i32)); 651 Mul.getOperand(1), DAG.getConstant(0, dl, MVT::i32)); 657 unsigned LHSSB = DAG.ComputeNumSignBits(Mul.getOperand(0)); 658 unsigned RHSSB = DAG.ComputeNumSignBits(Mul.getOperand(1)); 659 if (DAG.MaskedValueIsZero(Mul.getOperand(0), HighMask) && 660 DAG.MaskedValueIsZero(Mul.getOperand(1), HighMask)) { 678 Mul [all...] |
H A D | XCoreLowerThreadLocal.cpp | 91 case Instruction::Mul:
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/AST/ |
H A D | StmtVisitor.h | 127 BINOP_FALLBACK(Mul) BINOP_FALLBACK(Div) BINOP_FALLBACK(Rem)
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/ |
H A D | IntrinsicInst.cpp | 195 return Instruction::Mul;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/FuzzMutate/ |
H A D | Operations.cpp | 21 Ops.push_back(binOpDescriptor(1, Instruction::Mul)); 99 case Instruction::Mul:
|