30 #define RB_EMPTY_ROOT(root)  (READ_ONCE((root)->rb_node) == NULL)  argument
55 			    struct rb_root *root);
57 				struct rb_root *root);
99 #define rbtree_postorder_for_each_entry_safe(pos, n, root, field) \  argument
100 	for (pos = rb_entry_safe(rb_first_postorder(root), typeof(*pos), field); \
106 #define rb_first_cached(root) (root)->rb_leftmost  argument
109 					  struct rb_root_cached *root,  in rb_insert_color_cached()  argument
113 		root->rb_leftmost = node;  in rb_insert_color_cached()
114 	rb_insert_color(node, &root->rb_root);  in rb_insert_color_cached()
119 rb_erase_cached(struct rb_node *node, struct rb_root_cached *root)  in rb_erase_cached()  argument
123 	if (root->rb_leftmost == node)  in rb_erase_cached()
124 		leftmost = root->rb_leftmost = rb_next(node);  in rb_erase_cached()
126 	rb_erase(node, &root->rb_root);  in rb_erase_cached()
133 					  struct rb_root_cached *root)  in rb_replace_node_cached()  argument
135 	if (root->rb_leftmost == victim)  in rb_replace_node_cached()
136 		root->rb_leftmost = new;  in rb_replace_node_cached()
137 	rb_replace_node(victim, new, &root->rb_root);  in rb_replace_node_cached()