85 __rb_insert(struct rb_node *node, struct rb_root *root,  in __rb_insert()  argument
88 	struct rb_node *parent = rb_red_parent(node), *gparent, *tmp;  in __rb_insert()
100 			rb_set_parent_color(node, NULL, RB_BLACK);  in __rb_insert()
133 				node = gparent;  in __rb_insert()
134 				parent = rb_parent(node);  in __rb_insert()
135 				rb_set_parent_color(node, parent, RB_RED);  in __rb_insert()
140 			if (node == tmp) {  in __rb_insert()
154 				tmp = node->rb_left;  in __rb_insert()
156 				WRITE_ONCE(node->rb_left, parent);  in __rb_insert()
160 				rb_set_parent_color(parent, node, RB_RED);  in __rb_insert()
161 				augment_rotate(parent, node);  in __rb_insert()
162 				parent = node;  in __rb_insert()
163 				tmp = node->rb_right;  in __rb_insert()
189 				node = gparent;  in __rb_insert()
190 				parent = rb_parent(node);  in __rb_insert()
191 				rb_set_parent_color(node, parent, RB_RED);  in __rb_insert()
196 			if (node == tmp) {  in __rb_insert()
198 				tmp = node->rb_right;  in __rb_insert()
200 				WRITE_ONCE(node->rb_right, parent);  in __rb_insert()
204 				rb_set_parent_color(parent, node, RB_RED);  in __rb_insert()
205 				augment_rotate(parent, node);  in __rb_insert()
206 				parent = node;  in __rb_insert()
207 				tmp = node->rb_left;  in __rb_insert()
230 	struct rb_node *node = NULL, *sibling, *tmp1, *tmp2;  in ____rb_erase_color()  local
241 		if (node != sibling) {	/* node == parent->rb_left */  in ____rb_erase_color()
285 						node = parent;  in ____rb_erase_color()
286 						parent = rb_parent(node);  in ____rb_erase_color()
375 						node = parent;  in ____rb_erase_color()
376 						parent = rb_parent(node);  in ____rb_erase_color()
423 static inline void dummy_propagate(struct rb_node *node, struct rb_node *stop) {}  in dummy_propagate()  argument
433 void rb_insert_color(struct rb_node *node, struct rb_root *root)  in rb_insert_color()  argument
435 	__rb_insert(node, root, dummy_rotate);  in rb_insert_color()
438 void rb_erase(struct rb_node *node, struct rb_root *root)  in rb_erase()  argument
441 	rebalance = __rb_erase_augmented(node, root, &dummy_callbacks);  in rb_erase()
453 void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,  in __rb_insert_augmented()  argument
456 	__rb_insert(node, root, augment_rotate);  in __rb_insert_augmented()
486 struct rb_node *rb_next(const struct rb_node *node)  in rb_next()  argument
490 	if (RB_EMPTY_NODE(node))  in rb_next()
497 	if (node->rb_right) {  in rb_next()
498 		node = node->rb_right;  in rb_next()
499 		while (node->rb_left)  in rb_next()
500 			node = node->rb_left;  in rb_next()
501 		return (struct rb_node *)node;  in rb_next()
511 	while ((parent = rb_parent(node)) && node == parent->rb_right)  in rb_next()
512 		node = parent;  in rb_next()
517 struct rb_node *rb_prev(const struct rb_node *node)  in rb_prev()  argument
521 	if (RB_EMPTY_NODE(node))  in rb_prev()
528 	if (node->rb_left) {  in rb_prev()
529 		node = node->rb_left;  in rb_prev()
530 		while (node->rb_right)  in rb_prev()
531 			node = node->rb_right;  in rb_prev()
532 		return (struct rb_node *)node;  in rb_prev()
539 	while ((parent = rb_parent(node)) && node == parent->rb_left)  in rb_prev()
540 		node = parent;  in rb_prev()
561 static struct rb_node *rb_left_deepest_node(const struct rb_node *node)  in rb_left_deepest_node()  argument
564 		if (node->rb_left)  in rb_left_deepest_node()
565 			node = node->rb_left;  in rb_left_deepest_node()
566 		else if (node->rb_right)  in rb_left_deepest_node()
567 			node = node->rb_right;  in rb_left_deepest_node()
569 			return (struct rb_node *)node;  in rb_left_deepest_node()
573 struct rb_node *rb_next_postorder(const struct rb_node *node)  in rb_next_postorder()  argument
576 	if (!node)  in rb_next_postorder()
578 	parent = rb_parent(node);  in rb_next_postorder()
581 	if (parent && node == parent->rb_left && parent->rb_right) {  in rb_next_postorder()