Lines Matching refs:rb_left
38 * All stores to the tree structure (rb_left and rb_right) must be done using
116 if (parent != tmp) { /* parent == gparent->rb_left */
154 tmp = node->rb_left;
156 WRITE_ONCE(node->rb_left, parent);
176 WRITE_ONCE(gparent->rb_left, tmp); /* == parent->rb_right */
184 tmp = gparent->rb_left;
195 tmp = parent->rb_left;
199 WRITE_ONCE(parent->rb_left, tmp);
207 tmp = node->rb_left;
211 WRITE_ONCE(gparent->rb_right, tmp); /* == parent->rb_left */
212 WRITE_ONCE(parent->rb_left, gparent);
241 if (node != sibling) { /* node == parent->rb_left */
252 tmp1 = sibling->rb_left;
254 WRITE_ONCE(sibling->rb_left, parent);
263 tmp2 = sibling->rb_left;
320 WRITE_ONCE(sibling->rb_left, tmp1);
342 tmp2 = sibling->rb_left;
344 WRITE_ONCE(sibling->rb_left, parent);
353 sibling = parent->rb_left;
357 WRITE_ONCE(parent->rb_left, tmp1);
365 tmp1 = sibling->rb_left;
383 tmp1 = tmp2->rb_left;
385 WRITE_ONCE(tmp2->rb_left, sibling);
386 WRITE_ONCE(parent->rb_left, tmp2);
396 WRITE_ONCE(parent->rb_left, tmp2);
473 while (n->rb_left)
474 n = n->rb_left;
505 while (node->rb_left)
506 node = node->rb_left;
535 if (node->rb_left) {
536 node = node->rb_left;
546 while ((parent = rb_parent(node)) && node == parent->rb_left)
562 if (victim->rb_left)
563 rb_set_parent(victim->rb_left, new);
579 if (victim->rb_left)
580 rb_set_parent(victim->rb_left, new);
595 if (node->rb_left)
596 node = node->rb_left;
612 if (parent && node == parent->rb_left && parent->rb_right) {