Lines Matching +full:lock +full:- +full:less

1 /*-
2  * SPDX-License-Identifier: BSD-2-Clause
50 	pctrie_init(&rtree->rt_trie);  in vm_radix_init()
56 	return (pctrie_is_empty(&rtree->rt_trie));  in vm_radix_is_empty()
63  * Inserts the key-value pair into the trie, starting search from root.
69 	return (VM_RADIX_PCTRIE_INSERT(&rtree->rt_trie, page));  in vm_radix_insert()
73  * Inserts the key-value pair into the trie, starting search from iterator.
83  * Returns the value stored at the index assuming there is an external lock.
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.
101 	return (VM_RADIX_PCTRIE_LOOKUP_UNLOCKED(&rtree->rt_trie, index));  in vm_radix_lookup_unlocked()
105  * Returns the number of contiguous, non-NULL pages read into the ma[]
106  * array, without requiring an external lock.
112 	return (VM_RADIX_PCTRIE_LOOKUP_RANGE_UNLOCKED(&rtree->rt_trie, index,  in vm_radix_lookup_range_unlocked()
117  * Returns the number of contiguous, non-NULL pages read into the ma[]
118  * array, without requiring an external lock.
133 	pctrie_iter_init(pages, &rtree->rt_trie);  in vm_radix_iter_init()
143 	pctrie_iter_limit_init(pages, &rtree->rt_trie, limit);  in vm_radix_iter_limit_init()
148  * Requires that access be externally synchronized by a lock.
160  * Requires that access be externally synchronized by a lock.
174  * Requires that access be externally synchronized by a lock.
179 	return (VM_RADIX_PCTRIE_LOOKUP_GE(&rtree->rt_trie, index));  in vm_radix_lookup_ge()
183  * Returns the page with the greatest pindex that is less than or equal to the
186  * Requires that access be externally synchronized by a lock.
191 	return (VM_RADIX_PCTRIE_LOOKUP_LE(&rtree->rt_trie, index));  in vm_radix_lookup_le()
201 	return (VM_RADIX_PCTRIE_REMOVE_LOOKUP(&rtree->rt_trie, index));  in vm_radix_remove()
221 	VM_RADIX_PCTRIE_RECLAIM_CALLBACK(&rtree->rt_trie, page_cb, arg);  in vm_radix_reclaim_callback()
229  * Requires that access be externally synchronized by a lock.
242  * Requires that access be externally synchronized by a lock.
255  * Requires that access be externally synchronized by a lock.
264  * Iterate over each non-NULL page from page 'start' to the end of the object.
271  * Iterate over each non-NULL page from the beginning to the end of the object.
277  * less than or equal to the specified pindex, or NULL if there are no such
280  * Requires that access be externally synchronized by a lock.
290  * less than to the specified pindex, or NULL if there are no such
293  * Requires that access be externally synchronized by a lock.
298 	return (index == 0 ? NULL : vm_radix_iter_lookup_le(pages, index - 1));  in vm_radix_iter_lookup_lt()
305  * Requires that access be externally synchronized by a lock.
314  * Iterate over consecutive non-NULL pages from position 'start' to first NULL
322  * Iterate over consecutive non-NULL pages from the beginning to first NULL
328  * Update the iterator to point to the page with the pindex that is one less
331  * Requires that access be externally synchronized by a lock.
342  * Requires that access be externally synchronized by a lock.
357 	return (VM_RADIX_PCTRIE_REPLACE(&rtree->rt_trie, newpage));  in vm_radix_replace()