72 #define RB_EMPTY_NODE(node)     (RB_PARENT(node, __entry) == node)  argument
73 #define RB_CLEAR_NODE(node)     RB_SET_PARENT(node, node, __entry)  argument
75 #define rb_insert_color(node, root) do {				\  argument
80 #define	rb_erase(node, root)						\  argument
82 #define	rb_next(node)	RB_NEXT(linux_root, NULL, (node))  argument
83 #define	rb_prev(node)	RB_PREV(linux_root, NULL, (node))  argument
89 __rb_deepest_left(struct rb_node *node)  in __rb_deepest_left()
103 rb_next_postorder(const struct rb_node *node)  in rb_next_postorder()
124 rb_link_node(struct rb_node *node, struct rb_node *parent,  in rb_link_node()
146 rb_insert_color_cached(struct rb_node *node, struct rb_root_cached *root,  in rb_insert_color_cached()
157 rb_erase_cached(struct rb_node *node, struct rb_root_cached *root)  in rb_erase_cached()
179 rb_add_cached(struct rb_node *node, struct rb_root_cached *tree,  in rb_add_cached()