Lines Matching refs:n1
147 Node* n1 = graph.NewNode(&dummy_operator1, n0);
151 CHECK_USES(n0, n1, n2);
153 CHECK_INPUTS(n1, n0);
159 CHECK_USES(n1, NONE);
161 CHECK_USES(n3, n1, n2);
163 CHECK_INPUTS(n1, n3);
172 Node* n1 = graph.NewNode(&dummy_operator1, n0);
174 CHECK_USES(n0, n1);
175 CHECK_USES(n1, NONE);
177 n1->ReplaceInput(0, n1); // Create self-reference.
180 CHECK_USES(n1, n1);
184 n1->ReplaceUses(n2);
187 CHECK_USES(n1, NONE);
188 CHECK_USES(n2, n1);
196 Node* n1 = graph.NewNode(&dummy_operator0);
198 Node* n3 = graph.NewNode(&dummy_operator3, n0, n1, n2);
202 CHECK_USES(n1, n3);
207 CHECK_INPUTS(n3, n0, n1, n2);
211 CHECK_USES(n1, NONE);
224 Node* n1 = graph.NewNode(&dummy_operator0);
226 CHECK(!n0->OwnedBy(n1));
227 CHECK(!n1->OwnedBy(n0));
242 Node* n1 = graph.NewNode(&dummy_operator1, n0);
243 CHECK(n0->OwnedBy(n1));
244 CHECK(!n1->OwnedBy(n0));
246 CHECK(!n0->OwnedBy(n1));
248 CHECK(!n1->OwnedBy(n0));
249 CHECK(!n1->OwnedBy(n2));
251 CHECK(!n2->OwnedBy(n1));
256 CHECK(n0->OwnedBy(n1));
257 CHECK(!n1->OwnedBy(n0));
258 CHECK(!n1->OwnedBy(n0));
259 CHECK(!n1->OwnedBy(n2));
261 CHECK(!n2->OwnedBy(n1));
273 Node* n1 = graph.NewNode(&dummy_operator1, n0);
275 CHECK_USES(n0, n1);
276 CHECK_USES(n1, NONE);
280 CHECK_USES(n0, n1, n2);
285 CHECK_USES(n0, n1, n2, n3);
295 Node* n1 = 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);
323 Node* n1 = graph.NewNode(&dummy_operator1, n0);
324 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1);
327 CHECK_INPUTS(n1, n0);
328 CHECK_INPUTS(n2, n0, n1);
329 CHECK_USES(n0, n1, n2);
331 n1->RemoveInput(0);
332 CHECK_INPUTS(n1, NONE);
336 CHECK_INPUTS(n2, n1);
338 CHECK_USES(n1, n2);
343 CHECK_USES(n1, NONE);
353 Node* n1 = graph.NewNode(&dummy_operator1, n0);
354 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1);
357 CHECK_INPUTS(n1, n0);
358 CHECK_INPUTS(n2, n0, n1);
359 CHECK_USES(n0, n1, n2);
365 CHECK_INPUTS(n2, n0, n1, n3);
375 Node* n1 = graph.NewNode(&dummy_operator1, n0);
376 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1);
379 CHECK_INPUTS(n1, n0);
380 CHECK_INPUTS(n2, n0, n1);
381 CHECK_USES(n0, n1, n2);
385 CHECK_INPUTS(n2, NULL, n1);
387 CHECK_USES(n0, n1);
393 CHECK_USES(n1, NONE);
402 Node* n1 = graph.NewNode(&dummy_operator1, n0);
405 n3->AppendInput(graph.zone(), n1);
408 CHECK_INPUTS(n3, n0, n1, n2);
409 CHECK_USES(n0, n1, n2, n3);
410 CHECK_USES(n1, n3);
414 CHECK_USES(n1, NONE);
425 Node* n1 = graph.NewNode(&dummy_operator1, n0);
431 n2->AppendInput(graph.zone(), n1);
432 CHECK_INPUTS(n2, n0, n1);
433 CHECK_USES(n1, n2);
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);
453 Node* n1 = graph.NewNode(&dummy_operator0);
455 n2->ReplaceInput(0, n1);
457 CHECK_EQ(1, n1->UseCount());
460 n3->ReplaceInput(0, n1);
462 CHECK_EQ(2, n1->UseCount());
472 Node* n1 = graph.NewNode(&dummy_operator1, n0);
473 n1->TrimInputCount(1);
474 CHECK_INPUTS(n1, n0);
475 CHECK_USES(n0, n1);
480 Node* n1 = graph.NewNode(&dummy_operator1, n0);
481 n1->TrimInputCount(0);
482 CHECK_INPUTS(n1, NONE);
488 Node* n1 = graph.NewNode(&dummy_operator0);
489 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1);
491 CHECK_INPUTS(n2, n0, n1);
493 CHECK_USES(n1, n2);
498 Node* n1 = graph.NewNode(&dummy_operator0);
499 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1);
503 CHECK_USES(n1, NONE);
508 Node* n1 = graph.NewNode(&dummy_operator0);
509 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1);
513 CHECK_USES(n1, NONE);
540 Node* n1 = graph.NewNode(&dummy_operator0);
541 n1->AppendInput(graph.zone(), n0);
542 CHECK_INPUTS(n1, n0);
543 CHECK_USES(n0, n1);
545 n1->TrimInputCount(1);
546 CHECK_INPUTS(n1, n0);
547 CHECK_USES(n0, n1);
552 Node* n1 = graph.NewNode(&dummy_operator0);
553 n1->AppendInput(graph.zone(), n0);
554 CHECK_EQ(1, n1->InputCount());
555 n1->TrimInputCount(0);
556 CHECK_EQ(0, n1->InputCount());
562 Node* n1 = graph.NewNode(&dummy_operator0);
565 n2->AppendInput(graph.zone(), n1);
566 CHECK_INPUTS(n2, n0, n1);
568 CHECK_INPUTS(n2, n0, n1);
570 CHECK_USES(n1, n2);
576 Node* n1 = graph.NewNode(&dummy_operator0);
579 n2->AppendInput(graph.zone(), n1);
580 CHECK_INPUTS(n2, n0, n1);
584 CHECK_USES(n1, NONE);
590 Node* n1 = graph.NewNode(&dummy_operator0);
593 n2->AppendInput(graph.zone(), n1);
594 CHECK_INPUTS(n2, n0, n1);
598 CHECK_USES(n1, NONE);
634 Node* n1 = graph.NewNode(&dummy_operator0);
636 n2->AppendInput(graph.zone(), n1);
637 CHECK_INPUTS(n2, n0, n1);
639 CHECK_INPUTS(n2, n0, n1);
641 CHECK_USES(n1, n2);
647 Node* n1 = graph.NewNode(&dummy_operator0);
649 n2->AppendInput(graph.zone(), n1);
650 CHECK_INPUTS(n2, n0, n1);
654 CHECK_USES(n1, NONE);
660 Node* n1 = graph.NewNode(&dummy_operator0);
662 n2->AppendInput(graph.zone(), n1);
663 CHECK_INPUTS(n2, n0, n1);
667 CHECK_USES(n1, NONE);
703 Node* n1 = graph.NewNode(&dummy_operator1, n0);
706 n2 = graph.NewNode(&dummy_operator2, n0, n1);
707 CHECK_INPUTS(n2, n0, n1);
711 n2->AppendInput(graph.zone(), n1); // with out-of-line input.
712 CHECK_INPUTS(n2, n0, n1);
718 CHECK_USES(n0, n1, n2);
719 n1->NullAllInputs();
720 CHECK_INPUTS(n1, NULL);
721 CHECK_INPUTS(n2, n0, n1);
725 CHECK_INPUTS(n1, NULL);
732 Node* n1 = graph.NewNode(&dummy_operator1, n0);
733 n1->ReplaceInput(0, n1); // self-reference.
736 CHECK_INPUTS(n1, n1);
738 CHECK_USES(n1, n1);
739 n1->NullAllInputs();
742 CHECK_INPUTS(n1, NULL);
744 CHECK_USES(n1, NONE);
