OLD | NEW |
1 // Copyright 2014 the V8 project authors. All rights reserved. | 1 // Copyright 2014 the V8 project authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "src/v8.h" | 5 #include "src/v8.h" |
6 #include "test/cctest/cctest.h" | 6 #include "test/cctest/cctest.h" |
7 | 7 |
8 #include "src/compiler/common-operator.h" | 8 #include "src/compiler/common-operator.h" |
9 #include "src/compiler/generic-node-inl.h" | 9 #include "src/compiler/generic-node-inl.h" |
10 #include "src/compiler/generic-node.h" | 10 #include "src/compiler/generic-node.h" |
(...skipping 826 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
837 op = common_builder.Start(0); | 837 op = common_builder.Start(0); |
838 Node* n0 = graph.NewNode(op); | 838 Node* n0 = graph.NewNode(op); |
839 USE(n0); | 839 USE(n0); |
840 Node* nil = graph.NewNode(common_builder.Dead()); | 840 Node* nil = graph.NewNode(common_builder.Dead()); |
841 op = common_builder.End(); | 841 op = common_builder.End(); |
842 Node* n20 = graph.NewNode(op, nil); | 842 Node* n20 = graph.NewNode(op, nil); |
843 USE(n20); | 843 USE(n20); |
844 op = common_builder.Return(); | 844 op = common_builder.Return(); |
845 Node* n19 = graph.NewNode(op, nil, nil, nil); | 845 Node* n19 = graph.NewNode(op, nil, nil, nil); |
846 USE(n19); | 846 USE(n19); |
847 op = common_builder.Phi(2); | 847 op = common_builder.Phi(kMachAnyTagged, 2); |
848 Node* n8 = graph.NewNode(op, nil, nil, nil); | 848 Node* n8 = graph.NewNode(op, nil, nil, nil); |
849 USE(n8); | 849 USE(n8); |
850 op = common_builder.Parameter(0); | 850 op = common_builder.Parameter(0); |
851 Node* n2 = graph.NewNode(op, n0); | 851 Node* n2 = graph.NewNode(op, n0); |
852 USE(n2); | 852 USE(n2); |
853 n8->ReplaceInput(0, n2); | 853 n8->ReplaceInput(0, n2); |
854 op = js_builder.Add(); | 854 op = js_builder.Add(); |
855 Node* n18 = graph.NewNode(op, nil, nil, nil, nil, nil); | 855 Node* n18 = graph.NewNode(op, nil, nil, nil, nil, nil); |
856 USE(n18); | 856 USE(n18); |
857 op = js_builder.ToNumber(); | 857 op = js_builder.ToNumber(); |
858 Node* n16 = graph.NewNode(op, nil, nil, nil, nil); | 858 Node* n16 = graph.NewNode(op, nil, nil, nil, nil); |
859 USE(n16); | 859 USE(n16); |
860 n16->ReplaceInput(0, n8); | 860 n16->ReplaceInput(0, n8); |
861 op = common_builder.HeapConstant(unique_constant); | 861 op = common_builder.HeapConstant(unique_constant); |
862 Node* n5 = graph.NewNode(op); | 862 Node* n5 = graph.NewNode(op); |
863 USE(n5); | 863 USE(n5); |
864 n16->ReplaceInput(1, n5); | 864 n16->ReplaceInput(1, n5); |
865 op = js_builder.LessThan(); | 865 op = js_builder.LessThan(); |
866 Node* n12 = graph.NewNode(op, nil, nil, nil, nil, nil); | 866 Node* n12 = graph.NewNode(op, nil, nil, nil, nil, nil); |
867 USE(n12); | 867 USE(n12); |
868 n12->ReplaceInput(0, n8); | 868 n12->ReplaceInput(0, n8); |
869 op = common_builder.Phi(2); | 869 op = common_builder.Phi(kMachAnyTagged, 2); |
870 Node* n9 = graph.NewNode(op, nil, nil, nil); | 870 Node* n9 = graph.NewNode(op, nil, nil, nil); |
871 USE(n9); | 871 USE(n9); |
872 op = common_builder.Parameter(0); | 872 op = common_builder.Parameter(0); |
873 Node* n3 = graph.NewNode(op, n0); | 873 Node* n3 = graph.NewNode(op, n0); |
874 USE(n3); | 874 USE(n3); |
875 n9->ReplaceInput(0, n3); | 875 n9->ReplaceInput(0, n3); |
876 n9->ReplaceInput(1, n9); | 876 n9->ReplaceInput(1, n9); |
877 op = common_builder.Loop(2); | 877 op = common_builder.Loop(2); |
878 Node* n6 = graph.NewNode(op, nil, nil); | 878 Node* n6 = graph.NewNode(op, nil, nil); |
879 USE(n6); | 879 USE(n6); |
880 n6->ReplaceInput(0, n0); | 880 n6->ReplaceInput(0, n0); |
881 op = common_builder.IfTrue(); | 881 op = common_builder.IfTrue(); |
882 Node* n14 = graph.NewNode(op, nil); | 882 Node* n14 = graph.NewNode(op, nil); |
883 USE(n14); | 883 USE(n14); |
884 op = common_builder.Branch(); | 884 op = common_builder.Branch(); |
885 Node* n13 = graph.NewNode(op, nil, nil); | 885 Node* n13 = graph.NewNode(op, nil, nil); |
886 USE(n13); | 886 USE(n13); |
887 n13->ReplaceInput(0, n12); | 887 n13->ReplaceInput(0, n12); |
888 n13->ReplaceInput(1, n6); | 888 n13->ReplaceInput(1, n6); |
889 n14->ReplaceInput(0, n13); | 889 n14->ReplaceInput(0, n13); |
890 n6->ReplaceInput(1, n14); | 890 n6->ReplaceInput(1, n14); |
891 n9->ReplaceInput(2, n6); | 891 n9->ReplaceInput(2, n6); |
892 n12->ReplaceInput(1, n9); | 892 n12->ReplaceInput(1, n9); |
893 n12->ReplaceInput(2, n5); | 893 n12->ReplaceInput(2, n5); |
894 op = common_builder.Phi(2); | 894 op = common_builder.Phi(kMachAnyTagged, 2); |
895 Node* n10 = graph.NewNode(op, nil, nil, nil); | 895 Node* n10 = graph.NewNode(op, nil, nil, nil); |
896 USE(n10); | 896 USE(n10); |
897 n10->ReplaceInput(0, n0); | 897 n10->ReplaceInput(0, n0); |
898 n10->ReplaceInput(1, n18); | 898 n10->ReplaceInput(1, n18); |
899 n10->ReplaceInput(2, n6); | 899 n10->ReplaceInput(2, n6); |
900 n12->ReplaceInput(3, n10); | 900 n12->ReplaceInput(3, n10); |
901 n12->ReplaceInput(4, n6); | 901 n12->ReplaceInput(4, n6); |
902 n16->ReplaceInput(2, n12); | 902 n16->ReplaceInput(2, n12); |
903 n16->ReplaceInput(3, n14); | 903 n16->ReplaceInput(3, n14); |
904 n18->ReplaceInput(0, n16); | 904 n18->ReplaceInput(0, n16); |
(...skipping 50 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
955 op = common_builder.Start(0); | 955 op = common_builder.Start(0); |
956 Node* n0 = graph.NewNode(op); | 956 Node* n0 = graph.NewNode(op); |
957 USE(n0); | 957 USE(n0); |
958 Node* nil = graph.NewNode(common_builder.Dead()); | 958 Node* nil = graph.NewNode(common_builder.Dead()); |
959 op = common_builder.End(); | 959 op = common_builder.End(); |
960 Node* n46 = graph.NewNode(op, nil); | 960 Node* n46 = graph.NewNode(op, nil); |
961 USE(n46); | 961 USE(n46); |
962 op = common_builder.Return(); | 962 op = common_builder.Return(); |
963 Node* n45 = graph.NewNode(op, nil, nil, nil); | 963 Node* n45 = graph.NewNode(op, nil, nil, nil); |
964 USE(n45); | 964 USE(n45); |
965 op = common_builder.Phi(2); | 965 op = common_builder.Phi(kMachAnyTagged, 2); |
966 Node* n35 = graph.NewNode(op, nil, nil, nil); | 966 Node* n35 = graph.NewNode(op, nil, nil, nil); |
967 USE(n35); | 967 USE(n35); |
968 op = common_builder.Phi(2); | 968 op = common_builder.Phi(kMachAnyTagged, 2); |
969 Node* n9 = graph.NewNode(op, nil, nil, nil); | 969 Node* n9 = graph.NewNode(op, nil, nil, nil); |
970 USE(n9); | 970 USE(n9); |
971 op = common_builder.Parameter(0); | 971 op = common_builder.Parameter(0); |
972 Node* n2 = graph.NewNode(op, n0); | 972 Node* n2 = graph.NewNode(op, n0); |
973 USE(n2); | 973 USE(n2); |
974 n9->ReplaceInput(0, n2); | 974 n9->ReplaceInput(0, n2); |
975 op = common_builder.Phi(2); | 975 op = common_builder.Phi(kMachAnyTagged, 2); |
976 Node* n23 = graph.NewNode(op, nil, nil, nil); | 976 Node* n23 = graph.NewNode(op, nil, nil, nil); |
977 USE(n23); | 977 USE(n23); |
978 op = js_builder.Add(); | 978 op = js_builder.Add(); |
979 Node* n20 = graph.NewNode(op, nil, nil, nil, nil, nil); | 979 Node* n20 = graph.NewNode(op, nil, nil, nil, nil, nil); |
980 USE(n20); | 980 USE(n20); |
981 op = js_builder.ToNumber(); | 981 op = js_builder.ToNumber(); |
982 Node* n18 = graph.NewNode(op, nil, nil, nil, nil); | 982 Node* n18 = graph.NewNode(op, nil, nil, nil, nil); |
983 USE(n18); | 983 USE(n18); |
984 n18->ReplaceInput(0, n9); | 984 n18->ReplaceInput(0, n9); |
985 op = common_builder.HeapConstant(unique_constant); | 985 op = common_builder.HeapConstant(unique_constant); |
986 Node* n6 = graph.NewNode(op); | 986 Node* n6 = graph.NewNode(op); |
987 USE(n6); | 987 USE(n6); |
988 n18->ReplaceInput(1, n6); | 988 n18->ReplaceInput(1, n6); |
989 op = js_builder.LessThan(); | 989 op = js_builder.LessThan(); |
990 Node* n14 = graph.NewNode(op, nil, nil, nil, nil, nil); | 990 Node* n14 = graph.NewNode(op, nil, nil, nil, nil, nil); |
991 USE(n14); | 991 USE(n14); |
992 n14->ReplaceInput(0, n9); | 992 n14->ReplaceInput(0, n9); |
993 op = common_builder.Phi(2); | 993 op = common_builder.Phi(kMachAnyTagged, 2); |
994 Node* n10 = graph.NewNode(op, nil, nil, nil); | 994 Node* n10 = graph.NewNode(op, nil, nil, nil); |
995 USE(n10); | 995 USE(n10); |
996 op = common_builder.Parameter(0); | 996 op = common_builder.Parameter(0); |
997 Node* n3 = graph.NewNode(op, n0); | 997 Node* n3 = graph.NewNode(op, n0); |
998 USE(n3); | 998 USE(n3); |
999 n10->ReplaceInput(0, n3); | 999 n10->ReplaceInput(0, n3); |
1000 op = common_builder.Phi(2); | 1000 op = common_builder.Phi(kMachAnyTagged, 2); |
1001 Node* n24 = graph.NewNode(op, nil, nil, nil); | 1001 Node* n24 = graph.NewNode(op, nil, nil, nil); |
1002 USE(n24); | 1002 USE(n24); |
1003 n24->ReplaceInput(0, n10); | 1003 n24->ReplaceInput(0, n10); |
1004 n24->ReplaceInput(1, n24); | 1004 n24->ReplaceInput(1, n24); |
1005 op = common_builder.Loop(2); | 1005 op = common_builder.Loop(2); |
1006 Node* n21 = graph.NewNode(op, nil, nil); | 1006 Node* n21 = graph.NewNode(op, nil, nil); |
1007 USE(n21); | 1007 USE(n21); |
1008 op = common_builder.IfTrue(); | 1008 op = common_builder.IfTrue(); |
1009 Node* n16 = graph.NewNode(op, nil); | 1009 Node* n16 = graph.NewNode(op, nil); |
1010 USE(n16); | 1010 USE(n16); |
1011 op = common_builder.Branch(); | 1011 op = common_builder.Branch(); |
1012 Node* n15 = graph.NewNode(op, nil, nil); | 1012 Node* n15 = graph.NewNode(op, nil, nil); |
1013 USE(n15); | 1013 USE(n15); |
1014 n15->ReplaceInput(0, n14); | 1014 n15->ReplaceInput(0, n14); |
1015 op = common_builder.Loop(2); | 1015 op = common_builder.Loop(2); |
1016 Node* n7 = graph.NewNode(op, nil, nil); | 1016 Node* n7 = graph.NewNode(op, nil, nil); |
1017 USE(n7); | 1017 USE(n7); |
1018 n7->ReplaceInput(0, n0); | 1018 n7->ReplaceInput(0, n0); |
1019 op = common_builder.IfFalse(); | 1019 op = common_builder.IfFalse(); |
1020 Node* n30 = graph.NewNode(op, nil); | 1020 Node* n30 = graph.NewNode(op, nil); |
1021 USE(n30); | 1021 USE(n30); |
1022 op = common_builder.Branch(); | 1022 op = common_builder.Branch(); |
1023 Node* n28 = graph.NewNode(op, nil, nil); | 1023 Node* n28 = graph.NewNode(op, nil, nil); |
1024 USE(n28); | 1024 USE(n28); |
1025 op = js_builder.LessThan(); | 1025 op = js_builder.LessThan(); |
1026 Node* n27 = graph.NewNode(op, nil, nil, nil, nil, nil); | 1026 Node* n27 = graph.NewNode(op, nil, nil, nil, nil, nil); |
1027 USE(n27); | 1027 USE(n27); |
1028 op = common_builder.Phi(2); | 1028 op = common_builder.Phi(kMachAnyTagged, 2); |
1029 Node* n25 = graph.NewNode(op, nil, nil, nil); | 1029 Node* n25 = graph.NewNode(op, nil, nil, nil); |
1030 USE(n25); | 1030 USE(n25); |
1031 op = common_builder.Phi(2); | 1031 op = common_builder.Phi(kMachAnyTagged, 2); |
1032 Node* n11 = graph.NewNode(op, nil, nil, nil); | 1032 Node* n11 = graph.NewNode(op, nil, nil, nil); |
1033 USE(n11); | 1033 USE(n11); |
1034 op = common_builder.Parameter(0); | 1034 op = common_builder.Parameter(0); |
1035 Node* n4 = graph.NewNode(op, n0); | 1035 Node* n4 = graph.NewNode(op, n0); |
1036 USE(n4); | 1036 USE(n4); |
1037 n11->ReplaceInput(0, n4); | 1037 n11->ReplaceInput(0, n4); |
1038 n11->ReplaceInput(1, n25); | 1038 n11->ReplaceInput(1, n25); |
1039 n11->ReplaceInput(2, n7); | 1039 n11->ReplaceInput(2, n7); |
1040 n25->ReplaceInput(0, n11); | 1040 n25->ReplaceInput(0, n11); |
1041 op = js_builder.Add(); | 1041 op = js_builder.Add(); |
(...skipping 16 matching lines...) Expand all Loading... |
1058 USE(n19); | 1058 USE(n19); |
1059 n32->ReplaceInput(1, n19); | 1059 n32->ReplaceInput(1, n19); |
1060 n32->ReplaceInput(2, n6); | 1060 n32->ReplaceInput(2, n6); |
1061 n32->ReplaceInput(3, n31); | 1061 n32->ReplaceInput(3, n31); |
1062 n32->ReplaceInput(4, n29); | 1062 n32->ReplaceInput(4, n29); |
1063 n25->ReplaceInput(1, n32); | 1063 n25->ReplaceInput(1, n32); |
1064 n25->ReplaceInput(2, n21); | 1064 n25->ReplaceInput(2, n21); |
1065 n27->ReplaceInput(0, n25); | 1065 n27->ReplaceInput(0, n25); |
1066 n27->ReplaceInput(1, n24); | 1066 n27->ReplaceInput(1, n24); |
1067 n27->ReplaceInput(2, n6); | 1067 n27->ReplaceInput(2, n6); |
1068 op = common_builder.Phi(2); | 1068 op = common_builder.Phi(kMachAnyTagged, 2); |
1069 Node* n26 = graph.NewNode(op, nil, nil, nil); | 1069 Node* n26 = graph.NewNode(op, nil, nil, nil); |
1070 USE(n26); | 1070 USE(n26); |
1071 n26->ReplaceInput(0, n20); | 1071 n26->ReplaceInput(0, n20); |
1072 n26->ReplaceInput(1, n32); | 1072 n26->ReplaceInput(1, n32); |
1073 n26->ReplaceInput(2, n21); | 1073 n26->ReplaceInput(2, n21); |
1074 n27->ReplaceInput(3, n26); | 1074 n27->ReplaceInput(3, n26); |
1075 n27->ReplaceInput(4, n21); | 1075 n27->ReplaceInput(4, n21); |
1076 n28->ReplaceInput(0, n27); | 1076 n28->ReplaceInput(0, n27); |
1077 n28->ReplaceInput(1, n21); | 1077 n28->ReplaceInput(1, n21); |
1078 n30->ReplaceInput(0, n28); | 1078 n30->ReplaceInput(0, n28); |
1079 n7->ReplaceInput(1, n30); | 1079 n7->ReplaceInput(1, n30); |
1080 n15->ReplaceInput(1, n7); | 1080 n15->ReplaceInput(1, n7); |
1081 n16->ReplaceInput(0, n15); | 1081 n16->ReplaceInput(0, n15); |
1082 n21->ReplaceInput(0, n16); | 1082 n21->ReplaceInput(0, n16); |
1083 n21->ReplaceInput(1, n29); | 1083 n21->ReplaceInput(1, n29); |
1084 n24->ReplaceInput(2, n21); | 1084 n24->ReplaceInput(2, n21); |
1085 n10->ReplaceInput(1, n24); | 1085 n10->ReplaceInput(1, n24); |
1086 n10->ReplaceInput(2, n7); | 1086 n10->ReplaceInput(2, n7); |
1087 n14->ReplaceInput(1, n10); | 1087 n14->ReplaceInput(1, n10); |
1088 n14->ReplaceInput(2, n6); | 1088 n14->ReplaceInput(2, n6); |
1089 op = common_builder.Phi(2); | 1089 op = common_builder.Phi(kMachAnyTagged, 2); |
1090 Node* n12 = graph.NewNode(op, nil, nil, nil); | 1090 Node* n12 = graph.NewNode(op, nil, nil, nil); |
1091 USE(n12); | 1091 USE(n12); |
1092 n12->ReplaceInput(0, n0); | 1092 n12->ReplaceInput(0, n0); |
1093 n12->ReplaceInput(1, n27); | 1093 n12->ReplaceInput(1, n27); |
1094 n12->ReplaceInput(2, n7); | 1094 n12->ReplaceInput(2, n7); |
1095 n14->ReplaceInput(3, n12); | 1095 n14->ReplaceInput(3, n12); |
1096 n14->ReplaceInput(4, n7); | 1096 n14->ReplaceInput(4, n7); |
1097 n18->ReplaceInput(2, n14); | 1097 n18->ReplaceInput(2, n14); |
1098 n18->ReplaceInput(3, n16); | 1098 n18->ReplaceInput(3, n16); |
1099 n20->ReplaceInput(0, n18); | 1099 n20->ReplaceInput(0, n18); |
(...skipping 13 matching lines...) Expand all Loading... |
1113 n44->ReplaceInput(0, n35); | 1113 n44->ReplaceInput(0, n35); |
1114 op = common_builder.NumberConstant(0); | 1114 op = common_builder.NumberConstant(0); |
1115 Node* n43 = graph.NewNode(op); | 1115 Node* n43 = graph.NewNode(op); |
1116 USE(n43); | 1116 USE(n43); |
1117 n44->ReplaceInput(1, n43); | 1117 n44->ReplaceInput(1, n43); |
1118 n44->ReplaceInput(2, n6); | 1118 n44->ReplaceInput(2, n6); |
1119 op = js_builder.LessThan(); | 1119 op = js_builder.LessThan(); |
1120 Node* n39 = graph.NewNode(op, nil, nil, nil, nil, nil); | 1120 Node* n39 = graph.NewNode(op, nil, nil, nil, nil, nil); |
1121 USE(n39); | 1121 USE(n39); |
1122 n39->ReplaceInput(0, n35); | 1122 n39->ReplaceInput(0, n35); |
1123 op = common_builder.Phi(2); | 1123 op = common_builder.Phi(kMachAnyTagged, 2); |
1124 Node* n36 = graph.NewNode(op, nil, nil, nil); | 1124 Node* n36 = graph.NewNode(op, nil, nil, nil); |
1125 USE(n36); | 1125 USE(n36); |
1126 n36->ReplaceInput(0, n10); | 1126 n36->ReplaceInput(0, n10); |
1127 n36->ReplaceInput(1, n36); | 1127 n36->ReplaceInput(1, n36); |
1128 op = common_builder.Loop(2); | 1128 op = common_builder.Loop(2); |
1129 Node* n33 = graph.NewNode(op, nil, nil); | 1129 Node* n33 = graph.NewNode(op, nil, nil); |
1130 USE(n33); | 1130 USE(n33); |
1131 op = common_builder.IfFalse(); | 1131 op = common_builder.IfFalse(); |
1132 Node* n17 = graph.NewNode(op, nil); | 1132 Node* n17 = graph.NewNode(op, nil); |
1133 USE(n17); | 1133 USE(n17); |
1134 n17->ReplaceInput(0, n15); | 1134 n17->ReplaceInput(0, n15); |
1135 n33->ReplaceInput(0, n17); | 1135 n33->ReplaceInput(0, n17); |
1136 op = common_builder.IfTrue(); | 1136 op = common_builder.IfTrue(); |
1137 Node* n41 = graph.NewNode(op, nil); | 1137 Node* n41 = graph.NewNode(op, nil); |
1138 USE(n41); | 1138 USE(n41); |
1139 op = common_builder.Branch(); | 1139 op = common_builder.Branch(); |
1140 Node* n40 = graph.NewNode(op, nil, nil); | 1140 Node* n40 = graph.NewNode(op, nil, nil); |
1141 USE(n40); | 1141 USE(n40); |
1142 n40->ReplaceInput(0, n39); | 1142 n40->ReplaceInput(0, n39); |
1143 n40->ReplaceInput(1, n33); | 1143 n40->ReplaceInput(1, n33); |
1144 n41->ReplaceInput(0, n40); | 1144 n41->ReplaceInput(0, n40); |
1145 n33->ReplaceInput(1, n41); | 1145 n33->ReplaceInput(1, n41); |
1146 n36->ReplaceInput(2, n33); | 1146 n36->ReplaceInput(2, n33); |
1147 n39->ReplaceInput(1, n36); | 1147 n39->ReplaceInput(1, n36); |
1148 n39->ReplaceInput(2, n6); | 1148 n39->ReplaceInput(2, n6); |
1149 op = common_builder.Phi(2); | 1149 op = common_builder.Phi(kMachAnyTagged, 2); |
1150 Node* n38 = graph.NewNode(op, nil, nil, nil); | 1150 Node* n38 = graph.NewNode(op, nil, nil, nil); |
1151 USE(n38); | 1151 USE(n38); |
1152 n38->ReplaceInput(0, n14); | 1152 n38->ReplaceInput(0, n14); |
1153 n38->ReplaceInput(1, n44); | 1153 n38->ReplaceInput(1, n44); |
1154 n38->ReplaceInput(2, n33); | 1154 n38->ReplaceInput(2, n33); |
1155 n39->ReplaceInput(3, n38); | 1155 n39->ReplaceInput(3, n38); |
1156 n39->ReplaceInput(4, n33); | 1156 n39->ReplaceInput(4, n33); |
1157 n44->ReplaceInput(3, n39); | 1157 n44->ReplaceInput(3, n39); |
1158 n44->ReplaceInput(4, n41); | 1158 n44->ReplaceInput(4, n41); |
1159 n35->ReplaceInput(1, n44); | 1159 n35->ReplaceInput(1, n44); |
(...skipping 47 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1207 Node* nil = graph.NewNode(common_builder.Dead()); | 1207 Node* nil = graph.NewNode(common_builder.Dead()); |
1208 op = common_builder.End(); | 1208 op = common_builder.End(); |
1209 Node* n58 = graph.NewNode(op, nil); | 1209 Node* n58 = graph.NewNode(op, nil); |
1210 USE(n58); | 1210 USE(n58); |
1211 op = common_builder.Return(); | 1211 op = common_builder.Return(); |
1212 Node* n57 = graph.NewNode(op, nil, nil, nil); | 1212 Node* n57 = graph.NewNode(op, nil, nil, nil); |
1213 USE(n57); | 1213 USE(n57); |
1214 op = js_builder.Add(); | 1214 op = js_builder.Add(); |
1215 Node* n56 = graph.NewNode(op, nil, nil, nil, nil, nil); | 1215 Node* n56 = graph.NewNode(op, nil, nil, nil, nil, nil); |
1216 USE(n56); | 1216 USE(n56); |
1217 op = common_builder.Phi(2); | 1217 op = common_builder.Phi(kMachAnyTagged, 2); |
1218 Node* n10 = graph.NewNode(op, nil, nil, nil); | 1218 Node* n10 = graph.NewNode(op, nil, nil, nil); |
1219 USE(n10); | 1219 USE(n10); |
1220 op = common_builder.Parameter(0); | 1220 op = common_builder.Parameter(0); |
1221 Node* n2 = graph.NewNode(op, n0); | 1221 Node* n2 = graph.NewNode(op, n0); |
1222 USE(n2); | 1222 USE(n2); |
1223 n10->ReplaceInput(0, n2); | 1223 n10->ReplaceInput(0, n2); |
1224 op = common_builder.Phi(2); | 1224 op = common_builder.Phi(kMachAnyTagged, 2); |
1225 Node* n25 = graph.NewNode(op, nil, nil, nil); | 1225 Node* n25 = graph.NewNode(op, nil, nil, nil); |
1226 USE(n25); | 1226 USE(n25); |
1227 op = js_builder.Add(); | 1227 op = js_builder.Add(); |
1228 Node* n22 = graph.NewNode(op, nil, nil, nil, nil, nil); | 1228 Node* n22 = graph.NewNode(op, nil, nil, nil, nil, nil); |
1229 USE(n22); | 1229 USE(n22); |
1230 op = js_builder.ToNumber(); | 1230 op = js_builder.ToNumber(); |
1231 Node* n20 = graph.NewNode(op, nil, nil, nil, nil); | 1231 Node* n20 = graph.NewNode(op, nil, nil, nil, nil); |
1232 USE(n20); | 1232 USE(n20); |
1233 n20->ReplaceInput(0, n10); | 1233 n20->ReplaceInput(0, n10); |
1234 op = common_builder.HeapConstant(unique_constant); | 1234 op = common_builder.HeapConstant(unique_constant); |
1235 Node* n6 = graph.NewNode(op); | 1235 Node* n6 = graph.NewNode(op); |
1236 USE(n6); | 1236 USE(n6); |
1237 n20->ReplaceInput(1, n6); | 1237 n20->ReplaceInput(1, n6); |
1238 op = js_builder.LessThan(); | 1238 op = js_builder.LessThan(); |
1239 Node* n16 = graph.NewNode(op, nil, nil, nil, nil, nil); | 1239 Node* n16 = graph.NewNode(op, nil, nil, nil, nil, nil); |
1240 USE(n16); | 1240 USE(n16); |
1241 n16->ReplaceInput(0, n10); | 1241 n16->ReplaceInput(0, n10); |
1242 op = common_builder.Phi(2); | 1242 op = common_builder.Phi(kMachAnyTagged, 2); |
1243 Node* n11 = graph.NewNode(op, nil, nil, nil); | 1243 Node* n11 = graph.NewNode(op, nil, nil, nil); |
1244 USE(n11); | 1244 USE(n11); |
1245 op = common_builder.Parameter(0); | 1245 op = common_builder.Parameter(0); |
1246 Node* n3 = graph.NewNode(op, n0); | 1246 Node* n3 = graph.NewNode(op, n0); |
1247 USE(n3); | 1247 USE(n3); |
1248 n11->ReplaceInput(0, n3); | 1248 n11->ReplaceInput(0, n3); |
1249 op = common_builder.Phi(2); | 1249 op = common_builder.Phi(kMachAnyTagged, 2); |
1250 Node* n26 = graph.NewNode(op, nil, nil, nil); | 1250 Node* n26 = graph.NewNode(op, nil, nil, nil); |
1251 USE(n26); | 1251 USE(n26); |
1252 n26->ReplaceInput(0, n11); | 1252 n26->ReplaceInput(0, n11); |
1253 n26->ReplaceInput(1, n26); | 1253 n26->ReplaceInput(1, n26); |
1254 op = common_builder.Loop(2); | 1254 op = common_builder.Loop(2); |
1255 Node* n23 = graph.NewNode(op, nil, nil); | 1255 Node* n23 = graph.NewNode(op, nil, nil); |
1256 USE(n23); | 1256 USE(n23); |
1257 op = common_builder.IfTrue(); | 1257 op = common_builder.IfTrue(); |
1258 Node* n18 = graph.NewNode(op, nil); | 1258 Node* n18 = graph.NewNode(op, nil); |
1259 USE(n18); | 1259 USE(n18); |
(...skipping 16 matching lines...) Expand all Loading... |
1276 USE(n48); | 1276 USE(n48); |
1277 op = js_builder.Equal(); | 1277 op = js_builder.Equal(); |
1278 Node* n47 = graph.NewNode(op, nil, nil, nil, nil, nil); | 1278 Node* n47 = graph.NewNode(op, nil, nil, nil, nil, nil); |
1279 USE(n47); | 1279 USE(n47); |
1280 n47->ReplaceInput(0, n25); | 1280 n47->ReplaceInput(0, n25); |
1281 op = common_builder.NumberConstant(0); | 1281 op = common_builder.NumberConstant(0); |
1282 Node* n46 = graph.NewNode(op); | 1282 Node* n46 = graph.NewNode(op); |
1283 USE(n46); | 1283 USE(n46); |
1284 n47->ReplaceInput(1, n46); | 1284 n47->ReplaceInput(1, n46); |
1285 n47->ReplaceInput(2, n6); | 1285 n47->ReplaceInput(2, n6); |
1286 op = common_builder.Phi(2); | 1286 op = common_builder.Phi(kMachAnyTagged, 2); |
1287 Node* n42 = graph.NewNode(op, nil, nil, nil); | 1287 Node* n42 = graph.NewNode(op, nil, nil, nil); |
1288 USE(n42); | 1288 USE(n42); |
1289 op = js_builder.LessThan(); | 1289 op = js_builder.LessThan(); |
1290 Node* n30 = graph.NewNode(op, nil, nil, nil, nil, nil); | 1290 Node* n30 = graph.NewNode(op, nil, nil, nil, nil, nil); |
1291 USE(n30); | 1291 USE(n30); |
1292 op = common_builder.Phi(2); | 1292 op = common_builder.Phi(kMachAnyTagged, 2); |
1293 Node* n27 = graph.NewNode(op, nil, nil, nil); | 1293 Node* n27 = graph.NewNode(op, nil, nil, nil); |
1294 USE(n27); | 1294 USE(n27); |
1295 op = common_builder.Phi(2); | 1295 op = common_builder.Phi(kMachAnyTagged, 2); |
1296 Node* n12 = graph.NewNode(op, nil, nil, nil); | 1296 Node* n12 = graph.NewNode(op, nil, nil, nil); |
1297 USE(n12); | 1297 USE(n12); |
1298 op = common_builder.Parameter(0); | 1298 op = common_builder.Parameter(0); |
1299 Node* n4 = graph.NewNode(op, n0); | 1299 Node* n4 = graph.NewNode(op, n0); |
1300 USE(n4); | 1300 USE(n4); |
1301 n12->ReplaceInput(0, n4); | 1301 n12->ReplaceInput(0, n4); |
1302 op = common_builder.Phi(2); | 1302 op = common_builder.Phi(kMachAnyTagged, 2); |
1303 Node* n41 = graph.NewNode(op, nil, nil, nil); | 1303 Node* n41 = graph.NewNode(op, nil, nil, nil); |
1304 USE(n41); | 1304 USE(n41); |
1305 n41->ReplaceInput(0, n27); | 1305 n41->ReplaceInput(0, n27); |
1306 op = js_builder.Add(); | 1306 op = js_builder.Add(); |
1307 Node* n35 = graph.NewNode(op, nil, nil, nil, nil, nil); | 1307 Node* n35 = graph.NewNode(op, nil, nil, nil, nil, nil); |
1308 USE(n35); | 1308 USE(n35); |
1309 op = js_builder.ToNumber(); | 1309 op = js_builder.ToNumber(); |
1310 Node* n34 = graph.NewNode(op, nil, nil, nil, nil); | 1310 Node* n34 = graph.NewNode(op, nil, nil, nil, nil); |
1311 USE(n34); | 1311 USE(n34); |
1312 n34->ReplaceInput(0, n27); | 1312 n34->ReplaceInput(0, n27); |
(...skipping 28 matching lines...) Expand all Loading... |
1341 n40->ReplaceInput(0, n33); | 1341 n40->ReplaceInput(0, n33); |
1342 op = common_builder.IfTrue(); | 1342 op = common_builder.IfTrue(); |
1343 Node* n39 = graph.NewNode(op, nil); | 1343 Node* n39 = graph.NewNode(op, nil); |
1344 USE(n39); | 1344 USE(n39); |
1345 op = common_builder.Branch(); | 1345 op = common_builder.Branch(); |
1346 Node* n38 = graph.NewNode(op, nil, nil); | 1346 Node* n38 = graph.NewNode(op, nil, nil); |
1347 USE(n38); | 1347 USE(n38); |
1348 op = js_builder.Equal(); | 1348 op = js_builder.Equal(); |
1349 Node* n37 = graph.NewNode(op, nil, nil, nil, nil, nil); | 1349 Node* n37 = graph.NewNode(op, nil, nil, nil, nil, nil); |
1350 USE(n37); | 1350 USE(n37); |
1351 op = common_builder.Phi(2); | 1351 op = common_builder.Phi(kMachAnyTagged, 2); |
1352 Node* n28 = graph.NewNode(op, nil, nil, nil); | 1352 Node* n28 = graph.NewNode(op, nil, nil, nil); |
1353 USE(n28); | 1353 USE(n28); |
1354 op = common_builder.Phi(2); | 1354 op = common_builder.Phi(kMachAnyTagged, 2); |
1355 Node* n13 = graph.NewNode(op, nil, nil, nil); | 1355 Node* n13 = graph.NewNode(op, nil, nil, nil); |
1356 USE(n13); | 1356 USE(n13); |
1357 op = common_builder.NumberConstant(0); | 1357 op = common_builder.NumberConstant(0); |
1358 Node* n7 = graph.NewNode(op); | 1358 Node* n7 = graph.NewNode(op); |
1359 USE(n7); | 1359 USE(n7); |
1360 n13->ReplaceInput(0, n7); | 1360 n13->ReplaceInput(0, n7); |
1361 op = common_builder.Phi(2); | 1361 op = common_builder.Phi(kMachAnyTagged, 2); |
1362 Node* n54 = graph.NewNode(op, nil, nil, nil); | 1362 Node* n54 = graph.NewNode(op, nil, nil, nil); |
1363 USE(n54); | 1363 USE(n54); |
1364 n54->ReplaceInput(0, n28); | 1364 n54->ReplaceInput(0, n28); |
1365 op = js_builder.Add(); | 1365 op = js_builder.Add(); |
1366 Node* n52 = graph.NewNode(op, nil, nil, nil, nil, nil); | 1366 Node* n52 = graph.NewNode(op, nil, nil, nil, nil, nil); |
1367 USE(n52); | 1367 USE(n52); |
1368 op = js_builder.ToNumber(); | 1368 op = js_builder.ToNumber(); |
1369 Node* n51 = graph.NewNode(op, nil, nil, nil, nil); | 1369 Node* n51 = graph.NewNode(op, nil, nil, nil, nil); |
1370 USE(n51); | 1370 USE(n51); |
1371 n51->ReplaceInput(0, n28); | 1371 n51->ReplaceInput(0, n28); |
(...skipping 30 matching lines...) Expand all Loading... |
1402 n40->ReplaceInput(1, n39); | 1402 n40->ReplaceInput(1, n39); |
1403 n41->ReplaceInput(2, n40); | 1403 n41->ReplaceInput(2, n40); |
1404 n12->ReplaceInput(1, n41); | 1404 n12->ReplaceInput(1, n41); |
1405 n12->ReplaceInput(2, n8); | 1405 n12->ReplaceInput(2, n8); |
1406 n27->ReplaceInput(0, n12); | 1406 n27->ReplaceInput(0, n12); |
1407 n27->ReplaceInput(1, n35); | 1407 n27->ReplaceInput(1, n35); |
1408 n27->ReplaceInput(2, n23); | 1408 n27->ReplaceInput(2, n23); |
1409 n30->ReplaceInput(0, n27); | 1409 n30->ReplaceInput(0, n27); |
1410 n30->ReplaceInput(1, n26); | 1410 n30->ReplaceInput(1, n26); |
1411 n30->ReplaceInput(2, n6); | 1411 n30->ReplaceInput(2, n6); |
1412 op = common_builder.Phi(2); | 1412 op = common_builder.Phi(kMachAnyTagged, 2); |
1413 Node* n29 = graph.NewNode(op, nil, nil, nil); | 1413 Node* n29 = graph.NewNode(op, nil, nil, nil); |
1414 USE(n29); | 1414 USE(n29); |
1415 n29->ReplaceInput(0, n22); | 1415 n29->ReplaceInput(0, n22); |
1416 op = js_builder.Add(); | 1416 op = js_builder.Add(); |
1417 Node* n45 = graph.NewNode(op, nil, nil, nil, nil, nil); | 1417 Node* n45 = graph.NewNode(op, nil, nil, nil, nil, nil); |
1418 USE(n45); | 1418 USE(n45); |
1419 op = js_builder.ToNumber(); | 1419 op = js_builder.ToNumber(); |
1420 Node* n44 = graph.NewNode(op, nil, nil, nil, nil); | 1420 Node* n44 = graph.NewNode(op, nil, nil, nil, nil); |
1421 USE(n44); | 1421 USE(n44); |
1422 n44->ReplaceInput(0, n25); | 1422 n44->ReplaceInput(0, n25); |
(...skipping 26 matching lines...) Expand all Loading... |
1449 n8->ReplaceInput(1, n53); | 1449 n8->ReplaceInput(1, n53); |
1450 n17->ReplaceInput(1, n8); | 1450 n17->ReplaceInput(1, n8); |
1451 n18->ReplaceInput(0, n17); | 1451 n18->ReplaceInput(0, n17); |
1452 n23->ReplaceInput(0, n18); | 1452 n23->ReplaceInput(0, n18); |
1453 n23->ReplaceInput(1, n43); | 1453 n23->ReplaceInput(1, n43); |
1454 n26->ReplaceInput(2, n23); | 1454 n26->ReplaceInput(2, n23); |
1455 n11->ReplaceInput(1, n26); | 1455 n11->ReplaceInput(1, n26); |
1456 n11->ReplaceInput(2, n8); | 1456 n11->ReplaceInput(2, n8); |
1457 n16->ReplaceInput(1, n11); | 1457 n16->ReplaceInput(1, n11); |
1458 n16->ReplaceInput(2, n6); | 1458 n16->ReplaceInput(2, n6); |
1459 op = common_builder.Phi(2); | 1459 op = common_builder.Phi(kMachAnyTagged, 2); |
1460 Node* n14 = graph.NewNode(op, nil, nil, nil); | 1460 Node* n14 = graph.NewNode(op, nil, nil, nil); |
1461 USE(n14); | 1461 USE(n14); |
1462 n14->ReplaceInput(0, n0); | 1462 n14->ReplaceInput(0, n0); |
1463 op = common_builder.Phi(2); | 1463 op = common_builder.Phi(kMachAnyTagged, 2); |
1464 Node* n55 = graph.NewNode(op, nil, nil, nil); | 1464 Node* n55 = graph.NewNode(op, nil, nil, nil); |
1465 USE(n55); | 1465 USE(n55); |
1466 n55->ReplaceInput(0, n47); | 1466 n55->ReplaceInput(0, n47); |
1467 n55->ReplaceInput(1, n52); | 1467 n55->ReplaceInput(1, n52); |
1468 n55->ReplaceInput(2, n53); | 1468 n55->ReplaceInput(2, n53); |
1469 n14->ReplaceInput(1, n55); | 1469 n14->ReplaceInput(1, n55); |
1470 n14->ReplaceInput(2, n8); | 1470 n14->ReplaceInput(2, n8); |
1471 n16->ReplaceInput(3, n14); | 1471 n16->ReplaceInput(3, n14); |
1472 n16->ReplaceInput(4, n8); | 1472 n16->ReplaceInput(4, n8); |
1473 n20->ReplaceInput(2, n16); | 1473 n20->ReplaceInput(2, n16); |
(...skipping 52 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1526 op = common_builder.Start(0); | 1526 op = common_builder.Start(0); |
1527 Node* n0 = graph.NewNode(op); | 1527 Node* n0 = graph.NewNode(op); |
1528 USE(n0); | 1528 USE(n0); |
1529 Node* nil = graph.NewNode(common_builder.Dead()); | 1529 Node* nil = graph.NewNode(common_builder.Dead()); |
1530 op = common_builder.End(); | 1530 op = common_builder.End(); |
1531 Node* n22 = graph.NewNode(op, nil); | 1531 Node* n22 = graph.NewNode(op, nil); |
1532 USE(n22); | 1532 USE(n22); |
1533 op = common_builder.Return(); | 1533 op = common_builder.Return(); |
1534 Node* n21 = graph.NewNode(op, nil, nil, nil); | 1534 Node* n21 = graph.NewNode(op, nil, nil, nil); |
1535 USE(n21); | 1535 USE(n21); |
1536 op = common_builder.Phi(2); | 1536 op = common_builder.Phi(kMachAnyTagged, 2); |
1537 Node* n9 = graph.NewNode(op, nil, nil, nil); | 1537 Node* n9 = graph.NewNode(op, nil, nil, nil); |
1538 USE(n9); | 1538 USE(n9); |
1539 op = common_builder.Parameter(0); | 1539 op = common_builder.Parameter(0); |
1540 Node* n2 = graph.NewNode(op, n0); | 1540 Node* n2 = graph.NewNode(op, n0); |
1541 USE(n2); | 1541 USE(n2); |
1542 n9->ReplaceInput(0, n2); | 1542 n9->ReplaceInput(0, n2); |
1543 op = js_builder.Add(); | 1543 op = js_builder.Add(); |
1544 Node* n20 = graph.NewNode(op, nil, nil, nil, nil, nil); | 1544 Node* n20 = graph.NewNode(op, nil, nil, nil, nil, nil); |
1545 USE(n20); | 1545 USE(n20); |
1546 n20->ReplaceInput(0, n9); | 1546 n20->ReplaceInput(0, n9); |
1547 op = machine_builder.Int32Add(); | 1547 op = machine_builder.Int32Add(); |
1548 Node* n19 = graph.NewNode(op, nil, nil); | 1548 Node* n19 = graph.NewNode(op, nil, nil); |
1549 USE(n19); | 1549 USE(n19); |
1550 op = common_builder.Phi(2); | 1550 op = common_builder.Phi(kMachAnyTagged, 2); |
1551 Node* n10 = graph.NewNode(op, nil, nil, nil); | 1551 Node* n10 = graph.NewNode(op, nil, nil, nil); |
1552 USE(n10); | 1552 USE(n10); |
1553 op = common_builder.Parameter(0); | 1553 op = common_builder.Parameter(0); |
1554 Node* n3 = graph.NewNode(op, n0); | 1554 Node* n3 = graph.NewNode(op, n0); |
1555 USE(n3); | 1555 USE(n3); |
1556 n10->ReplaceInput(0, n3); | 1556 n10->ReplaceInput(0, n3); |
1557 n10->ReplaceInput(1, n10); | 1557 n10->ReplaceInput(1, n10); |
1558 op = common_builder.Loop(2); | 1558 op = common_builder.Loop(2); |
1559 Node* n7 = graph.NewNode(op, nil, nil); | 1559 Node* n7 = graph.NewNode(op, nil, nil); |
1560 USE(n7); | 1560 USE(n7); |
1561 n7->ReplaceInput(0, n0); | 1561 n7->ReplaceInput(0, n0); |
1562 op = common_builder.IfTrue(); | 1562 op = common_builder.IfTrue(); |
1563 Node* n17 = graph.NewNode(op, nil); | 1563 Node* n17 = graph.NewNode(op, nil); |
1564 USE(n17); | 1564 USE(n17); |
1565 op = common_builder.Branch(); | 1565 op = common_builder.Branch(); |
1566 Node* n16 = graph.NewNode(op, nil, nil); | 1566 Node* n16 = graph.NewNode(op, nil, nil); |
1567 USE(n16); | 1567 USE(n16); |
1568 op = js_builder.ToBoolean(); | 1568 op = js_builder.ToBoolean(); |
1569 Node* n15 = graph.NewNode(op, nil, nil, nil, nil); | 1569 Node* n15 = graph.NewNode(op, nil, nil, nil, nil); |
1570 USE(n15); | 1570 USE(n15); |
1571 op = js_builder.LessThan(); | 1571 op = js_builder.LessThan(); |
1572 Node* n14 = graph.NewNode(op, nil, nil, nil, nil, nil); | 1572 Node* n14 = graph.NewNode(op, nil, nil, nil, nil, nil); |
1573 USE(n14); | 1573 USE(n14); |
1574 n14->ReplaceInput(0, n9); | 1574 n14->ReplaceInput(0, n9); |
1575 n14->ReplaceInput(1, n10); | 1575 n14->ReplaceInput(1, n10); |
1576 op = common_builder.HeapConstant(unique_constant); | 1576 op = common_builder.HeapConstant(unique_constant); |
1577 Node* n6 = graph.NewNode(op); | 1577 Node* n6 = graph.NewNode(op); |
1578 USE(n6); | 1578 USE(n6); |
1579 n14->ReplaceInput(2, n6); | 1579 n14->ReplaceInput(2, n6); |
1580 op = common_builder.Phi(2); | 1580 op = common_builder.Phi(kMachAnyTagged, 2); |
1581 Node* n12 = graph.NewNode(op, nil, nil, nil); | 1581 Node* n12 = graph.NewNode(op, nil, nil, nil); |
1582 USE(n12); | 1582 USE(n12); |
1583 n12->ReplaceInput(0, n0); | 1583 n12->ReplaceInput(0, n0); |
1584 n12->ReplaceInput(1, n20); | 1584 n12->ReplaceInput(1, n20); |
1585 n12->ReplaceInput(2, n7); | 1585 n12->ReplaceInput(2, n7); |
1586 n14->ReplaceInput(3, n12); | 1586 n14->ReplaceInput(3, n12); |
1587 n14->ReplaceInput(4, n7); | 1587 n14->ReplaceInput(4, n7); |
1588 n15->ReplaceInput(0, n14); | 1588 n15->ReplaceInput(0, n14); |
1589 n15->ReplaceInput(1, n6); | 1589 n15->ReplaceInput(1, n6); |
1590 n15->ReplaceInput(2, n14); | 1590 n15->ReplaceInput(2, n14); |
1591 n15->ReplaceInput(3, n7); | 1591 n15->ReplaceInput(3, n7); |
1592 n16->ReplaceInput(0, n15); | 1592 n16->ReplaceInput(0, n15); |
1593 n16->ReplaceInput(1, n7); | 1593 n16->ReplaceInput(1, n7); |
1594 n17->ReplaceInput(0, n16); | 1594 n17->ReplaceInput(0, n16); |
1595 n7->ReplaceInput(1, n17); | 1595 n7->ReplaceInput(1, n17); |
1596 n10->ReplaceInput(2, n7); | 1596 n10->ReplaceInput(2, n7); |
1597 n19->ReplaceInput(0, n2); | 1597 n19->ReplaceInput(0, n2); |
1598 op = common_builder.Phi(2); | 1598 op = common_builder.Phi(kMachAnyTagged, 2); |
1599 Node* n11 = graph.NewNode(op, nil, nil, nil); | 1599 Node* n11 = graph.NewNode(op, nil, nil, nil); |
1600 USE(n11); | 1600 USE(n11); |
1601 op = common_builder.Parameter(0); | 1601 op = common_builder.Parameter(0); |
1602 Node* n4 = graph.NewNode(op, n0); | 1602 Node* n4 = graph.NewNode(op, n0); |
1603 USE(n4); | 1603 USE(n4); |
1604 n11->ReplaceInput(0, n4); | 1604 n11->ReplaceInput(0, n4); |
1605 n11->ReplaceInput(1, n11); | 1605 n11->ReplaceInput(1, n11); |
1606 n11->ReplaceInput(2, n7); | 1606 n11->ReplaceInput(2, n7); |
1607 n19->ReplaceInput(1, n3); | 1607 n19->ReplaceInput(1, n3); |
1608 n20->ReplaceInput(1, n19); | 1608 n20->ReplaceInput(1, n19); |
(...skipping 24 matching lines...) Expand all Loading... |
1633 #if V8_TURBOFAN_TARGET | 1633 #if V8_TURBOFAN_TARGET |
1634 | 1634 |
1635 static Node* CreateDiamond(Graph* graph, CommonOperatorBuilder* common, | 1635 static Node* CreateDiamond(Graph* graph, CommonOperatorBuilder* common, |
1636 Node* cond) { | 1636 Node* cond) { |
1637 Node* tv = graph->NewNode(common->Int32Constant(6)); | 1637 Node* tv = graph->NewNode(common->Int32Constant(6)); |
1638 Node* fv = graph->NewNode(common->Int32Constant(7)); | 1638 Node* fv = graph->NewNode(common->Int32Constant(7)); |
1639 Node* br = graph->NewNode(common->Branch(), cond, graph->start()); | 1639 Node* br = graph->NewNode(common->Branch(), cond, graph->start()); |
1640 Node* t = graph->NewNode(common->IfTrue(), br); | 1640 Node* t = graph->NewNode(common->IfTrue(), br); |
1641 Node* f = graph->NewNode(common->IfFalse(), br); | 1641 Node* f = graph->NewNode(common->IfFalse(), br); |
1642 Node* m = graph->NewNode(common->Merge(2), t, f); | 1642 Node* m = graph->NewNode(common->Merge(2), t, f); |
1643 Node* phi = graph->NewNode(common->Phi(2), tv, fv, m); | 1643 Node* phi = graph->NewNode(common->Phi(kMachAnyTagged, 2), tv, fv, m); |
1644 return phi; | 1644 return phi; |
1645 } | 1645 } |
1646 | 1646 |
1647 | 1647 |
1648 TEST(FloatingDiamond1) { | 1648 TEST(FloatingDiamond1) { |
1649 HandleAndZoneScope scope; | 1649 HandleAndZoneScope scope; |
1650 Graph graph(scope.main_zone()); | 1650 Graph graph(scope.main_zone()); |
1651 CommonOperatorBuilder common(scope.main_zone()); | 1651 CommonOperatorBuilder common(scope.main_zone()); |
1652 | 1652 |
1653 Node* start = graph.NewNode(common.Start(1)); | 1653 Node* start = graph.NewNode(common.Start(1)); |
(...skipping 50 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1704 Node* d3 = CreateDiamond(&graph, &common, add); | 1704 Node* d3 = CreateDiamond(&graph, &common, add); |
1705 Node* ret = graph.NewNode(common.Return(), d3, start, start); | 1705 Node* ret = graph.NewNode(common.Return(), d3, start, start); |
1706 Node* end = graph.NewNode(common.End(), ret, start); | 1706 Node* end = graph.NewNode(common.End(), ret, start); |
1707 | 1707 |
1708 graph.SetEnd(end); | 1708 graph.SetEnd(end); |
1709 | 1709 |
1710 ComputeAndVerifySchedule(33, &graph); | 1710 ComputeAndVerifySchedule(33, &graph); |
1711 } | 1711 } |
1712 | 1712 |
1713 #endif | 1713 #endif |
OLD | NEW |