Lines Matching refs:n1
148 Node* n1 = graph.NewNode(&dummy_operator1, n0);
152 CHECK_USES(n0, n1, n2);
154 CHECK_INPUTS(n1, n0);
160 CHECK_USES(n1, NONE);
162 CHECK_USES(n3, n1, n2);
164 CHECK_INPUTS(n1, n3);
174 Node* n1 = graph.NewNode(&dummy_operator1, n0);
176 CHECK_USES(n0, n1);
177 CHECK_USES(n1, NONE);
179 n1->ReplaceInput(0, n1); // Create self-reference.
182 CHECK_USES(n1, n1);
186 n1->ReplaceUses(n2);
189 CHECK_USES(n1, NONE);
190 CHECK_USES(n2, n1);
199 Node* n1 = graph.NewNode(&dummy_operator0);
201 Node* n3 = graph.NewNode(&dummy_operator3, n0, n1, n2);
205 CHECK_USES(n1, n3);
210 CHECK_INPUTS(n3, n0, n1, n2);
214 CHECK_USES(n1, NONE);
228 Node* n1 = graph.NewNode(&dummy_operator0);
230 CHECK(!n0->OwnedBy(n1));
231 CHECK(!n1->OwnedBy(n0));
246 Node* n1 = graph.NewNode(&dummy_operator1, n0);
247 CHECK(n0->OwnedBy(n1));
248 CHECK(!n1->OwnedBy(n0));
250 CHECK(!n0->OwnedBy(n1));
252 CHECK(!n1->OwnedBy(n0));
253 CHECK(!n1->OwnedBy(n2));
255 CHECK(!n2->OwnedBy(n1));
260 CHECK(n0->OwnedBy(n1));
261 CHECK(!n1->OwnedBy(n0));
262 CHECK(!n1->OwnedBy(n0));
263 CHECK(!n1->OwnedBy(n2));
265 CHECK(!n2->OwnedBy(n1));
278 Node* n1 = graph.NewNode(&dummy_operator1, n0);
280 CHECK_USES(n0, n1);
281 CHECK_USES(n1, NONE);
285 CHECK_USES(n0, n1, n2);
290 CHECK_USES(n0, n1, n2, n3);
301 Node* n1 = graph.NewNode(&dummy_operator1, n0);
303 Node* n3 = graph.NewNode(&dummy_operator3, n0, n1, n2);
305 CHECK_INPUTS(n3, n0, n1, n2);
307 Node* n4 = graph.NewNode(&dummy_operator3, n0, n1, n2);
310 CHECK_INPUTS(n3, n0, n1, n2, n4);
315 CHECK_INPUTS(n3, n0, n1, n2, n4, n4);
330 Node* n1 = graph.NewNode(&dummy_operator1, n0);
331 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1);
334 CHECK_INPUTS(n1, n0);
335 CHECK_INPUTS(n2, n0, n1);
336 CHECK_USES(n0, n1, n2);
338 n1->RemoveInput(0);
339 CHECK_INPUTS(n1, NONE);
343 CHECK_INPUTS(n2, n1);
345 CHECK_USES(n1, n2);
350 CHECK_USES(n1, NONE);
361 Node* n1 = graph.NewNode(&dummy_operator1, n0);
362 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1);
365 CHECK_INPUTS(n1, n0);
366 CHECK_INPUTS(n2, n0, n1);
367 CHECK_USES(n0, n1, n2);
373 CHECK_INPUTS(n2, n0, n1, n3);
384 Node* n1 = graph.NewNode(&dummy_operator1, n0);
385 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1);
388 CHECK_INPUTS(n1, n0);
389 CHECK_INPUTS(n2, n0, n1);
390 CHECK_USES(n0, n1, n2);
394 CHECK_INPUTS(n2, NULL, n1);
396 CHECK_USES(n0, n1);
402 CHECK_USES(n1, NONE);
412 Node* n1 = graph.NewNode(&dummy_operator1, n0);
415 n3->AppendInput(graph.zone(), n1);
418 CHECK_INPUTS(n3, n0, n1, n2);
419 CHECK_USES(n0, n1, n2, n3);
420 CHECK_USES(n1, n3);
424 CHECK_USES(n1, NONE);
436 Node* n1 = graph.NewNode(&dummy_operator1, n0);
442 n2->AppendInput(graph.zone(), n1);
443 CHECK_INPUTS(n2, n0, n1);
444 CHECK_USES(n1, n2);
447 CHECK_INPUTS(n2, n0, n1, n0);
448 CHECK_USES(n1, n2);
449 CHECK_USES(n0, n2, n1, n2);
454 CHECK_INPUTS(n2, n3, n1, n3);
455 CHECK_USES(n3, n2, n1, n2);
465 Node* n1 = graph.NewNode(&dummy_operator0);
467 n2->ReplaceInput(0, n1);
469 CHECK_EQ(1, n1->UseCount());
472 n3->ReplaceInput(0, n1);
474 CHECK_EQ(2, n1->UseCount());
485 Node* n1 = graph.NewNode(&dummy_operator1, n0);
486 n1->TrimInputCount(1);
487 CHECK_INPUTS(n1, n0);
488 CHECK_USES(n0, n1);
493 Node* n1 = graph.NewNode(&dummy_operator1, n0);
494 n1->TrimInputCount(0);
495 CHECK_INPUTS(n1, NONE);
501 Node* n1 = graph.NewNode(&dummy_operator0);
502 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1);
504 CHECK_INPUTS(n2, n0, n1);
506 CHECK_USES(n1, n2);
511 Node* n1 = graph.NewNode(&dummy_operator0);
512 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1);
516 CHECK_USES(n1, NONE);
521 Node* n1 = graph.NewNode(&dummy_operator0);
522 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1);
526 CHECK_USES(n1, NONE);
554 Node* n1 = graph.NewNode(&dummy_operator0);
555 n1->AppendInput(graph.zone(), n0);
556 CHECK_INPUTS(n1, n0);
557 CHECK_USES(n0, n1);
559 n1->TrimInputCount(1);
560 CHECK_INPUTS(n1, n0);
561 CHECK_USES(n0, n1);
566 Node* n1 = graph.NewNode(&dummy_operator0);
567 n1->AppendInput(graph.zone(), n0);
568 CHECK_EQ(1, n1->InputCount());
569 n1->TrimInputCount(0);
570 CHECK_EQ(0, n1->InputCount());
576 Node* n1 = graph.NewNode(&dummy_operator0);
579 n2->AppendInput(graph.zone(), n1);
580 CHECK_INPUTS(n2, n0, n1);
582 CHECK_INPUTS(n2, n0, n1);
584 CHECK_USES(n1, n2);
590 Node* n1 = graph.NewNode(&dummy_operator0);
593 n2->AppendInput(graph.zone(), n1);
594 CHECK_INPUTS(n2, n0, n1);
598 CHECK_USES(n1, NONE);
604 Node* n1 = graph.NewNode(&dummy_operator0);
607 n2->AppendInput(graph.zone(), n1);
608 CHECK_INPUTS(n2, n0, n1);
612 CHECK_USES(n1, NONE);
649 Node* n1 = graph.NewNode(&dummy_operator0);
651 n2->AppendInput(graph.zone(), n1);
652 CHECK_INPUTS(n2, n0, n1);
654 CHECK_INPUTS(n2, n0, n1);
656 CHECK_USES(n1, n2);
662 Node* n1 = graph.NewNode(&dummy_operator0);
664 n2->AppendInput(graph.zone(), n1);
665 CHECK_INPUTS(n2, n0, n1);
669 CHECK_USES(n1, NONE);
675 Node* n1 = graph.NewNode(&dummy_operator0);
677 n2->AppendInput(graph.zone(), n1);
678 CHECK_INPUTS(n2, n0, n1);
682 CHECK_USES(n1, NONE);
719 Node* n1 = graph.NewNode(&dummy_operator1, n0);
722 n2 = graph.NewNode(&dummy_operator2, n0, n1);
723 CHECK_INPUTS(n2, n0, n1);
727 n2->AppendInput(graph.zone(), n1); // with out-of-line input.
728 CHECK_INPUTS(n2, n0, n1);
734 CHECK_USES(n0, n1, n2);
735 n1->NullAllInputs();
736 CHECK_INPUTS(n1, NULL);
737 CHECK_INPUTS(n2, n0, n1);
741 CHECK_INPUTS(n1, NULL);
748 Node* n1 = graph.NewNode(&dummy_operator1, n0);
749 n1->ReplaceInput(0, n1); // self-reference.
752 CHECK_INPUTS(n1, n1);
754 CHECK_USES(n1, n1);
755 n1->NullAllInputs();
758 CHECK_INPUTS(n1, NULL);
760 CHECK_USES(n1, NONE);
