35 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
49 rb_insert_augmented(struct rb_node *node, struct rb_root *root,  in rb_insert_augmented()  argument
52 	__rb_insert_augmented(node, root, augment->rotate);  in rb_insert_augmented()
57 			   struct rb_root_cached *root, bool newleft,  in rb_insert_augmented_cached()  argument
61 		root->rb_leftmost = node;  in rb_insert_augmented_cached()
62 	rb_insert_augmented(node, &root->rb_root, augment);  in rb_insert_augmented_cached()
172 		  struct rb_node *parent, struct rb_root *root)  in __rb_change_child()  argument
180 		WRITE_ONCE(root->rb_node, new);  in __rb_change_child()
183 extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root,
187 __rb_erase_augmented(struct rb_node *node, struct rb_root *root,  in __rb_erase_augmented()  argument
205 		__rb_change_child(node, child, parent, root);  in __rb_erase_augmented()
216 		__rb_change_child(node, tmp, parent, root);  in __rb_erase_augmented()
272 		__rb_change_child(node, successor, tmp, root);  in __rb_erase_augmented()
291 rb_erase_augmented(struct rb_node *node, struct rb_root *root,  in rb_erase_augmented()  argument
294 	struct rb_node *rebalance = __rb_erase_augmented(node, root, augment);  in rb_erase_augmented()
296 		__rb_erase_color(rebalance, root, augment->rotate);  in rb_erase_augmented()
300 rb_erase_augmented_cached(struct rb_node *node, struct rb_root_cached *root,  in rb_erase_augmented_cached()  argument
303 	if (root->rb_leftmost == node)  in rb_erase_augmented_cached()
304 		root->rb_leftmost = rb_next(node);  in rb_erase_augmented_cached()
305 	rb_erase_augmented(node, &root->rb_root, augment);  in rb_erase_augmented_cached()