| /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/clang/test/SemaTemplate/ |
| alias-church-numerals.cpp | 22 typename X> using Mul = A<PartialApply<B,F>::template R, X>;
25 template<template<typename> class F, typename X> using Sixteen = Mul<Four, Four, F, X>;
26 template<template<typename> class F, typename X> using TwoHundredAndFiftySix = Mul<Sixteen, Sixteen, F, X>;
|
| /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...] |
| LoopStrengthReduce.cpp | 268 if (const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(S))
269 if (Mul->getOperand(0)->isAllOnesValue()) {
270 SmallVector<const SCEV *, 4> Ops(Mul->op_begin()+1, Mul->op_end());
413 /// isMulSExtable - Return true if the given mul can be sign-extended
493 if (const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(LHS)) {
494 if (IgnoreSignificantBits || isMulSExtable(Mul, SE)) {
497 for (SCEVMulExpr::op_iterator I = Mul->op_begin(), E = Mul->op_end();
832 OS << ", plus " << NumIVMuls << " IV mul" << (NumIVMuls == 1 ? "" : "s")
[all...] |
| /external/skia/src/core/ |
| SkFloat.h | 52 void mul(const SkFloat& a) { fPacked = Mul(fPacked, a.fPacked); } function in class:SkFloat
53 void setMul(const SkFloat& a, const SkFloat& b) { fPacked = Mul(a.fPacked, b.fPacked); }
106 static int32_t Mul(int32_t, int32_t);
|
| SkFP.h | 68 #define SkFPMul(a, b) SkFloat::Mul(a, b)
|
| 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/ |
| Operator.h | 68 /// which may exhibit overflow - Add, Sub, and Mul. It does not include SDiv,
109 I->getOpcode() == Instruction::Mul ||
115 CE->getOpcode() == Instruction::Mul ||
197 : public ConcreteOperator<OverflowingBinaryOperator, Instruction::Mul> {
|
| InstrTypes.h | 271 DEFINE_HELPERS(Mul, NSW) // CreateNSWMul
272 DEFINE_HELPERS(Mul, NUW) // CreateNUWMul
[all...] |
| /external/llvm/lib/VMCore/ |
| Instruction.cpp | 112 case Mul: return "mul";
322 /// In LLVM, the Add, Mul, And, Or, and Xor operators are associative.
326 Opcode == Add || Opcode == Mul;
340 case Mul:
|
| /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/lib/Analysis/ |
| ScalarEvolution.cpp | [all...] |
| LoopInfo.cpp | 236 case BinaryOperator::Mul:
|
| InstructionSimplify.cpp | 137 /// OpCodeToExtract is Mul then this tries to turn "(A*B)+(A*C)" into "A*(B+C)".
567 // Mul distributes over Add. Try some generic simplifications based on this.
568 if (Value *V = FactorizeBinOp(Instruction::Add, Op0, Op1, Instruction::Mul,
683 // Mul distributes over Sub. Try some generic simplifications based on this.
684 if (Value *V = FactorizeBinOp(Instruction::Sub, Op0, Op1, Instruction::Mul,
710 /// SimplifyMulInst - Given operands for a Mul, see if we can
717 return ConstantFoldInstOperands(Instruction::Mul, CLHS->getType(),
746 // i1 mul -> and.
752 if (Value *V = SimplifyAssociativeBinOp(Instruction::Mul, Op0, Op1, TD, DT,
756 // Mul distributes over Add. Try some generic simplifications based on this
[all...] |
| ScalarEvolutionExpander.cpp | 222 // In a Mul, check if there is a constant operand which is a multiple
241 // Mul's operands. If so, we can just remove it.
591 const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(F);
592 if (!Mul) return false;
595 const SCEVConstant *SC = dyn_cast<SCEVConstant>(Mul->getOperand(0));
767 // Collect all the mul operands in a loop, along with their associated loops.
777 // Emit instructions to mul all the operands. Hoist as much as possible
793 // A simple mul.
798 Prod = InsertBinop(Instruction::Mul, Prod, W);
[all...] |
| /external/llvm/include/llvm/MC/ |
| MCExpr.h | 300 Mul, ///< Multiplication.
368 return Create(Mul, LHS, RHS, Ctx);
|
| /external/llvm/lib/Transforms/Utils/ |
| AddrModeMatcher.cpp | 138 case Instruction::Mul:
204 case Instruction::Mul:
|
| /external/llvm/lib/Target/XCore/ |
| XCoreISelLowering.cpp | 289 SDValue offset = DAG.getNode(ISD::MUL, dl, MVT::i32, BuildGetId(DAG, dl),
583 /// add(add(mul(x,y),a),b). If requireIntermediatesHaveOneUse is true then
608 if (OtherOp.getOpcode() == ISD::MUL) {
609 // add(add(a,b),mul(x,y))
618 if (AddOp.getOperand(0).getOpcode() == ISD::MUL) {
619 // add(add(mul(x,y),a),b)
628 if (AddOp.getOperand(1).getOpcode() == ISD::MUL) {
629 // add(add(a,mul(x,y)),b)
644 SDValue Mul;
646 if (N->getOperand(0).getOpcode() == ISD::MUL) {
[all...] |
| /external/clang/include/clang/AST/ |
| StmtVisitor.h | 123 BINOP_FALLBACK(Mul) BINOP_FALLBACK(Div) BINOP_FALLBACK(Rem)
|
| /external/llvm/lib/MC/ |
| MCExpr.cpp | 117 case MCBinaryExpr::Mul: OS << '*'; break;
547 case MCBinaryExpr::Mul: Result = LHS * RHS; break;
|
| /external/llvm/lib/Target/Mips/ |
| MipsISelDAGToDAG.cpp | 364 /// Mul with two results
373 SDNode *Mul = CurDAG->getMachineNode(Op, dl, MVT::Glue, Op1, Op2);
375 SDValue InFlag = SDValue(Mul, 0);
391 case ISD::MUL:
405 if (Opcode == ISD::MUL)
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineCasts.cpp | 49 if (I->getOpcode() == Instruction::Mul) {
171 case Instruction::Mul:
351 case Instruction::Mul:
677 case Instruction::Mul:
[all...] |
| InstCombineSelect.cpp | 86 case Instruction::Mul:
116 case Instruction::Mul:
[all...] |
| /external/llvm/include/llvm/Support/ |
| PatternMatch.h | 315 inline BinaryOp_match<LHS, RHS, Instruction::Mul>
317 return BinaryOp_match<LHS, RHS, Instruction::Mul>(L, R);
|
| /external/llvm/lib/Target/CBackend/ |
| CBackend.cpp | 812 case Instruction::Mul:
836 case Instruction::Mul:
[all...] |
