Lines Matching refs:rb_right
28 struct rb_node *right = node->rb_right; in __rb_rotate_left()
31 if ((node->rb_right = right->rb_left)) in __rb_rotate_left()
42 parent->rb_right = right; in __rb_rotate_left()
54 if ((node->rb_left = left->rb_right)) in __rb_rotate_right()
55 rb_set_parent(left->rb_right, node); in __rb_rotate_right()
56 left->rb_right = node; in __rb_rotate_right()
62 if (node == parent->rb_right) in __rb_rotate_right()
63 parent->rb_right = left; in __rb_rotate_right()
83 register struct rb_node *uncle = gparent->rb_right; in rb_insert_color()
94 if (parent->rb_right == node) in rb_insert_color()
147 other = parent->rb_right; in __rb_erase_color()
153 other = parent->rb_right; in __rb_erase_color()
156 (!other->rb_right || rb_is_black(other->rb_right))) in __rb_erase_color()
164 if (!other->rb_right || rb_is_black(other->rb_right)) in __rb_erase_color()
169 other = parent->rb_right; in __rb_erase_color()
173 rb_set_black(other->rb_right); in __rb_erase_color()
190 (!other->rb_right || rb_is_black(other->rb_right))) in __rb_erase_color()
200 rb_set_black(other->rb_right); in __rb_erase_color()
224 child = node->rb_right; in rb_erase()
225 else if (!node->rb_right) in rb_erase()
231 node = node->rb_right; in rb_erase()
239 rb_parent(old)->rb_right = node; in rb_erase()
243 child = node->rb_right; in rb_erase()
256 node->rb_right = old->rb_right; in rb_erase()
260 if (old->rb_right) in rb_erase()
261 rb_set_parent(old->rb_right, node); in rb_erase()
275 parent->rb_right = child; in rb_erase()
309 while (n->rb_right) in rb_last()
310 n = n->rb_right; in rb_last()
324 if (node->rb_right) { in rb_next()
325 node = node->rb_right; in rb_next()
337 while ((parent = rb_parent(node)) && node == parent->rb_right) in rb_next()
355 while (node->rb_right) in rb_prev()
356 node=node->rb_right; in rb_prev()
379 parent->rb_right = new; in rb_replace_node()
385 if (victim->rb_right) in rb_replace_node()
386 rb_set_parent(victim->rb_right, new); in rb_replace_node()