Lines Matching full: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)) &&
166 rb_set_black(other->rb_left);
181 other = parent->rb_left;
187 other = parent->rb_left;
189 if ((!other->rb_left || rb_is_black(other->rb_left)) &&
198 if (!other->rb_left || rb_is_black(other->rb_left))
203 other = parent->rb_left;
207 rb_set_black(other->rb_left);
223 if (!node->rb_left)
226 child = node->rb_left;
232 while ((left = node->rb_left) != NULL)
236 if (rb_parent(old)->rb_left == old)
237 rb_parent(old)->rb_left = node;
252 parent->rb_left = child;
259 node->rb_left = old->rb_left;
260 rb_set_parent(old->rb_left, node);
272 if (parent->rb_left == node)
273 parent->rb_left = child;
296 if (node == parent->rb_left && parent->rb_right)
298 else if (parent->rb_left)
299 func(parent->rb_left, data);
311 if (node->rb_left)
312 node = node->rb_left;
327 if (!node->rb_right && !node->rb_left)
330 deepest = node->rb_left;
331 else if (!node->rb_left)
364 while (n->rb_left)
365 n = n->rb_left;
394 while (node->rb_left)
395 node=node->rb_left;
421 if (node->rb_left) {
422 node = node->rb_left;
430 while ((parent = rb_parent(node)) && node == parent->rb_left)
444 if (victim == parent->rb_left)
445 parent->rb_left = new;
451 if (victim->rb_left)
452 rb_set_parent(victim->rb_left, new);
