Searched refs:op_mul (Results 1 – 11 of 11) sorted by relevance
| /external/webkit/JavaScriptCore/jit/ |
| D | JITArithmetic.cpp | 800 case op_mul: in emitBinaryDoubleOp()
853 case op_mul: in emitBinaryDoubleOp()
919 emitBinaryDoubleOp(op_mul, dst, op1, op2, types, notInt32Op1, notInt32Op2); in emit_op_mul()
936 emitJumpSlowToHot(jump(), OPCODE_LENGTH(op_mul)); in emitSlow_op_mul()
1928 ASSERT(opcodeID == op_mul);
1944 if (opcodeID == op_mul) // op_mul has an extra slow case to handle 0 * negative number.
1982 ASSERT(opcodeID == op_mul);
2060 compileBinaryArithOp(op_mul, result, op1, op2, types);
2082 compileBinaryArithOpSlowCase(op_mul, iter, result, op1, op2, types);
2151 ASSERT(opcodeID == op_mul);
[all …]
|
| D | JIT.cpp | 265 DEFINE_OP(op_mul) in privateCompileMainPass()
399 DEFINE_SLOWCASE_OP(op_mul) in privateCompileSlowCases()
|
| D | JITStubs.cpp | 1448 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 | 594 case op_mul: { in dump()
|
| /external/webkit/JavaScriptCore/parser/ |
| D | NodeConstructors.h | 463 …: BinaryOpNode(globalData, ResultType::numberTypeCanReuse(), expr1, expr2, op_mul, rightHasAssignm… in MultNode()
|
| D | Nodes.cpp | 1008 opcodeID = op_mul; in emitReadModifyAssignment()
|
| /external/webkit/JavaScriptCore/bytecompiler/ |
| D | BytecodeGenerator.cpp | 864 opcodeID == op_add || opcodeID == op_mul || opcodeID == op_sub || opcodeID == op_div) in emitBinaryOp()
|
| /external/webkit/JavaScriptCore/interpreter/ |
| D | Interpreter.cpp | 1549 DEFINE_OPCODE(op_mul) { in privateExecute()
|
| /external/webkit/JavaScriptCore/ |
| D | ChangeLog | 2411 not op_mul. That would be dumb.
|
| 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.
|