[compiler] Fix RepresentationSelector::VisitUnused

The exception concerning type None actually seems avoidable and
can cause issues with incomplete nodes remaining in the graph.

Bug: chromium:1202312, chromium:1202625
Change-Id: I89062715e7f640c66b3f7cdca249db8cde768f29
Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/2850917
Commit-Queue: Georg Neis <neis@chromium.org>
Reviewed-by: Nico Hartmann <nicohartmann@chromium.org>
Cr-Commit-Position: refs/heads/master@{#74250}

src/compiler/simplified-lowering.cc

@@ -787,9 +787,9 @@ class RepresentationSelector {
     // TODO(jarin,turbofan) Find a way to unify/merge this insertion with
     // InsertUnreachableIfNecessary.
     Node* unreachable = effect =
-        graph()->NewNode(jsgraph_->common()->Unreachable(), effect, control);
+        graph()->NewNode(common()->Unreachable(), effect, control);
     const Operator* dead_value =
-        jsgraph_->common()->DeadValue(GetInfo(node)->representation());
+        common()->DeadValue(GetInfo(node)->representation());
     node->ReplaceInput(0, unreachable);
     node->TrimInputCount(dead_value->ValueInputCount());
     ReplaceEffectControlUses(node, effect, control);
@@ -934,14 +934,7 @@ class RepresentationSelector {
     }
     ProcessRemainingInputs<T>(node, first_effect_index);
 
-    if (lower<T>() &&
-        // Nodes of type None may not actually be "unused", so ignore them here.
-        // That's because we typically propagate Truncation::None based on type
-        // checks that are vacuously true when the type is None.  It's really
-        // the code that does these checks and truncation propagations that is
-        // to blame, but requiring such code to rule out None types currently
-        // seems infeasible since it's so easy to forget.
-        (!NodeProperties::IsTyped(node) || !TypeOf(node).IsNone())) {
+    if (lower<T>()) {
       TRACE("disconnecting unused #%d:%s\n", node->id(),
             node->op()->mnemonic());
       DisconnectFromEffectAndControl(node);
@@ -1258,7 +1251,7 @@ class RepresentationSelector {
             DeoptMachineTypeOf(GetInfo(input)->representation(), TypeOf(input));
       }
       SparseInputMask mask = SparseInputMaskOf(node->op());
-      ChangeOp(node, jsgraph_->common()->TypedStateValues(types, mask));
+      ChangeOp(node, common()->TypedStateValues(types, mask));
     }
     SetOutput<T>(node, MachineRepresentation::kTagged);
   }
@@ -1307,8 +1300,8 @@ class RepresentationSelector {
 
         node->ReplaceInput(
             FrameState::kFrameStateStackInput,
-            jsgraph_->graph()->NewNode(jsgraph_->common()->TypedStateValues(
-                                           types, SparseInputMask::Dense()),
+            jsgraph_->graph()->NewNode(
+                common()->TypedStateValues(types, SparseInputMask::Dense()),
                 node.stack()));
       }
     }
@@ -1348,8 +1341,7 @@ class RepresentationSelector {
           ConvertInput(node, i, UseInfo::AnyTagged());
         }
       }
-      ChangeOp(node, jsgraph_->common()->TypedObjectState(
-                         ObjectIdOf(node->op()), types));
+      ChangeOp(node, common()->TypedObjectState(ObjectIdOf(node->op()), types));
     }
     SetOutput<T>(node, MachineRepresentation::kTagged);
   }
