Lines Matching defs:object
242 // Don't leave a small free block, useless for a large object or chunk.
1150 HeapObject* object = HeapObject::FromAddress(current);
1154 Map* map = object->map();
1158 // Perform space-specific object verification.
1159 VerifyObject(object);
1161 // The object itself should look OK.
1162 object->Verify();
1167 int size = object->Size();
1168 object->IterateBody(map->instance_type(), size, visitor);
1173 // The allocation pointer should not be in the middle of an object.
1361 HeapObject* object = HeapObject::FromAddress(current);
1365 Map* map = object->map();
1369 // The object should not be code or a map.
1370 ASSERT(!object->IsMap());
1371 ASSERT(!object->IsCode());
1373 // The object itself should look OK.
1374 object->Verify();
1378 int size = object->Size();
1379 object->IterateBody(map->instance_type(), size, &visitor);
1384 // The allocation pointer should not be in the middle of an object.
1610 PrintF("\n Object Histogram:\n");
1700 PrintF("\n Object Histogram:\n");
1741 // Free lists for old object spaces implementation
2157 // used page so various object iterators will continue to work properly.
2240 // doesn't know that memory was 'promised' to large object space.
2253 // object area size).
2263 Object* result;
2274 // and allocated object address.
2567 Object* result;
2576 // and allocated object address.
2679 void MapSpace::VerifyObject(HeapObject* object) {
2680 // The object should be a map or a free-list node.
2681 ASSERT(object->IsMap() || object->IsByteArray());
2690 void CellSpace::VerifyObject(HeapObject* object) {
2691 // The object should be a global object property cell or a free-list node.
2692 ASSERT(object->IsJSGlobalPropertyCell() ||
2693 object->map() == heap()->two_pointer_filler_map());
2717 HeapObject* object = current_->GetObject();
2719 return object;
2866 // large object page. If the chunk_size happened to be written there, its
2930 for (HeapObject* object = it.next(); object != NULL; object = it.next()) {
2932 // object space, and only fixed arrays can possibly contain pointers to
2934 if (object->IsFixedArray()) {
2935 Page* page = Page::FromAddress(object->address());
2944 Address start = object->address();
2946 Address object_end = start + object->Size();
2948 // Iterate regions of the first normal page covering object.
2972 // Iterate the last piece of an object which is less than
2993 HeapObject* object = current->GetObject();
2994 if (object->IsMarked()) {
2995 object->ClearMark();
3017 object, heap()->isolate());
3018 LiveObjectList::ProcessNonLive(object);
3021 objects_size_ -= object->Size();
3036 bool LargeObjectSpace::Contains(HeapObject* object) {
3037 Address address = object->address();
3051 // We do not assume that the large object iterator works, because it depends
3057 // Each chunk contains an object that starts at the large object page's
3058 // object area start.
3059 HeapObject* object = chunk->GetObject();
3060 Page* page = Page::FromAddress(object->address());
3061 ASSERT(object->address() == page->ObjectAreaStart());
3065 Map* map = object->map();
3071 // strings), fixed arrays, and byte arrays in large object space.
3072 ASSERT(object->IsCode() || object->IsSeqString() ||
3073 object->IsExternalString() || object->IsFixedArray() ||
3074 object->IsByteArray());
3076 // The object itself should look OK.
3077 object->Verify();
3080 if (object->IsCode()) {
3082 object->IterateBody(map->instance_type(),
3083 object->Size(),
3085 } else if (object->IsFixedArray()) {
3089 FixedArray* array = FixedArray::cast(object);
3091 Object* element = array->get(j);
3097 Address array_addr = object->address();
