rb_right 51 lib/util/rbtree.c struct rb_node *right = node->rb_right; rb_right 54 lib/util/rbtree.c if ((node->rb_right = right->rb_left)) rb_right 65 lib/util/rbtree.c parent->rb_right = right; rb_right 77 lib/util/rbtree.c if ((node->rb_left = left->rb_right)) rb_right 78 lib/util/rbtree.c rb_set_parent(left->rb_right, node); rb_right 79 lib/util/rbtree.c left->rb_right = node; rb_right 85 lib/util/rbtree.c if (node == parent->rb_right) rb_right 86 lib/util/rbtree.c parent->rb_right = left; rb_right 106 lib/util/rbtree.c register struct rb_node *uncle = gparent->rb_right; rb_right 117 lib/util/rbtree.c if (parent->rb_right == node) rb_right 169 lib/util/rbtree.c other = parent->rb_right; rb_right 175 lib/util/rbtree.c other = parent->rb_right; rb_right 178 lib/util/rbtree.c (!other->rb_right || rb_is_black(other->rb_right))) rb_right 186 lib/util/rbtree.c if (!other->rb_right || rb_is_black(other->rb_right)) rb_right 193 lib/util/rbtree.c other = parent->rb_right; rb_right 197 lib/util/rbtree.c if (other->rb_right) rb_right 198 lib/util/rbtree.c rb_set_black(other->rb_right); rb_right 215 lib/util/rbtree.c (!other->rb_right || rb_is_black(other->rb_right))) rb_right 226 lib/util/rbtree.c if ((o_right = other->rb_right)) rb_right 252 lib/util/rbtree.c child = node->rb_right; rb_right 253 lib/util/rbtree.c else if (!node->rb_right) rb_right 259 lib/util/rbtree.c node = node->rb_right; rb_right 262 lib/util/rbtree.c child = node->rb_right; rb_right 269 lib/util/rbtree.c parent->rb_right = child; rb_right 275 lib/util/rbtree.c node->rb_right = old->rb_right; rb_right 283 lib/util/rbtree.c rb_parent(old)->rb_right = node; rb_right 288 lib/util/rbtree.c if (old->rb_right) rb_right 289 lib/util/rbtree.c rb_set_parent(old->rb_right, node); rb_right 303 lib/util/rbtree.c parent->rb_right = child; rb_right 335 lib/util/rbtree.c while (n->rb_right) rb_right 336 lib/util/rbtree.c n = n->rb_right; rb_right 349 lib/util/rbtree.c if (node->rb_right) { rb_right 350 lib/util/rbtree.c node = node->rb_right; rb_right 362 lib/util/rbtree.c while ((parent = rb_parent(node)) && node == parent->rb_right) rb_right 379 lib/util/rbtree.c while (node->rb_right) rb_right 380 lib/util/rbtree.c node=node->rb_right; rb_right 402 lib/util/rbtree.c parent->rb_right = new_node; rb_right 408 lib/util/rbtree.c if (victim->rb_right) rb_right 409 lib/util/rbtree.c rb_set_parent(victim->rb_right, new_node); rb_right 419 lib/util/rbtree.c node->rb_left = node->rb_right = NULL; rb_right 100 lib/util/rbtree.h struct rb_node *rb_right; rb_right 175 source3/lib/dbwrap_rbt.c p = &(*p)->rb_right; rb_right 232 source3/lib/dbwrap_rbt.c n = n->rb_right; rb_right 314 source3/lib/dbwrap_rbt.c n = n->rb_right; rb_right 140 source3/lib/memcache.c node = (cmp < 0) ? node->rb_left : node->rb_right; rb_right 327 source3/lib/memcache.c p = (cmp < 0) ? &(*p)->rb_left : &(*p)->rb_right; rb_right 392 source3/lib/memcache.c next = node->rb_right;