Lines Matching defs:item
450 deletefromlevel(dns_rbtnode_t *item, dns_rbtnode_t **rootp);
2589 deletefromlevel(dns_rbtnode_t *item, dns_rbtnode_t **rootp) {
2593 REQUIRE(item != NULL);
2598 INSIST((IS_ROOT(item) && *rootp == item) ||
2599 (! IS_ROOT(item) &&
2600 (LEFT(PARENT(item)) == item ||
2601 RIGHT(PARENT(item)) == item)));
2605 if (LEFT(item) == NULL) {
2606 if (RIGHT(item) == NULL) {
2607 if (IS_ROOT(item)) {
2609 * This is the only item in the tree.
2618 child = RIGHT(item);
2620 } else if (RIGHT(item) == NULL)
2624 child = LEFT(item);
2634 successor = RIGHT(item);
2662 if (IS_ROOT(item)) {
2665 item->is_root = ISC_FALSE;
2668 if (LEFT(PARENT(item)) == item)
2669 LEFT(PARENT(item)) = successor;
2671 RIGHT(PARENT(item)) = successor;
2673 PARENT(successor) = PARENT(item);
2674 LEFT(successor) = LEFT(item);
2675 RIGHT(successor) = RIGHT(item);
2676 COLOR(successor) = COLOR(item);
2688 INSIST(! IS_ROOT(item));
2690 if (PARENT(tmp) == item) {
2694 RIGHT(successor) = item;
2695 PARENT(item) = successor;
2698 LEFT(PARENT(tmp)) = item;
2699 PARENT(item) = PARENT(tmp);
2705 LEFT(item) = NULL;
2706 RIGHT(item) = RIGHT(tmp);
2707 COLOR(item) = COLOR(tmp);
2713 if (! IS_ROOT(item)) {
2714 if (LEFT(PARENT(item)) == item)
2715 LEFT(PARENT(item)) = child;
2717 RIGHT(PARENT(item)) = child;
2720 PARENT(child) = PARENT(item);
2729 PARENT(child) = PARENT(item);
2735 if (IS_BLACK(item)) {
2736 parent = PARENT(item);