Lines Matching refs:child
1141 dns_rbtnode_t **root, *parent, *child, *current, *new_current;
1174 * right child is NULL). This cannot be determined from the
1221 child = *root;
1229 current = child;
1246 child = LEFT(current);
1250 child = RIGHT(current);
1288 child = DOWN(current);
1430 } while (ISC_LIKELY(child != NULL));
2415 dns_rbtnode_t *child;
2420 child = RIGHT(node);
2421 INSIST(child != NULL);
2423 RIGHT(node) = LEFT(child);
2424 if (LEFT(child) != NULL)
2425 PARENT(LEFT(child)) = node;
2426 LEFT(child) = node;
2428 PARENT(child) = PARENT(node);
2431 *rootp = child;
2432 child->is_root = 1;
2437 LEFT(PARENT(node)) = child;
2439 RIGHT(PARENT(node)) = child;
2442 PARENT(node) = child;
2447 dns_rbtnode_t *child;
2452 child = LEFT(node);
2453 INSIST(child != NULL);
2455 LEFT(node) = RIGHT(child);
2456 if (RIGHT(child) != NULL)
2457 PARENT(RIGHT(child)) = node;
2458 RIGHT(child) = node;
2460 PARENT(child) = PARENT(node);
2463 *rootp = child;
2464 child->is_root = 1;
2469 LEFT(PARENT(node)) = child;
2471 RIGHT(PARENT(node)) = child;
2474 PARENT(node) = child;
2485 dns_rbtnode_t *child, *root, *parent, *grandparent;
2506 child = root;
2507 POST(child);
2539 child = RIGHT(grandparent);
2540 if (child != NULL && IS_RED(child)) {
2542 MAKE_BLACK(child);
2557 child = LEFT(grandparent);
2558 if (child != NULL && IS_RED(child)) {
2560 MAKE_BLACK(child);
2590 dns_rbtnode_t *child, *sibling, *parent;
2603 child = NULL;
2616 * This node has one child, on the right.
2618 child = RIGHT(item);
2622 * This node has one child, on the left.
2624 child = LEFT(item);
2639 * The successor cannot possibly have a left child;
2640 * if there is any child, it is on the right.
2643 child = RIGHT(successor);
2715 LEFT(PARENT(item)) = child;
2717 RIGHT(PARENT(item)) = child;
2719 if (child != NULL)
2720 PARENT(child) = PARENT(item);
2725 * it is known to have just one child.
2727 *rootp = child;
2728 child->is_root = 1;
2729 PARENT(child) = PARENT(item);
2738 while (child != *rootp && IS_BLACK(child)) {
2739 INSIST(child == NULL || ! IS_ROOT(child));
2741 if (LEFT(parent) == child) {
2756 child = parent;
2772 child = *rootp;
2777 * Child is parent's right child.
2795 child = parent;
2810 child = *rootp;
2814 parent = PARENT(child);
2817 if (IS_RED(child))
2818 MAKE_BLACK(child);
2989 * same number of BLACK child nodes. This is done separately
3269 * the way there the link from parent to child is a right