Index: src/ia32/lithium-codegen-ia32.cc |
diff --git a/src/ia32/lithium-codegen-ia32.cc b/src/ia32/lithium-codegen-ia32.cc |
index 39fe597090ce00a62c88b11043c0f40b08e3a37c..8d4e1cf91c7157ea8a1199312e391acbd5b30652 100644 |
--- a/src/ia32/lithium-codegen-ia32.cc |
+++ b/src/ia32/lithium-codegen-ia32.cc |
@@ -825,9 +825,9 @@ void LCodeGen::RegisterEnvironmentForDeoptimization( |
} |
-void LCodeGen::DeoptimizeIf(Condition cc, |
- LEnvironment* environment, |
+void LCodeGen::DeoptimizeIf(Condition cc, LInstruction* instr, |
Deoptimizer::BailoutType bailout_type) { |
+ LEnvironment* environment = instr->environment(); |
RegisterEnvironmentForDeoptimization(environment, Safepoint::kNoLazyDeopt); |
DCHECK(environment->HasBeenRegistered()); |
int id = environment->deoptimization_index(); |
@@ -891,12 +891,11 @@ void LCodeGen::DeoptimizeIf(Condition cc, |
} |
-void LCodeGen::DeoptimizeIf(Condition cc, |
- LEnvironment* environment) { |
+void LCodeGen::DeoptimizeIf(Condition cc, LInstruction* instr) { |
Deoptimizer::BailoutType bailout_type = info()->IsStub() |
? Deoptimizer::LAZY |
: Deoptimizer::EAGER; |
- DeoptimizeIf(cc, environment, bailout_type); |
+ DeoptimizeIf(cc, instr, bailout_type); |
} |
@@ -1125,7 +1124,7 @@ void LCodeGen::DoModByPowerOf2I(LModByPowerOf2I* instr) { |
__ and_(dividend, mask); |
__ neg(dividend); |
if (hmod->CheckFlag(HValue::kBailoutOnMinusZero)) { |
- DeoptimizeIf(zero, instr->environment()); |
+ DeoptimizeIf(zero, instr); |
} |
__ jmp(&done, Label::kNear); |
} |
@@ -1142,7 +1141,7 @@ void LCodeGen::DoModByConstI(LModByConstI* instr) { |
DCHECK(ToRegister(instr->result()).is(eax)); |
if (divisor == 0) { |
- DeoptimizeIf(no_condition, instr->environment()); |
+ DeoptimizeIf(no_condition, instr); |
return; |
} |
@@ -1157,7 +1156,7 @@ void LCodeGen::DoModByConstI(LModByConstI* instr) { |
Label remainder_not_zero; |
__ j(not_zero, &remainder_not_zero, Label::kNear); |
__ cmp(dividend, Immediate(0)); |
- DeoptimizeIf(less, instr->environment()); |
+ DeoptimizeIf(less, instr); |
__ bind(&remainder_not_zero); |
} |
} |
@@ -1179,7 +1178,7 @@ void LCodeGen::DoModI(LModI* instr) { |
// deopt in this case because we can't return a NaN. |
if (hmod->CheckFlag(HValue::kCanBeDivByZero)) { |
__ test(right_reg, Operand(right_reg)); |
- DeoptimizeIf(zero, instr->environment()); |
+ DeoptimizeIf(zero, instr); |
} |
// Check for kMinInt % -1, idiv would signal a divide error. We |
@@ -1190,7 +1189,7 @@ void LCodeGen::DoModI(LModI* instr) { |
__ j(not_equal, &no_overflow_possible, Label::kNear); |
__ cmp(right_reg, -1); |
if (hmod->CheckFlag(HValue::kBailoutOnMinusZero)) { |
- DeoptimizeIf(equal, instr->environment()); |
+ DeoptimizeIf(equal, instr); |
} else { |
__ j(not_equal, &no_overflow_possible, Label::kNear); |
__ Move(result_reg, Immediate(0)); |
@@ -1209,7 +1208,7 @@ void LCodeGen::DoModI(LModI* instr) { |
__ j(not_sign, &positive_left, Label::kNear); |
__ idiv(right_reg); |
__ test(result_reg, Operand(result_reg)); |
- DeoptimizeIf(zero, instr->environment()); |
+ DeoptimizeIf(zero, instr); |
__ jmp(&done, Label::kNear); |
__ bind(&positive_left); |
} |
@@ -1229,19 +1228,19 @@ void LCodeGen::DoDivByPowerOf2I(LDivByPowerOf2I* instr) { |
HDiv* hdiv = instr->hydrogen(); |
if (hdiv->CheckFlag(HValue::kBailoutOnMinusZero) && divisor < 0) { |
__ test(dividend, dividend); |
- DeoptimizeIf(zero, instr->environment()); |
+ DeoptimizeIf(zero, instr); |
} |
// Check for (kMinInt / -1). |
if (hdiv->CheckFlag(HValue::kCanOverflow) && divisor == -1) { |
__ cmp(dividend, kMinInt); |
- DeoptimizeIf(zero, instr->environment()); |
+ DeoptimizeIf(zero, instr); |
} |
// Deoptimize if remainder will not be 0. |
if (!hdiv->CheckFlag(HInstruction::kAllUsesTruncatingToInt32) && |
divisor != 1 && divisor != -1) { |
int32_t mask = divisor < 0 ? -(divisor + 1) : (divisor - 1); |
__ test(dividend, Immediate(mask)); |
- DeoptimizeIf(not_zero, instr->environment()); |
+ DeoptimizeIf(not_zero, instr); |
} |
__ Move(result, dividend); |
int32_t shift = WhichPowerOf2Abs(divisor); |
@@ -1262,7 +1261,7 @@ void LCodeGen::DoDivByConstI(LDivByConstI* instr) { |
DCHECK(ToRegister(instr->result()).is(edx)); |
if (divisor == 0) { |
- DeoptimizeIf(no_condition, instr->environment()); |
+ DeoptimizeIf(no_condition, instr); |
return; |
} |
@@ -1270,7 +1269,7 @@ void LCodeGen::DoDivByConstI(LDivByConstI* instr) { |
HDiv* hdiv = instr->hydrogen(); |
if (hdiv->CheckFlag(HValue::kBailoutOnMinusZero) && divisor < 0) { |
__ test(dividend, dividend); |
- DeoptimizeIf(zero, instr->environment()); |
+ DeoptimizeIf(zero, instr); |
} |
__ TruncatingDiv(dividend, Abs(divisor)); |
@@ -1280,7 +1279,7 @@ void LCodeGen::DoDivByConstI(LDivByConstI* instr) { |
__ mov(eax, edx); |
__ imul(eax, eax, divisor); |
__ sub(eax, dividend); |
- DeoptimizeIf(not_equal, instr->environment()); |
+ DeoptimizeIf(not_equal, instr); |
} |
} |
@@ -1300,7 +1299,7 @@ void LCodeGen::DoDivI(LDivI* instr) { |
// Check for x / 0. |
if (hdiv->CheckFlag(HValue::kCanBeDivByZero)) { |
__ test(divisor, divisor); |
- DeoptimizeIf(zero, instr->environment()); |
+ DeoptimizeIf(zero, instr); |
} |
// Check for (0 / -x) that will produce negative zero. |
@@ -1309,7 +1308,7 @@ void LCodeGen::DoDivI(LDivI* instr) { |
__ test(dividend, dividend); |
__ j(not_zero, ÷nd_not_zero, Label::kNear); |
__ test(divisor, divisor); |
- DeoptimizeIf(sign, instr->environment()); |
+ DeoptimizeIf(sign, instr); |
__ bind(÷nd_not_zero); |
} |
@@ -1319,7 +1318,7 @@ void LCodeGen::DoDivI(LDivI* instr) { |
__ cmp(dividend, kMinInt); |
__ j(not_zero, ÷nd_not_min_int, Label::kNear); |
__ cmp(divisor, -1); |
- DeoptimizeIf(zero, instr->environment()); |
+ DeoptimizeIf(zero, instr); |
__ bind(÷nd_not_min_int); |
} |
@@ -1330,7 +1329,7 @@ void LCodeGen::DoDivI(LDivI* instr) { |
if (!hdiv->CheckFlag(HValue::kAllUsesTruncatingToInt32)) { |
// Deoptimize if remainder is not 0. |
__ test(remainder, remainder); |
- DeoptimizeIf(not_zero, instr->environment()); |
+ DeoptimizeIf(not_zero, instr); |
} |
} |
@@ -1352,13 +1351,13 @@ void LCodeGen::DoFlooringDivByPowerOf2I(LFlooringDivByPowerOf2I* instr) { |
// If the divisor is negative, we have to negate and handle edge cases. |
__ neg(dividend); |
if (instr->hydrogen()->CheckFlag(HValue::kBailoutOnMinusZero)) { |
- DeoptimizeIf(zero, instr->environment()); |
+ DeoptimizeIf(zero, instr); |
} |
// Dividing by -1 is basically negation, unless we overflow. |
if (divisor == -1) { |
if (instr->hydrogen()->CheckFlag(HValue::kLeftCanBeMinInt)) { |
- DeoptimizeIf(overflow, instr->environment()); |
+ DeoptimizeIf(overflow, instr); |
} |
return; |
} |
@@ -1385,7 +1384,7 @@ void LCodeGen::DoFlooringDivByConstI(LFlooringDivByConstI* instr) { |
DCHECK(ToRegister(instr->result()).is(edx)); |
if (divisor == 0) { |
- DeoptimizeIf(no_condition, instr->environment()); |
+ DeoptimizeIf(no_condition, instr); |
return; |
} |
@@ -1393,7 +1392,7 @@ void LCodeGen::DoFlooringDivByConstI(LFlooringDivByConstI* instr) { |
HMathFloorOfDiv* hdiv = instr->hydrogen(); |
if (hdiv->CheckFlag(HValue::kBailoutOnMinusZero) && divisor < 0) { |
__ test(dividend, dividend); |
- DeoptimizeIf(zero, instr->environment()); |
+ DeoptimizeIf(zero, instr); |
} |
// Easy case: We need no dynamic check for the dividend and the flooring |
@@ -1440,7 +1439,7 @@ void LCodeGen::DoFlooringDivI(LFlooringDivI* instr) { |
// Check for x / 0. |
if (hdiv->CheckFlag(HValue::kCanBeDivByZero)) { |
__ test(divisor, divisor); |
- DeoptimizeIf(zero, instr->environment()); |
+ DeoptimizeIf(zero, instr); |
} |
// Check for (0 / -x) that will produce negative zero. |
@@ -1449,7 +1448,7 @@ void LCodeGen::DoFlooringDivI(LFlooringDivI* instr) { |
__ test(dividend, dividend); |
__ j(not_zero, ÷nd_not_zero, Label::kNear); |
__ test(divisor, divisor); |
- DeoptimizeIf(sign, instr->environment()); |
+ DeoptimizeIf(sign, instr); |
__ bind(÷nd_not_zero); |
} |
@@ -1459,7 +1458,7 @@ void LCodeGen::DoFlooringDivI(LFlooringDivI* instr) { |
__ cmp(dividend, kMinInt); |
__ j(not_zero, ÷nd_not_min_int, Label::kNear); |
__ cmp(divisor, -1); |
- DeoptimizeIf(zero, instr->environment()); |
+ DeoptimizeIf(zero, instr); |
__ bind(÷nd_not_min_int); |
} |
@@ -1537,7 +1536,7 @@ void LCodeGen::DoMulI(LMulI* instr) { |
} |
if (instr->hydrogen()->CheckFlag(HValue::kCanOverflow)) { |
- DeoptimizeIf(overflow, instr->environment()); |
+ DeoptimizeIf(overflow, instr); |
} |
if (instr->hydrogen()->CheckFlag(HValue::kBailoutOnMinusZero)) { |
@@ -1547,15 +1546,15 @@ void LCodeGen::DoMulI(LMulI* instr) { |
__ j(not_zero, &done, Label::kNear); |
if (right->IsConstantOperand()) { |
if (ToInteger32(LConstantOperand::cast(right)) < 0) { |
- DeoptimizeIf(no_condition, instr->environment()); |
+ DeoptimizeIf(no_condition, instr); |
} else if (ToInteger32(LConstantOperand::cast(right)) == 0) { |
__ cmp(ToRegister(instr->temp()), Immediate(0)); |
- DeoptimizeIf(less, instr->environment()); |
+ DeoptimizeIf(less, instr); |
} |
} else { |
// Test the non-zero operand for negative sign. |
__ or_(ToRegister(instr->temp()), ToOperand(right)); |
- DeoptimizeIf(sign, instr->environment()); |
+ DeoptimizeIf(sign, instr); |
} |
__ bind(&done); |
} |
@@ -1622,7 +1621,7 @@ void LCodeGen::DoShiftI(LShiftI* instr) { |
__ ror_cl(ToRegister(left)); |
if (instr->can_deopt()) { |
__ test(ToRegister(left), ToRegister(left)); |
- DeoptimizeIf(sign, instr->environment()); |
+ DeoptimizeIf(sign, instr); |
} |
break; |
case Token::SAR: |
@@ -1632,7 +1631,7 @@ void LCodeGen::DoShiftI(LShiftI* instr) { |
__ shr_cl(ToRegister(left)); |
if (instr->can_deopt()) { |
__ test(ToRegister(left), ToRegister(left)); |
- DeoptimizeIf(sign, instr->environment()); |
+ DeoptimizeIf(sign, instr); |
} |
break; |
case Token::SHL: |
@@ -1649,7 +1648,7 @@ void LCodeGen::DoShiftI(LShiftI* instr) { |
case Token::ROR: |
if (shift_count == 0 && instr->can_deopt()) { |
__ test(ToRegister(left), ToRegister(left)); |
- DeoptimizeIf(sign, instr->environment()); |
+ DeoptimizeIf(sign, instr); |
} else { |
__ ror(ToRegister(left), shift_count); |
} |
@@ -1664,7 +1663,7 @@ void LCodeGen::DoShiftI(LShiftI* instr) { |
__ shr(ToRegister(left), shift_count); |
} else if (instr->can_deopt()) { |
__ test(ToRegister(left), ToRegister(left)); |
- DeoptimizeIf(sign, instr->environment()); |
+ DeoptimizeIf(sign, instr); |
} |
break; |
case Token::SHL: |
@@ -1675,7 +1674,7 @@ void LCodeGen::DoShiftI(LShiftI* instr) { |
__ shl(ToRegister(left), shift_count - 1); |
} |
__ SmiTag(ToRegister(left)); |
- DeoptimizeIf(overflow, instr->environment()); |
+ DeoptimizeIf(overflow, instr); |
} else { |
__ shl(ToRegister(left), shift_count); |
} |
@@ -1701,7 +1700,7 @@ void LCodeGen::DoSubI(LSubI* instr) { |
__ sub(ToRegister(left), ToOperand(right)); |
} |
if (instr->hydrogen()->CheckFlag(HValue::kCanOverflow)) { |
- DeoptimizeIf(overflow, instr->environment()); |
+ DeoptimizeIf(overflow, instr); |
} |
} |
@@ -1785,9 +1784,9 @@ void LCodeGen::DoDateField(LDateField* instr) { |
DCHECK(object.is(eax)); |
__ test(object, Immediate(kSmiTagMask)); |
- DeoptimizeIf(zero, instr->environment()); |
+ DeoptimizeIf(zero, instr); |
__ CmpObjectType(object, JS_DATE_TYPE, scratch); |
- DeoptimizeIf(not_equal, instr->environment()); |
+ DeoptimizeIf(not_equal, instr); |
if (index->value() == 0) { |
__ mov(result, FieldOperand(object, JSDate::kValueOffset)); |
@@ -1917,7 +1916,7 @@ void LCodeGen::DoAddI(LAddI* instr) { |
__ add(ToRegister(left), ToOperand(right)); |
} |
if (instr->hydrogen()->CheckFlag(HValue::kCanOverflow)) { |
- DeoptimizeIf(overflow, instr->environment()); |
+ DeoptimizeIf(overflow, instr); |
} |
} |
} |
@@ -2141,7 +2140,7 @@ void LCodeGen::DoBranch(LBranch* instr) { |
} else if (expected.NeedsMap()) { |
// If we need a map later and have a Smi -> deopt. |
__ test(reg, Immediate(kSmiTagMask)); |
- DeoptimizeIf(zero, instr->environment()); |
+ DeoptimizeIf(zero, instr); |
} |
Register map = no_reg; // Keep the compiler happy. |
@@ -2198,7 +2197,7 @@ void LCodeGen::DoBranch(LBranch* instr) { |
if (!expected.IsGeneric()) { |
// We've seen something for the first time -> deopt. |
// This can only happen if we are not generic already. |
- DeoptimizeIf(no_condition, instr->environment()); |
+ DeoptimizeIf(no_condition, instr); |
} |
} |
} |
@@ -2828,7 +2827,7 @@ void LCodeGen::DoLoadGlobalCell(LLoadGlobalCell* instr) { |
__ mov(result, Operand::ForCell(instr->hydrogen()->cell().handle())); |
if (instr->hydrogen()->RequiresHoleCheck()) { |
__ cmp(result, factory()->the_hole_value()); |
- DeoptimizeIf(equal, instr->environment()); |
+ DeoptimizeIf(equal, instr); |
} |
} |
@@ -2872,7 +2871,7 @@ void LCodeGen::DoStoreGlobalCell(LStoreGlobalCell* instr) { |
// it as no longer deleted. We deoptimize in that case. |
if (instr->hydrogen()->RequiresHoleCheck()) { |
__ cmp(Operand::ForCell(cell_handle), factory()->the_hole_value()); |
- DeoptimizeIf(equal, instr->environment()); |
+ DeoptimizeIf(equal, instr); |
} |
// Store the value. |
@@ -2889,7 +2888,7 @@ void LCodeGen::DoLoadContextSlot(LLoadContextSlot* instr) { |
if (instr->hydrogen()->RequiresHoleCheck()) { |
__ cmp(result, factory()->the_hole_value()); |
if (instr->hydrogen()->DeoptimizesOnHole()) { |
- DeoptimizeIf(equal, instr->environment()); |
+ DeoptimizeIf(equal, instr); |
} else { |
Label is_not_hole; |
__ j(not_equal, &is_not_hole, Label::kNear); |
@@ -2910,7 +2909,7 @@ void LCodeGen::DoStoreContextSlot(LStoreContextSlot* instr) { |
if (instr->hydrogen()->RequiresHoleCheck()) { |
__ cmp(target, factory()->the_hole_value()); |
if (instr->hydrogen()->DeoptimizesOnHole()) { |
- DeoptimizeIf(equal, instr->environment()); |
+ DeoptimizeIf(equal, instr); |
} else { |
__ j(not_equal, &skip_assignment, Label::kNear); |
} |
@@ -3009,7 +3008,7 @@ void LCodeGen::DoLoadFunctionPrototype(LLoadFunctionPrototype* instr) { |
// Check that the function has a prototype or an initial map. |
__ cmp(Operand(result), Immediate(factory()->the_hole_value())); |
- DeoptimizeIf(equal, instr->environment()); |
+ DeoptimizeIf(equal, instr); |
// If the function does not have an initial map, we're done. |
Label done; |
@@ -3102,7 +3101,7 @@ void LCodeGen::DoLoadKeyedExternalArray(LLoadKeyed* instr) { |
__ mov(result, operand); |
if (!instr->hydrogen()->CheckFlag(HInstruction::kUint32)) { |
__ test(result, Operand(result)); |
- DeoptimizeIf(negative, instr->environment()); |
+ DeoptimizeIf(negative, instr); |
} |
break; |
case EXTERNAL_FLOAT32_ELEMENTS: |
@@ -3132,7 +3131,7 @@ void LCodeGen::DoLoadKeyedFixedDoubleArray(LLoadKeyed* instr) { |
FAST_DOUBLE_ELEMENTS, |
instr->base_offset() + sizeof(kHoleNanLower32)); |
__ cmp(hole_check_operand, Immediate(kHoleNanUpper32)); |
- DeoptimizeIf(equal, instr->environment()); |
+ DeoptimizeIf(equal, instr); |
} |
Operand double_load_operand = BuildFastArrayOperand( |
@@ -3159,10 +3158,10 @@ void LCodeGen::DoLoadKeyedFixedArray(LLoadKeyed* instr) { |
if (instr->hydrogen()->RequiresHoleCheck()) { |
if (IsFastSmiElementsKind(instr->hydrogen()->elements_kind())) { |
__ test(result, Immediate(kSmiTagMask)); |
- DeoptimizeIf(not_equal, instr->environment()); |
+ DeoptimizeIf(not_equal, instr); |
} else { |
__ cmp(result, factory()->the_hole_value()); |
- DeoptimizeIf(equal, instr->environment()); |
+ DeoptimizeIf(equal, instr); |
} |
} |
} |
@@ -3309,9 +3308,9 @@ void LCodeGen::DoWrapReceiver(LWrapReceiver* instr) { |
// The receiver should be a JS object. |
__ test(receiver, Immediate(kSmiTagMask)); |
- DeoptimizeIf(equal, instr->environment()); |
+ DeoptimizeIf(equal, instr); |
__ CmpObjectType(receiver, FIRST_SPEC_OBJECT_TYPE, scratch); |
- DeoptimizeIf(below, instr->environment()); |
+ DeoptimizeIf(below, instr); |
__ jmp(&receiver_ok, Label::kNear); |
__ bind(&global_object); |
@@ -3337,7 +3336,7 @@ void LCodeGen::DoApplyArguments(LApplyArguments* instr) { |
// adaptor frame below it. |
const uint32_t kArgumentsLimit = 1 * KB; |
__ cmp(length, kArgumentsLimit); |
- DeoptimizeIf(above, instr->environment()); |
+ DeoptimizeIf(above, instr); |
__ push(receiver); |
__ mov(receiver, length); |
@@ -3530,7 +3529,7 @@ void LCodeGen::DoDeferredMathAbsTaggedHeapNumber(LMathAbs* instr) { |
Register input_reg = ToRegister(instr->value()); |
__ cmp(FieldOperand(input_reg, HeapObject::kMapOffset), |
factory()->heap_number_map()); |
- DeoptimizeIf(not_equal, instr->environment()); |
+ DeoptimizeIf(not_equal, instr); |
Label slow, allocated, done; |
Register tmp = input_reg.is(eax) ? ecx : eax; |
@@ -3577,7 +3576,7 @@ void LCodeGen::EmitIntegerMathAbs(LMathAbs* instr) { |
Label is_positive; |
__ j(not_sign, &is_positive, Label::kNear); |
__ neg(input_reg); // Sets flags. |
- DeoptimizeIf(negative, instr->environment()); |
+ DeoptimizeIf(negative, instr); |
__ bind(&is_positive); |
} |
@@ -3635,20 +3634,20 @@ void LCodeGen::DoMathFloor(LMathFloor* instr) { |
__ j(not_equal, &non_zero, Label::kNear); |
__ movmskpd(output_reg, input_reg); |
__ test(output_reg, Immediate(1)); |
- DeoptimizeIf(not_zero, instr->environment()); |
+ DeoptimizeIf(not_zero, instr); |
__ bind(&non_zero); |
} |
__ roundsd(xmm_scratch, input_reg, Assembler::kRoundDown); |
__ cvttsd2si(output_reg, Operand(xmm_scratch)); |
// Overflow is signalled with minint. |
__ cmp(output_reg, 0x1); |
- DeoptimizeIf(overflow, instr->environment()); |
+ DeoptimizeIf(overflow, instr); |
} else { |
Label negative_sign, done; |
// Deoptimize on unordered. |
__ xorps(xmm_scratch, xmm_scratch); // Zero the register. |
__ ucomisd(input_reg, xmm_scratch); |
- DeoptimizeIf(parity_even, instr->environment()); |
+ DeoptimizeIf(parity_even, instr); |
__ j(below, &negative_sign, Label::kNear); |
if (instr->hydrogen()->CheckFlag(HValue::kBailoutOnMinusZero)) { |
@@ -3657,7 +3656,7 @@ void LCodeGen::DoMathFloor(LMathFloor* instr) { |
__ j(above, &positive_sign, Label::kNear); |
__ movmskpd(output_reg, input_reg); |
__ test(output_reg, Immediate(1)); |
- DeoptimizeIf(not_zero, instr->environment()); |
+ DeoptimizeIf(not_zero, instr); |
__ Move(output_reg, Immediate(0)); |
__ jmp(&done, Label::kNear); |
__ bind(&positive_sign); |
@@ -3667,7 +3666,7 @@ void LCodeGen::DoMathFloor(LMathFloor* instr) { |
__ cvttsd2si(output_reg, Operand(input_reg)); |
// Overflow is signalled with minint. |
__ cmp(output_reg, 0x1); |
- DeoptimizeIf(overflow, instr->environment()); |
+ DeoptimizeIf(overflow, instr); |
__ jmp(&done, Label::kNear); |
// Non-zero negative reaches here. |
@@ -3678,7 +3677,7 @@ void LCodeGen::DoMathFloor(LMathFloor* instr) { |
__ ucomisd(input_reg, xmm_scratch); |
__ j(equal, &done, Label::kNear); |
__ sub(output_reg, Immediate(1)); |
- DeoptimizeIf(overflow, instr->environment()); |
+ DeoptimizeIf(overflow, instr); |
__ bind(&done); |
} |
@@ -3707,7 +3706,7 @@ void LCodeGen::DoMathRound(LMathRound* instr) { |
// Overflow is signalled with minint. |
__ cmp(output_reg, 0x1); |
__ RecordComment("D2I conversion overflow"); |
- DeoptimizeIf(overflow, instr->environment()); |
+ DeoptimizeIf(overflow, instr); |
__ jmp(&done, dist); |
__ bind(&below_one_half); |
@@ -3723,7 +3722,7 @@ void LCodeGen::DoMathRound(LMathRound* instr) { |
// Catch minint due to overflow, and to prevent overflow when compensating. |
__ cmp(output_reg, 0x1); |
__ RecordComment("D2I conversion overflow"); |
- DeoptimizeIf(overflow, instr->environment()); |
+ DeoptimizeIf(overflow, instr); |
__ Cvtsi2sd(xmm_scratch, output_reg); |
__ ucomisd(xmm_scratch, input_temp); |
@@ -3740,7 +3739,7 @@ void LCodeGen::DoMathRound(LMathRound* instr) { |
__ movmskpd(output_reg, input_reg); |
__ test(output_reg, Immediate(1)); |
__ RecordComment("Minus zero"); |
- DeoptimizeIf(not_zero, instr->environment()); |
+ DeoptimizeIf(not_zero, instr); |
} |
__ Move(output_reg, Immediate(0)); |
__ bind(&done); |
@@ -3816,7 +3815,7 @@ void LCodeGen::DoPower(LPower* instr) { |
__ JumpIfSmi(tagged_exponent, &no_deopt); |
DCHECK(!ecx.is(tagged_exponent)); |
__ CmpObjectType(tagged_exponent, HEAP_NUMBER_TYPE, ecx); |
- DeoptimizeIf(not_equal, instr->environment()); |
+ DeoptimizeIf(not_equal, instr); |
__ bind(&no_deopt); |
MathPowStub stub(isolate(), MathPowStub::TAGGED); |
__ CallStub(&stub); |
@@ -4128,7 +4127,7 @@ void LCodeGen::DoBoundsCheck(LBoundsCheck* instr) { |
__ int3(); |
__ bind(&done); |
} else { |
- DeoptimizeIf(cc, instr->environment()); |
+ DeoptimizeIf(cc, instr); |
} |
} |
@@ -4296,7 +4295,7 @@ void LCodeGen::DoTrapAllocationMemento(LTrapAllocationMemento* instr) { |
Register temp = ToRegister(instr->temp()); |
Label no_memento_found; |
__ TestJSArrayForAllocationMemento(object, temp, &no_memento_found); |
- DeoptimizeIf(equal, instr->environment()); |
+ DeoptimizeIf(equal, instr); |
__ bind(&no_memento_found); |
} |
@@ -4641,12 +4640,12 @@ void LCodeGen::DoSmiTag(LSmiTag* instr) { |
if (hchange->CheckFlag(HValue::kCanOverflow) && |
hchange->value()->CheckFlag(HValue::kUint32)) { |
__ test(input, Immediate(0xc0000000)); |
- DeoptimizeIf(not_zero, instr->environment()); |
+ DeoptimizeIf(not_zero, instr); |
} |
__ SmiTag(input); |
if (hchange->CheckFlag(HValue::kCanOverflow) && |
!hchange->value()->CheckFlag(HValue::kUint32)) { |
- DeoptimizeIf(overflow, instr->environment()); |
+ DeoptimizeIf(overflow, instr); |
} |
} |
@@ -4657,7 +4656,7 @@ void LCodeGen::DoSmiUntag(LSmiUntag* instr) { |
DCHECK(input->IsRegister() && input->Equals(instr->result())); |
if (instr->needs_check()) { |
__ test(result, Immediate(kSmiTagMask)); |
- DeoptimizeIf(not_zero, instr->environment()); |
+ DeoptimizeIf(not_zero, instr); |
} else { |
__ AssertSmi(result); |
} |
@@ -4665,13 +4664,13 @@ void LCodeGen::DoSmiUntag(LSmiUntag* instr) { |
} |
-void LCodeGen::EmitNumberUntagD(Register input_reg, |
- Register temp_reg, |
- XMMRegister result_reg, |
- bool can_convert_undefined_to_nan, |
- bool deoptimize_on_minus_zero, |
- LEnvironment* env, |
+void LCodeGen::EmitNumberUntagD(LNumberUntagD* instr, Register input_reg, |
+ Register temp_reg, XMMRegister result_reg, |
NumberUntagDMode mode) { |
+ bool can_convert_undefined_to_nan = |
+ instr->hydrogen()->can_convert_undefined_to_nan(); |
+ bool deoptimize_on_minus_zero = instr->hydrogen()->deoptimize_on_minus_zero(); |
+ |
Label convert, load_smi, done; |
if (mode == NUMBER_CANDIDATE_IS_ANY_TAGGED) { |
@@ -4684,7 +4683,7 @@ void LCodeGen::EmitNumberUntagD(Register input_reg, |
if (can_convert_undefined_to_nan) { |
__ j(not_equal, &convert, Label::kNear); |
} else { |
- DeoptimizeIf(not_equal, env); |
+ DeoptimizeIf(not_equal, instr); |
} |
// Heap number to XMM conversion. |
@@ -4697,7 +4696,7 @@ void LCodeGen::EmitNumberUntagD(Register input_reg, |
__ j(not_zero, &done, Label::kNear); |
__ movmskpd(temp_reg, result_reg); |
__ test_b(temp_reg, 1); |
- DeoptimizeIf(not_zero, env); |
+ DeoptimizeIf(not_zero, instr); |
} |
__ jmp(&done, Label::kNear); |
@@ -4706,7 +4705,7 @@ void LCodeGen::EmitNumberUntagD(Register input_reg, |
// Convert undefined (and hole) to NaN. |
__ cmp(input_reg, factory()->undefined_value()); |
- DeoptimizeIf(not_equal, env); |
+ DeoptimizeIf(not_equal, instr); |
ExternalReference nan = |
ExternalReference::address_of_canonical_non_hole_nan(); |
@@ -4761,7 +4760,7 @@ void LCodeGen::DoDeferredTaggedToI(LTaggedToI* instr, Label* done) { |
__ bind(&check_false); |
__ cmp(input_reg, factory()->false_value()); |
__ RecordComment("Deferred TaggedToI: cannot truncate"); |
- DeoptimizeIf(not_equal, instr->environment()); |
+ DeoptimizeIf(not_equal, instr); |
__ Move(input_reg, Immediate(0)); |
} else { |
XMMRegister scratch = ToDoubleRegister(instr->temp()); |
@@ -4769,22 +4768,22 @@ void LCodeGen::DoDeferredTaggedToI(LTaggedToI* instr, Label* done) { |
__ cmp(FieldOperand(input_reg, HeapObject::kMapOffset), |
isolate()->factory()->heap_number_map()); |
__ RecordComment("Deferred TaggedToI: not a heap number"); |
- DeoptimizeIf(not_equal, instr->environment()); |
+ DeoptimizeIf(not_equal, instr); |
__ movsd(xmm0, FieldOperand(input_reg, HeapNumber::kValueOffset)); |
__ cvttsd2si(input_reg, Operand(xmm0)); |
__ Cvtsi2sd(scratch, Operand(input_reg)); |
__ ucomisd(xmm0, scratch); |
__ RecordComment("Deferred TaggedToI: lost precision"); |
- DeoptimizeIf(not_equal, instr->environment()); |
+ DeoptimizeIf(not_equal, instr); |
__ RecordComment("Deferred TaggedToI: NaN"); |
- DeoptimizeIf(parity_even, instr->environment()); |
+ DeoptimizeIf(parity_even, instr); |
if (instr->hydrogen()->GetMinusZeroMode() == FAIL_ON_MINUS_ZERO) { |
__ test(input_reg, Operand(input_reg)); |
__ j(not_zero, done); |
__ movmskpd(input_reg, xmm0); |
__ and_(input_reg, 1); |
__ RecordComment("Deferred TaggedToI: minus zero"); |
- DeoptimizeIf(not_zero, instr->environment()); |
+ DeoptimizeIf(not_zero, instr); |
} |
} |
} |
@@ -4834,8 +4833,6 @@ void LCodeGen::DoNumberUntagD(LNumberUntagD* instr) { |
DCHECK(result->IsDoubleRegister()); |
Register input_reg = ToRegister(input); |
- bool deoptimize_on_minus_zero = |
- instr->hydrogen()->deoptimize_on_minus_zero(); |
Register temp_reg = ToRegister(temp); |
HValue* value = instr->hydrogen()->value(); |
@@ -4843,13 +4840,7 @@ void LCodeGen::DoNumberUntagD(LNumberUntagD* instr) { |
? NUMBER_CANDIDATE_IS_SMI : NUMBER_CANDIDATE_IS_ANY_TAGGED; |
XMMRegister result_reg = ToDoubleRegister(result); |
- EmitNumberUntagD(input_reg, |
- temp_reg, |
- result_reg, |
- instr->hydrogen()->can_convert_undefined_to_nan(), |
- deoptimize_on_minus_zero, |
- instr->environment(), |
- mode); |
+ EmitNumberUntagD(instr, input_reg, temp_reg, result_reg, mode); |
} |
@@ -4871,7 +4862,7 @@ void LCodeGen::DoDoubleToI(LDoubleToI* instr) { |
instr->hydrogen()->GetMinusZeroMode(), &bailout, Label::kNear); |
__ jmp(&done, Label::kNear); |
__ bind(&bailout); |
- DeoptimizeIf(no_condition, instr->environment()); |
+ DeoptimizeIf(no_condition, instr); |
__ bind(&done); |
} |
} |
@@ -4891,18 +4882,18 @@ void LCodeGen::DoDoubleToSmi(LDoubleToSmi* instr) { |
instr->hydrogen()->GetMinusZeroMode(), &bailout, Label::kNear); |
__ jmp(&done, Label::kNear); |
__ bind(&bailout); |
- DeoptimizeIf(no_condition, instr->environment()); |
+ DeoptimizeIf(no_condition, instr); |
__ bind(&done); |
__ SmiTag(result_reg); |
- DeoptimizeIf(overflow, instr->environment()); |
+ DeoptimizeIf(overflow, instr); |
} |
void LCodeGen::DoCheckSmi(LCheckSmi* instr) { |
LOperand* input = instr->value(); |
__ test(ToOperand(input), Immediate(kSmiTagMask)); |
- DeoptimizeIf(not_zero, instr->environment()); |
+ DeoptimizeIf(not_zero, instr); |
} |
@@ -4910,7 +4901,7 @@ void LCodeGen::DoCheckNonSmi(LCheckNonSmi* instr) { |
if (!instr->hydrogen()->value()->type().IsHeapObject()) { |
LOperand* input = instr->value(); |
__ test(ToOperand(input), Immediate(kSmiTagMask)); |
- DeoptimizeIf(zero, instr->environment()); |
+ DeoptimizeIf(zero, instr); |
} |
} |
@@ -4931,14 +4922,14 @@ void LCodeGen::DoCheckInstanceType(LCheckInstanceType* instr) { |
// If there is only one type in the interval check for equality. |
if (first == last) { |
- DeoptimizeIf(not_equal, instr->environment()); |
+ DeoptimizeIf(not_equal, instr); |
} else { |
- DeoptimizeIf(below, instr->environment()); |
+ DeoptimizeIf(below, instr); |
// Omit check for the last type. |
if (last != LAST_TYPE) { |
__ cmpb(FieldOperand(temp, Map::kInstanceTypeOffset), |
static_cast<int8_t>(last)); |
- DeoptimizeIf(above, instr->environment()); |
+ DeoptimizeIf(above, instr); |
} |
} |
} else { |
@@ -4949,12 +4940,12 @@ void LCodeGen::DoCheckInstanceType(LCheckInstanceType* instr) { |
if (base::bits::IsPowerOfTwo32(mask)) { |
DCHECK(tag == 0 || base::bits::IsPowerOfTwo32(tag)); |
__ test_b(FieldOperand(temp, Map::kInstanceTypeOffset), mask); |
- DeoptimizeIf(tag == 0 ? not_zero : zero, instr->environment()); |
+ DeoptimizeIf(tag == 0 ? not_zero : zero, instr); |
} else { |
__ movzx_b(temp, FieldOperand(temp, Map::kInstanceTypeOffset)); |
__ and_(temp, mask); |
__ cmp(temp, tag); |
- DeoptimizeIf(not_equal, instr->environment()); |
+ DeoptimizeIf(not_equal, instr); |
} |
} |
} |
@@ -4970,7 +4961,7 @@ void LCodeGen::DoCheckValue(LCheckValue* instr) { |
Operand operand = ToOperand(instr->value()); |
__ cmp(operand, object); |
} |
- DeoptimizeIf(not_equal, instr->environment()); |
+ DeoptimizeIf(not_equal, instr); |
} |
@@ -4985,7 +4976,7 @@ void LCodeGen::DoDeferredInstanceMigration(LCheckMaps* instr, Register object) { |
__ test(eax, Immediate(kSmiTagMask)); |
} |
- DeoptimizeIf(zero, instr->environment()); |
+ DeoptimizeIf(zero, instr); |
} |
@@ -5038,7 +5029,7 @@ void LCodeGen::DoCheckMaps(LCheckMaps* instr) { |
if (instr->hydrogen()->HasMigrationTarget()) { |
__ j(not_equal, deferred->entry()); |
} else { |
- DeoptimizeIf(not_equal, instr->environment()); |
+ DeoptimizeIf(not_equal, instr); |
} |
__ bind(&success); |
@@ -5077,7 +5068,7 @@ void LCodeGen::DoClampTToUint8(LClampTToUint8* instr) { |
// Check for undefined. Undefined is converted to zero for clamping |
// conversions. |
__ cmp(input_reg, factory()->undefined_value()); |
- DeoptimizeIf(not_equal, instr->environment()); |
+ DeoptimizeIf(not_equal, instr); |
__ mov(input_reg, 0); |
__ jmp(&done, Label::kNear); |
@@ -5473,7 +5464,7 @@ void LCodeGen::DoDeoptimize(LDeoptimize* instr) { |
type = Deoptimizer::LAZY; |
} |
Comment(";;; deoptimize: %s", instr->hydrogen()->reason()); |
- DeoptimizeIf(no_condition, instr->environment(), type); |
+ DeoptimizeIf(no_condition, instr, type); |
} |
@@ -5568,17 +5559,17 @@ void LCodeGen::DoOsrEntry(LOsrEntry* instr) { |
void LCodeGen::DoForInPrepareMap(LForInPrepareMap* instr) { |
DCHECK(ToRegister(instr->context()).is(esi)); |
__ cmp(eax, isolate()->factory()->undefined_value()); |
- DeoptimizeIf(equal, instr->environment()); |
+ DeoptimizeIf(equal, instr); |
__ cmp(eax, isolate()->factory()->null_value()); |
- DeoptimizeIf(equal, instr->environment()); |
+ DeoptimizeIf(equal, instr); |
__ test(eax, Immediate(kSmiTagMask)); |
- DeoptimizeIf(zero, instr->environment()); |
+ DeoptimizeIf(zero, instr); |
STATIC_ASSERT(FIRST_JS_PROXY_TYPE == FIRST_SPEC_OBJECT_TYPE); |
__ CmpObjectType(eax, LAST_JS_PROXY_TYPE, ecx); |
- DeoptimizeIf(below_equal, instr->environment()); |
+ DeoptimizeIf(below_equal, instr); |
Label use_cache, call_runtime; |
__ CheckEnumCache(&call_runtime); |
@@ -5593,7 +5584,7 @@ void LCodeGen::DoForInPrepareMap(LForInPrepareMap* instr) { |
__ cmp(FieldOperand(eax, HeapObject::kMapOffset), |
isolate()->factory()->meta_map()); |
- DeoptimizeIf(not_equal, instr->environment()); |
+ DeoptimizeIf(not_equal, instr); |
__ bind(&use_cache); |
} |
@@ -5616,7 +5607,7 @@ void LCodeGen::DoForInCacheArray(LForInCacheArray* instr) { |
FieldOperand(result, FixedArray::SizeFor(instr->idx()))); |
__ bind(&done); |
__ test(result, result); |
- DeoptimizeIf(equal, instr->environment()); |
+ DeoptimizeIf(equal, instr); |
} |
@@ -5624,7 +5615,7 @@ void LCodeGen::DoCheckMapValue(LCheckMapValue* instr) { |
Register object = ToRegister(instr->value()); |
__ cmp(ToRegister(instr->map()), |
FieldOperand(object, HeapObject::kMapOffset)); |
- DeoptimizeIf(not_equal, instr->environment()); |
+ DeoptimizeIf(not_equal, instr); |
} |