HomeSort by: relevance | last modified time | path
    Searched refs:rbt_root (Results 1 - 9 of 9) sorted by relevancy

  /src/common/lib/libc/gen/
rbtree.c 114 rbt->rbt_root = RB_SENTINEL_NODE;
117 rbt->rbt_minmax[RB_DIR_LEFT] = rbt->rbt_root; /* minimum node */
118 rbt->rbt_minmax[RB_DIR_RIGHT] = rbt->rbt_root; /* maximum node */
136 struct rb_node *parent = rbt->rbt_root;
155 struct rb_node *parent = rbt->rbt_root, *last = NULL;
176 struct rb_node *parent = rbt->rbt_root, *last = NULL;
203 tmp = rbt->rbt_root;
205 * This is a hack. Because rbt->rbt_root is just a struct rb_node *,
209 * update rbt->rbt_root.
211 parent = (struct rb_node *)(void *)&rbt->rbt_root;
    [all...]
  /src/sys/external/bsd/drm2/include/linux/
rbtree.h 156 if ((node = root->rbr_tree.rbt_root) == NULL)
217 if ((root = to->rbr_tree.rbt_root) == NULL)
224 RB_SET_FATHER(root, (struct rb_node *)(void *)&to->rbr_tree.rbt_root);
  /src/sys/sys/
rbtree.h 93 #define RB_ROOT_P(rbt, rb) ((rbt)->rbt_root == (rb))
171 struct rb_node *rbt_root; member in struct:rb_tree
  /src/sys/external/bsd/drm2/dist/drm/
drm_mm.c 440 struct rb_node *rb = mm->holes_addr.rbr_tree.rbt_root;
  /src/sys/kern/
vfs_cache.c 432 struct rb_node *node = dvi->vi_nc_tree.rbt_root;
  /src/usr.bin/pmap/
pmap.c 279 root = (struct vm_map_entry *)D(vm_map, vm_map)->rb_tree.rbt_root;
  /src/lib/libc/stdlib/
jemalloc.c 1842 rb_node_t *node = arena->chunks.rbt_root;
  /src/sys/arch/x86/x86/
pmap.c 2217 for (node = tree->rbt_root;;) {
2273 KASSERT(!RB_SENTINEL_P(tree->rbt_root));
  /src/sys/uvm/
uvm_map.c 316 ((struct vm_map_entry *)(map)->rb_tree.rbt_root)

Completed in 28 milliseconds