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 *,
86 	const struct rb_node *, const unsigned int);
87 static bool rb_tree_check_node(const struct rb_tree *, const struct rb_node *,
88 	const struct rb_node *, bool);
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()
188 	struct rb_node *parent, *tmp, *self = RB_ITEMTONODE(rbto, object);  in rb_tree_insert_node()
202 	parent = (struct rb_node *)(void *)&rbt->rbt_root;  in rb_tree_insert_node()
225 		struct rb_node *prev = NULL, *next = NULL;  in rb_tree_insert_node()
255 	if (__predict_false(parent == (struct rb_node *)(void *)&rbt->rbt_root)) {  in rb_tree_insert_node()
329 	struct rb_node *old_father, const unsigned int which)  in rb_tree_reparent_nodes()
332 	struct rb_node * const grandpa = RB_FATHER(old_father);  in rb_tree_reparent_nodes()
333 	struct rb_node * const old_child = old_father->rb_nodes[which];  in rb_tree_reparent_nodes()
334 	struct rb_node * const new_father = old_child;  in rb_tree_reparent_nodes()
335 	struct rb_node * const new_child = old_father;  in rb_tree_reparent_nodes()
366 		struct rb_node tmp;  in rb_tree_reparent_nodes()
392 rb_tree_insert_rebalance(struct rb_tree *rbt, struct rb_node *self)  in rb_tree_insert_rebalance()
394 	struct rb_node * father = RB_FATHER(self);  in rb_tree_insert_rebalance()
395 	struct rb_node * grandpa = RB_FATHER(father);  in rb_tree_insert_rebalance()
396 	struct rb_node * uncle;  in rb_tree_insert_rebalance()
498 rb_tree_prune_node(struct rb_tree *rbt, struct rb_node *self, bool rebalance)  in rb_tree_prune_node()
501 	struct rb_node *father = RB_FATHER(self);  in rb_tree_prune_node()
550 rb_tree_swap_prune_and_rebalance(struct rb_tree *rbt, struct rb_node *self,  in rb_tree_swap_prune_and_rebalance()
551 	struct rb_node *standin)  in rb_tree_swap_prune_and_rebalance()
555 	struct rb_node *standin_son;  in rb_tree_swap_prune_and_rebalance()
556 	struct rb_node *standin_father = RB_FATHER(standin);  in rb_tree_swap_prune_and_rebalance()
703 rb_tree_prune_blackred_branch(struct rb_tree *rbt, struct rb_node *self,  in rb_tree_prune_blackred_branch()
706 	struct rb_node *father = RB_FATHER(self);  in rb_tree_prune_blackred_branch()
707 	struct rb_node *son = self->rb_nodes[which];  in rb_tree_prune_blackred_branch()
751 	struct rb_node *standin, *self = RB_ITEMTONODE(rbto, object);  in rb_tree_remove_node()
813 rb_tree_removal_rebalance(struct rb_tree *rbt, struct rb_node *parent,  in rb_tree_removal_rebalance()
823 		struct rb_node *brother = parent->rb_nodes[other];  in rb_tree_removal_rebalance()
968 	struct rb_node *self;  in rb_tree_iterate()
1013 static const struct rb_node *
1014 rb_tree_iterate_const(const struct rb_tree *rbt, const struct rb_node *self,  in rb_tree_iterate_const()
1060 rb_tree_count_black(const struct rb_node *self)  in rb_tree_count_black()
1076 rb_tree_check_node(const struct rb_tree *rbt, const struct rb_node *self,  in rb_tree_check_node()
1077 	const struct rb_node *prev, bool red_check)  in rb_tree_check_node()
1093 		KASSERT(RB_FATHER(self) == (const struct rb_node *) &rbt->rbt_root);  in rb_tree_check_node()
1114 		const struct rb_node *prev0 = rb_tree_iterate_const(rbt, self, RB_DIR_LEFT);  in rb_tree_check_node()
1115 		const struct rb_node *next0 = rb_tree_iterate_const(rbt, self, RB_DIR_RIGHT);  in rb_tree_check_node()
1132 			const struct rb_node *brother;  in rb_tree_check_node()
1189 				const struct rb_node *relative0, *relative;  in rb_tree_check_node()
1261 			const struct rb_node *prev0;  in rb_tree_check_node()
1262 			const struct rb_node *next0;  in rb_tree_check_node()
1280 	const struct rb_node *self;  in rb_tree_check()
1281 	const struct rb_node *prev;  in rb_tree_check()
1322 rb_tree_mark_depth(const struct rb_tree *rbt, const struct rb_node *self,  in rb_tree_mark_depth()