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