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