Lines Matching full:rb_node
25 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root)
27 struct rb_node *right = node->rb_right;
28 struct rb_node *parent = rb_parent(node);
44 root->rb_node = right;
48 static void __rb_rotate_right(struct rb_node *node, struct rb_root *root)
50 struct rb_node *left = node->rb_left;
51 struct rb_node *parent = rb_parent(node);
67 root->rb_node = left;
71 void rb_insert_color(struct rb_node *node, struct rb_root *root)
73 struct rb_node *parent, *gparent;
82 register struct rb_node *uncle = gparent->rb_right;
95 register struct rb_node *tmp;
107 register struct rb_node *uncle = gparent->rb_left;
120 register struct rb_node *tmp;
133 rb_set_black(root->rb_node);
136 static void __rb_erase_color(struct rb_node *node, struct rb_node *parent,
139 struct rb_node *other;
141 while ((!node || rb_is_black(node)) && node != root->rb_node)
164 struct rb_node *o_left;
176 node = root->rb_node;
201 register struct rb_node *o_right;
213 node = root->rb_node;
222 void rb_erase(struct rb_node *node, struct rb_root *root)
224 struct rb_node *child, *parent;
233 struct rb_node *old = node, *left;
261 root->rb_node = node;
282 root->rb_node = child;
292 struct rb_node *rb_first(struct rb_root *root)
294 struct rb_node *n;
296 n = root->rb_node;
304 struct rb_node *rb_last(struct rb_root *root)
306 struct rb_node *n;
308 n = root->rb_node;
316 struct rb_node *rb_next(struct rb_node *node)
318 struct rb_node *parent;
344 struct rb_node *rb_prev(struct rb_node *node)
346 struct rb_node *parent;
368 void rb_replace_node(struct rb_node *victim, struct rb_node *new,
371 struct rb_node *parent = rb_parent(victim);
380 root->rb_node = new;
