Lines Matching defs:element
810 // Iterate up the prototype chain until an element is found or the null
3382 // non-matching element transition.
3386 // Only store fast element maps in ascending generality.
5440 Object* element = elements->get(i);
5441 if (!element->IsTheHole() && element == object) return true;
6344 // Compute the element keys.
6354 // Add the element keys from the interceptor.
6932 Object* element = dictionary->ValueAt(entry);
6934 element->IsAccessorPair()) {
6935 return handle(AccessorPair::cast(element)->GetComponent(component),
8307 // Now element at child_index could be < its children.
8314 // Put max element at the back of the array.
8316 // Shift down the new top element.
12210 // If the prototype chain didn't previously have element callbacks, then
12496 // If the array is growing, and it's not growth by a single element at the
12562 // Finally, set the new element and length.
12584 // Insert element in the dictionary.
12594 Handle<Object> element(dictionary->ValueAt(entry), isolate);
12597 return SetElementWithCallback(object, element, index, value, object,
12608 } else if (details.IsReadOnly() && !element->IsTheHole()) {
12621 if (is_arguments && element->IsAliasedArgumentsEntry()) {
12623 Handle<AliasedArgumentsEntry>::cast(element);
12629 if (!details.IsReadOnly()) value = element;
12644 // element into dictionary mode (and force them to stay there).
12725 // If storing to an element that isn't in the array, pass the store request
12764 // If the array is growing, and it's not growth by a single element at the
12873 // Don't allow element properties to be redefined for external arrays.
12910 // Store old array length in case adding an element grows the array.
13042 // Redefining attributes of an aliased element destroys fast aliasing.
13500 // and for fast element accesses we sometimes check element kinds only.
13510 // If an element has been added at a very high index in the elements
13675 // Compute the element keys from the interceptor.
13826 // Put max element at the back of the array.
13828 // Sift down the new top element.
13876 // While the current element at i is not at its correct position p,
14380 Object* element = get(index);
14381 if (element->IsUndefined()) break; // Empty entry.
14382 if (*key == element) return entry;
14383 if (!element->IsUniqueName() &&
14384 !element->IsTheHole() &&
14385 Name::cast(element)->Equals(*key)) {
14391 ASSERT(element->IsTheHole() || !Name::cast(element)->Equals(*key));
14487 // Put the current element into the correct position.
14489 // The other element will be processed on the next iteration.
14492 // The place for the current element is occupied. Leave the element
14574 Object* element = KeyAt(entry);
14575 if (element->IsUndefined() || element->IsTheHole()) break;
14765 // Also bail out if the element is not supposed to be moved.
15637 // Insert element at empty or deleted entry
15656 // If the dictionary requires slow elements an element has already
