Cross Reference: /external/chromium_org/v8/test/cctest/compiler/test-node.cc

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