Lines Matching defs:page
37 * Each call to mmap() creates a page. The pages are linked in a list.
38 * Each page is divided in blocks. There is at least one block in a page.
53 struct page *page; /* Backwards reference to page */
59 struct page {
60 size_t size; /* Total page size (incl. header) */
61 struct page *next;
69 #define HDR_PAGE (sizeof (struct page) - sizeof (void *))
71 static struct page *memstart;
105 struct page *page;
108 for (APLIST_TRAVERSE(free_alp, idx, page)) {
111 for (block = page->block; block; block = block->next) {
124 * If a page becomes free, leave it, and save the unmapping
125 * expense, as we'll probably come back and reclaim the page
145 newblock->page = block->page;
162 struct page *page;
169 for (page = memstart; page; page = page->next) {
170 for (block = page->block; block; block = block->next) {
177 * Need to allocate a new page
179 if (!page) {
183 if ((page = dz_map(0, 0, totpage,
188 page->next = memstart;
189 memstart = page;
190 page->size = totpage;
191 block = page->block;
195 block->page = page;
280 (void) aplist_test(&free_alp, block->page, AL_CNT_FREELIST);
302 (void) aplist_test(&free_alp, block->page, AL_CNT_FREELIST);
313 * We can use any memory after ld.so.1's .bss up until the next page boundary
320 struct page *page;
322 if (bytes <= sizeof (struct page))
324 page = ptr;
325 page->next = memstart;
326 memstart = page;
327 page->size = bytes;
328 block = page->block;
332 block->page = page;