Lines Matching refs:TNode
18 using TNode = compiler::TNode<T>; typedef
34 void AddConstructorEntry(Variant variant, TNode<Context> context,
35 TNode<Object> collection, TNode<Object> add_function,
36 TNode<Object> key_value,
43 void AddConstructorEntries(Variant variant, TNode<Context> context,
44 TNode<Context> native_context,
45 TNode<Object> collection,
46 TNode<Object> initial_entries);
51 TNode<Context> context,
52 TNode<Context> native_context,
53 TNode<Object> collection,
54 TNode<JSArray> fast_jsarray,
59 TNode<Context> context,
60 TNode<Context> native_context,
61 TNode<Object> collection,
62 TNode<Object> iterable);
65 TNode<Object> AllocateJSCollection(TNode<Context> context,
66 TNode<JSFunction> constructor,
67 TNode<Object> new_target);
71 TNode<Object> AllocateJSCollectionFast(TNode<HeapObject> constructor);
75 TNode<Object> AllocateJSCollectionSlow(TNode<Context> context,
76 TNode<JSFunction> constructor,
77 TNode<Object> new_target);
80 virtual TNode<Object> AllocateTable(Variant variant, TNode<Context> context,
81 TNode<IntPtrT> at_least_space_for) = 0;
86 TNode<Object> new_target, TNode<IntPtrT> argc,
87 TNode<Context> context);
91 TNode<Object> GetAddFunction(Variant variant, TNode<Context> context,
92 TNode<Object> collection);
95 TNode<JSFunction> GetConstructor(Variant variant,
96 TNode<Context> native_context);
101 TNode<JSFunction> GetInitialAddFunction(Variant variant,
102 TNode<Context> native_context);
110 TNode<IntPtrT> EstimatedInitialSize(TNode<Object> initial_entries,
111 TNode<BoolT> is_fast_jsarray);
116 TNode<BoolT> HasInitialCollectionPrototype(Variant variant,
117 TNode<Context> native_context,
118 TNode<Object> collection);
122 TNode<Object> LoadAndNormalizeFixedArrayElement(TNode<FixedArray> elements,
123 TNode<IntPtrT> index);
127 TNode<Object> LoadAndNormalizeFixedDoubleArrayElement(
128 TNode<HeapObject> elements, TNode<IntPtrT> index);
132 void LoadKeyValue(TNode<Context> context, TNode<Object> maybe_array,
140 Variant variant, TNode<Context> context, TNode<Object> collection, in AddConstructorEntry()
141 TNode<Object> add_function, TNode<Object> key_value, in AddConstructorEntry()
164 Variant variant, TNode<Context> context, TNode<Context> native_context, in AddConstructorEntries()
165 TNode<Object> collection, TNode<Object> initial_entries) { in AddConstructorEntries()
168 TNode<IntPtrT> at_least_space_for = in AddConstructorEntries()
175 TNode<Object> table = AllocateTable(variant, context, at_least_space_for); in AddConstructorEntries()
185 TNode<JSArray> initial_entries_jsarray = in AddConstructorEntries()
190 TNode<Map> original_initial_entries_map = LoadMap(initial_entries_jsarray); in AddConstructorEntries()
221 Variant variant, TNode<Context> context, TNode<Context> native_context, in AddConstructorEntriesFromFastJSArray()
222 TNode<Object> collection, TNode<JSArray> fast_jsarray, in AddConstructorEntriesFromFastJSArray()
224 TNode<FixedArrayBase> elements = LoadElements(fast_jsarray); in AddConstructorEntriesFromFastJSArray()
225 TNode<Int32T> elements_kind = LoadElementsKind(fast_jsarray); in AddConstructorEntriesFromFastJSArray()
226 TNode<JSFunction> add_func = GetInitialAddFunction(variant, native_context); in AddConstructorEntriesFromFastJSArray()
231 TNode<IntPtrT> length = SmiUntag(LoadFastJSArrayLength(fast_jsarray)); in AddConstructorEntriesFromFastJSArray()
237 TNode<Map> original_collection_map = LoadMap(CAST(collection)); in AddConstructorEntriesFromFastJSArray()
238 TNode<Map> original_fast_js_array_map = LoadMap(fast_jsarray); in AddConstructorEntriesFromFastJSArray()
247 TNode<Object> element = LoadAndNormalizeFixedArrayElement( in AddConstructorEntriesFromFastJSArray()
267 TNode<Object> element = in AddConstructorEntriesFromFastJSArray()
274 TNode<Object> entry = LoadAndNormalizeFixedDoubleArrayElement( in AddConstructorEntriesFromFastJSArray()
293 Variant variant, TNode<Context> context, TNode<Context> native_context, in AddConstructorEntriesFromIterable()
294 TNode<Object> collection, TNode<Object> iterable) { in AddConstructorEntriesFromIterable()
298 TNode<Object> add_func = GetAddFunction(variant, context, collection); in AddConstructorEntriesFromIterable()
304 TNode<Object> fast_iterator_result_map = in AddConstructorEntriesFromIterable()
311 TNode<Object> next = CAST(iterator_assembler.IteratorStep( in AddConstructorEntriesFromIterable()
313 TNode<Object> next_value = CAST(iterator_assembler.IteratorValue( in AddConstructorEntriesFromIterable()
327 TNode<Object> BaseCollectionsAssembler::AllocateJSCollection( in AllocateJSCollection()
328 TNode<Context> context, TNode<JSFunction> constructor, in AllocateJSCollection()
329 TNode<Object> new_target) { in AllocateJSCollection()
330 TNode<BoolT> is_target_unmodified = WordEqual(constructor, new_target); in AllocateJSCollection()
340 TNode<Object> BaseCollectionsAssembler::AllocateJSCollectionFast( in AllocateJSCollectionFast()
341 TNode<HeapObject> constructor) { in AllocateJSCollectionFast()
343 TNode<Object> initial_map = in AllocateJSCollectionFast()
348 TNode<Object> BaseCollectionsAssembler::AllocateJSCollectionSlow( in AllocateJSCollectionSlow()
349 TNode<Context> context, TNode<JSFunction> constructor, in AllocateJSCollectionSlow()
350 TNode<Object> new_target) { in AllocateJSCollectionSlow()
358 TNode<Object> new_target, TNode<IntPtrT> argc, TNode<Context> context) { in GenerateConstructor()
361 TNode<Object> iterable = args.GetOptionalArgumentValue(kIterableArg); in GenerateConstructor()
366 TNode<Context> native_context = LoadNativeContext(context); in GenerateConstructor()
367 TNode<Object> collection = AllocateJSCollection( in GenerateConstructor()
378 TNode<Object> BaseCollectionsAssembler::GetAddFunction( in GetAddFunction()
379 Variant variant, TNode<Context> context, TNode<Object> collection) { in GetAddFunction()
383 TNode<Object> add_func = GetProperty(context, collection, add_func_name); in GetAddFunction()
398 TNode<JSFunction> BaseCollectionsAssembler::GetConstructor( in GetConstructor()
399 Variant variant, TNode<Context> native_context) { in GetConstructor()
418 TNode<JSFunction> BaseCollectionsAssembler::GetInitialAddFunction( in GetInitialAddFunction()
419 Variant variant, TNode<Context> native_context) { in GetInitialAddFunction()
452 TNode<IntPtrT> BaseCollectionsAssembler::EstimatedInitialSize( in EstimatedInitialSize()
453 TNode<Object> initial_entries, TNode<BoolT> is_fast_jsarray) { in EstimatedInitialSize()
466 TNode<BoolT> BaseCollectionsAssembler::HasInitialCollectionPrototype( in HasInitialCollectionPrototype()
467 Variant variant, TNode<Context> native_context, TNode<Object> collection) { in HasInitialCollectionPrototype()
483 TNode<Map> initial_prototype_map = in HasInitialCollectionPrototype()
485 TNode<Map> collection_proto_map = in HasInitialCollectionPrototype()
491 TNode<Object> BaseCollectionsAssembler::LoadAndNormalizeFixedArrayElement( in LoadAndNormalizeFixedArrayElement()
492 TNode<FixedArray> elements, TNode<IntPtrT> index) { in LoadAndNormalizeFixedArrayElement()
493 TNode<Object> element = LoadFixedArrayElement(elements, index); in LoadAndNormalizeFixedArrayElement()
498 TNode<Object> BaseCollectionsAssembler::LoadAndNormalizeFixedDoubleArrayElement( in LoadAndNormalizeFixedDoubleArrayElement()
499 TNode<HeapObject> elements, TNode<IntPtrT> index) { in LoadAndNormalizeFixedDoubleArrayElement()
502 TNode<Float64T> element = in LoadAndNormalizeFixedDoubleArrayElement()
519 TNode<Context> context, TNode<Object> maybe_array, TVariable<Object>* key, in LoadKeyValue()
528 TNode<JSArray> array = CAST(maybe_array); in LoadKeyValue()
529 TNode<Smi> length = LoadFastJSArrayLength(array); in LoadKeyValue()
530 TNode<FixedArrayBase> elements = LoadElements(array); in LoadKeyValue()
531 TNode<Int32T> elements_kind = LoadElementsKind(array); in LoadKeyValue()
555 TNode<FixedArray> elements_fixed_array = CAST(elements); in LoadKeyValue()
630 TNode<Object> AllocateTable(Variant variant, TNode<Context> context,
631 TNode<IntPtrT> at_least_space_for);
641 std::pair<TNode<TableType>, TNode<IntPtrT>> Transition(
642 TNode<TableType> const table, TNode<IntPtrT> const index,
645 std::pair<TNode<TableType>, TNode<IntPtrT>> TransitionAndUpdate(
646 TNode<IteratorType> const iterator);
648 std::tuple<TNode<Object>, TNode<IntPtrT>, TNode<IntPtrT>> NextSkipHoles(
649 TNode<TableType> table, TNode<IntPtrT> index, Label* if_end);
714 void StoreOrderedHashMapNewEntry(TNode<OrderedHashMap> const table,
719 void StoreOrderedHashSetNewEntry(TNode<OrderedHashSet> const table,
743 TNode<Object> CollectionsBuiltinsAssembler::AllocateTable( in AllocateTable()
744 Variant variant, TNode<Context> context, in AllocateTable()
745 TNode<IntPtrT> at_least_space_for) { in AllocateTable()
752 TNode<Object> new_target = CAST(Parameter(Descriptor::kJSNewTarget)); in TF_BUILTIN()
753 TNode<IntPtrT> argc = in TF_BUILTIN()
755 TNode<Context> context = CAST(Parameter(Descriptor::kContext)); in TF_BUILTIN()
762 TNode<Object> new_target = CAST(Parameter(Descriptor::kJSNewTarget)); in TF_BUILTIN()
763 TNode<IntPtrT> argc = in TF_BUILTIN()
765 TNode<Context> context = CAST(Parameter(Descriptor::kContext)); in TF_BUILTIN()
1004 TNode<HeapObject> table = CAST(Parameter(Descriptor::kTable)); in TF_BUILTIN()
1005 TNode<Smi> index = CAST(Parameter(Descriptor::kIndex)); in TF_BUILTIN()
1026 TNode<Smi> removed_index = CAST(LoadFixedArrayElement( in TF_BUILTIN()
1043 std::pair<TNode<TableType>, TNode<IntPtrT>>
1045 TNode<TableType> const table, TNode<IntPtrT> const index, in Transition()
1060 TNode<TableType> table = var_table.value(); in Transition()
1061 TNode<IntPtrT> index = var_index.value(); in Transition()
1063 TNode<Object> next_table = in Transition()
1085 std::pair<TNode<TableType>, TNode<IntPtrT>>
1087 TNode<IteratorType> const iterator) { in TransitionAndUpdate()
1100 std::tuple<TNode<Object>, TNode<IntPtrT>, TNode<IntPtrT>>
1101 CollectionsBuiltinsAssembler::NextSkipHoles(TNode<TableType> table, in NextSkipHoles()
1102 TNode<IntPtrT> index, in NextSkipHoles()
1105 TNode<IntPtrT> number_of_buckets = in NextSkipHoles()
1107 TNode<IntPtrT> number_of_elements = in NextSkipHoles()
1109 TNode<IntPtrT> number_of_deleted_elements = in NextSkipHoles()
1111 TNode<IntPtrT> used_capacity = in NextSkipHoles()
1114 TNode<Object> entry_key; in NextSkipHoles()
1115 TNode<IntPtrT> entry_start_position; in NextSkipHoles()
1133 return std::tuple<TNode<Object>, TNode<IntPtrT>, TNode<IntPtrT>>{ in NextSkipHoles()
1145 TNode<Smi> index = CAST( in TF_BUILTIN()
1170 TNode<Smi> index = CAST( in TF_BUILTIN()
1211 TNode<OrderedHashMap> const table = in TF_BUILTIN()
1283 TNode<OrderedHashMap> const table, Node* const key, Node* const value, in StoreOrderedHashMapNewEntry()
1308 TNode<Smi> const number_of_elements = in StoreOrderedHashMapNewEntry()
1322 TNode<OrderedHashMap> const table = in TF_BUILTIN()
1347 TNode<Smi> const number_of_elements = SmiSub( in TF_BUILTIN()
1352 TNode<Smi> const number_of_deleted = in TF_BUILTIN()
1359 TNode<Smi> const number_of_buckets = in TF_BUILTIN()
1383 TNode<OrderedHashSet> const table = in TF_BUILTIN()
1451 TNode<OrderedHashSet> const table, Node* const key, Node* const hash, in StoreOrderedHashSetNewEntry()
1473 TNode<Smi> const number_of_elements = in StoreOrderedHashSetNewEntry()
1487 TNode<OrderedHashSet> const table = in TF_BUILTIN()
1508 TNode<Smi> const number_of_elements = SmiSub( in TF_BUILTIN()
1513 TNode<Smi> const number_of_deleted = in TF_BUILTIN()
1520 TNode<Smi> const number_of_buckets = in TF_BUILTIN()
1578 TNode<IntPtrT> index = var_index.value(); in TF_BUILTIN()
1579 TNode<OrderedHashMap> table = var_table.value(); in TF_BUILTIN()
1584 TNode<Object> entry_key; in TF_BUILTIN()
1585 TNode<IntPtrT> entry_start_position; in TF_BUILTIN()
1661 TNode<OrderedHashMap> table; in TF_BUILTIN()
1662 TNode<IntPtrT> index; in TF_BUILTIN()
1667 TNode<Object> entry_key; in TF_BUILTIN()
1668 TNode<IntPtrT> entry_start_position; in TF_BUILTIN()
1809 TNode<IntPtrT> index = var_index.value(); in TF_BUILTIN()
1810 TNode<OrderedHashSet> table = var_table.value(); in TF_BUILTIN()
1875 TNode<OrderedHashSet> table; in TF_BUILTIN()
1876 TNode<IntPtrT> index; in TF_BUILTIN()
1985 void AddEntry(TNode<EphemeronHashTable> table, TNode<IntPtrT> key_index,
1986 TNode<Object> key, TNode<Object> value,
1987 TNode<IntPtrT> number_of_elements);
1989 TNode<Object> AllocateTable(Variant variant, TNode<Context> context,
1990 TNode<IntPtrT> at_least_space_for);
1993 TNode<Smi> CreateIdentityHash(TNode<Object> receiver);
1994 TNode<IntPtrT> EntryMask(TNode<IntPtrT> capacity);
1999 typedef std::function<void(TNode<Object> entry_key, Label* if_same)>
2001 TNode<IntPtrT> FindKeyIndex(TNode<HeapObject> table, TNode<IntPtrT> key_hash,
2002 TNode<IntPtrT> entry_mask,
2007 TNode<IntPtrT> FindKeyIndexForInsertion(TNode<HeapObject> table,
2008 TNode<IntPtrT> key_hash,
2009 TNode<IntPtrT> entry_mask);
2014 TNode<IntPtrT> FindKeyIndexForKey(TNode<HeapObject> table, TNode<Object> key,
2015 TNode<IntPtrT> hash,
2016 TNode<IntPtrT> entry_mask,
2019 TNode<Word32T> InsufficientCapacityToAdd(TNode<IntPtrT> capacity,
2020 TNode<IntPtrT> number_of_elements,
2021 TNode<IntPtrT> number_of_deleted);
2022 TNode<IntPtrT> KeyIndexFromEntry(TNode<IntPtrT> entry);
2024 TNode<IntPtrT> LoadNumberOfElements(TNode<EphemeronHashTable> table,
2026 TNode<IntPtrT> LoadNumberOfDeleted(TNode<EphemeronHashTable> table,
2028 TNode<EphemeronHashTable> LoadTable(TNode<JSWeakCollection> collection);
2029 TNode<IntPtrT> LoadTableCapacity(TNode<EphemeronHashTable> table);
2031 void RemoveEntry(TNode<EphemeronHashTable> table, TNode<IntPtrT> key_index,
2032 TNode<IntPtrT> number_of_elements);
2033 TNode<BoolT> ShouldRehash(TNode<IntPtrT> number_of_elements,
2034 TNode<IntPtrT> number_of_deleted);
2035 TNode<Word32T> ShouldShrink(TNode<IntPtrT> capacity,
2036 TNode<IntPtrT> number_of_elements);
2037 TNode<IntPtrT> ValueIndexFromKeyIndex(TNode<IntPtrT> key_index);
2041 TNode<EphemeronHashTable> table, TNode<IntPtrT> key_index, in AddEntry()
2042 TNode<Object> key, TNode<Object> value, TNode<IntPtrT> number_of_elements) { in AddEntry()
2044 TNode<IntPtrT> value_index = ValueIndexFromKeyIndex(key_index); in AddEntry()
2053 TNode<Object> WeakCollectionsBuiltinsAssembler::AllocateTable( in AllocateTable()
2054 Variant variant, TNode<Context> context, in AllocateTable()
2055 TNode<IntPtrT> at_least_space_for) { in AllocateTable()
2059 TNode<IntPtrT> capacity = HashTableComputeCapacity(at_least_space_for); in AllocateTable()
2062 TNode<IntPtrT> length = KeyIndexFromEntry(capacity); in AllocateTable()
2063 TNode<FixedArray> table = CAST( in AllocateTable()
2077 TNode<IntPtrT> start = KeyIndexFromEntry(IntPtrConstant(0)); in AllocateTable()
2083 TNode<Smi> WeakCollectionsBuiltinsAssembler::CreateIdentityHash( in CreateIdentityHash()
2084 TNode<Object> key) { in CreateIdentityHash()
2085 TNode<ExternalReference> function_addr = ExternalConstant( in CreateIdentityHash()
2087 TNode<ExternalReference> isolate_ptr = in CreateIdentityHash()
2097 TNode<IntPtrT> WeakCollectionsBuiltinsAssembler::EntryMask( in EntryMask()
2098 TNode<IntPtrT> capacity) { in EntryMask()
2102 TNode<IntPtrT> WeakCollectionsBuiltinsAssembler::FindKeyIndex( in FindKeyIndex()
2103 TNode<HeapObject> table, TNode<IntPtrT> key_hash, TNode<IntPtrT> entry_mask, in FindKeyIndex()
2113 TNode<IntPtrT> key_index; in FindKeyIndex()
2116 TNode<Object> entry_key = LoadFixedArrayElement(CAST(table), key_index); in FindKeyIndex()
2131 TNode<IntPtrT> WeakCollectionsBuiltinsAssembler::FindKeyIndexForInsertion( in FindKeyIndexForInsertion()
2132 TNode<HeapObject> table, TNode<IntPtrT> key_hash, in FindKeyIndexForInsertion()
2133 TNode<IntPtrT> entry_mask) { in FindKeyIndexForInsertion()
2135 auto is_not_live = [&](TNode<Object> entry_key, Label* if_found) { in FindKeyIndexForInsertion()
2142 TNode<IntPtrT> WeakCollectionsBuiltinsAssembler::FindKeyIndexForKey( in FindKeyIndexForKey()
2143 TNode<HeapObject> table, TNode<Object> key, TNode<IntPtrT> hash, in FindKeyIndexForKey()
2144 TNode<IntPtrT> entry_mask, Label* if_not_found) { in FindKeyIndexForKey()
2146 auto match_key_or_exit_on_empty = [&](TNode<Object> entry_key, in FindKeyIndexForKey()
2154 TNode<IntPtrT> WeakCollectionsBuiltinsAssembler::KeyIndexFromEntry( in KeyIndexFromEntry()
2155 TNode<IntPtrT> entry) { in KeyIndexFromEntry()
2164 TNode<IntPtrT> WeakCollectionsBuiltinsAssembler::LoadNumberOfElements( in LoadNumberOfElements()
2165 TNode<EphemeronHashTable> table, int offset) { in LoadNumberOfElements()
2166 TNode<IntPtrT> number_of_elements = SmiUntag(CAST(LoadFixedArrayElement( in LoadNumberOfElements()
2171 TNode<IntPtrT> WeakCollectionsBuiltinsAssembler::LoadNumberOfDeleted( in LoadNumberOfDeleted()
2172 TNode<EphemeronHashTable> table, int offset) { in LoadNumberOfDeleted()
2173 TNode<IntPtrT> number_of_deleted = SmiUntag(CAST(LoadFixedArrayElement( in LoadNumberOfDeleted()
2178 TNode<EphemeronHashTable> WeakCollectionsBuiltinsAssembler::LoadTable( in LoadTable()
2179 TNode<JSWeakCollection> collection) { in LoadTable()
2183 TNode<IntPtrT> WeakCollectionsBuiltinsAssembler::LoadTableCapacity( in LoadTableCapacity()
2184 TNode<EphemeronHashTable> table) { in LoadTableCapacity()
2189 TNode<Word32T> WeakCollectionsBuiltinsAssembler::InsufficientCapacityToAdd( in InsufficientCapacityToAdd()
2190 TNode<IntPtrT> capacity, TNode<IntPtrT> number_of_elements, in InsufficientCapacityToAdd()
2191 TNode<IntPtrT> number_of_deleted) { in InsufficientCapacityToAdd()
2196 TNode<IntPtrT> available = IntPtrSub(capacity, number_of_elements); in InsufficientCapacityToAdd()
2197 TNode<IntPtrT> half_available = WordShr(available, 1); in InsufficientCapacityToAdd()
2198 TNode<IntPtrT> needed_available = WordShr(number_of_elements, 1); in InsufficientCapacityToAdd()
2208 TNode<EphemeronHashTable> table, TNode<IntPtrT> key_index, in RemoveEntry()
2209 TNode<IntPtrT> number_of_elements) { in RemoveEntry()
2211 TNode<IntPtrT> value_index = ValueIndexFromKeyIndex(key_index); in RemoveEntry()
2216 TNode<IntPtrT> number_of_deleted = LoadNumberOfDeleted(table, 1); in RemoveEntry()
2224 TNode<BoolT> WeakCollectionsBuiltinsAssembler::ShouldRehash( in ShouldRehash()
2225 TNode<IntPtrT> number_of_elements, TNode<IntPtrT> number_of_deleted) { in ShouldRehash()
2231 TNode<Word32T> WeakCollectionsBuiltinsAssembler::ShouldShrink( in ShouldShrink()
2232 TNode<IntPtrT> capacity, TNode<IntPtrT> number_of_elements) { in ShouldShrink()
2234 TNode<IntPtrT> quarter_capacity = WordShr(capacity, 2); in ShouldShrink()
2247 TNode<IntPtrT> WeakCollectionsBuiltinsAssembler::ValueIndexFromKeyIndex( in ValueIndexFromKeyIndex()
2248 TNode<IntPtrT> key_index) { in ValueIndexFromKeyIndex()
2255 TNode<Object> new_target = CAST(Parameter(Descriptor::kJSNewTarget)); in TF_BUILTIN()
2256 TNode<IntPtrT> argc = in TF_BUILTIN()
2258 TNode<Context> context = CAST(Parameter(Descriptor::kContext)); in TF_BUILTIN()
2265 TNode<Object> new_target = CAST(Parameter(Descriptor::kJSNewTarget)); in TF_BUILTIN()
2266 TNode<IntPtrT> argc = in TF_BUILTIN()
2268 TNode<Context> context = CAST(Parameter(Descriptor::kContext)); in TF_BUILTIN()
2275 TNode<EphemeronHashTable> table = CAST(Parameter(Descriptor::kTable)); in TF_BUILTIN()
2276 TNode<Object> key = CAST(Parameter(Descriptor::kKey)); in TF_BUILTIN()
2282 TNode<IntPtrT> hash = LoadJSReceiverIdentityHash(key, &if_not_found); in TF_BUILTIN()
2283 TNode<IntPtrT> capacity = LoadTableCapacity(table); in TF_BUILTIN()
2284 TNode<IntPtrT> key_index = in TF_BUILTIN()
2302 TNode<EphemeronHashTable> const table = LoadTable(CAST(receiver)); in TF_BUILTIN()
2303 TNode<Smi> const index = in TF_BUILTIN()
2324 TNode<EphemeronHashTable> const table = LoadTable(CAST(receiver)); in TF_BUILTIN()
2339 TNode<Context> context = CAST(Parameter(Descriptor::kContext)); in TF_BUILTIN()
2340 TNode<JSWeakCollection> collection = CAST(Parameter(Descriptor::kCollection)); in TF_BUILTIN()
2341 TNode<Object> key = CAST(Parameter(Descriptor::kKey)); in TF_BUILTIN()
2347 TNode<IntPtrT> hash = LoadJSReceiverIdentityHash(key, &if_not_found); in TF_BUILTIN()
2348 TNode<EphemeronHashTable> table = LoadTable(collection); in TF_BUILTIN()
2349 TNode<IntPtrT> capacity = LoadTableCapacity(table); in TF_BUILTIN()
2350 TNode<IntPtrT> key_index = in TF_BUILTIN()
2352 TNode<IntPtrT> number_of_elements = LoadNumberOfElements(table, -1); in TF_BUILTIN()
2369 TNode<Context> context = CAST(Parameter(Descriptor::kContext)); in TF_BUILTIN()
2370 TNode<JSWeakCollection> collection = CAST(Parameter(Descriptor::kCollection)); in TF_BUILTIN()
2371 TNode<JSReceiver> key = CAST(Parameter(Descriptor::kKey)); in TF_BUILTIN()
2372 TNode<Object> value = CAST(Parameter(Descriptor::kValue)); in TF_BUILTIN()
2378 TNode<EphemeronHashTable> table = LoadTable(collection); in TF_BUILTIN()
2379 TNode<IntPtrT> capacity = LoadTableCapacity(table); in TF_BUILTIN()
2380 TNode<IntPtrT> entry_mask = EntryMask(capacity); in TF_BUILTIN()
2383 TNode<IntPtrT> key_index = FindKeyIndexForKey(table, key, var_hash.value(), in TF_BUILTIN()
2396 TNode<IntPtrT> number_of_deleted = LoadNumberOfDeleted(table); in TF_BUILTIN()
2397 TNode<IntPtrT> number_of_elements = LoadNumberOfElements(table, 1); in TF_BUILTIN()
2405 TNode<IntPtrT> insertion_key_index = in TF_BUILTIN()
2419 TNode<Context> context = CAST(Parameter(Descriptor::kContext)); in TF_BUILTIN()
2420 TNode<Object> receiver = CAST(Parameter(Descriptor::kReceiver)); in TF_BUILTIN()
2421 TNode<Object> key = CAST(Parameter(Descriptor::kKey)); in TF_BUILTIN()
2430 TNode<Context> context = CAST(Parameter(Descriptor::kContext)); in TF_BUILTIN()
2431 TNode<Object> receiver = CAST(Parameter(Descriptor::kReceiver)); in TF_BUILTIN()
2432 TNode<Object> key = CAST(Parameter(Descriptor::kKey)); in TF_BUILTIN()
2433 TNode<Object> value = CAST(Parameter(Descriptor::kValue)); in TF_BUILTIN()
2449 TNode<Context> context = CAST(Parameter(Descriptor::kContext)); in TF_BUILTIN()
2450 TNode<Object> receiver = CAST(Parameter(Descriptor::kReceiver)); in TF_BUILTIN()
2451 TNode<Object> value = CAST(Parameter(Descriptor::kValue)); in TF_BUILTIN()
2467 TNode<Context> context = CAST(Parameter(Descriptor::kContext)); in TF_BUILTIN()
2468 TNode<Object> receiver = CAST(Parameter(Descriptor::kReceiver)); in TF_BUILTIN()
2469 TNode<Object> value = CAST(Parameter(Descriptor::kValue)); in TF_BUILTIN()