Lines Matching refs:rb_right
27 struct rb_node *right = node->rb_right;
30 if ((node->rb_right = right->rb_left))
41 parent->rb_right = right;
53 if ((node->rb_left = left->rb_right))
54 ext2fs_rb_set_parent(left->rb_right, node);
55 left->rb_right = node;
61 if (node == parent->rb_right)
62 parent->rb_right = left;
82 register struct rb_node *uncle = gparent->rb_right;
93 if (parent->rb_right == node)
145 other = parent->rb_right;
151 other = parent->rb_right;
154 (!other->rb_right || ext2fs_rb_is_black(other->rb_right)))
162 if (!other->rb_right || ext2fs_rb_is_black(other->rb_right))
167 other = parent->rb_right;
171 ext2fs_rb_set_black(other->rb_right);
188 (!other->rb_right || ext2fs_rb_is_black(other->rb_right)))
198 ext2fs_rb_set_black(other->rb_right);
222 child = node->rb_right;
223 else if (!node->rb_right)
229 node = node->rb_right;
237 ext2fs_rb_parent(old)->rb_right = node;
241 child = node->rb_right;
252 node->rb_right = old->rb_right;
253 ext2fs_rb_set_parent(old->rb_right, node);
273 parent->rb_right = child;
293 if (node == parent->rb_left && parent->rb_right)
294 func(parent->rb_right, data);
310 else if (node->rb_right)
311 node = node->rb_right;
324 if (!node->rb_right && !node->rb_left)
326 else if (!node->rb_right)
329 deepest = node->rb_right;
332 if (deepest->rb_right)
333 deepest = deepest->rb_right;
373 while (n->rb_right)
374 n = n->rb_right;
387 if (node->rb_right) {
388 node = node->rb_right;
400 while ((parent = ext2fs_rb_parent(node)) && node == parent->rb_right)
417 while (node->rb_right)
418 node=node->rb_right;
440 parent->rb_right = new;
446 if (victim->rb_right)
447 ext2fs_rb_set_parent(victim->rb_right, new);
