Lines Matching defs:page
127 // The bottom position is at the start of its page. Allows us to use
128 // page->area_start() as start of range on all pages.
132 NewSpacePage* page = it.next();
133 Address limit = it.has_next() ? page->area_end() : end;
134 CHECK(limit == end || !page->Contains(end));
135 VerifyMarking(space->heap(), page->area_start(), limit);
144 Page* p = it.next();
208 NewSpacePage* page = it.next();
209 Address current = page->area_start();
210 Address limit = it.has_next() ? page->area_end() : space->top();
211 CHECK(limit == space->top() || !page->Contains(space->top()));
225 Page* p = it.next();
348 void MarkCompactCollector::AddEvacuationCandidate(Page* p) {
459 Page* p = it.next();
490 CHECK_EQ(0, Page::FromAddress(obj->address())->LiveBytes());
552 Page::FromAddress(obj->address())->ResetProgressBar();
553 Page::FromAddress(obj->address())->ResetLiveBytes();
664 static int FreeListFragmentation(PagedSpace* space, Page* p) {
665 // If page was not swept then there are no free list items on it.
738 Candidate(int f, Page* p) : fragmentation_(f), page_(p) { }
741 Page* page() { return page_; }
745 Page* page_;
797 if (it.has_next()) it.next(); // Never compact the first page.
800 Page* p = it.next();
865 AddEvacuationCandidate(candidates[i].page());
880 Page* p = evacuation_candidates_[i];
1320 // page dirty marks. Therefore, we only replace the string with its left
1321 // substring when page dirty marks do not change.
2047 Page* p = it.next();
2060 NewSpacePage* page = it.next();
2061 DiscoverGreyObjectsOnPage(marking_deque, page);
2310 // The to space contains live objects, a page in from space is used as a
2776 ASSERT(dest != LO_SPACE && size <= Page::kMaxNonCodeHeapObjectSize);
2804 if (Page::FromAddress(code_entry)->IsEvacuationCandidate()) {
2950 CHECK(object_size <= Page::kMaxNonCodeHeapObjectSize);
3008 void MarkCompactCollector::EvacuateLiveObjectsFromPage(Page* p) {
3056 Page* p = evacuation_candidates_[i];
3058 p->IsFlagSet(Page::RESCAN_ON_EVACUATION));
3060 // During compaction we might have to request a new page.
3068 Page* page = evacuation_candidates_[j];
3069 slots_buffer_allocator_.DeallocateChain(page->slots_buffer_address());
3070 page->ClearEvacuationCandidate();
3071 page->SetFlag(Page::RESCAN_ON_EVACUATION);
3072 page->InsertAfter(static_cast<PagedSpace*>(page->owner())->anchor());
3157 Page* p,
3235 Page* p = Page::FromAddress(code->address());
3238 p->IsFlagSet(Page::RESCAN_ON_EVACUATION)) {
3282 // we can safely go to the page from the slot address.
3283 Page* p = Page::FromAddress(addr);
3293 p->markbits()->MarkBitFromIndex(Page::FastAddressToMarkbitIndex(addr));
3420 Page* p = Page::FromAddress(obj->address());
3421 if (p->IsFlagSet(Page::RESCAN_ON_EVACUATION)) {
3423 p->ClearFlag(Page::RESCAN_ON_EVACUATION);
3433 Page* p = evacuation_candidates_[i];
3435 p->IsFlagSet(Page::RESCAN_ON_EVACUATION));
3442 PrintF(" page %p slots buffer: %d\n",
3547 Page* p = evacuation_candidates_[i];
3559 Page* p = evacuation_candidates_[i];
3867 PagedSpace*, FreeList*, Page*);
3874 PagedSpace*, FreeList*, Page*);
3887 Page* p) {
3899 // Skip over all the dead objects at the start of the page and mark them free.
3917 // Grow the size of the start-of-page free space a little to get up to the
3960 // Handle the free space at the end of the page.
3977 Page* p = it.next();
4002 Page* p = it.next();
4011 if (p->IsFlagSet(Page::RESCAN_ON_EVACUATION)) {
4017 // One unused page is kept, all further are released before sweeping them.
4021 PrintF("Sweeping 0x%" V8PRIxPTR " released page.\n",
4024 // Adjust unswept free bytes because releasing a page expects said
4263 Page* target_page = Page::FromAddress(reinterpret_cast<Address>(target));
4279 Page* target_page = Page::FromAddress(reinterpret_cast<Address>(target));
