Lines Matching refs:RIGHT

81 #define RIGHT(node)             ((node)->right)
348 while (RIGHT(node) != NULL)
349 node = RIGHT(node);
447 child = RIGHT(current);
543 RIGHT(new_current) = RIGHT(current);
553 RIGHT(parent) = new_current;
558 if (RIGHT(new_current) != NULL)
559 PARENT(RIGHT(new_current)) =
580 RIGHT(current) = NULL;
854 current = RIGHT(current);
1095 current = RIGHT(current);
1346 * LEFT(DOWN(parent)) == NULL && RIGHT(DOWN(parent)) == NULL.
1440 RIGHT(node) = NULL;
1598 child = RIGHT(node);
1601 RIGHT(node) = LEFT(child);
1618 RIGHT(PARENT(node)) = child;
1634 LEFT(node) = RIGHT(child);
1635 if (RIGHT(child) != NULL)
1636 PARENT(RIGHT(child)) = node;
1637 RIGHT(child) = node;
1651 RIGHT(PARENT(node)) = child;
1671 RIGHT(node) == NULL);
1699 INSIST(RIGHT(current) == NULL);
1700 RIGHT(current) = node;
1719 child = RIGHT(grandparent);
1726 if (node == RIGHT(parent)) {
1781 RIGHT(PARENT(delete)) == delete)));
1786 if (RIGHT(delete) == NULL) {
1798 child = RIGHT(delete);
1800 } else if (RIGHT(delete) == NULL)
1814 successor = RIGHT(delete);
1822 if (RIGHT(successor) != NULL)
1823 child = RIGHT(successor);
1851 RIGHT(PARENT(delete)) = successor;
1855 RIGHT(successor) = RIGHT(delete);
1860 if (RIGHT(successor) != successor)
1861 PARENT(RIGHT(successor)) = successor;
1874 RIGHT(successor) = delete;
1886 RIGHT(delete) = RIGHT(tmp);
1897 RIGHT(PARENT(delete)) = child;
1922 sibling = RIGHT(parent);
1928 sibling = RIGHT(parent);
1934 IS_BLACK(RIGHT(sibling))) {
1940 if (IS_BLACK(RIGHT(sibling))) {
1944 sibling = RIGHT(parent);
1949 INSIST(RIGHT(sibling) != NULL);
1950 MAKE_BLACK(RIGHT(sibling));
1973 IS_BLACK(RIGHT(sibling))) {
1979 MAKE_BLACK(RIGHT(sibling));
2031 if (RIGHT(node) != NULL) {
2032 result = dns_rbt_deletetree(rbt, RIGHT(node));
2035 RIGHT(node) = NULL;
2095 if (RIGHT(node) != NULL)
2096 PARENT(RIGHT(node)) = parent;
2099 LEFT(parent) = RIGHT(node);
2101 DOWN(parent) = RIGHT(node);
2103 parent = RIGHT(node);
2186 if (IS_RED(root) && IS_RED(RIGHT(root)))
2188 dns_rbt_printtree(RIGHT(root), root, depth);
2286 while (RIGHT(current) != NULL)
2287 current = RIGHT(current);
2302 if (RIGHT(current) == previous) {
2333 while (RIGHT(predecessor) != NULL)
2334 predecessor = RIGHT(predecessor);
2457 if (RIGHT(current) == NULL) {
2468 current = RIGHT(current);
2525 } else if (RIGHT(current) == NULL) {
2558 if (RIGHT(current) != NULL)
2564 if (successor == NULL && RIGHT(current) != NULL) {
2565 current = RIGHT(current);