Cross Reference: /bind-9.11.3/lib/dns/rbt.c

Lines Matching defs:successor
1954 				 * the successor.  All the logic for finding
2591 	dns_rbtnode_t *successor;
2630 		 * deleted.  Find its immediate in-order successor and
2632 		 * old site of the successor.
2634 		successor = RIGHT(item);
2635 		while (LEFT(successor) != NULL)
2636 			successor = LEFT(successor);
2639 		 * The successor cannot possibly have a left child;
2642 		if (RIGHT(successor) != NULL)
2643 			child = RIGHT(successor);
2647 		 * the value being deleted with that of the successor,
2655 		 * First, put the successor in the tree location of the
2658 		 * delete to the successor's old location.
2660 		memmove(tmp, successor, sizeof(dns_rbtnode_t));
2663 			*rootp = successor;
2664 			successor->is_root = ISC_TRUE;
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);
2678 		if (LEFT(successor) != NULL)
2679 			PARENT(LEFT(successor)) = successor;
2680 		if (RIGHT(successor) != successor)
2681 			PARENT(RIGHT(successor)) = successor;
2685 		 * successor's previous tree location.  PARENT(tmp)
2686 		 * is the successor's original parent.
2692 			 * Node being deleted was successor's parent.
2694 			RIGHT(successor) = item;
2695 			PARENT(item) = successor;
2703 		 * Original location of successor node has no left.
3361 	dns_rbtnode_t *current, *successor;
3367 	successor = NULL;
3387 		successor = current;
3390 	if (successor != NULL) {
3391 		chain->end = successor;
3398 		 * in the megatree is a successor to that node, down at
3423 	dns_rbtnode_t *current, *previous, *successor;
3428 	successor = NULL;
3438 				successor = current;
3448 		successor = current;
3451 	if (successor != NULL) {
3452 		chain->end = successor;
3468 	dns_rbtnode_t *current, *previous, *successor;
3474 	successor = NULL;
3498 		successor = current;
3502 		 * The successor is up, either in this level or a previous one.
3504 		 * that was via a left link; the successor is the node that has
3517 					successor = current;
3522 			if (successor == NULL) {
3537 					 * looking for a successor as we really
3550 		} while (successor == NULL);
3553 	if (successor == NULL && RIGHT(current) != NULL) {
3559 		successor = current;
3562 	if (successor != NULL) {
3564 		 * If we determine that the current node is the successor to
3567 		INSIST(chain->end != successor);
3569 		chain->end = successor;
3576 		 * in the megatree is a successor to that node, down at