test-graph-visualizer.cc 4.08 KB
Newer Older
1 2 3 4
// 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.

5 6 7
// TODO(jochen): Remove this after the setting is turned on globally.
#define V8_IMMINENT_DEPRECATION_WARNINGS

8 9 10 11 12 13 14 15 16
#include "src/compiler/common-operator.h"
#include "src/compiler/graph.h"
#include "src/compiler/graph-visualizer.h"
#include "src/compiler/js-operator.h"
#include "src/compiler/machine-operator.h"
#include "src/compiler/node.h"
#include "src/compiler/operator.h"
#include "src/compiler/schedule.h"
#include "src/compiler/scheduler.h"
danno's avatar
danno committed
17
#include "src/compiler/source-position.h"
18
#include "src/compiler/verifier.h"
19
#include "test/cctest/cctest.h"
20

21 22 23
namespace v8 {
namespace internal {
namespace compiler {
24

25 26 27 28
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);
29 30


31 32 33 34 35 36 37 38 39 40 41 42 43 44
TEST(NodeWithNullInputReachableFromEnd) {
  HandleAndZoneScope scope;
  Graph graph(scope.main_zone());
  CommonOperatorBuilder common(scope.main_zone());

  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);
  phi->ReplaceInput(0, NULL);
  graph.SetEnd(phi);

  OFStream os(stdout);
  os << AsDOT(graph);
danno's avatar
danno committed
45 46
  SourcePositionTable table(&graph);
  os << AsJSON(graph, &table);
47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63
}


TEST(NodeWithNullControlReachableFromEnd) {
  HandleAndZoneScope scope;
  Graph graph(scope.main_zone());
  CommonOperatorBuilder common(scope.main_zone());

  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);
  phi->ReplaceInput(1, NULL);
  graph.SetEnd(phi);

  OFStream os(stdout);
  os << AsDOT(graph);
danno's avatar
danno committed
64 65
  SourcePositionTable table(&graph);
  os << AsJSON(graph, &table);
66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82
}


TEST(NodeWithNullInputReachableFromStart) {
  HandleAndZoneScope scope;
  Graph graph(scope.main_zone());
  CommonOperatorBuilder common(scope.main_zone());

  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);
  phi->ReplaceInput(0, NULL);
  graph.SetEnd(start);

  OFStream os(stdout);
  os << AsDOT(graph);
danno's avatar
danno committed
83 84
  SourcePositionTable table(&graph);
  os << AsJSON(graph, &table);
85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
}


TEST(NodeWithNullControlReachableFromStart) {
  HandleAndZoneScope scope;
  Graph graph(scope.main_zone());
  CommonOperatorBuilder common(scope.main_zone());

  Node* start = graph.NewNode(common.Start(0));
  graph.SetStart(start);
  Node* merge = graph.NewNode(common.Merge(2), start, start);
  merge->ReplaceInput(1, NULL);
  graph.SetEnd(merge);

  OFStream os(stdout);
  os << AsDOT(graph);
danno's avatar
danno committed
101 102
  SourcePositionTable table(&graph);
  os << AsJSON(graph, &table);
103
}
104 105 106 107 108 109 110 111 112


TEST(NodeNetworkOfDummiesReachableFromEnd) {
  HandleAndZoneScope scope;
  Graph graph(scope.main_zone());
  CommonOperatorBuilder common(scope.main_zone());

  Node* start = graph.NewNode(common.Start(0));
  graph.SetStart(start);
113 114 115 116 117 118 119 120 121 122
  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);
123
  Node* end_dependencies[6] = {n4, n8, n10, n11, n6, n7};
124
  Node* end = graph.NewNode(&dummy_operator6, 6, end_dependencies);
125 126 127 128 129 130 131
  graph.SetEnd(end);

  OFStream os(stdout);
  os << AsDOT(graph);
  SourcePositionTable table(&graph);
  os << AsJSON(graph, &table);
}
132 133 134 135

}  // namespace compiler
}  // namespace internal
}  // namespace v8