Lines Matching refs:left
51 struct rb_node *left = node->rb_left;
54 if ((node->rb_left = left->rb_right))
55 rb_set_parent(left->rb_right, node);
56 left->rb_right = node;
58 rb_set_parent(left, parent);
63 parent->rb_right = left;
65 parent->rb_left = left;
68 root->rb_node = left;
69 rb_set_parent(node, left);
229 struct rb_node *old = node, *left;
232 while ((left = node->rb_left) != NULL)
233 node = left;
390 /* If we have a right-hand child, go down and then left as far
399 /* No right-hand children. Everything down and left is
403 up. First time it's a left-hand child of its parent, said
419 /* If we have a left-hand child, go down and then right as far
428 /* No left-hand children. Go up till we find an ancestor which
