Symbol: rb_tree
common/lib/libc/gen/rbtree.c
1023
rb_tree_iterate_const(const struct rb_tree *rbt, const struct rb_node *self,
common/lib/libc/gen/rbtree.c
1085
rb_tree_check_node(const struct rb_tree *rbt, const struct rb_node *self,
common/lib/libc/gen/rbtree.c
110
rb_tree_init(struct rb_tree *rbt, const rb_tree_ops_t *ops)
common/lib/libc/gen/rbtree.c
1287
rb_tree_check(const struct rb_tree *rbt, bool red_check)
common/lib/libc/gen/rbtree.c
132
rb_tree_find_node(struct rb_tree *rbt, const void *key)
common/lib/libc/gen/rbtree.c
1331
rb_tree_mark_depth(const struct rb_tree *rbt, const struct rb_node *self,
common/lib/libc/gen/rbtree.c
1352
rb_tree_depths(const struct rb_tree *rbt, size_t *depths)
common/lib/libc/gen/rbtree.c
151
rb_tree_find_node_geq(struct rb_tree *rbt, const void *key)
common/lib/libc/gen/rbtree.c
172
rb_tree_find_node_leq(struct rb_tree *rbt, const void *key)
common/lib/libc/gen/rbtree.c
193
rb_tree_insert_node(struct rb_tree *rbt, void *object)
common/lib/libc/gen/rbtree.c
337
rb_tree_reparent_nodes(__rbt_unused struct rb_tree *rbt,
common/lib/libc/gen/rbtree.c
401
rb_tree_insert_rebalance(struct rb_tree *rbt, struct rb_node *self)
common/lib/libc/gen/rbtree.c
507
rb_tree_prune_node(struct rb_tree *rbt, struct rb_node *self, bool rebalance)
common/lib/libc/gen/rbtree.c
559
rb_tree_swap_prune_and_rebalance(struct rb_tree *rbt, struct rb_node *self,
common/lib/libc/gen/rbtree.c
712
rb_tree_prune_blackred_branch(struct rb_tree *rbt, struct rb_node *self,
common/lib/libc/gen/rbtree.c
757
rb_tree_remove_node(struct rb_tree *rbt, void *object)
common/lib/libc/gen/rbtree.c
822
rb_tree_removal_rebalance(struct rb_tree *rbt, struct rb_node *parent,
common/lib/libc/gen/rbtree.c
90
static void rb_tree_insert_rebalance(struct rb_tree *, struct rb_node *);
common/lib/libc/gen/rbtree.c
91
static void rb_tree_removal_rebalance(struct rb_tree *, struct rb_node *,
common/lib/libc/gen/rbtree.c
94
static const struct rb_node *rb_tree_iterate_const(const struct rb_tree *,
common/lib/libc/gen/rbtree.c
96
static bool rb_tree_check_node(const struct rb_tree *, const struct rb_node *,
common/lib/libc/gen/rbtree.c
973
rb_tree_iterate(struct rb_tree *rbt, void *object, const unsigned int direction)
common/lib/libprop/prop_dictionary.c
217
static struct rb_tree _prop_dict_keysym_tree;
common/lib/libprop/prop_number.c
156
static struct rb_tree _prop_number_tree;
common/lib/libprop/prop_string.c
128
static struct rb_tree _prop_string_tree;
sys/arch/m68k/include/pmap_68k.h
102
struct rb_tree pm_tables; /* lev1map not in here */
sys/fs/udf/udf.h
346
struct rb_tree udf_node_tree;
sys/kern/sys_futex.c
220
struct rb_tree va;
sys/kern/sys_futex.c
221
struct rb_tree oa;
sys/sys/rbtree.h
197
0*sizeof(&(t) - (struct rb_tree *)0)
sys/ufs/chfs/chfs.h
219
struct rb_tree tdi_root; /* root of the rb tree */
sys/ufs/chfs/chfs.h
243
frag_first(struct rb_tree *tree)
sys/ufs/chfs/chfs.h
254
frag_last(struct rb_tree *tree)
sys/ufs/chfs/chfs.h
560
void chfs_remove_frags_of_node(struct chfs_mount *, struct rb_tree *,
sys/ufs/chfs/chfs.h
562
void chfs_kill_fragtree(struct chfs_mount *, struct rb_tree *);
sys/ufs/chfs/chfs.h
564
struct rb_tree *, uint32_t);
sys/ufs/chfs/chfs_inode.h
94
struct rb_tree fragtree; /* fragtree of inode */
sys/ufs/chfs/chfs_readinode.c
492
no_overlapping_node(struct rb_tree *fragtree,
sys/ufs/chfs/chfs_readinode.c
519
struct rb_tree *fragtree,
sys/ufs/chfs/chfs_readinode.c
61
int no_overlapping_node(struct rb_tree *, struct chfs_node_frag *,
sys/ufs/chfs/chfs_readinode.c
611
chfs_remove_frags_of_node(struct chfs_mount *chmp, struct rb_tree *fragtree,
sys/ufs/chfs/chfs_readinode.c
638
chfs_kill_fragtree(struct chfs_mount *chmp, struct rb_tree *fragtree)
sys/ufs/chfs/chfs_readinode.c
64
struct rb_tree *,
sys/ufs/chfs/chfs_readinode.c
656
struct rb_tree *fragtree, uint32_t size)
sys/ufs/chfs/chfs_readinode.c
888
struct rb_tree ver_tree; /* version tree, used only temporary */
sys/uvm/uvm_map.c
316
((struct vm_map_entry *)(map)->rb_tree.rbt_root)
sys/uvm/uvm_map.c
447
ret = rb_tree_insert_node(&map->rb_tree, entry);
sys/uvm/uvm_map.c
477
rb_tree_remove_node(&map->rb_tree, entry);
sys/uvm/uvm_map.c
4823
rb_tree_init(&map->rb_tree, &uvm_map_tree_ops);
sys/uvm/uvm_map.c
615
trtmp = rb_tree_iterate(&map->rb_tree, tmp, RB_DIR_LEFT);
sys/uvm/uvm_map.c
623
trtmp = rb_tree_iterate(&map->rb_tree, tmp, RB_DIR_RIGHT);
sys/uvm/uvm_map.c
631
trtmp = rb_tree_find_node(&map->rb_tree, &tmp->start);
sys/uvm/uvm_map.h
219
struct rb_tree rb_tree; /* Tree for entries */
sys/uvm/uvm_physseg.c
127
struct rb_tree rb_tree; /* Tree for entries */
sys/uvm/uvm_physseg.c
1316
RB_TREE_FOREACH(current_ps, &(uvm_physseg_graph.rb_tree)) {
sys/uvm/uvm_physseg.c
1333
rb_tree_remove_node(&(uvm_physseg_graph.rb_tree), upm);
sys/uvm/uvm_physseg.c
1392
current_ps = rb_tree_insert_node(&(uvm_physseg_graph.rb_tree), ps);
sys/uvm/uvm_physseg.c
285
RB_TREE_FOREACH(current_ps, &(uvm_physseg_graph.rb_tree)) {
sys/uvm/uvm_physseg.c
341
current_ps = rb_tree_insert_node(&(uvm_physseg_graph.rb_tree), ps);
sys/uvm/uvm_physseg.c
417
rb_tree_init(&(uvm_physseg_graph.rb_tree), &uvm_physseg_tree_ops);
sys/uvm/uvm_physseg.c
428
return (uvm_physseg_t) rb_tree_iterate(&(uvm_physseg_graph.rb_tree), upm,
sys/uvm/uvm_physseg.c
439
return (uvm_physseg_t) rb_tree_iterate(&(uvm_physseg_graph.rb_tree), upm,
sys/uvm/uvm_physseg.c
446
return (uvm_physseg_t) RB_TREE_MAX(&(uvm_physseg_graph.rb_tree));
sys/uvm/uvm_physseg.c
452
return (uvm_physseg_t) RB_TREE_MIN(&(uvm_physseg_graph.rb_tree));
sys/uvm/uvm_physseg.c
459
(uvm_physseg_t) RB_TREE_MAX(&(uvm_physseg_graph.rb_tree));
sys/uvm/uvm_physseg.c
541
ps = rb_tree_find_node(&(uvm_physseg_graph.rb_tree), &pframe);
usr.bin/pmap/pmap.c
279
root = (struct vm_map_entry *)D(vm_map, vm_map)->rb_tree.rbt_root;