[turbolizer] Visualize also the dead nodes.

test/cctest/compiler/test-osr.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/codegen.h"
 #include "src/compiler/all-nodes.h"
 #include "src/compiler/common-operator.h"
 #include "src/compiler/diamond.h"
 #include "src/compiler/graph.h"
 #include "src/compiler/js-graph.h"
@@ skipping 102 matching lines @@
   }
 
   void DeconstructOsr() {
     OsrHelper helper(0, 0);
     helper.Deconstruct(&jsgraph, &common, main_zone());
     AllNodes nodes(main_zone(), &graph);
     // Should be edited out.
     CHECK(!nodes.IsLive(osr_normal_entry));
     CHECK(!nodes.IsLive(osr_loop_entry));
     // No dangling nodes should be left over.
-    for (Node* const node : nodes.live) {
+    for (Node* const node : nodes.reachable) {
       for (Node* const use : node->uses()) {
-        CHECK(std::find(nodes.live.begin(), nodes.live.end(), use) !=
-              nodes.live.end());
+        CHECK(std::find(nodes.reachable.begin(), nodes.reachable.end(), use) !=
+              nodes.reachable.end());
       }
     }
   }
 };
 
 
 TEST(Deconstruct_osr0) {
   OsrDeconstructorTester T(0);
 
   Node* loop = T.NewOsrLoop(1);
@@ skipping 429 matching lines @@
   CHECK_EQ(new_loop0_phi, FindSuccessor(new_loop0_loop, IrOpcode::kPhi));
 
   // Check that the return returns the phi from the OSR loop and control
   // depends on the copy of the outer loop0.
   CheckInputs(new_ret, new_loop0_phi, T.graph.start(), new_loop0_exit);
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8