Index: src/x87/lithium-codegen-x87.cc |
diff --git a/src/x87/lithium-codegen-x87.cc b/src/x87/lithium-codegen-x87.cc |
index 0dac984bd9adb6523fb317764919a9d715f3c407..c9c8a47593200a01ef005ad6c52bac8e37aa1f6c 100644 |
--- a/src/x87/lithium-codegen-x87.cc |
+++ b/src/x87/lithium-codegen-x87.cc |
@@ -1413,7 +1413,7 @@ |
__ and_(dividend, mask); |
__ neg(dividend); |
if (hmod->CheckFlag(HValue::kBailoutOnMinusZero)) { |
- DeoptimizeIf(zero, instr, Deoptimizer::kMinusZero); |
+ DeoptimizeIf(zero, instr, "minus zero"); |
} |
__ jmp(&done, Label::kNear); |
} |
@@ -1430,7 +1430,7 @@ |
DCHECK(ToRegister(instr->result()).is(eax)); |
if (divisor == 0) { |
- DeoptimizeIf(no_condition, instr, Deoptimizer::kDivisionByZero); |
+ DeoptimizeIf(no_condition, instr, "division by zero"); |
return; |
} |
@@ -1445,7 +1445,7 @@ |
Label remainder_not_zero; |
__ j(not_zero, &remainder_not_zero, Label::kNear); |
__ cmp(dividend, Immediate(0)); |
- DeoptimizeIf(less, instr, Deoptimizer::kMinusZero); |
+ DeoptimizeIf(less, instr, "minus zero"); |
__ bind(&remainder_not_zero); |
} |
} |
@@ -1467,7 +1467,7 @@ |
// 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, Deoptimizer::kDivisionByZero); |
+ DeoptimizeIf(zero, instr, "division by zero"); |
} |
// Check for kMinInt % -1, idiv would signal a divide error. We |
@@ -1478,7 +1478,7 @@ |
__ j(not_equal, &no_overflow_possible, Label::kNear); |
__ cmp(right_reg, -1); |
if (hmod->CheckFlag(HValue::kBailoutOnMinusZero)) { |
- DeoptimizeIf(equal, instr, Deoptimizer::kMinusZero); |
+ DeoptimizeIf(equal, instr, "minus zero"); |
} else { |
__ j(not_equal, &no_overflow_possible, Label::kNear); |
__ Move(result_reg, Immediate(0)); |
@@ -1497,7 +1497,7 @@ |
__ j(not_sign, &positive_left, Label::kNear); |
__ idiv(right_reg); |
__ test(result_reg, Operand(result_reg)); |
- DeoptimizeIf(zero, instr, Deoptimizer::kMinusZero); |
+ DeoptimizeIf(zero, instr, "minus zero"); |
__ jmp(&done, Label::kNear); |
__ bind(&positive_left); |
} |
@@ -1517,19 +1517,19 @@ |
HDiv* hdiv = instr->hydrogen(); |
if (hdiv->CheckFlag(HValue::kBailoutOnMinusZero) && divisor < 0) { |
__ test(dividend, dividend); |
- DeoptimizeIf(zero, instr, Deoptimizer::kMinusZero); |
+ DeoptimizeIf(zero, instr, "minus zero"); |
} |
// Check for (kMinInt / -1). |
if (hdiv->CheckFlag(HValue::kCanOverflow) && divisor == -1) { |
__ cmp(dividend, kMinInt); |
- DeoptimizeIf(zero, instr, Deoptimizer::kOverflow); |
+ DeoptimizeIf(zero, instr, "overflow"); |
} |
// 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, Deoptimizer::kLostPrecision); |
+ DeoptimizeIf(not_zero, instr, "lost precision"); |
} |
__ Move(result, dividend); |
int32_t shift = WhichPowerOf2Abs(divisor); |
@@ -1550,7 +1550,7 @@ |
DCHECK(ToRegister(instr->result()).is(edx)); |
if (divisor == 0) { |
- DeoptimizeIf(no_condition, instr, Deoptimizer::kDivisionByZero); |
+ DeoptimizeIf(no_condition, instr, "division by zero"); |
return; |
} |
@@ -1558,7 +1558,7 @@ |
HDiv* hdiv = instr->hydrogen(); |
if (hdiv->CheckFlag(HValue::kBailoutOnMinusZero) && divisor < 0) { |
__ test(dividend, dividend); |
- DeoptimizeIf(zero, instr, Deoptimizer::kMinusZero); |
+ DeoptimizeIf(zero, instr, "minus zero"); |
} |
__ TruncatingDiv(dividend, Abs(divisor)); |
@@ -1568,7 +1568,7 @@ |
__ mov(eax, edx); |
__ imul(eax, eax, divisor); |
__ sub(eax, dividend); |
- DeoptimizeIf(not_equal, instr, Deoptimizer::kLostPrecision); |
+ DeoptimizeIf(not_equal, instr, "lost precision"); |
} |
} |
@@ -1588,7 +1588,7 @@ |
// Check for x / 0. |
if (hdiv->CheckFlag(HValue::kCanBeDivByZero)) { |
__ test(divisor, divisor); |
- DeoptimizeIf(zero, instr, Deoptimizer::kDivisionByZero); |
+ DeoptimizeIf(zero, instr, "division by zero"); |
} |
// Check for (0 / -x) that will produce negative zero. |
@@ -1597,7 +1597,7 @@ |
__ test(dividend, dividend); |
__ j(not_zero, ÷nd_not_zero, Label::kNear); |
__ test(divisor, divisor); |
- DeoptimizeIf(sign, instr, Deoptimizer::kMinusZero); |
+ DeoptimizeIf(sign, instr, "minus zero"); |
__ bind(÷nd_not_zero); |
} |
@@ -1607,7 +1607,7 @@ |
__ cmp(dividend, kMinInt); |
__ j(not_zero, ÷nd_not_min_int, Label::kNear); |
__ cmp(divisor, -1); |
- DeoptimizeIf(zero, instr, Deoptimizer::kOverflow); |
+ DeoptimizeIf(zero, instr, "overflow"); |
__ bind(÷nd_not_min_int); |
} |
@@ -1618,7 +1618,7 @@ |
if (!hdiv->CheckFlag(HValue::kAllUsesTruncatingToInt32)) { |
// Deoptimize if remainder is not 0. |
__ test(remainder, remainder); |
- DeoptimizeIf(not_zero, instr, Deoptimizer::kLostPrecision); |
+ DeoptimizeIf(not_zero, instr, "lost precision"); |
} |
} |
@@ -1640,13 +1640,13 @@ |
// If the divisor is negative, we have to negate and handle edge cases. |
__ neg(dividend); |
if (instr->hydrogen()->CheckFlag(HValue::kBailoutOnMinusZero)) { |
- DeoptimizeIf(zero, instr, Deoptimizer::kMinusZero); |
+ DeoptimizeIf(zero, instr, "minus zero"); |
} |
// Dividing by -1 is basically negation, unless we overflow. |
if (divisor == -1) { |
if (instr->hydrogen()->CheckFlag(HValue::kLeftCanBeMinInt)) { |
- DeoptimizeIf(overflow, instr, Deoptimizer::kOverflow); |
+ DeoptimizeIf(overflow, instr, "overflow"); |
} |
return; |
} |
@@ -1673,7 +1673,7 @@ |
DCHECK(ToRegister(instr->result()).is(edx)); |
if (divisor == 0) { |
- DeoptimizeIf(no_condition, instr, Deoptimizer::kDivisionByZero); |
+ DeoptimizeIf(no_condition, instr, "division by zero"); |
return; |
} |
@@ -1681,7 +1681,7 @@ |
HMathFloorOfDiv* hdiv = instr->hydrogen(); |
if (hdiv->CheckFlag(HValue::kBailoutOnMinusZero) && divisor < 0) { |
__ test(dividend, dividend); |
- DeoptimizeIf(zero, instr, Deoptimizer::kMinusZero); |
+ DeoptimizeIf(zero, instr, "minus zero"); |
} |
// Easy case: We need no dynamic check for the dividend and the flooring |
@@ -1728,7 +1728,7 @@ |
// Check for x / 0. |
if (hdiv->CheckFlag(HValue::kCanBeDivByZero)) { |
__ test(divisor, divisor); |
- DeoptimizeIf(zero, instr, Deoptimizer::kDivisionByZero); |
+ DeoptimizeIf(zero, instr, "division by zero"); |
} |
// Check for (0 / -x) that will produce negative zero. |
@@ -1737,7 +1737,7 @@ |
__ test(dividend, dividend); |
__ j(not_zero, ÷nd_not_zero, Label::kNear); |
__ test(divisor, divisor); |
- DeoptimizeIf(sign, instr, Deoptimizer::kMinusZero); |
+ DeoptimizeIf(sign, instr, "minus zero"); |
__ bind(÷nd_not_zero); |
} |
@@ -1747,7 +1747,7 @@ |
__ cmp(dividend, kMinInt); |
__ j(not_zero, ÷nd_not_min_int, Label::kNear); |
__ cmp(divisor, -1); |
- DeoptimizeIf(zero, instr, Deoptimizer::kOverflow); |
+ DeoptimizeIf(zero, instr, "overflow"); |
__ bind(÷nd_not_min_int); |
} |
@@ -1825,7 +1825,7 @@ |
} |
if (instr->hydrogen()->CheckFlag(HValue::kCanOverflow)) { |
- DeoptimizeIf(overflow, instr, Deoptimizer::kOverflow); |
+ DeoptimizeIf(overflow, instr, "overflow"); |
} |
if (instr->hydrogen()->CheckFlag(HValue::kBailoutOnMinusZero)) { |
@@ -1835,15 +1835,15 @@ |
__ j(not_zero, &done); |
if (right->IsConstantOperand()) { |
if (ToInteger32(LConstantOperand::cast(right)) < 0) { |
- DeoptimizeIf(no_condition, instr, Deoptimizer::kMinusZero); |
+ DeoptimizeIf(no_condition, instr, "minus zero"); |
} else if (ToInteger32(LConstantOperand::cast(right)) == 0) { |
__ cmp(ToRegister(instr->temp()), Immediate(0)); |
- DeoptimizeIf(less, instr, Deoptimizer::kMinusZero); |
+ DeoptimizeIf(less, instr, "minus zero"); |
} |
} else { |
// Test the non-zero operand for negative sign. |
__ or_(ToRegister(instr->temp()), ToOperand(right)); |
- DeoptimizeIf(sign, instr, Deoptimizer::kMinusZero); |
+ DeoptimizeIf(sign, instr, "minus zero"); |
} |
__ bind(&done); |
} |
@@ -1916,7 +1916,7 @@ |
__ shr_cl(ToRegister(left)); |
if (instr->can_deopt()) { |
__ test(ToRegister(left), ToRegister(left)); |
- DeoptimizeIf(sign, instr, Deoptimizer::kNegativeValue); |
+ DeoptimizeIf(sign, instr, "negative value"); |
} |
break; |
case Token::SHL: |
@@ -1933,7 +1933,7 @@ |
case Token::ROR: |
if (shift_count == 0 && instr->can_deopt()) { |
__ test(ToRegister(left), ToRegister(left)); |
- DeoptimizeIf(sign, instr, Deoptimizer::kNegativeValue); |
+ DeoptimizeIf(sign, instr, "negative value"); |
} else { |
__ ror(ToRegister(left), shift_count); |
} |
@@ -1948,7 +1948,7 @@ |
__ shr(ToRegister(left), shift_count); |
} else if (instr->can_deopt()) { |
__ test(ToRegister(left), ToRegister(left)); |
- DeoptimizeIf(sign, instr, Deoptimizer::kNegativeValue); |
+ DeoptimizeIf(sign, instr, "negative value"); |
} |
break; |
case Token::SHL: |
@@ -1959,7 +1959,7 @@ |
__ shl(ToRegister(left), shift_count - 1); |
} |
__ SmiTag(ToRegister(left)); |
- DeoptimizeIf(overflow, instr, Deoptimizer::kOverflow); |
+ DeoptimizeIf(overflow, instr, "overflow"); |
} else { |
__ shl(ToRegister(left), shift_count); |
} |
@@ -1985,7 +1985,7 @@ |
__ sub(ToRegister(left), ToOperand(right)); |
} |
if (instr->hydrogen()->CheckFlag(HValue::kCanOverflow)) { |
- DeoptimizeIf(overflow, instr, Deoptimizer::kOverflow); |
+ DeoptimizeIf(overflow, instr, "overflow"); |
} |
} |
@@ -2045,9 +2045,9 @@ |
DCHECK(object.is(eax)); |
__ test(object, Immediate(kSmiTagMask)); |
- DeoptimizeIf(zero, instr, Deoptimizer::kSmi); |
+ DeoptimizeIf(zero, instr, "Smi"); |
__ CmpObjectType(object, JS_DATE_TYPE, scratch); |
- DeoptimizeIf(not_equal, instr, Deoptimizer::kNotADateObject); |
+ DeoptimizeIf(not_equal, instr, "not a date object"); |
if (index->value() == 0) { |
__ mov(result, FieldOperand(object, JSDate::kValueOffset)); |
@@ -2177,7 +2177,7 @@ |
__ add(ToRegister(left), ToOperand(right)); |
} |
if (instr->hydrogen()->CheckFlag(HValue::kCanOverflow)) { |
- DeoptimizeIf(overflow, instr, Deoptimizer::kOverflow); |
+ DeoptimizeIf(overflow, instr, "overflow"); |
} |
} |
} |
@@ -2420,7 +2420,7 @@ |
} else if (expected.NeedsMap()) { |
// If we need a map later and have a Smi -> deopt. |
__ test(reg, Immediate(kSmiTagMask)); |
- DeoptimizeIf(zero, instr, Deoptimizer::kSmi); |
+ DeoptimizeIf(zero, instr, "Smi"); |
} |
Register map = no_reg; // Keep the compiler happy. |
@@ -2477,7 +2477,7 @@ |
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, Deoptimizer::kUnexpectedObject); |
+ DeoptimizeIf(no_condition, instr, "unexpected object"); |
} |
} |
} |
@@ -3117,7 +3117,7 @@ |
__ mov(result, Operand::ForCell(instr->hydrogen()->cell().handle())); |
if (instr->hydrogen()->RequiresHoleCheck()) { |
__ cmp(result, factory()->the_hole_value()); |
- DeoptimizeIf(equal, instr, Deoptimizer::kHole); |
+ DeoptimizeIf(equal, instr, "hole"); |
} |
} |
@@ -3166,7 +3166,7 @@ |
// 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, Deoptimizer::kHole); |
+ DeoptimizeIf(equal, instr, "hole"); |
} |
// Store the value. |
@@ -3183,7 +3183,7 @@ |
if (instr->hydrogen()->RequiresHoleCheck()) { |
__ cmp(result, factory()->the_hole_value()); |
if (instr->hydrogen()->DeoptimizesOnHole()) { |
- DeoptimizeIf(equal, instr, Deoptimizer::kHole); |
+ DeoptimizeIf(equal, instr, "hole"); |
} else { |
Label is_not_hole; |
__ j(not_equal, &is_not_hole, Label::kNear); |
@@ -3204,7 +3204,7 @@ |
if (instr->hydrogen()->RequiresHoleCheck()) { |
__ cmp(target, factory()->the_hole_value()); |
if (instr->hydrogen()->DeoptimizesOnHole()) { |
- DeoptimizeIf(equal, instr, Deoptimizer::kHole); |
+ DeoptimizeIf(equal, instr, "hole"); |
} else { |
__ j(not_equal, &skip_assignment, Label::kNear); |
} |
@@ -3298,7 +3298,7 @@ |
// Check that the function has a prototype or an initial map. |
__ cmp(Operand(result), Immediate(factory()->the_hole_value())); |
- DeoptimizeIf(equal, instr, Deoptimizer::kHole); |
+ DeoptimizeIf(equal, instr, "hole"); |
// If the function does not have an initial map, we're done. |
Label done; |
@@ -3389,7 +3389,7 @@ |
__ mov(result, operand); |
if (!instr->hydrogen()->CheckFlag(HInstruction::kUint32)) { |
__ test(result, Operand(result)); |
- DeoptimizeIf(negative, instr, Deoptimizer::kNegativeValue); |
+ DeoptimizeIf(negative, instr, "negative value"); |
} |
break; |
case EXTERNAL_FLOAT32_ELEMENTS: |
@@ -3419,7 +3419,7 @@ |
FAST_DOUBLE_ELEMENTS, |
instr->base_offset() + sizeof(kHoleNanLower32)); |
__ cmp(hole_check_operand, Immediate(kHoleNanUpper32)); |
- DeoptimizeIf(equal, instr, Deoptimizer::kHole); |
+ DeoptimizeIf(equal, instr, "hole"); |
} |
Operand double_load_operand = BuildFastArrayOperand( |
@@ -3445,10 +3445,10 @@ |
if (instr->hydrogen()->RequiresHoleCheck()) { |
if (IsFastSmiElementsKind(instr->hydrogen()->elements_kind())) { |
__ test(result, Immediate(kSmiTagMask)); |
- DeoptimizeIf(not_equal, instr, Deoptimizer::kNotASmi); |
+ DeoptimizeIf(not_equal, instr, "not a Smi"); |
} else { |
__ cmp(result, factory()->the_hole_value()); |
- DeoptimizeIf(equal, instr, Deoptimizer::kHole); |
+ DeoptimizeIf(equal, instr, "hole"); |
} |
} |
} |
@@ -3595,9 +3595,9 @@ |
// The receiver should be a JS object. |
__ test(receiver, Immediate(kSmiTagMask)); |
- DeoptimizeIf(equal, instr, Deoptimizer::kSmi); |
+ DeoptimizeIf(equal, instr, "Smi"); |
__ CmpObjectType(receiver, FIRST_SPEC_OBJECT_TYPE, scratch); |
- DeoptimizeIf(below, instr, Deoptimizer::kNotAJavaScriptObject); |
+ DeoptimizeIf(below, instr, "not a JavaScript object"); |
__ jmp(&receiver_ok, Label::kNear); |
__ bind(&global_object); |
@@ -3623,7 +3623,7 @@ |
// adaptor frame below it. |
const uint32_t kArgumentsLimit = 1 * KB; |
__ cmp(length, kArgumentsLimit); |
- DeoptimizeIf(above, instr, Deoptimizer::kTooManyArguments); |
+ DeoptimizeIf(above, instr, "too many arguments"); |
__ push(receiver); |
__ mov(receiver, length); |
@@ -3848,7 +3848,7 @@ |
Register input_reg = ToRegister(instr->value()); |
__ cmp(FieldOperand(input_reg, HeapObject::kMapOffset), |
factory()->heap_number_map()); |
- DeoptimizeIf(not_equal, instr, Deoptimizer::kNotAHeapNumber); |
+ DeoptimizeIf(not_equal, instr, "not a heap number"); |
Label slow, allocated, done; |
Register tmp = input_reg.is(eax) ? ecx : eax; |
@@ -3895,7 +3895,7 @@ |
Label is_positive; |
__ j(not_sign, &is_positive, Label::kNear); |
__ neg(input_reg); // Sets flags. |
- DeoptimizeIf(negative, instr, Deoptimizer::kOverflow); |
+ DeoptimizeIf(negative, instr, "overflow"); |
__ bind(&is_positive); |
} |
@@ -3948,7 +3948,7 @@ |
__ fldz(); |
__ fld(1); |
__ FCmp(); |
- DeoptimizeIf(parity_even, instr, Deoptimizer::kNaN); |
+ DeoptimizeIf(parity_even, instr, "NaN"); |
__ j(below, ¬_minus_zero, Label::kNear); |
if (instr->hydrogen()->CheckFlag(HValue::kBailoutOnMinusZero)) { |
@@ -3957,7 +3957,7 @@ |
// +- 0.0. |
__ fld(0); |
__ FXamSign(); |
- DeoptimizeIf(not_zero, instr, Deoptimizer::kMinusZero); |
+ DeoptimizeIf(not_zero, instr, "minus zero"); |
__ Move(output_reg, Immediate(0)); |
__ jmp(&done, Label::kFar); |
} |
@@ -3971,7 +3971,7 @@ |
__ fist_s(Operand(esp, 0)); |
__ pop(output_reg); |
__ X87CheckIA(); |
- DeoptimizeIf(equal, instr, Deoptimizer::kOverflow); |
+ DeoptimizeIf(equal, instr, "overflow"); |
__ fnclex(); |
__ X87SetRC(0x0000); |
__ bind(&done); |
@@ -4005,7 +4005,7 @@ |
// Check overflow. |
__ X87CheckIA(); |
__ pop(result); |
- DeoptimizeIf(equal, instr, Deoptimizer::kConversionOverflow); |
+ DeoptimizeIf(equal, instr, "conversion overflow"); |
__ fnclex(); |
// Restore round mode. |
__ X87SetRC(0x0000); |
@@ -4022,7 +4022,7 @@ |
// If the sign is positive, we return +0. |
__ fld(0); |
__ FXamSign(); |
- DeoptimizeIf(not_zero, instr, Deoptimizer::kMinusZero); |
+ DeoptimizeIf(not_zero, instr, "minus zero"); |
} |
__ Move(result, Immediate(0)); |
__ jmp(&done); |
@@ -4039,7 +4039,7 @@ |
// Check overflow. |
__ X87CheckIA(); |
__ pop(result); |
- DeoptimizeIf(equal, instr, Deoptimizer::kConversionOverflow); |
+ DeoptimizeIf(equal, instr, "conversion overflow"); |
__ fnclex(); |
// Restore round mode. |
__ X87SetRC(0x0000); |
@@ -4171,7 +4171,7 @@ |
X87LoadForUsage(base); |
__ JumpIfSmi(exponent, &no_deopt); |
__ CmpObjectType(exponent, HEAP_NUMBER_TYPE, temp); |
- DeoptimizeIf(not_equal, instr, Deoptimizer::kNotAHeapNumber); |
+ DeoptimizeIf(not_equal, instr, "not a heap number"); |
// Heap number(double) |
__ fld_d(FieldOperand(exponent, HeapNumber::kValueOffset)); |
__ jmp(&done); |
@@ -4572,7 +4572,7 @@ |
__ int3(); |
__ bind(&done); |
} else { |
- DeoptimizeIf(cc, instr, Deoptimizer::kOutOfBounds); |
+ DeoptimizeIf(cc, instr, "out of bounds"); |
} |
} |
@@ -4765,7 +4765,7 @@ |
Register temp = ToRegister(instr->temp()); |
Label no_memento_found; |
__ TestJSArrayForAllocationMemento(object, temp, &no_memento_found); |
- DeoptimizeIf(equal, instr, Deoptimizer::kMementoFound); |
+ DeoptimizeIf(equal, instr, "memento found"); |
__ bind(&no_memento_found); |
} |
@@ -5137,12 +5137,12 @@ |
if (hchange->CheckFlag(HValue::kCanOverflow) && |
hchange->value()->CheckFlag(HValue::kUint32)) { |
__ test(input, Immediate(0xc0000000)); |
- DeoptimizeIf(not_zero, instr, Deoptimizer::kOverflow); |
+ DeoptimizeIf(not_zero, instr, "overflow"); |
} |
__ SmiTag(input); |
if (hchange->CheckFlag(HValue::kCanOverflow) && |
!hchange->value()->CheckFlag(HValue::kUint32)) { |
- DeoptimizeIf(overflow, instr, Deoptimizer::kOverflow); |
+ DeoptimizeIf(overflow, instr, "overflow"); |
} |
} |
@@ -5153,7 +5153,7 @@ |
DCHECK(input->IsRegister() && input->Equals(instr->result())); |
if (instr->needs_check()) { |
__ test(result, Immediate(kSmiTagMask)); |
- DeoptimizeIf(not_zero, instr, Deoptimizer::kNotASmi); |
+ DeoptimizeIf(not_zero, instr, "not a Smi"); |
} else { |
__ AssertSmi(result); |
} |
@@ -5179,14 +5179,14 @@ |
__ cmp(FieldOperand(input_reg, HeapObject::kMapOffset), |
factory()->heap_number_map()); |
if (!can_convert_undefined_to_nan) { |
- DeoptimizeIf(not_equal, instr, Deoptimizer::kNotAHeapNumber); |
+ DeoptimizeIf(not_equal, instr, "not a heap number"); |
} else { |
Label heap_number, convert; |
__ j(equal, &heap_number); |
// Convert undefined (or hole) to NaN. |
__ cmp(input_reg, factory()->undefined_value()); |
- DeoptimizeIf(not_equal, instr, Deoptimizer::kNotAHeapNumberUndefined); |
+ DeoptimizeIf(not_equal, instr, "not a heap number/undefined"); |
__ bind(&convert); |
ExternalReference nan = |
@@ -5211,7 +5211,7 @@ |
// Pop FPU stack before deoptimizing. |
__ fstp(0); |
- DeoptimizeIf(not_zero, instr, Deoptimizer::kMinusZero); |
+ DeoptimizeIf(not_zero, instr, "minus zero"); |
} |
__ jmp(&done, Label::kNear); |
} else { |
@@ -5264,15 +5264,14 @@ |
__ bind(&check_false); |
__ cmp(input_reg, factory()->false_value()); |
- DeoptimizeIf(not_equal, instr, |
- Deoptimizer::kNotAHeapNumberUndefinedTrueFalse); |
+ DeoptimizeIf(not_equal, instr, "not a heap number/undefined/true/false"); |
__ Move(input_reg, Immediate(0)); |
} else { |
// TODO(olivf) Converting a number on the fpu is actually quite slow. We |
// should first try a fast conversion and then bailout to this slow case. |
__ cmp(FieldOperand(input_reg, HeapObject::kMapOffset), |
isolate()->factory()->heap_number_map()); |
- DeoptimizeIf(not_equal, instr, Deoptimizer::kNotAHeapNumber); |
+ DeoptimizeIf(not_equal, instr, "not a heap number"); |
__ sub(esp, Immediate(kPointerSize)); |
__ fld_d(FieldOperand(input_reg, HeapNumber::kValueOffset)); |
@@ -5288,12 +5287,12 @@ |
__ j(equal, &no_precision_lost, Label::kNear); |
__ fstp(0); |
- DeoptimizeIf(no_condition, instr, Deoptimizer::kLostPrecision); |
+ DeoptimizeIf(no_condition, instr, "lost precision"); |
__ bind(&no_precision_lost); |
__ j(parity_odd, ¬_nan); |
__ fstp(0); |
- DeoptimizeIf(no_condition, instr, Deoptimizer::kNaN); |
+ DeoptimizeIf(no_condition, instr, "NaN"); |
__ bind(¬_nan); |
__ test(input_reg, Operand(input_reg)); |
@@ -5308,14 +5307,14 @@ |
__ fstp_s(Operand(esp, 0)); |
__ pop(input_reg); |
__ test(input_reg, Operand(input_reg)); |
- DeoptimizeIf(not_zero, instr, Deoptimizer::kMinusZero); |
+ DeoptimizeIf(not_zero, instr, "minus zero"); |
} else { |
__ fist_s(MemOperand(esp, 0)); |
__ fild_s(MemOperand(esp, 0)); |
__ FCmp(); |
__ pop(input_reg); |
- DeoptimizeIf(not_equal, instr, Deoptimizer::kLostPrecision); |
- DeoptimizeIf(parity_even, instr, Deoptimizer::kNaN); |
+ DeoptimizeIf(not_equal, instr, "lost precision"); |
+ DeoptimizeIf(parity_even, instr, "NaN"); |
} |
} |
} |
@@ -5396,11 +5395,11 @@ |
&lost_precision, &is_nan, &minus_zero); |
__ jmp(&done); |
__ bind(&lost_precision); |
- DeoptimizeIf(no_condition, instr, Deoptimizer::kLostPrecision); |
+ DeoptimizeIf(no_condition, instr, "lost precision"); |
__ bind(&is_nan); |
- DeoptimizeIf(no_condition, instr, Deoptimizer::kNaN); |
+ DeoptimizeIf(no_condition, instr, "NaN"); |
__ bind(&minus_zero); |
- DeoptimizeIf(no_condition, instr, Deoptimizer::kMinusZero); |
+ DeoptimizeIf(no_condition, instr, "minus zero"); |
__ bind(&done); |
} |
} |
@@ -5420,21 +5419,21 @@ |
&lost_precision, &is_nan, &minus_zero); |
__ jmp(&done); |
__ bind(&lost_precision); |
- DeoptimizeIf(no_condition, instr, Deoptimizer::kLostPrecision); |
+ DeoptimizeIf(no_condition, instr, "lost precision"); |
__ bind(&is_nan); |
- DeoptimizeIf(no_condition, instr, Deoptimizer::kNaN); |
+ DeoptimizeIf(no_condition, instr, "NaN"); |
__ bind(&minus_zero); |
- DeoptimizeIf(no_condition, instr, Deoptimizer::kMinusZero); |
+ DeoptimizeIf(no_condition, instr, "minus zero"); |
__ bind(&done); |
__ SmiTag(result_reg); |
- DeoptimizeIf(overflow, instr, Deoptimizer::kOverflow); |
+ DeoptimizeIf(overflow, instr, "overflow"); |
} |
void LCodeGen::DoCheckSmi(LCheckSmi* instr) { |
LOperand* input = instr->value(); |
__ test(ToOperand(input), Immediate(kSmiTagMask)); |
- DeoptimizeIf(not_zero, instr, Deoptimizer::kNotASmi); |
+ DeoptimizeIf(not_zero, instr, "not a Smi"); |
} |
@@ -5442,7 +5441,7 @@ |
if (!instr->hydrogen()->value()->type().IsHeapObject()) { |
LOperand* input = instr->value(); |
__ test(ToOperand(input), Immediate(kSmiTagMask)); |
- DeoptimizeIf(zero, instr, Deoptimizer::kSmi); |
+ DeoptimizeIf(zero, instr, "Smi"); |
} |
} |
@@ -5463,14 +5462,14 @@ |
// If there is only one type in the interval check for equality. |
if (first == last) { |
- DeoptimizeIf(not_equal, instr, Deoptimizer::kWrongInstanceType); |
+ DeoptimizeIf(not_equal, instr, "wrong instance type"); |
} else { |
- DeoptimizeIf(below, instr, Deoptimizer::kWrongInstanceType); |
+ DeoptimizeIf(below, instr, "wrong instance type"); |
// Omit check for the last type. |
if (last != LAST_TYPE) { |
__ cmpb(FieldOperand(temp, Map::kInstanceTypeOffset), |
static_cast<int8_t>(last)); |
- DeoptimizeIf(above, instr, Deoptimizer::kWrongInstanceType); |
+ DeoptimizeIf(above, instr, "wrong instance type"); |
} |
} |
} else { |
@@ -5481,13 +5480,12 @@ |
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, |
- Deoptimizer::kWrongInstanceType); |
+ DeoptimizeIf(tag == 0 ? not_zero : zero, instr, "wrong instance type"); |
} else { |
__ movzx_b(temp, FieldOperand(temp, Map::kInstanceTypeOffset)); |
__ and_(temp, mask); |
__ cmp(temp, tag); |
- DeoptimizeIf(not_equal, instr, Deoptimizer::kWrongInstanceType); |
+ DeoptimizeIf(not_equal, instr, "wrong instance type"); |
} |
} |
} |
@@ -5503,7 +5501,7 @@ |
Operand operand = ToOperand(instr->value()); |
__ cmp(operand, object); |
} |
- DeoptimizeIf(not_equal, instr, Deoptimizer::kValueMismatch); |
+ DeoptimizeIf(not_equal, instr, "value mismatch"); |
} |
@@ -5518,7 +5516,7 @@ |
__ test(eax, Immediate(kSmiTagMask)); |
} |
- DeoptimizeIf(zero, instr, Deoptimizer::kInstanceMigrationFailed); |
+ DeoptimizeIf(zero, instr, "instance migration failed"); |
} |
@@ -5575,7 +5573,7 @@ |
if (instr->hydrogen()->HasMigrationTarget()) { |
__ j(not_equal, deferred->entry()); |
} else { |
- DeoptimizeIf(not_equal, instr, Deoptimizer::kWrongMap); |
+ DeoptimizeIf(not_equal, instr, "wrong map"); |
} |
__ bind(&success); |
@@ -5616,7 +5614,7 @@ |
// Check for undefined. Undefined is converted to zero for clamping |
// conversions. |
__ cmp(input_reg, factory()->undefined_value()); |
- DeoptimizeIf(not_equal, instr, Deoptimizer::kNotAHeapNumberUndefined); |
+ DeoptimizeIf(not_equal, instr, "not a heap number/undefined"); |
__ jmp(&zero_result, Label::kNear); |
// Heap number |
@@ -6187,17 +6185,17 @@ |
void LCodeGen::DoForInPrepareMap(LForInPrepareMap* instr) { |
DCHECK(ToRegister(instr->context()).is(esi)); |
__ cmp(eax, isolate()->factory()->undefined_value()); |
- DeoptimizeIf(equal, instr, Deoptimizer::kUndefined); |
+ DeoptimizeIf(equal, instr, "undefined"); |
__ cmp(eax, isolate()->factory()->null_value()); |
- DeoptimizeIf(equal, instr, Deoptimizer::kNull); |
+ DeoptimizeIf(equal, instr, "null"); |
__ test(eax, Immediate(kSmiTagMask)); |
- DeoptimizeIf(zero, instr, Deoptimizer::kSmi); |
+ DeoptimizeIf(zero, instr, "Smi"); |
STATIC_ASSERT(FIRST_JS_PROXY_TYPE == FIRST_SPEC_OBJECT_TYPE); |
__ CmpObjectType(eax, LAST_JS_PROXY_TYPE, ecx); |
- DeoptimizeIf(below_equal, instr, Deoptimizer::kWrongInstanceType); |
+ DeoptimizeIf(below_equal, instr, "wrong instance type"); |
Label use_cache, call_runtime; |
__ CheckEnumCache(&call_runtime); |
@@ -6212,7 +6210,7 @@ |
__ cmp(FieldOperand(eax, HeapObject::kMapOffset), |
isolate()->factory()->meta_map()); |
- DeoptimizeIf(not_equal, instr, Deoptimizer::kWrongMap); |
+ DeoptimizeIf(not_equal, instr, "wrong map"); |
__ bind(&use_cache); |
} |
@@ -6235,7 +6233,7 @@ |
FieldOperand(result, FixedArray::SizeFor(instr->idx()))); |
__ bind(&done); |
__ test(result, result); |
- DeoptimizeIf(equal, instr, Deoptimizer::kNoCache); |
+ DeoptimizeIf(equal, instr, "no cache"); |
} |
@@ -6243,7 +6241,7 @@ |
Register object = ToRegister(instr->value()); |
__ cmp(ToRegister(instr->map()), |
FieldOperand(object, HeapObject::kMapOffset)); |
- DeoptimizeIf(not_equal, instr, Deoptimizer::kWrongMap); |
+ DeoptimizeIf(not_equal, instr, "wrong map"); |
} |