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;
312 * If we have a right-hand child, go down and then left as far
323 * No right-hand children. Everything down and left is smaller than us,
326 * parent, keep going up. First time it's a left-hand child of its
