Lines Matching full:space
132 for (PagedSpace* space = spaces.next();
133 space != NULL; space = spaces.next()) {
134 space->PrepareForMarkCompact(compacting_collection_);
157 // GC, because it relies on the new address of certain old space
163 // If we've just compacted old space there's no reason to check the
168 // fragmented (ie, we could recover an expected amount of space by
176 for (OldSpace* space = spaces.next(); space != NULL; space = spaces.next()) {
177 old_gen_recoverable += space->Waste() + space->AvailableFree();
178 old_gen_used += space->Size();
203 // generation's inactive ('from') space is used as a marking stack. The
317 // Returns false if the operation fails (lack of stack space).
505 // iterator. Stop when the marking stack is filled or the end of the space
685 // The to space contains live objects, the from space is used as a marking
786 // Iterate over the map space, setting map transitions that go from
838 // When compacting, forwarding addresses for objects in old space and map
839 // space are encoded in their map pointer word (along with an encoding of
888 // Try to promote all objects in new space. Heap numbers and sequential
889 // strings are promoted to the code space, large objects to large object space,
890 // and all others to the old space.
908 // Allocation functions for the paged spaces call the space's MCAllocateRaw.
936 // to-space object, but in from space.
974 // paged space page), iterates through the objects in the range to clear
987 // The start address of the current free region while sweeping the space.
1008 // Allocation cannot fail, because we are compacting the space.
1039 // Functions to encode the forwarding pointers in each compactable space.
1054 PagedSpace* space) {
1055 PageIterator it(space, PageIterator::PAGES_IN_USE);
1071 static void SweepSpace(NewSpace* space) {
1073 for (Address current = space->bottom();
1074 current < space->top();
1099 static void SweepSpace(PagedSpace* space, DeallocateFunction dealloc) {
1100 PageIterator it(space, PageIterator::PAGES_IN_USE);
1163 // Objects in map space are assumed to have size Map::kSize and a
1177 // Free-list elements in cell space are assumed to have a fixed size.
1197 // Compute the forwarding pointers in each space.
1215 // Compute new space next to last after the old and code spaces have been
1216 // compacted. Objects in new space can be promoted to old or code space.
1219 // Compute map space last because computing forwarding addresses
1227 // done after promoting objects from the new space so we get the correct
1282 // Iterate through to space and finish move.
1295 void UpdateMapPointersInPagedSpace(PagedSpace* space) {
1296 ASSERT(space != Heap::map_space());
1298 PageIterator it(space, PageIterator::PAGES_IN_USE);
1306 NewSpace* space = Heap::new_space();
1307 UpdateMapPointersInRange(space->bottom(), space->top());
1461 // the map space last because freeing non-live maps overwrites them and
1481 for (PagedSpace* space = spaces.next();
1482 space != NULL; space = spaces.next()) {
1483 if (space == Heap::map_space()) continue;
1484 map_compact.UpdateMapPointersInPagedSpace(space);
1520 int MarkCompactCollector::IterateLiveObjects(NewSpace* space,
1523 return IterateLiveObjectsInRange(space->bottom(), space->top(), size_f);
1527 int MarkCompactCollector::IterateLiveObjects(PagedSpace* space,
1531 PageIterator it(space, PageIterator::PAGES_IN_USE);
1602 // Don't move objects in the large object space.
1736 // Object should either in old or map space.
1785 // objects in other space relies on map objects to get object size.
1811 // Set age_mark to bottom in to space
1822 for (PagedSpace* space = spaces.next(); space != NULL; space = spaces.next())
1823 space->MCCommitRelocationInfo();
1857 PagedSpace* space,
1861 // assumption that the Map space is compacted before the other paged
1870 ASSERT(space->MCSpaceOffsetForAddress(new_addr) <=
1871 space->MCSpaceOffsetForAddress(obj->address()));
1884 PagedSpace* space) {
1894 int obj_size = RestoreMap(obj, space, new_addr, map_addr);
