| Index: src/x64/lithium-codegen-x64.cc
|
| diff --git a/src/x64/lithium-codegen-x64.cc b/src/x64/lithium-codegen-x64.cc
|
| index 335e0906873da70bbf41566f602906f05b717337..9f1c396abf77240ab777cbd19fcba4889c81497a 100644
|
| --- a/src/x64/lithium-codegen-x64.cc
|
| +++ b/src/x64/lithium-codegen-x64.cc
|
| @@ -729,9 +729,9 @@ void LCodeGen::RegisterEnvironmentForDeoptimization(LEnvironment* environment,
|
| }
|
|
|
|
|
| -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();
|
| @@ -801,12 +801,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);
|
| }
|
|
|
|
|
| @@ -1037,7 +1036,7 @@ void LCodeGen::DoModByPowerOf2I(LModByPowerOf2I* instr) {
|
| __ andl(dividend, Immediate(mask));
|
| __ negl(dividend);
|
| if (hmod->CheckFlag(HValue::kBailoutOnMinusZero)) {
|
| - DeoptimizeIf(zero, instr->environment());
|
| + DeoptimizeIf(zero, instr);
|
| }
|
| __ jmp(&done, Label::kNear);
|
| }
|
| @@ -1054,7 +1053,7 @@ void LCodeGen::DoModByConstI(LModByConstI* instr) {
|
| DCHECK(ToRegister(instr->result()).is(rax));
|
|
|
| if (divisor == 0) {
|
| - DeoptimizeIf(no_condition, instr->environment());
|
| + DeoptimizeIf(no_condition, instr);
|
| return;
|
| }
|
|
|
| @@ -1069,7 +1068,7 @@ void LCodeGen::DoModByConstI(LModByConstI* instr) {
|
| Label remainder_not_zero;
|
| __ j(not_zero, &remainder_not_zero, Label::kNear);
|
| __ cmpl(dividend, Immediate(0));
|
| - DeoptimizeIf(less, instr->environment());
|
| + DeoptimizeIf(less, instr);
|
| __ bind(&remainder_not_zero);
|
| }
|
| }
|
| @@ -1091,7 +1090,7 @@ void LCodeGen::DoModI(LModI* instr) {
|
| // deopt in this case because we can't return a NaN.
|
| if (hmod->CheckFlag(HValue::kCanBeDivByZero)) {
|
| __ testl(right_reg, right_reg);
|
| - DeoptimizeIf(zero, instr->environment());
|
| + DeoptimizeIf(zero, instr);
|
| }
|
|
|
| // Check for kMinInt % -1, idiv would signal a divide error. We
|
| @@ -1102,7 +1101,7 @@ void LCodeGen::DoModI(LModI* instr) {
|
| __ j(not_zero, &no_overflow_possible, Label::kNear);
|
| __ cmpl(right_reg, Immediate(-1));
|
| if (hmod->CheckFlag(HValue::kBailoutOnMinusZero)) {
|
| - DeoptimizeIf(equal, instr->environment());
|
| + DeoptimizeIf(equal, instr);
|
| } else {
|
| __ j(not_equal, &no_overflow_possible, Label::kNear);
|
| __ Set(result_reg, 0);
|
| @@ -1122,7 +1121,7 @@ void LCodeGen::DoModI(LModI* instr) {
|
| __ j(not_sign, &positive_left, Label::kNear);
|
| __ idivl(right_reg);
|
| __ testl(result_reg, result_reg);
|
| - DeoptimizeIf(zero, instr->environment());
|
| + DeoptimizeIf(zero, instr);
|
| __ jmp(&done, Label::kNear);
|
| __ bind(&positive_left);
|
| }
|
| @@ -1148,13 +1147,13 @@ void LCodeGen::DoFlooringDivByPowerOf2I(LFlooringDivByPowerOf2I* instr) {
|
| // If the divisor is negative, we have to negate and handle edge cases.
|
| __ negl(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;
|
| }
|
| @@ -1181,7 +1180,7 @@ void LCodeGen::DoFlooringDivByConstI(LFlooringDivByConstI* instr) {
|
| DCHECK(ToRegister(instr->result()).is(rdx));
|
|
|
| if (divisor == 0) {
|
| - DeoptimizeIf(no_condition, instr->environment());
|
| + DeoptimizeIf(no_condition, instr);
|
| return;
|
| }
|
|
|
| @@ -1189,7 +1188,7 @@ void LCodeGen::DoFlooringDivByConstI(LFlooringDivByConstI* instr) {
|
| HMathFloorOfDiv* hdiv = instr->hydrogen();
|
| if (hdiv->CheckFlag(HValue::kBailoutOnMinusZero) && divisor < 0) {
|
| __ testl(dividend, dividend);
|
| - DeoptimizeIf(zero, instr->environment());
|
| + DeoptimizeIf(zero, instr);
|
| }
|
|
|
| // Easy case: We need no dynamic check for the dividend and the flooring
|
| @@ -1236,7 +1235,7 @@ void LCodeGen::DoFlooringDivI(LFlooringDivI* instr) {
|
| // Check for x / 0.
|
| if (hdiv->CheckFlag(HValue::kCanBeDivByZero)) {
|
| __ testl(divisor, divisor);
|
| - DeoptimizeIf(zero, instr->environment());
|
| + DeoptimizeIf(zero, instr);
|
| }
|
|
|
| // Check for (0 / -x) that will produce negative zero.
|
| @@ -1245,7 +1244,7 @@ void LCodeGen::DoFlooringDivI(LFlooringDivI* instr) {
|
| __ testl(dividend, dividend);
|
| __ j(not_zero, ÷nd_not_zero, Label::kNear);
|
| __ testl(divisor, divisor);
|
| - DeoptimizeIf(sign, instr->environment());
|
| + DeoptimizeIf(sign, instr);
|
| __ bind(÷nd_not_zero);
|
| }
|
|
|
| @@ -1255,7 +1254,7 @@ void LCodeGen::DoFlooringDivI(LFlooringDivI* instr) {
|
| __ cmpl(dividend, Immediate(kMinInt));
|
| __ j(not_zero, ÷nd_not_min_int, Label::kNear);
|
| __ cmpl(divisor, Immediate(-1));
|
| - DeoptimizeIf(zero, instr->environment());
|
| + DeoptimizeIf(zero, instr);
|
| __ bind(÷nd_not_min_int);
|
| }
|
|
|
| @@ -1284,19 +1283,19 @@ void LCodeGen::DoDivByPowerOf2I(LDivByPowerOf2I* instr) {
|
| HDiv* hdiv = instr->hydrogen();
|
| if (hdiv->CheckFlag(HValue::kBailoutOnMinusZero) && divisor < 0) {
|
| __ testl(dividend, dividend);
|
| - DeoptimizeIf(zero, instr->environment());
|
| + DeoptimizeIf(zero, instr);
|
| }
|
| // Check for (kMinInt / -1).
|
| if (hdiv->CheckFlag(HValue::kCanOverflow) && divisor == -1) {
|
| __ cmpl(dividend, Immediate(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);
|
| __ testl(dividend, Immediate(mask));
|
| - DeoptimizeIf(not_zero, instr->environment());
|
| + DeoptimizeIf(not_zero, instr);
|
| }
|
| __ Move(result, dividend);
|
| int32_t shift = WhichPowerOf2Abs(divisor);
|
| @@ -1317,7 +1316,7 @@ void LCodeGen::DoDivByConstI(LDivByConstI* instr) {
|
| DCHECK(ToRegister(instr->result()).is(rdx));
|
|
|
| if (divisor == 0) {
|
| - DeoptimizeIf(no_condition, instr->environment());
|
| + DeoptimizeIf(no_condition, instr);
|
| return;
|
| }
|
|
|
| @@ -1325,7 +1324,7 @@ void LCodeGen::DoDivByConstI(LDivByConstI* instr) {
|
| HDiv* hdiv = instr->hydrogen();
|
| if (hdiv->CheckFlag(HValue::kBailoutOnMinusZero) && divisor < 0) {
|
| __ testl(dividend, dividend);
|
| - DeoptimizeIf(zero, instr->environment());
|
| + DeoptimizeIf(zero, instr);
|
| }
|
|
|
| __ TruncatingDiv(dividend, Abs(divisor));
|
| @@ -1335,7 +1334,7 @@ void LCodeGen::DoDivByConstI(LDivByConstI* instr) {
|
| __ movl(rax, rdx);
|
| __ imull(rax, rax, Immediate(divisor));
|
| __ subl(rax, dividend);
|
| - DeoptimizeIf(not_equal, instr->environment());
|
| + DeoptimizeIf(not_equal, instr);
|
| }
|
| }
|
|
|
| @@ -1355,7 +1354,7 @@ void LCodeGen::DoDivI(LDivI* instr) {
|
| // Check for x / 0.
|
| if (hdiv->CheckFlag(HValue::kCanBeDivByZero)) {
|
| __ testl(divisor, divisor);
|
| - DeoptimizeIf(zero, instr->environment());
|
| + DeoptimizeIf(zero, instr);
|
| }
|
|
|
| // Check for (0 / -x) that will produce negative zero.
|
| @@ -1364,7 +1363,7 @@ void LCodeGen::DoDivI(LDivI* instr) {
|
| __ testl(dividend, dividend);
|
| __ j(not_zero, ÷nd_not_zero, Label::kNear);
|
| __ testl(divisor, divisor);
|
| - DeoptimizeIf(sign, instr->environment());
|
| + DeoptimizeIf(sign, instr);
|
| __ bind(÷nd_not_zero);
|
| }
|
|
|
| @@ -1374,7 +1373,7 @@ void LCodeGen::DoDivI(LDivI* instr) {
|
| __ cmpl(dividend, Immediate(kMinInt));
|
| __ j(not_zero, ÷nd_not_min_int, Label::kNear);
|
| __ cmpl(divisor, Immediate(-1));
|
| - DeoptimizeIf(zero, instr->environment());
|
| + DeoptimizeIf(zero, instr);
|
| __ bind(÷nd_not_min_int);
|
| }
|
|
|
| @@ -1385,7 +1384,7 @@ void LCodeGen::DoDivI(LDivI* instr) {
|
| if (!hdiv->CheckFlag(HValue::kAllUsesTruncatingToInt32)) {
|
| // Deoptimize if remainder is not 0.
|
| __ testl(remainder, remainder);
|
| - DeoptimizeIf(not_zero, instr->environment());
|
| + DeoptimizeIf(not_zero, instr);
|
| }
|
| }
|
|
|
| @@ -1462,7 +1461,7 @@ void LCodeGen::DoMulI(LMulI* instr) {
|
| }
|
|
|
| if (can_overflow) {
|
| - DeoptimizeIf(overflow, instr->environment());
|
| + DeoptimizeIf(overflow, instr);
|
| }
|
|
|
| if (instr->hydrogen()->CheckFlag(HValue::kBailoutOnMinusZero)) {
|
| @@ -1481,10 +1480,10 @@ void LCodeGen::DoMulI(LMulI* instr) {
|
| ? !instr->hydrogen_value()->representation().IsSmi()
|
| : SmiValuesAre31Bits());
|
| if (ToInteger32(LConstantOperand::cast(right)) < 0) {
|
| - DeoptimizeIf(no_condition, instr->environment());
|
| + DeoptimizeIf(no_condition, instr);
|
| } else if (ToInteger32(LConstantOperand::cast(right)) == 0) {
|
| __ cmpl(kScratchRegister, Immediate(0));
|
| - DeoptimizeIf(less, instr->environment());
|
| + DeoptimizeIf(less, instr);
|
| }
|
| } else if (right->IsStackSlot()) {
|
| if (instr->hydrogen_value()->representation().IsSmi()) {
|
| @@ -1492,7 +1491,7 @@ void LCodeGen::DoMulI(LMulI* instr) {
|
| } else {
|
| __ orl(kScratchRegister, ToOperand(right));
|
| }
|
| - DeoptimizeIf(sign, instr->environment());
|
| + DeoptimizeIf(sign, instr);
|
| } else {
|
| // Test the non-zero operand for negative sign.
|
| if (instr->hydrogen_value()->representation().IsSmi()) {
|
| @@ -1500,7 +1499,7 @@ void LCodeGen::DoMulI(LMulI* instr) {
|
| } else {
|
| __ orl(kScratchRegister, ToRegister(right));
|
| }
|
| - DeoptimizeIf(sign, instr->environment());
|
| + DeoptimizeIf(sign, instr);
|
| }
|
| __ bind(&done);
|
| }
|
| @@ -1613,7 +1612,7 @@ void LCodeGen::DoShiftI(LShiftI* instr) {
|
| __ shrl_cl(ToRegister(left));
|
| if (instr->can_deopt()) {
|
| __ testl(ToRegister(left), ToRegister(left));
|
| - DeoptimizeIf(negative, instr->environment());
|
| + DeoptimizeIf(negative, instr);
|
| }
|
| break;
|
| case Token::SHL:
|
| @@ -1642,7 +1641,7 @@ void LCodeGen::DoShiftI(LShiftI* instr) {
|
| __ shrl(ToRegister(left), Immediate(shift_count));
|
| } else if (instr->can_deopt()) {
|
| __ testl(ToRegister(left), ToRegister(left));
|
| - DeoptimizeIf(negative, instr->environment());
|
| + DeoptimizeIf(negative, instr);
|
| }
|
| break;
|
| case Token::SHL:
|
| @@ -1657,7 +1656,7 @@ void LCodeGen::DoShiftI(LShiftI* instr) {
|
| __ shll(ToRegister(left), Immediate(shift_count - 1));
|
| }
|
| __ Integer32ToSmi(ToRegister(left), ToRegister(left));
|
| - DeoptimizeIf(overflow, instr->environment());
|
| + DeoptimizeIf(overflow, instr);
|
| } else {
|
| __ shll(ToRegister(left), Immediate(shift_count));
|
| }
|
| @@ -1700,7 +1699,7 @@ void LCodeGen::DoSubI(LSubI* instr) {
|
| }
|
|
|
| if (instr->hydrogen()->CheckFlag(HValue::kCanOverflow)) {
|
| - DeoptimizeIf(overflow, instr->environment());
|
| + DeoptimizeIf(overflow, instr);
|
| }
|
| }
|
|
|
| @@ -1765,9 +1764,9 @@ void LCodeGen::DoDateField(LDateField* instr) {
|
| DCHECK(object.is(rax));
|
|
|
| Condition cc = masm()->CheckSmi(object);
|
| - DeoptimizeIf(cc, instr->environment());
|
| + DeoptimizeIf(cc, instr);
|
| __ CmpObjectType(object, JS_DATE_TYPE, kScratchRegister);
|
| - DeoptimizeIf(not_equal, instr->environment());
|
| + DeoptimizeIf(not_equal, instr);
|
|
|
| if (index->value() == 0) {
|
| __ movp(result, FieldOperand(object, JSDate::kValueOffset));
|
| @@ -1931,7 +1930,7 @@ void LCodeGen::DoAddI(LAddI* instr) {
|
| }
|
| }
|
| if (instr->hydrogen()->CheckFlag(HValue::kCanOverflow)) {
|
| - DeoptimizeIf(overflow, instr->environment());
|
| + DeoptimizeIf(overflow, instr);
|
| }
|
| }
|
| }
|
| @@ -2176,7 +2175,7 @@ void LCodeGen::DoBranch(LBranch* instr) {
|
| } else if (expected.NeedsMap()) {
|
| // If we need a map later and have a Smi -> deopt.
|
| __ testb(reg, Immediate(kSmiTagMask));
|
| - DeoptimizeIf(zero, instr->environment());
|
| + DeoptimizeIf(zero, instr);
|
| }
|
|
|
| const Register map = kScratchRegister;
|
| @@ -2230,7 +2229,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);
|
| }
|
| }
|
| }
|
| @@ -2846,7 +2845,7 @@ void LCodeGen::DoLoadGlobalCell(LLoadGlobalCell* instr) {
|
| __ LoadGlobalCell(result, instr->hydrogen()->cell().handle());
|
| if (instr->hydrogen()->RequiresHoleCheck()) {
|
| __ CompareRoot(result, Heap::kTheHoleValueRootIndex);
|
| - DeoptimizeIf(equal, instr->environment());
|
| + DeoptimizeIf(equal, instr);
|
| }
|
| }
|
|
|
| @@ -2894,7 +2893,7 @@ void LCodeGen::DoStoreGlobalCell(LStoreGlobalCell* instr) {
|
| DCHECK(!value.is(cell));
|
| __ Move(cell, cell_handle, RelocInfo::CELL);
|
| __ CompareRoot(Operand(cell, 0), Heap::kTheHoleValueRootIndex);
|
| - DeoptimizeIf(equal, instr->environment());
|
| + DeoptimizeIf(equal, instr);
|
| // Store the value.
|
| __ movp(Operand(cell, 0), value);
|
| } else {
|
| @@ -2913,7 +2912,7 @@ void LCodeGen::DoLoadContextSlot(LLoadContextSlot* instr) {
|
| if (instr->hydrogen()->RequiresHoleCheck()) {
|
| __ CompareRoot(result, Heap::kTheHoleValueRootIndex);
|
| if (instr->hydrogen()->DeoptimizesOnHole()) {
|
| - DeoptimizeIf(equal, instr->environment());
|
| + DeoptimizeIf(equal, instr);
|
| } else {
|
| Label is_not_hole;
|
| __ j(not_equal, &is_not_hole, Label::kNear);
|
| @@ -2934,7 +2933,7 @@ void LCodeGen::DoStoreContextSlot(LStoreContextSlot* instr) {
|
| if (instr->hydrogen()->RequiresHoleCheck()) {
|
| __ CompareRoot(target, Heap::kTheHoleValueRootIndex);
|
| if (instr->hydrogen()->DeoptimizesOnHole()) {
|
| - DeoptimizeIf(equal, instr->environment());
|
| + DeoptimizeIf(equal, instr);
|
| } else {
|
| __ j(not_equal, &skip_assignment);
|
| }
|
| @@ -3032,7 +3031,7 @@ void LCodeGen::DoLoadFunctionPrototype(LLoadFunctionPrototype* instr) {
|
|
|
| // Check that the function has a prototype or an initial map.
|
| __ CompareRoot(result, Heap::kTheHoleValueRootIndex);
|
| - DeoptimizeIf(equal, instr->environment());
|
| + DeoptimizeIf(equal, instr);
|
|
|
| // If the function does not have an initial map, we're done.
|
| Label done;
|
| @@ -3144,7 +3143,7 @@ void LCodeGen::DoLoadKeyedExternalArray(LLoadKeyed* instr) {
|
| __ movl(result, operand);
|
| if (!instr->hydrogen()->CheckFlag(HInstruction::kUint32)) {
|
| __ testl(result, result);
|
| - DeoptimizeIf(negative, instr->environment());
|
| + DeoptimizeIf(negative, instr);
|
| }
|
| break;
|
| case EXTERNAL_FLOAT32_ELEMENTS:
|
| @@ -3183,7 +3182,7 @@ void LCodeGen::DoLoadKeyedFixedDoubleArray(LLoadKeyed* instr) {
|
| FAST_DOUBLE_ELEMENTS,
|
| instr->base_offset() + sizeof(kHoleNanLower32));
|
| __ cmpl(hole_check_operand, Immediate(kHoleNanUpper32));
|
| - DeoptimizeIf(equal, instr->environment());
|
| + DeoptimizeIf(equal, instr);
|
| }
|
|
|
| Operand double_load_operand = BuildFastArrayOperand(
|
| @@ -3240,10 +3239,10 @@ void LCodeGen::DoLoadKeyedFixedArray(LLoadKeyed* instr) {
|
| if (requires_hole_check) {
|
| if (IsFastSmiElementsKind(hinstr->elements_kind())) {
|
| Condition smi = __ CheckSmi(result);
|
| - DeoptimizeIf(NegateCondition(smi), instr->environment());
|
| + DeoptimizeIf(NegateCondition(smi), instr);
|
| } else {
|
| __ CompareRoot(result, Heap::kTheHoleValueRootIndex);
|
| - DeoptimizeIf(equal, instr->environment());
|
| + DeoptimizeIf(equal, instr);
|
| }
|
| }
|
| }
|
| @@ -3392,9 +3391,9 @@ void LCodeGen::DoWrapReceiver(LWrapReceiver* instr) {
|
|
|
| // The receiver should be a JS object.
|
| Condition is_smi = __ CheckSmi(receiver);
|
| - DeoptimizeIf(is_smi, instr->environment());
|
| + DeoptimizeIf(is_smi, instr);
|
| __ CmpObjectType(receiver, FIRST_SPEC_OBJECT_TYPE, kScratchRegister);
|
| - DeoptimizeIf(below, instr->environment());
|
| + DeoptimizeIf(below, instr);
|
|
|
| __ jmp(&receiver_ok, Label::kNear);
|
| __ bind(&global_object);
|
| @@ -3421,7 +3420,7 @@ void LCodeGen::DoApplyArguments(LApplyArguments* instr) {
|
| // adaptor frame below it.
|
| const uint32_t kArgumentsLimit = 1 * KB;
|
| __ cmpp(length, Immediate(kArgumentsLimit));
|
| - DeoptimizeIf(above, instr->environment());
|
| + DeoptimizeIf(above, instr);
|
|
|
| __ Push(receiver);
|
| __ movp(receiver, length);
|
| @@ -3616,7 +3615,7 @@ void LCodeGen::DoDeferredMathAbsTaggedHeapNumber(LMathAbs* instr) {
|
| Register input_reg = ToRegister(instr->value());
|
| __ CompareRoot(FieldOperand(input_reg, HeapObject::kMapOffset),
|
| Heap::kHeapNumberMapRootIndex);
|
| - DeoptimizeIf(not_equal, instr->environment());
|
| + DeoptimizeIf(not_equal, instr);
|
|
|
| Label slow, allocated, done;
|
| Register tmp = input_reg.is(rax) ? rcx : rax;
|
| @@ -3662,7 +3661,7 @@ void LCodeGen::EmitIntegerMathAbs(LMathAbs* instr) {
|
| Label is_positive;
|
| __ j(not_sign, &is_positive, Label::kNear);
|
| __ negl(input_reg); // Sets flags.
|
| - DeoptimizeIf(negative, instr->environment());
|
| + DeoptimizeIf(negative, instr);
|
| __ bind(&is_positive);
|
| }
|
|
|
| @@ -3673,7 +3672,7 @@ void LCodeGen::EmitSmiMathAbs(LMathAbs* instr) {
|
| Label is_positive;
|
| __ j(not_sign, &is_positive, Label::kNear);
|
| __ negp(input_reg); // Sets flags.
|
| - DeoptimizeIf(negative, instr->environment());
|
| + DeoptimizeIf(negative, instr);
|
| __ bind(&is_positive);
|
| }
|
|
|
| @@ -3728,18 +3727,18 @@ void LCodeGen::DoMathFloor(LMathFloor* instr) {
|
| // Deoptimize if minus zero.
|
| __ movq(output_reg, input_reg);
|
| __ subq(output_reg, Immediate(1));
|
| - DeoptimizeIf(overflow, instr->environment());
|
| + DeoptimizeIf(overflow, instr);
|
| }
|
| __ roundsd(xmm_scratch, input_reg, Assembler::kRoundDown);
|
| __ cvttsd2si(output_reg, xmm_scratch);
|
| __ cmpl(output_reg, Immediate(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)) {
|
| @@ -3748,7 +3747,7 @@ void LCodeGen::DoMathFloor(LMathFloor* instr) {
|
| __ j(above, &positive_sign, Label::kNear);
|
| __ movmskpd(output_reg, input_reg);
|
| __ testq(output_reg, Immediate(1));
|
| - DeoptimizeIf(not_zero, instr->environment());
|
| + DeoptimizeIf(not_zero, instr);
|
| __ Set(output_reg, 0);
|
| __ jmp(&done);
|
| __ bind(&positive_sign);
|
| @@ -3758,7 +3757,7 @@ void LCodeGen::DoMathFloor(LMathFloor* instr) {
|
| __ cvttsd2si(output_reg, input_reg);
|
| // Overflow is signalled with minint.
|
| __ cmpl(output_reg, Immediate(0x1));
|
| - DeoptimizeIf(overflow, instr->environment());
|
| + DeoptimizeIf(overflow, instr);
|
| __ jmp(&done, Label::kNear);
|
|
|
| // Non-zero negative reaches here.
|
| @@ -3769,7 +3768,7 @@ void LCodeGen::DoMathFloor(LMathFloor* instr) {
|
| __ ucomisd(input_reg, xmm_scratch);
|
| __ j(equal, &done, Label::kNear);
|
| __ subl(output_reg, Immediate(1));
|
| - DeoptimizeIf(overflow, instr->environment());
|
| + DeoptimizeIf(overflow, instr);
|
|
|
| __ bind(&done);
|
| }
|
| @@ -3797,7 +3796,7 @@ void LCodeGen::DoMathRound(LMathRound* instr) {
|
| // Overflow is signalled with minint.
|
| __ cmpl(output_reg, Immediate(0x1));
|
| __ RecordComment("D2I conversion overflow");
|
| - DeoptimizeIf(overflow, instr->environment());
|
| + DeoptimizeIf(overflow, instr);
|
| __ jmp(&done, dist);
|
|
|
| __ bind(&below_one_half);
|
| @@ -3814,7 +3813,7 @@ void LCodeGen::DoMathRound(LMathRound* instr) {
|
| // Catch minint due to overflow, and to prevent overflow when compensating.
|
| __ cmpl(output_reg, Immediate(0x1));
|
| __ RecordComment("D2I conversion overflow");
|
| - DeoptimizeIf(overflow, instr->environment());
|
| + DeoptimizeIf(overflow, instr);
|
|
|
| __ Cvtlsi2sd(xmm_scratch, output_reg);
|
| __ ucomisd(xmm_scratch, input_temp);
|
| @@ -3830,7 +3829,7 @@ void LCodeGen::DoMathRound(LMathRound* instr) {
|
| __ movq(output_reg, input_reg);
|
| __ testq(output_reg, output_reg);
|
| __ RecordComment("Minus zero");
|
| - DeoptimizeIf(negative, instr->environment());
|
| + DeoptimizeIf(negative, instr);
|
| }
|
| __ Set(output_reg, 0);
|
| __ bind(&done);
|
| @@ -3909,7 +3908,7 @@ void LCodeGen::DoPower(LPower* instr) {
|
| Label no_deopt;
|
| __ JumpIfSmi(tagged_exponent, &no_deopt, Label::kNear);
|
| __ CmpObjectType(tagged_exponent, HEAP_NUMBER_TYPE, rcx);
|
| - DeoptimizeIf(not_equal, instr->environment());
|
| + DeoptimizeIf(not_equal, instr);
|
| __ bind(&no_deopt);
|
| MathPowStub stub(isolate(), MathPowStub::TAGGED);
|
| __ CallStub(&stub);
|
| @@ -4281,7 +4280,7 @@ void LCodeGen::DoBoundsCheck(LBoundsCheck* instr) {
|
| __ int3();
|
| __ bind(&done);
|
| } else {
|
| - DeoptimizeIf(cc, instr->environment());
|
| + DeoptimizeIf(cc, instr);
|
| }
|
| }
|
|
|
| @@ -4529,7 +4528,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);
|
| }
|
|
|
| @@ -4848,12 +4847,12 @@ void LCodeGen::DoSmiTag(LSmiTag* instr) {
|
| if (hchange->CheckFlag(HValue::kCanOverflow) &&
|
| hchange->value()->CheckFlag(HValue::kUint32)) {
|
| Condition is_smi = __ CheckUInteger32ValidSmiValue(input);
|
| - DeoptimizeIf(NegateCondition(is_smi), instr->environment());
|
| + DeoptimizeIf(NegateCondition(is_smi), instr);
|
| }
|
| __ Integer32ToSmi(output, input);
|
| if (hchange->CheckFlag(HValue::kCanOverflow) &&
|
| !hchange->value()->CheckFlag(HValue::kUint32)) {
|
| - DeoptimizeIf(overflow, instr->environment());
|
| + DeoptimizeIf(overflow, instr);
|
| }
|
| }
|
|
|
| @@ -4863,7 +4862,7 @@ void LCodeGen::DoSmiUntag(LSmiUntag* instr) {
|
| Register input = ToRegister(instr->value());
|
| if (instr->needs_check()) {
|
| Condition is_smi = __ CheckSmi(input);
|
| - DeoptimizeIf(NegateCondition(is_smi), instr->environment());
|
| + DeoptimizeIf(NegateCondition(is_smi), instr);
|
| } else {
|
| __ AssertSmi(input);
|
| }
|
| @@ -4871,12 +4870,12 @@ void LCodeGen::DoSmiUntag(LSmiUntag* instr) {
|
| }
|
|
|
|
|
| -void LCodeGen::EmitNumberUntagD(Register input_reg,
|
| - XMMRegister result_reg,
|
| - bool can_convert_undefined_to_nan,
|
| - bool deoptimize_on_minus_zero,
|
| - LEnvironment* env,
|
| - NumberUntagDMode mode) {
|
| +void LCodeGen::EmitNumberUntagD(LNumberUntagD* instr, Register input_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) {
|
| @@ -4894,7 +4893,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);
|
| }
|
|
|
| if (deoptimize_on_minus_zero) {
|
| @@ -4904,7 +4903,7 @@ void LCodeGen::EmitNumberUntagD(Register input_reg,
|
| __ j(not_equal, &done, Label::kNear);
|
| __ movmskpd(kScratchRegister, result_reg);
|
| __ testq(kScratchRegister, Immediate(1));
|
| - DeoptimizeIf(not_zero, env);
|
| + DeoptimizeIf(not_zero, instr);
|
| }
|
| __ jmp(&done, Label::kNear);
|
|
|
| @@ -4913,7 +4912,7 @@ void LCodeGen::EmitNumberUntagD(Register input_reg,
|
|
|
| // Convert undefined (and hole) to NaN. Compute NaN as 0/0.
|
| __ CompareRoot(input_reg, Heap::kUndefinedValueRootIndex);
|
| - DeoptimizeIf(not_equal, env);
|
| + DeoptimizeIf(not_equal, instr);
|
|
|
| __ xorps(result_reg, result_reg);
|
| __ divsd(result_reg, result_reg);
|
| @@ -4961,7 +4960,7 @@ void LCodeGen::DoDeferredTaggedToI(LTaggedToI* instr, Label* done) {
|
| __ bind(&check_false);
|
| __ CompareRoot(input_reg, Heap::kFalseValueRootIndex);
|
| __ RecordComment("Deferred TaggedToI: cannot truncate");
|
| - DeoptimizeIf(not_equal, instr->environment());
|
| + DeoptimizeIf(not_equal, instr);
|
| __ Set(input_reg, 0);
|
| } else {
|
| XMMRegister scratch = ToDoubleRegister(instr->temp());
|
| @@ -4969,22 +4968,22 @@ void LCodeGen::DoDeferredTaggedToI(LTaggedToI* instr, Label* done) {
|
| __ CompareRoot(FieldOperand(input_reg, HeapObject::kMapOffset),
|
| Heap::kHeapNumberMapRootIndex);
|
| __ 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, xmm0);
|
| __ Cvtlsi2sd(scratch, 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) {
|
| __ testl(input_reg, input_reg);
|
| __ j(not_zero, done);
|
| __ movmskpd(input_reg, xmm0);
|
| __ andl(input_reg, Immediate(1));
|
| __ RecordComment("Deferred TaggedToI: minus zero");
|
| - DeoptimizeIf(not_zero, instr->environment());
|
| + DeoptimizeIf(not_zero, instr);
|
| }
|
| }
|
| }
|
| @@ -5032,11 +5031,7 @@ void LCodeGen::DoNumberUntagD(LNumberUntagD* instr) {
|
| NumberUntagDMode mode = value->representation().IsSmi()
|
| ? NUMBER_CANDIDATE_IS_SMI : NUMBER_CANDIDATE_IS_ANY_TAGGED;
|
|
|
| - EmitNumberUntagD(input_reg, result_reg,
|
| - instr->hydrogen()->can_convert_undefined_to_nan(),
|
| - instr->hydrogen()->deoptimize_on_minus_zero(),
|
| - instr->environment(),
|
| - mode);
|
| + EmitNumberUntagD(instr, input_reg, result_reg, mode);
|
| }
|
|
|
|
|
| @@ -5059,7 +5054,7 @@ void LCodeGen::DoDoubleToI(LDoubleToI* instr) {
|
|
|
| __ jmp(&done, Label::kNear);
|
| __ bind(&bailout);
|
| - DeoptimizeIf(no_condition, instr->environment());
|
| + DeoptimizeIf(no_condition, instr);
|
| __ bind(&done);
|
| }
|
| }
|
| @@ -5081,18 +5076,18 @@ void LCodeGen::DoDoubleToSmi(LDoubleToSmi* instr) {
|
|
|
| __ jmp(&done, Label::kNear);
|
| __ bind(&bailout);
|
| - DeoptimizeIf(no_condition, instr->environment());
|
| + DeoptimizeIf(no_condition, instr);
|
| __ bind(&done);
|
|
|
| __ Integer32ToSmi(result_reg, result_reg);
|
| - DeoptimizeIf(overflow, instr->environment());
|
| + DeoptimizeIf(overflow, instr);
|
| }
|
|
|
|
|
| void LCodeGen::DoCheckSmi(LCheckSmi* instr) {
|
| LOperand* input = instr->value();
|
| Condition cc = masm()->CheckSmi(ToRegister(input));
|
| - DeoptimizeIf(NegateCondition(cc), instr->environment());
|
| + DeoptimizeIf(NegateCondition(cc), instr);
|
| }
|
|
|
|
|
| @@ -5100,7 +5095,7 @@ void LCodeGen::DoCheckNonSmi(LCheckNonSmi* instr) {
|
| if (!instr->hydrogen()->value()->type().IsHeapObject()) {
|
| LOperand* input = instr->value();
|
| Condition cc = masm()->CheckSmi(ToRegister(input));
|
| - DeoptimizeIf(cc, instr->environment());
|
| + DeoptimizeIf(cc, instr);
|
| }
|
| }
|
|
|
| @@ -5120,14 +5115,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(kScratchRegister, Map::kInstanceTypeOffset),
|
| Immediate(static_cast<int8_t>(last)));
|
| - DeoptimizeIf(above, instr->environment());
|
| + DeoptimizeIf(above, instr);
|
| }
|
| }
|
| } else {
|
| @@ -5139,13 +5134,13 @@ void LCodeGen::DoCheckInstanceType(LCheckInstanceType* instr) {
|
| DCHECK(tag == 0 || base::bits::IsPowerOfTwo32(tag));
|
| __ testb(FieldOperand(kScratchRegister, Map::kInstanceTypeOffset),
|
| Immediate(mask));
|
| - DeoptimizeIf(tag == 0 ? not_zero : zero, instr->environment());
|
| + DeoptimizeIf(tag == 0 ? not_zero : zero, instr);
|
| } else {
|
| __ movzxbl(kScratchRegister,
|
| FieldOperand(kScratchRegister, Map::kInstanceTypeOffset));
|
| __ andb(kScratchRegister, Immediate(mask));
|
| __ cmpb(kScratchRegister, Immediate(tag));
|
| - DeoptimizeIf(not_equal, instr->environment());
|
| + DeoptimizeIf(not_equal, instr);
|
| }
|
| }
|
| }
|
| @@ -5154,7 +5149,7 @@ void LCodeGen::DoCheckInstanceType(LCheckInstanceType* instr) {
|
| void LCodeGen::DoCheckValue(LCheckValue* instr) {
|
| Register reg = ToRegister(instr->value());
|
| __ Cmp(reg, instr->hydrogen()->object().handle());
|
| - DeoptimizeIf(not_equal, instr->environment());
|
| + DeoptimizeIf(not_equal, instr);
|
| }
|
|
|
|
|
| @@ -5169,7 +5164,7 @@ void LCodeGen::DoDeferredInstanceMigration(LCheckMaps* instr, Register object) {
|
|
|
| __ testp(rax, Immediate(kSmiTagMask));
|
| }
|
| - DeoptimizeIf(zero, instr->environment());
|
| + DeoptimizeIf(zero, instr);
|
| }
|
|
|
|
|
| @@ -5222,7 +5217,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);
|
| @@ -5261,7 +5256,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);
|
| __ xorl(input_reg, input_reg);
|
| __ jmp(&done, Label::kNear);
|
|
|
| @@ -5654,7 +5649,7 @@ void LCodeGen::DoDeoptimize(LDeoptimize* instr) {
|
| }
|
|
|
| Comment(";;; deoptimize: %s", instr->hydrogen()->reason());
|
| - DeoptimizeIf(no_condition, instr->environment(), type);
|
| + DeoptimizeIf(no_condition, instr, type);
|
| }
|
|
|
|
|
| @@ -5744,19 +5739,19 @@ void LCodeGen::DoOsrEntry(LOsrEntry* instr) {
|
| void LCodeGen::DoForInPrepareMap(LForInPrepareMap* instr) {
|
| DCHECK(ToRegister(instr->context()).is(rsi));
|
| __ CompareRoot(rax, Heap::kUndefinedValueRootIndex);
|
| - DeoptimizeIf(equal, instr->environment());
|
| + DeoptimizeIf(equal, instr);
|
|
|
| Register null_value = rdi;
|
| __ LoadRoot(null_value, Heap::kNullValueRootIndex);
|
| __ cmpp(rax, null_value);
|
| - DeoptimizeIf(equal, instr->environment());
|
| + DeoptimizeIf(equal, instr);
|
|
|
| Condition cc = masm()->CheckSmi(rax);
|
| - DeoptimizeIf(cc, instr->environment());
|
| + DeoptimizeIf(cc, instr);
|
|
|
| STATIC_ASSERT(FIRST_JS_PROXY_TYPE == FIRST_SPEC_OBJECT_TYPE);
|
| __ CmpObjectType(rax, LAST_JS_PROXY_TYPE, rcx);
|
| - DeoptimizeIf(below_equal, instr->environment());
|
| + DeoptimizeIf(below_equal, instr);
|
|
|
| Label use_cache, call_runtime;
|
| __ CheckEnumCache(null_value, &call_runtime);
|
| @@ -5771,7 +5766,7 @@ void LCodeGen::DoForInPrepareMap(LForInPrepareMap* instr) {
|
|
|
| __ CompareRoot(FieldOperand(rax, HeapObject::kMapOffset),
|
| Heap::kMetaMapRootIndex);
|
| - DeoptimizeIf(not_equal, instr->environment());
|
| + DeoptimizeIf(not_equal, instr);
|
| __ bind(&use_cache);
|
| }
|
|
|
| @@ -5793,7 +5788,7 @@ void LCodeGen::DoForInCacheArray(LForInCacheArray* instr) {
|
| FieldOperand(result, FixedArray::SizeFor(instr->idx())));
|
| __ bind(&done);
|
| Condition cc = masm()->CheckSmi(result);
|
| - DeoptimizeIf(cc, instr->environment());
|
| + DeoptimizeIf(cc, instr);
|
| }
|
|
|
|
|
| @@ -5801,7 +5796,7 @@ void LCodeGen::DoCheckMapValue(LCheckMapValue* instr) {
|
| Register object = ToRegister(instr->value());
|
| __ cmpp(ToRegister(instr->map()),
|
| FieldOperand(object, HeapObject::kMapOffset));
|
| - DeoptimizeIf(not_equal, instr->environment());
|
| + DeoptimizeIf(not_equal, instr);
|
| }
|
|
|
|
|
|
|