Lines Matching refs:n1
22 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
24 CHECK(n2->id() != n1->id()); in TEST()
30 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
32 CHECK(n1->op() == &dummy_operator); in TEST()
49 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
50 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); in TEST()
53 CHECK(n1 == n2->InputAt(1)); in TEST()
60 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
61 Node* n2 = graph.NewNode(&dummy_operator, n0, n1, n1); in TEST()
64 CHECK(n1 == n2->InputAt(1)); in TEST()
65 CHECK(n1 == n2->InputAt(2)); in TEST()
71 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
72 Node::Inputs::iterator i(n1->inputs().begin()); in TEST()
74 for (; i != n1->inputs().end(); ++i) { in TEST()
84 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST() local
85 Node::Inputs::iterator i(n1->inputs().begin()); in TEST()
86 CHECK_EQ(1, n1->InputCount()); in TEST()
89 CHECK(n1->inputs().end() == i); in TEST()
95 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
96 Node::Uses::iterator i(n1->uses().begin()); in TEST()
98 for (; i != n1->uses().end(); ++i) { in TEST()
110 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST() local
112 CHECK_EQ(n1, *i); in TEST()
121 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
124 n0->ReplaceUses(n1); in TEST()
135 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST() local
139 CHECK_EQ(n1, *i1); in TEST()
144 CHECK_EQ(n1, *i2); in TEST()
147 Node::Inputs::iterator i3(n1->inputs().begin()); in TEST()
150 CHECK(n1->inputs().end() == i3); in TEST()
161 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST() local
164 n1->ReplaceInput(0, n1); // Create self-reference. in TEST()
166 Node::Uses::iterator i1(n1->uses().begin()); in TEST()
167 CHECK_EQ(n1, *i1); in TEST()
169 n1->ReplaceUses(n3); in TEST()
171 CHECK(n1->uses().begin() == n1->uses().end()); in TEST()
174 CHECK_EQ(n1, *i2); in TEST()
176 CHECK(n1->uses().end() == i2); in TEST()
183 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
185 Node* n3 = graph.NewNode(&dummy_operator, n0, n1, n2); in TEST()
190 CHECK_EQ(n1, *i1); in TEST()
191 CHECK_EQ(n1, n3->InputAt(1)); in TEST()
198 Node::Uses::iterator i2(n1->uses().begin()); in TEST()
201 CHECK(i2 == n1->uses().end()); in TEST()
209 Node::Uses::iterator i4(n1->uses().begin()); in TEST()
210 CHECK(i4 == n1->uses().end()); in TEST()
236 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
238 CHECK(!n0->OwnedBy(n1)); in TEST()
239 CHECK(!n1->OwnedBy(n0)); in TEST()
254 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST() local
255 CHECK(n0->OwnedBy(n1)); in TEST()
256 CHECK(!n1->OwnedBy(n0)); in TEST()
258 CHECK(!n0->OwnedBy(n1)); in TEST()
260 CHECK(!n1->OwnedBy(n0)); in TEST()
261 CHECK(!n1->OwnedBy(n2)); in TEST()
263 CHECK(!n2->OwnedBy(n1)); in TEST()
268 CHECK(n0->OwnedBy(n1)); in TEST()
269 CHECK(!n1->OwnedBy(n0)); in TEST()
270 CHECK(!n1->OwnedBy(n0)); in TEST()
271 CHECK(!n1->OwnedBy(n2)); in TEST()
273 CHECK(!n2->OwnedBy(n1)); in TEST()
284 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST() local
286 printf("A: %d vs %d\n", n0->UseAt(0)->id(), n1->id()); in TEST()
287 CHECK(n0->UseAt(0) == n1); in TEST()
302 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST() local
304 Node* n3 = graph.NewNode(&dummy_operator, n0, n1, n2); in TEST()
307 CHECK(n3->InputAt(1) == n1); in TEST()
309 Node* n4 = graph.NewNode(&dummy_operator, n0, n1, n2); in TEST()
313 CHECK(n3->InputAt(1) == n1); in TEST()
320 CHECK(n3->InputAt(1) == n1); in TEST()
345 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST() local
346 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); in TEST()
348 n1->RemoveInput(0); in TEST()
349 CHECK_EQ(0, n1->InputCount()); in TEST()
355 CHECK_EQ(1, n1->UseCount()); in TEST()
366 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST() local
367 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); in TEST()
375 CHECK(*current == n1); in TEST()
388 CHECK(*current == n1); in TEST()
403 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST() local
404 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); in TEST()
408 CHECK(n1 == n2->InputAt(1)); in TEST()
412 CHECK(n1 == n2->InputAt(1)); in TEST()
421 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST() local
424 n3->AppendInput(graph.zone(), n1); in TEST()
429 CHECK(n1 == n3->InputAt(1)); in TEST()
431 CHECK_EQ(1, n1->UseCount()); in TEST()
436 CHECK_EQ(0, n1->UseCount()); in TEST()
444 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST() local
447 n2->AppendInput(graph.zone(), n1); in TEST()
458 CHECK(*current == n1); in TEST()
480 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST() local
485 n2->ReplaceUsesIf(FixedPredicate<true>(), n1); in TEST()
487 n2->ReplaceUsesIf(FixedPredicate<false>(), n1); in TEST()
491 n3->ReplaceUsesIf(FixedPredicate<true>(), n1); in TEST()
493 n3->ReplaceUsesIf(FixedPredicate<false>(), n1); in TEST()
497 CHECK_EQ(0, n1->UseCount()); in TEST()
498 n0->ReplaceUsesIf(FixedPredicate<false>(), n1); in TEST()
500 CHECK_EQ(0, n1->UseCount()); in TEST()
501 n0->ReplaceUsesIf(FixedPredicate<true>(), n1); in TEST()
503 CHECK_EQ(2, n1->UseCount()); in TEST()
505 n1->AppendInput(graph.zone(), n1); in TEST()
506 CHECK_EQ(3, n1->UseCount()); in TEST()
507 n1->AppendInput(graph.zone(), n3); in TEST()
509 n3->ReplaceUsesIf(FixedPredicate<true>(), n1); in TEST()
510 CHECK_EQ(4, n1->UseCount()); in TEST()
512 n1->ReplaceUsesIf(FixedPredicate<false>(), n3); in TEST()
513 CHECK_EQ(4, n1->UseCount()); in TEST()
522 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST() local
523 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); in TEST()
526 n2->ReplaceUsesIf(std::bind1st(std::equal_to<Node*>(), n1), n0); in TEST()
530 CHECK_EQ(1, n1->UseCount()); in TEST()
531 n1->ReplaceUsesIf(std::bind1st(std::equal_to<Node*>(), n0), n0); in TEST()
533 CHECK_EQ(1, n1->UseCount()); in TEST()
534 n0->ReplaceUsesIf(std::bind2nd(std::equal_to<Node*>(), n2), n1); in TEST()
536 CHECK_EQ(2, n1->UseCount()); in TEST()
544 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
546 n2->ReplaceInput(0, n1); in TEST()
548 CHECK_EQ(1, n1->UseCount()); in TEST()
551 n3->ReplaceInput(0, n1); in TEST()
553 CHECK_EQ(2, n1->UseCount()); in TEST()
562 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST() local
563 n1->TrimInputCount(1); in TEST()
564 CHECK_EQ(1, n1->InputCount()); in TEST()
565 CHECK_EQ(n0, n1->InputAt(0)); in TEST()
571 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST() local
572 n1->TrimInputCount(0); in TEST()
573 CHECK_EQ(0, n1->InputCount()); in TEST()
579 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
580 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); in TEST()
584 CHECK_EQ(1, n1->UseCount()); in TEST()
590 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
591 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); in TEST()
595 CHECK_EQ(0, n1->UseCount()); in TEST()
601 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
602 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); in TEST()
606 CHECK_EQ(0, n1->UseCount()); in TEST()
635 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
636 n1->AppendInput(graph.zone(), n0); in TEST()
637 n1->TrimInputCount(1); in TEST()
638 CHECK_EQ(1, n1->InputCount()); in TEST()
639 CHECK_EQ(n0, n1->InputAt(0)); in TEST()
645 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
646 n1->AppendInput(graph.zone(), n0); in TEST()
647 CHECK_EQ(1, n1->InputCount()); in TEST()
648 n1->TrimInputCount(0); in TEST()
649 CHECK_EQ(0, n1->InputCount()); in TEST()
655 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
658 n2->AppendInput(graph.zone(), n1); in TEST()
663 CHECK_EQ(n1, n2->InputAt(1)); in TEST()
665 CHECK_EQ(1, n1->UseCount()); in TEST()
671 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
674 n2->AppendInput(graph.zone(), n1); in TEST()
680 CHECK_EQ(0, n1->UseCount()); in TEST()
686 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
689 n2->AppendInput(graph.zone(), n1); in TEST()
694 CHECK_EQ(0, n1->UseCount()); in TEST()
731 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
733 n2->AppendInput(graph.zone(), n1); in TEST()
738 CHECK_EQ(n1, n2->InputAt(1)); in TEST()
740 CHECK_EQ(1, n1->UseCount()); in TEST()
746 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
748 n2->AppendInput(graph.zone(), n1); in TEST()
754 CHECK_EQ(0, n1->UseCount()); in TEST()
760 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
762 n2->AppendInput(graph.zone(), n1); in TEST()
767 CHECK_EQ(0, n1->UseCount()); in TEST()
802 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST() local
805 n2 = graph.NewNode(&dummy_operator, n0, n1); in TEST()
808 n2->AppendInput(graph.zone(), n1); // with out-of-line input. in TEST()
815 n1->RemoveAllInputs(); in TEST()
816 CHECK_EQ(1, n1->InputCount()); in TEST()
818 CHECK_EQ(NULL, n1->InputAt(0)); in TEST()
820 CHECK_EQ(1, n1->UseCount()); in TEST()
824 CHECK_EQ(0, n1->UseCount()); in TEST()
831 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST() local
832 n1->ReplaceInput(0, n1); // self-reference. in TEST()
835 CHECK_EQ(1, n1->UseCount()); in TEST()
836 n1->RemoveAllInputs(); in TEST()
837 CHECK_EQ(1, n1->InputCount()); in TEST()
838 CHECK_EQ(0, n1->UseCount()); in TEST()
839 CHECK_EQ(NULL, n1->InputAt(0)); in TEST()