Lines Matching refs:PAGE
358 << LG_PAGE)), PAGE);
368 for (i = 0; i < PAGE / sizeof(size_t); i++)
472 * Set the last element first, in case the run only contains one page
517 * The first page will always be dirtied during small run
652 * There is no need to initialize the internal page map entries unless
1268 assert(size == PAGE ||
1322 * It is okay to do dirty page processing here even if the chunk was
1326 * chances of spuriously crossing the dirty page purging threshold.
1345 * run first, in case of single-page runs.
1377 * run first, in case of single-page runs.
1793 /* Only handles large allocations that require more than page alignment. */
1805 alloc_size = size + alignment - PAGE;
1858 assert(isalloc(ptr, false) == PAGE);
1859 assert(isalloc(ptr, true) == PAGE);
1868 assert(isalloc(ptr, false) == PAGE);
2479 assert(min_run_size >= PAGE);
2547 try_run_size += PAGE;
2590 size_t prev_run_size = PAGE;
2614 * page map. The page map is biased to omit entries for the header
2618 * space for an unbiased page map.
2619 * 2) Refine map_bias based on (1) to omit the header pages in the page
