Lines Matching refs:n3
123 Node* n3 = graph.NewNode(&dummy_operator, n2);
128 USE(n3);
137 Node* n3 = graph.NewNode(&dummy_operator);
142 n0->ReplaceUses(n3);
143 Node::Uses::iterator i2(n3->uses().begin());
148 CHECK_EQ(n3, *i3);
152 CHECK_EQ(n3, *i4);
162 Node* n3 = graph.NewNode(&dummy_operator);
169 n1->ReplaceUses(n3);
173 Node::Uses::iterator i2(n3->uses().begin());
185 Node* n3 = graph.NewNode(&dummy_operator, n0, n1, n2);
186 Node::Inputs::iterator i1(n3->inputs().begin());
188 CHECK_EQ(n0, n3->InputAt(0));
191 CHECK_EQ(n1, n3->InputAt(1));
194 CHECK_EQ(n2, n3->InputAt(2));
196 CHECK(i1 == n3->inputs().end());
199 CHECK_EQ(n3, *i2);
207 n3->ReplaceInput(1, n4);
213 CHECK_EQ(n3, *i5);
217 Node::Inputs::iterator i6(n3->inputs().begin());
219 CHECK_EQ(n0, n3->InputAt(0));
222 CHECK_EQ(n4, n3->InputAt(1));
225 CHECK_EQ(n2, n3->InputAt(2));
227 CHECK(i6 == n3->inputs().end());
245 Node* n3 = graph.NewNode(&dummy_operator, n0);
247 CHECK(!n0->OwnedBy(n3));
249 CHECK(!n3->OwnedBy(n0));
265 Node* n3 = graph.NewNode(&dummy_operator);
266 n2->ReplaceInput(0, n3);
274 CHECK(n3->OwnedBy(n2));
275 CHECK(!n2->OwnedBy(n3));
292 Node* n3 = graph.NewNode(&dummy_operator, n0);
294 CHECK(n0->UseAt(2) == n3);
304 Node* n3 = graph.NewNode(&dummy_operator, n0, n1, n2);
305 CHECK_EQ(3, n3->InputCount());
306 CHECK(n3->InputAt(0) == n0);
307 CHECK(n3->InputAt(1) == n1);
308 CHECK(n3->InputAt(2) == n2);
310 n3->AppendInput(graph.zone(), n4);
311 CHECK_EQ(4, n3->InputCount());
312 CHECK(n3->InputAt(0) == n0);
313 CHECK(n3->InputAt(1) == n1);
314 CHECK(n3->InputAt(2) == n2);
315 CHECK(n3->InputAt(3) == n4);
317 n3->AppendInput(graph.zone(), n4);
318 CHECK_EQ(5, n3->InputCount());
319 CHECK(n3->InputAt(0) == n0);
320 CHECK(n3->InputAt(1) == n1);
321 CHECK(n3->InputAt(2) == n2);
322 CHECK(n3->InputAt(3) == n4);
323 CHECK(n3->InputAt(4) == n4);
329 CHECK(*current == n3);
335 CHECK(*current == n3);
379 Node* n3 = graph.NewNode(&dummy_operator);
380 n2->AppendInput(graph.zone(), n3);
392 CHECK(*current == n3);
423 Node* n3 = graph.NewNode(&dummy_operator, n0);
424 n3->AppendInput(graph.zone(), n1);
425 n3->AppendInput(graph.zone(), n2);
426 CHECK_EQ(3, n3->InputCount());
428 CHECK(n0 == n3->InputAt(0));
429 CHECK(n1 == n3->InputAt(1));
430 CHECK(n2 == n3->InputAt(2));
432 n3->ReplaceInput(1, NULL);
433 CHECK(n0 == n3->InputAt(0));
434 CHECK(NULL == n3->InputAt(1));
435 CHECK(n2 == n3->InputAt(2));
446 Node* n3 = graph.NewNode(&dummy_operator);
449 CHECK_EQ(0, n3->UseCount());
451 n0->ReplaceUses(n3);
453 CHECK_EQ(3, n3->UseCount());
455 Node::Uses uses(n3->uses());
482 Node* n3 = graph.NewNode(&dummy_operator);
490 CHECK_EQ(0, n3->UseCount());
491 n3->ReplaceUsesIf(FixedPredicate<true>(), n1);
492 CHECK_EQ(0, n3->UseCount());
493 n3->ReplaceUsesIf(FixedPredicate<false>(), n1);
494 CHECK_EQ(0, n3->UseCount());
507 n1->AppendInput(graph.zone(), n3);
508 CHECK_EQ(1, n3->UseCount());
509 n3->ReplaceUsesIf(FixedPredicate<true>(), n1);
511 CHECK_EQ(0, n3->UseCount());
512 n1->ReplaceUsesIf(FixedPredicate<false>(), n3);
514 CHECK_EQ(0, n3->UseCount());
550 Node* n3 = graph.NewNode(&dummy_operator, n0);
551 n3->ReplaceInput(0, n1);
