Lines Matching refs:child
372 dns_rbtnode_t **root, *parent, *child, *current, *new_current;
418 child = *root;
426 current = child;
443 child = LEFT(current);
447 child = RIGHT(current);
485 child = DOWN(current);
627 } while (child != NULL);
1593 dns_rbtnode_t *child;
1598 child = RIGHT(node);
1599 INSIST(child != NULL);
1601 RIGHT(node) = LEFT(child);
1602 if (LEFT(child) != NULL)
1603 PARENT(LEFT(child)) = node;
1604 LEFT(child) = node;
1606 if (child != NULL)
1607 PARENT(child) = PARENT(node);
1610 *rootp = child;
1611 child->is_root = 1;
1616 LEFT(PARENT(node)) = child;
1618 RIGHT(PARENT(node)) = child;
1621 PARENT(node) = child;
1626 dns_rbtnode_t *child;
1631 child = LEFT(node);
1632 INSIST(child != NULL);
1634 LEFT(node) = RIGHT(child);
1635 if (RIGHT(child) != NULL)
1636 PARENT(RIGHT(child)) = node;
1637 RIGHT(child) = node;
1639 if (child != NULL)
1640 PARENT(child) = PARENT(node);
1643 *rootp = child;
1644 child->is_root = 1;
1649 LEFT(PARENT(node)) = child;
1651 RIGHT(PARENT(node)) = child;
1654 PARENT(node) = child;
1665 dns_rbtnode_t *child, *root, *parent, *grandparent;
1686 child = root;
1687 POST(child);
1719 child = RIGHT(grandparent);
1720 if (child != NULL && IS_RED(child)) {
1722 MAKE_BLACK(child);
1737 child = LEFT(grandparent);
1738 if (child != NULL && IS_RED(child)) {
1740 MAKE_BLACK(child);
1770 dns_rbtnode_t *child, *sibling, *parent;
1783 child = NULL;
1796 * This node has one child, on the right.
1798 child = RIGHT(delete);
1802 * This node has one child, on the left.
1804 child = LEFT(delete);
1819 * The successor cannot possibly have a left child;
1820 * if there is any child, it is on the right.
1823 child = RIGHT(successor);
1895 LEFT(PARENT(delete)) = child;
1897 RIGHT(PARENT(delete)) = child;
1899 if (child != NULL)
1900 PARENT(child) = PARENT(delete);
1905 * it is known to have just one child.
1907 *rootp = child;
1908 child->is_root = 1;
1909 PARENT(child) = PARENT(delete);
1918 while (child != *rootp && IS_BLACK(child)) {
1919 INSIST(child == NULL || ! IS_ROOT(child));
1921 if (LEFT(parent) == child) {
1936 child = parent;
1952 child = *rootp;
1957 * Child is parent's right child.
1975 child = parent;
1990 child = *rootp;
1994 parent = PARENT(child);
1997 if (IS_RED(child))
1998 MAKE_BLACK(child);
2294 * the way there the link from parent to child is a right