53 if ((
node->rb_left =
left->rb_right))
166 if ((o_left =
other->rb_left))
202 register struct rb_node *o_right;
203 if ((o_right =
other->rb_right))
230 else if (!
node->rb_right)
326 if (
node->rb_right) {
328 while (
node->rb_left)
354 while (
node->rb_right)
375 if (victim ==
parent->rb_left)
403 new = &((*new)->rb_left);
405 new = &((*new)->rb_right);
static void rb_set_parent(struct rb_node *rb, struct rb_node *p)
static void rb_link_node(struct rb_node *node, struct rb_node *parent, struct rb_node **rb_link)
static void rb_set_color(struct rb_node *rb, ULONG_PTR color)
#define cmp(status, error)
static void __rb_rotate_left(struct rb_node *node, struct rb_root *root)
struct rb_node * rb_last(struct rb_root *root)
struct rb_node * rb_next(struct rb_node *node)
struct rb_node * rb_first(struct rb_root *root)
void rb_insert_color(struct rb_node *node, struct rb_root *root)
void rb_erase(struct rb_node *node, struct rb_root *root)
struct rb_node * rb_prev(struct rb_node *node)
static void __rb_erase_color(struct rb_node *node, struct rb_node *parent, struct rb_root *root)
void rb_replace_node(struct rb_node *victim, struct rb_node *new, struct rb_root *root)
void rb_insert(struct rb_root *root, struct rb_node *node, int(*cmp)(struct rb_node *, struct rb_node *))
static void __rb_rotate_right(struct rb_node *node, struct rb_root *root)
ULONG_PTR rb_parent_color
struct rb_node * rb_right