Lines Matching full:rb_left
30 if ((node->rb_right = right->rb_left))
31 rb_set_parent(right->rb_left, node);
32 right->rb_left = node;
38 if (node == parent->rb_left)
39 parent->rb_left = right;
50 struct rb_node *left = node->rb_left;
53 if ((node->rb_left = left->rb_right))
64 parent->rb_left = left;
79 if (parent == gparent->rb_left)
107 register struct rb_node *uncle = gparent->rb_left;
118 if (parent->rb_left == node)
143 if (parent->rb_left == node)
153 if ((!other->rb_left || rb_is_black(other->rb_left)) &&
165 if ((o_left = other->rb_left))
182 other = parent->rb_left;
188 other = parent->rb_left;
190 if ((!other->rb_left || rb_is_black(other->rb_left)) &&
199 if (!other->rb_left || rb_is_black(other->rb_left))
206 other = parent->rb_left;
210 if (other->rb_left)
211 rb_set_black(other->rb_left);
227 if (!node->rb_left)
230 child = node->rb_left;
236 while ((left = node->rb_left) != NULL)
248 parent->rb_left = child;
252 node->rb_left = old->rb_left;
256 if (rb_parent(old)->rb_left == old)
257 rb_parent(old)->rb_left = node;
263 rb_set_parent(old->rb_left, node);
276 if (parent->rb_left == node)
277 parent->rb_left = child;
299 while (n->rb_left)
300 n = n->rb_left;
327 while (node->rb_left)
328 node=node->rb_left;
353 if (node->rb_left) {
354 node = node->rb_left;
362 while ((parent = rb_parent(node)) && node == parent->rb_left)
375 if (victim == parent->rb_left)
376 parent->rb_left = new;
382 if (victim->rb_left)
383 rb_set_parent(victim->rb_left, new);
