58   Node* n2 = graph.NewNode(&dummy_operator, graph.start());  in TEST()  local
59   Node* n3 = graph.NewNode(&dummy_operator, n2);  in TEST()
60   Node* n4 = graph.NewNode(&dummy_operator, n2, n3);  in TEST()
61   Node* n5 = graph.NewNode(&dummy_operator, n4, n2);  in TEST()
69   CHECK(n2->id() == node_visitor.nodes_[1]->id());  in TEST()
78   Node* n2 = graph.NewNode(&dummy_operator, graph.start());  in TEST()  local
79   Node* n3 = graph.NewNode(&dummy_operator, n2);  in TEST()
80   Node* n4 = graph.NewNode(&dummy_operator, n2, n3);  in TEST()
81   Node* n5 = graph.NewNode(&dummy_operator, n4, n2);  in TEST()
89   CHECK(n2->id() == node_visitor.nodes_[2]->id());  in TEST()
97   Node* n2 = graph.NewNode(&dummy_operator, graph.start());  in TEST()  local
99   Node* n4 = graph.NewNode(&dummy_operator, n2);  in TEST()
100   Node* n5 = graph.NewNode(&dummy_operator, n2);  in TEST()
101   Node* n6 = graph.NewNode(&dummy_operator, n2);  in TEST()
115   CHECK(n2->id() == node_visitor.nodes_[4]->id());  in TEST()
124   Node* n2 = graph.NewNode(&dummy_operator, graph.start());  in TEST()  local
126   Node* n4 = graph.NewNode(&dummy_operator, n2);  in TEST()
127   Node* n5 = graph.NewNode(&dummy_operator, n2);  in TEST()
149   CHECK(n2->id() == node_visitor.nodes_[7]->id());  in TEST()
161   Node* n2 = graph.NewNode(&dummy_operator, n1);  in TEST()  local
162   n0->AppendInput(graph.main_zone(), n2);  in TEST()
164   graph.SetEnd(n2);  in TEST()
172   CHECK(n2->id() == node_visitor.nodes_[2]->id());  in TEST()
220   Node* n2 = graph.NewNode(&dummy_operator, n0);  in TEST()  local
221   Node* n3 = graph.NewNode(&dummy_operator, n2);  in TEST()
242   CHECK(n2->id() == visitor.edges_[2].second);  in TEST()
243   CHECK(n2->id() == visitor.nodes_[2]);  in TEST()
244   CHECK(n2->id() == visitor.edges_[3].first);  in TEST()
259   CHECK(n2->id() == visitor.edges_[7].second);  in TEST()
260   CHECK(n2->id() == visitor.nodes_[7]);  in TEST()
261   CHECK(n2->id() == visitor.edges_[8].first);  in TEST()
272   CHECK(-n2->id() == visitor.edges_[11].first);  in TEST()
273   CHECK(-n2->id() == visitor.nodes_[11]);  in TEST()
274   CHECK(-n2->id() == visitor.edges_[12].second);  in TEST()
293   CHECK(-n2->id() == visitor.edges_[18].first);  in TEST()
294   CHECK(-n2->id() == visitor.nodes_[18]);  in TEST()
295   CHECK(-n2->id() == visitor.edges_[19].second);  in TEST()
314   Node* n2 = graph.NewNode(&dummy_operator, graph.start());  in TEST()  local
316   Node* n4 = graph.NewNode(&dummy_operator, n2);  in TEST()
317   Node* n5 = graph.NewNode(&dummy_operator, n2);  in TEST()