| /external/llvm/lib/Target/Sparc/ |
| SparcISelDAGToDAG.cpp | 171 // FIXME: Handle mul by immediate.
175 SDNode *Mul = CurDAG->getMachineNode(Opcode, dl, MVT::i32, MVT::Glue,
178 return CurDAG->SelectNodeTo(N, SP::RDY, MVT::i32, SDValue(Mul, 1));
|
| /external/llvm/unittests/Transforms/Utils/ |
| Cloning.cpp | 56 BinaryOperator *Mul = BinaryOperator::Create(Instruction::Mul, V, V);
60 BinaryOperator *MulClone = this->clone(Mul);
73 Mul->setHasNoUnsignedWrap();
77 MulClone = this->clone(Mul);
90 Mul->setHasNoSignedWrap();
94 MulClone = this->clone(Mul);
107 Mul->setHasNoUnsignedWrap(false);
111 MulClone = this->clone(Mul);
|
| /external/llvm/lib/Target/Mips/ |
| MipsISelDAGToDAG.cpp | 240 /// Mul with two results
251 SDNode *Mul = CurDAG->getMachineNode(Op, dl, MVT::Glue, Op1, Op2);
253 SDValue InFlag = SDValue(Mul, 0);
269 case ISD::MUL:
270 // Mips32 has a 32-bit three operand mul instruction.
275 assert((Opcode == ISD::MUL || Node->getValueType(0) != MVT::i64) &&
289 if (Opcode == ISD::MUL) {
|
| /external/llvm/lib/Transforms/Scalar/ |
| Reassociate.cpp | 283 if (I->getOpcode() == Instruction::Mul) {
524 if (isReassociableOp(Shl->getOperand(0), Instruction::Mul) ||
526 (isReassociableOp(Shl->use_back(), Instruction::Mul) ||
531 Instruction *Mul =
534 Mul->takeName(Shl);
535 Shl->replaceAllUsesWith(Mul);
536 Mul->setDebugLoc(Shl->getDebugLoc());
538 return Mul;
575 BinaryOperator *BO = isReassociableOp(V, Instruction::Mul);
636 BO->getOpcode() != Instruction::Mul) {
[all...] |
| /external/skia/src/core/ |
| SkFloat.cpp | 177 int32_t SkFloat::Mul(int32_t packed_a, int32_t packed_b)
193 return Mul(packed, SetShift(n, 0));
|
| /external/llvm/include/llvm/MC/ |
| MCExpr.h | 300 Mul, ///< Multiplication.
368 return Create(Mul, LHS, RHS, Ctx);
|
| /external/llvm/lib/Analysis/ |
| InstructionSimplify.cpp | 157 /// OpCodeToExtract is Mul then this tries to turn "(A*B)+(A*C)" into "A*(B+C)".
587 // Mul distributes over Add. Try some generic simplifications based on this.
588 if (Value *V = FactorizeBinOp(Instruction::Add, Op0, Op1, Instruction::Mul,
703 // Mul distributes over Sub. Try some generic simplifications based on this.
704 if (Value *V = FactorizeBinOp(Instruction::Sub, Op0, Op1, Instruction::Mul,
730 /// SimplifyMulInst - Given operands for a Mul, see if we can
737 return ConstantFoldInstOperands(Instruction::Mul, CLHS->getType(),
766 // i1 mul -> and.
772 if (Value *V = SimplifyAssociativeBinOp(Instruction::Mul, Op0, Op1, TD, DT,
776 // Mul distributes over Add. Try some generic simplifications based on this
[all...] |
| ScalarEvolution.cpp | [all...] |
| ScalarEvolutionExpander.cpp | 226 // In a Mul, check if there is a constant operand which is a multiple
245 // Mul's operands. If so, we can just remove it.
594 const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(F);
595 if (!Mul) return false;
598 const SCEVConstant *SC = dyn_cast<SCEVConstant>(Mul->getOperand(0));
770 // Collect all the mul operands in a loop, along with their associated loops.
780 // Emit instructions to mul all the operands. Hoist as much as possible
796 // A simple mul.
801 Prod = InsertBinop(Instruction::Mul, Prod, W);
[all...] |
| /external/v8/src/mips/ |
| macro-assembler-mips.cc | 383 void MacroAssembler::Mul(Register rd, Register rs, const Operand& rt) {
385 mul(rd, rs, rt.rm());
390 mul(rd, rs, at);
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineCalls.cpp | 503 // this into a plain NUW mul.
507 Value *Mul = Builder->CreateNUWMul(LHS, RHS, "umul_with_overflow");
513 return InsertValueInst::Create(Struct, Mul, 0);
[all...] |
| /external/llvm/lib/Target/XCore/ |
| XCoreISelLowering.cpp | 292 SDValue offset = DAG.getNode(ISD::MUL, dl, MVT::i32, BuildGetId(DAG, dl),
586 /// add(add(mul(x,y),a),b). If requireIntermediatesHaveOneUse is true then
611 if (OtherOp.getOpcode() == ISD::MUL) {
612 // add(add(a,b),mul(x,y))
621 if (AddOp.getOperand(0).getOpcode() == ISD::MUL) {
622 // add(add(mul(x,y),a),b)
631 if (AddOp.getOperand(1).getOpcode() == ISD::MUL) {
632 // add(add(a,mul(x,y)),b)
647 SDValue Mul;
649 if (N->getOperand(0).getOpcode() == ISD::MUL) {
[all...] |
| /external/llvm/bindings/ocaml/llvm/ |
| llvm.ml | 152 | Mul
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| LegalizeIntegerTypes.cpp | 106 case ISD::MUL: Res = PromoteIntRes_SimpleIntBinOp(N); break;
654 SDValue Mul = DAG.getNode(ISD::MUL, DL, LHS.getValueType(), LHS, RHS);
661 SDValue Hi = DAG.getNode(ISD::SRL, DL, Mul.getValueType(), Mul,
667 SDValue SExt = DAG.getNode(ISD::SIGN_EXTEND_INREG, DL, Mul.getValueType(),
668 Mul, DAG.getValueType(SmallVT));
669 Overflow = DAG.getSetCC(DL, N->getValueType(1), SExt, Mul, ISD::SETNE);
674 return Mul;
[all...] |
| DAGCombiner.cpp | [all...] |
| /external/valgrind/main/VEX/priv/ |
| host_arm_defs.h | 704 (eg for straight MUL) the result (Rd) and the left arg (Rm)
711 } Mul;
|
