[turbofan] Introduce DeadValue and DeadEffect operators.

test/cctest/compiler/test-control-reducer.cc

 // Copyright 2014 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/v8.h"
 #include "test/cctest/cctest.h"
 
 #include "src/base/bits.h"
 #include "src/compiler/all-nodes.h"
 #include "src/compiler/common-operator.h"
@@ skipping 57 matching lines @@
         common(main_zone()),
         graph(main_zone()),
         jsgraph(main_isolate(), &graph, &common, NULL, NULL),
         start(graph.NewNode(common.Start(1))),
         end(graph.NewNode(common.End(1), start)),
         p0(graph.NewNode(common.Parameter(0), start)),
         zero(jsgraph.Int32Constant(0)),
         one(jsgraph.OneConstant()),
         half(jsgraph.Constant(0.5)),
         self(graph.NewNode(common.Int32Constant(0xaabbccdd))),
-        dead(graph.NewNode(common.Dead())) {
+        dead(graph.NewNode(common.DeadControl())) {
     graph.SetEnd(end);
     graph.SetStart(start);
     leaf[0] = zero;
     leaf[1] = one;
     leaf[2] = half;
     leaf[3] = p0;
   }
 
   Isolate* isolate;
   CommonOperatorBuilder common;
@@ skipping 89 matching lines @@
     ReduceGraph();
     CheckInputs(end, expect);
   }
 
   void ReduceBranch(Decision expected, Node* branch) {
     Node* control = branch->InputAt(1);
     for (Node* use : branch->uses()) {
       if (use->opcode() == IrOpcode::kIfTrue) {
         Node* result = ControlReducer::ReduceIfNodeForTesting(&jsgraph, use);
         if (expected == kTrue) CHECK_EQ(control, result);
-        if (expected == kFalse) CHECK_EQ(IrOpcode::kDead, result->opcode());
+        if (expected == kFalse) {
+          CHECK_EQ(IrOpcode::kDeadControl, result->opcode());
+        }
         if (expected == kUnknown) CHECK_EQ(use, result);
       } else if (use->opcode() == IrOpcode::kIfFalse) {
         Node* result = ControlReducer::ReduceIfNodeForTesting(&jsgraph, use);
         if (expected == kFalse) CHECK_EQ(control, result);
-        if (expected == kTrue) CHECK_EQ(IrOpcode::kDead, result->opcode());
+        if (expected == kTrue) {
+          CHECK_EQ(IrOpcode::kDeadControl, result->opcode());
+        }
         if (expected == kUnknown) CHECK_EQ(use, result);
       } else {
         UNREACHABLE();
       }
     }
   }
 
   Node* Return(Node* val, Node* effect, Node* control) {
     Node* ret = graph.NewNode(common.Return(), val, effect, control);
     end->ReplaceInput(0, ret);
@@ skipping 582 matching lines @@
 
     for (int i = 0; i < kSelectorSize; i++) {  // set up dead merge inputs.
       if (!selector.is_selected(i)) merge->ReplaceInput(i, R.dead);
     }
 
     Node* result = ControlReducer::ReduceMerge(&R.jsgraph, merge);
 
     int count = selector.count;
     if (count == 0) {
       // result should be dead.
-      CHECK_EQ(IrOpcode::kDead, result->opcode());
+      CHECK_EQ(IrOpcode::kDeadControl, result->opcode());
     } else if (count == 1) {
       // merge should be replaced with one of the controls.
       CHECK_EQ(controls[selector.single_index()], result);
       // Phis should have been directly replaced.
       CHECK_EQ(values[selector.single_index()], phi_use->InputAt(0));
       CHECK_EQ(effects[selector.single_index()], ephi_use->InputAt(0));
     } else {
       // Otherwise, nodes should be edited in place.
       CHECK_EQ(merge, result);
       selector.CheckNode(merge, IrOpcode::kMerge, controls, NULL);
@@ skipping 598 matching lines @@
 
   R.ReduceGraph();  // d1 gets folded true.
 
   CheckInputs(ret, y2, R.start, R.start);
 
   DeadChecker dead(&R.graph);
   dead.Check(d1);
   dead.Check(d2);
   dead.Check(d3);
 }