[turbofan] Add support for eager/soft deoptimization reasons.

src/compiler/effect-control-linearizer.cc

 // Copyright 2015 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "src/compiler/effect-control-linearizer.h"
 
 #include "src/code-factory.h"
 #include "src/compiler/access-builder.h"
 #include "src/compiler/js-graph.h"
 #include "src/compiler/linkage.h"
@@ skipping 984 matching lines @@
   return ValueEffectControl(value, effect, control);
 }
 
 EffectControlLinearizer::ValueEffectControl
 EffectControlLinearizer::LowerCheckBounds(Node* node, Node* frame_state,
                                           Node* effect, Node* control) {
   Node* index = node->InputAt(0);
   Node* limit = node->InputAt(1);
 
   Node* check = graph()->NewNode(machine()->Uint32LessThan(), index, limit);
-  control = effect = graph()->NewNode(common()->DeoptimizeUnless(), check,
-                                      frame_state, effect, control);
+  control = effect = graph()->NewNode(
+      common()->DeoptimizeUnless(DeoptimizeReason::kOutOfBounds), check,
+      frame_state, effect, control);
 
   return ValueEffectControl(index, effect, control);
 }
 
 EffectControlLinearizer::ValueEffectControl
 EffectControlLinearizer::LowerCheckNumber(Node* node, Node* frame_state,
                                           Node* effect, Node* control) {
   Node* value = node->InputAt(0);
 
   Node* check0 = ObjectIsSmi(value);
   Node* branch0 =
       graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control);
 
   Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0);
   Node* etrue0 = effect;
 
   Node* if_false0 = graph()->NewNode(common()->IfFalse(), branch0);
   Node* efalse0 = effect;
   {
     Node* value_map = efalse0 =
         graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()),
                          value, efalse0, if_false0);
     Node* check1 = graph()->NewNode(machine()->WordEqual(), value_map,
                                     jsgraph()->HeapNumberMapConstant());
