159   Node* n0 = graph.start_node();  in TEST()  local
160   Node* n1 = graph.NewNode(&dummy_operator, n0);  in TEST()
162   n0->AppendInput(graph.main_zone(), n2);  in TEST()
163   graph.SetStart(n0);  in TEST()
170   CHECK(n0->id() == node_visitor.nodes_[0]->id());  in TEST()
218   Node* n0 = graph.start_node();  in TEST()  local
219   Node* n1 = graph.NewNode(&dummy_operator, n0);  in TEST()
220   Node* n2 = graph.NewNode(&dummy_operator, n0);  in TEST()
222   Node* n4 = graph.NewNode(&dummy_operator, n0);  in TEST()
224   n0->AppendInput(graph.main_zone(), n3);  in TEST()
225   graph.SetStart(n0);  in TEST()
234   CHECK(n0->id() == visitor.nodes_[0]);  in TEST()
235   CHECK(n0->id() == visitor.edges_[0].first);  in TEST()
240   CHECK(-n0->id() == visitor.edges_[1].first);  in TEST()
241   CHECK(n0->id() == visitor.edges_[2].first);  in TEST()
249   CHECK(n0->id() == visitor.edges_[4].second);  in TEST()
250   CHECK(n0->id() == visitor.nodes_[4]);  in TEST()
251   CHECK(n0->id() == visitor.edges_[5].first);  in TEST()
257   CHECK(-n0->id() == visitor.edges_[6].first);  in TEST()
258   CHECK(n0->id() == visitor.edges_[7].first);  in TEST()
265   CHECK(n0->id() == visitor.edges_[9].second);  in TEST()
266   CHECK(n0->id() == visitor.nodes_[9]);  in TEST()
268   CHECK(-n0->id() == visitor.edges_[10].second);  in TEST()
275   CHECK(-n0->id() == visitor.edges_[12].first);  in TEST()
276   CHECK(n0->id() == visitor.edges_[13].first);  in TEST()
287   CHECK(-n0->id() == visitor.edges_[16].first);  in TEST()
288   CHECK(-n0->id() == visitor.nodes_[16]);  in TEST()
289   CHECK(-n0->id() == visitor.edges_[17].second);  in TEST()
296   CHECK(-n0->id() == visitor.edges_[19].first);  in TEST()
298   CHECK(n0->id() == visitor.edges_[20].first);  in TEST()
307   CHECK(-n0->id() == visitor.edges_[23].first);  in TEST()
308   CHECK(-n0->id() == visitor.nodes_[21]);  in TEST()