48 static void rb_tree_insert_rebalance(struct rb_tree *, struct rb_node *);
49 static void rb_tree_removal_rebalance(struct rb_tree *, struct rb_node *,
52 static const struct rb_node *rb_tree_iterate_const(const struct rb_tree *,
53 	const struct rb_node *, const unsigned int);
54 static bool rb_tree_check_node(const struct rb_tree *, const struct rb_node *,
55 	const struct rb_node *, bool);
94 	struct rb_node *parent = rbt->rbt_root;  in _prop_rb_tree_find()
113 	struct rb_node *parent, *tmp, *self = RB_ITEMTONODE(rbto, object);  in _prop_rb_tree_insert_node()
127 	parent = (struct rb_node *)(void *)&rbt->rbt_root;  in _prop_rb_tree_insert_node()
150 		struct rb_node *prev = NULL, *next = NULL;  in _prop_rb_tree_insert_node()
180 	if (__predict_false(parent == (struct rb_node *)(void *)&rbt->rbt_root)) {  in _prop_rb_tree_insert_node()
254 rb_tree_reparent_nodes(struct rb_tree *rbt, struct rb_node *old_father,  in rb_tree_reparent_nodes()
258 	struct rb_node * const grandpa = RB_FATHER(old_father);  in rb_tree_reparent_nodes()
259 	struct rb_node * const old_child = old_father->rb_nodes[which];  in rb_tree_reparent_nodes()
260 	struct rb_node * const new_father = old_child;  in rb_tree_reparent_nodes()
261 	struct rb_node * const new_child = old_father;  in rb_tree_reparent_nodes()
292 		struct rb_node tmp;  in rb_tree_reparent_nodes()
318 rb_tree_insert_rebalance(struct rb_tree *rbt, struct rb_node *self)  in rb_tree_insert_rebalance()
320 	struct rb_node * father = RB_FATHER(self);  in rb_tree_insert_rebalance()
321 	struct rb_node * grandpa = RB_FATHER(father);  in rb_tree_insert_rebalance()
322 	struct rb_node * uncle;  in rb_tree_insert_rebalance()
424 rb_tree_prune_node(struct rb_tree *rbt, struct rb_node *self, bool rebalance)  in rb_tree_prune_node()
427 	struct rb_node *father = RB_FATHER(self);  in rb_tree_prune_node()
476 rb_tree_swap_prune_and_rebalance(struct rb_tree *rbt, struct rb_node *self,  in rb_tree_swap_prune_and_rebalance()
477 	struct rb_node *standin)  in rb_tree_swap_prune_and_rebalance()
481 	struct rb_node *standin_son;  in rb_tree_swap_prune_and_rebalance()
482 	struct rb_node *standin_father = RB_FATHER(standin);  in rb_tree_swap_prune_and_rebalance()
629 rb_tree_prune_blackred_branch(struct rb_tree *rbt, struct rb_node *self,  in rb_tree_prune_blackred_branch()
632 	struct rb_node *father = RB_FATHER(self);  in rb_tree_prune_blackred_branch()
633 	struct rb_node *son = self->rb_nodes[which];  in rb_tree_prune_blackred_branch()
677 	struct rb_node *standin, *self = RB_ITEMTONODE(rbto, object);  in _prop_rb_tree_remove_node()
739 rb_tree_removal_rebalance(struct rb_tree *rbt, struct rb_node *parent,  in rb_tree_removal_rebalance()
749 		struct rb_node *brother = parent->rb_nodes[other];  in rb_tree_removal_rebalance()
894 	struct rb_node *self;  in _prop_rb_tree_iterate()
939 static const struct rb_node *
940 rb_tree_iterate_const(const struct rb_tree *rbt, const struct rb_node *self,  in rb_tree_iterate_const()
986 rb_tree_count_black(const struct rb_node *self)  in rb_tree_count_black()
1002 rb_tree_check_node(const struct rb_tree *rbt, const struct rb_node *self,  in rb_tree_check_node()
1003 	const struct rb_node *prev, bool red_check)  in rb_tree_check_node()
1019 		KASSERT(RB_FATHER(self) == (const struct rb_node *) &rbt->rbt_root);  in rb_tree_check_node()
1040 		const struct rb_node *prev0 = rb_tree_iterate_const(rbt, self, RB_DIR_LEFT);  in rb_tree_check_node()
1041 		const struct rb_node *next0 = rb_tree_iterate_const(rbt, self, RB_DIR_RIGHT);  in rb_tree_check_node()
1058 			const struct rb_node *brother;  in rb_tree_check_node()
1115 				const struct rb_node *relative0, *relative;  in rb_tree_check_node()
1187 			const struct rb_node *prev0;  in rb_tree_check_node()
1188 			const struct rb_node *next0;  in rb_tree_check_node()
1206 	const struct rb_node *self;  in rb_tree_check()
1207 	const struct rb_node *prev;  in rb_tree_check()
1248 rb_tree_mark_depth(const struct rb_tree *rbt, const struct rb_node *self,  in rb_tree_mark_depth()