30 struct rb_root {  struct
36 #define RB_ROOT	(struct rb_root) { NULL, }  argument
48 extern void rb_insert_color(struct rb_node *, struct rb_root *);
49 extern void rb_erase(struct rb_node *, struct rb_root *);
55 extern struct rb_node *rb_first(const struct rb_root *);
56 extern struct rb_node *rb_last(const struct rb_root *);
59 extern struct rb_node *rb_first_postorder(const struct rb_root *);
64 			    struct rb_root *root);
103 static inline void rb_erase_init(struct rb_node *n, struct rb_root *root)  in rb_erase_init()
120 	struct rb_root rb_root;  member
135 	rb_insert_color(node, &root->rb_root);  in rb_insert_color_cached()
143 	rb_erase(node, &root->rb_root);  in rb_erase_cached()
152 	rb_replace_node(victim, new, &root->rb_root);  in rb_replace_node_cached()
181 	struct rb_node **link = &tree->rb_root.rb_node;  in rb_add_cached()
206 rb_add(struct rb_node *node, struct rb_root *tree,  in rb_add()
234 rb_find_add(struct rb_node *node, struct rb_root *tree,  in rb_find_add()
267 rb_find(const void *key, const struct rb_root *tree,  in rb_find()
295 rb_find_first(const void *key, const struct rb_root *tree,  in rb_find_first()