34 struct rb_node {  struct
35 	RB_ENTRY(rb_node)	__entry;
45 	struct	rb_node	*rb_node;  member
55 int panic_cmp(struct rb_node *one, struct rb_node *two);
57 RB_HEAD(linux_root, rb_node);
58 RB_PROTOTYPE(linux_root, rb_node, __entry, panic_cmp);
70 #define RB_EMPTY_ROOT(root)	((root)->rb_node == NULL)
91 static inline struct rb_node *
92 __rb_deepest_left(struct rb_node *node)  in __rb_deepest_left()
94 	struct rb_node *parent = NULL;  in __rb_deepest_left()
105 static inline struct rb_node *
106 rb_next_postorder(const struct rb_node *node)  in rb_next_postorder()
108 	struct rb_node *parent = RB_PARENT(node, __entry);  in rb_next_postorder()
119 	for ((x) = rb_entry_safe(__rb_deepest_left((head)->rb_node),	\
126 rb_link_node(struct rb_node *node, struct rb_node *parent,  in rb_link_node()
127     struct rb_node **rb_link)  in rb_link_node()
136 rb_replace_node(struct rb_node *victim, struct rb_node *new,  in rb_replace_node()
139 	struct rb_node *p;  in rb_replace_node()
148 		root->rb_node = new;  in rb_replace_node()
157 rb_add_cached(struct rb_node *node, struct rb_root_cached *root,  in rb_add_cached()
158     bool (*less)(struct rb_node *, const struct rb_node *))  in rb_add_cached()  argument
160 	struct rb_node **iter = &root->rb_root.rb_node;  in rb_add_cached()
161 	struct rb_node *parent = NULL;  in rb_add_cached()