Lines Matching refs:n2
148 Node* n2 = graph.NewNode(&dummy_operator1, n0); in TEST() local
151 CHECK_USES(n0, n1, n2); in TEST()
154 CHECK_INPUTS(n2, n0); in TEST()
160 CHECK_USES(n2, NONE); in TEST()
161 CHECK_USES(n3, n1, n2); in TEST()
164 CHECK_INPUTS(n2, n3); in TEST()
182 Node* n2 = graph.NewNode(&dummy_operator0); in TEST() local
184 n1->ReplaceUses(n2); in TEST()
188 CHECK_USES(n2, n1); in TEST()
197 Node* n2 = graph.NewNode(&dummy_operator0); in TEST() local
198 Node* n3 = graph.NewNode(&dummy_operator3, n0, n1, n2); in TEST()
203 CHECK_USES(n2, n3); in TEST()
207 CHECK_INPUTS(n3, n0, n1, n2); in TEST()
214 CHECK_INPUTS(n3, n0, n4, n2); in TEST()
229 Node* n2 = graph.NewNode(&dummy_operator1, n0); in TEST() local
230 CHECK(n0->OwnedBy(n2)); in TEST()
231 CHECK(!n2->OwnedBy(n0)); in TEST()
234 CHECK(!n0->OwnedBy(n2)); in TEST()
236 CHECK(!n2->OwnedBy(n0)); in TEST()
245 Node* n2 = graph.NewNode(&dummy_operator1, n0); in TEST() local
247 CHECK(!n0->OwnedBy(n2)); in TEST()
249 CHECK(!n1->OwnedBy(n2)); in TEST()
250 CHECK(!n2->OwnedBy(n0)); in TEST()
251 CHECK(!n2->OwnedBy(n1)); in TEST()
254 n2->ReplaceInput(0, n3); in TEST()
259 CHECK(!n1->OwnedBy(n2)); in TEST()
260 CHECK(!n2->OwnedBy(n0)); in TEST()
261 CHECK(!n2->OwnedBy(n1)); in TEST()
262 CHECK(n3->OwnedBy(n2)); in TEST()
263 CHECK(!n2->OwnedBy(n3)); in TEST()
278 Node* n2 = graph.NewNode(&dummy_operator1, n0); in TEST() local
280 CHECK_USES(n0, n1, n2); in TEST()
281 CHECK_USES(n2, NONE); in TEST()
285 CHECK_USES(n0, n1, n2, n3); in TEST()
296 Node* n2 = graph.NewNode(&dummy_operator1, n0); in TEST() local
297 Node* n3 = graph.NewNode(&dummy_operator3, n0, n1, n2); in TEST()
299 CHECK_INPUTS(n3, n0, n1, n2); in TEST()
301 Node* n4 = graph.NewNode(&dummy_operator3, n0, n1, n2); in TEST()
304 CHECK_INPUTS(n3, n0, n1, n2, n4); in TEST()
309 CHECK_INPUTS(n3, n0, n1, n2, n4, n4); in TEST()
324 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); in TEST() local
328 CHECK_INPUTS(n2, n0, n1); in TEST()
329 CHECK_USES(n0, n1, n2); in TEST()
333 CHECK_USES(n0, n2); in TEST()
335 n2->RemoveInput(0); in TEST()
336 CHECK_INPUTS(n2, n1); in TEST()
338 CHECK_USES(n1, n2); in TEST()
340 n2->RemoveInput(0); in TEST()
341 CHECK_INPUTS(n2, NONE); in TEST()
344 CHECK_USES(n2, NONE); in TEST()
354 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); in TEST() local
358 CHECK_INPUTS(n2, n0, n1); in TEST()
359 CHECK_USES(n0, n1, n2); in TEST()
363 n2->AppendInput(graph.zone(), n3); in TEST()
365 CHECK_INPUTS(n2, n0, n1, n3); in TEST()
366 CHECK_USES(n3, n2); in TEST()
376 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); in TEST() local
380 CHECK_INPUTS(n2, n0, n1); in TEST()
381 CHECK_USES(n0, n1, n2); in TEST()
383 n2->ReplaceInput(0, nullptr); in TEST()
385 CHECK_INPUTS(n2, NULL, n1); in TEST()
389 n2->ReplaceInput(1, nullptr); in TEST()
391 CHECK_INPUTS(n2, NULL, NULL); in TEST()
403 Node* n2 = graph.NewNode(&dummy_operator1, n0); in TEST() local
406 n3->AppendInput(graph.zone(), n2); in TEST()
408 CHECK_INPUTS(n3, n0, n1, n2); in TEST()
409 CHECK_USES(n0, n1, n2, n3); in TEST()
411 CHECK_USES(n2, n3); in TEST()
416 CHECK_INPUTS(n3, n0, NULL, n2); in TEST()
426 Node* n2 = graph.NewNode(&dummy_operator1, n0); in TEST() local
429 CHECK_INPUTS(n2, n0); in TEST()
431 n2->AppendInput(graph.zone(), n1); in TEST()
432 CHECK_INPUTS(n2, n0, n1); in TEST()
433 CHECK_USES(n1, n2); in TEST()
435 n2->AppendInput(graph.zone(), n0); in TEST()
436 CHECK_INPUTS(n2, n0, n1, n0); in TEST()
437 CHECK_USES(n1, n2); in TEST()
438 CHECK_USES(n0, n2, n1, n2); in TEST()
443 CHECK_INPUTS(n2, n3, n1, n3); in TEST()
444 CHECK_USES(n3, n2, n1, n2); in TEST()
454 Node* n2 = graph.NewNode(&dummy_operator1, n0); in TEST() local
455 n2->ReplaceInput(0, n1); in TEST()
489 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); in TEST() local
490 n2->TrimInputCount(2); in TEST()
491 CHECK_INPUTS(n2, n0, n1); in TEST()
492 CHECK_USES(n0, n2); in TEST()
493 CHECK_USES(n1, n2); in TEST()
499 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); in TEST() local
500 n2->TrimInputCount(1); in TEST()
501 CHECK_INPUTS(n2, n0); in TEST()
502 CHECK_USES(n0, n2); in TEST()
509 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); in TEST() local
510 n2->TrimInputCount(0); in TEST()
511 CHECK_INPUTS(n2, NONE); in TEST()
518 Node* n2 = graph.NewNode(&dummy_operator2, n0, n0); in TEST() local
519 n2->TrimInputCount(1); in TEST()
520 CHECK_INPUTS(n2, n0); in TEST()
521 CHECK_USES(n0, n2); in TEST()
526 Node* n2 = graph.NewNode(&dummy_operator2, n0, n0); in TEST() local
527 n2->TrimInputCount(0); in TEST()
528 CHECK_INPUTS(n2, NONE); in TEST()
563 Node* n2 = graph.NewNode(&dummy_operator0); in TEST() local
564 n2->AppendInput(graph.zone(), n0); in TEST()
565 n2->AppendInput(graph.zone(), n1); in TEST()
566 CHECK_INPUTS(n2, n0, n1); in TEST()
567 n2->TrimInputCount(2); in TEST()
568 CHECK_INPUTS(n2, n0, n1); in TEST()
569 CHECK_USES(n0, n2); in TEST()
570 CHECK_USES(n1, n2); in TEST()
571 CHECK_USES(n2, NONE); in TEST()
577 Node* n2 = graph.NewNode(&dummy_operator0); in TEST() local
578 n2->AppendInput(graph.zone(), n0); in TEST()
579 n2->AppendInput(graph.zone(), n1); in TEST()
580 CHECK_INPUTS(n2, n0, n1); in TEST()
581 n2->TrimInputCount(1); in TEST()
582 CHECK_INPUTS(n2, n0); in TEST()
583 CHECK_USES(n0, n2); in TEST()
585 CHECK_USES(n2, NONE); in TEST()
591 Node* n2 = graph.NewNode(&dummy_operator0); in TEST() local
592 n2->AppendInput(graph.zone(), n0); in TEST()
593 n2->AppendInput(graph.zone(), n1); in TEST()
594 CHECK_INPUTS(n2, n0, n1); in TEST()
595 n2->TrimInputCount(0); in TEST()
596 CHECK_INPUTS(n2, NONE); in TEST()
599 CHECK_USES(n2, NONE); in TEST()
604 Node* n2 = graph.NewNode(&dummy_operator0); in TEST() local
605 n2->AppendInput(graph.zone(), n0); in TEST()
606 n2->AppendInput(graph.zone(), n0); in TEST()
607 CHECK_INPUTS(n2, n0, n0); in TEST()
608 CHECK_USES(n0, n2, n2); in TEST()
609 n2->TrimInputCount(1); in TEST()
610 CHECK_INPUTS(n2, n0); in TEST()
611 CHECK_USES(n0, n2); in TEST()
616 Node* n2 = graph.NewNode(&dummy_operator0); in TEST() local
617 n2->AppendInput(graph.zone(), n0); in TEST()
618 n2->AppendInput(graph.zone(), n0); in TEST()
619 CHECK_INPUTS(n2, n0, n0); in TEST()
620 CHECK_USES(n0, n2, n2); in TEST()
621 n2->TrimInputCount(0); in TEST()
622 CHECK_INPUTS(n2, NONE); in TEST()
635 Node* n2 = graph.NewNode(&dummy_operator1, n0); in TEST() local
636 n2->AppendInput(graph.zone(), n1); in TEST()
637 CHECK_INPUTS(n2, n0, n1); in TEST()
638 n2->TrimInputCount(2); in TEST()
639 CHECK_INPUTS(n2, n0, n1); in TEST()
640 CHECK_USES(n0, n2); in TEST()
641 CHECK_USES(n1, n2); in TEST()
642 CHECK_USES(n2, NONE); in TEST()
648 Node* n2 = graph.NewNode(&dummy_operator1, n0); in TEST() local
649 n2->AppendInput(graph.zone(), n1); in TEST()
650 CHECK_INPUTS(n2, n0, n1); in TEST()
651 n2->TrimInputCount(1); in TEST()
652 CHECK_INPUTS(n2, n0); in TEST()
653 CHECK_USES(n0, n2); in TEST()
655 CHECK_USES(n2, NONE); in TEST()
661 Node* n2 = graph.NewNode(&dummy_operator1, n0); in TEST() local
662 n2->AppendInput(graph.zone(), n1); in TEST()
663 CHECK_INPUTS(n2, n0, n1); in TEST()
664 n2->TrimInputCount(0); in TEST()
665 CHECK_INPUTS(n2, NONE); in TEST()
668 CHECK_USES(n2, NONE); in TEST()
673 Node* n2 = graph.NewNode(&dummy_operator1, n0); in TEST() local
674 n2->AppendInput(graph.zone(), n0); in TEST()
675 CHECK_INPUTS(n2, n0, n0); in TEST()
676 CHECK_USES(n0, n2, n2); in TEST()
677 n2->TrimInputCount(1); in TEST()
678 CHECK_INPUTS(n2, n0); in TEST()
679 CHECK_USES(n0, n2); in TEST()
680 CHECK_USES(n2, NONE); in TEST()
685 Node* n2 = graph.NewNode(&dummy_operator1, n0); in TEST() local
686 n2->AppendInput(graph.zone(), n0); in TEST()
687 CHECK_EQ(2, n2->InputCount()); in TEST()
689 n2->TrimInputCount(0); in TEST()
690 CHECK_EQ(0, n2->InputCount()); in TEST()
692 CHECK_EQ(0, n2->UseCount()); in TEST()
704 Node* n2; in TEST() local
706 n2 = graph.NewNode(&dummy_operator2, n0, n1); in TEST()
707 CHECK_INPUTS(n2, n0, n1); in TEST()
709 n2 = graph.NewNode(&dummy_operator1, n0); in TEST()
710 CHECK_INPUTS(n2, n0); in TEST()
711 n2->AppendInput(graph.zone(), n1); // with out-of-line input. in TEST()
712 CHECK_INPUTS(n2, n0, n1); in TEST()
718 CHECK_USES(n0, n1, n2); in TEST()
721 CHECK_INPUTS(n2, n0, n1); in TEST()
722 CHECK_USES(n0, n2); in TEST()
724 n2->NullAllInputs(); in TEST()
726 CHECK_INPUTS(n2, NULL, NULL); in TEST()