[turbolizer] Visualize also the dead nodes.

src/compiler/store-store-elimination.cc

 // Copyright 2016 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/store-store-elimination.h"
 
 #include "src/compiler/all-nodes.h"
 #include "src/compiler/js-graph.h"
 #include "src/compiler/node-properties.h"
 #include "src/compiler/simplified-operator.h"
@@ skipping 112 matching lines @@
   //
   // Because the elimination removes nodes from the graph, even remove nodes
   // that the elimination was not invoked on, we cannot use a normal
   // AdvancedReducer but we manually find which nodes to invoke the
   // elimination on. Then in a next step, we invoke the elimination for each
   // node that was eligible.
 
   NodeVector eligible(temp_zone());  // loops over all nodes
   AllNodes all(temp_zone(), jsgraph()->graph());
 
-  for (Node* node : all.live) {
+  for (Node* node : all.reachable) {
     if (IsEligibleNode(node)) {
       eligible.push_back(node);
     }
   }
 
   for (Node* node : eligible) {
     ReduceEligibleNode(node);
   }
 }
 
@@ skipping 168 matching lines @@
     current_node = previous;
   } while (current_node != nullptr &&
            current_node->op()->opcode() == IrOpcode::kStoreField);
 
   TRACE("finished");
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8