88 			struct rb_root *root, int color)  in __rb_rotate_set_parents()  argument
93 	__rb_change_child(old, new, parent, root);  in __rb_rotate_set_parents()
97 __rb_insert(struct rb_node *node, struct rb_root *root,  in __rb_insert()  argument
196 			__rb_rotate_set_parents(gparent, parent, root, RB_RED);  in __rb_insert()
231 			__rb_rotate_set_parents(gparent, parent, root, RB_RED);  in __rb_insert()
243 ____rb_erase_color(struct rb_node *parent, struct rb_root *root,  in ____rb_erase_color()  argument
272 				__rb_rotate_set_parents(parent, sibling, root,  in ____rb_erase_color()
364 			__rb_rotate_set_parents(parent, sibling, root,  in ____rb_erase_color()
376 				__rb_rotate_set_parents(parent, sibling, root,  in ____rb_erase_color()
417 			__rb_rotate_set_parents(parent, sibling, root,  in ____rb_erase_color()
426 void __rb_erase_color(struct rb_node *parent, struct rb_root *root,  in __rb_erase_color()  argument
429 	____rb_erase_color(parent, root, augment_rotate);  in __rb_erase_color()
450 void rb_insert_color(struct rb_node *node, struct rb_root *root)  in rb_insert_color()  argument
452 	__rb_insert(node, root, false, NULL, dummy_rotate);  in rb_insert_color()
456 void rb_erase(struct rb_node *node, struct rb_root *root)  in rb_erase()  argument
459 	rebalance = __rb_erase_augmented(node, root,  in rb_erase()
462 		____rb_erase_color(rebalance, root, dummy_rotate);  in rb_erase()
467 			    struct rb_root_cached *root, bool leftmost)  in rb_insert_color_cached()  argument
469 	__rb_insert(node, &root->rb_root, leftmost,  in rb_insert_color_cached()
470 		    &root->rb_leftmost, dummy_rotate);  in rb_insert_color_cached()
474 void rb_erase_cached(struct rb_node *node, struct rb_root_cached *root)  in rb_erase_cached()  argument
477 	rebalance = __rb_erase_augmented(node, &root->rb_root,  in rb_erase_cached()
478 					 &root->rb_leftmost, &dummy_callbacks);  in rb_erase_cached()
480 		____rb_erase_color(rebalance, &root->rb_root, dummy_rotate);  in rb_erase_cached()
491 void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,  in __rb_insert_augmented()  argument
495 	__rb_insert(node, root, newleft, leftmost, augment_rotate);  in __rb_insert_augmented()
502 struct rb_node *rb_first(const struct rb_root *root)  in rb_first()  argument
506 	n = root->rb_node;  in rb_first()
515 struct rb_node *rb_last(const struct rb_root *root)  in rb_last()  argument
519 	n = root->rb_node;  in rb_last()
590 		     struct rb_root *root)  in rb_replace_node()  argument
602 	__rb_change_child(victim, new, parent, root);  in rb_replace_node()
607 			    struct rb_root_cached *root)  in rb_replace_node_cached()  argument
609 	rb_replace_node(victim, new, &root->rb_root);  in rb_replace_node_cached()
611 	if (root->rb_leftmost == victim)  in rb_replace_node_cached()
612 		root->rb_leftmost = new;  in rb_replace_node_cached()
617 			 struct rb_root *root)  in rb_replace_node_rcu()  argument
634 	__rb_change_child_rcu(victim, new, parent, root);  in rb_replace_node_rcu()
669 struct rb_node *rb_first_postorder(const struct rb_root *root)  in rb_first_postorder()  argument
671 	if (!root->rb_node)  in rb_first_postorder()
674 	return rb_left_deepest_node(root->rb_node);  in rb_first_postorder()