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