Searched refs:rtree (Results 1 - 11 of 11) sorted by relevance

/freebsd-11.0-release/sys/vm/
H A Dvm_radix.h39 int vm_radix_insert(struct vm_radix *rtree, vm_page_t page);
40 boolean_t vm_radix_is_singleton(struct vm_radix *rtree);
41 vm_page_t vm_radix_lookup(struct vm_radix *rtree, vm_pindex_t index);
42 vm_page_t vm_radix_lookup_ge(struct vm_radix *rtree, vm_pindex_t index);
43 vm_page_t vm_radix_lookup_le(struct vm_radix *rtree, vm_pindex_t index);
44 void vm_radix_reclaim_allnodes(struct vm_radix *rtree);
45 void vm_radix_remove(struct vm_radix *rtree, vm_pindex_t index);
46 vm_page_t vm_radix_replace(struct vm_radix *rtree, vm_page_t newpage);
H A D_vm_radix.h48 vm_radix_is_empty(struct vm_radix *rtree) argument
51 return (rtree->rt_root == 0);
H A Dvm_radix.c160 vm_radix_getroot(struct vm_radix *rtree) argument
163 return ((struct vm_radix_node *)rtree->rt_root);
170 vm_radix_setroot(struct vm_radix *rtree, struct vm_radix_node *rnode) argument
173 rtree->rt_root = (uintptr_t)rnode;
333 vm_radix_insert(struct vm_radix *rtree, vm_page_t page) argument
350 rnode = vm_radix_getroot(rtree);
352 rtree->rt_root = (uintptr_t)page | VM_RADIX_ISLEAF;
355 parentp = (void **)&rtree->rt_root;
375 rtree->rt_flags |= RT_INSERT_INPROG;
378 rtree
439 vm_radix_is_singleton(struct vm_radix *rtree) argument
454 vm_radix_lookup(struct vm_radix *rtree, vm_pindex_t index) argument
480 vm_radix_lookup_ge(struct vm_radix *rtree, vm_pindex_t index) argument
591 vm_radix_lookup_le(struct vm_radix *rtree, vm_pindex_t index) argument
705 vm_radix_remove(struct vm_radix *rtree, vm_pindex_t index) argument
775 vm_radix_reclaim_allnodes(struct vm_radix *rtree) argument
795 vm_radix_replace(struct vm_radix *rtree, vm_page_t newpage) argument
[all...]
H A Dvm_object.h106 struct vm_radix rtree; /* root of the resident page radix trie*/ member in struct:vm_object
H A Dvm_page.c1130 mpred = vm_radix_lookup_le(&object->rtree, pindex);
1174 if (vm_radix_insert(&object->rtree, m)) {
1257 vm_radix_remove(&object->rtree, m->pindex);
1287 return (vm_radix_lookup(&object->rtree, pindex));
1305 m = vm_radix_lookup_ge(&object->rtree, pindex);
1368 mold = vm_radix_replace(&object->rtree, mnew);
1416 mpred = vm_radix_lookup_le(&new_object->rtree, new_pindex);
1427 if (vm_radix_insert(&new_object->rtree, m)) {
1641 mpred = vm_radix_lookup_le(&object->rtree, pindex);
3312 vm_radix_remove(&object->rtree,
[all...]
H A Dvm_object.c174 KASSERT(vm_radix_is_empty(&object->rtree),
210 object->rtree.rt_root = 0;
211 object->rtree.rt_flags = 0;
784 vm_radix_reclaim_allnodes(&object->rtree);
H A Dvm_map.c893 vm_map_entry_t ltree, rtree; local
965 rtree = root->right;
968 rlist->left = rtree;
970 rtree = rlist;
975 * Final assembly: add ltree and rtree as subtrees of root.
978 root->right = rtree;
H A Dvm_reserv.c451 mpred = vm_radix_lookup_le(&object->rtree, pindex);
/freebsd-11.0-release/contrib/jemalloc/src/
H A Drtree.c13 rtree_new(rtree_t *rtree, unsigned bits, rtree_node_alloc_t *alloc, argument
32 rtree->alloc = alloc;
33 rtree->dalloc = dalloc;
34 rtree->height = height;
37 rtree->levels[0].subtree = NULL;
38 rtree->levels[0].bits = (height > 1) ? RTREE_BITS_PER_LEVEL :
40 rtree->levels[0].cumbits = rtree->levels[0].bits;
43 rtree->levels[i].subtree = NULL;
44 rtree
65 rtree_delete_subtree(rtree_t *rtree, rtree_node_elm_t *node, unsigned level) argument
82 rtree_delete(rtree_t *rtree) argument
94 rtree_node_init(rtree_t *rtree, unsigned level, rtree_node_elm_t **elmp) argument
118 rtree_subtree_read_hard(rtree_t *rtree, unsigned level) argument
125 rtree_child_read_hard(rtree_t *rtree, rtree_node_elm_t *elm, unsigned level) argument
[all...]
/freebsd-11.0-release/contrib/jemalloc/include/jemalloc/internal/
H A Drtree.h19 /* Maximum rtree height. */
98 bool rtree_new(rtree_t *rtree, unsigned bits, rtree_node_alloc_t *alloc,
100 void rtree_delete(rtree_t *rtree);
101 rtree_node_elm_t *rtree_subtree_read_hard(rtree_t *rtree,
103 rtree_node_elm_t *rtree_child_read_hard(rtree_t *rtree,
111 unsigned rtree_start_level(rtree_t *rtree, uintptr_t key);
112 uintptr_t rtree_subkey(rtree_t *rtree, uintptr_t key, unsigned level);
117 rtree_node_elm_t *rtree_child_read(rtree_t *rtree, rtree_node_elm_t *elm,
119 extent_node_t *rtree_val_read(rtree_t *rtree, rtree_node_elm_t *elm,
121 void rtree_val_write(rtree_t *rtree, rtree_node_elm_
134 rtree_start_level(rtree_t *rtree, uintptr_t key) argument
148 rtree_subkey(rtree_t *rtree, uintptr_t key, unsigned level) argument
177 rtree_child_read(rtree_t *rtree, rtree_node_elm_t *elm, unsigned level, bool dependent) argument
190 rtree_val_read(rtree_t *rtree, rtree_node_elm_t *elm, bool dependent) argument
212 rtree_val_write(rtree_t *rtree, rtree_node_elm_t *elm, const extent_node_t *val) argument
219 rtree_subtree_tryread(rtree_t *rtree, unsigned level, bool dependent) argument
232 rtree_subtree_read(rtree_t *rtree, unsigned level, bool dependent) argument
244 rtree_get(rtree_t *rtree, uintptr_t key, bool dependent) argument
335 rtree_set(rtree_t *rtree, uintptr_t key, const extent_node_t *val) argument
[all...]
/freebsd-11.0-release/lib/libc/stdlib/jemalloc/
H A DMakefile.inc7 mutex.c nstime.c pages.c prng.c prof.c quarantine.c rtree.c stats.c \

Completed in 59 milliseconds