| /freebsd-10.3-release/sys/vm/ |
| H A D | vm_radix.h | 39 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.h | 48 vm_radix_is_empty(struct vm_radix *rtree) argument
51 return (rtree->rt_root == 0);
|
| H A D | vm_radix.c | 160 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 D | vm_page.c | 966 mpred = vm_radix_lookup_le(&object->rtree, pindex);
1014 if (vm_radix_insert(&object->rtree, m)) {
1108 vm_radix_remove(&object->rtree, m->pindex);
1138 return (vm_radix_lookup(&object->rtree, pindex));
1156 m = vm_radix_lookup_ge(&object->rtree, pindex);
1214 mpred = vm_radix_lookup(&object->rtree, pindex);
1224 mold = vm_radix_replace(&object->rtree, mnew);
1272 mpred = vm_radix_lookup_le(&new_object->rtree, new_pindex);
1283 if (vm_radix_insert(&new_object->rtree, m)) {
1497 mpred = vm_radix_lookup_le(&object->rtree, pinde
[all...] |
| H A D | vm_object.h | 106 struct vm_radix rtree; /* root of the resident page radix trie*/ member in struct:vm_object
|
| H A D | vm_object.c | 174 KASSERT(vm_radix_is_empty(&object->rtree),
211 object->rtree.rt_root = 0;
212 object->rtree.rt_flags = 0;
780 vm_radix_reclaim_allnodes(&object->rtree);
|
| H A D | vm_reserv.c | 354 mpred = vm_radix_lookup_le(&object->rtree, pindex);
|
| H A D | vm_map.c | 846 vm_map_entry_t ltree, rtree; local
918 rtree = root->right;
921 rlist->left = rtree;
923 rtree = rlist;
928 * Final assembly: add ltree and rtree as subtrees of root.
931 root->right = rtree;
|
| /freebsd-10.3-release/contrib/jemalloc/include/jemalloc/internal/ |
| H A D | rtree.h | 39 void rtree_prefork(rtree_t *rtree);
40 void rtree_postfork_parent(rtree_t *rtree);
41 void rtree_postfork_child(rtree_t *rtree);
49 void *rtree_get_locked(rtree_t *rtree, uintptr_t key);
51 void *rtree_get(rtree_t *rtree, uintptr_t key);
52 bool rtree_set(rtree_t *rtree, uintptr_t key, void *val);
59 f(rtree_t *rtree, uintptr_t key) \
66 RTREE_LOCK(&rtree->mutex); \
67 for (i = lshift = 0, height = rtree->height, node = rtree
126 rtree_set(rtree_t *rtree, uintptr_t key, void *val) argument
[all...] |
| /freebsd-10.3-release/contrib/jemalloc/src/ |
| H A D | rtree.c | 24 /* Leak the rtree. */
38 * We leak the rtree here, since there's no generic base
49 rtree_prefork(rtree_t *rtree) argument
52 malloc_mutex_prefork(&rtree->mutex);
56 rtree_postfork_parent(rtree_t *rtree) argument
59 malloc_mutex_postfork_parent(&rtree->mutex);
63 rtree_postfork_child(rtree_t *rtree) argument
66 malloc_mutex_postfork_child(&rtree->mutex);
|
| /freebsd-10.3-release/lib/libc/stdlib/jemalloc/ |
| H A D | Makefile.inc | 7 mutex.c prof.c quarantine.c rtree.c stats.c tcache.c util.c tsd.c
|
| /freebsd-10.3-release/usr.bin/netstat/ |
| H A D | route.c | 400 u_long rtree; local
404 if ((rtree = rl[N_RTREE].n_value) == 0) {
414 if (kread((u_long)(rtree), (char *)(rt_tables) + fibnum * af_size,
|