Lines Matching refs:rb_left
31 if ((node->rb_right = right->rb_left))
32 rb_set_parent(right->rb_left, node);
33 right->rb_left = node;
39 if (node == parent->rb_left)
40 parent->rb_left = right;
51 struct rb_node *left = node->rb_left;
54 if ((node->rb_left = left->rb_right))
65 parent->rb_left = left;
80 if (parent == gparent->rb_left)
108 register struct rb_node *uncle = gparent->rb_left;
119 if (parent->rb_left == node)
145 if (parent->rb_left == node)
155 if ((!other->rb_left || rb_is_black(other->rb_left)) &&
167 if ((o_left = other->rb_left))
184 other = parent->rb_left;
190 other = parent->rb_left;
192 if ((!other->rb_left || rb_is_black(other->rb_left)) &&
201 if (!other->rb_left || rb_is_black(other->rb_left))
208 other = parent->rb_left;
212 if (other->rb_left)
213 rb_set_black(other->rb_left);
229 if (!node->rb_left)
232 child = node->rb_left;
238 while ((left = node->rb_left) != NULL)
250 parent->rb_left = child;
254 node->rb_left = old->rb_left;
258 if (rb_parent(old)->rb_left == old)
259 rb_parent(old)->rb_left = node;
265 rb_set_parent(old->rb_left, node);
278 if (parent->rb_left == node)
279 parent->rb_left = child;
302 while (n->rb_left)
303 n = n->rb_left;
332 while (node->rb_left)
333 node=node->rb_left;
359 if (node->rb_left) {
360 node = node->rb_left;
368 while ((parent = rb_parent(node)) && node == parent->rb_left)
382 if (victim == parent->rb_left)
383 parent->rb_left = new;
389 if (victim->rb_left)
390 rb_set_parent(victim->rb_left, new);