Home
last modified time | relevance | path

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

/f-stack/app/redis-5.0.5/deps/jemalloc/test/unit/
H A Drtree.c17 if (rtree != &test_rtree) { in rtree_node_alloc_intercept()
32 if (rtree != &test_rtree) { in rtree_node_dalloc_intercept()
44 if (rtree != &test_rtree) { in rtree_leaf_alloc_intercept()
59 if (rtree != &test_rtree) { in rtree_leaf_dalloc_intercept()
72 rtree_t *rtree = &test_rtree; in TEST_BEGIN() local
78 rtree_delete(tsdn, rtree); in TEST_BEGIN()
96 rtree_t *rtree = &test_rtree; in TEST_BEGIN() local
117 rtree_delete(tsdn, rtree); in TEST_BEGIN()
131 rtree_t *rtree = &test_rtree; in TEST_BEGIN() local
154 rtree_delete(tsdn, rtree); in TEST_BEGIN()
[all …]
/f-stack/freebsd/vm/
H A Dvm_radix.h40 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);
47 void vm_radix_reclaim_allnodes(struct vm_radix *rtree);
48 vm_page_t vm_radix_remove(struct vm_radix *rtree, vm_pindex_t index);
49 vm_page_t vm_radix_replace(struct vm_radix *rtree, vm_page_t newpage);
53 vm_radix_init(struct vm_radix *rtree) in vm_radix_init() argument
56 rtree->rt_root = 0; in vm_radix_init()
60 vm_radix_is_empty(struct vm_radix *rtree) in vm_radix_is_empty() argument
[all …]
H A Dvm_radix.c401 rnode = vm_radix_root_load(rtree, LOCKED); in vm_radix_insert()
406 parentp = (smrnode_t *)&rtree->rt_root; in vm_radix_insert()
467 rnode = vm_radix_root_load(rtree, LOCKED); in vm_radix_is_singleton()
485 rnode = vm_radix_root_load(rtree, access); in _vm_radix_lookup()
524 m = _vm_radix_lookup(rtree, index, SMR); in vm_radix_lookup_unlocked()
545 rnode = vm_radix_root_load(rtree, LOCKED); in vm_radix_lookup_ge()
657 rnode = vm_radix_root_load(rtree, LOCKED); in vm_radix_lookup_le()
767 rnode = vm_radix_root_load(rtree, LOCKED); in vm_radix_remove()
772 vm_radix_root_store(rtree, NULL, LOCKED); in vm_radix_remove()
829 root = vm_radix_root_load(rtree, LOCKED); in vm_radix_reclaim_allnodes()
[all …]
H A Dvm_page.c1501 mpred = vm_radix_lookup_le(&object->rtree, pindex); in vm_page_insert()
1546 if (vm_radix_insert(&object->rtree, m)) { in vm_page_insert_after()
1628 mrem = vm_radix_remove(&object->rtree, m->pindex); in vm_page_object_remove()
1698 return (vm_radix_lookup(&object->rtree, pindex)); in vm_page_lookup()
1727 m = vm_radix_lookup_unlocked(&object->rtree, pindex); in vm_page_relookup()
1781 m = vm_radix_lookup_ge(&object->rtree, pindex); in vm_page_find_least()
1857 mret = vm_radix_replace(&object->rtree, mnew); in vm_page_replace_hold()
1931 if (vm_radix_insert(&new_object->rtree, m)) { in vm_page_rename()
1981 vm_radix_lookup_le(&object->rtree, pindex) : NULL)); in vm_page_alloc()
2284 mpred = vm_radix_lookup_le(&object->rtree, pindex); in vm_page_alloc_contig_domain()
[all …]
H A Dvm_object.h106 struct vm_radix rtree; /* root of the resident page radix trie*/ member
H A Dvm_object.c188 KASSERT(vm_radix_is_empty(&object->rtree), in vm_object_zdtor()
219 vm_radix_init(&object->rtree); in vm_object_zinit()
911 vm_radix_reclaim_allnodes(&object->rtree); in vm_object_terminate_pages()
H A Dvm_kern.c475 mpred = vm_radix_lookup_le(&object->rtree, atop(offset + i)); in kmem_back_domain()
/f-stack/app/redis-5.0.5/deps/jemalloc/include/jemalloc/internal/
H A Drtree.h108 # 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 …]
/f-stack/app/redis-5.0.5/deps/jemalloc/src/
H A Drtree.c13 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 …]
/f-stack/app/redis-5.0.5/deps/jemalloc/
H A DMakefile.in115 $(srcroot)src/rtree.c \
200 $(srcroot)test/unit/rtree.c \
H A DChangeLog258 - 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