| /external/clang/test/SemaTemplate/ |
| alias-church-numerals.cpp | 23 typename X> using Mul = A<PartialApply<B,F>::template R, X>;
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, F, X>;
|
| /external/llvm/unittests/Transforms/Utils/ |
| Cloning.cpp | 61 BinaryOperator *Mul = BinaryOperator::Create(Instruction::Mul, V, V);
65 BinaryOperator *MulClone = this->clone(Mul);
78 Mul->setHasNoUnsignedWrap();
82 MulClone = this->clone(Mul);
95 Mul->setHasNoSignedWrap();
99 MulClone = this->clone(Mul);
112 Mul->setHasNoUnsignedWrap(false);
116 MulClone = this->clone(Mul);
|
| /external/chromium_org/crypto/ |
| p224.cc | 167 // Mul computes *out = a*b
171 void Mul(FieldElement* out, const FieldElement& a, const FieldElement& b) {
247 Mul(&f1, f1, in); // 2**2 - 1
249 Mul(&f1, f1, in); // 2**3 - 1
253 Mul(&f1, f1, f2); // 2**6 - 1
258 Mul(&f2, f2, f1); // 2**12 - 1
263 Mul(&f2, f3, f2); // 2**24 - 1
268 Mul(&f3, f3, f2); // 2**48 - 1
273 Mul(&f3, f3, f4); // 2**96 - 1
278 Mul(&f2, f4, f2); // 2**120 -
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkFloat.h | 45 void mul(const SkFloat& a) { fPacked = Mul(fPacked, a.fPacked); } function in class:SkFloat
46 void setMul(const SkFloat& a, const SkFloat& b) { fPacked = Mul(a.fPacked, b.fPacked); }
99 static int32_t Mul(int32_t, int32_t);
|
| SkFP.h | 60 #define SkFPMul(a, b) SkFloat::Mul(a, b)
|
| SkFloat.cpp | 170 int32_t SkFloat::Mul(int32_t packed_a, int32_t packed_b)
186 return Mul(packed, SetShift(n, 0));
|
| /external/skia/src/core/ |
| SkFloat.h | 45 void mul(const SkFloat& a) { fPacked = Mul(fPacked, a.fPacked); } function in class:SkFloat
46 void setMul(const SkFloat& a, const SkFloat& b) { fPacked = Mul(a.fPacked, b.fPacked); }
99 static int32_t Mul(int32_t, int32_t);
|
| SkFP.h | 60 #define SkFPMul(a, b) SkFloat::Mul(a, b)
|
| SkFloat.cpp | 170 int32_t SkFloat::Mul(int32_t packed_a, int32_t packed_b)
186 return Mul(packed, SetShift(n, 0));
|
| /external/llvm/lib/Transforms/Scalar/ |
| Reassociate.cpp | 386 assert(Opcode == Instruction::Mul && "Unknown associative operation!");
623 if (Opcode == Instruction::Mul && BO && BinaryOperator::isNeg(BO)) {
[all...] |
| LoopStrengthReduce.cpp | 305 if (const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(S))
306 if (Mul->getOperand(0)->isAllOnesValue()) {
307 SmallVector<const SCEV *, 4> Ops(Mul->op_begin()+1, Mul->op_end());
452 /// isMulSExtable - Return true if the given mul can be sign-extended
532 if (const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(LHS)) {
533 if (IgnoreSignificantBits || isMulSExtable(Mul, SE)) {
536 for (SCEVMulExpr::op_iterator I = Mul->op_begin(), E = Mul->op_end();
716 if (const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(S))
[all...] |
| /external/llvm/include/llvm/IR/ |
| Operator.h | 76 /// which may exhibit overflow - Add, Sub, and Mul. It does not include SDiv,
114 I->getOpcode() == Instruction::Mul ||
120 CE->getOpcode() == Instruction::Mul ||
335 : public ConcreteOperator<OverflowingBinaryOperator, Instruction::Mul> {
|
| InstrTypes.h | 269 DEFINE_HELPERS(Mul, NSW) // CreateNSWMul
270 DEFINE_HELPERS(Mul, NUW) // CreateNUWMul
[all...] |
| /external/llvm/lib/Target/Sparc/ |
| SparcISelDAGToDAG.cpp | 177 // FIXME: Handle mul by immediate.
181 SDNode *Mul = CurDAG->getMachineNode(Opcode, dl, MVT::i32, MVT::Glue,
184 return CurDAG->SelectNodeTo(N, SP::RDY, MVT::i32, SDValue(Mul, 1));
|
| /external/llvm/lib/Analysis/ |
| ScalarEvolution.cpp | 296 const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(this);
297 if (!Mul) return false;
300 const SCEVConstant *SC = dyn_cast<SCEVConstant>(Mul->getOperand(0));
[all...] |
| CostModel.cpp | 127 case Instruction::Mul:
|
| InstructionSimplify.cpp | 187 /// OpCodeToExtract is Mul then this tries to turn "(A*B)+(A*C)" into "A*(B+C)".
636 // Mul distributes over Add. Try some generic simplifications based on this.
637 if (Value *V = FactorizeBinOp(Instruction::Add, Op0, Op1, Instruction::Mul,
[all...] |
| /external/llvm/lib/Target/Mips/ |
| Mips16ISelDAGToDAG.cpp | 48 SDNode *Mul = CurDAG->getMachineNode(Opc, DL, MVT::Glue, N->getOperand(0),
50 SDValue InFlag = SDValue(Mul, 0);
287 /// Mul with two results
|
| /external/valgrind/main/VEX/priv/ |
| host_mips_defs.c | 698 ret = "MUL.D";
722 ret = "MUL.S";
1172 i->Min.Mul.syned = syned;
1173 i->Min.Mul.widening = wid; /* widen=True else False */
1174 i->Min.Mul.sz32 = sz32; /* True = 32 bits */
1175 i->Min.Mul.dst = dst;
1176 i->Min.Mul.srcL = srcL;
1177 i->Min.Mul.srcR = srcR;
[all...] |
| /external/llvm/lib/IR/ |
| Instruction.cpp | 202 case Mul: return "mul";
474 /// In LLVM, the Add, Mul, And, Or, and Xor operators are associative.
478 Opcode == Add || Opcode == Mul;
506 case Mul:
|
| /external/llvm/include/llvm/MC/ |
| MCExpr.h | 374 Mul, ///< Multiplication.
442 return Create(Mul, LHS, RHS, Ctx);
|
| /external/llvm/lib/Target/XCore/ |
| XCoreISelLowering.cpp | 549 /// add(add(mul(x,y),a),b). If requireIntermediatesHaveOneUse is true then
574 if (OtherOp.getOpcode() == ISD::MUL) {
575 // add(add(a,b),mul(x,y))
584 if (AddOp.getOperand(0).getOpcode() == ISD::MUL) {
585 // add(add(mul(x,y),a),b)
594 if (AddOp.getOperand(1).getOpcode() == ISD::MUL) {
595 // add(add(a,mul(x,y)),b)
610 SDValue Mul;
612 if (N->getOperand(0).getOpcode() == ISD::MUL) {
613 Mul = N->getOperand(0)
[all...] |
| /external/clang/include/clang/AST/ |
| StmtVisitor.h | 122 BINOP_FALLBACK(Mul) BINOP_FALLBACK(Div) BINOP_FALLBACK(Rem)
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCUtil.cpp | 218 case Instruction::Mul: case Instruction::FMul:
|
| /external/llvm/lib/MC/ |
| MCExpr.cpp | 111 case MCBinaryExpr::Mul: OS << '*'; break;
726 case MCBinaryExpr::Mul: Result = LHS * RHS; break;
|
