Cross Reference: /external/v8/src/liveobjectlist.cc

Lines Matching refs:elements
382         // If we have elements to process, we're good to go.
447         // If we have elements to process, we're good to go.
951       Element* elements = lol->elements_;
953         HeapObject* heap_obj = elements[i].obj_;
993   // For lol elements, it doesn't matter which comes first if 2 elements point
1336   // Allocate the JSArray of the elements.
1337   Handle<JSObject> elements = factory->NewJSObject(isolate->array_function());
1338   if (elements->IsFailure()) return Object::cast(*elements);
1340   maybe_result = Handle<JSArray>::cast(elements)->SetContent(*elements_arr);
1343   // Set body.elements.
1344   Handle<String> elements_sym = factory->LookupAsciiSymbol("elements");
1346                                    *elements,
2076                    jsobj->elements() == HeapObject::cast(obj)) {
2078           // elements of the last object already.
2283     Element* elements = lol->elements_;
2286       HeapObject** p = &elements[i].obj_;
2308   Element* elements = NewArray<Element>(total_count);
2311   // Copy all the object elements into a consecutive array.
2313     memcpy(&elements[count], lol->elements_, lol->obj_count_ * sizeof(Element));
2317   qsort(elements, total_count, sizeof(Element),
2325     Element* curr = &elements[i];
2334         Element* next = &elements[j];
2354           // database, not in the local sorted copy of the elements.
2369   DeleteArray<Element>(elements);
2397     Element* elements = lol->elements_;
2403       Element& element = elements[i];
2407         element = elements[lol->obj_count_ - 1];
2418     // Check if there are any more elements to keep after purging the dead ones.
2420       DeleteArray<Element>(elements);
2450         memcpy(new_elements, elements, new_count * sizeof(Element));
2452         DeleteArray<Element>(elements);
2486   Element* elements = NewArray<Element>(total_count);
2489   // Copy all the object elements into a consecutive array.
2492     memcpy(&elements[count], lol->elements_, lol->obj_count_ * sizeof(Element));
2496   qsort(elements, total_count, sizeof(Element),
2526         bsearch(&key, elements, total_count, sizeof(Element),
2556       Element& element = elements[i];
2565   DeleteArray<Element>(elements);
2599     Element* elements = lol->elements_;
2601       if (elements[i].obj_ >= elements[i+1].obj_) {
2603                   lol, i, elements[i].obj_, i+1, elements[i+1].obj_);