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