Home
last modified time | relevance | path

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

/freebsd/contrib/jemalloc/include/jemalloc/internal/
H A Drtree.h128 # error Unsupported rtree height
132 bool rtree_new(rtree_t *rtree, base_t *base, bool zeroed); in rtree_leafkey()
134 rtree_leaf_elm_t *rtree_leaf_elm_lookup_hard(tsdn_t *tsdn, rtree_t *rtree, in rtree_leafkey()
172 * because the rtree update became visible in memory before the
175 * dependent on a previous rtree write, which means a stale read in rtree_leaf_elm_bits_read()
180 rtree_leaf_elm_bits_read(tsdn_t *tsdn, rtree_t *rtree, in rtree_leaf_elm_bits_extent_get()
239 rtree_leaf_elm_read(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm, in rtree_leaf_elm_slab_read()
242 uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent); in rtree_leaf_elm_slab_read()
282 rtree_leaf_elm_write_commit(tsdn_t *tsdn, rtree_t *rtree, in rtree_leaf_elm_slab_write()
297 rtree_leaf_elm_write(tsdn_t *tsdn, rtree_t *rtree, in rtree_leaf_elm_write()
173 rtree_leaf_elm_bits_read(tsdn_t * tsdn,rtree_t * rtree,rtree_leaf_elm_t * elm,bool dependent) rtree_leaf_elm_bits_read() argument
211 rtree_leaf_elm_extent_read(tsdn_t * tsdn,rtree_t * rtree,rtree_leaf_elm_t * elm,bool dependent) rtree_leaf_elm_extent_read() argument
224 rtree_leaf_elm_szind_read(tsdn_t * tsdn,rtree_t * rtree,rtree_leaf_elm_t * elm,bool dependent) rtree_leaf_elm_szind_read() argument
236 rtree_leaf_elm_slab_read(tsdn_t * tsdn,rtree_t * rtree,rtree_leaf_elm_t * elm,bool dependent) rtree_leaf_elm_slab_read() argument
248 rtree_leaf_elm_extent_write(tsdn_t * tsdn,rtree_t * rtree,rtree_leaf_elm_t * elm,extent_t * extent) rtree_leaf_elm_extent_write() argument
262 rtree_leaf_elm_szind_write(tsdn_t * tsdn,rtree_t * rtree,rtree_leaf_elm_t * elm,szind_t szind) rtree_leaf_elm_szind_write() argument
280 rtree_leaf_elm_slab_write(tsdn_t * tsdn,rtree_t * rtree,rtree_leaf_elm_t * elm,bool slab) rtree_leaf_elm_slab_write() argument
295 rtree_leaf_elm_write(tsdn_t * tsdn,rtree_t * rtree,rtree_leaf_elm_t * elm,extent_t * extent,szind_t szind,bool slab) rtree_leaf_elm_write() argument
314 rtree_leaf_elm_szind_slab_update(tsdn_t * tsdn,rtree_t * rtree,rtree_leaf_elm_t * elm,szind_t szind,bool slab) rtree_leaf_elm_szind_slab_update() argument
327 rtree_leaf_elm_lookup(tsdn_t * tsdn,rtree_t * rtree,rtree_ctx_t * rtree_ctx,uintptr_t key,bool dependent,bool init_missing) rtree_leaf_elm_lookup() argument
386 rtree_write(tsdn_t * tsdn,rtree_t * rtree,rtree_ctx_t * rtree_ctx,uintptr_t key,extent_t * extent,szind_t szind,bool slab) rtree_write() argument
404 rtree_read(tsdn_t * tsdn,rtree_t * rtree,rtree_ctx_t * rtree_ctx,uintptr_t key,bool dependent) rtree_read() argument
416 rtree_extent_read(tsdn_t * tsdn,rtree_t * rtree,rtree_ctx_t * rtree_ctx,uintptr_t key,bool dependent) rtree_extent_read() argument
427 rtree_szind_read(tsdn_t * tsdn,rtree_t * rtree,rtree_ctx_t * rtree_ctx,uintptr_t key,bool dependent) rtree_szind_read() argument
443 rtree_extent_szind_read(tsdn_t * tsdn,rtree_t * rtree,rtree_ctx_t * rtree_ctx,uintptr_t key,bool dependent,extent_t ** r_extent,szind_t * r_szind) rtree_extent_szind_read() argument
463 rtree_szind_slab_read_fast(tsdn_t * tsdn,rtree_t * rtree,rtree_ctx_t * rtree_ctx,uintptr_t key,szind_t * r_szind,bool * r_slab) rtree_szind_slab_read_fast() argument
492 rtree_szind_slab_read(tsdn_t * tsdn,rtree_t * rtree,rtree_ctx_t * rtree_ctx,uintptr_t key,bool dependent,szind_t * r_szind,bool * r_slab) rtree_szind_slab_read() argument
511 rtree_szind_slab_update(tsdn_t * tsdn,rtree_t * rtree,rtree_ctx_t * rtree_ctx,uintptr_t key,szind_t szind,bool slab) rtree_szind_slab_update() argument
520 rtree_clear(tsdn_t * tsdn,rtree_t * rtree,rtree_ctx_t * rtree_ctx,uintptr_t key) rtree_clear() argument
[all...]
/freebsd/sys/vm/
H A Dvm_radix.h48 vm_radix_init(struct vm_radix *rtree) in vm_radix_init() argument
50 pctrie_init(&rtree->rt_trie); in vm_radix_init()
54 vm_radix_is_empty(struct vm_radix *rtree) in vm_radix_is_empty() argument
56 return (pctrie_is_empty(&rtree->rt_trie)); in vm_radix_is_empty()
67 vm_radix_insert(struct vm_radix *rtree, vm_page_t page) in vm_radix_insert() argument
69 return (VM_RADIX_PCTRIE_INSERT(&rtree->rt_trie, page)); in vm_radix_insert()
88 vm_radix_lookup(struct vm_radix *rtree, vm_pindex_t index) in vm_radix_lookup() argument
90 return (VM_RADIX_PCTRIE_LOOKUP(&rtree->rt_trie, index)); in vm_radix_lookup()
99 vm_radix_lookup_unlocked(struct vm_radix *rtree, vm_pindex_t index) in vm_radix_lookup_unlocked() argument
101 return (VM_RADIX_PCTRIE_LOOKUP_UNLOCKED(&rtree->rt_trie, index)); in vm_radix_lookup_unlocked()
[all …]
H A Dvm_object.c181 KASSERT(vm_radix_is_empty(&object->rtree), in vm_object_zdtor()
215 vm_radix_init(&object->rtree); in vm_object_zinit()
278 vm_radix_init(&kernel_object->rtree); in vm_object_init()
331 if (!vm_radix_is_empty(&object->rtree)) in vm_object_set_memattr()
914 vm_radix_reclaim_callback(&object->rtree, in vm_object_terminate_pages()
H A Dvm_object.h101 struct vm_radix rtree; /* root of the resident page radix trie*/ member
H A Dvm_page.c1517 error = vm_radix_insert(&object->rtree, m); in vm_page_insert_lookup()
1731 mrem = vm_radix_remove(&m->object->rtree, m->pindex); in vm_page_radix_remove()
1764 return (vm_radix_lookup(&object->rtree, pindex)); in vm_page_lookup()
1776 vm_radix_iter_init(pages, &object->rtree); in vm_page_iter_init()
1789 vm_radix_iter_limit_init(pages, &object->rtree, limit); in vm_page_iter_limit_init()
1804 return (vm_radix_lookup_unlocked(&object->rtree, pindex)); in vm_page_lookup_unlocked()
1889 mret = vm_radix_replace(&object->rtree, mnew); in vm_page_replace_hold()
1957 if (vm_radix_insert(&new_object->rtree, m) != 0) { in vm_page_iter_rename()
5282 num_fetched = vm_radix_lookup_range_unlocked(&object->rtree, pindex, in vm_page_grab_pages_unlocked()
/freebsd/contrib/jemalloc/src/
H A Drtree.c12 rtree_new(rtree_t *rtree, base_t *base, bool zeroed) {
15 memset(rtree, 0, sizeof(rtree_t)); /* Clear root. */ in rtree_new()
20 rtree->base = base; in rtree_new()
22 if (malloc_mutex_init(&rtree->init_lock, "rtree", WITNESS_RANK_RTREE, in rtree_new()
31 rtree_node_alloc(tsdn_t *tsdn, rtree_t *rtree, size_t nelms) { in rtree_node_alloc_impl() argument
32 return (rtree_node_elm_t *)base_alloc(tsdn, rtree->base, in rtree_node_alloc_impl()
37 rtree_leaf_alloc(tsdn_t *tsdn, rtree_t *rtree, size_t nelms) {
38 return (rtree_leaf_elm_t *)base_alloc(tsdn, rtree->base, in rtree_node_dalloc_impl() argument
43 rtree_node_init(tsdn_t *tsdn, rtree_t *rtree, unsigne
13 rtree_new(rtree_t * rtree,bool zeroed) rtree_new() argument
46 rtree_leaf_alloc_impl(tsdn_t * tsdn,rtree_t * rtree,size_t nelms) rtree_leaf_alloc_impl() argument
53 rtree_leaf_dalloc_impl(tsdn_t * tsdn,rtree_t * rtree,rtree_leaf_elm_t * leaf) rtree_leaf_dalloc_impl() argument
63 rtree_delete_subtree(tsdn_t * tsdn,rtree_t * rtree,rtree_node_elm_t * subtree,unsigned level) rtree_delete_subtree() argument
94 rtree_delete(tsdn_t * tsdn,rtree_t * rtree) rtree_delete() argument
102 rtree_node_init(tsdn_t * tsdn,rtree_t * rtree,unsigned level,atomic_p_t * elmp) rtree_node_init() argument
129 rtree_leaf_init(tsdn_t * tsdn,rtree_t * rtree,atomic_p_t * elmp) rtree_leaf_init() argument
181 rtree_child_node_read(tsdn_t * tsdn,rtree_t * rtree,rtree_node_elm_t * elm,unsigned level,bool dependent) rtree_child_node_read() argument
210 rtree_child_leaf_read(tsdn_t * tsdn,rtree_t * rtree,rtree_node_elm_t * elm,unsigned level,bool dependent) rtree_child_leaf_read() argument
223 rtree_leaf_elm_lookup_hard(tsdn_t * tsdn,rtree_t * rtree,rtree_ctx_t * rtree_ctx,uintptr_t key,bool dependent,bool init_missing) rtree_leaf_elm_lookup_hard() argument
[all...]
/freebsd/sys/kern/
H A Dkern_kexec.c247 vm_radix_remove(&new_segments->rtree, otheridx); in kern_kexec_load()
248 vm_radix_remove(&new_segments->rtree, i); in kern_kexec_load()
251 vm_radix_insert(&new_segments->rtree, curpg); in kern_kexec_load()
252 vm_radix_insert(&new_segments->rtree, otherpg); in kern_kexec_load()
260 vm_radix_lookup(&new_segments->rtree, in kern_kexec_load()
265 vm_radix_lookup(&new_segments->rtree, in kern_kexec_load()
H A Dkern_proc.c2567 m = vm_radix_lookup_ge(&tobj->rtree, pindex); in kern_proc_vmmap_resident()
/freebsd/contrib/sqlite3/tea/
H A Dteaish.tcl11 all-flag-enables {fts3 fts4 fts5 rtree geopoly}
97 rtree => {Enable the RTREE extension}
234 geopoly -DSQLITE_ENABLE_GEOPOLY {proj-opt-set rtree}
235 rtree -DSQLITE_ENABLE_RTREE {}
/freebsd/lib/libc/stdlib/malloc/jemalloc/
H A DMakefile.inc6 prof.c rtree.c safety_check.c sc.c stats.c sz.c tcache.c \
/freebsd/sys/arm64/arm64/
H A Dkexec_support.c91 vm_radix_iter_init(&pct_i, &image->map_obj->rtree); in kexec_reboot_bottom()
/freebsd/sys/amd64/amd64/
H A Dkexec_support.c164 vm_radix_iter_init(&pct_iter, &image->map_obj->rtree); in kexec_load_md()
/freebsd/contrib/sqlite3/autosetup/
H A Dsqlite-config.tcl68 all-flag-enables {fts4 fts5 rtree geopoly session}
213 rtree => {Enable the RTREE extension}
762 geopoly -DSQLITE_ENABLE_GEOPOLY {proj-opt-set rtree}
763 rtree -DSQLITE_ENABLE_RTREE {}
/freebsd/contrib/jemalloc/
H A DMakefile.in147 $(srcroot)src/rtree.c \
268 $(srcroot)test/unit/rtree.c \
H A DChangeLog494 - Extensively optimize rtree via various methods:
495 + Add multiple layers of rtree lookup caching, since rtree lookups are now
497 + Determine rtree layout at compile time. (@jasone)
499 + Embed the root node in the top-level rtree data structure, thus avoiding
720 - Streamline fast paths of rtree operations. (@jasone)
1019 - Refactor rtree (radix tree for chunk lookups) to be lock-free, and make