Lines Matching refs:child
79 * its right child C are rearranged so that the P instead becomes the left
80 * child of C. The left subtree of C is inherited as the new right subtree
600 /* rotation between parent and child preserves grandpa */
642 dnode_t *nil = dict_nil(dict), *child, *delparent = delete->parent;
672 * moving up its right child into its place.
675 child = next->right;
676 child->parent = nextparent;
679 nextparent->left = child;
682 nextparent->right = child;
709 child = (delete->left != nil) ? delete->left : delete->right;
711 child->parent = delparent = delete->parent;
714 delparent->left = child;
717 delparent->right = child;
736 while (child->color == dnode_black) {
737 parent = child->parent;
738 if (child == parent->left) {
751 child = parent;
767 } else { /* symmetric case: child == child->parent->right */
768 dict_assert(child == parent->right);
781 child = parent;
800 child->color = dnode_black;