-    if_false0 = efalse0 = graph()->NewNode(common()->DeoptimizeUnless(), check1,
-                                           frame_state, efalse0, if_false0);
+    if_false0 = efalse0 = graph()->NewNode(
+        common()->DeoptimizeUnless(DeoptimizeReason::kNotAHeapNumber), check1,
+        frame_state, efalse0, if_false0);
   }
 
   control = graph()->NewNode(common()->Merge(2), if_true0, if_false0);
   effect = graph()->NewNode(common()->EffectPhi(2), etrue0, efalse0, control);
 
   return ValueEffectControl(value, effect, control);
 }
 
 EffectControlLinearizer::ValueEffectControl
 EffectControlLinearizer::LowerCheckIf(Node* node, Node* frame_state,
                                       Node* effect, Node* control) {
   Node* value = node->InputAt(0);
 
-  control = effect = graph()->NewNode(common()->DeoptimizeUnless(), value,
-                                      frame_state, effect, control);
+  control = effect =
+      graph()->NewNode(common()->DeoptimizeUnless(DeoptimizeReason::kNoReason),
+                       value, frame_state, effect, control);
 
   return ValueEffectControl(value, effect, control);
 }
 
 EffectControlLinearizer::ValueEffectControl
 EffectControlLinearizer::LowerCheckTaggedPointer(Node* node, Node* frame_state,
                                                  Node* effect, Node* control) {
   Node* value = node->InputAt(0);
 
   Node* check = ObjectIsSmi(value);
-  control = effect = graph()->NewNode(common()->DeoptimizeIf(), check,
-                                      frame_state, effect, control);
+  control = effect =
+      graph()->NewNode(common()->DeoptimizeIf(DeoptimizeReason::kSmi), check,
+                       frame_state, effect, control);
 
   return ValueEffectControl(value, effect, control);
 }
 
 EffectControlLinearizer::ValueEffectControl
 EffectControlLinearizer::LowerCheckTaggedSigned(Node* node, Node* frame_state,
                                                 Node* effect, Node* control) {
   Node* value = node->InputAt(0);
 
   Node* check = ObjectIsSmi(value);
-  control = effect = graph()->NewNode(common()->DeoptimizeUnless(), check,
-                                      frame_state, effect, control);
+  control = effect =
+      graph()->NewNode(common()->DeoptimizeUnless(DeoptimizeReason::kNotASmi),
+                       check, frame_state, effect, control);
 
   return ValueEffectControl(value, effect, control);
 }
 
 EffectControlLinearizer::ValueEffectControl
 EffectControlLinearizer::LowerCheckedInt32Add(Node* node, Node* frame_state,
                                               Node* effect, Node* control) {
   Node* lhs = node->InputAt(0);
   Node* rhs = node->InputAt(1);
 
   Node* value =
       graph()->NewNode(machine()->Int32AddWithOverflow(), lhs, rhs, control);
 
   Node* check = graph()->NewNode(common()->Projection(1), value, control);
-  control = effect = graph()->NewNode(common()->DeoptimizeIf(), check,
-                                      frame_state, effect, control);
+  control = effect =
+      graph()->NewNode(common()->DeoptimizeIf(DeoptimizeReason::kOverflow),
+                       check, frame_state, effect, control);
 
   value = graph()->NewNode(common()->Projection(0), value, control);
 
   return ValueEffectControl(value, effect, control);
 }
 
 EffectControlLinearizer::ValueEffectControl
 EffectControlLinearizer::LowerCheckedInt32Sub(Node* node, Node* frame_state,
                                               Node* effect, Node* control) {
   Node* lhs = node->InputAt(0);
   Node* rhs = node->InputAt(1);
 
   Node* value =
       graph()->NewNode(machine()->Int32SubWithOverflow(), lhs, rhs, control);
 
   Node* check = graph()->NewNode(common()->Projection(1), value, control);
-  control = effect = graph()->NewNode(common()->DeoptimizeIf(), check,
-                                      frame_state, effect, control);
+  control = effect =
+      graph()->NewNode(common()->DeoptimizeIf(DeoptimizeReason::kOverflow),
+                       check, frame_state, effect, control);
 
   value = graph()->NewNode(common()->Projection(0), value, control);
 
   return ValueEffectControl(value, effect, control);
 }
 
 EffectControlLinearizer::ValueEffectControl
 EffectControlLinearizer::LowerCheckedInt32Div(Node* node, Node* frame_state,
                                               Node* effect, Node* control) {
   Node* zero = jsgraph()->Int32Constant(0);
@@ skipping 15 matching lines @@
     // Fast case, no additional checking required.
     vtrue0 = graph()->NewNode(machine()->Int32Div(), lhs, rhs, if_true0);
   }
 
   Node* if_false0 = graph()->NewNode(common()->IfFalse(), branch0);
   Node* efalse0 = effect;
   Node* vfalse0;
   {
     // Check if {rhs} is zero.
     Node* check = graph()->NewNode(machine()->Word32Equal(), rhs, zero);
-    if_false0 = efalse0 = graph()->NewNode(common()->DeoptimizeIf(), check,
-                                           frame_state, efalse0, if_false0);
+    if_false0 = efalse0 = graph()->NewNode(
+        common()->DeoptimizeIf(DeoptimizeReason::kDivisionByZero), check,
+        frame_state, efalse0, if_false0);
 
     // Check if {lhs} is zero, as that would produce minus zero.
     check = graph()->NewNode(machine()->Word32Equal(), lhs, zero);
-    if_false0 = efalse0 = graph()->NewNode(common()->DeoptimizeIf(), check,
-                                           frame_state, efalse0, if_false0);
+    if_false0 = efalse0 =
+        graph()->NewNode(common()->DeoptimizeIf(DeoptimizeReason::kMinusZero),
+                         check, frame_state, efalse0, if_false0);
 
     // Check if {lhs} is kMinInt and {rhs} is -1, in which case we'd have
     // to return -kMinInt, which is not representable.
     Node* check1 = graph()->NewNode(machine()->Word32Equal(), lhs, minint);
     Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kFalse),
                                      check1, if_false0);
 
     Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
     Node* etrue1 = efalse0;
     {
       // Check if {rhs} is -1.
       Node* check = graph()->NewNode(machine()->Word32Equal(), rhs, minusone);
-      if_true1 = etrue1 = graph()->NewNode(common()->DeoptimizeIf(), check,
-                                           frame_state, etrue1, if_true1);
+      if_true1 = etrue1 =
+          graph()->NewNode(common()->DeoptimizeIf(DeoptimizeReason::kOverflow),
+                           check, frame_state, etrue1, if_true1);
     }
 
     Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
     Node* efalse1 = efalse0;
 
     if_false0 = graph()->NewNode(common()->Merge(2), if_true1, if_false1);
     efalse0 =
         graph()->NewNode(common()->EffectPhi(2), etrue1, efalse1, if_false0);
 
     // Perform the actual integer division.
     vfalse0 = graph()->NewNode(machine()->Int32Div(), lhs, rhs, if_false0);
   }
 
   control = graph()->NewNode(common()->Merge(2), if_true0, if_false0);
   effect = graph()->NewNode(common()->EffectPhi(2), etrue0, efalse0, control);
   Node* value =
       graph()->NewNode(common()->Phi(MachineRepresentation::kWord32, 2), vtrue0,
                        vfalse0, control);
 
   // Check if the remainder is non-zero.
   Node* check =
       graph()->NewNode(machine()->Word32Equal(), lhs,
                        graph()->NewNode(machine()->Int32Mul(), rhs, value));
