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

Lines Matching refs:n0
39   Node* n0 = graph.NewNode(&dummy_operator);
40   Node* n2 = graph.NewNode(&dummy_operator, n0);
42   CHECK(n0 == n2->InputAt(0));
48   Node* n0 = graph.NewNode(&dummy_operator);
50   Node* n2 = graph.NewNode(&dummy_operator, n0, n1);
52   CHECK(n0 == n2->InputAt(0));
59   Node* n0 = graph.NewNode(&dummy_operator);
61   Node* n2 = graph.NewNode(&dummy_operator, n0, n1, n1);
63   CHECK(n0 == n2->InputAt(0));
83   Node* n0 = graph.NewNode(&dummy_operator);
84   Node* n1 = graph.NewNode(&dummy_operator, n0);
87   CHECK_EQ(n0, *i);
109   Node* n0 = graph.NewNode(&dummy_operator);
110   Node* n1 = graph.NewNode(&dummy_operator, n0);
111   Node::Uses::iterator i(n0->uses().begin());
114   CHECK(n0->uses().end() == i);
120   Node* n0 = graph.NewNode(&dummy_operator);
124   n0->ReplaceUses(n1);
125   CHECK(n0->uses().begin() == n0->uses().end());
126   n0->ReplaceUses(n2);
127   CHECK(n0->uses().begin() == n0->uses().end());
134   Node* n0 = graph.NewNode(&dummy_operator);
135   Node* n1 = graph.NewNode(&dummy_operator, n0);
136   Node* n2 = graph.NewNode(&dummy_operator, n0);
138   Node::Uses::iterator i1(n0->uses().begin());
142   n0->ReplaceUses(n3);
160   Node* n0 = graph.NewNode(&dummy_operator);
161   Node* n1 = graph.NewNode(&dummy_operator, n0);
182   Node* n0 = graph.NewNode(&dummy_operator);
185   Node* n3 = graph.NewNode(&dummy_operator, n0, n1, n2);
187   CHECK(n0 == *i1);
188   CHECK_EQ(n0, n3->InputAt(0));
218   CHECK(n0 == *i6);
219   CHECK_EQ(n0, n3->InputAt(0));
235     Node* n0 = graph.NewNode(&dummy_operator);
238     CHECK(!n0->OwnedBy(n1));
239     CHECK(!n1->OwnedBy(n0));
241     Node* n2 = graph.NewNode(&dummy_operator, n0);
242     CHECK(n0->OwnedBy(n2));
243     CHECK(!n2->OwnedBy(n0));
245     Node* n3 = graph.NewNode(&dummy_operator, n0);
246     CHECK(!n0->OwnedBy(n2));
247     CHECK(!n0->OwnedBy(n3));
248     CHECK(!n2->OwnedBy(n0));
249     CHECK(!n3->OwnedBy(n0));
253     Node* n0 = graph.NewNode(&dummy_operator);
254     Node* n1 = graph.NewNode(&dummy_operator, n0);
255     CHECK(n0->OwnedBy(n1));
256     CHECK(!n1->OwnedBy(n0));
257     Node* n2 = graph.NewNode(&dummy_operator, n0);
258     CHECK(!n0->OwnedBy(n1));
259     CHECK(!n0->OwnedBy(n2));
260     CHECK(!n1->OwnedBy(n0));
262     CHECK(!n2->OwnedBy(n0));
268     CHECK(n0->OwnedBy(n1));
269     CHECK(!n1->OwnedBy(n0));
270     CHECK(!n1->OwnedBy(n0));
272     CHECK(!n2->OwnedBy(n0));
283   Node* n0 = graph.NewNode(&dummy_operator);
284   Node* n1 = graph.NewNode(&dummy_operator, n0);
285   CHECK_EQ(1, n0->UseCount());
286   printf("A: %d vs %d\n", n0->UseAt(0)->id(), n1->id());
287   CHECK(n0->UseAt(0) == n1);
288   Node* n2 = graph.NewNode(&dummy_operator, n0);
289   CHECK_EQ(2, n0->UseCount());
290   printf("B: %d vs %d\n", n0->UseAt(1)->id(), n2->id());
291   CHECK(n0->UseAt(1) == n2);
292   Node* n3 = graph.NewNode(&dummy_operator, n0);
293   CHECK_EQ(3, n0->UseCount());
294   CHECK(n0->UseAt(2) == n3);
301   Node* n0 = graph.NewNode(&dummy_operator);
302   Node* n1 = graph.NewNode(&dummy_operator, n0);
303   Node* n2 = graph.NewNode(&dummy_operator, n0);
304   Node* n3 = graph.NewNode(&dummy_operator, n0, n1, n2);
306   CHECK(n3->InputAt(0) == n0);
309   Node* n4 = graph.NewNode(&dummy_operator, n0, n1, n2);
312   CHECK(n3->InputAt(0) == n0);
319   CHECK(n3->InputAt(0) == n0);
344   Node* n0 = graph.NewNode(&dummy_operator);
345   Node* n1 = graph.NewNode(&dummy_operator, n0);
346   Node* n2 = graph.NewNode(&dummy_operator, n0, n1);
350   CHECK_EQ(1, n0->UseCount());
354   CHECK_EQ(0, n0->UseCount());
365   Node* n0 = graph.NewNode(&dummy_operator);
366   Node* n1 = graph.NewNode(&dummy_operator, n0);
367   Node* n2 = graph.NewNode(&dummy_operator, n0, n1);
372   CHECK(*current == n0);
384   CHECK(*current == n0);
402   Node* n0 = graph.NewNode(&dummy_operator);
403   Node* n1 = graph.NewNode(&dummy_operator, n0);
404   Node* n2 = graph.NewNode(&dummy_operator, n0, n1);
407   CHECK(n0 == n2->InputAt(0));
409   CHECK_EQ(2, n0->UseCount());
413   CHECK_EQ(1, n0->UseCount());
420   Node* n0 = graph.NewNode(&dummy_operator);
421   Node* n1 = graph.NewNode(&dummy_operator, n0);
422   Node* n2 = graph.NewNode(&dummy_operator, n0);
423   Node* n3 = graph.NewNode(&dummy_operator, n0);
428   CHECK(n0 == n3->InputAt(0));
433   CHECK(n0 == n3->InputAt(0));
443   Node* n0 = graph.NewNode(&dummy_operator);
444   Node* n1 = graph.NewNode(&dummy_operator, n0);
445   Node* n2 = graph.NewNode(&dummy_operator, n0);
448   n2->AppendInput(graph.zone(), n0);
450   CHECK_EQ(3, n0->UseCount());
451   n0->ReplaceUses(n3);
452   CHECK_EQ(0, n0->UseCount());
479   Node* n0 = graph.NewNode(&dummy_operator);
480   Node* n1 = graph.NewNode(&dummy_operator, n0);
481   Node* n2 = graph.NewNode(&dummy_operator, n0);
496   CHECK_EQ(2, n0->UseCount());
498   n0->ReplaceUsesIf(FixedPredicate<false>(), n1);
499   CHECK_EQ(2, n0->UseCount());
501   n0->ReplaceUsesIf(FixedPredicate<true>(), n1);
502   CHECK_EQ(0, n0->UseCount());
521   Node* n0 = graph.NewNode(&dummy_operator);
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);
529   CHECK_EQ(2, n0->UseCount());
531   n1->ReplaceUsesIf(std::bind1st(std::equal_to<Node*>(), n0), n0);
532   CHECK_EQ(2, n0->UseCount());
534   n0->ReplaceUsesIf(std::bind2nd(std::equal_to<Node*>(), n2), n1);
535   CHECK_EQ(1, n0->UseCount());
543   Node* n0 = graph.NewNode(&dummy_operator);
545   Node* n2 = graph.NewNode(&dummy_operator, n0);
547   CHECK_EQ(0, n0->UseCount());
550   Node* n3 = graph.NewNode(&dummy_operator, n0);
552   CHECK_EQ(0, n0->UseCount());
561     Node* n0 = graph.NewNode(&dummy_operator);
562     Node* n1 = graph.NewNode(&dummy_operator, n0);
565     CHECK_EQ(n0, n1->InputAt(0));
566     CHECK_EQ(1, n0->UseCount());
570     Node* n0 = graph.NewNode(&dummy_operator);
571     Node* n1 = graph.NewNode(&dummy_operator, n0);
574     CHECK_EQ(0, n0->UseCount());
578     Node* n0 = graph.NewNode(&dummy_operator);
580     Node* n2 = graph.NewNode(&dummy_operator, n0, n1);
583     CHECK_EQ(1, n0->UseCount());
589     Node* n0 = graph.NewNode(&dummy_operator);
591     Node* n2 = graph.NewNode(&dummy_operator, n0, n1);
594     CHECK_EQ(1, n0->UseCount());
600     Node* n0 = graph.NewNode(&dummy_operator);
602     Node* n2 = graph.NewNode(&dummy_operator, n0, n1);
605     CHECK_EQ(0, n0->UseCount());
611     Node* n0 = graph.NewNode(&dummy_operator);
612     Node* n2 = graph.NewNode(&dummy_operator, n0, n0);
615     CHECK_EQ(1, n0->UseCount());
620     Node* n0 = graph.NewNode(&dummy_operator);
621     Node* n2 = graph.NewNode(&dummy_operator, n0, n0);
624     CHECK_EQ(0, n0->UseCount());
634     Node* n0 = graph.NewNode(&dummy_operator);
636     n1->AppendInput(graph.zone(), n0);
639     CHECK_EQ(n0, n1->InputAt(0));
640     CHECK_EQ(1, n0->UseCount());
644     Node* n0 = graph.NewNode(&dummy_operator);
646     n1->AppendInput(graph.zone(), n0);
650     CHECK_EQ(0, n0->UseCount());
654     Node* n0 = graph.NewNode(&dummy_operator);
657     n2->AppendInput(graph.zone(), n0);
662     CHECK_EQ(n0, n2->InputAt(0));
664     CHECK_EQ(1, n0->UseCount());
670     Node* n0 = graph.NewNode(&dummy_operator);
673     n2->AppendInput(graph.zone(), n0);
678     CHECK_EQ(n0, n2->InputAt(0));
679     CHECK_EQ(1, n0->UseCount());
685     Node* n0 = graph.NewNode(&dummy_operator);
688     n2->AppendInput(graph.zone(), n0);
693     CHECK_EQ(0, n0->UseCount());
699     Node* n0 = graph.NewNode(&dummy_operator);
701     n2->AppendInput(graph.zone(), n0);
702     n2->AppendInput(graph.zone(), n0);
704     CHECK_EQ(2, n0->UseCount());
707     CHECK_EQ(1, n0->UseCount());
712     Node* n0 = graph.NewNode(&dummy_operator);
714     n2->AppendInput(graph.zone(), n0);
715     n2->AppendInput(graph.zone(), n0);
717     CHECK_EQ(2, n0->UseCount());
720     CHECK_EQ(0, n0->UseCount());
730     Node* n0 = graph.NewNode(&dummy_operator);
732     Node* n2 = graph.NewNode(&dummy_operator, n0);
737     CHECK_EQ(n0, n2->InputAt(0));
739     CHECK_EQ(1, n0->UseCount());
745     Node* n0 = graph.NewNode(&dummy_operator);
747     Node* n2 = graph.NewNode(&dummy_operator, n0);
752     CHECK_EQ(n0, n2->InputAt(0));
753     CHECK_EQ(1, n0->UseCount());
759     Node* n0 = graph.NewNode(&dummy_operator);
761     Node* n2 = graph.NewNode(&dummy_operator, n0);
766     CHECK_EQ(0, n0->UseCount());
772     Node* n0 = graph.NewNode(&dummy_operator);
773     Node* n2 = graph.NewNode(&dummy_operator, n0);
774     n2->AppendInput(graph.zone(), n0);
776     CHECK_EQ(2, n0->UseCount());
779     CHECK_EQ(1, n0->UseCount());
784     Node* n0 = graph.NewNode(&dummy_operator);
785     Node* n2 = graph.NewNode(&dummy_operator, n0);
786     n2->AppendInput(graph.zone(), n0);
788     CHECK_EQ(2, n0->UseCount());
791     CHECK_EQ(0, n0->UseCount());
801     Node* n0 = graph.NewNode(&dummy_operator);
802     Node* n1 = graph.NewNode(&dummy_operator, n0);
805       n2 = graph.NewNode(&dummy_operator, n0, n1);
807       n2 = graph.NewNode(&dummy_operator, n0);
811     n0->RemoveAllInputs();
812     CHECK_EQ(0, n0->InputCount());
814     CHECK_EQ(2, n0->UseCount());
817     CHECK_EQ(1, n0->UseCount());
823     CHECK_EQ(0, n0->UseCount());
830     Node* n0 = graph.NewNode(&dummy_operator);
831     Node* n1 = graph.NewNode(&dummy_operator, n0);
834     CHECK_EQ(0, n0->UseCount());