Lines Matching refs:n3
59 Node* n3 = graph.NewNode(&dummy_operator, n2);
60 Node* n4 = graph.NewNode(&dummy_operator, n2, n3);
70 CHECK(n3->id() == node_visitor.nodes_[2]->id());
79 Node* n3 = graph.NewNode(&dummy_operator, n2);
80 Node* n4 = graph.NewNode(&dummy_operator, n2, n3);
91 CHECK(n3->id() == node_visitor.nodes_[4]->id());
98 Node* n3 = graph.NewNode(&dummy_operator, graph.start());
102 Node* n7 = graph.NewNode(&dummy_operator, n3);
117 CHECK(n3->id() == node_visitor.nodes_[6]->id());
125 Node* n3 = graph.NewNode(&dummy_operator, graph.start());
128 Node* n6 = graph.NewNode(&dummy_operator, n3);
129 Node* n7 = graph.NewNode(&dummy_operator, n3);
152 CHECK(n3->id() == node_visitor.nodes_[10]->id());
221 Node* n3 = graph.NewNode(&dummy_operator, n2);
224 n0->AppendInput(graph.main_zone(), n3);
245 CHECK(n3->id() == visitor.edges_[3].second);
246 CHECK(n3->id() == visitor.nodes_[3]);
248 CHECK(n3->id() == visitor.edges_[4].first);
262 CHECK(n3->id() == visitor.edges_[8].second);
263 CHECK(n3->id() == visitor.nodes_[8]);
264 CHECK(n3->id() == visitor.edges_[9].first);
269 CHECK(-n3->id() == visitor.edges_[10].first);
270 CHECK(-n3->id() == visitor.nodes_[10]);
271 CHECK(-n3->id() == visitor.edges_[11].second);
290 CHECK(-n3->id() == visitor.edges_[17].first);
291 CHECK(-n3->id() == visitor.nodes_[17]);
292 CHECK(-n3->id() == visitor.edges_[18].second);
315 Node* n3 = graph.NewNode(&dummy_operator, graph.start());
318 Node* n6 = graph.NewNode(&dummy_operator, n3);
319 Node* n7 = graph.NewNode(&dummy_operator, n3);
