Lines Matching refs:rb_left
54 if ((node->rb_right = right->rb_left))
55 rb_set_parent(right->rb_left, node);
56 right->rb_left = node;
62 if (node == parent->rb_left)
63 parent->rb_left = right;
74 struct rb_node *left = node->rb_left;
77 if ((node->rb_left = left->rb_right))
88 parent->rb_left = left;
103 if (parent == gparent->rb_left)
131 register struct rb_node *uncle = gparent->rb_left;
142 if (parent->rb_left == node)
167 if (parent->rb_left == node)
177 if ((!other->rb_left || rb_is_black(other->rb_left)) &&
189 if ((o_left = other->rb_left))
206 other = parent->rb_left;
212 other = parent->rb_left;
214 if ((!other->rb_left || rb_is_black(other->rb_left)) &&
223 if (!other->rb_left || rb_is_black(other->rb_left))
230 other = parent->rb_left;
234 if (other->rb_left)
235 rb_set_black(other->rb_left);
251 if (!node->rb_left)
254 child = node->rb_left;
260 while ((left = node->rb_left) != NULL)
272 parent->rb_left = child;
276 node->rb_left = old->rb_left;
280 if (rb_parent(old)->rb_left == old)
281 rb_parent(old)->rb_left = node;
287 rb_set_parent(old->rb_left, node);
300 if (parent->rb_left == node)
301 parent->rb_left = child;
323 while (n->rb_left)
324 n = n->rb_left;
351 while (node->rb_left)
352 node=node->rb_left;
377 if (node->rb_left) {
378 node = node->rb_left;
386 while ((parent = rb_parent(node)) && node == parent->rb_left)
399 if (victim == parent->rb_left)
400 parent->rb_left = new_node;
406 if (victim->rb_left)
407 rb_set_parent(victim->rb_left, new_node);
419 node->rb_left = node->rb_right = NULL;