Lines Matching defs:left
77 struct rbt_node *left = node->rbt_left;
80 node->rbt_left = left->rbt_right;
82 rbt_set_parent(left->rbt_right, node);
83 left->rbt_right = node;
85 rbt_set_parent(left, parent);
90 parent->rbt_right = left;
92 parent->rbt_left = left;
95 root->rbt_node = left;
96 rbt_set_parent(node, left);
255 struct rbt_node *old = node, *left;
258 for (left = node->rbt_left; left != NULL; left = node->rbt_left)
259 node = left;
346 /* If we have a right-hand child, go down and then left as far
355 /* No right-hand children. Everything down and left is
359 up. First time it's a left-hand child of its parent, said
374 /* If we have a left-hand child, go down and then right as far
383 /* No left-hand children. Go up till we find an ancestor which