Lines Matching defs:pages
180 // page->area_start() as start of range on all pages.
548 PrintF("[%s]: %d pages, %d (%.1f%%) free\n", space->name(), number_of_pages,
687 // out of work and quit: all pages are swept. The main thread still needs
824 std::vector<LiveBytesPagePair> pages;
825 pages.reserve(number_of_pages);
853 // Only the pages with at more than |free_bytes_threshold| free bytes are
856 pages.push_back(std::make_pair(p->allocated_bytes(), p));
859 pages.push_back(std::make_pair(p->allocated_bytes(), p));
862 // Unpin pages for the next GC
873 for (size_t i = 0; i < pages.size(); i++) {
874 Page* p = pages[i].second;
877 total_live_bytes += pages[i].first;
885 static_cast<size_t>(fraction * (pages.size() + 1));
887 pages.size(), pages_to_mark_count)) {
889 total_live_bytes += pages[i].first;
890 AddEvacuationCandidate(pages[i].second);
893 for (size_t i = 0; i < pages.size(); i++) {
894 Page* p = pages[i].second;
897 total_live_bytes += pages[i].first;
902 // The following approach determines the pages that should be evacuated.
904 // Sort pages from the most free to the least free, then select
905 // the first n pages for evacuation such that:
909 std::sort(pages.begin(), pages.end(),
913 for (size_t i = 0; i < pages.size(); i++) {
914 size_t live_bytes = pages[i].first;
932 // How many pages we will allocated for the evacuated objects
943 AddEvacuationCandidate(pages[i].second);
949 "compaction-selection: space=%s reduce_memory=%d pages=%d "
3474 // Append the list of new space pages to be processed.
3514 // Old space. Deallocate evacuated candidate pages.
3517 // Give pages that are queued to be freed back to the OS.
3906 "%8.0f ms: evacuation-summary: parallel=%s pages=%zu "
3922 // Evacuation of new space pages cannot be aborted, so it needs to run
3944 // Set this flag early on in this case to allow filtering such pages
3983 "MarkCompactCollector::EvacuatePagesInParallel", "pages",
4139 // Give pages that are queued to be freed back to the OS. Note that filtering
4149 // Full GCs don't promote pages within new space.
4264 // New->new promoted pages contain garbage so they require iteration using
4506 int pages = 0;
4529 pages++;
4532 return pages;
5334 // Ensure that concurrent marker does not track pages that are
5482 // Append the list of new space pages to be processed.
5497 // Give pages that are queued to be freed back to the OS.
5503 // Seed to space pages.
5506 int pages = 0;
5512 pages++;
5514 return pages;