73 #define	RB_EMPTY_ROOT(root)	((root)->rb_node == NULL)  argument
77 #define	rb_insert_color(node, root)					\  argument
78 	linux_root_RB_INSERT_COLOR((struct linux_root *)(root), (node))
79 #define	rb_erase(node, root)						\  argument
80 	linux_root_RB_REMOVE((struct linux_root *)(root), (node))
83 #define	rb_first(root)	RB_MIN(linux_root, (struct linux_root *)(root))  argument
84 #define	rb_last(root)	RB_MAX(linux_root, (struct linux_root *)(root))  argument
85 #define	rb_first_cached(root)	(root)->rb_leftmost  argument
132     struct rb_root *root)  in rb_replace_node()  argument
135 	RB_SWAP_CHILD((struct linux_root *)root, victim, new, __entry);  in rb_replace_node()
144 rb_insert_color_cached(struct rb_node *node, struct rb_root_cached *root,  in rb_insert_color_cached()  argument
147 	linux_root_RB_INSERT_COLOR((struct linux_root *)&root->rb_root, node);  in rb_insert_color_cached()
149 		root->rb_leftmost = node;  in rb_insert_color_cached()
153 rb_erase_cached(struct rb_node *node, struct rb_root_cached *root)  in rb_erase_cached()  argument
157 	if (node == root->rb_leftmost)  in rb_erase_cached()
158 		retval = root->rb_leftmost = linux_root_RB_NEXT(node);  in rb_erase_cached()
161 	linux_root_RB_REMOVE((struct linux_root *)&root->rb_root, node);  in rb_erase_cached()
167     struct rb_root_cached *root)  in rb_replace_node_cached()  argument
169 	rb_replace_node(old, new, &root->rb_root);  in rb_replace_node_cached()
170 	if (root->rb_leftmost == old)  in rb_replace_node_cached()
171 		root->rb_leftmost = new;  in rb_replace_node_cached()