Lines Matching refs:left
82 while (node->left)
83 node = node->left;
116 } else if (u == p->left) {
117 p->left = v;
132 x->right = y->left;
133 if (y->left)
134 rb_node_set_parent(y->left, x);
136 y->left = x;
143 assert(y && y->left);
145 struct rb_node *x = y->left;
146 y->left = x->right;
169 assert(parent->left == NULL);
170 parent->left = node;
181 assert(z == z_p->left || z == z_p->right);
184 if (z_p == z_p_p->left) {
197 assert(z == z_p->left || z == z_p->right);
205 struct rb_node *y = z_p_p->left;
212 if (z == z_p->left) {
217 assert(z == z_p->left || z == z_p->right);
238 if (z->left == NULL) {
243 x = z->left;
260 assert(y->left == NULL);
262 y->left = z->left;
263 rb_node_set_parent(y->left, y);
267 assert(x_p == NULL || x == x_p->left || x == x_p->right);
274 if (x == x_p->left) {
280 assert(x == x_p->left);
283 if (rb_node_is_black(w->left) && rb_node_is_black(w->right)) {
288 rb_node_set_black(w->left);
300 struct rb_node *w = x_p->left;
306 w = x_p->left;
308 if (rb_node_is_black(w->right) && rb_node_is_black(w->left)) {
312 if (rb_node_is_black(w->left)) {
316 w = x_p->left;
320 rb_node_set_black(w->left);
348 * node) is the left-most child of our right child.
353 * left until we hit a parent to the right.
360 assert(p == NULL || node == p->left);
368 if (node->left) {
369 /* If we have a left child, then the previous thing (compared to
370 * this node) is the right-most child of our left child.
372 return rb_node_maximum(node->left);
374 /* If node doesn't have a left child, crawl back up the to the
375 * right until we hit a parent to the left.
378 while (p && node == p->left) {
398 assert(rb_node_is_black(n->left));
402 validate_rb_node(n->left, black_depth);
415 for (struct rb_node *n = T->root; n; n = n->left) {