Lines Matching refs:n2

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);
69 CHECK(n2->id() == node_visitor.nodes_[1]->id());
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);
89 CHECK(n2->id() == node_visitor.nodes_[2]->id());
97 Node* n2 = 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);
115 CHECK(n2->id() == node_visitor.nodes_[4]->id());
124 Node* n2 = graph.NewNode(&dummy_operator, graph.start());
126 Node* n4 = graph.NewNode(&dummy_operator, n2);
127 Node* n5 = graph.NewNode(&dummy_operator, n2);
149 CHECK(n2->id() == node_visitor.nodes_[7]->id());
161 Node* n2 = graph.NewNode(&dummy_operator, n1);
162 n0->AppendInput(graph.main_zone(), n2);
164 graph.SetEnd(n2);
172 CHECK(n2->id() == node_visitor.nodes_[2]->id());
220 Node* n2 = graph.NewNode(&dummy_operator, n0);
221 Node* n3 = graph.NewNode(&dummy_operator, n2);
242 CHECK(n2->id() == visitor.edges_[2].second);
243 CHECK(n2->id() == visitor.nodes_[2]);
244 CHECK(n2->id() == visitor.edges_[3].first);
259 CHECK(n2->id() == visitor.edges_[7].second);
260 CHECK(n2->id() == visitor.nodes_[7]);
261 CHECK(n2->id() == visitor.edges_[8].first);
272 CHECK(-n2->id() == visitor.edges_[11].first);
273 CHECK(-n2->id() == visitor.nodes_[11]);
274 CHECK(-n2->id() == visitor.edges_[12].second);
293 CHECK(-n2->id() == visitor.edges_[18].first);
294 CHECK(-n2->id() == visitor.nodes_[18]);
295 CHECK(-n2->id() == visitor.edges_[19].second);
314 Node* n2 = graph.NewNode(&dummy_operator, graph.start());
316 Node* n4 = graph.NewNode(&dummy_operator, n2);
317 Node* n5 = graph.NewNode(&dummy_operator, n2);