Lines Matching refs:rb_right
28 struct rb_node *right = node->rb_right;
31 if ((node->rb_right = right->rb_left))
42 parent->rb_right = right;
54 if ((node->rb_left = left->rb_right))
55 rb_set_parent(left->rb_right, node);
56 left->rb_right = node;
62 if (node == parent->rb_right)
63 parent->rb_right = left;
83 register struct rb_node *uncle = gparent->rb_right;
94 if (parent->rb_right == node)
147 other = parent->rb_right;
153 other = parent->rb_right;
156 (!other->rb_right || rb_is_black(other->rb_right)))
164 if (!other->rb_right || rb_is_black(other->rb_right))
169 other = parent->rb_right;
173 rb_set_black(other->rb_right);
190 (!other->rb_right || rb_is_black(other->rb_right)))
200 rb_set_black(other->rb_right);
224 child = node->rb_right;
225 else if (!node->rb_right)
231 node = node->rb_right;
239 rb_parent(old)->rb_right = node;
243 child = node->rb_right;
254 node->rb_right = old->rb_right;
255 rb_set_parent(old->rb_right, node);
275 parent->rb_right = child;
296 if (node == parent->rb_left && parent->rb_right)
297 func(parent->rb_right, data);
313 else if (node->rb_right)
314 node = node->rb_right;
327 if (!node->rb_right && !node->rb_left)
329 else if (!node->rb_right)
332 deepest = node->rb_right;
335 if (deepest->rb_right)
336 deepest = deepest->rb_right;
377 while (n->rb_right)
378 n = n->rb_right;
392 if (node->rb_right) {
393 node = node->rb_right;
405 while ((parent = rb_parent(node)) && node == parent->rb_right)
423 while (node->rb_right)
424 node=node->rb_right;
447 parent->rb_right = new;
453 if (victim->rb_right)
454 rb_set_parent(victim->rb_right, new);