[turbofan] Proper dead code elimination as regular reducer.

test/cctest/compiler/test-loop-analysis.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 "src/compiler/access-builder.h"
 #include "src/compiler/common-operator.h"
 #include "src/compiler/graph.h"
 #include "src/compiler/graph-visualizer.h"
@@ skipping 29 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.DeadControl())),
+        dead(graph.NewNode(common.Dead())),
         loop_tree(NULL) {
     graph.SetEnd(end);
     graph.SetStart(start);
     leaf[0] = zero;
     leaf[1] = one;
     leaf[2] = half;
     leaf[3] = p0;
   }
 
   Isolate* isolate;
@@ skipping 945 matching lines @@
 TEST(LaManyNested_31) { RunManyNestedLoops_i(31); }
 TEST(LaManyNested_32) { RunManyNestedLoops_i(32); }
 TEST(LaManyNested_33) { RunManyNestedLoops_i(33); }
 TEST(LaManyNested_34) { RunManyNestedLoops_i(34); }
 TEST(LaManyNested_62) { RunManyNestedLoops_i(62); }
 TEST(LaManyNested_63) { RunManyNestedLoops_i(63); }
 TEST(LaManyNested_64) { RunManyNestedLoops_i(64); }
 
 
 TEST(LaPhiTangle) { LoopFinderTester t; }