[turbofan] Handle dead diamonds in scheduling and add a test.

src/compiler/graph-visualizer.cc

 // Copyright 2013 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/graph-visualizer.h"
 
 #include <sstream>
 #include <string>
 
 #include "src/code-stubs.h"
@@ skipping 594 matching lines @@
 }
 
 const int kUnvisited = 0;
 const int kOnStack = 1;
 const int kVisited = 2;
 
 std::ostream& operator<<(std::ostream& os, const AsRPO& ar) {
   Zone local_zone;
   ZoneVector<byte> state(ar.graph.NodeCount(), kUnvisited, &local_zone);
   ZoneStack<Node*> stack(&local_zone);
+  ZoneVector<Node*> all(&local_zone);
 
   stack.push(ar.graph.end());
   state[ar.graph.end()->id()] = kOnStack;
   while (!stack.empty()) {
     Node* n = stack.top();
     bool pop = true;
     for (Node* const i : n->inputs()) {
       if (state[i->id()] == kUnvisited) {
         state[i->id()] = kOnStack;
         stack.push(i);
         pop = false;
         break;
       }
     }
     if (pop) {
+      all.push_back(n);
       state[n->id()] = kVisited;
       stack.pop();
       os << "#" << n->id() << ":" << *n->op() << "(";
       int j = 0;
       for (Node* const i : n->inputs()) {
         if (j++ > 0) os << ", ";
         os << "#" << SafeId(i) << ":" << SafeMnemonic(i);
       }
       os << ")" << std::endl;
     }
   }
+
+  bool first = true;
+
+  for (size_t i = 0; i < all.size(); i++) {
+    Node* l = all[i];
+    for (Node* n : l->uses()) {
+      if (state[n->id()] == kUnvisited) {
+        state[n->id()] = kVisited;
+        all.push_back(n);
+        if (first) {
+          os << "Gray nodes:" << std::endl;
+          first = false;
+        }
+        os << "#" << n->id() << ":" << *n->op() << "(";
+        int j = 0;
+        for (Node* const i : n->inputs()) {
+          if (j++ > 0) os << ", ";
+          os << "#" << SafeId(i) << ":" << SafeMnemonic(i);
+        }
+        os << ")" << std::endl;
+      }
+    }
+  }
   return os;
 }
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8