Lines Matching defs:list
370 * Each page cell is initialized and placed on the free list.
695 * note that I'm assuming that the page list is ascending and
707 panic("couldn't reserve the lopage pool: page list out of order\n");
715 panic("couldn't reserve the lopage pool: page list out of order\n");
877 * table and object list.
948 * Now link into the object's list of backed pages.
1028 * Remove old page from hash list
1043 * insert new page at head of hash list
1053 * the object and free it back to the free list
1068 * Return page to the free list.
1074 * Now link into the object's list of backed pages.
1100 * table and the object page list.
1150 * Now remove from the object's list of backed pages.
1346 * Remove a fictitious page from the free list.
1386 * Release a fictitious page to the free list.
1411 * Add more fictitious pages to the free list.
1432 * scans our list, and reduces physical memory usage as it
1577 * first try to grab a page from the per-cpu free list...
1584 * recheck the state of the per-cpu free list... we could
1591 * list... no need for the wakeup if we've satisfied the
1792 * Return a page to the free list.
2034 * Returns the given page to the free list,
2057 panic("vm_page_free: freeing page on free list\n");
2131 * Free a list of pages. The list can be up to several hundred pages,
2133 * The big win is not having to take the page q and free list locks once
2163 panic("vm_page_free_list: freeing page on list\n");
2432 * Returns the given page to the inactive list,
2521 * Put the specified page on the active list (if appropriate).
2586 * Put the specified page on the speculative list (if appropriate).
2878 * Check that the list of pages is ordered by
2970 * ordered, ascending list... this is currently true of all our implementations
2972 * no longer tolerate the vm_page_t's in the list being 'freed' and reclaimed
2993 * dump the pages we've currently stolen back to the free list, and pick up our
3000 * Returns a pointer to a list of gobbled/wired pages or VM_PAGE_NULL.
3099 * pages on the free list are always 'busy'
3196 * free pages in this run and return them to the free list
3222 * we've pulled any 'free' candidates off of the list
3233 * must go through the list from back to front
3234 * so that the page list is created in the
3242 * the free list in the 1st pass
3313 * to be put onto the free list, or
3315 * just came off of the free list
3342 * to be put onto the free list, or
3344 * just came off of the free list
3437 * Allocate a list of contiguous, wired pages.
3442 vm_page_t *list,
3456 * list large enough to satisfy the request;
3495 *list = pages;