Lines Matching refs:NewNode
50 graph()->NewNode(simplified()->SpeculativeToNumber( in ReduceMathUnary()
53 Node* value = graph()->NewNode(op, input); in ReduceMathUnary()
76 graph()->NewNode(simplified()->SpeculativeToNumber( in ReduceMathBinary()
80 graph()->NewNode(simplified()->SpeculativeToNumber( in ReduceMathBinary()
83 Node* value = graph()->NewNode(op, left, right); in ReduceMathBinary()
107 graph()->NewNode(simplified()->SpeculativeToNumber( in ReduceMathImul()
111 graph()->NewNode(simplified()->SpeculativeToNumber( in ReduceMathImul()
114 left = graph()->NewNode(simplified()->NumberToUint32(), left); in ReduceMathImul()
115 right = graph()->NewNode(simplified()->NumberToUint32(), right); in ReduceMathImul()
116 Node* value = graph()->NewNode(simplified()->NumberImul(), left, right); in ReduceMathImul()
137 graph()->NewNode(simplified()->SpeculativeToNumber( in ReduceMathClz32()
140 input = graph()->NewNode(simplified()->NumberToUint32(), input); in ReduceMathClz32()
141 Node* value = graph()->NewNode(simplified()->NumberClz32(), input); in ReduceMathClz32()
162 graph()->NewNode(simplified()->SpeculativeToNumber( in ReduceMathMinMax()
166 Node* input = effect = graph()->NewNode( in ReduceMathMinMax()
170 value = graph()->NewNode(op, value, input); in ReduceMathMinMax()
240 value = graph()->NewNode(simplified()->ToBoolean(), value); in ReduceBooleanConstructor()
313 graph()->NewNode(simplified()->ReferenceEqual(), arguments_list, in ReduceFunctionPrototypeApply()
315 control = graph()->NewNode(common()->Branch(BranchHint::kFalse), in ReduceFunctionPrototypeApply()
317 Node* if_null = graph()->NewNode(common()->IfTrue(), control); in ReduceFunctionPrototypeApply()
318 control = graph()->NewNode(common()->IfFalse(), control); in ReduceFunctionPrototypeApply()
322 graph()->NewNode(simplified()->ReferenceEqual(), arguments_list, in ReduceFunctionPrototypeApply()
324 control = graph()->NewNode(common()->Branch(BranchHint::kFalse), in ReduceFunctionPrototypeApply()
326 Node* if_undefined = graph()->NewNode(common()->IfTrue(), control); in ReduceFunctionPrototypeApply()
327 control = graph()->NewNode(common()->IfFalse(), control); in ReduceFunctionPrototypeApply()
333 Node* value0 = effect0 = control0 = graph()->NewNode( in ReduceFunctionPrototypeApply()
340 graph()->NewNode(common()->Merge(2), if_null, if_undefined); in ReduceFunctionPrototypeApply()
342 graph()->NewNode(javascript()->Call(2), target, this_argument, in ReduceFunctionPrototypeApply()
350 graph()->NewNode(common()->IfException(), control0, effect0); in ReduceFunctionPrototypeApply()
351 control0 = graph()->NewNode(common()->IfSuccess(), control0); in ReduceFunctionPrototypeApply()
353 graph()->NewNode(common()->IfException(), control1, effect1); in ReduceFunctionPrototypeApply()
354 control1 = graph()->NewNode(common()->IfSuccess(), control1); in ReduceFunctionPrototypeApply()
358 graph()->NewNode(common()->Merge(2), if_exception0, if_exception1); in ReduceFunctionPrototypeApply()
359 Node* ephi = graph()->NewNode(common()->EffectPhi(2), if_exception0, in ReduceFunctionPrototypeApply()
362 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in ReduceFunctionPrototypeApply()
368 control = graph()->NewNode(common()->Merge(2), control0, control1); in ReduceFunctionPrototypeApply()
370 graph()->NewNode(common()->EffectPhi(2), effect0, effect1, control); in ReduceFunctionPrototypeApply()
372 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in ReduceFunctionPrototypeApply()
466 effect = graph()->NewNode( in ReduceFunctionPrototypeBind()
483 Node* value = effect = graph()->NewNode( in ReduceFunctionPrototypeBind()
505 context = effect = graph()->NewNode( in ReduceFunctionPrototypeCall()
629 Node* value = graph()->NewNode(simplified()->SameValue(), lhs, rhs); in ReduceObjectIs()
702 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), in ReduceObjectPrototypeHasOwnProperty()
704 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), in ReduceObjectPrototypeHasOwnProperty()
706 effect = graph()->NewNode( in ReduceObjectPrototypeHasOwnProperty()
844 Node* check = graph()->NewNode(simplified()->ObjectIsReceiver(), target); in ReduceReflectGet()
846 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceReflectGet()
849 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceReflectGet()
852 if_false = efalse = graph()->NewNode( in ReduceReflectGet()
861 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceReflectGet()
872 graph()->NewNode(common()->Call(call_descriptor), stub_code, target, in ReduceReflectGet()
880 Node* extrue = graph()->NewNode(common()->IfException(), etrue, if_true); in ReduceReflectGet()
881 if_true = graph()->NewNode(common()->IfSuccess(), if_true); in ReduceReflectGet()
882 Node* exfalse = graph()->NewNode(common()->IfException(), efalse, if_false); in ReduceReflectGet()
883 if_false = graph()->NewNode(common()->IfSuccess(), if_false); in ReduceReflectGet()
886 Node* merge = graph()->NewNode(common()->Merge(2), extrue, exfalse); in ReduceReflectGet()
888 graph()->NewNode(common()->EffectPhi(2), extrue, exfalse, merge); in ReduceReflectGet()
890 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in ReduceReflectGet()
896 if_false = graph()->NewNode(common()->Throw(), efalse, if_false); in ReduceReflectGet()
920 Node* check = graph()->NewNode(simplified()->ObjectIsReceiver(), target); in ReduceReflectHas()
922 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceReflectHas()
925 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceReflectHas()
928 if_false = efalse = graph()->NewNode( in ReduceReflectHas()
937 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceReflectHas()
942 graph()->NewNode(javascript()->HasProperty(), target, key, context, in ReduceReflectHas()
950 Node* extrue = graph()->NewNode(common()->IfException(), etrue, if_true); in ReduceReflectHas()
951 if_true = graph()->NewNode(common()->IfSuccess(), if_true); in ReduceReflectHas()
952 Node* exfalse = graph()->NewNode(common()->IfException(), efalse, if_false); in ReduceReflectHas()
953 if_false = graph()->NewNode(common()->IfSuccess(), if_false); in ReduceReflectHas()
956 Node* merge = graph()->NewNode(common()->Merge(2), extrue, exfalse); in ReduceReflectHas()
958 graph()->NewNode(common()->EffectPhi(2), extrue, exfalse, merge); in ReduceReflectHas()
960 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in ReduceReflectHas()
966 if_false = graph()->NewNode(common()->Throw(), efalse, if_false); in ReduceReflectHas()
987 graph()->NewNode(common()->Loop(2), *control, *control); in WireInLoopStart()
989 graph()->NewNode(common()->EffectPhi(2), *effect, *effect, loop); in WireInLoopStart()
990 Node* terminate = graph()->NewNode(common()->Terminate(), eloop, loop); in WireInLoopStart()
992 return graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), k, in WireInLoopStart()
1061 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayForEach()
1068 Node* original_length = effect = graph()->NewNode( in ReduceArrayForEach()
1093 graph()->NewNode(simplified()->NumberLessThan(), k, original_length); in ReduceArrayForEach()
1094 Node* continue_branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceArrayForEach()
1097 Node* if_true = graph()->NewNode(common()->IfTrue(), continue_branch); in ReduceArrayForEach()
1098 Node* if_false = graph()->NewNode(common()->IfFalse(), continue_branch); in ReduceArrayForEach()
1107 graph()->NewNode(common()->Checkpoint(), frame_state, effect, control); in ReduceArrayForEach()
1111 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayForEach()
1119 graph()->NewNode(simplified()->NumberAdd(), k, jsgraph()->OneConstant()); in ReduceArrayForEach()
1131 check = graph()->NewNode(simplified()->NumberIsFloat64Hole(), element); in ReduceArrayForEach()
1133 check = graph()->NewNode(simplified()->ReferenceEqual(), element, in ReduceArrayForEach()
1137 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceArrayForEach()
1138 hole_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceArrayForEach()
1139 hole_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceArrayForEach()
1145 element = effect = graph()->NewNode( in ReduceArrayForEach()
1154 control = effect = graph()->NewNode( in ReduceArrayForEach()
1171 control = graph()->NewNode(common()->Merge(2), control, after_call_control); in ReduceArrayForEach()
1172 effect = graph()->NewNode(common()->EffectPhi(2), effect, after_call_effect, in ReduceArrayForEach()
1186 graph()->NewNode(common()->Throw(), check_throw, check_fail); in ReduceArrayForEach()
1231 return graph()->NewNode(simplified()->NumberIsFloat64Hole(), element); in ReduceArrayReduce()
1233 return graph()->NewNode(simplified()->ReferenceEqual(), element, in ReduceArrayReduce()
1246 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayReduce()
1251 Node* original_length = effect = graph()->NewNode( in ReduceArrayReduce()
1257 : graph()->NewNode(simplified()->NumberSubtract(), original_length, in ReduceArrayReduce()
1308 effect = graph()->NewNode(common()->Checkpoint(), in ReduceArrayReduce()
1311 left ? graph()->NewNode(simplified()->NumberLessThan(), k, in ReduceArrayReduce()
1313 : graph()->NewNode(simplified()->NumberLessThanOrEqual(), in ReduceArrayReduce()
1315 effect = graph()->NewNode( in ReduceArrayReduce()
1320 Node* next_k = graph()->NewNode(next_op, k, jsgraph()->OneConstant()); in ReduceArrayReduce()
1322 Node* hole_branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceArrayReduce()
1324 Node* found_el = graph()->NewNode(common()->IfFalse(), hole_branch); in ReduceArrayReduce()
1326 Node* is_hole = graph()->NewNode(common()->IfTrue(), hole_branch); in ReduceArrayReduce()
1330 cur = effect = graph()->NewNode(common()->TypeGuard(Type::NonInternal()), in ReduceArrayReduce()
1336 Node* loop = control = graph()->NewNode(common()->Loop(2), control, control); in ReduceArrayReduce()
1338 graph()->NewNode(common()->EffectPhi(2), effect, effect, loop); in ReduceArrayReduce()
1339 Node* terminate = graph()->NewNode(common()->Terminate(), eloop, loop); in ReduceArrayReduce()
1341 Node* kloop = k = graph()->NewNode( in ReduceArrayReduce()
1343 Node* curloop = cur = graph()->NewNode( in ReduceArrayReduce()
1351 ? graph()->NewNode(simplified()->NumberLessThan(), k, original_length) in ReduceArrayReduce()
1352 : graph()->NewNode(simplified()->NumberLessThanOrEqual(), in ReduceArrayReduce()
1355 Node* continue_branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceArrayReduce()
1358 Node* if_true = graph()->NewNode(common()->IfTrue(), continue_branch); in ReduceArrayReduce()
1359 Node* if_false = graph()->NewNode(common()->IfFalse(), continue_branch); in ReduceArrayReduce()
1374 graph()->NewNode(common()->Checkpoint(), frame_state, effect, control); in ReduceArrayReduce()
1378 effect = graph()->NewNode( in ReduceArrayReduce()
1385 Node* next_k = graph()->NewNode(next_op, k, jsgraph()->OneConstant()); in ReduceArrayReduce()
1394 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kFalse), in ReduceArrayReduce()
1396 hole_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceArrayReduce()
1397 hole_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceArrayReduce()
1403 element = effect = graph()->NewNode( in ReduceArrayReduce()
1421 graph()->NewNode(javascript()->Call(6, p.frequency()), fncallback, in ReduceArrayReduce()
1439 control = graph()->NewNode(common()->Merge(2), control, after_call_control); in ReduceArrayReduce()
1440 effect = graph()->NewNode(common()->EffectPhi(2), effect, after_call_effect, in ReduceArrayReduce()
1443 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), cur, in ReduceArrayReduce()
1463 graph()->NewNode(common()->Throw(), check_throw, check_fail); in ReduceArrayReduce()
1531 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayMap()
1536 Node* original_length = effect = graph()->NewNode( in ReduceArrayMap()
1542 Node* a = control = effect = graph()->NewNode( in ReduceArrayMap()
1568 graph()->NewNode(simplified()->NumberLessThan(), k, original_length); in ReduceArrayMap()
1569 Node* continue_branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceArrayMap()
1572 Node* if_true = graph()->NewNode(common()->IfTrue(), continue_branch); in ReduceArrayMap()
1573 Node* if_false = graph()->NewNode(common()->IfFalse(), continue_branch); in ReduceArrayMap()
1582 graph()->NewNode(common()->Checkpoint(), frame_state, effect, control); in ReduceArrayMap()
1586 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayMap()
1594 graph()->NewNode(simplified()->NumberAdd(), k, jsgraph()->OneConstant()); in ReduceArrayMap()
1605 check = graph()->NewNode(simplified()->NumberIsFloat64Hole(), element); in ReduceArrayMap()
1607 check = graph()->NewNode(simplified()->ReferenceEqual(), element, in ReduceArrayMap()
1611 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceArrayMap()
1612 hole_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceArrayMap()
1613 hole_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceArrayMap()
1619 element = effect = graph()->NewNode( in ReduceArrayMap()
1630 Node* callback_value = control = effect = graph()->NewNode( in ReduceArrayMap()
1650 effect = graph()->NewNode( in ReduceArrayMap()
1660 control = graph()->NewNode(common()->Merge(2), control, in ReduceArrayMap()
1662 effect = graph()->NewNode(common()->EffectPhi(2), effect, in ReduceArrayMap()
1676 graph()->NewNode(common()->Throw(), check_throw, check_fail); in ReduceArrayMap()
1744 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayFilter()
1767 Node* original_length = effect = graph()->NewNode( in ReduceArrayFilter()
1797 Node* v_to_loop = to = graph()->NewNode( in ReduceArrayFilter()
1801 graph()->NewNode(simplified()->NumberLessThan(), k, original_length); in ReduceArrayFilter()
1802 Node* continue_branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceArrayFilter()
1805 Node* if_true = graph()->NewNode(common()->IfTrue(), continue_branch); in ReduceArrayFilter()
1806 Node* if_false = graph()->NewNode(common()->IfFalse(), continue_branch); in ReduceArrayFilter()
1820 graph()->NewNode(common()->Checkpoint(), frame_state, effect, control); in ReduceArrayFilter()
1825 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayFilter()
1833 graph()->NewNode(simplified()->NumberAdd(), k, jsgraph()->OneConstant()); in ReduceArrayFilter()
1845 check = graph()->NewNode(simplified()->NumberIsFloat64Hole(), element); in ReduceArrayFilter()
1847 check = graph()->NewNode(simplified()->ReferenceEqual(), element, in ReduceArrayFilter()
1851 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceArrayFilter()
1852 hole_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceArrayFilter()
1853 hole_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceArrayFilter()
1859 element = effect = graph()->NewNode( in ReduceArrayFilter()
1876 callback_value = control = effect = graph()->NewNode( in ReduceArrayFilter()
1906 graph()->NewNode(common()->Checkpoint(), frame_state, effect, control); in ReduceArrayFilter()
1921 control = graph()->NewNode(common()->Merge(2), control, after_call_control); in ReduceArrayFilter()
1922 effect = graph()->NewNode(common()->EffectPhi(2), effect, after_call_effect, in ReduceArrayFilter()
1925 graph()->NewNode(common()->Phi(MachineRepresentation::kTaggedSigned, 2), in ReduceArrayFilter()
1940 graph()->NewNode(common()->Throw(), check_throw, check_fail); in ReduceArrayFilter()
2011 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayFind()
2018 Node* original_length = effect = graph()->NewNode( in ReduceArrayFind()
2048 graph()->NewNode(simplified()->NumberLessThan(), k, original_length); in ReduceArrayFind()
2049 Node* continue_branch = graph()->NewNode( in ReduceArrayFind()
2051 control = graph()->NewNode(common()->IfTrue(), continue_branch); in ReduceArrayFind()
2052 if_false = graph()->NewNode(common()->IfFalse(), continue_branch); in ReduceArrayFind()
2063 graph()->NewNode(common()->Checkpoint(), frame_state, effect, control); in ReduceArrayFind()
2066 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayFind()
2077 graph()->NewNode(simplified()->NumberAdd(), k, jsgraph()->OneConstant()); in ReduceArrayFind()
2084 graph()->NewNode(simplified()->CheckFloat64Hole(mode, p.feedback()), in ReduceArrayFind()
2088 graph()->NewNode(simplified()->ConvertTaggedHoleToUndefined(), element); in ReduceArrayFind()
2109 callback_value = control = effect = graph()->NewNode( in ReduceArrayFind()
2123 graph()->NewNode(simplified()->ToBoolean(), callback_value); in ReduceArrayFind()
2125 Node* found_branch = graph()->NewNode(common()->Branch(BranchHint::kFalse), in ReduceArrayFind()
2127 Node* if_found = graph()->NewNode(common()->IfTrue(), found_branch); in ReduceArrayFind()
2128 Node* if_notfound = graph()->NewNode(common()->IfFalse(), found_branch); in ReduceArrayFind()
2134 control = graph()->NewNode(common()->Merge(2), if_found, if_false); in ReduceArrayFind()
2136 graph()->NewNode(common()->EffectPhi(2), efound_branch, eloop, control); in ReduceArrayFind()
2142 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in ReduceArrayFind()
2150 graph()->NewNode(common()->Throw(), check_throw, check_fail); in ReduceArrayFind()
2162 graph()->NewNode(simplified()->ToBoolean(), callback_value); in DoFilterPostCallbackWork()
2165 graph()->NewNode(simplified()->ReferenceEqual(), boolean_result, in DoFilterPostCallbackWork()
2167 Node* boolean_branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in DoFilterPostCallbackWork()
2170 Node* if_true = graph()->NewNode(common()->IfTrue(), boolean_branch); in DoFilterPostCallbackWork()
2175 Node* elements = etrue = graph()->NewNode( in DoFilterPostCallbackWork()
2181 Node* checked_to = etrue = graph()->NewNode( in DoFilterPostCallbackWork()
2184 Node* elements_length = etrue = graph()->NewNode( in DoFilterPostCallbackWork()
2191 elements = etrue = graph()->NewNode( in DoFilterPostCallbackWork()
2196 Node* new_length_a = graph()->NewNode(simplified()->NumberAdd(), checked_to, in DoFilterPostCallbackWork()
2199 etrue = graph()->NewNode( in DoFilterPostCallbackWork()
2204 etrue = graph()->NewNode( in DoFilterPostCallbackWork()
2211 Node* if_false = graph()->NewNode(common()->IfFalse(), boolean_branch); in DoFilterPostCallbackWork()
2215 *control = graph()->NewNode(common()->Merge(2), if_true, if_false); in DoFilterPostCallbackWork()
2216 *effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, *control); in DoFilterPostCallbackWork()
2217 to = graph()->NewNode(common()->Phi(MachineRepresentation::kTaggedSigned, 2), in DoFilterPostCallbackWork()
2225 Node* check = graph()->NewNode(simplified()->ObjectIsCallable(), fncallback); in WireInCallbackIsCallableCheck()
2227 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, *control); in WireInCallbackIsCallableCheck()
2228 *check_fail = graph()->NewNode(common()->IfFalse(), check_branch); in WireInCallbackIsCallableCheck()
2229 *check_throw = *check_fail = graph()->NewNode( in WireInCallbackIsCallableCheck()
2233 *control = graph()->NewNode(common()->IfTrue(), check_branch); in WireInCallbackIsCallableCheck()
2243 graph()->NewNode(common()->IfException(), check_throw, *check_fail); in RewirePostCallbackExceptionEdges()
2244 *check_fail = graph()->NewNode(common()->IfSuccess(), *check_fail); in RewirePostCallbackExceptionEdges()
2246 graph()->NewNode(common()->IfException(), effect, *control); in RewirePostCallbackExceptionEdges()
2247 *control = graph()->NewNode(common()->IfSuccess(), *control); in RewirePostCallbackExceptionEdges()
2251 graph()->NewNode(common()->Merge(2), if_exception0, if_exception1); in RewirePostCallbackExceptionEdges()
2252 Node* ephi = graph()->NewNode(common()->EffectPhi(2), if_exception0, in RewirePostCallbackExceptionEdges()
2254 Node* phi = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in RewirePostCallbackExceptionEdges()
2264 Node* length = *effect = graph()->NewNode( in SafeLoadElement()
2267 *k = *effect = graph()->NewNode(simplified()->CheckBounds(feedback), *k, in SafeLoadElement()
2273 Node* elements = *effect = graph()->NewNode( in SafeLoadElement()
2277 Node* element = *effect = graph()->NewNode( in SafeLoadElement()
2335 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayEvery()
2343 effect = graph()->NewNode( in ReduceArrayEvery()
2347 Node* original_length = effect = graph()->NewNode( in ReduceArrayEvery()
2376 graph()->NewNode(simplified()->NumberLessThan(), k, original_length); in ReduceArrayEvery()
2377 Node* continue_branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceArrayEvery()
2380 Node* if_true = graph()->NewNode(common()->IfTrue(), continue_branch); in ReduceArrayEvery()
2381 Node* if_false = graph()->NewNode(common()->IfFalse(), continue_branch); in ReduceArrayEvery()
2395 graph()->NewNode(common()->Checkpoint(), frame_state, effect, control); in ReduceArrayEvery()
2400 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayEvery()
2408 graph()->NewNode(simplified()->NumberAdd(), k, jsgraph()->OneConstant()); in ReduceArrayEvery()
2419 check = graph()->NewNode(simplified()->NumberIsFloat64Hole(), element); in ReduceArrayEvery()
2421 check = graph()->NewNode(simplified()->ReferenceEqual(), element, in ReduceArrayEvery()
2425 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceArrayEvery()
2426 hole_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceArrayEvery()
2427 hole_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceArrayEvery()
2433 element = effect = graph()->NewNode( in ReduceArrayEvery()
2450 callback_value = control = effect = graph()->NewNode( in ReduceArrayEvery()
2467 graph()->NewNode(simplified()->ToBoolean(), callback_value); in ReduceArrayEvery()
2469 graph()->NewNode(simplified()->ReferenceEqual(), boolean_result, in ReduceArrayEvery()
2471 Node* boolean_branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceArrayEvery()
2473 if_false_callback = graph()->NewNode(common()->IfFalse(), boolean_branch); in ReduceArrayEvery()
2477 control = graph()->NewNode(common()->IfTrue(), boolean_branch); in ReduceArrayEvery()
2486 control = graph()->NewNode(common()->Merge(2), control, after_call_control); in ReduceArrayEvery()
2487 effect = graph()->NewNode(common()->EffectPhi(2), effect, after_call_effect, in ReduceArrayEvery()
2493 control = graph()->NewNode(common()->Merge(2), if_false, if_false_callback); in ReduceArrayEvery()
2495 graph()->NewNode(common()->EffectPhi(2), eloop, efalse_callback, control); in ReduceArrayEvery()
2496 Node* return_value = graph()->NewNode( in ReduceArrayEvery()
2505 graph()->NewNode(common()->Throw(), check_throw, check_fail); in ReduceArrayEvery()
2596 Node* elements = effect = graph()->NewNode( in ReduceArrayIndexOfIncludes()
2602 Node* length = effect = graph()->NewNode( in ReduceArrayIndexOfIncludes()
2609 from_index = effect = graph()->NewNode(simplified()->CheckSmi(p.feedback()), in ReduceArrayIndexOfIncludes()
2614 new_from_index = graph()->NewNode( in ReduceArrayIndexOfIncludes()
2616 graph()->NewNode(simplified()->NumberLessThan(), from_index, in ReduceArrayIndexOfIncludes()
2618 graph()->NewNode( in ReduceArrayIndexOfIncludes()
2620 graph()->NewNode(simplified()->NumberAdd(), length, from_index), in ReduceArrayIndexOfIncludes()
2626 Node* replacement_node = effect = graph()->NewNode( in ReduceArrayIndexOfIncludes()
2688 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArraySome()
2694 effect = graph()->NewNode( in ReduceArraySome()
2698 Node* original_length = effect = graph()->NewNode( in ReduceArraySome()
2723 Node* loop = control = graph()->NewNode(common()->Loop(2), control, control); in ReduceArraySome()
2725 graph()->NewNode(common()->EffectPhi(2), effect, effect, loop); in ReduceArraySome()
2726 Node* terminate = graph()->NewNode(common()->Terminate(), eloop, loop); in ReduceArraySome()
2728 Node* vloop = k = graph()->NewNode( in ReduceArraySome()
2732 graph()->NewNode(simplified()->NumberLessThan(), k, original_length); in ReduceArraySome()
2733 Node* continue_branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceArraySome()
2736 Node* if_true = graph()->NewNode(common()->IfTrue(), continue_branch); in ReduceArraySome()
2737 Node* if_false = graph()->NewNode(common()->IfFalse(), continue_branch); in ReduceArraySome()
2751 graph()->NewNode(common()->Checkpoint(), frame_state, effect, control); in ReduceArraySome()
2756 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArraySome()
2764 graph()->NewNode(simplified()->NumberAdd(), k, jsgraph()->OneConstant()); in ReduceArraySome()
2775 check = graph()->NewNode(simplified()->NumberIsFloat64Hole(), element); in ReduceArraySome()
2777 check = graph()->NewNode(simplified()->ReferenceEqual(), element, in ReduceArraySome()
2781 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceArraySome()
2782 hole_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceArraySome()
2783 hole_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceArraySome()
2789 element = effect = graph()->NewNode( in ReduceArraySome()
2806 callback_value = control = effect = graph()->NewNode( in ReduceArraySome()
2823 graph()->NewNode(simplified()->ToBoolean(), callback_value); in ReduceArraySome()
2825 graph()->NewNode(simplified()->ReferenceEqual(), boolean_result, in ReduceArraySome()
2827 Node* boolean_branch = graph()->NewNode( in ReduceArraySome()
2829 if_true_callback = graph()->NewNode(common()->IfTrue(), boolean_branch); in ReduceArraySome()
2833 control = graph()->NewNode(common()->IfFalse(), boolean_branch); in ReduceArraySome()
2842 control = graph()->NewNode(common()->Merge(2), control, after_call_control); in ReduceArraySome()
2843 effect = graph()->NewNode(common()->EffectPhi(2), effect, after_call_effect, in ReduceArraySome()
2851 control = graph()->NewNode(common()->Merge(2), if_false, if_true_callback); in ReduceArraySome()
2853 graph()->NewNode(common()->EffectPhi(2), eloop, etrue_callback, control); in ReduceArraySome()
2854 Node* return_value = graph()->NewNode( in ReduceArraySome()
2863 graph()->NewNode(common()->Throw(), check_throw, check_fail); in ReduceArraySome()
2935 Node* context = effect = graph()->NewNode( in ReduceCallApiFunction()
3152 graph()->NewNode(simplified()->ObjectIsConstructor(), new_target); in ReduceCallOrConstructWithArrayLikeOrSpread()
3154 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceCallOrConstructWithArrayLikeOrSpread()
3155 Node* check_fail = graph()->NewNode(common()->IfFalse(), check_branch); in ReduceCallOrConstructWithArrayLikeOrSpread()
3157 graph()->NewNode(javascript()->CallRuntime(Runtime::kThrowTypeError, 2), in ReduceCallOrConstructWithArrayLikeOrSpread()
3160 control = graph()->NewNode(common()->IfTrue(), check_branch); in ReduceCallOrConstructWithArrayLikeOrSpread()
3168 graph()->NewNode(common()->IfException(), check_throw, check_fail); in ReduceCallOrConstructWithArrayLikeOrSpread()
3169 check_fail = graph()->NewNode(common()->IfSuccess(), check_fail); in ReduceCallOrConstructWithArrayLikeOrSpread()
3173 graph()->NewNode(common()->Merge(2), if_exception, on_exception); in ReduceCallOrConstructWithArrayLikeOrSpread()
3174 Node* ephi = graph()->NewNode(common()->EffectPhi(2), if_exception, in ReduceCallOrConstructWithArrayLikeOrSpread()
3177 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in ReduceCallOrConstructWithArrayLikeOrSpread()
3189 graph()->NewNode(common()->Throw(), check_throw, check_fail); in ReduceCallOrConstructWithArrayLikeOrSpread()
3344 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), target, in ReduceJSCall()
3346 effect = graph()->NewNode( in ReduceJSCall()
3775 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), target, in ReduceJSConstruct()
3777 effect = graph()->NewNode( in ReduceJSConstruct()
3797 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), in ReduceJSConstruct()
3799 effect = graph()->NewNode( in ReduceJSConstruct()
3900 graph()->NewNode(common()->Select(MachineRepresentation::kTagged), in ReduceJSConstruct()
3901 graph()->NewNode(simplified()->ReferenceEqual(), in ReduceJSConstruct()
3943 graph()->NewNode(common()->Select(MachineRepresentation::kTagged), in ReduceJSConstruct()
3944 graph()->NewNode(simplified()->ReferenceEqual(), in ReduceJSConstruct()
3981 Node* new_receiver = effect = graph()->NewNode( in ReduceStringPrototypeIndexOf()
3986 graph()->NewNode(simplified()->CheckString(p.feedback()), search_string, in ReduceStringPrototypeIndexOf()
3992 new_position = effect = graph()->NewNode( in ReduceStringPrototypeIndexOf()
4024 receiver = effect = graph()->NewNode(simplified()->CheckString(p.feedback()), in ReduceStringPrototypeSubstring()
4027 start = effect = graph()->NewNode(simplified()->CheckSmi(p.feedback()), start, in ReduceStringPrototypeSubstring()
4030 Node* length = graph()->NewNode(simplified()->StringLength(), receiver); in ReduceStringPrototypeSubstring()
4032 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), end, in ReduceStringPrototypeSubstring()
4035 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceStringPrototypeSubstring()
4037 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceStringPrototypeSubstring()
4041 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceStringPrototypeSubstring()
4043 Node* vfalse = efalse = graph()->NewNode(simplified()->CheckSmi(p.feedback()), in ReduceStringPrototypeSubstring()
4046 control = graph()->NewNode(common()->Merge(2), if_true, if_false); in ReduceStringPrototypeSubstring()
4047 effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control); in ReduceStringPrototypeSubstring()
4048 end = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in ReduceStringPrototypeSubstring()
4051 graph()->NewNode(simplified()->NumberMin(), in ReduceStringPrototypeSubstring()
4052 graph()->NewNode(simplified()->NumberMax(), start, in ReduceStringPrototypeSubstring()
4056 graph()->NewNode(simplified()->NumberMin(), in ReduceStringPrototypeSubstring()
4057 graph()->NewNode(simplified()->NumberMax(), end, in ReduceStringPrototypeSubstring()
4062 graph()->NewNode(simplified()->NumberMin(), finalStart, finalEnd); in ReduceStringPrototypeSubstring()
4063 Node* to = graph()->NewNode(simplified()->NumberMax(), finalStart, finalEnd); in ReduceStringPrototypeSubstring()
4065 Node* value = effect = graph()->NewNode(simplified()->StringSubstring(), in ReduceStringPrototypeSubstring()
4087 receiver = effect = graph()->NewNode(simplified()->CheckString(p.feedback()), in ReduceStringPrototypeSlice()
4090 start = effect = graph()->NewNode(simplified()->CheckSmi(p.feedback()), start, in ReduceStringPrototypeSlice()
4093 Node* length = graph()->NewNode(simplified()->StringLength(), receiver); in ReduceStringPrototypeSlice()
4097 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), end, in ReduceStringPrototypeSlice()
4101 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceStringPrototypeSlice()
4103 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceStringPrototypeSlice()
4107 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceStringPrototypeSlice()
4109 Node* vfalse = efalse = graph()->NewNode( in ReduceStringPrototypeSlice()
4112 control = graph()->NewNode(common()->Merge(2), if_true, if_false); in ReduceStringPrototypeSlice()
4113 effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control); in ReduceStringPrototypeSlice()
4114 end = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in ReduceStringPrototypeSlice()
4118 Node* from = graph()->NewNode( in ReduceStringPrototypeSlice()
4120 graph()->NewNode(simplified()->NumberLessThan(), start, in ReduceStringPrototypeSlice()
4122 graph()->NewNode( in ReduceStringPrototypeSlice()
4124 graph()->NewNode(simplified()->NumberAdd(), length, start), in ReduceStringPrototypeSlice()
4126 graph()->NewNode(simplified()->NumberMin(), start, length)); in ReduceStringPrototypeSlice()
4129 from = effect = graph()->NewNode(common()->TypeGuard(Type::UnsignedSmall()), in ReduceStringPrototypeSlice()
4132 Node* to = graph()->NewNode( in ReduceStringPrototypeSlice()
4134 graph()->NewNode(simplified()->NumberLessThan(), end, in ReduceStringPrototypeSlice()
4136 graph()->NewNode(simplified()->NumberMax(), in ReduceStringPrototypeSlice()
4137 graph()->NewNode(simplified()->NumberAdd(), length, end), in ReduceStringPrototypeSlice()
4139 graph()->NewNode(simplified()->NumberMin(), end, length)); in ReduceStringPrototypeSlice()
4142 to = effect = graph()->NewNode(common()->TypeGuard(Type::UnsignedSmall()), to, in ReduceStringPrototypeSlice()
4148 Node* check = graph()->NewNode(simplified()->NumberLessThan(), from, to); in ReduceStringPrototypeSlice()
4151 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceStringPrototypeSlice()
4153 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceStringPrototypeSlice()
4155 Node* vtrue = etrue = graph()->NewNode(simplified()->StringSubstring(), in ReduceStringPrototypeSlice()
4158 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceStringPrototypeSlice()
4162 control = graph()->NewNode(common()->Merge(2), if_true, if_false); in ReduceStringPrototypeSlice()
4163 effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control); in ReduceStringPrototypeSlice()
4165 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in ReduceStringPrototypeSlice()
4189 receiver = effect = graph()->NewNode(simplified()->CheckString(p.feedback()), in ReduceStringPrototypeSubstr()
4192 start = effect = graph()->NewNode(simplified()->CheckSmi(p.feedback()), start, in ReduceStringPrototypeSubstr()
4195 Node* length = graph()->NewNode(simplified()->StringLength(), receiver); in ReduceStringPrototypeSubstr()
4199 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), end, in ReduceStringPrototypeSubstr()
4202 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceStringPrototypeSubstr()
4204 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceStringPrototypeSubstr()
4208 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceStringPrototypeSubstr()
4210 Node* vfalse = efalse = graph()->NewNode( in ReduceStringPrototypeSubstr()
4213 control = graph()->NewNode(common()->Merge(2), if_true, if_false); in ReduceStringPrototypeSubstr()
4214 effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control); in ReduceStringPrototypeSubstr()
4215 end = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in ReduceStringPrototypeSubstr()
4219 Node* initStart = graph()->NewNode( in ReduceStringPrototypeSubstr()
4221 graph()->NewNode(simplified()->NumberLessThan(), start, in ReduceStringPrototypeSubstr()
4223 graph()->NewNode( in ReduceStringPrototypeSubstr()
4225 graph()->NewNode(simplified()->NumberAdd(), length, start), in ReduceStringPrototypeSubstr()
4230 initStart = effect = graph()->NewNode( in ReduceStringPrototypeSubstr()
4233 Node* resultLength = graph()->NewNode( in ReduceStringPrototypeSubstr()
4235 graph()->NewNode(simplified()->NumberMax(), end, in ReduceStringPrototypeSubstr()
4237 graph()->NewNode(simplified()->NumberSubtract(), length, initStart)); in ReduceStringPrototypeSubstr()
4241 Node* to = effect = graph()->NewNode( in ReduceStringPrototypeSubstr()
4243 graph()->NewNode(simplified()->NumberAdd(), initStart, resultLength), in ReduceStringPrototypeSubstr()
4249 Node* check = graph()->NewNode(simplified()->NumberLessThan(), in ReduceStringPrototypeSubstr()
4253 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceStringPrototypeSubstr()
4255 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceStringPrototypeSubstr()
4258 graph()->NewNode(simplified()->StringSubstring(), receiver, initStart, in ReduceStringPrototypeSubstr()
4261 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceStringPrototypeSubstr()
4265 control = graph()->NewNode(common()->Merge(2), if_true, if_false); in ReduceStringPrototypeSubstr()
4266 effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control); in ReduceStringPrototypeSubstr()
4268 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in ReduceStringPrototypeSubstr()
4307 Node* deoptimize = graph()->NewNode( in ReduceSoftDeoptimize()
4384 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayPrototypePush()
4397 value = effect = graph()->NewNode(simplified()->CheckSmi(p.feedback()), in ReduceArrayPrototypePush()
4400 value = effect = graph()->NewNode(simplified()->CheckNumber(p.feedback()), in ReduceArrayPrototypePush()
4403 value = graph()->NewNode(simplified()->NumberSilenceNaN(), value); in ReduceArrayPrototypePush()
4408 Node* length = effect = graph()->NewNode( in ReduceArrayPrototypePush()
4416 Node* new_length = value = graph()->NewNode( in ReduceArrayPrototypePush()
4420 Node* elements = effect = graph()->NewNode( in ReduceArrayPrototypePush()
4423 Node* elements_length = effect = graph()->NewNode( in ReduceArrayPrototypePush()
4430 elements = effect = graph()->NewNode( in ReduceArrayPrototypePush()
4433 graph()->NewNode(simplified()->NumberAdd(), length, in ReduceArrayPrototypePush()
4439 effect = graph()->NewNode( in ReduceArrayPrototypePush()
4446 Node* index = graph()->NewNode(simplified()->NumberAdd(), length, in ReduceArrayPrototypePush()
4448 effect = graph()->NewNode( in ReduceArrayPrototypePush()
4499 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayPrototypePop()
4505 Node* length = effect = graph()->NewNode( in ReduceArrayPrototypePop()
4510 Node* check = graph()->NewNode(simplified()->NumberEqual(), length, in ReduceArrayPrototypePop()
4513 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceArrayPrototypePop()
4515 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceArrayPrototypePop()
4519 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceArrayPrototypePop()
4527 Node* elements = efalse = graph()->NewNode( in ReduceArrayPrototypePop()
4534 graph()->NewNode(simplified()->EnsureWritableFastElements(), receiver, in ReduceArrayPrototypePop()
4539 length = graph()->NewNode(simplified()->NumberSubtract(), length, in ReduceArrayPrototypePop()
4543 efalse = graph()->NewNode( in ReduceArrayPrototypePop()
4548 vfalse = efalse = graph()->NewNode( in ReduceArrayPrototypePop()
4553 efalse = graph()->NewNode( in ReduceArrayPrototypePop()
4559 control = graph()->NewNode(common()->Merge(2), if_true, if_false); in ReduceArrayPrototypePop()
4560 effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control); in ReduceArrayPrototypePop()
4561 Node* value = graph()->NewNode( in ReduceArrayPrototypePop()
4568 graph()->NewNode(simplified()->ConvertTaggedHoleToUndefined(), value); in ReduceArrayPrototypePop()
4618 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayPrototypeShift()
4624 Node* length = effect = graph()->NewNode( in ReduceArrayPrototypeShift()
4629 Node* check0 = graph()->NewNode(simplified()->NumberEqual(), length, in ReduceArrayPrototypeShift()
4632 graph()->NewNode(common()->Branch(BranchHint::kFalse), check0, control); in ReduceArrayPrototypeShift()
4634 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0); in ReduceArrayPrototypeShift()
4638 Node* if_false0 = graph()->NewNode(common()->IfFalse(), branch0); in ReduceArrayPrototypeShift()
4644 graph()->NewNode(simplified()->NumberLessThanOrEqual(), length, in ReduceArrayPrototypeShift()
4646 Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceArrayPrototypeShift()
4649 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in ReduceArrayPrototypeShift()
4653 Node* elements = etrue1 = graph()->NewNode( in ReduceArrayPrototypeShift()
4658 vtrue1 = etrue1 = graph()->NewNode( in ReduceArrayPrototypeShift()
4665 graph()->NewNode(simplified()->EnsureWritableFastElements(), in ReduceArrayPrototypeShift()
4670 Node* loop = graph()->NewNode(common()->Loop(2), if_true1, if_true1); in ReduceArrayPrototypeShift()
4672 graph()->NewNode(common()->EffectPhi(2), etrue1, etrue1, loop); in ReduceArrayPrototypeShift()
4673 Node* terminate = graph()->NewNode(common()->Terminate(), eloop, loop); in ReduceArrayPrototypeShift()
4675 Node* index = graph()->NewNode( in ReduceArrayPrototypeShift()
4682 graph()->NewNode(simplified()->NumberLessThan(), index, length); in ReduceArrayPrototypeShift()
4683 Node* branch2 = graph()->NewNode(common()->Branch(), check2, loop); in ReduceArrayPrototypeShift()
4685 if_true1 = graph()->NewNode(common()->IfFalse(), branch2); in ReduceArrayPrototypeShift()
4688 Node* control = graph()->NewNode(common()->IfTrue(), branch2); in ReduceArrayPrototypeShift()
4693 graph()->NewNode(simplified()->LoadElement(access), elements, index, in ReduceArrayPrototypeShift()
4696 graph()->NewNode(simplified()->StoreElement(access), elements, in ReduceArrayPrototypeShift()
4697 graph()->NewNode(simplified()->NumberSubtract(), in ReduceArrayPrototypeShift()
4704 graph()->NewNode(simplified()->NumberAdd(), index, in ReduceArrayPrototypeShift()
4709 length = graph()->NewNode(simplified()->NumberSubtract(), length, in ReduceArrayPrototypeShift()
4713 etrue1 = graph()->NewNode( in ReduceArrayPrototypeShift()
4718 etrue1 = graph()->NewNode( in ReduceArrayPrototypeShift()
4724 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); in ReduceArrayPrototypeShift()
4742 graph()->NewNode(common()->Call(call_descriptor), stub_code, receiver, in ReduceArrayPrototypeShift()
4748 if_false0 = graph()->NewNode(common()->Merge(2), if_true1, if_false1); in ReduceArrayPrototypeShift()
4750 graph()->NewNode(common()->EffectPhi(2), etrue1, efalse1, if_false0); in ReduceArrayPrototypeShift()
4751 vfalse0 = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in ReduceArrayPrototypeShift()
4755 control = graph()->NewNode(common()->Merge(2), if_true0, if_false0); in ReduceArrayPrototypeShift()
4756 effect = graph()->NewNode(common()->EffectPhi(2), etrue0, efalse0, control); in ReduceArrayPrototypeShift()
4758 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in ReduceArrayPrototypeShift()
4765 graph()->NewNode(simplified()->ConvertTaggedHoleToUndefined(), value); in ReduceArrayPrototypeShift()
4828 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayPrototypeSlice()
4843 Node* clone = effect = graph()->NewNode( in ReduceArrayPrototypeSlice()
4978 graph()->NewNode(simplified()->LoadField( in ReduceArrayIteratorPrototypeNext()
4983 effect = graph()->NewNode( in ReduceArrayIteratorPrototypeNext()
4997 Node* buffer = effect = graph()->NewNode( in ReduceArrayIteratorPrototypeNext()
5001 Node* check = effect = graph()->NewNode( in ReduceArrayIteratorPrototypeNext()
5003 check = graph()->NewNode(simplified()->BooleanNot(), check); in ReduceArrayIteratorPrototypeNext()
5006 effect = graph()->NewNode( in ReduceArrayIteratorPrototypeNext()
5024 Node* index = effect = graph()->NewNode(simplified()->LoadField(index_access), in ReduceArrayIteratorPrototypeNext()
5033 Node* elements = effect = graph()->NewNode( in ReduceArrayIteratorPrototypeNext()
5044 Node* length = effect = graph()->NewNode( in ReduceArrayIteratorPrototypeNext()
5048 Node* check = graph()->NewNode(simplified()->NumberLessThan(), index, length); in ReduceArrayIteratorPrototypeNext()
5050 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceArrayIteratorPrototypeNext()
5055 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceArrayIteratorPrototypeNext()
5058 index = etrue = graph()->NewNode( in ReduceArrayIteratorPrototypeNext()
5072 Node* base_ptr = etrue = graph()->NewNode( in ReduceArrayIteratorPrototypeNext()
5076 Node* external_ptr = etrue = graph()->NewNode( in ReduceArrayIteratorPrototypeNext()
5094 graph()->NewNode(simplified()->LoadField( in ReduceArrayIteratorPrototypeNext()
5099 graph()->NewNode(simplified()->LoadTypedElement(array_type), buffer, in ReduceArrayIteratorPrototypeNext()
5102 value_true = etrue = graph()->NewNode( in ReduceArrayIteratorPrototypeNext()
5110 value_true = graph()->NewNode( in ReduceArrayIteratorPrototypeNext()
5115 value_true = etrue = graph()->NewNode( in ReduceArrayIteratorPrototypeNext()
5124 graph()->NewNode(javascript()->CreateKeyValueArray(), index, in ReduceArrayIteratorPrototypeNext()
5133 Node* next_index = graph()->NewNode(simplified()->NumberAdd(), index, in ReduceArrayIteratorPrototypeNext()
5135 etrue = graph()->NewNode(simplified()->StoreField(index_access), iterator, in ReduceArrayIteratorPrototypeNext()
5142 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceArrayIteratorPrototypeNext()
5160 efalse = graph()->NewNode(simplified()->StoreField(index_access), in ReduceArrayIteratorPrototypeNext()
5165 control = graph()->NewNode(common()->Merge(2), if_true, if_false); in ReduceArrayIteratorPrototypeNext()
5166 effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control); in ReduceArrayIteratorPrototypeNext()
5168 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in ReduceArrayIteratorPrototypeNext()
5171 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in ReduceArrayIteratorPrototypeNext()
5175 value = effect = graph()->NewNode(javascript()->CreateIterResultObject(), in ReduceArrayIteratorPrototypeNext()
5201 receiver = effect = graph()->NewNode(simplified()->CheckString(p.feedback()), in ReduceStringPrototypeStringAt()
5206 graph()->NewNode(simplified()->StringLength(), receiver); in ReduceStringPrototypeStringAt()
5209 index = effect = graph()->NewNode(simplified()->CheckBounds(p.feedback()), in ReduceStringPrototypeStringAt()
5213 Node* masked_index = graph()->NewNode(simplified()->PoisonIndex(), index); in ReduceStringPrototypeStringAt()
5214 Node* value = effect = graph()->NewNode(string_access_operator, receiver, in ReduceStringPrototypeStringAt()
5237 receiver = effect = graph()->NewNode(simplified()->CheckString(p.feedback()), in ReduceStringPrototypeCharAt()
5242 graph()->NewNode(simplified()->StringLength(), receiver); in ReduceStringPrototypeCharAt()
5245 index = effect = graph()->NewNode(simplified()->CheckBounds(p.feedback()), in ReduceStringPrototypeCharAt()
5249 Node* masked_index = graph()->NewNode(simplified()->PoisonIndex(), index); in ReduceStringPrototypeCharAt()
5251 graph()->NewNode(simplified()->StringCharCodeAt(), receiver, masked_index, in ReduceStringPrototypeCharAt()
5253 value = graph()->NewNode(simplified()->StringFromSingleCharCode(), value); in ReduceStringPrototypeCharAt()
5271 graph()->NewNode(simplified()->CheckString(p.feedback()), in ReduceStringPrototypeToLowerCaseIntl()
5293 graph()->NewNode(simplified()->CheckString(p.feedback()), in ReduceStringPrototypeToUpperCaseIntl()
5319 input = effect = graph()->NewNode( in ReduceStringFromCharCode()
5325 graph()->NewNode(simplified()->StringFromSingleCharCode(), input); in ReduceStringFromCharCode()
5344 input = effect = graph()->NewNode(simplified()->CheckSmi(p.feedback()), in ReduceStringFromCodePoint()
5348 graph()->NewNode(simplified()->CheckBounds(p.feedback()), input, in ReduceStringFromCodePoint()
5351 Node* value = graph()->NewNode( in ReduceStringFromCodePoint()
5367 graph()->NewNode(simplified()->CheckString(p.feedback()), in ReduceStringPrototypeIterator()
5370 graph()->NewNode(javascript()->CreateStringIterator(), receiver, in ReduceStringPrototypeIterator()
5383 Node* string = effect = graph()->NewNode( in ReduceStringIteratorPrototypeNext()
5386 Node* index = effect = graph()->NewNode( in ReduceStringIteratorPrototypeNext()
5389 Node* length = graph()->NewNode(simplified()->StringLength(), string); in ReduceStringIteratorPrototypeNext()
5393 graph()->NewNode(simplified()->NumberLessThan(), index, length); in ReduceStringIteratorPrototypeNext()
5395 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control); in ReduceStringIteratorPrototypeNext()
5398 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0); in ReduceStringIteratorPrototypeNext()
5403 Node* codepoint = etrue0 = graph()->NewNode( in ReduceStringIteratorPrototypeNext()
5406 vtrue0 = graph()->NewNode( in ReduceStringIteratorPrototypeNext()
5412 graph()->NewNode(simplified()->StringLength(), vtrue0); in ReduceStringIteratorPrototypeNext()
5413 index = graph()->NewNode(simplified()->NumberAdd(), index, char_length); in ReduceStringIteratorPrototypeNext()
5414 etrue0 = graph()->NewNode( in ReduceStringIteratorPrototypeNext()
5419 Node* if_false0 = graph()->NewNode(common()->IfFalse(), branch0); in ReduceStringIteratorPrototypeNext()
5427 control = graph()->NewNode(common()->Merge(2), if_true0, if_false0); in ReduceStringIteratorPrototypeNext()
5428 effect = graph()->NewNode(common()->EffectPhi(2), etrue0, effect, control); in ReduceStringIteratorPrototypeNext()
5430 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in ReduceStringIteratorPrototypeNext()
5433 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in ReduceStringIteratorPrototypeNext()
5436 value = effect = graph()->NewNode(javascript()->CreateIterResultObject(), in ReduceStringIteratorPrototypeNext()
5459 graph()->NewNode(simplified()->CheckString(p.feedback()), in ReduceStringPrototypeConcat()
5467 graph()->NewNode(simplified()->CheckString(p.feedback()), in ReduceStringPrototypeConcat()
5483 Node* value = effect = control = graph()->NewNode( in ReduceStringPrototypeConcat()
5535 Node* node0 = graph()->NewNode(op0); in CreateArtificialFrameState()
5542 Node* params_node = graph()->NewNode( in CreateArtificialFrameState()
5544 return graph()->NewNode(op, params_node, node0, node0, in CreateArtificialFrameState()
5609 graph()->NewNode(javascript()->CreatePromise(), context, effect); in ReducePromiseConstructor()
5614 graph()->NewNode(javascript()->CreateFunctionContext( in ReducePromiseConstructor()
5621 graph()->NewNode(simplified()->StoreField(AccessBuilder::ForContextSlot( in ReducePromiseConstructor()
5624 effect = graph()->NewNode( in ReducePromiseConstructor()
5628 effect = graph()->NewNode( in ReducePromiseConstructor()
5638 graph()->NewNode(javascript()->CreateClosure( in ReducePromiseConstructor()
5648 graph()->NewNode(javascript()->CreateClosure( in ReducePromiseConstructor()
5667 effect = control = graph()->NewNode( in ReducePromiseConstructor()
5677 Node* reason = exception_effect = exception_control = graph()->NewNode( in ReducePromiseConstructor()
5680 exception_effect = exception_control = graph()->NewNode( in ReducePromiseConstructor()
5699 success_control = graph()->NewNode(common()->IfSuccess(), success_control); in ReducePromiseConstructor()
5703 graph()->NewNode(common()->Merge(2), success_control, exception_control); in ReducePromiseConstructor()
5704 effect = graph()->NewNode(common()->EffectPhi(2), success_effect, in ReducePromiseConstructor()
5712 graph()->NewNode(common()->Throw(), check_throw, check_fail); in ReducePromiseConstructor()
5733 graph()->NewNode(javascript()->CreatePromise(), context, effect); in ReducePromiseInternalConstructor()
5756 graph()->NewNode(javascript()->RejectPromise(), promise, reason, in ReducePromiseInternalReject()
5779 graph()->NewNode(javascript()->ResolvePromise(), promise, resolution, in ReducePromiseInternalResolve()
5828 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReducePromisePrototypeCatch()
5909 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReducePromisePrototypeFinally()
5916 Node* check = graph()->NewNode(simplified()->ObjectIsCallable(), on_finally); in ReducePromisePrototypeFinally()
5918 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReducePromisePrototypeFinally()
5920 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReducePromisePrototypeFinally()
5930 context = etrue = graph()->NewNode( in ReducePromisePrototypeFinally()
5938 graph()->NewNode(simplified()->StoreField(AccessBuilder::ForContextSlot( in ReducePromisePrototypeFinally()
5942 graph()->NewNode(simplified()->StoreField(AccessBuilder::ForContextSlot( in ReducePromisePrototypeFinally()
5950 graph()->NewNode(javascript()->CreateClosure( in ReducePromisePrototypeFinally()
5959 graph()->NewNode(javascript()->CreateClosure( in ReducePromisePrototypeFinally()
5965 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in ReducePromisePrototypeFinally()
5970 control = graph()->NewNode(common()->Merge(2), if_true, if_false); in ReducePromisePrototypeFinally()
5971 effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control); in ReducePromisePrototypeFinally()
5973 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in ReducePromisePrototypeFinally()
5976 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in ReducePromisePrototypeFinally()
5982 effect = graph()->NewNode(simplified()->MapGuard(receiver_maps), receiver, in ReducePromisePrototypeFinally()
6062 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReducePromisePrototypeThen()
6068 on_fulfilled = graph()->NewNode( in ReducePromisePrototypeThen()
6070 graph()->NewNode(simplified()->ObjectIsCallable(), on_fulfilled), in ReducePromisePrototypeThen()
6074 on_rejected = graph()->NewNode( in ReducePromisePrototypeThen()
6076 graph()->NewNode(simplified()->ObjectIsCallable(), on_rejected), in ReducePromisePrototypeThen()
6081 graph()->NewNode(javascript()->CreatePromise(), context, effect); in ReducePromisePrototypeThen()
6084 result = effect = graph()->NewNode( in ReducePromisePrototypeThen()
6166 graph()->NewNode(javascript()->CreateTypedArray(), target, new_target, in ReduceTypedArrayConstructor()
6181 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), receiver); in ReduceTypedArrayPrototypeToStringTag()
6183 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceTypedArrayPrototypeToStringTag()
6187 controls.push_back(graph()->NewNode(common()->IfTrue(), control)); in ReduceTypedArrayPrototypeToStringTag()
6189 control = graph()->NewNode(common()->IfFalse(), control); in ReduceTypedArrayPrototypeToStringTag()
6191 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), in ReduceTypedArrayPrototypeToStringTag()
6193 Node* receiver_bit_field2 = effect = graph()->NewNode( in ReduceTypedArrayPrototypeToStringTag()
6196 Node* receiver_elements_kind = graph()->NewNode( in ReduceTypedArrayPrototypeToStringTag()
6198 graph()->NewNode(simplified()->NumberBitwiseAnd(), receiver_bit_field2, in ReduceTypedArrayPrototypeToStringTag()
6205 receiver_elements_kind = graph()->NewNode( in ReduceTypedArrayPrototypeToStringTag()
6211 Node* check = graph()->NewNode( \ in ReduceTypedArrayPrototypeToStringTag()
6215 control = graph()->NewNode(common()->Branch(), check, control); \ in ReduceTypedArrayPrototypeToStringTag()
6219 controls.push_back(graph()->NewNode(common()->IfTrue(), control)); \ in ReduceTypedArrayPrototypeToStringTag()
6220 control = graph()->NewNode(common()->IfFalse(), control); \ in ReduceTypedArrayPrototypeToStringTag()
6230 control = graph()->NewNode(common()->Merge(count), count, &controls.front()); in ReduceTypedArrayPrototypeToStringTag()
6233 graph()->NewNode(common()->EffectPhi(count), count + 1, &effects.front()); in ReduceTypedArrayPrototypeToStringTag()
6236 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, count), in ReduceTypedArrayPrototypeToStringTag()
6250 Node* value = graph()->NewNode(simplified()->ObjectIsFiniteNumber(), input); in ReduceNumberIsFinite()
6263 Node* value = graph()->NewNode(simplified()->ObjectIsInteger(), input); in ReduceNumberIsInteger()
6276 Node* value = graph()->NewNode(simplified()->ObjectIsSafeInteger(), input); in ReduceNumberIsSafeInteger()
6289 Node* value = graph()->NewNode(simplified()->ObjectIsNaN(), input); in ReduceNumberIsNaN()
6306 Node* table = effect = graph()->NewNode( in ReduceMapPrototypeGet()
6310 Node* entry = effect = graph()->NewNode( in ReduceMapPrototypeGet()
6313 Node* check = graph()->NewNode(simplified()->NumberEqual(), entry, in ReduceMapPrototypeGet()
6316 Node* branch = graph()->NewNode(common()->Branch(), check, control); in ReduceMapPrototypeGet()
6319 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceMapPrototypeGet()
6324 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceMapPrototypeGet()
6326 Node* vfalse = efalse = graph()->NewNode( in ReduceMapPrototypeGet()
6330 control = graph()->NewNode(common()->Merge(2), if_true, if_false); in ReduceMapPrototypeGet()
6331 Node* value = graph()->NewNode( in ReduceMapPrototypeGet()
6333 effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control); in ReduceMapPrototypeGet()
6351 Node* table = effect = graph()->NewNode( in ReduceMapPrototypeHas()
6355 Node* index = effect = graph()->NewNode( in ReduceMapPrototypeHas()
6358 Node* value = graph()->NewNode(simplified()->NumberEqual(), index, in ReduceMapPrototypeHas()
6360 value = graph()->NewNode(simplified()->BooleanNot(), value); in ReduceMapPrototypeHas()
6390 Node* js_create_iterator = effect = graph()->NewNode( in ReduceCollectionIteration()
6408 Node* table = effect = graph()->NewNode( in ReduceCollectionPrototypeSize()
6411 Node* value = effect = graph()->NewNode( in ReduceCollectionPrototypeSize()
6468 graph()->NewNode(common()->Loop(2), control, control); in ReduceCollectionIteratorPrototypeNext()
6470 graph()->NewNode(common()->EffectPhi(2), effect, effect, loop); in ReduceCollectionIteratorPrototypeNext()
6471 Node* terminate = graph()->NewNode(common()->Terminate(), eloop, loop); in ReduceCollectionIteratorPrototypeNext()
6475 Node* table = effect = graph()->NewNode( in ReduceCollectionIteratorPrototypeNext()
6479 graph()->NewNode(simplified()->LoadField( in ReduceCollectionIteratorPrototypeNext()
6482 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), next_table); in ReduceCollectionIteratorPrototypeNext()
6484 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceCollectionIteratorPrototypeNext()
6487 done_loop = graph()->NewNode(common()->IfTrue(), control); in ReduceCollectionIteratorPrototypeNext()
6491 control = graph()->NewNode(common()->IfFalse(), control); in ReduceCollectionIteratorPrototypeNext()
6494 Node* index = effect = graph()->NewNode( in ReduceCollectionIteratorPrototypeNext()
6503 graph()->NewNode(common()->Call(call_descriptor), in ReduceCollectionIteratorPrototypeNext()
6507 index = effect = graph()->NewNode( in ReduceCollectionIteratorPrototypeNext()
6512 effect = graph()->NewNode( in ReduceCollectionIteratorPrototypeNext()
6515 effect = graph()->NewNode( in ReduceCollectionIteratorPrototypeNext()
6528 Node* index = effect = graph()->NewNode( in ReduceCollectionIteratorPrototypeNext()
6531 Node* table = effect = graph()->NewNode( in ReduceCollectionIteratorPrototypeNext()
6537 Node* iterator_result = effect = graph()->NewNode( in ReduceCollectionIteratorPrototypeNext()
6546 Node* number_of_buckets = effect = graph()->NewNode( in ReduceCollectionIteratorPrototypeNext()
6550 Node* number_of_elements = effect = graph()->NewNode( in ReduceCollectionIteratorPrototypeNext()
6554 Node* number_of_deleted_elements = effect = graph()->NewNode( in ReduceCollectionIteratorPrototypeNext()
6559 graph()->NewNode(simplified()->NumberAdd(), number_of_elements, in ReduceCollectionIteratorPrototypeNext()
6563 Node* loop = graph()->NewNode(common()->Loop(2), control, control); in ReduceCollectionIteratorPrototypeNext()
6565 graph()->NewNode(common()->EffectPhi(2), effect, effect, loop); in ReduceCollectionIteratorPrototypeNext()
6566 Node* terminate = graph()->NewNode(common()->Terminate(), eloop, loop); in ReduceCollectionIteratorPrototypeNext()
6568 Node* iloop = graph()->NewNode( in ReduceCollectionIteratorPrototypeNext()
6571 Node* index = effect = graph()->NewNode( in ReduceCollectionIteratorPrototypeNext()
6575 Node* check0 = graph()->NewNode(simplified()->NumberLessThan(), index, in ReduceCollectionIteratorPrototypeNext()
6578 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, loop); in ReduceCollectionIteratorPrototypeNext()
6580 Node* if_false0 = graph()->NewNode(common()->IfFalse(), branch0); in ReduceCollectionIteratorPrototypeNext()
6584 efalse0 = graph()->NewNode( in ReduceCollectionIteratorPrototypeNext()
6594 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0); in ReduceCollectionIteratorPrototypeNext()
6598 Node* entry_start_position = graph()->NewNode( in ReduceCollectionIteratorPrototypeNext()
6600 graph()->NewNode( in ReduceCollectionIteratorPrototypeNext()
6602 graph()->NewNode(simplified()->NumberMultiply(), index, in ReduceCollectionIteratorPrototypeNext()
6606 Node* entry_key = etrue0 = graph()->NewNode( in ReduceCollectionIteratorPrototypeNext()
6611 index = graph()->NewNode(simplified()->NumberAdd(), index, in ReduceCollectionIteratorPrototypeNext()
6615 graph()->NewNode(simplified()->ReferenceEqual(), entry_key, in ReduceCollectionIteratorPrototypeNext()
6617 Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kFalse), in ReduceCollectionIteratorPrototypeNext()
6622 Node* control = graph()->NewNode(common()->IfFalse(), branch1); in ReduceCollectionIteratorPrototypeNext()
6625 graph()->NewNode(common()->TypeGuard(Type::NonInternal()), in ReduceCollectionIteratorPrototypeNext()
6630 effect = graph()->NewNode( in ReduceCollectionIteratorPrototypeNext()
6643 graph()->NewNode(javascript()->CreateKeyValueArray(), value, in ReduceCollectionIteratorPrototypeNext()
6648 value = effect = graph()->NewNode( in ReduceCollectionIteratorPrototypeNext()
6652 graph()->NewNode( in ReduceCollectionIteratorPrototypeNext()
6659 value = effect = graph()->NewNode( in ReduceCollectionIteratorPrototypeNext()
6663 graph()->NewNode( in ReduceCollectionIteratorPrototypeNext()
6668 graph()->NewNode(javascript()->CreateKeyValueArray(), in ReduceCollectionIteratorPrototypeNext()
6679 graph()->NewNode(simplified()->StoreField( in ReduceCollectionIteratorPrototypeNext()
6683 graph()->NewNode(simplified()->StoreField( in ReduceCollectionIteratorPrototypeNext()
6692 loop->ReplaceInput(1, graph()->NewNode(common()->IfTrue(), branch1)); in ReduceCollectionIteratorPrototypeNext()
6698 control = effects[2] = graph()->NewNode(common()->Merge(2), 2, controls); in ReduceCollectionIteratorPrototypeNext()
6699 effect = graph()->NewNode(common()->EffectPhi(2), 3, effects); in ReduceCollectionIteratorPrototypeNext()
6726 Node* value = effect = graph()->NewNode(simplified()->LoadField(access), in ReduceArrayBufferViewAccessor()
6737 Node* buffer = effect = graph()->NewNode( in ReduceArrayBufferViewAccessor()
6740 Node* check = effect = graph()->NewNode( in ReduceArrayBufferViewAccessor()
6744 value = graph()->NewNode( in ReduceArrayBufferViewAccessor()
6813 graph()->NewNode(simplified()->CheckBounds(p.feedback()), offset, in ReduceDataViewPrototypeGet()
6819 offset = graph()->NewNode(simplified()->NumberAdd(), offset, byte_offset); in ReduceDataViewPrototypeGet()
6823 graph()->NewNode(simplified()->LoadField( in ReduceDataViewPrototypeGet()
6826 byte_length = effect = graph()->NewNode( in ReduceDataViewPrototypeGet()
6831 graph()->NewNode(simplified()->CheckBounds(p.feedback()), offset, in ReduceDataViewPrototypeGet()
6838 graph()->NewNode(simplified()->NumberAdd(), offset, in ReduceDataViewPrototypeGet()
6840 effect = graph()->NewNode(simplified()->CheckBounds(p.feedback()), in ReduceDataViewPrototypeGet()
6846 graph()->NewNode(simplified()->LoadField( in ReduceDataViewPrototypeGet()
6849 byte_offset = effect = graph()->NewNode( in ReduceDataViewPrototypeGet()
6853 offset = graph()->NewNode(simplified()->NumberAdd(), offset, byte_offset); in ReduceDataViewPrototypeGet()
6858 graph()->NewNode(simplified()->ToBoolean(), is_little_endian); in ReduceDataViewPrototypeGet()
6861 Node* buffer = effect = graph()->NewNode( in ReduceDataViewPrototypeGet()
6872 Node* check_neutered = effect = graph()->NewNode( in ReduceDataViewPrototypeGet()
6875 graph()->NewNode(simplified()->BooleanNot(), check_neutered); in ReduceDataViewPrototypeGet()
6876 effect = graph()->NewNode( in ReduceDataViewPrototypeGet()
6883 Node* backing_store = effect = graph()->NewNode( in ReduceDataViewPrototypeGet()
6888 Node* value = effect = graph()->NewNode( in ReduceDataViewPrototypeGet()
6947 graph()->NewNode(simplified()->CheckBounds(p.feedback()), offset, in ReduceDataViewPrototypeSet()
6953 offset = graph()->NewNode(simplified()->NumberAdd(), offset, byte_offset); in ReduceDataViewPrototypeSet()
6957 graph()->NewNode(simplified()->LoadField( in ReduceDataViewPrototypeSet()
6960 byte_length = effect = graph()->NewNode( in ReduceDataViewPrototypeSet()
6965 graph()->NewNode(simplified()->CheckBounds(p.feedback()), offset, in ReduceDataViewPrototypeSet()
6972 graph()->NewNode(simplified()->NumberAdd(), offset, in ReduceDataViewPrototypeSet()
6974 effect = graph()->NewNode(simplified()->CheckBounds(p.feedback()), in ReduceDataViewPrototypeSet()
6980 graph()->NewNode(simplified()->LoadField( in ReduceDataViewPrototypeSet()
6983 byte_offset = effect = graph()->NewNode( in ReduceDataViewPrototypeSet()
6987 offset = graph()->NewNode(simplified()->NumberAdd(), offset, byte_offset); in ReduceDataViewPrototypeSet()
6992 graph()->NewNode(simplified()->ToBoolean(), is_little_endian); in ReduceDataViewPrototypeSet()
6995 value = effect = graph()->NewNode( in ReduceDataViewPrototypeSet()
7001 Node* buffer = effect = graph()->NewNode( in ReduceDataViewPrototypeSet()
7012 Node* check_neutered = effect = graph()->NewNode( in ReduceDataViewPrototypeSet()
7015 graph()->NewNode(simplified()->BooleanNot(), check_neutered); in ReduceDataViewPrototypeSet()
7016 effect = graph()->NewNode( in ReduceDataViewPrototypeSet()
7023 Node* backing_store = effect = graph()->NewNode( in ReduceDataViewPrototypeSet()
7028 effect = graph()->NewNode(simplified()->StoreDataViewElement(element_type), in ReduceDataViewPrototypeSet()
7059 graph()->NewNode(simplified()->SpeculativeToNumber( in ReduceGlobalIsFinite()
7062 Node* value = graph()->NewNode(simplified()->NumberIsFinite(), input); in ReduceGlobalIsFinite()
7084 graph()->NewNode(simplified()->SpeculativeToNumber( in ReduceGlobalIsNaN()
7087 Node* value = graph()->NewNode(simplified()->NumberIsNaN(), input); in ReduceGlobalIsNaN()
7099 Node* value = effect = graph()->NewNode( in ReduceDatePrototypeGetTime()
7113 graph()->NewNode(simplified()->DateNow(), effect, control); in ReduceDateNow()
7205 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceRegExpPrototypeTest()
7213 Node* search_string = effect = graph()->NewNode( in ReduceRegExpPrototypeTest()
7216 Node* lastIndex = effect = graph()->NewNode( in ReduceRegExpPrototypeTest()
7220 Node* lastIndexSmi = effect = graph()->NewNode( in ReduceRegExpPrototypeTest()
7223 Node* is_positive = graph()->NewNode(simplified()->NumberLessThanOrEqual(), in ReduceRegExpPrototypeTest()
7226 effect = graph()->NewNode( in ReduceRegExpPrototypeTest()