Lines Matching defs:elements
1676 // chain contains no setters for elements, and we need to guard those checks
1685 // If the {receiver_map} has a prototype and its elements backing
1688 // fast elements (and we need to guard against changes to that below).
1723 // Perform possible elements kind transitions.
1739 // elements kind transition above. This is because those operators
1775 // Perform possible elements kind transitions.
1883 base::Optional<FixedArrayBaseRef> elements =
1884 jsobject_ref.elements(kRelaxedLoad);
1885 if (elements.has_value()) {
1886 element = jsobject_ref.GetOwnConstantElement(*elements, index,
1891 // element will replace the whole elements storage.
1892 element = receiver_ref.AsJSArray().GetOwnCowElement(*elements, index);
1899 jsgraph()->Constant(*elements));
2645 // TODO(bmeurer): We currently specialize based on elements kind. We should
2892 // Load the elements for the {receiver}.
2893 Node* elements = effect = graph()->NewNode(
2906 elements, effect, control);
2921 elements, effect, control);
2923 // Check if we might need to grow the {elements} backing store.
2996 elements, index, etrue, if_true);
3034 elements, index, effect, control);
3097 elements, checked, etrue, if_true);
3156 elements = effect =
3158 receiver, elements, effect, control);
3160 // Determine the length of the {elements} backing store.
3163 elements, effect, control);
3167 // For HOLEY_*_ELEMENTS the {index} must not exceed the {elements}
3170 // the elements kind of the {receiver} would change to slow mode.
3186 // Grow {elements} backing store if necessary.
3191 elements = effect = graph()->NewNode(
3193 receiver, elements, index, elements_length, effect, control);
3195 // If we didn't grow {elements}, it might still be COW, in which case we
3199 elements = effect =
3201 receiver, elements, effect, control);
3238 elements, index, value, effect, control);