165 rb_add_cached(struct rb_node *node, struct rb_root_cached *tree,  in rb_add_cached()  argument
168 	struct rb_node **link = &tree->rb_root.rb_node;  in rb_add_cached()
183 	rb_insert_color_cached(node, tree, leftmost);  in rb_add_cached()
195 rb_add(struct rb_node *node, struct rb_root *tree,  in rb_add()  argument
198 	struct rb_node **link = &tree->rb_node;  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
226 	struct rb_node **link = &tree->rb_node;  in rb_find_add()
243 	rb_insert_color(node, tree);  in rb_find_add()
259 rb_find_add_rcu(struct rb_node *node, struct rb_root *tree,  in rb_find_add_rcu()  argument
262 	struct rb_node **link = &tree->rb_node;  in rb_find_add_rcu()
279 	rb_insert_color(node, tree);  in rb_find_add_rcu()
292 rb_find(const void *key, const struct rb_root *tree,  in rb_find()  argument
295 	struct rb_node *node = tree->rb_node;  in rb_find()
323 rb_find_rcu(const void *key, const struct rb_root *tree,  in rb_find_rcu()  argument
326 	struct rb_node *node = tree->rb_node;  in rb_find_rcu()
351 rb_find_first(const void *key, const struct rb_root *tree,  in rb_find_first()  argument
354 	struct rb_node *node = tree->rb_node;  in rb_find_first()
397 #define rb_for_each(node, key, tree, cmp) \  argument
398 	for ((node) = rb_find_first((key), (tree), (cmp)); \