Lines Matching defs:page

67 vm_radix_insert(struct vm_radix *rtree, vm_page_t page)
69 	return (VM_RADIX_PCTRIE_INSERT(&rtree->rt_trie, page));
77 vm_radix_iter_insert(struct pctrie_iter *pages, vm_page_t page)
79 	return (VM_RADIX_PCTRIE_ITER_INSERT(pages, page));
83  * Insert the page into the vm_radix tree with its pindex as the key.  Panic if
85  * memory allocation failure.  Set the out parameter mpred to the previous page
87  * new page pindex.
90 vm_radix_insert_lookup_lt(struct vm_radix *rtree, vm_page_t page,
95 	error = VM_RADIX_PCTRIE_INSERT_LOOKUP_LE(&rtree->rt_trie, page, mpred);
97 		panic("vm_radix_insert_lookup_lt: page already present, %p",
168  * Returns the page with the least pindex that is greater than or equal to the
180  * Returns the page with the greatest pindex that is less than or equal to the
202  * Remove the current page from the trie.
222  * Initialize an iterator pointing to the page with the least pindex that is
224  * pages.  Return the page.
235  * Update the iterator to point to the page with the least pindex that is 'jump'
237  * such pages.  Return the page.
248  * Update the iterator to point to the page with the least pindex that is one or
250  * Return the page.
261  * Initialize an iterator pointing to the page with the greatest pindex that is
263  * pages.  Return the page.
274  * Update the iterator to point to the page with the pindex that is one greater
275  * than the current pindex, or NULL if there is no such page.  Return the page.
286  * Update the iterator to point to the page with the pindex that is one less
287  * than the current pindex, or NULL if there is no such page.  Return the page.
298  * Return the current page.
309  * Replace an existing page in the trie with another one.
310  * Panics if there is not an old page in the trie at the new page's index.