Searched refs:op_mul (Results 1 – 11 of 11) sorted by relevance
| /external/webkit/JavaScriptCore/jit/ |
| D | JITArithmetic.cpp | 874 case op_mul: in emitBinaryDoubleOp()
931 case op_mul: in emitBinaryDoubleOp()
1001 emitBinaryDoubleOp(op_mul, dst, op1, op2, types, notInt32Op1, notInt32Op2); in emit_op_mul()
1018 emitJumpSlowToHot(jump(), OPCODE_LENGTH(op_mul)); in emitSlow_op_mul()
2222 ASSERT(opcodeID == op_mul);
2246 …if (opcodeID == op_mul && !op1HasImmediateIntFastCase && !op2HasImmediateIntFastCase) // op_mul ha…
2305 else if (opcodeID == op_mul)
2384 compileBinaryArithOp(op_mul, result, op1, op2, types);
2398 …compileBinaryArithOpSlowCase(op_mul, iter, result, op1, op2, OperandTypes::fromInt(currentInstruct…
2546 ASSERT(opcodeID == op_mul);
[all …]
|
| D | JIT.cpp | 267 DEFINE_OP(op_mul) in privateCompileMainPass()
404 DEFINE_SLOWCASE_OP(op_mul) in privateCompileSlowCases()
|
| D | JITStubs.cpp | 1604 DEFINE_STUB_FUNCTION(EncodedJSValue, op_mul) in DEFINE_STUB_FUNCTION() argument
|
| /external/webkit/JavaScriptCore/bytecode/ |
| D | Opcode.h | 69 macro(op_mul, 5) \
|
| D | CodeBlock.cpp | 592 case op_mul: { in dump()
|
| /external/webkit/JavaScriptCore/parser/ |
| D | NodeConstructors.h | 463 …: BinaryOpNode(globalData, ResultType::numberTypeCanReuse(), expr1, expr2, op_mul, rightHasAssignm… in MultNode()
|
| /external/webkit/JavaScriptCore/interpreter/ |
| D | Interpreter.cpp | 1516 DEFINE_OPCODE(op_mul) { in privateExecute()
1533 vPC += OPCODE_LENGTH(op_mul); in privateExecute()
|
| /external/webkit/JavaScriptCore/bytecompiler/ |
| D | BytecodeGenerator.cpp | 889 opcodeID == op_add || opcodeID == op_mul || opcodeID == op_sub || opcodeID == op_div) in emitBinaryOp()
|
| D | NodesCodegen.cpp | 1064 opcodeID = op_mul; in emitReadModifyAssignment()
|
| /external/webkit/JavaScriptCore/ |
| D | ChangeLog-2009-06-16 | 28952 Use simple uint32_t multiplication on op_mul if both operands are
35109 Inline immediate number version of op_mul.
|
| D | ChangeLog | 16124 not op_mul. That would be dumb.
|