-  control = effect = graph()->NewNode(common()->DeoptimizeUnless(), check,
-                                      frame_state, effect, control);
+  control = effect = graph()->NewNode(
+      common()->DeoptimizeUnless(DeoptimizeReason::kLostPrecision), check,
+      frame_state, effect, control);
 
   return ValueEffectControl(value, effect, control);
 }
 
 EffectControlLinearizer::ValueEffectControl
 EffectControlLinearizer::LowerCheckedInt32Mod(Node* node, Node* frame_state,
                                               Node* effect, Node* control) {
   Node* zero = jsgraph()->Int32Constant(0);
   Node* minusone = jsgraph()->Int32Constant(-1);
   Node* minint = jsgraph()->Int32Constant(std::numeric_limits<int32_t>::min());
 
   Node* lhs = node->InputAt(0);
   Node* rhs = node->InputAt(1);
 
   // Ensure that {rhs} is not zero, otherwise we'd have to return NaN.
   Node* check = graph()->NewNode(machine()->Word32Equal(), rhs, zero);
-  control = effect = graph()->NewNode(common()->DeoptimizeIf(), check,
-                                      frame_state, effect, control);
+  control = effect = graph()->NewNode(
+      common()->DeoptimizeIf(DeoptimizeReason::kDivisionByZero), check,
+      frame_state, effect, control);
 
   // Check if {lhs} is positive or zero.
   Node* check0 = graph()->NewNode(machine()->Int32LessThanOrEqual(), zero, lhs);
   Node* branch0 =
       graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control);
 
   Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0);
   Node* etrue0 = effect;
   Node* vtrue0;
   {
     // Fast case, no additional checking required.
     vtrue0 = graph()->NewNode(machine()->Int32Mod(), lhs, rhs, if_true0);
   }
 
   Node* if_false0 = graph()->NewNode(common()->IfFalse(), branch0);
   Node* efalse0 = effect;
   Node* vfalse0;
   {
     // Check if {lhs} is kMinInt and {rhs} is -1, in which case we'd have
     // to return -0.
     Node* check1 = graph()->NewNode(machine()->Word32Equal(), lhs, minint);
     Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kFalse),
                                      check1, if_false0);
 
     Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
     Node* etrue1 = efalse0;
     {
       // Check if {rhs} is -1.
       Node* check = graph()->NewNode(machine()->Word32Equal(), rhs, minusone);
-      if_true1 = etrue1 = graph()->NewNode(common()->DeoptimizeIf(), check,
-                                           frame_state, etrue1, if_true1);
+      if_true1 = etrue1 =
+          graph()->NewNode(common()->DeoptimizeIf(DeoptimizeReason::kMinusZero),
+                           check, frame_state, etrue1, if_true1);
     }
 
     Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
     Node* efalse1 = efalse0;
 
     if_false0 = graph()->NewNode(common()->Merge(2), if_true1, if_false1);
     efalse0 =
         graph()->NewNode(common()->EffectPhi(2), etrue1, efalse1, if_false0);
 
     // Perform the actual integer modulos.
     vfalse0 = graph()->NewNode(machine()->Int32Mod(), lhs, rhs, if_false0);
 
     // Check if the result is zero, because in that case we'd have to return
     // -0 here since we always take the signe of the {lhs} which is negative.
     Node* check = graph()->NewNode(machine()->Word32Equal(), vfalse0, zero);
