33 #define RB_EMPTY_NODE(node)  \  argument
34 	((node)->__rb_parent_color == (unsigned long)(node))
35 #define RB_CLEAR_NODE(node)  \  argument
36 	((node)->__rb_parent_color = (unsigned long)(node))
59 static inline void rb_link_node(struct rb_node *node, struct rb_node *parent,  in rb_link_node()  argument
62 	node->__rb_parent_color = (unsigned long)parent;  in rb_link_node()
63 	node->rb_left = node->rb_right = NULL;  in rb_link_node()
65 	*rb_link = node;  in rb_link_node()
68 static inline void rb_link_node_rcu(struct rb_node *node, struct rb_node *parent,  in rb_link_node_rcu()  argument
71 	node->__rb_parent_color = (unsigned long)parent;  in rb_link_node_rcu()
72 	node->rb_left = node->rb_right = NULL;  in rb_link_node_rcu()
74 	rcu_assign_pointer(*rb_link, node);  in rb_link_node_rcu()
108 static inline void rb_insert_color_cached(struct rb_node *node,  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()
165 rb_add_cached(struct rb_node *node, struct rb_root_cached *tree,  in rb_add_cached()  argument
174 		if (less(node, parent)) {  in rb_add_cached()
182 	rb_link_node(node, parent, link);  in rb_add_cached()
183 	rb_insert_color_cached(node, tree, leftmost);  in rb_add_cached()
185 	return leftmost ? node : NULL;  in rb_add_cached()
195 rb_add(struct rb_node *node, struct rb_root *tree,  in rb_add()  argument
203 		if (less(node, parent))  in rb_add()
209 	rb_link_node(node, parent, link);  in rb_add()
210 	rb_insert_color(node, tree);  in rb_add()
223 rb_find_add(struct rb_node *node, struct rb_root *tree,  in rb_find_add()  argument
232 		c = cmp(node, parent);  in rb_find_add()
242 	rb_link_node(node, parent, link);  in rb_find_add()
243 	rb_insert_color(node, tree);  in rb_find_add()
259 	struct rb_node *node = tree->rb_node;  in rb_find()  local
261 	while (node) {  in rb_find()
262 		int c = cmp(key, node);  in rb_find()
265 			node = node->rb_left;  in rb_find()
267 			node = node->rb_right;  in rb_find()
269 			return node;  in rb_find()
287 	struct rb_node *node = tree->rb_node;  in rb_find_first()  local
290 	while (node) {  in rb_find_first()
291 		int c = cmp(key, node);  in rb_find_first()
295 				match = node;  in rb_find_first()
296 			node = node->rb_left;  in rb_find_first()
298 			node = node->rb_right;  in rb_find_first()
314 rb_next_match(const void *key, struct rb_node *node,  in rb_next_match()  argument
317 	node = rb_next(node);  in rb_next_match()
318 	if (node && cmp(key, node))  in rb_next_match()
319 		node = NULL;  in rb_next_match()
320 	return node;  in rb_next_match()
330 #define rb_for_each(node, key, tree, cmp) \  argument
331 	for ((node) = rb_find_first((key), (tree), (cmp)); \
332 	     (node); (node) = rb_next_match((key), (node), (cmp)))