90     while (node->right)  in rb_node_maximum()
91         node = node->right;  in rb_node_maximum()
119         assert(u == p->right);  in rb_tree_splice()
120         p->right = v;  in rb_tree_splice()
129     assert(x && x->right);  in rb_tree_rotate_left()
131     struct rb_node *y = x->right;  in rb_tree_rotate_left()
132     x->right = y->left;  in rb_tree_rotate_left()
146     y->left = x->right;  in rb_tree_rotate_right()
147     if (x->right)  in rb_tree_rotate_right()
148         rb_node_set_parent(x->right, y);  in rb_tree_rotate_right()
150     x->right = y;  in rb_tree_rotate_right()
172         assert(parent->right == NULL);  in rb_tree_insert_at()
173         parent->right = node;  in rb_tree_insert_at()
181         assert(z == z_p->left || z == z_p->right);  in rb_tree_insert_at()
185             struct rb_node *y = z_p_p->right;  in rb_tree_insert_at()
192                 if (z == z_p->right) {  in rb_tree_insert_at()
197                     assert(z == z_p->left || z == z_p->right);  in rb_tree_insert_at()
217                     assert(z == z_p->left || z == z_p->right);  in rb_tree_insert_at()
239         x = z->right;  in rb_tree_remove()
242     } else if (z->right == NULL) {  in rb_tree_remove()
248         y = rb_node_minimum(z->right);  in rb_tree_remove()
251         x = y->right;  in rb_tree_remove()
257             y->right = z->right;  in rb_tree_remove()
258             rb_node_set_parent(y->right, y);  in rb_tree_remove()
267     assert(x_p == NULL || x == x_p->left || x == x_p->right);  in rb_tree_remove()
275             struct rb_node *w = x_p->right;  in rb_tree_remove()
281                 w = x_p->right;  in rb_tree_remove()
283             if (rb_node_is_black(w->left) && rb_node_is_black(w->right)) {  in rb_tree_remove()
287                 if (rb_node_is_black(w->right)) {  in rb_tree_remove()
291                     w = x_p->right;  in rb_tree_remove()
295                 rb_node_set_black(w->right);  in rb_tree_remove()
305                 assert(x == x_p->right);  in rb_tree_remove()
308             if (rb_node_is_black(w->right) && rb_node_is_black(w->left)) {  in rb_tree_remove()
313                     rb_node_set_black(w->right);  in rb_tree_remove()
346     if (node->right) {  in rb_node_next()
350         return rb_node_minimum(node->right);  in rb_node_next()
356         while (p && node == p->right) {  in rb_node_next()
382         assert(p == NULL || node == p->right);  in rb_node_prev()
399         assert(rb_node_is_black(n->right));  in validate_rb_node()
403     validate_rb_node(n->right, black_depth);  in validate_rb_node()