Home
last modified time | relevance | path

Searched refs:rbt_root (Results 1 – 14 of 14) sorted by relevance

/netbsd-src/common/lib/libc/gen/
H A Drb.c105 rbt->rbt_root = RB_SENTINEL_NODE; in rb_tree_init()
108 rbt->rbt_minmax[RB_DIR_LEFT] = rbt->rbt_root; /* minimum node */ in rb_tree_init()
109 rbt->rbt_minmax[RB_DIR_RIGHT] = rbt->rbt_root; /* maximum node */ in rb_tree_init()
127 struct rb_node *parent = rbt->rbt_root; in rb_tree_find_node()
146 struct rb_node *parent = rbt->rbt_root, *last = NULL; in rb_tree_find_node_geq()
167 struct rb_node *parent = rbt->rbt_root, *last = NULL; in rb_tree_find_node_leq()
194 tmp = rbt->rbt_root; in rb_tree_insert_node()
202 parent = (struct rb_node *)(void *)&rbt->rbt_root; in rb_tree_insert_node()
229 else if (tmp != rbt->rbt_root) in rb_tree_insert_node()
255 if (__predict_false(parent == (struct rb_node *)(void *)&rbt->rbt_root)) { in rb_tree_insert_node()
[all …]
/netbsd-src/external/gpl3/gcc/dist/gcc/config/rs6000/
H A Drbtree.cc33 t->rbt_root = t->rbt_nil; in rbt_new()
67 t->rbt_root = right; in rbt_left_rotate()
94 t->rbt_root = left; in rbt_right_rotate()
110 struct rbt_string_node *curr = t->rbt_root; in rbt_insert()
129 t->rbt_root = fresh; in rbt_insert()
195 t->rbt_root->color = RBT_BLACK; in rbt_insert()
203 struct rbt_string_node *curr = t->rbt_root; in rbt_find()
H A Drbtree.h44 struct rbt_string_node *rbt_root; member
H A Drs6000-gen-builtins.cc1977 rbt_inorder_callback (&bifo_rbt, bifo_rbt.rbt_root, set_bif_order); in create_bif_order()
2833 rbt_inorder_callback (&fntype_rbt, fntype_rbt.rbt_root, write_fntype_init); in write_init_file()
2975 rbt_dump (&bif_rbt, bif_rbt.rbt_root); in main()
2993 rbt_dump (&fntype_rbt, fntype_rbt.rbt_root); in main()
/netbsd-src/external/bsd/libarchive/dist/libarchive/
H A Darchive_rb.c71 #define RB_ROOT_P(rbt, rb) ((rbt)->rbt_root == (rb))
99 *((struct archive_rb_node **)&rbt->rbt_root) = RB_SENTINEL_NODE; in __archive_rb_tree_init()
106 struct archive_rb_node *parent = rbt->rbt_root; in __archive_rb_tree_find_node()
122 struct archive_rb_node *parent = rbt->rbt_root; in __archive_rb_tree_find_node_geq()
141 struct archive_rb_node *parent = rbt->rbt_root; in __archive_rb_tree_find_node_leq()
165 tmp = rbt->rbt_root; in __archive_rb_tree_insert_node()
174 parent = (struct archive_rb_node *)(void *)&rbt->rbt_root; in __archive_rb_tree_insert_node()
198 if (parent == (struct archive_rb_node *)(void *)&rbt->rbt_root) { in __archive_rb_tree_insert_node()
344 RB_MARK_BLACK(rbt->rbt_root); in __archive_rb_tree_insert_rebalance()
681 self = rbt->rbt_root; in __archive_rb_tree_iterate()
H A Darchive_rb.h94 struct archive_rb_node *rbt_root; member
/netbsd-src/sys/external/bsd/drm2/include/linux/
H A Drbtree.h156 if ((node = root->rbr_tree.rbt_root) == NULL) in rb_first_postorder()
217 if ((root = to->rbr_tree.rbt_root) == NULL) in rb_move()
224 RB_SET_FATHER(root, (struct rb_node *)(void *)&to->rbr_tree.rbt_root); in rb_move()
/netbsd-src/sys/sys/
H A Drbtree.h85 #define RB_ROOT_P(rbt, rb) ((rbt)->rbt_root == (rb))
163 struct rb_node *rbt_root; member
/netbsd-src/sys/external/bsd/drm2/dist/drm/
H A Ddrm_mm.c440 struct rb_node *rb = mm->holes_addr.rbr_tree.rbt_root; in find_hole()
/netbsd-src/usr.bin/pmap/
H A Dpmap.c279 root = (struct vm_map_entry *)D(vm_map, vm_map)->rb_tree.rbt_root; in dump_vm_map_tree()
/netbsd-src/sys/kern/
H A Dvfs_cache.c432 struct rb_node *node = dvi->vi_nc_tree.rbt_root; in cache_lookup_entry()
/netbsd-src/lib/libc/stdlib/
H A Djemalloc.c1842 rb_node_t *node = arena->chunks.rbt_root; in arena_run_alloc()
/netbsd-src/sys/arch/x86/x86/
H A Dpmap.c2217 for (node = tree->rbt_root;;) {
2273 KASSERT(!RB_SENTINEL_P(tree->rbt_root));
/netbsd-src/sys/uvm/
H A Duvm_map.c316 ((struct vm_map_entry *)(map)->rb_tree.rbt_root)