@@ -1968,19 +1960,6 @@ class RepresentationSelector {
                  SimplifiedLowering* lowering) {
     tick_counter_->TickAndMaybeEnterSafepoint();
 
-    // Unconditionally eliminate unused pure nodes (only relevant if there's
-    // a pure operation in between two effectful ones, where the last one
-    // is unused).
-    // Note: We must not do this for constants, as they are cached and we
-    // would thus kill the cached {node} during lowering (i.e. replace all
-    // uses with Dead), but at that point some node lowering might have
-    // already taken the constant {node} from the cache (while it was not
-    // yet killed) and we would afterwards replace that use with Dead as well.
-    if (node->op()->ValueInputCount() > 0 &&
-        node->op()->HasProperty(Operator::kPure) && truncation.IsUnused()) {
-      return VisitUnused<T>(node);
-    }
-
     if (lower<T>()) {
       // Kill non-effectful operations that have a None-type input and are thus
       // dead code. Otherwise we might end up lowering the operation in a way,
@@ -1996,10 +1975,10 @@ class RepresentationSelector {
         for (int i = 0; i < node->op()->ValueInputCount(); i++) {
           Node* input = node->InputAt(i);
           if (TypeOf(input).IsNone()) {
-            MachineRepresentation rep = GetInfo(node)->representation();
-            DeferReplacement(
-                node,
-                graph()->NewNode(jsgraph_->common()->DeadValue(rep), input));
+            node->ReplaceInput(0, input);
+            node->TrimInputCount(1);
+            ChangeOp(node,
+                     common()->DeadValue(GetInfo(node)->representation()));
             return;
           }
         }
@@ -2008,6 +1987,19 @@ class RepresentationSelector {
       }
     }
 
+    // Unconditionally eliminate unused pure nodes (only relevant if there's
+    // a pure operation in between two effectful ones, where the last one
+    // is unused).
+    // Note: We must not do this for constants, as they are cached and we
+    // would thus kill the cached {node} during lowering (i.e. replace all
+    // uses with Dead), but at that point some node lowering might have
+    // already taken the constant {node} from the cache (while it was not
+    // yet killed) and we would afterwards replace that use with Dead as well.
+    if (node->op()->ValueInputCount() > 0 &&
+        node->op()->HasProperty(Operator::kPure) && truncation.IsUnused()) {
+      return VisitUnused<T>(node);
+    }
+
     switch (node->opcode()) {
       //------------------------------------------------------------------
       // Common operators.

test/mjsunit/compiler/regress-1202312.js

+// Copyright 2021 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.
+
+// Flags: --allow-natives-syntax
+
+function foo() {
+  var __v_0 = { x: 1 };
+  var __v_1 = { };
+  var __v_2 = 0;
+  for (var i = 0; i < 1; i = {}) {
+    __v_0 += __v_0.x + 0.5;
+    __v_2 += __v_2.x % 0.5;
+    __v_2 += __v_2.x % 0.5;
+    __v_2 += __v_0.x < 6;
+    __v_2 += __v_0.x === 7;
+    __v_2 = __v_1;
+  }
+}
+
+%PrepareFunctionForOptimization(foo);
+foo();
+%OptimizeFunctionOnNextCall(foo);
+foo();

test/mjsunit/compiler/regress-1202625.js

+// Copyright 2021 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.
+
+// Flags: --allow-natives-syntax
+
+function foo() {
+  var __v_10 = { x: 1 };
+  var __v_11 = { y: 1 };
+  for (var i = 0; i < 1; i = {}) {
+    i += Math.abs(__v_10.x);
+    i += Math.abs(__v_10.x);
+    __v_10 = __v_11;
+  }
+}
+
+%PrepareFunctionForOptimization(foo);
+foo();
+foo();
+%OptimizeFunctionOnNextCall(foo);
+foo();

test/mjsunit/compiler/regress-1203116.js

+// Copyright 2021 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.
+
+// Flags: --allow-natives-syntax
+
+function bar(x) {
+  x.f = 13.37;
+}
+
+function foo() {
+  const v2 = {};
+  const v3 = {a:42};
+  const v4 = {a:42};
+  v3.d = 42;
+  v4.b = v2;
+  v4.b = 42;
+  v4.b;
+  v3.f = v2;
+  bar(v4);
+  const v10 = {a:42};
+  for (let i = 0; i < 10; i++) {
+    bar(v10);
+  }
+}
+
+%PrepareFunctionForOptimization(foo);
+foo();
+%OptimizeFunctionOnNextCall(foo);
+foo();