Lines Matching refs:graph
21 GraphTester graph; in TEST() local
22 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
23 Node* n2 = graph.NewNode(&dummy_operator); in TEST()
29 GraphTester graph; in TEST() local
30 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
31 Node* n2 = graph.NewNode(&dummy_operator); in TEST()
38 GraphTester graph; in TEST() local
39 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
40 Node* n2 = graph.NewNode(&dummy_operator, n0); in TEST()
47 GraphTester graph; in TEST() local
48 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
49 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
50 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); in TEST()
58 GraphTester graph; in TEST() local
59 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
60 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
61 Node* n2 = graph.NewNode(&dummy_operator, n0, n1, n1); in TEST()
70 GraphTester graph; in TEST() local
71 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
82 GraphTester graph; in TEST() local
83 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
84 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST()
94 GraphTester graph; in TEST() local
95 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
108 GraphTester graph; in TEST() local
109 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
110 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST()
119 GraphTester graph; in TEST() local
120 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
121 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
122 Node* n2 = graph.NewNode(&dummy_operator); in TEST()
123 Node* n3 = graph.NewNode(&dummy_operator, n2); in TEST()
133 GraphTester graph; in TEST() local
134 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
135 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST()
136 Node* n2 = graph.NewNode(&dummy_operator, n0); in TEST()
137 Node* n3 = graph.NewNode(&dummy_operator); in TEST()
159 GraphTester graph; in TEST() local
160 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
161 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST()
162 Node* n3 = graph.NewNode(&dummy_operator); in TEST()
181 GraphTester graph; in TEST() local
182 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
183 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
184 Node* n2 = graph.NewNode(&dummy_operator); in TEST()
185 Node* n3 = graph.NewNode(&dummy_operator, n0, n1, n2); in TEST()
203 Node* n4 = graph.NewNode(&dummy_operator); in TEST()
232 GraphTester graph; in TEST() local
235 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
236 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
241 Node* n2 = graph.NewNode(&dummy_operator, n0); in TEST()
245 Node* n3 = graph.NewNode(&dummy_operator, n0); in TEST()
253 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
254 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST()
257 Node* n2 = graph.NewNode(&dummy_operator, n0); in TEST()
265 Node* n3 = graph.NewNode(&dummy_operator); in TEST()
281 GraphTester graph; in TEST() local
283 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
284 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST()
288 Node* n2 = graph.NewNode(&dummy_operator, n0); in TEST()
292 Node* n3 = graph.NewNode(&dummy_operator, n0); in TEST()
299 GraphTester graph; in TEST() local
301 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
302 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST()
303 Node* n2 = graph.NewNode(&dummy_operator, n0); in TEST()
304 Node* n3 = graph.NewNode(&dummy_operator, n0, n1, n2); in TEST()
309 Node* n4 = graph.NewNode(&dummy_operator, n0, n1, n2); in TEST()
310 n3->AppendInput(graph.zone(), n4); in TEST()
316 Node* n5 = graph.NewNode(&dummy_operator, n4); in TEST()
317 n3->AppendInput(graph.zone(), n4); in TEST()
342 GraphTester graph; in TEST() local
344 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
345 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST()
346 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); in TEST()
363 GraphTester graph; in TEST() local
365 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
366 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST()
367 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); in TEST()
379 Node* n3 = graph.NewNode(&dummy_operator); in TEST()
380 n2->AppendInput(graph.zone(), n3); in TEST()
400 GraphTester graph; in TEST() local
402 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
403 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST()
404 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); in TEST()
418 GraphTester graph; in TEST() local
420 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
421 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST()
422 Node* n2 = graph.NewNode(&dummy_operator, n0); in TEST()
423 Node* n3 = graph.NewNode(&dummy_operator, n0); in TEST()
424 n3->AppendInput(graph.zone(), n1); in TEST()
425 n3->AppendInput(graph.zone(), n2); in TEST()
441 GraphTester graph; in TEST() local
443 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
444 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST()
445 Node* n2 = graph.NewNode(&dummy_operator, n0); in TEST()
446 Node* n3 = graph.NewNode(&dummy_operator); in TEST()
447 n2->AppendInput(graph.zone(), n1); in TEST()
448 n2->AppendInput(graph.zone(), n0); in TEST()
477 GraphTester graph; in TEST() local
479 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
480 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST()
481 Node* n2 = graph.NewNode(&dummy_operator, n0); in TEST()
482 Node* n3 = graph.NewNode(&dummy_operator); in TEST()
505 n1->AppendInput(graph.zone(), n1); in TEST()
507 n1->AppendInput(graph.zone(), n3); in TEST()
519 GraphTester graph; in TEST() local
521 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
522 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST()
523 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); in TEST()
541 GraphTester graph; in TEST() local
543 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
544 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
545 Node* n2 = graph.NewNode(&dummy_operator, n0); in TEST()
550 Node* n3 = graph.NewNode(&dummy_operator, n0); in TEST()
558 GraphTester graph; in TEST() local
561 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
562 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST()
570 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
571 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST()
578 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
579 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
580 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); in TEST()
589 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
590 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
591 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); in TEST()
600 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
601 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
602 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); in TEST()
611 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
612 Node* n2 = graph.NewNode(&dummy_operator, n0, n0); in TEST()
620 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
621 Node* n2 = graph.NewNode(&dummy_operator, n0, n0); in TEST()
631 GraphTester graph; in TEST() local
634 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
635 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
636 n1->AppendInput(graph.zone(), n0); in TEST()
644 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
645 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
646 n1->AppendInput(graph.zone(), n0); in TEST()
654 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
655 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
656 Node* n2 = graph.NewNode(&dummy_operator); in TEST()
657 n2->AppendInput(graph.zone(), n0); in TEST()
658 n2->AppendInput(graph.zone(), n1); in TEST()
670 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
671 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
672 Node* n2 = graph.NewNode(&dummy_operator); in TEST()
673 n2->AppendInput(graph.zone(), n0); in TEST()
674 n2->AppendInput(graph.zone(), n1); in TEST()
685 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
686 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
687 Node* n2 = graph.NewNode(&dummy_operator); in TEST()
688 n2->AppendInput(graph.zone(), n0); in TEST()
689 n2->AppendInput(graph.zone(), n1); in TEST()
699 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
700 Node* n2 = graph.NewNode(&dummy_operator); in TEST()
701 n2->AppendInput(graph.zone(), n0); in TEST()
702 n2->AppendInput(graph.zone(), n0); in TEST()
712 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
713 Node* n2 = graph.NewNode(&dummy_operator); in TEST()
714 n2->AppendInput(graph.zone(), n0); in TEST()
715 n2->AppendInput(graph.zone(), n0); in TEST()
727 GraphTester graph; in TEST() local
730 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
731 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
732 Node* n2 = graph.NewNode(&dummy_operator, n0); in TEST()
733 n2->AppendInput(graph.zone(), n1); in TEST()
745 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
746 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
747 Node* n2 = graph.NewNode(&dummy_operator, n0); in TEST()
748 n2->AppendInput(graph.zone(), n1); in TEST()
759 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
760 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
761 Node* n2 = graph.NewNode(&dummy_operator, n0); in TEST()
762 n2->AppendInput(graph.zone(), n1); in TEST()
772 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
773 Node* n2 = graph.NewNode(&dummy_operator, n0); in TEST()
774 n2->AppendInput(graph.zone(), n0); in TEST()
784 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
785 Node* n2 = graph.NewNode(&dummy_operator, n0); in TEST()
786 n2->AppendInput(graph.zone(), n0); in TEST()
798 GraphTester graph; in TEST() local
801 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
802 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST()
805 n2 = graph.NewNode(&dummy_operator, n0, n1); in TEST()
807 n2 = graph.NewNode(&dummy_operator, n0); in TEST()
808 n2->AppendInput(graph.zone(), n1); // with out-of-line input. in TEST()
830 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
831 Node* n1 = graph.NewNode(&dummy_operator, n0); in TEST()