| /freebsd-12.1/contrib/jemalloc/include/jemalloc/internal/ |
| H A D | rtree.h | 108 # error Unsupported rtree height
112 bool rtree_new(rtree_t *rtree, bool zeroed);
126 void rtree_delete(tsdn_t *tsdn, rtree_t *rtree);
303 rtree_leaf_elm_slab_write(tsdn, rtree, elm, slab); in rtree_leaf_elm_write()
304 rtree_leaf_elm_szind_write(tsdn, rtree, elm, szind); in rtree_leaf_elm_write()
309 rtree_leaf_elm_extent_write(tsdn, rtree, elm, extent); in rtree_leaf_elm_write()
314 rtree_leaf_elm_szind_slab_update(tsdn_t *tsdn, rtree_t *rtree, in rtree_leaf_elm_szind_slab_update() argument
322 rtree_leaf_elm_slab_write(tsdn, rtree, elm, slab); in rtree_leaf_elm_szind_slab_update()
323 rtree_leaf_elm_szind_write(tsdn, rtree, elm, szind); in rtree_leaf_elm_szind_slab_update()
398 rtree_leaf_elm_write(tsdn, rtree, elm, extent, szind, slab); in rtree_write()
[all …]
|
| /freebsd-12.1/contrib/jemalloc/src/ |
| H A D | rtree.c | 13 rtree_new(rtree_t *rtree, bool zeroed) { in rtree_new() argument
82 rtree_leaf_dalloc(tsdn, rtree, leaf); in rtree_delete_subtree()
87 if (subtree != rtree->root) { in rtree_delete_subtree()
88 rtree_node_dalloc(tsdn, rtree, subtree); in rtree_delete_subtree()
94 rtree_delete(tsdn_t *tsdn, rtree_t *rtree) { in rtree_delete() argument
96 rtree_delete_subtree(tsdn, rtree, rtree->root, 0); in rtree_delete()
104 malloc_mutex_lock(tsdn, &rtree->init_lock); in rtree_node_init()
130 malloc_mutex_lock(tsdn, &rtree->init_lock); in rtree_leaf_init()
228 node = rtree->root; in rtree_leaf_elm_lookup_hard()
230 leaf = rtree->root; in rtree_leaf_elm_lookup_hard()
[all …]
|
| /freebsd-12.1/sys/vm/ |
| H A D | vm_radix.h | 40 int vm_radix_insert(struct vm_radix *rtree, vm_page_t page);
42 boolean_t vm_radix_is_singleton(struct vm_radix *rtree);
43 vm_page_t vm_radix_lookup(struct vm_radix *rtree, vm_pindex_t index);
44 vm_page_t vm_radix_lookup_ge(struct vm_radix *rtree, vm_pindex_t index);
46 void vm_radix_reclaim_allnodes(struct vm_radix *rtree);
47 vm_page_t vm_radix_remove(struct vm_radix *rtree, vm_pindex_t index);
48 vm_page_t vm_radix_replace(struct vm_radix *rtree, vm_page_t newpage);
52 vm_radix_init(struct vm_radix *rtree) in vm_radix_init() argument
55 rtree->rt_root = 0; in vm_radix_init()
59 vm_radix_is_empty(struct vm_radix *rtree) in vm_radix_is_empty() argument
[all …]
|
| H A D | vm_radix.c | 175 rtree->rt_root = (uintptr_t)rnode; in vm_radix_setroot()
357 rnode = vm_radix_getroot(rtree); in vm_radix_insert()
416 rnode = vm_radix_getroot(rtree); in vm_radix_is_singleton()
433 rnode = vm_radix_getroot(rtree); in vm_radix_lookup()
464 rnode = vm_radix_getroot(rtree); in vm_radix_lookup_ge()
575 rnode = vm_radix_getroot(rtree); in vm_radix_lookup_le()
684 rnode = vm_radix_getroot(rtree); in vm_radix_remove()
689 vm_radix_setroot(rtree, NULL); in vm_radix_remove()
738 root = vm_radix_getroot(rtree); in vm_radix_reclaim_allnodes()
741 vm_radix_setroot(rtree, NULL); in vm_radix_reclaim_allnodes()
[all …]
|
| H A D | vm_page.c | 1359 mpred = vm_radix_lookup_le(&object->rtree, pindex); in vm_page_insert()
1403 if (vm_radix_insert(&object->rtree, m)) { in vm_page_insert_after()
1483 mrem = vm_radix_remove(&object->rtree, m->pindex); in vm_page_remove()
1519 return (vm_radix_lookup(&object->rtree, pindex)); in vm_page_lookup()
1537 m = vm_radix_lookup_ge(&object->rtree, pindex); in vm_page_find_least()
1606 mold = vm_radix_replace(&object->rtree, mnew); in vm_page_replace()
1652 mpred = vm_radix_lookup_le(&new_object->rtree, new_pindex); in vm_page_rename()
1663 if (vm_radix_insert(&new_object->rtree, m)) { in vm_page_rename()
1714 vm_radix_lookup_le(&object->rtree, pindex) : NULL)); in vm_page_alloc()
2015 mpred = vm_radix_lookup_le(&object->rtree, pindex); in vm_page_alloc_contig_domain()
[all …]
|
| H A D | vm_object.h | 104 struct vm_radix rtree; /* root of the resident page radix trie*/ member
|
| H A D | vm_object.c | 190 KASSERT(vm_radix_is_empty(&object->rtree), in vm_object_zdtor()
223 vm_radix_init(&object->rtree); in vm_object_zinit()
717 vm_radix_reclaim_allnodes(&object->rtree); in vm_object_terminate_pages()
|
| H A D | vm_kern.c | 475 mpred = vm_radix_lookup_le(&object->rtree, atop(offset + i)); in kmem_back_domain()
|
| /freebsd-12.1/contrib/sqlite3/ |
| H A D | configure.ac | 158 # --enable-rtree
160 AC_ARG_ENABLE(rtree, [AS_HELP_STRING( optenable
161 [--enable-rtree], [include rtree support [default=yes]])],
|
| H A D | configure | 1444 --enable-rtree include rtree support [default=yes]
|
| /freebsd-12.1/lib/libc/stdlib/jemalloc/ |
| H A D | Makefile.inc | 8 prng.c prof.c rtree.c stats.c sz.c tcache.c ticker.c tsd.c witness.c
|
| /freebsd-12.1/contrib/jemalloc/ |
| H A D | ChangeLog | 258 - Extensively optimize rtree via various methods:
259 + Add multiple layers of rtree lookup caching, since rtree lookups are now
261 + Determine rtree layout at compile time. (@jasone)
263 + Embed the root node in the top-level rtree data structure, thus avoiding
484 - Streamline fast paths of rtree operations. (@jasone)
783 - Refactor rtree (radix tree for chunk lookups) to be lock-free, and make
|