Lines Matching refs:NewNode
171 Replace(graph()->NewNode(common()->DelayedStringConstant(base)));
227 graph()->NewNode(javascript()->CreatePromise(), context, effect);
244 graph()->NewNode(javascript()->CreateAsyncFunctionObject(register_count),
263 Node* promise = effect = graph()->NewNode(
280 effect = graph()->NewNode(javascript()->RejectPromise(), promise, reason,
299 Node* promise = effect = graph()->NewNode(
313 effect = graph()->NewNode(javascript()->ResolvePromise(), promise, value,
348 Node* reduced = graph()->NewNode(common()->DelayedStringConstant(cons));
501 Node* value = graph()->NewNode(simplified()->ToBoolean(), node);
688 graph()->NewNode(javascript()->CreatePromise(), context, effect);
689 effect = graph()->NewNode(javascript()->ResolvePromise(), promise, value,
740 graph()->NewNode(javascript()->FulfillPromise(), promise, resolution,
836 effect = graph()->NewNode(
899 value = effect = graph()->NewNode(
915 graph()->NewNode(simplified()->ReferenceEqual(), value,
917 effect = graph()->NewNode(
935 value = effect = graph()->NewNode(simplified()->CheckHeapObject(),
938 effect = graph()->NewNode(
947 value = effect = graph()->NewNode(
952 effect = graph()->NewNode(simplified()->StoreField(ForPropertyCellValue(
963 effect = graph()->NewNode(
994 graph()->NewNode(javascript()->LoadContext(0, feedback.slot_index(),
1026 graph()->NewNode(javascript()->StoreContext(0, feedback.slot_index()),
1178 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), receiver);
1179 Node* branch = graph()->NewNode(common()->Branch(), check, control);
1181 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
1184 Control if_false{graph()->NewNode(common()->IfFalse(), branch)};
1189 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
1191 graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control);
1209 // NewNode or BuildCheckMaps) in some cases but we haven't connected them
1240 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), receiver);
1241 Node* branch = graph()->NewNode(common()->Branch(), check, control);
1242 control = graph()->NewNode(common()->IfFalse(), branch);
1243 receiverissmi_control = graph()->NewNode(common()->IfTrue(), branch);
1285 graph()->NewNode(simplified()->CompareMaps(maps),
1288 graph()->NewNode(common()->Branch(), check, this_control);
1289 fallthrough_control = graph()->NewNode(common()->IfFalse(), branch);
1290 this_control = graph()->NewNode(common()->IfTrue(), branch);
1299 this_control = graph()->NewNode(common()->Merge(2), this_control,
1301 this_effect = graph()->NewNode(common()->EffectPhi(2), this_effect,
1317 graph()->NewNode(simplified()->MapGuard(maps),
1329 graph()->NewNode(common()->TypeGuard(Type::String()),
1341 // NewNode or BuildCheckMaps) in some cases but we haven't connected
1363 control = graph()->NewNode(common()->Merge(control_count), control_count,
1366 value = graph()->NewNode(
1370 effect = graph()->NewNode(common()->EffectPhi(control_count),
1380 Node* merge = graph()->NewNode(common()->Merge(if_exception_count),
1384 graph()->NewNode(common()->EffectPhi(if_exception_count),
1386 Node* phi = graph()->NewNode(
1472 graph()->NewNode(load_op, receiver, n.feedback_vector(), context,
1485 graph()->NewNode(common()->IfException(), effect, control);
1486 Node* if_success = graph()->NewNode(common()->IfSuccess(), control);
1492 graph()->NewNode(common()->Merge(2), dead_node, exception_node);
1493 Node* effect_phi = graph()->NewNode(common()->EffectPhi(2), dead_node,
1496 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
1510 Node* deopt_checkpoint = graph()->NewNode(
1525 graph()->NewNode(call_op, load_property, receiver, n.feedback_vector(),
1562 receiver = effect = graph()->NewNode(
1566 Node* length = graph()->NewNode(simplified()->StringLength(), receiver);
1727 effect = graph()->NewNode(
1745 graph()->NewNode(common()->Checkpoint(), frame_state, effect, control);
1779 this_effect = graph()->NewNode(
1805 graph()->NewNode(simplified()->CompareMaps(maps), receiver,
1808 graph()->NewNode(common()->Branch(), check, fallthrough_control);
1809 fallthrough_control = graph()->NewNode(common()->IfFalse(), branch);
1810 this_control = graph()->NewNode(common()->IfTrue(), branch);
1813 this_effect = graph()->NewNode(simplified()->MapGuard(maps), receiver,
1837 control = graph()->NewNode(common()->Merge(control_count), control_count,
1840 value = graph()->NewNode(
1844 effect = graph()->NewNode(common()->EffectPhi(control_count),
1894 Node* actual_elements = effect = graph()->NewNode(
1897 Node* check = graph()->NewNode(simplified()->ReferenceEqual(),
1900 effect = graph()->NewNode(
1986 graph()->NewNode(common()->Deoptimize(reason, FeedbackSource()),
2068 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()),
2070 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), receiver_map,
2073 graph()->NewNode(simplified()->CheckIf(DeoptimizeReason::kWrongMap),
2078 Node* descriptor_array = effect = graph()->NewNode(
2081 Node* enum_cache = effect = graph()->NewNode(
2084 Node* enum_indices = effect = graph()->NewNode(
2089 Node* check = graph()->NewNode(
2091 graph()->NewNode(simplified()->ReferenceEqual(), enum_indices,
2093 effect = graph()->NewNode(
2098 Node* key = effect = graph()->NewNode(
2104 Node* value = effect = graph()->NewNode(simplified()->LoadFieldByIndex(),
2164 value = *effect = *control = graph()->NewNode(
2185 graph()->NewNode(common()->IfException(), *control, *effect);
2186 Node* const if_success = graph()->NewNode(common()->IfSuccess(), *control);
2202 *effect = *control = graph()->NewNode(
2219 graph()->NewNode(common()->IfException(), *control, *effect);
2220 Node* const if_success = graph()->NewNode(common()->IfSuccess(), *control);
2251 graph()->NewNode(common()->ExternalConstant(ExternalReference::Create(
2272 graph()->NewNode(common()->Call(call_descriptor), index, inputs);
2304 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForCellValue()),
2308 value = graph()->NewNode(simplified()->StringLength(), receiver);
2407 storage = effect = graph()->NewNode(
2429 graph()->NewNode(simplified()->CheckNumber(FeedbackSource()), value,
2459 graph()->NewNode(simplified()->LoadField(storage_access), storage,
2469 Node* current_value = effect = graph()->NewNode(
2473 graph()->NewNode(simplified()->SameValue(), current_value, value);
2474 effect = graph()->NewNode(
2488 Node* current_value = effect = graph()->NewNode(
2491 Node* check = graph()->NewNode(simplified()->SameValueNumbersOnly(),
2493 effect = graph()->NewNode(
2500 value = effect = graph()->NewNode(
2510 graph()->NewNode(simplified()->CheckMaps(
2516 value = effect = graph()->NewNode(simplified()->CheckHeapObject(),
2554 effect = graph()->NewNode(simplified()->StoreField(field_access),
2562 effect = graph()->NewNode(
2564 effect = graph()->NewNode(
2567 effect = graph()->NewNode(simplified()->StoreField(field_access), storage,
2569 effect = graph()->NewNode(common()->FinishRegion(),
2573 effect = graph()->NewNode(simplified()->StoreField(field_access), storage,
2674 length = effect = graph()->NewNode(
2687 graph()->NewNode(simplified()->LoadField(
2694 graph()->NewNode(simplified()->LoadField(
2705 : (effect = graph()->NewNode(
2712 Node* buffer_bit_field = effect = graph()->NewNode(
2715 Node* check = graph()->NewNode(
2717 graph()->NewNode(
2721 effect = graph()->NewNode(
2738 index = effect = graph()->NewNode(
2744 index = graph()->NewNode(simplified()->NumberToUint32(), index);
2748 index = effect = graph()->NewNode(
2763 graph()->NewNode(simplified()->NumberLessThan(), index, length);
2764 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue),
2767 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
2774 index = etrue = graph()->NewNode(
2782 vtrue = etrue = graph()->NewNode(
2788 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
2796 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
2798 graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control);
2800 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
2805 value = effect = graph()->NewNode(
2818 value = effect = graph()->NewNode(
2828 value = graph()->NewNode(simplified()->NumberToUint8Clamped(), value);
2835 graph()->NewNode(simplified()->NumberLessThan(), index, length);
2836 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue),
2839 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
2845 index = etrue = graph()->NewNode(
2853 etrue = graph()->NewNode(
2859 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
2865 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
2867 graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control);
2871 effect = graph()->NewNode(
2881 graph()->NewNode(simplified()->SpeculativeNumberLessThan(
2893 Node* elements = effect = graph()->NewNode(
2902 effect = graph()->NewNode(
2915 ? graph()->NewNode(
2919 : graph()->NewNode(
2932 index = effect = graph()->NewNode(
2938 index = effect = graph()->NewNode(
2975 graph()->NewNode(simplified()->NumberLessThan(), index, length);
2976 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue),
2979 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
2987 graph()->NewNode(simplified()->CheckBounds(
2995 graph()->NewNode(simplified()->LoadElement(element_access),
3004 vtrue = graph()->NewNode(
3009 vtrue = etrue = graph()->NewNode(
3016 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
3024 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
3026 graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control);
3028 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
3033 graph()->NewNode(simplified()->LoadElement(element_access),
3043 value = graph()->NewNode(
3047 value = effect = graph()->NewNode(
3059 value = effect = graph()->NewNode(
3067 value = effect = graph()->NewNode(simplified()->SpeculativeNumberLessThan(
3073 Node* branch = graph()->NewNode(common()->Branch(), value, control);
3075 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
3087 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
3090 Node* checked = etrue = graph()->NewNode(
3096 graph()->NewNode(simplified()->LoadElement(element_access),
3105 vtrue = graph()->NewNode(simplified()->ReferenceEqual(), element,
3109 graph()->NewNode(simplified()->NumberIsFloat64Hole(), element);
3113 vtrue = graph()->NewNode(simplified()->BooleanNot(), vtrue);
3118 etrue = graph()->NewNode(simplified()->CheckNotTaggedHole(),
3121 etrue = graph()->NewNode(
3130 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
3132 graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control);
3134 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
3143 value = effect = graph()->NewNode(
3147 graph()->NewNode(simplified()->CheckNumber(FeedbackSource()), value,
3150 value = graph()->NewNode(simplified()->NumberSilenceNaN(), value);
3157 graph()->NewNode(simplified()->EnsureWritableFastElements(),
3161 Node* elements_length = effect = graph()->NewNode(
3177 ? graph()->NewNode(simplified()->NumberAdd(), elements_length,
3179 : graph()->NewNode(simplified()->NumberAdd(), length,
3181 index = effect = graph()->NewNode(
3191 elements = effect = graph()->NewNode(
3200 graph()->NewNode(simplified()->EnsureWritableFastElements(),
3207 graph()->NewNode(simplified()->NumberLessThan(), index, length);
3208 Node* branch = graph()->NewNode(common()->Branch(), check, control);
3210 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
3217 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
3222 Node* new_length = graph()->NewNode(
3224 efalse = graph()->NewNode(
3230 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
3232 graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control);
3237 effect = graph()->NewNode(simplified()->StoreElement(element_access),
3251 index = *effect = graph()->NewNode(
3259 graph()->NewNode(simplified()->NumberLessThan(), index, length);
3261 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, *control);
3263 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
3267 Node* etrue = index = graph()->NewNode(
3272 Node* vtrue = etrue = graph()->NewNode(simplified()->StringCharCodeAt(),
3274 vtrue = graph()->NewNode(simplified()->StringFromSingleCharCode(), vtrue);
3276 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
3279 *control = graph()->NewNode(common()->Merge(2), if_true, if_false);
3281 graph()->NewNode(common()->EffectPhi(2), etrue, *effect, *control);
3282 return graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
3286 index = *effect = graph()->NewNode(
3292 Node* value = *effect = graph()->NewNode(
3294 value = graph()->NewNode(simplified()->StringFromSingleCharCode(), value);
3318 Node* value = effect = graph()->NewNode(
3331 hash = graph()->NewNode(
3333 graph()->NewNode(simplified()->ObjectIsSmi(), properties), properties,
3335 hash = effect = graph()->NewNode(common()->TypeGuard(Type::SignedSmall()),
3338 graph()->NewNode(simplified()->NumberShiftLeft(), hash,
3341 hash = effect = graph()->NewNode(
3345 graph()->NewNode(simplified()->NumberBitwiseAnd(), hash,
3348 Node* new_length_and_hash = graph()->NewNode(
3352 graph()->NewNode(common()->TypeGuard(Type::SignedSmall()),
3375 return graph()->NewNode(op, jsgraph()->Constant(name), value, effect,
3440 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), object,
3442 return graph()->NewNode(