39 #define RB_EMPTY_ROOT(root)  (READ_ONCE((root)->rb_node) == NULL)  argument
64 			    struct rb_root *root);
97 #define rbtree_postorder_for_each_entry_safe(pos, n, root, field) \  argument
98 	for (pos = rb_entry_safe(rb_first_postorder(root), typeof(*pos), field); \
103 static inline void rb_erase_init(struct rb_node *n, struct rb_root *root)  in rb_erase_init()  argument
105 	rb_erase(n, root);  in rb_erase_init()
127 #define rb_first_cached(root) (root)->rb_leftmost  argument
130 					  struct rb_root_cached *root,  in rb_insert_color_cached()  argument
134 		root->rb_leftmost = node;  in rb_insert_color_cached()
135 	rb_insert_color(node, &root->rb_root);  in rb_insert_color_cached()
139 				   struct rb_root_cached *root)  in rb_erase_cached()  argument
141 	if (root->rb_leftmost == node)  in rb_erase_cached()
142 		root->rb_leftmost = rb_next(node);  in rb_erase_cached()
143 	rb_erase(node, &root->rb_root);  in rb_erase_cached()
148 					  struct rb_root_cached *root)  in rb_replace_node_cached()  argument
150 	if (root->rb_leftmost == victim)  in rb_replace_node_cached()
151 		root->rb_leftmost = new;  in rb_replace_node_cached()
152 	rb_replace_node(victim, new, &root->rb_root);  in rb_replace_node_cached()