Lines Matching refs:NewNode
163 Node* value = graph()->NewNode(javascript()->ToBoolean(ToBooleanHint::kAny), in ReduceJSInstanceOf()
244 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), index, in ReduceNamedAccess()
246 effect = graph()->NewNode(simplified()->CheckIf(), check, effect, control); in ReduceNamedAccess()
255 receiver = effect = graph()->NewNode(simplified()->CheckString(), in ReduceNamedAccess()
259 receiver = effect = graph()->NewNode(simplified()->CheckNumber(), in ReduceNamedAccess()
263 receiver = effect = graph()->NewNode(simplified()->CheckHeapObject(), in ReduceNamedAccess()
296 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), receiver); in ReduceNamedAccess()
297 Node* branch = graph()->NewNode(common()->Branch(), check, control); in ReduceNamedAccess()
298 control = graph()->NewNode(common()->IfFalse(), branch); in ReduceNamedAccess()
299 receiverissmi_control = graph()->NewNode(common()->IfTrue(), branch); in ReduceNamedAccess()
302 receiver = effect = graph()->NewNode(simplified()->CheckHeapObject(), in ReduceNamedAccess()
309 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), in ReduceNamedAccess()
338 graph()->NewNode(simplified()->ReferenceEqual(), receiver_map, in ReduceNamedAccess()
340 Node* branch = graph()->NewNode(common()->Branch(), check, in ReduceNamedAccess()
342 fallthrough_control = graph()->NewNode(common()->IfFalse(), branch); in ReduceNamedAccess()
344 graph()->NewNode(common()->IfTrue(), branch)); in ReduceNamedAccess()
366 graph()->NewNode(common()->Merge(this_control_count), in ReduceNamedAccess()
370 graph()->NewNode(common()->EffectPhi(this_control_count), in ReduceNamedAccess()
376 graph()->NewNode(common()->Checkpoint(), frame_state_eager, in ReduceNamedAccess()
402 control = graph()->NewNode(common()->Merge(control_count), control_count, in ReduceNamedAccess()
405 value = graph()->NewNode( in ReduceNamedAccess()
409 effect = graph()->NewNode(common()->EffectPhi(control_count), in ReduceNamedAccess()
538 receiver = effect = graph()->NewNode(simplified()->CheckString(), receiver, in ReduceElementAccess()
542 Node* length = effect = graph()->NewNode( in ReduceElementAccess()
547 index = effect = graph()->NewNode(simplified()->CheckBounds(), index, in ReduceElementAccess()
551 value = graph()->NewNode(simplified()->StringCharCodeAt(), receiver, index, in ReduceElementAccess()
555 value = graph()->NewNode(simplified()->StringFromCharCode(), value); in ReduceElementAccess()
612 receiver = effect = graph()->NewNode(simplified()->CheckHeapObject(), in ReduceElementAccess()
623 effect = graph()->NewNode( in ReduceElementAccess()
638 effect = graph()->NewNode(common()->Checkpoint(), frame_state, effect, in ReduceElementAccess()
673 this_effect = graph()->NewNode( in ReduceElementAccess()
687 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), in ReduceElementAccess()
703 graph()->NewNode(simplified()->ReferenceEqual(), receiver_map, in ReduceElementAccess()
705 Node* branch = graph()->NewNode(common()->Branch(), check, in ReduceElementAccess()
708 graph()->NewNode(common()->IfTrue(), branch)); in ReduceElementAccess()
710 fallthrough_control = graph()->NewNode(common()->IfFalse(), branch); in ReduceElementAccess()
720 graph()->NewNode(common()->Merge(this_control_count), in ReduceElementAccess()
724 graph()->NewNode(common()->EffectPhi(this_control_count), in ReduceElementAccess()
729 this_effect = graph()->NewNode(common()->Checkpoint(), frame_state, in ReduceElementAccess()
754 control = graph()->NewNode(common()->Merge(control_count), in ReduceElementAccess()
757 value = graph()->NewNode( in ReduceElementAccess()
761 effect = graph()->NewNode(common()->EffectPhi(control_count), in ReduceElementAccess()
806 index = effect = graph()->NewNode(simplified()->CheckBounds(), index, in ReduceKeyedAccess()
810 value = graph()->NewNode(simplified()->StringCharCodeAt(), receiver, in ReduceKeyedAccess()
814 value = graph()->NewNode(simplified()->StringFromCharCode(), value); in ReduceKeyedAccess()
897 graph()->NewNode(common()->Deoptimize(DeoptimizeKind::kSoft, reason), in ReduceSoftDeoptimize()
961 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), value, in BuildPropertyAccess()
964 graph()->NewNode(simplified()->CheckIf(), check, effect, control); in BuildPropertyAccess()
980 Node* frame_state0 = graph()->NewNode( in BuildPropertyAccess()
984 graph()->NewNode(common()->StateValues(1), receiver), in BuildPropertyAccess()
990 value = effect = graph()->NewNode( in BuildPropertyAccess()
995 control = graph()->NewNode(common()->IfSuccess(), value); in BuildPropertyAccess()
1017 Node* frame_state0 = graph()->NewNode( in BuildPropertyAccess()
1021 graph()->NewNode(common()->StateValues(2), receiver, value), in BuildPropertyAccess()
1027 effect = graph()->NewNode( in BuildPropertyAccess()
1032 control = graph()->NewNode(common()->IfSuccess(), effect); in BuildPropertyAccess()
1075 storage = effect = graph()->NewNode( in BuildPropertyAccess()
1097 graph()->NewNode(simplified()->LoadField(storage_access), storage, in BuildPropertyAccess()
1105 value = effect = graph()->NewNode(simplified()->LoadField(field_access), in BuildPropertyAccess()
1111 value = effect = graph()->NewNode(simplified()->CheckNumber(), value, in BuildPropertyAccess()
1117 effect = graph()->NewNode( in BuildPropertyAccess()
1120 Node* box = effect = graph()->NewNode( in BuildPropertyAccess()
1123 effect = graph()->NewNode( in BuildPropertyAccess()
1127 effect = graph()->NewNode( in BuildPropertyAccess()
1131 graph()->NewNode(common()->FinishRegion(), box, effect); in BuildPropertyAccess()
1145 graph()->NewNode(simplified()->LoadField(storage_access), in BuildPropertyAccess()
1155 value = effect = graph()->NewNode(simplified()->CheckSmi(), value, in BuildPropertyAccess()
1162 value = effect = graph()->NewNode(simplified()->CheckHeapObject(), in BuildPropertyAccess()
1167 effect = graph()->NewNode(simplified()->CheckMaps(1), value, in BuildPropertyAccess()
1189 effect = graph()->NewNode( in BuildPropertyAccess()
1191 effect = graph()->NewNode( in BuildPropertyAccess()
1195 effect = graph()->NewNode(simplified()->StoreField(field_access), storage, in BuildPropertyAccess()
1198 effect = graph()->NewNode(common()->FinishRegion(), in BuildPropertyAccess()
1222 graph()->NewNode(common()->Call(desc), arraysize(inputs), inputs); in BuildPropertyAccess()
1223 control = graph()->NewNode(common()->IfSuccess(), control); in BuildPropertyAccess()
1258 Node* elements = effect = graph()->NewNode( in BuildElementAccess()
1267 graph()->NewNode(simplified()->CheckMaps(1), elements, in BuildElementAccess()
1273 Node* length = effect = graph()->NewNode( in BuildElementAccess()
1278 Node* buffer = effect = graph()->NewNode( in BuildElementAccess()
1281 Node* check = effect = graph()->NewNode( in BuildElementAccess()
1285 length = graph()->NewNode( in BuildElementAccess()
1293 index = effect = graph()->NewNode(simplified()->CheckBounds(), index, in BuildElementAccess()
1299 index = effect = graph()->NewNode(simplified()->CheckBounds(), index, in BuildElementAccess()
1304 Node* base_pointer = effect = graph()->NewNode( in BuildElementAccess()
1308 Node* external_pointer = effect = graph()->NewNode( in BuildElementAccess()
1318 value = effect = graph()->NewNode( in BuildElementAccess()
1325 value = effect = graph()->NewNode(simplified()->CheckNumber(), value, in BuildElementAccess()
1333 value = graph()->NewNode(simplified()->NumberToUint8Clamped(), value); in BuildElementAccess()
1339 graph()->NewNode(simplified()->NumberLessThan(), index, length); in BuildElementAccess()
1340 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in BuildElementAccess()
1343 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in BuildElementAccess()
1347 etrue = graph()->NewNode( in BuildElementAccess()
1352 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in BuildElementAccess()
1358 control = graph()->NewNode(common()->Merge(2), if_true, if_false); in BuildElementAccess()
1360 graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control); in BuildElementAccess()
1364 effect = graph()->NewNode( in BuildElementAccess()
1378 ? graph()->NewNode( in BuildElementAccess()
1382 : graph()->NewNode( in BuildElementAccess()
1392 index = effect = graph()->NewNode(simplified()->CheckBounds(), index, in BuildElementAccess()
1397 index = effect = graph()->NewNode(simplified()->CheckBounds(), index, in BuildElementAccess()
1427 graph()->NewNode(simplified()->LoadElement(element_access), elements, in BuildElementAccess()
1436 value = graph()->NewNode(simplified()->ConvertTaggedHoleToUndefined(), in BuildElementAccess()
1440 value = effect = graph()->NewNode(simplified()->CheckTaggedHole(), in BuildElementAccess()
1451 value = effect = graph()->NewNode(simplified()->CheckFloat64Hole(mode), in BuildElementAccess()
1458 graph()->NewNode(simplified()->CheckSmi(), value, effect, control); in BuildElementAccess()
1460 value = effect = graph()->NewNode(simplified()->CheckNumber(), value, in BuildElementAccess()
1463 value = graph()->NewNode(simplified()->NumberSilenceNaN(), value); in BuildElementAccess()
1470 graph()->NewNode(simplified()->EnsureWritableFastElements(), in BuildElementAccess()
1487 elements = effect = graph()->NewNode( in BuildElementAccess()
1493 effect = graph()->NewNode(simplified()->StoreElement(element_access), in BuildElementAccess()
1528 graph()->NewNode(common()->ExternalConstant(ExternalReference( in InlineApiCall()
1554 graph()->NewNode(common()->Call(call_descriptor), in InlineApiCall()
1556 Node* control0 = graph()->NewNode(common()->IfSuccess(), value0); in InlineApiCall()
1584 return graph()->NewNode(simplified()->CheckMaps(map_input_count), input_count, in BuildCheckMaps()