Lines Matching refs:rbr_tree
40 struct rb_tree rbr_tree; member
71 return RB_TREE_MIN(__UNCONST(&root->rbr_tree)) == NULL; in RB_EMPTY_ROOT()
77 char *vnode = RB_TREE_MIN(__UNCONST(&root->rbr_tree)); in rb_first()
80 vnode += root->rbr_tree.rbt_ops->rbto_node_offset; in rb_first()
89 vnode -= root->rbr_tree.rbt_ops->rbto_node_offset; in rb_next2()
90 vnode = RB_TREE_NEXT(__UNCONST(&root->rbr_tree), vnode); in rb_next2()
92 vnode += root->rbr_tree.rbt_ops->rbto_node_offset; in rb_next2()
99 char *vnode = RB_TREE_MAX(__UNCONST(&root->rbr_tree)); in rb_last()
102 vnode += root->rbr_tree.rbt_ops->rbto_node_offset; in rb_last()
115 struct rb_tree *tree = &root->rbr_tree; in rb_erase()
130 void *vold = (char *)old - root->rbr_tree.rbt_ops->rbto_node_offset; in rb_replace_node()
131 void *vnew = (char *)new - root->rbr_tree.rbt_ops->rbto_node_offset; in rb_replace_node()
134 rb_tree_remove_node(&root->rbr_tree, vold); in rb_replace_node()
135 collision = rb_tree_insert_node(&root->rbr_tree, vnew); in rb_replace_node()
156 if ((node = root->rbr_tree.rbt_root) == NULL) in rb_first_postorder()
179 if (RB_ROOT_P(&root->rbr_tree, node)) in rb_next2_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()