commit 4a90d5fbbb6802c59093b866f3478a814bf02b95
author Ben Murdoch <benm@google.com> Tue Mar 22 12:00:34 2016 +0000
committer Dirk Vogt <dirk@fairphone.com> Fri Mar 17 16:05:42 2017 +0100
tree 486867e3a04e7f17454c94a4c97891bb0e237f1f
parent 3821a70061b1b2077ee51c70eda717bddac94f58

Upgrade V8 to version 4.9.385.28

https://chromium.googlesource.com/v8/v8/+/4.9.385.28

FPIIM-449

Change-Id: I4b2e74289d4bf3667f2f3dc8aa2e541f63e26eb4

test/cctest/compiler/test-graph-visualizer.cc

diff --git a/test/cctest/compiler/test-graph-visualizer.cc b/test/cctest/compiler/test-graph-visualizer.cc
index ce3e6b7..48be46c 100644
--- a/test/cctest/compiler/test-graph-visualizer.cc
+++ b/test/cctest/compiler/test-graph-visualizer.cc
@@ -2,9 +2,6 @@
 // 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/compiler/common-operator.h"
 #include "src/compiler/graph.h"
 #include "src/compiler/graph-visualizer.h"
@@ -14,10 +11,19 @@
 #include "src/compiler/operator.h"
 #include "src/compiler/schedule.h"
 #include "src/compiler/scheduler.h"
+#include "src/compiler/source-position.h"
 #include "src/compiler/verifier.h"
+#include "test/cctest/cctest.h"
 
-using namespace v8::internal;
-using namespace v8::internal::compiler;
+namespace v8 {
+namespace internal {
+namespace compiler {
+
+static Operator dummy_operator1(IrOpcode::kParameter, Operator::kNoWrite,
+                                "dummy", 1, 0, 0, 1, 0, 0);
+static Operator dummy_operator6(IrOpcode::kParameter, Operator::kNoWrite,
+                                "dummy", 6, 0, 0, 1, 0, 0);
+
 
 TEST(NodeWithNullInputReachableFromEnd) {
   HandleAndZoneScope scope;
@@ -27,13 +33,14 @@
   Node* start = graph.NewNode(common.Start(0));
   graph.SetStart(start);
   Node* k = graph.NewNode(common.Int32Constant(0));
-  Node* phi = graph.NewNode(common.Phi(kMachAnyTagged, 1), k, start);
+  Node* phi =
+      graph.NewNode(common.Phi(MachineRepresentation::kTagged, 1), k, start);
   phi->ReplaceInput(0, NULL);
   graph.SetEnd(phi);
 
   OFStream os(stdout);
-  os << AsDOT(graph);
-  os << AsJSON(graph);
+  SourcePositionTable table(&graph);
+  os << AsJSON(graph, &table);
 }
 
 
@@ -45,13 +52,14 @@
   Node* start = graph.NewNode(common.Start(0));
   graph.SetStart(start);
   Node* k = graph.NewNode(common.Int32Constant(0));
-  Node* phi = graph.NewNode(common.Phi(kMachAnyTagged, 1), k, start);
+  Node* phi =
+      graph.NewNode(common.Phi(MachineRepresentation::kTagged, 1), k, start);
   phi->ReplaceInput(1, NULL);
   graph.SetEnd(phi);
 
   OFStream os(stdout);
-  os << AsDOT(graph);
-  os << AsJSON(graph);
+  SourcePositionTable table(&graph);
+  os << AsJSON(graph, &table);
 }
 
 
@@ -63,13 +71,14 @@
   Node* start = graph.NewNode(common.Start(0));
   graph.SetStart(start);
   Node* k = graph.NewNode(common.Int32Constant(0));
-  Node* phi = graph.NewNode(common.Phi(kMachAnyTagged, 1), k, start);
+  Node* phi =
+      graph.NewNode(common.Phi(MachineRepresentation::kTagged, 1), k, start);
   phi->ReplaceInput(0, NULL);
   graph.SetEnd(start);
 
   OFStream os(stdout);
-  os << AsDOT(graph);
-  os << AsJSON(graph);
+  SourcePositionTable table(&graph);
+  os << AsJSON(graph, &table);
 }
 
 
@@ -85,6 +94,37 @@
   graph.SetEnd(merge);
 
   OFStream os(stdout);
-  os << AsDOT(graph);
-  os << AsJSON(graph);
+  SourcePositionTable table(&graph);
+  os << AsJSON(graph, &table);
 }
+
+
+TEST(NodeNetworkOfDummiesReachableFromEnd) {
+  HandleAndZoneScope scope;
+  Graph graph(scope.main_zone());
+  CommonOperatorBuilder common(scope.main_zone());
+
+  Node* start = graph.NewNode(common.Start(0));
+  graph.SetStart(start);
+  Node* n2 = graph.NewNode(&dummy_operator1, graph.start());
+  Node* n3 = graph.NewNode(&dummy_operator1, graph.start());
+  Node* n4 = graph.NewNode(&dummy_operator1, n2);
+  Node* n5 = graph.NewNode(&dummy_operator1, n2);
+  Node* n6 = graph.NewNode(&dummy_operator1, n3);
+  Node* n7 = graph.NewNode(&dummy_operator1, n3);
+  Node* n8 = graph.NewNode(&dummy_operator1, n5);
+  Node* n9 = graph.NewNode(&dummy_operator1, n5);
+  Node* n10 = graph.NewNode(&dummy_operator1, n9);
+  Node* n11 = graph.NewNode(&dummy_operator1, n9);
+  Node* end_dependencies[6] = {n4, n8, n10, n11, n6, n7};
+  Node* end = graph.NewNode(&dummy_operator6, 6, end_dependencies);
+  graph.SetEnd(end);
+
+  OFStream os(stdout);
+  SourcePositionTable table(&graph);
+  os << AsJSON(graph, &table);
+}
+
+}  // namespace compiler
+}  // namespace internal
+}  // namespace v8