• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /macosx-10.10.1/JavaScriptCore-7600.1.17/jit/

Lines Matching defs:op2

49     int op2 = currentInstruction[2].u.operand;
52 emit_compareAndJump(op_jless, op1, op2, target, LessThan);
58 int op2 = currentInstruction[2].u.operand;
61 emit_compareAndJump(op_jlesseq, op1, op2, target, LessThanOrEqual);
67 int op2 = currentInstruction[2].u.operand;
70 emit_compareAndJump(op_jgreater, op1, op2, target, GreaterThan);
76 int op2 = currentInstruction[2].u.operand;
79 emit_compareAndJump(op_jgreatereq, op1, op2, target, GreaterThanOrEqual);
85 int op2 = currentInstruction[2].u.operand;
88 emit_compareAndJump(op_jnless, op1, op2, target, GreaterThanOrEqual);
94 int op2 = currentInstruction[2].u.operand;
97 emit_compareAndJump(op_jnlesseq, op1, op2, target, GreaterThan);
103 int op2 = currentInstruction[2].u.operand;
106 emit_compareAndJump(op_jngreater, op1, op2, target, LessThanOrEqual);
112 int op2 = currentInstruction[2].u.operand;
115 emit_compareAndJump(op_jngreatereq, op1, op2, target, LessThan);
121 int op2 = currentInstruction[2].u.operand;
124 emit_compareAndJumpSlow(op1, op2, target, DoubleLessThan, operationCompareLess, false, iter);
130 int op2 = currentInstruction[2].u.operand;
133 emit_compareAndJumpSlow(op1, op2, target, DoubleLessThanOrEqual, operationCompareLessEq, false, iter);
139 int op2 = currentInstruction[2].u.operand;
142 emit_compareAndJumpSlow(op1, op2, target, DoubleGreaterThan, operationCompareGreater, false, iter);
148 int op2 = currentInstruction[2].u.operand;
151 emit_compareAndJumpSlow(op1, op2, target, DoubleGreaterThanOrEqual, operationCompareGreaterEq, false, iter);
157 int op2 = currentInstruction[2].u.operand;
160 emit_compareAndJumpSlow(op1, op2, target, DoubleGreaterThanOrEqualOrUnordered, operationCompareLess, true, iter);
166 int op2 = currentInstruction[2].u.operand;
169 emit_compareAndJumpSlow(op1, op2, target, DoubleGreaterThanOrUnordered, operationCompareLessEq, true, iter);
175 int op2 = currentInstruction[2].u.operand;
178 emit_compareAndJumpSlow(op1, op2, target, DoubleLessThanOrEqualOrUnordered, operationCompareGreater, true, iter);
184 int op2 = currentInstruction[2].u.operand;
187 emit_compareAndJumpSlow(op1, op2, target, DoubleLessThanOrUnordered, operationCompareGreaterEq, true, iter);
229 int op2 = currentInstruction[3].u.operand;
231 emitGetVirtualRegisters(op1, regT0, op2, regT2);
254 int op2 = currentInstruction[3].u.operand;
256 if (isOperandConstantImmediateInt(op2)) {
257 // isOperandConstantImmediateInt(op2) => 1 SlowCase
261 rshift32(Imm32(getConstantOperandImmediateInt(op2) & 0x1f), regT0);
263 emitGetVirtualRegisters(op1, regT0, op2, regT2);
287 int op2 = currentInstruction[3].u.operand;
289 if (isOperandConstantImmediateInt(op2))
311 int op2 = currentInstruction[3].u.operand;
313 if (isOperandConstantImmediateInt(op2)) {
314 // isOperandConstantImmediateInt(op2) => 1 SlowCase
318 urshift32(Imm32(getConstantOperandImmediateInt(op2) & 0x1f), regT0);
320 emitGetVirtualRegisters(op1, regT0, op2, regT2);
344 int op2 = currentInstruction[3].u.operand;
346 if (isOperandConstantImmediateInt(op2))
385 void JIT::emit_compareAndJump(OpcodeID, int op1, int op2, unsigned target, RelationalCondition condition)
393 emitGetVirtualRegister(op2, regT0);
401 if (isOperandConstantImmediateChar(op2)) {
407 addJump(branch32(condition, regT0, Imm32(asString(getConstantOperand(op2))->tryGetValue()[0])), target);
410 if (isOperandConstantImmediateInt(op2)) {
413 int32_t op2imm = getConstantOperandImmediateInt(op2);
416 emitGetVirtualRegister(op2, regT1);
421 emitGetVirtualRegisters(op1, regT0, op2, regT1);
429 void JIT::emit_compareAndJumpSlow(int op1, int op2, unsigned target, DoubleCondition condition, size_t (JIT_OPERATION *operation)(ExecState*, EncodedJSValue, EncodedJSValue), bool invert, Vector<SlowCaseEntry>::iterator& iter)
443 if (isOperandConstantImmediateChar(op1) || isOperandConstantImmediateChar(op2)) {
450 emitGetVirtualRegister(op2, argumentGPR1);
456 if (isOperandConstantImmediateInt(op2)) {
464 int32_t op2imm = getConstantOperand(op2).asInt32();
476 emitGetVirtualRegister(op2, regT1);
533 int op2 = currentInstruction[3].u.operand;
536 emitGetVirtualRegister(op2, regT0);
542 } else if (isOperandConstantImmediateInt(op2)) {
545 int32_t imm = getConstantOperandImmediateInt(op2);
550 emitGetVirtualRegisters(op1, regT0, op2, regT1);
611 int op2 = currentInstruction[3].u.operand;
618 emitGetVirtualRegisters(op1, regT3, op2, regT2);
666 void JIT::compileBinaryArithOp(OpcodeID opcodeID, int, int op1, int op2, OperandTypes)
668 emitGetVirtualRegisters(op1, regT0, op2, regT1);
705 void JIT::compileBinaryArithOpSlowCase(Instruction* currentInstruction, OpcodeID opcodeID, Vector<SlowCaseEntry>::iterator& iter, int result, int op1, int op2, OperandTypes types, bool op1HasImmediateIntFastCase, bool op2HasImmediateIntFastCase)
743 emitGetVirtualRegister(op2, regT1);
792 int op2 = currentInstruction[3].u.operand;
803 emitGetVirtualRegister(op2, regT0);
807 } else if (isOperandConstantImmediateInt(op2)) {
810 addSlowCase(branchAdd32(Overflow, regT0, Imm32(getConstantOperandImmediateInt(op2)), regT1));
813 compileBinaryArithOp(op_add, result, op1, op2, types);
822 int op2 = currentInstruction[3].u.operand;
831 bool op2HasImmediateIntFastCase = !op1HasImmediateIntFastCase && isOperandConstantImmediateInt(op2);
832 compileBinaryArithOpSlowCase(currentInstruction, op_add, iter, result, op1, op2, types, op1HasImmediateIntFastCase, op2HasImmediateIntFastCase);
839 int op2 = currentInstruction[3].u.operand;
847 emitGetVirtualRegister(op2, regT0);
851 } else if (isOperandConstantImmediateInt(op2) && ((value = getConstantOperandImmediateInt(op2)) > 0)) {
859 compileBinaryArithOp(op_mul, result, op1, op2, types);
868 int op2 = currentInstruction[3].u.operand;
872 bool op2HasImmediateIntFastCase = !op1HasImmediateIntFastCase && isOperandConstantImmediateInt(op2) && getConstantOperandImmediateInt(op2) > 0;
873 compileBinaryArithOpSlowCase(currentInstruction, op_mul, iter, result, op1, op2, types, op1HasImmediateIntFastCase, op2HasImmediateIntFastCase);
880 int op2 = currentInstruction[3].u.operand;
902 if (isOperandConstantImmediateDouble(op2)) {
903 emitGetVirtualRegister(op2, regT1);
906 } else if (isOperandConstantImmediateInt(op2)) {
907 emitLoadInt32ToDouble(op2, fpRegT1);
909 emitGetVirtualRegister(op2, regT1);
955 int op2 = currentInstruction[3].u.operand;
966 if (!isOperandConstantImmediateDouble(op2) && !isOperandConstantImmediateInt(op2)) {
970 // There is an extra slow case for (op1 * -N) or (-N * op2), to check for 0 since this should produce a result of -0.
979 int op2 = currentInstruction[3].u.operand;
982 compileBinaryArithOp(op_sub, result, op1, op2, types);
990 int op2 = currentInstruction[3].u.operand;
993 compileBinaryArithOpSlowCase(currentInstruction, op_sub, iter, result, op1, op2, types, false, false);