39 struct rb_node {  struct
40 	RB_ENTRY(rb_node)	__entry;
50 	struct	rb_node	*rb_node;  member
55 	struct rb_node *rb_leftmost;
61 int panic_cmp(struct rb_node *one, struct rb_node *two);
63 RB_HEAD(linux_root, rb_node);
64 RB_PROTOTYPE(linux_root, rb_node, __entry, panic_cmp);
71 #define	RB_EMPTY_ROOT(root)	((root)->rb_node == NULL)
88 static inline struct rb_node *
89 __rb_deepest_left(struct rb_node *node)  in __rb_deepest_left()
91 	struct rb_node *parent = NULL;  in __rb_deepest_left()
102 static inline struct rb_node *
103 rb_next_postorder(const struct rb_node *node)  in rb_next_postorder()
105 	struct rb_node *parent =  in rb_next_postorder()
106 	    RB_PARENT(__DECONST(struct rb_node *, node), __entry);  in rb_next_postorder()
117 	for ((x) = rb_entry_safe(__rb_deepest_left((head)->rb_node),	\
124 rb_link_node(struct rb_node *node, struct rb_node *parent,  in rb_link_node()
125     struct rb_node **rb_link)  in rb_link_node()
132 rb_replace_node(struct rb_node *victim, struct rb_node *new,  in rb_replace_node()
146 rb_insert_color_cached(struct rb_node *node, struct rb_root_cached *root,  in rb_insert_color_cached()
156 static inline struct rb_node *
157 rb_erase_cached(struct rb_node *node, struct rb_root_cached *root)  in rb_erase_cached()
159 	struct rb_node *retval;  in rb_erase_cached()
170 rb_replace_node_cached(struct rb_node *old, struct rb_node *new,  in rb_replace_node_cached()
178 static inline struct rb_node *
179 rb_add_cached(struct rb_node *node, struct rb_root_cached *tree,  in rb_add_cached()
180     bool (*less)(struct rb_node *, const struct rb_node *))  in rb_add_cached()  argument
182 	struct rb_node **link = &tree->rb_root.rb_node;  in rb_add_cached()
183 	struct rb_node *parent = NULL;  in rb_add_cached()