83  * Returns the value stored at the index assuming there is an external lock.
85  * If the index is not present, NULL is returned.
88 vm_radix_lookup(struct vm_radix *rtree, vm_pindex_t index)  in vm_radix_lookup()  argument
90 	return (VM_RADIX_PCTRIE_LOOKUP(&rtree->rt_trie, index));  in vm_radix_lookup()
94  * Returns the value stored at the index without requiring an external lock.
96  * If the index is not present, NULL is returned.
99 vm_radix_lookup_unlocked(struct vm_radix *rtree, vm_pindex_t index)  in vm_radix_lookup_unlocked()  argument
101 	return (VM_RADIX_PCTRIE_LOOKUP_UNLOCKED(&rtree->rt_trie, index));  in vm_radix_lookup_unlocked()
109 vm_radix_lookup_range_unlocked(struct vm_radix *rtree, vm_pindex_t index,  in vm_radix_lookup_range_unlocked()  argument
112 	return (VM_RADIX_PCTRIE_LOOKUP_RANGE_UNLOCKED(&rtree->rt_trie, index,  in vm_radix_lookup_range_unlocked()
121 vm_radix_iter_lookup_range(struct pctrie_iter *pages, vm_pindex_t index,  in vm_radix_iter_lookup_range()  argument
124 	return (VM_RADIX_PCTRIE_ITER_LOOKUP_RANGE(pages, index, ma, count));  in vm_radix_iter_lookup_range()
147  * Returns the value stored at the index.
150  * If the index is not present, NULL is returned.
153 vm_radix_iter_lookup(struct pctrie_iter *pages, vm_pindex_t index)  in vm_radix_iter_lookup()  argument
155 	return (VM_RADIX_PCTRIE_ITER_LOOKUP(pages, index));  in vm_radix_iter_lookup()
162  * If the index is not present, NULL is returned.
177 vm_radix_lookup_ge(struct vm_radix *rtree, vm_pindex_t index)  in vm_radix_lookup_ge()  argument
179 	return (VM_RADIX_PCTRIE_LOOKUP_GE(&rtree->rt_trie, index));  in vm_radix_lookup_ge()
189 vm_radix_lookup_le(struct vm_radix *rtree, vm_pindex_t index)  in vm_radix_lookup_le()  argument
191 	return (VM_RADIX_PCTRIE_LOOKUP_LE(&rtree->rt_trie, index));  in vm_radix_lookup_le()
195  * Remove the specified index from the trie, and return the value stored at
196  * that index.  If the index is not present, return NULL.
199 vm_radix_remove(struct vm_radix *rtree, vm_pindex_t index)  in vm_radix_remove()  argument
201 	return (VM_RADIX_PCTRIE_REMOVE_LOOKUP(&rtree->rt_trie, index));  in vm_radix_remove()
232 vm_radix_iter_lookup_ge(struct pctrie_iter *pages, vm_pindex_t index)  in vm_radix_iter_lookup_ge()  argument
234 	return (VM_RADIX_PCTRIE_ITER_LOOKUP_GE(pages, index));  in vm_radix_iter_lookup_ge()
283 vm_radix_iter_lookup_le(struct pctrie_iter *pages, vm_pindex_t index)  in vm_radix_iter_lookup_le()  argument
285 	return (VM_RADIX_PCTRIE_ITER_LOOKUP_LE(pages, index));  in vm_radix_iter_lookup_le()
296 vm_radix_iter_lookup_lt(struct pctrie_iter *pages, vm_pindex_t index)  in vm_radix_iter_lookup_lt()  argument
298 	return (index == 0 ? NULL : vm_radix_iter_lookup_le(pages, index - 1));  in vm_radix_iter_lookup_lt()
352  * Panics if there is not an old page in the trie at the new page's index.