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

Lines Matching refs:n2
23   Node* n2 = graph.NewNode(&dummy_operator);
24   CHECK(n2->id() != n1->id());
31   Node* n2 = graph.NewNode(&dummy_operator);
33   CHECK(n2->op() == &dummy_operator);
40   Node* n2 = graph.NewNode(&dummy_operator, n0);
41   CHECK_EQ(1, n2->InputCount());
42   CHECK(n0 == n2->InputAt(0));
50   Node* n2 = graph.NewNode(&dummy_operator, n0, n1);
51   CHECK_EQ(2, n2->InputCount());
52   CHECK(n0 == n2->InputAt(0));
53   CHECK(n1 == n2->InputAt(1));
61   Node* n2 = graph.NewNode(&dummy_operator, n0, n1, n1);
62   CHECK_EQ(3, n2->InputCount());
63   CHECK(n0 == n2->InputAt(0));
64   CHECK(n1 == n2->InputAt(1));
65   CHECK(n1 == n2->InputAt(2));
122   Node* n2 = graph.NewNode(&dummy_operator);
123   Node* n3 = graph.NewNode(&dummy_operator, n2);
126   n0->ReplaceUses(n2);
136   Node* n2 = graph.NewNode(&dummy_operator, n0);
141   CHECK_EQ(n2, *i1);
146   CHECK_EQ(n2, *i2);
151   Node::Inputs::iterator i4(n2->inputs().begin());
154   CHECK(n2->inputs().end() == i4);
184   Node* n2 = graph.NewNode(&dummy_operator);
185   Node* n3 = graph.NewNode(&dummy_operator, n0, n1, n2);
193   CHECK_EQ(n2, *i1);
194   CHECK_EQ(n2, n3->InputAt(2));
224   CHECK_EQ(n2, *i6);
225   CHECK_EQ(n2, n3->InputAt(2));
241     Node* n2 = graph.NewNode(&dummy_operator, n0);
242     CHECK(n0->OwnedBy(n2));
243     CHECK(!n2->OwnedBy(n0));
246     CHECK(!n0->OwnedBy(n2));
248     CHECK(!n2->OwnedBy(n0));
257     Node* n2 = graph.NewNode(&dummy_operator, n0);
259     CHECK(!n0->OwnedBy(n2));
261     CHECK(!n1->OwnedBy(n2));
262     CHECK(!n2->OwnedBy(n0));
263     CHECK(!n2->OwnedBy(n1));
266     n2->ReplaceInput(0, n3);
271     CHECK(!n1->OwnedBy(n2));
272     CHECK(!n2->OwnedBy(n0));
273     CHECK(!n2->OwnedBy(n1));
274     CHECK(n3->OwnedBy(n2));
275     CHECK(!n2->OwnedBy(n3));
288   Node* n2 = graph.NewNode(&dummy_operator, n0);
290   printf("B: %d vs %d\n", n0->UseAt(1)->id(), n2->id());
291   CHECK(n0->UseAt(1) == n2);
303   Node* n2 = graph.NewNode(&dummy_operator, n0);
304   Node* n3 = graph.NewNode(&dummy_operator, n0, n1, n2);
308   CHECK(n3->InputAt(2) == n2);
309   Node* n4 = graph.NewNode(&dummy_operator, n0, n1, n2);
314   CHECK(n3->InputAt(2) == n2);
321   CHECK(n3->InputAt(2) == n2);
346   Node* n2 = graph.NewNode(&dummy_operator, n0, n1);
352   n2->RemoveInput(0);
353   CHECK_EQ(1, n2->InputCount());
357   n2->RemoveInput(0);
358   CHECK_EQ(0, n2->InputCount());
367   Node* n2 = graph.NewNode(&dummy_operator, n0, n1);
369   Node::Inputs inputs(n2->inputs());
380   n2->AppendInput(graph.zone(), n3);
381   inputs = n2->inputs();
404   Node* n2 = graph.NewNode(&dummy_operator, n0, n1);
405   CHECK_EQ(2, n2->InputCount());
407   CHECK(n0 == n2->InputAt(0));
408   CHECK(n1 == n2->InputAt(1));
410   n2->ReplaceInput(0, NULL);
411   CHECK(NULL == n2->InputAt(0));
412   CHECK(n1 == n2->InputAt(1));
422   Node* n2 = graph.NewNode(&dummy_operator, n0);
425   n3->AppendInput(graph.zone(), n2);
430   CHECK(n2 == n3->InputAt(2));
435   CHECK(n2 == n3->InputAt(2));
445   Node* n2 = graph.NewNode(&dummy_operator, n0);
447   n2->AppendInput(graph.zone(), n1);
448   n2->AppendInput(graph.zone(), n0);
461   CHECK(*current == n2);
464   CHECK(*current == n2);
481   Node* n2 = graph.NewNode(&dummy_operator, n0);
484   CHECK_EQ(0, n2->UseCount());
485   n2->ReplaceUsesIf(FixedPredicate<true>(), n1);
486   CHECK_EQ(0, n2->UseCount());
487   n2->ReplaceUsesIf(FixedPredicate<false>(), n1);
488   CHECK_EQ(0, n2->UseCount());
523   Node* n2 = graph.NewNode(&dummy_operator, n0, n1);
525   CHECK_EQ(0, n2->UseCount());
526   n2->ReplaceUsesIf(std::bind1st(std::equal_to<Node*>(), n1), n0);
527   CHECK_EQ(0, n2->UseCount());
534   n0->ReplaceUsesIf(std::bind2nd(std::equal_to<Node*>(), n2), n1);
545   Node* n2 = graph.NewNode(&dummy_operator, n0);
546   n2->ReplaceInput(0, n1);
580     Node* n2 = graph.NewNode(&dummy_operator, n0, n1);
581     n2->TrimInputCount(2);
582     CHECK_EQ(2, n2->InputCount());
585     CHECK_EQ(0, n2->UseCount());
591     Node* n2 = graph.NewNode(&dummy_operator, n0, n1);
592     n2->TrimInputCount(1);
593     CHECK_EQ(1, n2->InputCount());
596     CHECK_EQ(0, n2->UseCount());
602     Node* n2 = graph.NewNode(&dummy_operator, n0, n1);
603     n2->TrimInputCount(0);
604     CHECK_EQ(0, n2->InputCount());
607     CHECK_EQ(0, n2->UseCount());
612     Node* n2 = graph.NewNode(&dummy_operator, n0, n0);
613     n2->TrimInputCount(1);
614     CHECK_EQ(1, n2->InputCount());
616     CHECK_EQ(0, n2->UseCount());
621     Node* n2 = graph.NewNode(&dummy_operator, n0, n0);
622     n2->TrimInputCount(0);
623     CHECK_EQ(0, n2->InputCount());
625     CHECK_EQ(0, n2->UseCount());
656     Node* n2 = graph.NewNode(&dummy_operator);
657     n2->AppendInput(graph.zone(), n0);
658     n2->AppendInput(graph.zone(), n1);
659     CHECK_EQ(2, n2->InputCount());
660     n2->TrimInputCount(2);
661     CHECK_EQ(2, n2->InputCount());
662     CHECK_EQ(n0, n2->InputAt(0));
663     CHECK_EQ(n1, n2->InputAt(1));
666     CHECK_EQ(0, n2->UseCount());
672     Node* n2 = graph.NewNode(&dummy_operator);
673     n2->AppendInput(graph.zone(), n0);
674     n2->AppendInput(graph.zone(), n1);
675     CHECK_EQ(2, n2->InputCount());
676     n2->TrimInputCount(1);
677     CHECK_EQ(1, n2->InputCount());
678     CHECK_EQ(n0, n2->InputAt(0));
681     CHECK_EQ(0, n2->UseCount());
687     Node* n2 = graph.NewNode(&dummy_operator);
688     n2->AppendInput(graph.zone(), n0);
689     n2->AppendInput(graph.zone(), n1);
690     CHECK_EQ(2, n2->InputCount());
691     n2->TrimInputCount(0);
692     CHECK_EQ(0, n2->InputCount());
695     CHECK_EQ(0, n2->UseCount());
700     Node* n2 = graph.NewNode(&dummy_operator);
701     n2->AppendInput(graph.zone(), n0);
702     n2->AppendInput(graph.zone(), n0);
703     CHECK_EQ(2, n2->InputCount());
705     n2->TrimInputCount(1);
706     CHECK_EQ(1, n2->InputCount());
708     CHECK_EQ(0, n2->UseCount());
713     Node* n2 = graph.NewNode(&dummy_operator);
714     n2->AppendInput(graph.zone(), n0);
715     n2->AppendInput(graph.zone(), n0);
716     CHECK_EQ(2, n2->InputCount());
718     n2->TrimInputCount(0);
719     CHECK_EQ(0, n2->InputCount());
721     CHECK_EQ(0, n2->UseCount());
732     Node* n2 = graph.NewNode(&dummy_operator, n0);
733     n2->AppendInput(graph.zone(), n1);
734     CHECK_EQ(2, n2->InputCount());
735     n2->TrimInputCount(2);
736     CHECK_EQ(2, n2->InputCount());
737     CHECK_EQ(n0, n2->InputAt(0));
738     CHECK_EQ(n1, n2->InputAt(1));
741     CHECK_EQ(0, n2->UseCount());
747     Node* n2 = graph.NewNode(&dummy_operator, n0);
748     n2->AppendInput(graph.zone(), n1);
749     CHECK_EQ(2, n2->InputCount());
750     n2->TrimInputCount(1);
751     CHECK_EQ(1, n2->InputCount());
752     CHECK_EQ(n0, n2->InputAt(0));
755     CHECK_EQ(0, n2->UseCount());
761     Node* n2 = graph.NewNode(&dummy_operator, n0);
762     n2->AppendInput(graph.zone(), n1);
763     CHECK_EQ(2, n2->InputCount());
764     n2->TrimInputCount(0);
765     CHECK_EQ(0, n2->InputCount());
768     CHECK_EQ(0, n2->UseCount());
773     Node* n2 = graph.NewNode(&dummy_operator, n0);
774     n2->AppendInput(graph.zone(), n0);
775     CHECK_EQ(2, n2->InputCount());
777     n2->TrimInputCount(1);
778     CHECK_EQ(1, n2->InputCount());
780     CHECK_EQ(0, n2->UseCount());
785     Node* n2 = graph.NewNode(&dummy_operator, n0);
786     n2->AppendInput(graph.zone(), n0);
787     CHECK_EQ(2, n2->InputCount());
789     n2->TrimInputCount(0);
790     CHECK_EQ(0, n2->InputCount());
792     CHECK_EQ(0, n2->UseCount());
803     Node* n2;
805       n2 = graph.NewNode(&dummy_operator, n0, n1);
807       n2 = graph.NewNode(&dummy_operator, n0);
808       n2->AppendInput(graph.zone(), n1);  // with out-of-line input.
821     n2->RemoveAllInputs();
822     CHECK_EQ(2, n2->InputCount());
825     CHECK_EQ(NULL, n2->InputAt(0));
826     CHECK_EQ(NULL, n2->InputAt(1));