47 static inline void rb_set_black(struct rb_node *rb)  in rb_set_black()
52 static inline struct rb_node *rb_red_parent(struct rb_node *red)  in rb_red_parent()
54 	return (struct rb_node *)red->__rb_parent_color;  in rb_red_parent()
63 __rb_rotate_set_parents(struct rb_node *old, struct rb_node *new,  in __rb_rotate_set_parents()
66 	struct rb_node *parent = rb_parent(old);  in __rb_rotate_set_parents()
73 __rb_insert(struct rb_node *node, struct rb_root *root,  in __rb_insert()
74 	    void (*augment_rotate)(struct rb_node *old, struct rb_node *new))  in __rb_insert()
76 	struct rb_node *parent = rb_red_parent(node), *gparent, *tmp;  in __rb_insert()
202 ____rb_erase_color(struct rb_node *parent, struct rb_root *root,  in ____rb_erase_color()
203 	void (*augment_rotate)(struct rb_node *old, struct rb_node *new))  in ____rb_erase_color()
205 	struct rb_node *node = NULL, *sibling, *tmp1, *tmp2;  in ____rb_erase_color()
364 void __rb_erase_color(struct rb_node *parent, struct rb_root *root,  in __rb_erase_color()
365 	void (*augment_rotate)(struct rb_node *old, struct rb_node *new))  in __rb_erase_color()
378 static inline void dummy_propagate(struct rb_node *node, struct rb_node *stop) {}  in dummy_propagate()
379 static inline void dummy_copy(struct rb_node *old, struct rb_node *new) {}  in dummy_copy()
380 static inline void dummy_rotate(struct rb_node *old, struct rb_node *new) {}  in dummy_rotate()
386 void rb_insert_color(struct rb_node *node, struct rb_root *root)  in rb_insert_color()
392 void rb_erase(struct rb_node *node, struct rb_root *root)  in rb_erase()
394 	struct rb_node *rebalance;  in rb_erase()
408 void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,  in __rb_insert_augmented()
409 	void (*augment_rotate)(struct rb_node *old, struct rb_node *new))  in __rb_insert_augmented()
418 struct rb_node *rb_first(const struct rb_root *root)  in rb_first()
420 	struct rb_node	*n;  in rb_first()
422 	n = root->rb_node;  in rb_first()
431 struct rb_node *rb_last(const struct rb_root *root)  in rb_last()
433 	struct rb_node	*n;  in rb_last()
435 	n = root->rb_node;  in rb_last()
444 struct rb_node *rb_next(const struct rb_node *node)  in rb_next()
446 	struct rb_node *parent;  in rb_next()
459 		return (struct rb_node *)node;  in rb_next()
476 struct rb_node *rb_prev(const struct rb_node *node)  in rb_prev()
478 	struct rb_node *parent;  in rb_prev()
491 		return (struct rb_node *)node;  in rb_prev()
505 void rb_replace_node(struct rb_node *victim, struct rb_node *new,  in rb_replace_node()
508 	struct rb_node *parent = rb_parent(victim);  in rb_replace_node()
522 static struct rb_node *rb_left_deepest_node(const struct rb_node *node)  in rb_left_deepest_node()
530 			return (struct rb_node *)node;  in rb_left_deepest_node()
534 struct rb_node *rb_next_postorder(const struct rb_node *node)  in rb_next_postorder()
536 	const struct rb_node *parent;  in rb_next_postorder()
549 		return (struct rb_node *)parent;  in rb_next_postorder()
553 struct rb_node *rb_first_postorder(const struct rb_root *root)  in rb_first_postorder()
555 	if (!root->rb_node)  in rb_first_postorder()
558 	return rb_left_deepest_node(root->rb_node);  in rb_first_postorder()