Lines Matching defs:elements
735 // Reload the elements pointer before calling the callback, since the
736 // previous callback might have resized the array causing the elements
738 TNode<HeapObject> elements =
741 AccessBuilder::ForFixedArrayElement(kind), elements, index);
798 // May deopt for holey double elements.
1834 TNode<FixedArrayBase> elements = LoadElements(a);
1835 elements = MaybeGrowFastElements(kind, FeedbackSource{}, a, elements,
1837 LoadFixedArrayBaseLength(elements));
1841 StoreFixedArrayBaseElement(elements, a_length1, element, kind);
2127 TNode<FixedArrayBase> elements = LoadElements(receiver);
2148 context, elements, search_element, length, from_index);
3302 // TODO(turbofan): We should also handle fast holey double elements once
3347 // TODO(jgruber): May only be needed for holey elements kinds.
3884 // Check whether elements aren't mutated; we play it extremely safe here by
4040 // Ignore safe uses for arguments#elements.
4237 // Find array length and elements' kind from the feedback's allocation
4293 Node* elements = effect = graph()->NewNode(
4302 elements, index, effect, control);
4308 // May deopt for holey double elements.
5582 // We do not need branch for the last elements kind.
5620 // Load the elements backing store of the {receiver}.
5621 Node* elements = effect = graph()->NewNode(
5626 elements, effect, control);
5632 elements = effect = graph()->NewNode(
5634 elements,
5645 // Append the {values} to the {elements}.
5653 elements, index, value, effect, control);
5719 // We do not need branch for the last elements kind.
5732 // Check if the {receiver} has any elements.
5747 // big, as implemented in elements.cc:ElementsAccessorBase::SetLengthImpl.
5749 // Load the elements backing store from the {receiver}.
5750 Node* elements = efalse = graph()->NewNode(
5756 elements = efalse =
5758 receiver, elements, efalse, if_false);
5777 // Load the last entry from the {elements}.
5780 elements, new_length, efalse, if_false);
5786 elements, new_length, jsgraph()->TheHoleConstant(), efalse, if_false);
5866 // We do not need branch for the last elements kind.
5879 // Return undefined if {receiver} has no elements.
5904 Node* elements = etrue1 = graph()->NewNode(
5912 elements, jsgraph()->ZeroConstant(), etrue1, if_true1);
5916 elements = etrue1 =
5918 receiver, elements, etrue1, if_true1);
5921 // Shift the remaining {elements} by one towards the start.
5960 graph()->NewNode(simplified()->LoadElement(access), elements,
5963 simplified()->StoreElement(access), elements,
5995 elements, new_length, jsgraph()->TheHoleConstant(), etrue1,
6252 // Check that various {iterated_object_maps} have compatible elements kinds.
6318 // Load the elements of the {iterated_object}. While it feels
6319 // counter-intuitive to place the elements pointer load before
6323 // reloads of the elements pointer.
6324 Node* elements = effect = graph()->NewNode(
6397 elements, index, etrue, if_true);
6414 // Allocate elements for key/value pair
7237 // Offset the elements kind by FIRST_FIXED_TYPED_ARRAY_ELEMENTS_KIND,