| /src/sys/external/bsd/drm2/include/drm/ |
| drm_vma_manager.h | 55 struct rb_tree vom_nodes;
63 struct rb_tree von_files;
|
| /src/common/lib/libc/gen/ |
| rbtree.c | 90 static void rb_tree_insert_rebalance(struct rb_tree *, struct rb_node *);
91 static void rb_tree_removal_rebalance(struct rb_tree *, struct rb_node *,
94 static const struct rb_node *rb_tree_iterate_const(const struct rb_tree *,
96 static bool rb_tree_check_node(const struct rb_tree *, const struct rb_node *,
110 rb_tree_init(struct rb_tree *rbt, const rb_tree_ops_t *ops)
132 rb_tree_find_node(struct rb_tree *rbt, const void *key)
151 rb_tree_find_node_geq(struct rb_tree *rbt, const void *key)
172 rb_tree_find_node_leq(struct rb_tree *rbt, const void *key)
193 rb_tree_insert_node(struct rb_tree *rbt, void *object)
337 rb_tree_reparent_nodes(__rbt_unused struct rb_tree *rbt
[all...] |
| /src/sys/external/bsd/drm2/include/linux/ |
| ww_mutex.h | 81 struct rb_tree wwm_waiters;
|
| xarray.h | 46 struct rb_tree xa_tree;
|
| rbtree.h | 40 struct rb_tree rbr_tree;
115 struct rb_tree *tree = &root->rbr_tree;
|
| /src/sys/uvm/ |
| uvm_physseg.c | 127 struct rb_tree rb_tree; /* Tree for entries */ member in struct:uvm_physseg_graph
285 RB_TREE_FOREACH(current_ps, &(uvm_physseg_graph.rb_tree)) {
338 * now insert us in the proper place in uvm_physseg_graph.rb_tree
341 current_ps = rb_tree_insert_node(&(uvm_physseg_graph.rb_tree), ps);
417 rb_tree_init(&(uvm_physseg_graph.rb_tree), &uvm_physseg_tree_ops);
428 return (uvm_physseg_t) rb_tree_iterate(&(uvm_physseg_graph.rb_tree), upm,
439 return (uvm_physseg_t) rb_tree_iterate(&(uvm_physseg_graph.rb_tree), upm,
446 return (uvm_physseg_t) RB_TREE_MAX(&(uvm_physseg_graph.rb_tree));
452 return (uvm_physseg_t) RB_TREE_MIN(&(uvm_physseg_graph.rb_tree));
[all...] |
| uvm_map.h | 219 struct rb_tree rb_tree; /* Tree for entries */ member in struct:vm_map
|
| uvm_map.c | 316 ((struct vm_map_entry *)(map)->rb_tree.rbt_root)
447 ret = rb_tree_insert_node(&map->rb_tree, entry);
477 rb_tree_remove_node(&map->rb_tree, entry);
615 trtmp = rb_tree_iterate(&map->rb_tree, tmp, RB_DIR_LEFT);
623 trtmp = rb_tree_iterate(&map->rb_tree, tmp, RB_DIR_RIGHT);
631 trtmp = rb_tree_find_node(&map->rb_tree, &tmp->start);
4823 rb_tree_init(&map->rb_tree, &uvm_map_tree_ops);
|
| /src/sys/external/bsd/drm2/dist/drm/nouveau/include/nvkm/subdev/ |
| mmu.h | 43 struct rb_tree free;
44 struct rb_tree root;
|
| /src/sys/ufs/chfs/ |
| chfs_inode.h | 94 struct rb_tree fragtree; /* fragtree of inode */
|
| chfs.h | 219 struct rb_tree tdi_root; /* root of the rb tree */
243 frag_first(struct rb_tree *tree)
254 frag_last(struct rb_tree *tree)
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);
|
| 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,
519 struct rb_tree *fragtree,
611 chfs_remove_frags_of_node(struct chfs_mount *chmp, struct rb_tree *fragtree,
638 chfs_kill_fragtree(struct chfs_mount *chmp, struct rb_tree *fragtree)
656 struct rb_tree *fragtree, uint32_t size)
888 struct rb_tree ver_tree; /* version tree, used only temporary */
|
| /src/sys/sys/ |
| rbtree.h | 170 typedef struct rb_tree { struct
197 0*sizeof(&(t) - (struct rb_tree *)0)
|
| /src/sys/fs/udf/ |
| udf.h | 346 struct rb_tree udf_node_tree;
|
| /src/common/lib/libprop/ |
| prop_number.c | 156 static struct rb_tree _prop_number_tree;
|
| prop_string.c | 128 static struct rb_tree _prop_string_tree;
|
| prop_dictionary.c | 217 static struct rb_tree _prop_dict_keysym_tree;
|
| /src/sys/kern/ |
| sys_futex.c | 220 struct rb_tree va;
221 struct rb_tree oa;
|
| /src/usr.bin/pmap/ |
| pmap.c | 279 root = (struct vm_map_entry *)D(vm_map, vm_map)->rb_tree.rbt_root;
|
