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