Lines Matching defs:elements
115 TNode<FixedArrayBase> elements = LoadElements(fast_jsarray);
139 CAST(elements), UncheckedCast<IntPtrT>(index));
145 // elements, a fast loop is used. This assumes that adding an element
146 // to the collection does not call user code that could mutate the elements
159 LoadAndNormalizeFixedDoubleArrayElement(elements, IntPtrConstant(0));
166 elements, UncheckedCast<IntPtrT>(index));
453 TNode<FixedArray> elements, TNode<IntPtrT> index) {
454 TNode<Object> element = UnsafeLoadFixedArrayElement(elements, index);
460 TNode<HeapObject> elements, TNode<IntPtrT> index) {
464 LoadFixedDoubleArrayElement(CAST(elements), index, &if_hole);
990 TNode<FixedArray> elements = CAST(LoadElements(array));
1021 Store(elements, var_offset.value(), entry_key);
1035 Store(elements, var_offset.value(), entry_value);
1102 TNode<FixedArray> elements = CAST(LoadElements(array));
1125 Store(elements, var_offset.value(), entry_key);
1615 // Store the entry elements.
1636 // Bump the elements count.
1674 // Decrement the number of elements, increment the number of deleted elements.
1691 // If there fewer elements than #buckets / 2, shrink the table.
1787 // Store the entry elements.
1804 // Bump the elements count.
1838 // Decrement the number of elements, increment the number of deleted elements.
1855 // If there fewer elements than #buckets / 2, shrink the table.
2492 // - more than 50% of the available space are deleted elements
2500 // elements + needed available > capacity
2534 // Shrink to fit the number of elements if only a quarter of the
2535 // capacity is filled with elements.
2539 // number of elements. The allocation method will make sure that
2541 // lower than room for 16 elements.