Lines Matching refs:NewNode
624 graph.SetStart(graph.NewNode(builder.Start(0))); in TEST()
625 graph.SetEnd(graph.NewNode(builder.End(), graph.start())); in TEST()
635 graph.SetStart(graph.NewNode(builder.Start(0))); in TEST()
637 Node* p1 = graph.NewNode(builder.Parameter(0), graph.start()); in TEST()
638 Node* ret = graph.NewNode(builder.Return(), p1, graph.start(), graph.start()); in TEST()
640 graph.SetEnd(graph.NewNode(builder.End(), ret)); in TEST()
651 graph.SetStart(graph.NewNode(builder.Start(3))); in TEST()
653 Node* p1 = graph.NewNode(builder.Parameter(0), graph.start()); in TEST()
654 Node* p2 = graph.NewNode(builder.Parameter(1), graph.start()); in TEST()
655 Node* p3 = graph.NewNode(builder.Parameter(2), graph.start()); in TEST()
656 Node* p4 = graph.NewNode(builder.Parameter(3), graph.start()); in TEST()
657 Node* p5 = graph.NewNode(builder.Parameter(4), graph.start()); in TEST()
658 Node* cmp = graph.NewNode(js_builder.LessThanOrEqual(), p1, p2, p3, in TEST()
660 Node* branch = graph.NewNode(builder.Branch(), cmp, graph.start()); in TEST()
661 Node* true_branch = graph.NewNode(builder.IfTrue(), branch); in TEST()
662 Node* false_branch = graph.NewNode(builder.IfFalse(), branch); in TEST()
664 Node* ret1 = graph.NewNode(builder.Return(), p4, graph.start(), true_branch); in TEST()
665 Node* ret2 = graph.NewNode(builder.Return(), p5, graph.start(), false_branch); in TEST()
666 Node* merge = graph.NewNode(builder.Merge(2), ret1, ret2); in TEST()
667 graph.SetEnd(graph.NewNode(builder.End(), merge)); in TEST()
694 Node* n0 = graph.NewNode(op); in TEST()
696 Node* nil = graph.NewNode(common_builder.Dead()); in TEST()
698 Node* n23 = graph.NewNode(op, nil); in TEST()
701 Node* n22 = graph.NewNode(op, nil, nil); in TEST()
704 Node* n16 = graph.NewNode(op, nil, nil, nil); in TEST()
707 Node* n15 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
710 Node* n14 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
713 Node* n13 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
716 Node* n11 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
719 Node* n2 = graph.NewNode(op, n0); in TEST()
723 Node* n3 = graph.NewNode(op, n0); in TEST()
727 Node* n7 = graph.NewNode(op); in TEST()
731 Node* n8 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
740 Node* n10 = graph.NewNode(op, nil); in TEST()
743 Node* n9 = graph.NewNode(op, nil, nil); in TEST()
751 Node* n12 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
754 Node* n4 = graph.NewNode(op, n0); in TEST()
772 Node* n5 = graph.NewNode(op, n0); in TEST()
783 Node* n21 = graph.NewNode(op, nil, nil, nil); in TEST()
786 Node* n20 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
789 Node* n19 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
796 Node* n18 = graph.NewNode(op, nil); in TEST()
838 Node* n0 = graph.NewNode(op); in TEST()
840 Node* nil = graph.NewNode(common_builder.Dead()); in TEST()
842 Node* n20 = graph.NewNode(op, nil); in TEST()
845 Node* n19 = graph.NewNode(op, nil, nil, nil); in TEST()
848 Node* n8 = graph.NewNode(op, nil, nil, nil); in TEST()
851 Node* n2 = graph.NewNode(op, n0); in TEST()
855 Node* n18 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
858 Node* n16 = graph.NewNode(op, nil, nil, nil, nil); in TEST()
862 Node* n5 = graph.NewNode(op); in TEST()
866 Node* n12 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
870 Node* n9 = graph.NewNode(op, nil, nil, nil); in TEST()
873 Node* n3 = graph.NewNode(op, n0); in TEST()
878 Node* n6 = graph.NewNode(op, nil, nil); in TEST()
882 Node* n14 = graph.NewNode(op, nil); in TEST()
885 Node* n13 = graph.NewNode(op, nil, nil); in TEST()
895 Node* n10 = graph.NewNode(op, nil, nil, nil); in TEST()
906 Node* n17 = graph.NewNode(op); in TEST()
917 Node* n15 = graph.NewNode(op, nil); in TEST()
956 Node* n0 = graph.NewNode(op); in TEST()
958 Node* nil = graph.NewNode(common_builder.Dead()); in TEST()
960 Node* n46 = graph.NewNode(op, nil); in TEST()
963 Node* n45 = graph.NewNode(op, nil, nil, nil); in TEST()
966 Node* n35 = graph.NewNode(op, nil, nil, nil); in TEST()
969 Node* n9 = graph.NewNode(op, nil, nil, nil); in TEST()
972 Node* n2 = graph.NewNode(op, n0); in TEST()
976 Node* n23 = graph.NewNode(op, nil, nil, nil); in TEST()
979 Node* n20 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
982 Node* n18 = graph.NewNode(op, nil, nil, nil, nil); in TEST()
986 Node* n6 = graph.NewNode(op); in TEST()
990 Node* n14 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
994 Node* n10 = graph.NewNode(op, nil, nil, nil); in TEST()
997 Node* n3 = graph.NewNode(op, n0); in TEST()
1001 Node* n24 = graph.NewNode(op, nil, nil, nil); in TEST()
1006 Node* n21 = graph.NewNode(op, nil, nil); in TEST()
1009 Node* n16 = graph.NewNode(op, nil); in TEST()
1012 Node* n15 = graph.NewNode(op, nil, nil); in TEST()
1016 Node* n7 = graph.NewNode(op, nil, nil); in TEST()
1020 Node* n30 = graph.NewNode(op, nil); in TEST()
1023 Node* n28 = graph.NewNode(op, nil, nil); in TEST()
1026 Node* n27 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
1029 Node* n25 = graph.NewNode(op, nil, nil, nil); in TEST()
1032 Node* n11 = graph.NewNode(op, nil, nil, nil); in TEST()
1035 Node* n4 = graph.NewNode(op, n0); in TEST()
1042 Node* n32 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
1045 Node* n31 = graph.NewNode(op, nil, nil, nil, nil); in TEST()
1051 Node* n29 = graph.NewNode(op, nil); in TEST()
1057 Node* n19 = graph.NewNode(op); in TEST()
1069 Node* n26 = graph.NewNode(op, nil, nil, nil); in TEST()
1090 Node* n12 = graph.NewNode(op, nil, nil, nil); in TEST()
1111 Node* n44 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
1115 Node* n43 = graph.NewNode(op); in TEST()
1120 Node* n39 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
1124 Node* n36 = graph.NewNode(op, nil, nil, nil); in TEST()
1129 Node* n33 = graph.NewNode(op, nil, nil); in TEST()
1132 Node* n17 = graph.NewNode(op, nil); in TEST()
1137 Node* n41 = graph.NewNode(op, nil); in TEST()
1140 Node* n40 = graph.NewNode(op, nil, nil); in TEST()
1150 Node* n38 = graph.NewNode(op, nil, nil, nil); in TEST()
1164 Node* n42 = graph.NewNode(op, nil); in TEST()
1205 Node* n0 = graph.NewNode(op); in TEST()
1207 Node* nil = graph.NewNode(common_builder.Dead()); in TEST()
1209 Node* n58 = graph.NewNode(op, nil); in TEST()
1212 Node* n57 = graph.NewNode(op, nil, nil, nil); in TEST()
1215 Node* n56 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
1218 Node* n10 = graph.NewNode(op, nil, nil, nil); in TEST()
1221 Node* n2 = graph.NewNode(op, n0); in TEST()
1225 Node* n25 = graph.NewNode(op, nil, nil, nil); in TEST()
1228 Node* n22 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
1231 Node* n20 = graph.NewNode(op, nil, nil, nil, nil); in TEST()
1235 Node* n6 = graph.NewNode(op); in TEST()
1239 Node* n16 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
1243 Node* n11 = graph.NewNode(op, nil, nil, nil); in TEST()
1246 Node* n3 = graph.NewNode(op, n0); in TEST()
1250 Node* n26 = graph.NewNode(op, nil, nil, nil); in TEST()
1255 Node* n23 = graph.NewNode(op, nil, nil); in TEST()
1258 Node* n18 = graph.NewNode(op, nil); in TEST()
1261 Node* n17 = graph.NewNode(op, nil, nil); in TEST()
1265 Node* n8 = graph.NewNode(op, nil, nil); in TEST()
1269 Node* n53 = graph.NewNode(op, nil, nil); in TEST()
1272 Node* n49 = graph.NewNode(op, nil); in TEST()
1275 Node* n48 = graph.NewNode(op, nil, nil); in TEST()
1278 Node* n47 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
1282 Node* n46 = graph.NewNode(op); in TEST()
1287 Node* n42 = graph.NewNode(op, nil, nil, nil); in TEST()
1290 Node* n30 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
1293 Node* n27 = graph.NewNode(op, nil, nil, nil); in TEST()
1296 Node* n12 = graph.NewNode(op, nil, nil, nil); in TEST()
1299 Node* n4 = graph.NewNode(op, n0); in TEST()
1303 Node* n41 = graph.NewNode(op, nil, nil, nil); in TEST()
1307 Node* n35 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
1310 Node* n34 = graph.NewNode(op, nil, nil, nil, nil); in TEST()
1316 Node* n32 = graph.NewNode(op, nil); in TEST()
1319 Node* n31 = graph.NewNode(op, nil, nil); in TEST()
1327 Node* n21 = graph.NewNode(op); in TEST()
1335 Node* n40 = graph.NewNode(op, nil, nil); in TEST()
1338 Node* n33 = graph.NewNode(op, nil); in TEST()
1343 Node* n39 = graph.NewNode(op, nil); in TEST()
1346 Node* n38 = graph.NewNode(op, nil, nil); in TEST()
1349 Node* n37 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
1352 Node* n28 = graph.NewNode(op, nil, nil, nil); in TEST()
1355 Node* n13 = graph.NewNode(op, nil, nil, nil); in TEST()
1358 Node* n7 = graph.NewNode(op); in TEST()
1362 Node* n54 = graph.NewNode(op, nil, nil, nil); in TEST()
1366 Node* n52 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
1369 Node* n51 = graph.NewNode(op, nil, nil, nil, nil); in TEST()
1375 Node* n50 = graph.NewNode(op, nil); in TEST()
1393 Node* n36 = graph.NewNode(op); in TEST()
1413 Node* n29 = graph.NewNode(op, nil, nil, nil); in TEST()
1417 Node* n45 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
1420 Node* n44 = graph.NewNode(op, nil, nil, nil, nil); in TEST()
1426 Node* n43 = graph.NewNode(op, nil); in TEST()
1460 Node* n14 = graph.NewNode(op, nil, nil, nil); in TEST()
1464 Node* n55 = graph.NewNode(op, nil, nil, nil); in TEST()
1490 Node* n19 = graph.NewNode(op, nil); in TEST()
1527 Node* n0 = graph.NewNode(op); in TEST()
1529 Node* nil = graph.NewNode(common_builder.Dead()); in TEST()
1531 Node* n22 = graph.NewNode(op, nil); in TEST()
1534 Node* n21 = graph.NewNode(op, nil, nil, nil); in TEST()
1537 Node* n9 = graph.NewNode(op, nil, nil, nil); in TEST()
1540 Node* n2 = graph.NewNode(op, n0); in TEST()
1544 Node* n20 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
1548 Node* n19 = graph.NewNode(op, nil, nil); in TEST()
1551 Node* n10 = graph.NewNode(op, nil, nil, nil); in TEST()
1554 Node* n3 = graph.NewNode(op, n0); in TEST()
1559 Node* n7 = graph.NewNode(op, nil, nil); in TEST()
1563 Node* n17 = graph.NewNode(op, nil); in TEST()
1566 Node* n16 = graph.NewNode(op, nil, nil); in TEST()
1569 Node* n15 = graph.NewNode(op, nil, nil, nil, nil); in TEST()
1572 Node* n14 = graph.NewNode(op, nil, nil, nil, nil, nil); in TEST()
1577 Node* n6 = graph.NewNode(op); in TEST()
1581 Node* n12 = graph.NewNode(op, nil, nil, nil); in TEST()
1599 Node* n11 = graph.NewNode(op, nil, nil, nil); in TEST()
1602 Node* n4 = graph.NewNode(op, n0); in TEST()
1617 Node* n18 = graph.NewNode(op, nil); in TEST()
1637 Node* tv = graph->NewNode(common->Int32Constant(6)); in CreateDiamond()
1638 Node* fv = graph->NewNode(common->Int32Constant(7)); in CreateDiamond()
1639 Node* br = graph->NewNode(common->Branch(), cond, graph->start()); in CreateDiamond()
1640 Node* t = graph->NewNode(common->IfTrue(), br); in CreateDiamond()
1641 Node* f = graph->NewNode(common->IfFalse(), br); in CreateDiamond()
1642 Node* m = graph->NewNode(common->Merge(2), t, f); in CreateDiamond()
1643 Node* phi = graph->NewNode(common->Phi(kMachAnyTagged, 2), tv, fv, m); in CreateDiamond()
1653 Node* start = graph.NewNode(common.Start(1)); in TEST()
1656 Node* p0 = graph.NewNode(common.Parameter(0), start); in TEST()
1658 Node* ret = graph.NewNode(common.Return(), d1, start, start); in TEST()
1659 Node* end = graph.NewNode(common.End(), ret, start); in TEST()
1673 Node* start = graph.NewNode(common.Start(2)); in TEST()
1676 Node* p0 = graph.NewNode(common.Parameter(0), start); in TEST()
1677 Node* p1 = graph.NewNode(common.Parameter(1), start); in TEST()
1680 Node* add = graph.NewNode(machine.Int32Add(), d1, d2); in TEST()
1681 Node* ret = graph.NewNode(common.Return(), add, start, start); in TEST()
1682 Node* end = graph.NewNode(common.End(), ret, start); in TEST()
1696 Node* start = graph.NewNode(common.Start(2)); in TEST()
1699 Node* p0 = graph.NewNode(common.Parameter(0), start); in TEST()
1700 Node* p1 = graph.NewNode(common.Parameter(1), start); in TEST()
1703 Node* add = graph.NewNode(machine.Int32Add(), d1, d2); in TEST()
1705 Node* ret = graph.NewNode(common.Return(), d3, start, start); in TEST()
1706 Node* end = graph.NewNode(common.End(), ret, start); in TEST()