Cross Reference: /external/v8/test/cctest/compiler/test-node-algorithm.cc

Lines Matching refs:graph
9 #include "graph-tester.h"
13 #include "src/compiler/graph.h"
14 #include "src/compiler/graph-inl.h"
15 #include "src/compiler/graph-visualizer.h"
47   GraphWithStartNodeTester graph;
50   graph.VisitNodeUsesFromStart(&node_visitor);
57   GraphWithStartNodeTester graph;
58   Node* n2 = graph.NewNode(&dummy_operator, graph.start());
59   Node* n3 = graph.NewNode(&dummy_operator, n2);
60   Node* n4 = graph.NewNode(&dummy_operator, n2, n3);
61   Node* n5 = graph.NewNode(&dummy_operator, n4, n2);
62   graph.SetEnd(n5);
65   graph.VisitNodeUsesFromStart(&node_visitor);
68   CHECK(graph.start()->id() == node_visitor.nodes_[0]->id());
77   GraphWithStartNodeTester graph;
78   Node* n2 = graph.NewNode(&dummy_operator, graph.start());
79   Node* n3 = graph.NewNode(&dummy_operator, n2);
80   Node* n4 = graph.NewNode(&dummy_operator, n2, n3);
81   Node* n5 = graph.NewNode(&dummy_operator, n4, n2);
82   graph.SetEnd(n5);
85   graph.VisitNodeInputsFromEnd(&node_visitor);
90   CHECK(graph.start()->id() == node_visitor.nodes_[3]->id());
96   GraphWithStartNodeTester graph;
97   Node* n2 = graph.NewNode(&dummy_operator, graph.start());
98   Node* n3 = graph.NewNode(&dummy_operator, graph.start());
99   Node* n4 = graph.NewNode(&dummy_operator, n2);
100   Node* n5 = graph.NewNode(&dummy_operator, n2);
101   Node* n6 = graph.NewNode(&dummy_operator, n2);
102   Node* n7 = graph.NewNode(&dummy_operator, n3);
104   Node* n8 = graph.NewNode(&dummy_operator, 4, end_dependencies);
105   graph.SetEnd(n8);
108   graph.VisitNodeUsesFromStart(&node_visitor);
111   CHECK(graph.end()->id() == node_visitor.nodes_[0]->id());
118   CHECK(graph.start()->id() == node_visitor.nodes_[7]->id());
123   GraphWithStartNodeTester graph;
124   Node* n2 = graph.NewNode(&dummy_operator, graph.start());
125   Node* n3 = graph.NewNode(&dummy_operator, graph.start());
126   Node* n4 = graph.NewNode(&dummy_operator, n2);
127   Node* n5 = graph.NewNode(&dummy_operator, n2);
128   Node* n6 = graph.NewNode(&dummy_operator, n3);
129   Node* n7 = graph.NewNode(&dummy_operator, n3);
130   Node* n8 = graph.NewNode(&dummy_operator, n5);
131   Node* n9 = graph.NewNode(&dummy_operator, n5);
132   Node* n10 = graph.NewNode(&dummy_operator, n9);
133   Node* n11 = graph.NewNode(&dummy_operator, n9);
135   Node* n12 = graph.NewNode(&dummy_operator, 6, end_dependencies);
136   graph.SetEnd(n12);
139   graph.VisitNodeUsesFromStart(&node_visitor);
142   CHECK(graph.end()->id() == node_visitor.nodes_[0]->id());
153   CHECK(graph.start()->id() == node_visitor.nodes_[11]->id());
158   GraphWithStartNodeTester graph;
159   Node* n0 = graph.start_node();
160   Node* n1 = graph.NewNode(&dummy_operator, n0);
161   Node* n2 = graph.NewNode(&dummy_operator, n1);
162   n0->AppendInput(graph.main_zone(), n2);
163   graph.SetStart(n0);
164   graph.SetEnd(n2);
167   graph.VisitNodeUsesFromStart(&node_visitor);
217   GraphWithStartNodeTester graph;
218   Node* n0 = graph.start_node();
219   Node* n1 = graph.NewNode(&dummy_operator, n0);
220   Node* n2 = graph.NewNode(&dummy_operator, n0);
221   Node* n3 = graph.NewNode(&dummy_operator, n2);
222   Node* n4 = graph.NewNode(&dummy_operator, n0);
223   Node* n5 = graph.NewNode(&dummy_operator, n4);
224   n0->AppendInput(graph.main_zone(), n3);
225   graph.SetStart(n0);
226   graph.SetEnd(n5);
229   graph.VisitNodeUsesFromStart(&visitor);
313   GraphWithStartNodeTester graph;
314   Node* n2 = graph.NewNode(&dummy_operator, graph.start());
315   Node* n3 = graph.NewNode(&dummy_operator, graph.start());
316   Node* n4 = graph.NewNode(&dummy_operator, n2);
317   Node* n5 = graph.NewNode(&dummy_operator, n2);
318   Node* n6 = graph.NewNode(&dummy_operator, n3);
319   Node* n7 = graph.NewNode(&dummy_operator, n3);
320   Node* n8 = graph.NewNode(&dummy_operator, n5);
321   Node* n9 = graph.NewNode(&dummy_operator, n5);
322   Node* n10 = graph.NewNode(&dummy_operator, n9);
323   Node* n11 = graph.NewNode(&dummy_operator, n9);
325   Node* n12 = graph.NewNode(&dummy_operator, 6, end_dependencies);
326   graph.SetEnd(n12);
329   os << AsDOT(graph);