| /netbsd-src/common/lib/libc/gen/ |
| H A D | rb.c | 81 static void rb_tree_insert_rebalance(struct rb_tree *, struct rb_node *);
82 static void rb_tree_removal_rebalance(struct rb_tree *, struct rb_node *,
85 static const struct rb_node *rb_tree_iterate_const(const struct rb_tree *,
87 static bool rb_tree_check_node(const struct rb_tree *, const struct rb_node *,
101 rb_tree_init(struct rb_tree *rbt, const rb_tree_ops_t *ops) in rb_tree_init()
123 rb_tree_find_node(struct rb_tree *rbt, const void *key) in rb_tree_find_node()
142 rb_tree_find_node_geq(struct rb_tree *rbt, const void *key) in rb_tree_find_node_geq()
163 rb_tree_find_node_leq(struct rb_tree *rbt, const void *key) in rb_tree_find_node_leq()
184 rb_tree_insert_node(struct rb_tree *rbt, void *object) in rb_tree_insert_node()
328 rb_tree_reparent_nodes(__rbt_unused struct rb_tree *rbt, in rb_tree_reparent_nodes()
[all …]
|
| /netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/ |
| H A D | rb_tree | 1 // rb_tree extension -*- C++ -*-
51 /** @file ext/rb_tree
67 // Class rb_tree is not part of the C++ standard. It is provided for
77 struct rb_tree
83 rb_tree(const _Compare& __comp = _Compare(),
87 ~rb_tree() { }
|
| /netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/ |
| H A D | rb_tree | 1 // rb_tree extension -*- C++ -*-
51 /** @file ext/rb_tree
67 // Class rb_tree is not part of the C++ standard. It is provided for
77 struct rb_tree
83 rb_tree(const _Compare& __comp = _Compare(),
87 ~rb_tree() { }
|
| /netbsd-src/sys/uvm/ |
| H A D | uvm_physseg.c | 127 struct rb_tree rb_tree; /* Tree for entries */ member
285 RB_TREE_FOREACH(current_ps, &(uvm_physseg_graph.rb_tree)) { in uvm_physseg_plug()
341 current_ps = rb_tree_insert_node(&(uvm_physseg_graph.rb_tree), ps); in uvm_physseg_plug()
417 rb_tree_init(&(uvm_physseg_graph.rb_tree), &uvm_physseg_tree_ops); in uvm_physseg_init()
428 return (uvm_physseg_t) rb_tree_iterate(&(uvm_physseg_graph.rb_tree), upm, in uvm_physseg_get_next()
439 return (uvm_physseg_t) rb_tree_iterate(&(uvm_physseg_graph.rb_tree), upm, in uvm_physseg_get_prev()
446 return (uvm_physseg_t) RB_TREE_MAX(&(uvm_physseg_graph.rb_tree)); in uvm_physseg_get_last()
452 return (uvm_physseg_t) RB_TREE_MIN(&(uvm_physseg_graph.rb_tree)); in uvm_physseg_get_first()
459 (uvm_physseg_t) RB_TREE_MAX(&(uvm_physseg_graph.rb_tree)); in uvm_physseg_get_highest_frame()
541 ps = rb_tree_find_node(&(uvm_physseg_graph.rb_tree), &pframe); in uvm_physseg_find()
[all …]
|
| H A D | uvm_map.h | 219 struct rb_tree rb_tree; /* Tree for entries */ member
|
| H A D | uvm_map.c | 316 ((struct vm_map_entry *)(map)->rb_tree.rbt_root)
447 ret = rb_tree_insert_node(&map->rb_tree, entry); in uvm_rb_insert()
477 rb_tree_remove_node(&map->rb_tree, entry); in uvm_rb_remove()
615 trtmp = rb_tree_iterate(&map->rb_tree, tmp, RB_DIR_LEFT); in _uvm_tree_sanity()
623 trtmp = rb_tree_iterate(&map->rb_tree, tmp, RB_DIR_RIGHT); in _uvm_tree_sanity()
631 trtmp = rb_tree_find_node(&map->rb_tree, &tmp->start);
4847 rb_tree_init(&map->rb_tree, &uvm_map_tree_ops); in uvm_map_reference()
|
| /netbsd-src/sys/ufs/chfs/ |
| H A D | chfs.h | 219 struct rb_tree tdi_root; /* root of the rb tree */
243 frag_first(struct rb_tree *tree) in frag_first()
254 frag_last(struct rb_tree *tree) in frag_last()
560 void chfs_remove_frags_of_node(struct chfs_mount *, struct rb_tree *,
562 void chfs_kill_fragtree(struct chfs_mount *, struct rb_tree *);
564 struct rb_tree *, uint32_t);
|
| H A D | chfs_readinode.c | 61 int no_overlapping_node(struct rb_tree *, struct chfs_node_frag *,
64 struct rb_tree *,
492 no_overlapping_node(struct rb_tree *fragtree, in no_overlapping_node()
519 struct rb_tree *fragtree, in chfs_add_frag_to_fragtree()
611 chfs_remove_frags_of_node(struct chfs_mount *chmp, struct rb_tree *fragtree, in chfs_remove_frags_of_node()
638 chfs_kill_fragtree(struct chfs_mount *chmp, struct rb_tree *fragtree) in chfs_kill_fragtree()
656 struct rb_tree *fragtree, uint32_t size) in chfs_truncate_fragtree()
888 struct rb_tree ver_tree; /* version tree, used only temporary */ in chfs_build_fragtree()
|
| H A D | chfs_inode.h | 94 struct rb_tree fragtree; /* fragtree of inode */
|
| /netbsd-src/sys/external/bsd/drm2/include/drm/ |
| H A D | drm_vma_manager.h | 55 struct rb_tree vom_nodes;
63 struct rb_tree von_files;
|
| /netbsd-src/sys/external/bsd/drm2/dist/drm/nouveau/include/nvkm/subdev/ |
| H A D | mmu.h | 43 struct rb_tree free;
44 struct rb_tree root;
|
| /netbsd-src/sys/external/bsd/drm2/include/linux/ |
| H A D | rbtree.h | 40 struct rb_tree rbr_tree;
115 struct rb_tree *tree = &root->rbr_tree; in rb_erase()
|
| H A D | xarray.h | 46 struct rb_tree xa_tree;
|
| H A D | ww_mutex.h | 81 struct rb_tree wwm_waiters;
|
| /netbsd-src/sys/sys/ |
| H A D | rbtree.h | 162 typedef struct rb_tree { struct
189 0*sizeof(&(t) - (struct rb_tree *)0) argument
|
| /netbsd-src/external/mit/xorg/lib/ |
| H A D | driver.old.mk | 22 rb_tree.c \
|
| H A D | driver.mk | 37 rb_tree.c \
|
| /netbsd-src/sys/fs/udf/ |
| H A D | udf.h | 346 struct rb_tree udf_node_tree;
|
| /netbsd-src/common/lib/libprop/ |
| H A D | prop_string.c | 123 static struct rb_tree _prop_string_tree;
|
| H A D | prop_number.c | 152 static struct rb_tree _prop_number_tree;
|
| H A D | prop_dictionary.c | 204 static struct rb_tree _prop_dict_keysym_tree;
|
| /netbsd-src/sys/kern/ |
| H A D | sys_futex.c | 219 struct rb_tree va;
220 struct rb_tree oa;
|
| /netbsd-src/usr.bin/pmap/ |
| H A D | pmap.c | 279 root = (struct vm_map_entry *)D(vm_map, vm_map)->rb_tree.rbt_root; in dump_vm_map_tree()
|
| /netbsd-src/external/gpl3/gcc.old/lib/libstdc++-v3/arch/or1k/ |
| H A D | defs.mk | 40 …ic_traits.h ext/pod_char_traits.h ext/pointer.h ext/pool_allocator.h ext/rb_tree ext/random ext/ra…
|
| /netbsd-src/external/gpl3/gcc.old/lib/libstdc++-v3/arch/coldfire/ |
| H A D | defs.mk | 41 …ic_traits.h ext/pod_char_traits.h ext/pointer.h ext/pool_allocator.h ext/rb_tree ext/random ext/ra…
|