Lines Matching full:child
78 * its right child C are rearranged so that the P instead becomes the left
79 * child of C. The left subtree of C is inherited as the new right subtree
618 /* rotation between parent and child preserves grandpa */
661 dnode_t *nil = dict_nil(dict), *child, *delparent = delete->parent;
691 * moving up its right child into its place.
694 child = next->right;
695 child->parent = nextparent;
698 nextparent->left = child;
701 nextparent->right = child;
728 child = (delete->left != nil) ? delete->left : delete->right;
730 child->parent = delparent = delete->parent;
733 delparent->left = child;
736 delparent->right = child;
755 while (child->color == dnode_black) {
756 parent = child->parent;
757 if (child == parent->left) {
770 child = parent;
786 } else { /* symmetric case: child == child->parent->right */
787 assert (child == parent->right);
800 child = parent;
819 child->color = dnode_black;
