rtree (definition) in projects: freebsd

Project(s)

Full Search
Definition
Symbol
File Path
History
Type

Searched defs:rtree (Results 1 – 4 of 4) sorted by relevance

/freebsd/sys/vm/
H A D	vm_radix.h	48 vm_radix_init(struct vm_radix rtree) in vm_radix_init() 54 vm_radix_is_empty(struct vm_radix rtree) in vm_radix_is_empty() 67 vm_radix_insert(struct vm_radix rtree, vm_page_t page) in vm_radix_insert() 88 vm_radix_lookup(struct vm_radix rtree, vm_pindex_t index) in vm_radix_lookup() 99 vm_radix_lookup_unlocked(struct vm_radix rtree, vm_pindex_t index) in vm_radix_lookup_unlocked() 109 vm_radix_lookup_range_unlocked(struct vm_radix rtree, vm_pindex_t index, in vm_radix_lookup_range_unlocked() 131 vm_radix_iter_init(struct pctrie_iter pages, struct vm_radix rtree) in vm_radix_iter_init() 140 vm_radix_iter_limit_init(struct pctrie_iter pages, struct vm_radix rtree, in vm_radix_iter_limit_init() 177 vm_radix_lookup_ge(struct vm_radix rtree, vm_pindex_t index) in vm_radix_lookup_ge() 189 vm_radix_lookup_le(struct vm_radix rtree, vm_pindex_t index) in vm_radix_lookup_le() [all …]
H A D	vm_object.h	`101 struct vm_radix rtree; /* root of the resident page radix trie*/ member`
/freebsd/contrib/jemalloc/src/
H A D	rtree.c	31 rtree_node_alloc(tsdn_t tsdn, rtree_t rtree, size_t nelms) { in rtree_node_alloc_impl() argument 38 return (rtree_leaf_elm_t )base_alloc(tsdn, rtree->base, in rtree_node_dalloc_impl() argument 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/contrib/jemalloc/include/jemalloc/internal/
H A D	rtree.h	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...]