-    if_false0 = efalse0 = graph()->NewNode(common()->DeoptimizeIf(), check,
-                                           frame_state, efalse0, if_false0);
+    if_false0 = efalse0 =
+        graph()->NewNode(common()->DeoptimizeIf(DeoptimizeReason::kMinusZero),
+                         check, frame_state, efalse0, if_false0);
   }
 
   control = graph()->NewNode(common()->Merge(2), if_true0, if_false0);
   effect = graph()->NewNode(common()->EffectPhi(2), etrue0, efalse0, control);
   Node* value =
       graph()->NewNode(common()->Phi(MachineRepresentation::kWord32, 2), vtrue0,
                        vfalse0, control);
 
   return ValueEffectControl(value, effect, control);
 }
 
 EffectControlLinearizer::ValueEffectControl
 EffectControlLinearizer::LowerCheckedUint32Div(Node* node, Node* frame_state,
                                                Node* effect, Node* control) {
   Node* zero = jsgraph()->Int32Constant(0);
 
   Node* lhs = node->InputAt(0);
   Node* rhs = node->InputAt(1);
 
   // Ensure that {rhs} is not zero, otherwise we'd have to return NaN.
   Node* check = graph()->NewNode(machine()->Word32Equal(), rhs, zero);
-  control = effect = graph()->NewNode(common()->DeoptimizeIf(), check,
-                                      frame_state, effect, control);
+  control = effect = graph()->NewNode(
+      common()->DeoptimizeIf(DeoptimizeReason::kDivisionByZero), check,
+      frame_state, effect, control);
 
   // Perform the actual unsigned integer division.
   Node* value = graph()->NewNode(machine()->Uint32Div(), lhs, rhs, control);
 
   // Check if the remainder is non-zero.
   check = graph()->NewNode(machine()->Word32Equal(), lhs,
                            graph()->NewNode(machine()->Int32Mul(), rhs, value));
-  control = effect = graph()->NewNode(common()->DeoptimizeUnless(), check,
-                                      frame_state, effect, control);
+  control = effect = graph()->NewNode(
+      common()->DeoptimizeUnless(DeoptimizeReason::kLostPrecision), check,
+      frame_state, effect, control);
 
   return ValueEffectControl(value, effect, control);
 }
 
 EffectControlLinearizer::ValueEffectControl
 EffectControlLinearizer::LowerCheckedUint32Mod(Node* node, Node* frame_state,
                                                Node* effect, Node* control) {
   Node* zero = jsgraph()->Int32Constant(0);
 
   Node* lhs = node->InputAt(0);
   Node* rhs = node->InputAt(1);
 
   // Ensure that {rhs} is not zero, otherwise we'd have to return NaN.
   Node* check = graph()->NewNode(machine()->Word32Equal(), rhs, zero);
-  control = effect = graph()->NewNode(common()->DeoptimizeIf(), check,
-                                      frame_state, effect, control);
+  control = effect = graph()->NewNode(
+      common()->DeoptimizeIf(DeoptimizeReason::kDivisionByZero), check,
+      frame_state, effect, control);
 
   // Perform the actual unsigned integer modulus.
   Node* value = graph()->NewNode(machine()->Uint32Mod(), lhs, rhs, control);
 
   return ValueEffectControl(value, effect, control);
 }
 
 EffectControlLinearizer::ValueEffectControl
 EffectControlLinearizer::LowerCheckedInt32Mul(Node* node, Node* frame_state,
                                               Node* effect, Node* control) {
   Node* zero = jsgraph()->Int32Constant(0);
   Node* lhs = node->InputAt(0);
   Node* rhs = node->InputAt(1);
 
   Node* projection =
       graph()->NewNode(machine()->Int32MulWithOverflow(), lhs, rhs, control);
 
   Node* check = graph()->NewNode(common()->Projection(1), projection, control);
-  control = effect = graph()->NewNode(common()->DeoptimizeIf(), check,
-                                      frame_state, effect, control);
+  control = effect =
+      graph()->NewNode(common()->DeoptimizeIf(DeoptimizeReason::kOverflow),
+                       check, frame_state, effect, control);
 
   Node* value = graph()->NewNode(common()->Projection(0), projection, control);
 
   Node* check_zero = graph()->NewNode(machine()->Word32Equal(), value, zero);
   Node* branch_zero = graph()->NewNode(common()->Branch(BranchHint::kFalse),
                                        check_zero, control);
 
   Node* if_zero = graph()->NewNode(common()->IfTrue(), branch_zero);
   Node* e_if_zero = effect;
   {
     // We may need to return negative zero.
     Node* or_inputs = graph()->NewNode(machine()->Word32Or(), lhs, rhs);
     Node* check_or =
         graph()->NewNode(machine()->Int32LessThan(), or_inputs, zero);
-    if_zero = e_if_zero = graph()->NewNode(common()->DeoptimizeIf(), check_or,
-                                           frame_state, e_if_zero, if_zero);
+    if_zero = e_if_zero =
+        graph()->NewNode(common()->DeoptimizeIf(DeoptimizeReason::kMinusZero),
+                         check_or, frame_state, e_if_zero, if_zero);
   }
 
   Node* if_not_zero = graph()->NewNode(common()->IfFalse(), branch_zero);
   Node* e_if_not_zero = effect;
 
   control = graph()->NewNode(common()->Merge(2), if_zero, if_not_zero);
   effect = graph()->NewNode(common()->EffectPhi(2), e_if_zero, e_if_not_zero,
                             control);
 
   return ValueEffectControl(value, effect, control);
 }
 
 EffectControlLinearizer::ValueEffectControl
 EffectControlLinearizer::LowerCheckedUint32ToInt32(Node* node,
                                                    Node* frame_state,
                                                    Node* effect,
                                                    Node* control) {
   Node* value = node->InputAt(0);
   Node* max_int = jsgraph()->Int32Constant(std::numeric_limits<int32_t>::max());
   Node* is_safe =
       graph()->NewNode(machine()->Uint32LessThanOrEqual(), value, max_int);
-  control = effect = graph()->NewNode(common()->DeoptimizeUnless(), is_safe,
-                                      frame_state, effect, control);
+  control = effect = graph()->NewNode(
+      common()->DeoptimizeUnless(DeoptimizeReason::kLostPrecision), is_safe,
+      frame_state, effect, control);
 
   return ValueEffectControl(value, effect, control);
 }
 
 EffectControlLinearizer::ValueEffectControl
 EffectControlLinearizer::BuildCheckedFloat64ToInt32(Node* value,
                                                     Node* frame_state,
                                                     Node* effect,
                                                     Node* control) {
   Node* value32 = graph()->NewNode(machine()->RoundFloat64ToInt32(), value);
   Node* check_same = graph()->NewNode(
       machine()->Float64Equal(), value,
       graph()->NewNode(machine()->ChangeInt32ToFloat64(), value32));
-  control = effect = graph()->NewNode(common()->DeoptimizeUnless(), check_same,
-                                      frame_state, effect, control);
+  control = effect = graph()->NewNode(
+      common()->DeoptimizeUnless(DeoptimizeReason::kLostPrecisionOrNaN),
+      check_same, frame_state, effect, control);
 
   // Check if {value} is -0.
   Node* check_zero = graph()->NewNode(machine()->Word32Equal(), value32,
                                       jsgraph()->Int32Constant(0));
   Node* branch_zero = graph()->NewNode(common()->Branch(BranchHint::kFalse),
                                        check_zero, control);
 
   Node* if_zero = graph()->NewNode(common()->IfTrue(), branch_zero);
   Node* if_notzero = graph()->NewNode(common()->IfFalse(), branch_zero);
 
   // In case of 0, we need to check the high bits for the IEEE -0 pattern.
   Node* check_negative = graph()->NewNode(
       machine()->Int32LessThan(),
       graph()->NewNode(machine()->Float64ExtractHighWord32(), value),
       jsgraph()->Int32Constant(0));
 
-  Node* deopt_minus_zero = graph()->NewNode(
-      common()->DeoptimizeIf(), check_negative, frame_state, effect, if_zero);
+  Node* deopt_minus_zero =
+      graph()->NewNode(common()->DeoptimizeIf(DeoptimizeReason::kMinusZero),
+                       check_negative, frame_state, effect, if_zero);
 
   Node* merge =
       graph()->NewNode(common()->Merge(2), deopt_minus_zero, if_notzero);
 
   effect =
       graph()->NewNode(common()->EffectPhi(2), deopt_minus_zero, effect, merge);
 
   return ValueEffectControl(value32, effect, merge);
 }
 
