Lines Matching refs:NewNode
294 Node* value = graph()->NewNode(simplified()->ToBoolean(), node); in ReduceJSInstanceOf()
465 graph()->NewNode(javascript()->CreatePromise(), context, effect); in ReduceJSPromiseResolve()
466 effect = graph()->NewNode(javascript()->ResolvePromise(), promise, value, in ReduceJSPromiseResolve()
516 graph()->NewNode(javascript()->FulfillPromise(), promise, resolution, in ReduceJSResolvePromise()
599 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), receiver, in ReduceGlobalAccess()
601 effect = graph()->NewNode( in ReduceGlobalAccess()
656 value = effect = graph()->NewNode( in ReduceGlobalAccess()
676 graph()->NewNode(simplified()->ReferenceEqual(), value, in ReduceGlobalAccess()
678 effect = graph()->NewNode( in ReduceGlobalAccess()
701 value = effect = graph()->NewNode(simplified()->CheckHeapObject(), in ReduceGlobalAccess()
706 graph()->NewNode(simplified()->CheckMaps( in ReduceGlobalAccess()
714 value = effect = graph()->NewNode( in ReduceGlobalAccess()
719 effect = graph()->NewNode(simplified()->StoreField(ForPropertyCellValue( in ReduceGlobalAccess()
731 effect = graph()->NewNode( in ReduceGlobalAccess()
760 Node* value = effect = graph()->NewNode( in ReduceJSLoadGlobal()
789 effect = graph()->NewNode(javascript()->StoreContext(0, result->index), in ReduceJSStoreGlobal()
876 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), receiver); in ReduceNamedAccess()
877 Node* branch = graph()->NewNode(common()->Branch(), check, control); in ReduceNamedAccess()
879 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceNamedAccess()
882 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceNamedAccess()
889 control = graph()->NewNode(common()->Merge(2), if_true, if_false); in ReduceNamedAccess()
891 graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control); in ReduceNamedAccess()
927 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), receiver); in ReduceNamedAccess()
928 Node* branch = graph()->NewNode(common()->Branch(), check, control); in ReduceNamedAccess()
929 control = graph()->NewNode(common()->IfFalse(), branch); in ReduceNamedAccess()
930 receiverissmi_control = graph()->NewNode(common()->IfTrue(), branch); in ReduceNamedAccess()
972 graph()->NewNode(simplified()->CompareMaps(maps), receiver, in ReduceNamedAccess()
975 graph()->NewNode(common()->Branch(), check, this_control); in ReduceNamedAccess()
976 fallthrough_control = graph()->NewNode(common()->IfFalse(), branch); in ReduceNamedAccess()
977 this_control = graph()->NewNode(common()->IfTrue(), branch); in ReduceNamedAccess()
985 this_control = graph()->NewNode(common()->Merge(2), this_control, in ReduceNamedAccess()
987 this_effect = graph()->NewNode(common()->EffectPhi(2), this_effect, in ReduceNamedAccess()
1002 this_effect = graph()->NewNode(simplified()->MapGuard(maps), receiver, in ReduceNamedAccess()
1027 control = graph()->NewNode(common()->Merge(control_count), control_count, in ReduceNamedAccess()
1030 value = graph()->NewNode( in ReduceNamedAccess()
1034 effect = graph()->NewNode(common()->EffectPhi(control_count), in ReduceNamedAccess()
1044 Node* merge = graph()->NewNode(common()->Merge(if_exception_count), in ReduceNamedAccess()
1048 graph()->NewNode(common()->EffectPhi(if_exception_count), in ReduceNamedAccess()
1050 Node* phi = graph()->NewNode( in ReduceNamedAccess()
1183 receiver = effect = graph()->NewNode( in ReduceElementAccess()
1187 Node* length = graph()->NewNode(simplified()->StringLength(), receiver); in ReduceElementAccess()
1263 effect = graph()->NewNode( in ReduceElementAccess()
1278 effect = graph()->NewNode(common()->Checkpoint(), frame_state, effect, in ReduceElementAccess()
1313 this_effect = graph()->NewNode( in ReduceElementAccess()
1339 graph()->NewNode(simplified()->CompareMaps(maps), receiver, in ReduceElementAccess()
1342 graph()->NewNode(common()->Branch(), check, fallthrough_control); in ReduceElementAccess()
1343 fallthrough_control = graph()->NewNode(common()->IfFalse(), branch); in ReduceElementAccess()
1344 this_control = graph()->NewNode(common()->IfTrue(), branch); in ReduceElementAccess()
1347 this_effect = graph()->NewNode(simplified()->MapGuard(maps), receiver, in ReduceElementAccess()
1371 control = graph()->NewNode(common()->Merge(control_count), in ReduceElementAccess()
1374 value = graph()->NewNode( in ReduceElementAccess()
1378 effect = graph()->NewNode(common()->EffectPhi(control_count), in ReduceElementAccess()
1434 Node* elements = effect = graph()->NewNode( in ReduceKeyedAccess()
1440 graph()->NewNode(simplified()->ReferenceEqual(), elements, in ReduceKeyedAccess()
1442 effect = graph()->NewNode( in ReduceKeyedAccess()
1538 Node* deoptimize = graph()->NewNode( in ReduceSoftDeoptimize()
1612 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), in ReduceJSLoadProperty()
1614 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), in ReduceJSLoadProperty()
1616 effect = graph()->NewNode( in ReduceJSLoadProperty()
1622 Node* descriptor_array = effect = graph()->NewNode( in ReduceJSLoadProperty()
1626 graph()->NewNode(simplified()->LoadField( in ReduceJSLoadProperty()
1629 Node* enum_indices = effect = graph()->NewNode( in ReduceJSLoadProperty()
1634 Node* check = graph()->NewNode( in ReduceJSLoadProperty()
1636 graph()->NewNode(simplified()->ReferenceEqual(), enum_indices, in ReduceJSLoadProperty()
1638 effect = graph()->NewNode( in ReduceJSLoadProperty()
1643 index = effect = graph()->NewNode( in ReduceJSLoadProperty()
1649 Node* value = effect = graph()->NewNode( in ReduceJSLoadProperty()
1698 value = *effect = *control = graph()->NewNode( in InlinePropertyGetterCall()
1718 graph()->NewNode(common()->IfException(), *control, *effect); in InlinePropertyGetterCall()
1719 Node* const if_success = graph()->NewNode(common()->IfSuccess(), *control); in InlinePropertyGetterCall()
1736 *effect = *control = graph()->NewNode( in InlinePropertySetterCall()
1756 graph()->NewNode(common()->IfException(), *control, *effect); in InlinePropertySetterCall()
1757 Node* const if_success = graph()->NewNode(common()->IfSuccess(), *control); in InlinePropertySetterCall()
1786 graph()->NewNode(common()->ExternalConstant(ExternalReference::Create( in InlineApiCall()
1805 graph()->NewNode(common()->Call(call_descriptor), index, inputs); in InlineApiCall()
1836 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForCellValue()), in BuildPropertyLoad()
1889 graph()->NewNode(simplified()->ReferenceEqual(), value, constant_value); in BuildPropertyStore()
1891 graph()->NewNode(simplified()->CheckIf(DeoptimizeReason::kWrongValue), in BuildPropertyStore()
1905 storage = effect = graph()->NewNode( in BuildPropertyStore()
1926 graph()->NewNode(simplified()->CheckNumber(VectorSlotPair()), value, in BuildPropertyStore()
1952 graph()->NewNode(simplified()->LoadField(storage_access), in BuildPropertyStore()
1963 Node* current_value = effect = graph()->NewNode( in BuildPropertyStore()
1966 Node* check = graph()->NewNode(simplified()->NumberEqual(), in BuildPropertyStore()
1968 effect = graph()->NewNode( in BuildPropertyStore()
1982 Node* current_value = effect = graph()->NewNode( in BuildPropertyStore()
1985 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), in BuildPropertyStore()
1987 effect = graph()->NewNode( in BuildPropertyStore()
1994 value = effect = graph()->NewNode( in BuildPropertyStore()
2005 effect = graph()->NewNode( in BuildPropertyStore()
2042 effect = graph()->NewNode(simplified()->StoreField(field_access), in BuildPropertyStore()
2050 effect = graph()->NewNode( in BuildPropertyStore()
2052 effect = graph()->NewNode( in BuildPropertyStore()
2055 effect = graph()->NewNode(simplified()->StoreField(field_access), storage, in BuildPropertyStore()
2057 effect = graph()->NewNode(common()->FinishRegion(), in BuildPropertyStore()
2061 effect = graph()->NewNode(simplified()->StoreField(field_access), storage, in BuildPropertyStore()
2124 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), name, in ReduceJSStoreDataPropertyInLiteral()
2126 effect = graph()->NewNode(simplified()->CheckIf(DeoptimizeReason::kWrongName), in ReduceJSStoreDataPropertyInLiteral()
2259 length = effect = graph()->NewNode( in BuildElementAccess()
2264 buffer = effect = graph()->NewNode( in BuildElementAccess()
2269 Node* elements = effect = graph()->NewNode( in BuildElementAccess()
2281 base_pointer = effect = graph()->NewNode( in BuildElementAccess()
2288 external_pointer = effect = graph()->NewNode( in BuildElementAccess()
2302 Node* check = effect = graph()->NewNode( in BuildElementAccess()
2304 length = graph()->NewNode( in BuildElementAccess()
2314 index = effect = graph()->NewNode( in BuildElementAccess()
2320 index = graph()->NewNode(simplified()->NumberToUint32(), index); in BuildElementAccess()
2324 graph()->NewNode(simplified()->CheckBounds(VectorSlotPair()), index, in BuildElementAccess()
2336 graph()->NewNode(simplified()->NumberLessThan(), index, length); in BuildElementAccess()
2337 Node* branch = graph()->NewNode( in BuildElementAccess()
2342 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in BuildElementAccess()
2347 vtrue = etrue = graph()->NewNode( in BuildElementAccess()
2352 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in BuildElementAccess()
2360 control = graph()->NewNode(common()->Merge(2), if_true, if_false); in BuildElementAccess()
2362 graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control); in BuildElementAccess()
2364 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in BuildElementAccess()
2368 value = effect = graph()->NewNode( in BuildElementAccess()
2380 value = effect = graph()->NewNode( in BuildElementAccess()
2390 value = graph()->NewNode(simplified()->NumberToUint8Clamped(), value); in BuildElementAccess()
2396 graph()->NewNode(simplified()->NumberLessThan(), index, length); in BuildElementAccess()
2397 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in BuildElementAccess()
2400 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in BuildElementAccess()
2404 etrue = graph()->NewNode( in BuildElementAccess()
2409 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in BuildElementAccess()
2415 control = graph()->NewNode(common()->Merge(2), if_true, if_false); in BuildElementAccess()
2417 graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control); in BuildElementAccess()
2420 effect = graph()->NewNode( in BuildElementAccess()
2429 Node* elements = effect = graph()->NewNode( in BuildElementAccess()
2438 effect = graph()->NewNode( in BuildElementAccess()
2451 ? graph()->NewNode( in BuildElementAccess()
2455 : graph()->NewNode( in BuildElementAccess()
2469 index = effect = graph()->NewNode( in BuildElementAccess()
2475 graph()->NewNode(simplified()->CheckBounds(VectorSlotPair()), index, in BuildElementAccess()
2511 graph()->NewNode(simplified()->NumberLessThan(), index, length); in BuildElementAccess()
2512 Node* branch = graph()->NewNode( in BuildElementAccess()
2517 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in BuildElementAccess()
2523 graph()->NewNode(simplified()->LoadElement(element_access), in BuildElementAccess()
2532 vtrue = graph()->NewNode( in BuildElementAccess()
2537 vtrue = etrue = graph()->NewNode( in BuildElementAccess()
2544 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in BuildElementAccess()
2552 control = graph()->NewNode(common()->Merge(2), if_true, if_false); in BuildElementAccess()
2554 graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control); in BuildElementAccess()
2556 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in BuildElementAccess()
2561 graph()->NewNode(simplified()->LoadElement(element_access), in BuildElementAccess()
2571 value = graph()->NewNode( in BuildElementAccess()
2575 value = effect = graph()->NewNode( in BuildElementAccess()
2587 value = effect = graph()->NewNode( in BuildElementAccess()
2596 value = effect = graph()->NewNode( in BuildElementAccess()
2600 graph()->NewNode(simplified()->CheckNumber(VectorSlotPair()), value, in BuildElementAccess()
2603 value = graph()->NewNode(simplified()->NumberSilenceNaN(), value); in BuildElementAccess()
2610 graph()->NewNode(simplified()->EnsureWritableFastElements(), in BuildElementAccess()
2614 Node* elements_length = effect = graph()->NewNode( in BuildElementAccess()
2630 ? graph()->NewNode(simplified()->NumberAdd(), elements_length, in BuildElementAccess()
2632 : graph()->NewNode(simplified()->NumberAdd(), length, in BuildElementAccess()
2635 graph()->NewNode(simplified()->CheckBounds(VectorSlotPair()), index, in BuildElementAccess()
2643 elements = effect = graph()->NewNode( in BuildElementAccess()
2652 graph()->NewNode(simplified()->EnsureWritableFastElements(), in BuildElementAccess()
2659 graph()->NewNode(simplified()->NumberLessThan(), index, length); in BuildElementAccess()
2660 Node* branch = graph()->NewNode(common()->Branch(), check, control); in BuildElementAccess()
2662 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in BuildElementAccess()
2669 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in BuildElementAccess()
2674 Node* new_length = graph()->NewNode( in BuildElementAccess()
2676 efalse = graph()->NewNode( in BuildElementAccess()
2682 control = graph()->NewNode(common()->Merge(2), if_true, if_false); in BuildElementAccess()
2684 graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control); in BuildElementAccess()
2689 effect = graph()->NewNode(simplified()->StoreElement(element_access), in BuildElementAccess()
2706 index = *effect = graph()->NewNode( in BuildIndexedStringLoad()
2713 graph()->NewNode(simplified()->NumberLessThan(), index, length); in BuildIndexedStringLoad()
2715 graph()->NewNode(common()->Branch(BranchHint::kTrue, in BuildIndexedStringLoad()
2719 Node* masked_index = graph()->NewNode(simplified()->PoisonIndex(), index); in BuildIndexedStringLoad()
2721 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in BuildIndexedStringLoad()
2724 graph()->NewNode(simplified()->StringCharCodeAt(), receiver, in BuildIndexedStringLoad()
2726 vtrue = graph()->NewNode(simplified()->StringFromSingleCharCode(), vtrue); in BuildIndexedStringLoad()
2728 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in BuildIndexedStringLoad()
2731 *control = graph()->NewNode(common()->Merge(2), if_true, if_false); in BuildIndexedStringLoad()
2733 graph()->NewNode(common()->EffectPhi(2), etrue, *effect, *control); in BuildIndexedStringLoad()
2734 return graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in BuildIndexedStringLoad()
2739 graph()->NewNode(simplified()->CheckBounds(VectorSlotPair()), index, in BuildIndexedStringLoad()
2742 Node* masked_index = graph()->NewNode(simplified()->PoisonIndex(), index); in BuildIndexedStringLoad()
2746 graph()->NewNode(simplified()->StringCharCodeAt(), receiver, in BuildIndexedStringLoad()
2748 value = graph()->NewNode(simplified()->StringFromSingleCharCode(), value); in BuildIndexedStringLoad()
2772 Node* value = effect = graph()->NewNode( in BuildExtendPropertiesBackingStore()
2785 hash = graph()->NewNode( in BuildExtendPropertiesBackingStore()
2787 graph()->NewNode(simplified()->ObjectIsSmi(), properties), properties, in BuildExtendPropertiesBackingStore()
2789 hash = effect = graph()->NewNode(common()->TypeGuard(Type::SignedSmall()), in BuildExtendPropertiesBackingStore()
2792 graph()->NewNode(simplified()->NumberShiftLeft(), hash, in BuildExtendPropertiesBackingStore()
2795 hash = effect = graph()->NewNode( in BuildExtendPropertiesBackingStore()
2799 graph()->NewNode(simplified()->NumberBitwiseAnd(), hash, in BuildExtendPropertiesBackingStore()
2802 Node* new_length_and_hash = graph()->NewNode( in BuildExtendPropertiesBackingStore()
2806 graph()->NewNode(common()->TypeGuard(Type::SignedSmall()), in BuildExtendPropertiesBackingStore()
2829 return graph()->NewNode(op, jsgraph()->HeapConstant(name), value, effect, in BuildCheckEqualsName()