Lines Matching refs:NewNode
326 graph()->NewNode(common()->IfException(), effect(), control());
330 AddNode(graph()->NewNode(common()->IfSuccess(), control()));
402 Node* merge = gasm_->graph()->NewNode(gasm_->common()->Merge(size),
411 Node* ephi = gasm_->graph()->NewNode(gasm_->common()->EffectPhi(size),
414 Node* phi = gasm_->graph()->NewNode(
794 graph()->NewNode(simplified()->CheckFloat64Hole(mode, feedback()),
838 graph()->NewNode(javascript()->CreatePromise(), context, effect()));
844 return AddNode<Context>(graph()->NewNode(
864 return AddNode<JSFunction>(graph()->NewNode(
876 return AddNode<Object>(graph()->NewNode(
892 return AddNode<Object>(graph()->NewNode(
1012 graph()->NewNode(simplified()->FastApiCall(c_candidate_functions_,
1029 graph()->NewNode(simplified()->SpeculativeToNumber(hint, feedback()),
1034 return AddNode<Smi>(graph()->NewNode(simplified()->CheckSmi(feedback()),
1039 return AddNode<String>(graph()->NewNode(simplified()->CheckString(feedback()),
1045 return AddNode<Number>(graph()->NewNode(simplified()->CheckBounds(feedback()),
1086 return AddNode<Object>(graph()->NewNode(
1103 return AddNode<Object>(graph()->NewNode(
1118 graph()->NewNode(javascript()->CallRuntime(function_id, 2), arg0, arg1,
1135 graph()->NewNode(javascript()->CreateArray(1, base::nullopt), ctor, ctor,
1163 return TNode<Object>::UncheckedCast(graph()->NewNode(op, input_as_number));
1172 graph()->NewNode(op, left_number, right_number));
1233 auto is_equal = graph()->NewNode(simplified()->NumberEqual(),
1274 auto is_equal = graph()->NewNode(simplified()->NumberEqual(),
2176 Node* node0 = graph->NewNode(op0);
2188 Node* params_node = graph->NewNode(op_param, static_cast<int>(params.size()),
2191 return FrameState(graph->NewNode(op, params_node, node0, node0, context,
2400 graph()->NewNode(simplified()->SpeculativeToNumber(
2404 graph()->NewNode(simplified()->SpeculativeToNumber(
2407 left = graph()->NewNode(simplified()->NumberToUint32(), left);
2408 right = graph()->NewNode(simplified()->NumberToUint32(), right);
2409 Node* value = graph()->NewNode(simplified()->NumberImul(), left, right);
2431 graph()->NewNode(simplified()->SpeculativeToNumber(
2434 input = graph()->NewNode(simplified()->NumberToUint32(), input);
2435 Node* value = graph()->NewNode(simplified()->NumberClz32(), input);
2457 graph()->NewNode(simplified()->SpeculativeToNumber(
2461 Node* input = effect = graph()->NewNode(
2465 value = graph()->NewNode(op, value, input);
2531 value = graph()->NewNode(simplified()->ToBoolean(), value);
2623 graph()->NewNode(simplified()->ReferenceEqual(), arguments_list,
2625 control = graph()->NewNode(common()->Branch(BranchHint::kFalse), check_null,
2627 Node* if_null = graph()->NewNode(common()->IfTrue(), control);
2628 control = graph()->NewNode(common()->IfFalse(), control);
2632 graph()->NewNode(simplified()->ReferenceEqual(), arguments_list,
2634 control = graph()->NewNode(common()->Branch(BranchHint::kFalse),
2636 Node* if_undefined = graph()->NewNode(common()->IfTrue(), control);
2637 control = graph()->NewNode(common()->IfFalse(), control);
2643 Node* value0 = effect0 = control0 = graph()->NewNode(
2652 Node* control1 = graph()->NewNode(common()->Merge(2), if_null, if_undefined);
2653 Node* value1 = effect1 = control1 = graph()->NewNode(
2662 graph()->NewNode(common()->IfException(), control0, effect0);
2663 control0 = graph()->NewNode(common()->IfSuccess(), control0);
2665 graph()->NewNode(common()->IfException(), control1, effect1);
2666 control1 = graph()->NewNode(common()->IfSuccess(), control1);
2670 graph()->NewNode(common()->Merge(2), if_exception0, if_exception1);
2671 Node* ephi = graph()->NewNode(common()->EffectPhi(2), if_exception0,
2674 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
2680 control = graph()->NewNode(common()->Merge(2), control0, control1);
2681 effect = graph()->NewNode(common()->EffectPhi(2), effect0, effect1, control);
2683 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), value0,
2813 graph()->NewNode(javascript()->CreateBoundFunction(
2836 context = effect = graph()->NewNode(
2940 Node* value = graph()->NewNode(simplified()->SameValue(), lhs, rhs);
3009 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()),
3011 Node* check = graph()->NewNode(simplified()->ReferenceEqual(),
3013 effect = graph()->NewNode(
3153 Node* check = graph()->NewNode(simplified()->ObjectIsReceiver(), target);
3155 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control);
3158 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
3161 if_false = efalse = graph()->NewNode(
3170 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
3181 graph()->NewNode(common()->Call(call_descriptor), stub_code, target,
3189 Node* extrue = graph()->NewNode(common()->IfException(), etrue, if_true);
3190 if_true = graph()->NewNode(common()->IfSuccess(), if_true);
3191 Node* exfalse = graph()->NewNode(common()->IfException(), efalse, if_false);
3192 if_false = graph()->NewNode(common()->IfSuccess(), if_false);
3195 Node* merge = graph()->NewNode(common()->Merge(2), extrue, exfalse);
3197 graph()->NewNode(common()->EffectPhi(2), extrue, exfalse, merge);
3199 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
3205 if_false = graph()->NewNode(common()->Throw(), efalse, if_false);
3224 Node* check = graph()->NewNode(simplified()->ObjectIsReceiver(), target);
3226 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control);
3229 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
3232 if_false = efalse = graph()->NewNode(
3241 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
3246 vtrue = etrue = if_true = graph()->NewNode(
3255 Node* extrue = graph()->NewNode(common()->IfException(), etrue, if_true);
3256 if_true = graph()->NewNode(common()->IfSuccess(), if_true);
3257 Node* exfalse = graph()->NewNode(common()->IfException(), efalse, if_false);
3258 if_false = graph()->NewNode(common()->IfSuccess(), if_false);
3261 Node* merge = graph()->NewNode(common()->Merge(2), extrue, exfalse);
3263 graph()->NewNode(common()->EffectPhi(2), extrue, exfalse, merge);
3265 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
3271 if_false = graph()->NewNode(common()->Throw(), efalse, if_false);
3712 graph()->NewNode(simplified()->ConvertReceiver(p.convert_mode()),
3806 graph()->NewNode(simplified()->ConvertReceiver(p.convert_mode()),
3923 graph()->NewNode(simplified()->ObjectIsConstructor(), new_target);
3925 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control);
3926 Node* check_fail = graph()->NewNode(common()->IfFalse(), check_branch);
3927 Node* check_throw = check_fail = graph()->NewNode(
3931 control = graph()->NewNode(common()->IfTrue(), check_branch);
3939 graph()->NewNode(common()->IfException(), check_throw, check_fail);
3940 check_fail = graph()->NewNode(common()->IfSuccess(), check_fail);
3944 graph()->NewNode(common()->Merge(2), if_exception, on_exception);
3945 Node* ephi = graph()->NewNode(common()->EffectPhi(2), if_exception,
3948 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
3960 graph()->NewNode(common()->Throw(), check_throw, check_fail);
3996 Node* length = effect = graph()->NewNode(
3999 Node* check = graph()->NewNode(simplified()->NumberEqual(), length,
4001 return graph()->NewNode(
4279 effect = graph()->NewNode(
4293 Node* elements = effect = graph()->NewNode(
4299 Node* load = effect = graph()->NewNode(
4309 load = effect = graph()->NewNode(
4314 load = graph()->NewNode(simplified()->ConvertTaggedHoleToUndefined(),
4494 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), target,
4496 effect = graph()->NewNode(
4513 graph()->NewNode(simplified()->CheckClosure(feedback_cell.object()),
5041 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), target,
5043 effect = graph()->NewNode(
5062 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), new_target,
5064 effect = graph()->NewNode(
5186 graph()->NewNode(common()->Select(MachineRepresentation::kTagged),
5187 graph()->NewNode(simplified()->ReferenceEqual(),
5229 graph()->NewNode(common()->Select(MachineRepresentation::kTagged),
5230 graph()->NewNode(simplified()->ReferenceEqual(),
5268 Node* new_receiver = effect = graph()->NewNode(
5273 graph()->NewNode(simplified()->CheckString(p.feedback()), search_string,
5279 new_position = effect = graph()->NewNode(
5283 graph()->NewNode(simplified()->StringLength(), new_receiver);
5284 new_position = graph()->NewNode(
5286 graph()->NewNode(simplified()->NumberMax(), new_position,
5304 graph()->NewNode(simplified()->BooleanNot(),
5305 graph()->NewNode(simplified()->NumberEqual(), node,
5356 receiver = effect = graph()->NewNode(simplified()->CheckString(p.feedback()),
5359 start = effect = graph()->NewNode(simplified()->CheckSmi(p.feedback()), start,
5362 Node* length = graph()->NewNode(simplified()->StringLength(), receiver);
5366 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), end,
5369 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control);
5371 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
5375 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
5377 Node* vfalse = efalse = graph()->NewNode(
5380 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
5381 effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control);
5382 end = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
5386 Node* initStart = graph()->NewNode(
5388 graph()->NewNode(simplified()->NumberLessThan(), start,
5390 graph()->NewNode(
5392 graph()->NewNode(simplified()->NumberAdd(), length, start),
5397 initStart = effect = graph()->NewNode(
5400 Node* resultLength = graph()->NewNode(
5402 graph()->NewNode(simplified()->NumberMax(), end,
5404 graph()->NewNode(simplified()->NumberSubtract(), length, initStart));
5408 Node* to = effect = graph()->NewNode(
5410 graph()->NewNode(simplified()->NumberAdd(), initStart, resultLength),
5416 Node* check = graph()->NewNode(simplified()->NumberLessThan(),
5420 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control);
5422 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
5425 graph()->NewNode(simplified()->StringSubstring(), receiver, initStart,
5428 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
5432 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
5433 effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control);
5435 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
5483 graph()->NewNode(common()->Deoptimize(reason, FeedbackSource()),
5497 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()),
5499 Node* receiver_bit_field2 = effect_node = graph()->NewNode(
5502 Node* receiver_elements_kind = graph()->NewNode(
5504 graph()->NewNode(
5516 graph()->NewNode(simplified()->NumberEqual(), receiver_elements_kind,
5519 graph()->NewNode(common()->Branch(), is_packed_kind, control);
5520 Node* if_packed = graph()->NewNode(common()->IfTrue(), packed_branch);
5523 Node* if_not_packed = graph()->NewNode(common()->IfFalse(), packed_branch);
5525 graph()->NewNode(simplified()->NumberEqual(), receiver_elements_kind,
5528 graph()->NewNode(common()->Branch(), is_holey_kind, if_not_packed);
5529 Node* if_holey = graph()->NewNode(common()->IfTrue(), holey_branch);
5532 graph()->NewNode(common()->IfFalse(), holey_branch);
5534 *if_true = graph()->NewNode(common()->Merge(2), if_packed, if_holey);
5538 *if_false = graph()->NewNode(common()->IfFalse(), packed_branch);
5598 value = effect = graph()->NewNode(simplified()->CheckSmi(p.feedback()),
5601 value = effect = graph()->NewNode(
5604 value = graph()->NewNode(simplified()->NumberSilenceNaN(), value);
5609 Node* length = effect = graph()->NewNode(
5617 Node* new_length = return_value = graph()->NewNode(
5621 Node* elements = effect = graph()->NewNode(
5624 Node* elements_length = effect = graph()->NewNode(
5632 elements = effect = graph()->NewNode(
5635 graph()->NewNode(simplified()->NumberAdd(), length,
5641 effect = graph()->NewNode(
5648 Node* index = graph()->NewNode(simplified()->NumberAdd(), length,
5651 graph()->NewNode(simplified()->StoreElement(
5665 control = graph()->NewNode(common()->Merge(count), count,
5668 effect = graph()->NewNode(common()->EffectPhi(count), count + 1,
5672 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, count),
5728 Node* length = effect = graph()->NewNode(
5733 Node* check = graph()->NewNode(simplified()->NumberEqual(), length,
5736 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control);
5738 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
5742 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
5750 Node* elements = efalse = graph()->NewNode(
5757 graph()->NewNode(simplified()->EnsureWritableFastElements(),
5762 Node* new_length = graph()->NewNode(simplified()->NumberSubtract(),
5767 new_length = efalse = graph()->NewNode(
5773 efalse = graph()->NewNode(
5778 vfalse = efalse = graph()->NewNode(
5783 efalse = graph()->NewNode(
5789 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
5790 effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control);
5791 value = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
5798 graph()->NewNode(simplified()->ConvertTaggedHoleToUndefined(), value);
5809 control = graph()->NewNode(common()->Merge(count), count,
5812 effect = graph()->NewNode(common()->EffectPhi(count), count + 1,
5816 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, count),
5875 Node* length = effect = graph()->NewNode(
5880 Node* check0 = graph()->NewNode(simplified()->NumberEqual(), length,
5883 graph()->NewNode(common()->Branch(BranchHint::kFalse), check0, control);
5885 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0);
5889 Node* if_false0 = graph()->NewNode(common()->IfFalse(), branch0);
5895 graph()->NewNode(simplified()->NumberLessThanOrEqual(), length,
5897 Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kTrue),
5900 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
5904 Node* elements = etrue1 = graph()->NewNode(
5909 vtrue1 = etrue1 = graph()->NewNode(
5917 graph()->NewNode(simplified()->EnsureWritableFastElements(),
5922 Node* loop = graph()->NewNode(common()->Loop(2), if_true1, if_true1);
5924 graph()->NewNode(common()->EffectPhi(2), etrue1, etrue1, loop);
5925 Node* terminate = graph()->NewNode(common()->Terminate(), eloop, loop);
5928 Node* index = graph()->NewNode(
5935 graph()->NewNode(simplified()->NumberLessThan(), index, length);
5936 Node* branch2 = graph()->NewNode(common()->Branch(), check2, loop);
5938 if_true1 = graph()->NewNode(common()->IfFalse(), branch2);
5941 Node* control2 = graph()->NewNode(common()->IfTrue(), branch2);
5956 graph()->NewNode(common()->TypeGuard(Type::UnsignedSmall()),
5960 graph()->NewNode(simplified()->LoadElement(access), elements,
5962 effect2 = graph()->NewNode(
5964 graph()->NewNode(simplified()->NumberSubtract(), index_retyped,
5971 graph()->NewNode(simplified()->NumberAdd(), index,
5976 Node* new_length = graph()->NewNode(simplified()->NumberSubtract(),
5981 new_length = etrue1 = graph()->NewNode(
5987 etrue1 = graph()->NewNode(
5992 etrue1 = graph()->NewNode(
5999 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
6017 graph()->NewNode(common()->Call(call_descriptor), stub_code,
6023 if_false0 = graph()->NewNode(common()->Merge(2), if_true1, if_false1);
6025 graph()->NewNode(common()->EffectPhi(2), etrue1, efalse1, if_false0);
6027 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
6031 control = graph()->NewNode(common()->Merge(2), if_true0, if_false0);
6032 effect = graph()->NewNode(common()->EffectPhi(2), etrue0, efalse0, control);
6033 value = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
6040 graph()->NewNode(simplified()->ConvertTaggedHoleToUndefined(), value);
6051 control = graph()->NewNode(common()->Merge(count), count,
6054 effect = graph()->NewNode(common()->EffectPhi(count), count + 1,
6058 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, count),
6135 Node* clone = effect = graph()->NewNode(
6197 Node* buffer = effect = graph()->NewNode(
6200 Node* buffer_bit_field = effect = graph()->NewNode(
6203 Node* check = graph()->NewNode(
6205 graph()->NewNode(
6209 effect = graph()->NewNode(
6286 Node* buffer = effect = graph()->NewNode(
6289 Node* buffer_bit_field = effect = graph()->NewNode(
6292 Node* check = graph()->NewNode(
6294 graph()->NewNode(
6298 effect = graph()->NewNode(
6315 Node* index = effect = graph()->NewNode(simplified()->LoadField(index_access),
6324 Node* elements = effect = graph()->NewNode(
6335 Node* length = effect = graph()->NewNode(
6339 Node* check = graph()->NewNode(simplified()->NumberLessThan(), index, length);
6341 graph()->NewNode(common()->Branch(BranchHint::kNone), check, control);
6346 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
6350 index = etrue = graph()->NewNode(
6365 graph()->NewNode(simplified()->LoadField(
6368 Node* external_ptr = etrue = graph()->NewNode(
6386 graph()->NewNode(simplified()->LoadField(
6391 graph()->NewNode(simplified()->LoadTypedElement(array_type), buffer,
6394 value_true = etrue = graph()->NewNode(
6402 value_true = graph()->NewNode(
6407 value_true = etrue = graph()->NewNode(
6416 graph()->NewNode(javascript()->CreateKeyValueArray(), index,
6425 Node* next_index = graph()->NewNode(simplified()->NumberAdd(), index,
6427 etrue = graph()->NewNode(simplified()->StoreField(index_access), iterator,
6434 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
6452 efalse = graph()->NewNode(simplified()->StoreField(index_access),
6457 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
6458 effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control);
6460 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
6463 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
6467 value = effect = graph()->NewNode(javascript()->CreateIterResultObject(),
6491 receiver = effect = graph()->NewNode(simplified()->CheckString(p.feedback()),
6496 graph()->NewNode(simplified()->StringLength(), receiver);
6499 index = effect = graph()->NewNode(simplified()->CheckBounds(p.feedback()),
6503 Node* value = effect = graph()->NewNode(string_access_operator, receiver,
6566 receiver = effect = graph()->NewNode(simplified()->CheckString(p.feedback()),
6571 graph()->NewNode(simplified()->StringLength(), receiver);
6574 index = effect = graph()->NewNode(simplified()->CheckBounds(p.feedback()),
6578 Node* value = effect = graph()->NewNode(simplified()->StringCharCodeAt(),
6580 value = graph()->NewNode(simplified()->StringFromSingleCharCode(), value);
6597 Node* receiver = effect = graph()->NewNode(
6618 Node* receiver = effect = graph()->NewNode(
6644 input = effect = graph()->NewNode(
6650 graph()->NewNode(simplified()->StringFromSingleCharCode(), input);
6670 input = effect = graph()->NewNode(
6676 graph()->NewNode(simplified()->StringFromSingleCodePoint(), input);
6689 Node* receiver = effect = graph()->NewNode(
6692 graph()->NewNode(javascript()->CreateStringIterator(), receiver,
6778 Node* string = effect = graph()->NewNode(
6781 Node* index = effect = graph()->NewNode(
6784 Node* length = graph()->NewNode(simplified()->StringLength(), string);
6788 graph()->NewNode(simplified()->NumberLessThan(), index, length);
6790 graph()->NewNode(common()->Branch(BranchHint::kNone), check0, control);
6793 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0);
6798 vtrue0 = etrue0 = graph()->NewNode(simplified()->StringFromCodePointAt(),
6802 Node* char_length = graph()->NewNode(simplified()->StringLength(), vtrue0);
6803 index = graph()->NewNode(simplified()->NumberAdd(), index, char_length);
6804 etrue0 = graph()->NewNode(
6809 Node* if_false0 = graph()->NewNode(common()->IfFalse(), branch0);
6817 control = graph()->NewNode(common()->Merge(2), if_true0, if_false0);
6818 effect = graph()->NewNode(common()->EffectPhi(2), etrue0, effect, control);
6820 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), vtrue0,
6823 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
6826 value = effect = graph()->NewNode(javascript()->CreateIterResultObject(),
6845 Node* receiver = effect = graph()->NewNode(
6853 Node* argument = effect = graph()->NewNode(
6856 graph()->NewNode(simplified()->StringLength(), receiver);
6858 graph()->NewNode(simplified()->StringLength(), argument);
6859 Node* length = graph()->NewNode(simplified()->NumberAdd(), receiver_length,
6861 length = effect = graph()->NewNode(
6865 Node* value = graph()->NewNode(simplified()->StringConcat(), length, receiver,
6949 return graph()->NewNode(javascript()->CreateClosure(shared, code),
6985 Node* check = graph()->NewNode(simplified()->ObjectIsCallable(), on_finally);
6987 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control);
6989 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
7000 graph()->NewNode(javascript()->CreateFunctionContext(
7006 etrue = graph()->NewNode(
7010 etrue = graph()->NewNode(
7028 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
7033 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
7034 effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control);
7036 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
7039 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
7050 effect = graph()->NewNode(simplified()->MapGuard(maps), receiver, effect,
7103 on_fulfilled = graph()->NewNode(
7105 graph()->NewNode(simplified()->ObjectIsCallable(), on_fulfilled),
7109 on_rejected = graph()->NewNode(
7111 graph()->NewNode(simplified()->ObjectIsCallable(), on_rejected),
7116 graph()->NewNode(javascript()->CreatePromise(), context, effect);
7119 promise = effect = graph()->NewNode(
7131 effect = graph()->NewNode(
7200 graph()->NewNode(javascript()->CreateTypedArray(), target, new_target,
7215 Node* smi_check = graph()->NewNode(simplified()->ObjectIsSmi(), receiver);
7216 control = graph()->NewNode(common()->Branch(BranchHint::kFalse), smi_check,
7221 controls.push_back(graph()->NewNode(common()->IfTrue(), control));
7223 control = graph()->NewNode(common()->IfFalse(), control);
7225 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()),
7227 Node* receiver_bit_field2 = effect = graph()->NewNode(
7230 Node* receiver_elements_kind = graph()->NewNode(
7232 graph()->NewNode(
7240 receiver_elements_kind = graph()->NewNode(
7246 Node* check = graph()->NewNode( \
7250 control = graph()->NewNode(common()->Branch(), check, control); \
7254 controls.push_back(graph()->NewNode(common()->IfTrue(), control)); \
7255 control = graph()->NewNode(common()->IfFalse(), control); \
7265 control = graph()->NewNode(common()->Merge(count), count, &controls.front());
7268 graph()->NewNode(common()->EffectPhi(count), count + 1, &effects.front());
7271 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, count),
7286 Node* value = graph()->NewNode(simplified()->ObjectIsFiniteNumber(), input);
7300 Node* value = graph()->NewNode(simplified()->ObjectIsInteger(), input);
7314 Node* value = graph()->NewNode(simplified()->ObjectIsSafeInteger(), input);
7328 Node* value = graph()->NewNode(simplified()->ObjectIsNaN(), input);
7347 Node* table = effect = graph()->NewNode(
7351 Node* entry = effect = graph()->NewNode(
7354 Node* check = graph()->NewNode(simplified()->NumberEqual(), entry,
7357 Node* branch = graph()->NewNode(common()->Branch(), check, control);
7360 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
7365 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
7367 Node* vfalse = efalse = graph()->NewNode(
7371 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
7372 Node* value = graph()->NewNode(
7374 effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control);
7394 Node* table = effect = graph()->NewNode(
7398 Node* index = effect = graph()->NewNode(
7401 Node* value = graph()->NewNode(simplified()->NumberEqual(), index,
7403 value = graph()->NewNode(simplified()->BooleanNot(), value);
7437 Node* js_create_iterator = effect = graph()->NewNode(
7457 Node* table = effect = graph()->NewNode(
7460 Node* value = effect = graph()->NewNode(
7520 graph()->NewNode(common()->Loop(2), control, control);
7522 graph()->NewNode(common()->EffectPhi(2), effect, effect, loop);
7523 Node* terminate = graph()->NewNode(common()->Terminate(), eloop, loop);
7527 Node* table = effect = graph()->NewNode(
7531 graph()->NewNode(simplified()->LoadField(
7534 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), next_table);
7536 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control);
7539 done_loop = graph()->NewNode(common()->IfTrue(), control);
7543 control = graph()->NewNode(common()->IfFalse(), control);
7546 Node* index = effect = graph()->NewNode(
7556 graph()->NewNode(common()->Call(call_descriptor),
7560 index = effect = graph()->NewNode(
7565 effect = graph()->NewNode(
7568 effect = graph()->NewNode(
7581 Node* index = effect = graph()->NewNode(
7584 Node* table = effect = graph()->NewNode(
7590 Node* iterator_result = effect = graph()->NewNode(
7599 Node* number_of_buckets = effect = graph()->NewNode(
7603 Node* number_of_elements = effect = graph()->NewNode(
7607 Node* number_of_deleted_elements = effect = graph()->NewNode(
7612 graph()->NewNode(simplified()->NumberAdd(), number_of_elements,
7616 Node* loop = graph()->NewNode(common()->Loop(2), control, control);
7618 graph()->NewNode(common()->EffectPhi(2), effect, effect, loop);
7619 Node* terminate = graph()->NewNode(common()->Terminate(), eloop, loop);
7621 Node* iloop = graph()->NewNode(
7624 index = effect = graph()->NewNode(
7628 Node* check0 = graph()->NewNode(simplified()->NumberLessThan(), index,
7631 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, loop);
7633 Node* if_false0 = graph()->NewNode(common()->IfFalse(), branch0);
7637 efalse0 = graph()->NewNode(
7647 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0);
7653 Node* entry_start_position = graph()->NewNode(
7655 graph()->NewNode(
7657 graph()->NewNode(simplified()->NumberMultiply(), index,
7661 Node* entry_key = etrue0 = graph()->NewNode(
7666 index = graph()->NewNode(simplified()->NumberAdd(), index,
7670 graph()->NewNode(simplified()->ReferenceEqual(), entry_key,
7672 Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kFalse),
7677 control = graph()->NewNode(common()->IfFalse(), branch1);
7680 graph()->NewNode(common()->TypeGuard(Type::NonInternal()),
7685 effect = graph()->NewNode(
7698 graph()->NewNode(javascript()->CreateKeyValueArray(), value,
7703 value = effect = graph()->NewNode(
7707 graph()->NewNode(
7714 value = effect = graph()->NewNode(
7718 graph()->NewNode(
7723 graph()->NewNode(javascript()->CreateKeyValueArray(),
7733 graph()->NewNode(simplified()->StoreField(
7737 graph()->NewNode(simplified()->StoreField(
7746 loop->ReplaceInput(1, graph()->NewNode(common()->IfTrue(), branch1));
7752 control = effects[2] = graph()->NewNode(common()->Merge(2), 2, controls);
7753 effect = graph()->NewNode(common()->EffectPhi(2), 3, effects);
7784 Node* value = effect = graph()->NewNode(simplified()->LoadField(access),
7790 Node* buffer = effect = graph()->NewNode(
7793 Node* buffer_bit_field = effect = graph()->NewNode(
7796 Node* check = graph()->NewNode(
7798 graph()->NewNode(
7808 value = graph()->NewNode(
7871 offset = effect = graph()->NewNode(simplified()->CheckBounds(p.feedback()),
7876 graph()->NewNode(simplified()->LoadField(
7887 byte_length = graph()->NewNode(
7889 graph()->NewNode(simplified()->NumberSubtract(), byte_length,
7894 offset = effect = graph()->NewNode(simplified()->CheckBounds(p.feedback()),
7900 graph()->NewNode(simplified()->ToBoolean(), is_little_endian);
7904 value = effect = graph()->NewNode(
7918 Node* buffer = effect = graph()->NewNode(
7923 Node* buffer_bit_field = effect = graph()->NewNode(
7926 Node* check = graph()->NewNode(
7928 graph()->NewNode(
7932 effect = graph()->NewNode(
7943 Node* data_pointer = effect = graph()->NewNode(
7950 value = effect = graph()->NewNode(
7956 effect = graph()->NewNode(
7985 graph()->NewNode(simplified()->SpeculativeToNumber(
7988 Node* value = graph()->NewNode(simplified()->NumberIsFinite(), input);
8011 graph()->NewNode(simplified()->SpeculativeToNumber(
8014 Node* value = graph()->NewNode(simplified()->NumberIsNaN(), input);
8031 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForJSDateValue()),
8042 graph()->NewNode(simplified()->DateNow(), effect, control);
8135 Node* search_string = effect = graph()->NewNode(
8138 Node* lastIndex = effect = graph()->NewNode(
8142 Node* lastIndexSmi = effect = graph()->NewNode(
8145 Node* is_positive = graph()->NewNode(simplified()->NumberLessThanOrEqual(),
8148 effect = graph()->NewNode(
8213 value = effect = graph()->NewNode(