@@ skipping 27 matching lines @@
   // to int32.
   Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
   Node* efalse = effect;
   Node* vfalse;
   {
     Node* value_map = efalse =
         graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()),
                          value, efalse, if_false);
     Node* check = graph()->NewNode(machine()->WordEqual(), value_map,
                                    jsgraph()->HeapNumberMapConstant());
-    if_false = efalse = graph()->NewNode(common()->DeoptimizeUnless(), check,
-                                         frame_state, efalse, if_false);
+    if_false = efalse = graph()->NewNode(
+        common()->DeoptimizeUnless(DeoptimizeReason::kNotAHeapNumber), check,
+        frame_state, efalse, if_false);
     vfalse = efalse = graph()->NewNode(
         simplified()->LoadField(AccessBuilder::ForHeapNumberValue()), value,
         efalse, if_false);
     ValueEffectControl state =
         BuildCheckedFloat64ToInt32(vfalse, frame_state, efalse, if_false);
     if_false = state.control;
     efalse = state.effect;
     vfalse = state.value;
   }
 
@@ skipping 23 matching lines @@
   // For oddballs also contain the numeric value, let us just check that
   // we have an oddball here.
   Node* efalse = effect;
   Node* instance_type = efalse = graph()->NewNode(
       simplified()->LoadField(AccessBuilder::ForMapInstanceType()), value_map,
       efalse, if_false);
   Node* check_oddball =
       graph()->NewNode(machine()->Word32Equal(), instance_type,
                        jsgraph()->Int32Constant(ODDBALL_TYPE));
   if_false = efalse =
