71 static inline void rb_set_black(struct rb_node *rb)  in rb_set_black()
76 static inline struct rb_node *rb_red_parent(struct rb_node *red)  in rb_red_parent()
78 	return (struct rb_node *)red->__rb_parent_color;  in rb_red_parent()
87 __rb_rotate_set_parents(struct rb_node *old, struct rb_node *new,  in __rb_rotate_set_parents()
90 	struct rb_node *parent = rb_parent(old);  in __rb_rotate_set_parents()
97 __rb_insert(struct rb_node *node, struct rb_root *root,  in __rb_insert()
98 	    void (*augment_rotate)(struct rb_node *old, struct rb_node *new))  in __rb_insert()
100 	struct rb_node *parent = rb_red_parent(node), *gparent, *tmp;  in __rb_insert()
228 ____rb_erase_color(struct rb_node *parent, struct rb_root *root,  in ____rb_erase_color()
229 	void (*augment_rotate)(struct rb_node *old, struct rb_node *new))  in ____rb_erase_color()
231 	struct rb_node *node = NULL, *sibling, *tmp1, *tmp2;  in ____rb_erase_color()
396 void __rb_erase_color(struct rb_node *parent, struct rb_root *root,  in __rb_erase_color()
397 	void (*augment_rotate)(struct rb_node *old, struct rb_node *new))  in __rb_erase_color()
410 static inline void dummy_propagate(struct rb_node *node, struct rb_node *stop) {}  in dummy_propagate()
411 static inline void dummy_copy(struct rb_node *old, struct rb_node *new) {}  in dummy_copy()
412 static inline void dummy_rotate(struct rb_node *old, struct rb_node *new) {}  in dummy_rotate()
418 void rb_insert_color(struct rb_node *node, struct rb_root *root)  in rb_insert_color()
424 void rb_erase(struct rb_node *node, struct rb_root *root)  in rb_erase()
426 	struct rb_node *rebalance;  in rb_erase()
440 void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,  in __rb_insert_augmented()
441 	void (*augment_rotate)(struct rb_node *old, struct rb_node *new))  in __rb_insert_augmented()
450 struct rb_node *rb_first(const struct rb_root *root)  in rb_first()
452 	struct rb_node	*n;  in rb_first()
454 	n = root->rb_node;  in rb_first()
463 struct rb_node *rb_last(const struct rb_root *root)  in rb_last()
465 	struct rb_node	*n;  in rb_last()
467 	n = root->rb_node;  in rb_last()
476 struct rb_node *rb_next(const struct rb_node *node)  in rb_next()
478 	struct rb_node *parent;  in rb_next()
491 		return (struct rb_node *)node;  in rb_next()
508 struct rb_node *rb_prev(const struct rb_node *node)  in rb_prev()
510 	struct rb_node *parent;  in rb_prev()
523 		return (struct rb_node *)node;  in rb_prev()
537 void rb_replace_node(struct rb_node *victim, struct rb_node *new,  in rb_replace_node()
540 	struct rb_node *parent = rb_parent(victim);  in rb_replace_node()
554 static struct rb_node *rb_left_deepest_node(const struct rb_node *node)  in rb_left_deepest_node()
562 			return (struct rb_node *)node;  in rb_left_deepest_node()
566 struct rb_node *rb_next_postorder(const struct rb_node *node)  in rb_next_postorder()
568 	const struct rb_node *parent;  in rb_next_postorder()
581 		return (struct rb_node *)parent;  in rb_next_postorder()
585 struct rb_node *rb_first_postorder(const struct rb_root *root)  in rb_first_postorder()
587 	if (!root->rb_node)  in rb_first_postorder()
590 	return rb_left_deepest_node(root->rb_node);  in rb_first_postorder()