43 rb_node_is_black(struct rb_node *n)  in rb_node_is_black()
50 rb_node_is_red(struct rb_node *n)  in rb_node_is_red()
56 rb_node_set_black(struct rb_node *n)  in rb_node_set_black()
62 rb_node_set_red(struct rb_node *n)  in rb_node_set_red()
68 rb_node_copy_color(struct rb_node *dst, struct rb_node *src)  in rb_node_copy_color()
74 rb_node_set_parent(struct rb_node *n, struct rb_node *p)  in rb_node_set_parent()
79 static struct rb_node *
80 rb_node_minimum(struct rb_node *node)  in rb_node_minimum()
87 static struct rb_node *
88 rb_node_maximum(struct rb_node *node)  in rb_node_maximum()
109 rb_tree_splice(struct rb_tree *T, struct rb_node *u, struct rb_node *v)  in rb_tree_splice()
112     struct rb_node *p = rb_node_parent(u);  in rb_tree_splice()
127 rb_tree_rotate_left(struct rb_tree *T, struct rb_node *x)  in rb_tree_rotate_left()
131     struct rb_node *y = x->right;  in rb_tree_rotate_left()
141 rb_tree_rotate_right(struct rb_tree *T, struct rb_node *y)  in rb_tree_rotate_right()
145     struct rb_node *x = y->left;  in rb_tree_rotate_right()
155 rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent,  in rb_tree_insert_at()
156                   struct rb_node *node, bool insert_left)  in rb_tree_insert_at()
178     struct rb_node *z = node;  in rb_tree_insert_at()
180         struct rb_node *z_p = rb_node_parent(z);  in rb_tree_insert_at()
182         struct rb_node *z_p_p = rb_node_parent(z_p);  in rb_tree_insert_at()
185             struct rb_node *y = z_p_p->right;  in rb_tree_insert_at()
205             struct rb_node *y = z_p_p->left;  in rb_tree_insert_at()
230 rb_tree_remove(struct rb_tree *T, struct rb_node *z)  in rb_tree_remove()
235     struct rb_node *x, *x_p;  in rb_tree_remove()
236     struct rb_node *y = z;  in rb_tree_remove()
275             struct rb_node *w = x_p->right;  in rb_tree_remove()
300             struct rb_node *w = x_p->left;  in rb_tree_remove()
331 struct rb_node *
337 struct rb_node *
343 struct rb_node *
344 rb_node_next(struct rb_node *node)  in rb_node_next()
355         struct rb_node *p = rb_node_parent(node);  in rb_node_next()
365 struct rb_node *
366 rb_node_prev(struct rb_node *node)  in rb_node_prev()
377         struct rb_node *p = rb_node_parent(node);  in rb_node_prev()
388 validate_rb_node(struct rb_node *n, int black_depth)  in validate_rb_node()
415     for (struct rb_node *n = T->root; n; n = n->left) {  in rb_tree_validate()