-      graph()->NewNode(common()->DeoptimizeUnless(), check_oddball, frame_state,
-                       efalse, if_false);
+      graph()->NewNode(common()->DeoptimizeUnless(
+                           DeoptimizeReason::kNotAHeapNumberUndefinedBoolean),
+                       check_oddball, frame_state, efalse, if_false);
   STATIC_ASSERT(HeapNumber::kValueOffset == Oddball::kToNumberRawOffset);
 
   control = graph()->NewNode(common()->Merge(2), if_true, if_false);
   effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control);
 
   Node* result = effect = graph()->NewNode(
       simplified()->LoadField(AccessBuilder::ForHeapNumberValue()), value,
       effect, control);
   return ValueEffectControl(result, effect, control);
 }
@@ skipping 378 matching lines @@
 EffectControlLinearizer::LowerCheckFloat64Hole(Node* node, Node* frame_state,
                                                Node* effect, Node* control) {
   // If we reach this point w/o eliminating the {node} that's marked
   // with allow-return-hole, we cannot do anything, so just deoptimize
   // in case of the hole NaN (similar to Crankshaft).
   Node* value = node->InputAt(0);
   Node* check = graph()->NewNode(
       machine()->Word32Equal(),
       graph()->NewNode(machine()->Float64ExtractHighWord32(), value),
       jsgraph()->Int32Constant(kHoleNanUpper32));
-  control = effect = graph()->NewNode(common()->DeoptimizeIf(), check,
-                                      frame_state, effect, control);
+  control = effect =
+      graph()->NewNode(common()->DeoptimizeIf(DeoptimizeReason::kHole), check,
+                       frame_state, effect, control);
 
   return ValueEffectControl(value, effect, control);
 }
 
 EffectControlLinearizer::ValueEffectControl
 EffectControlLinearizer::LowerCheckTaggedHole(Node* node, Node* frame_state,
                                               Node* effect, Node* control) {
   CheckTaggedHoleMode mode = CheckTaggedHoleModeOf(node->op());
   Node* value = node->InputAt(0);
   Node* check = graph()->NewNode(machine()->WordEqual(), value,
                                  jsgraph()->TheHoleConstant());
   switch (mode) {
     case CheckTaggedHoleMode::kConvertHoleToUndefined:
       value = graph()->NewNode(
           common()->Select(MachineRepresentation::kTagged, BranchHint::kFalse),
           check, jsgraph()->UndefinedConstant(), value);
       break;
     case CheckTaggedHoleMode::kNeverReturnHole:
-      control = effect = graph()->NewNode(common()->DeoptimizeIf(), check,
-                                          frame_state, effect, control);
+      control = effect =
+          graph()->NewNode(common()->DeoptimizeIf(DeoptimizeReason::kHole),
+                           check, frame_state, effect, control);
       break;
   }
 
   return ValueEffectControl(value, effect, control);
 }
 
 EffectControlLinearizer::ValueEffectControl
 EffectControlLinearizer::AllocateHeapNumberWithValue(Node* value, Node* effect,
                                                      Node* control) {
   Node* result = effect = graph()->NewNode(
@@ skipping 191 matching lines @@
         isolate(), graph()->zone(), callable.descriptor(), 0, flags,
         Operator::kNoThrow);
     to_number_operator_.set(common()->Call(desc));
   }
   return to_number_operator_.get();
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8