Lines Matching refs:left
50 struct rb_node *left = node->rb_left;
53 if ((node->rb_left = left->rb_right))
54 rb_set_parent(left->rb_right, node);
55 left->rb_right = node;
57 rb_set_parent(left, parent);
62 parent->rb_right = left;
64 parent->rb_left = left;
67 root->rb_node = left;
68 rb_set_parent(node, left);
233 struct rb_node *old = node, *left;
236 while ((left = node->rb_left) != NULL)
237 node = left;
323 /* If we have a right-hand child, go down and then left as far
332 /* No right-hand children. Everything down and left is
336 up. First time it's a left-hand child of its parent, said
351 /* If we have a left-hand child, go down and then right as far
360 /* No left-hand children. Go up till we find an ancestor which