Cross Reference: /bind-9.6-ESV-R11/lib/dns/rbt.c

Lines Matching defs:successor
1117 				 * the successor.  All the logic for finding
1771 	dns_rbtnode_t *successor;
1810 		 * deleted.  Find its immediate in-order successor and
1812 		 * old site of the successor.
1814 		successor = RIGHT(delete);
1815 		while (LEFT(successor) != NULL)
1816 			successor = LEFT(successor);
1819 		 * The successor cannot possibly have a left child;
1822 		if (RIGHT(successor) != NULL)
1823 			child = RIGHT(successor);
1827 		 * the value being deleted with that of the successor,
1835 		 * First, put the successor in the tree location of the
1838 		 * delete to the successor's old location.
1840 		memmove(tmp, successor, sizeof(dns_rbtnode_t));
1843 			*rootp = successor;
1844 			successor->is_root = ISC_TRUE;
1849 				LEFT(PARENT(delete)) = successor;
1851 				RIGHT(PARENT(delete)) = successor;
1853 		PARENT(successor) = PARENT(delete);
1854 		LEFT(successor)   = LEFT(delete);
1855 		RIGHT(successor)  = RIGHT(delete);
1856 		COLOR(successor)  = COLOR(delete);
1858 		if (LEFT(successor) != NULL)
1859 			PARENT(LEFT(successor)) = successor;
1860 		if (RIGHT(successor) != successor)
1861 			PARENT(RIGHT(successor)) = successor;
1865 		 * successor's previous tree location.  PARENT(tmp)
1866 		 * is the successor's original parent.
1872 			 * Node being deleted was successor's parent.
1874 			RIGHT(successor) = delete;
1875 			PARENT(delete) = successor;
1883 		 * Original location of successor node has no left.
2386 	dns_rbtnode_t *current, *successor;
2392 	successor = NULL;
2412 		successor = current;
2415 	if (successor != NULL) {
2416 		chain->end = successor;
2423 		 * in the megatree is a successor to that node, down at
2448 	dns_rbtnode_t *current, *previous, *successor;
2453 	successor = NULL;
2463 				successor = current;
2473 		successor = current;
2476 	if (successor != NULL) {
2477 		chain->end = successor;
2493 	dns_rbtnode_t *current, *previous, *successor;
2499 	successor = NULL;
2523 		successor = current;
2527 		 * The successor is up, either in this level or a previous one.
2529 		 * that was via a left link; the successor is the node that has
2542 					successor = current;
2547 			if (successor == NULL) {
2561 		} while (successor == NULL);
2564 	if (successor == NULL && RIGHT(current) != NULL) {
2570 		successor = current;
2573 	if (successor != NULL) {
2574 		chain->end = successor;
2581 		 * in the megatree is a successor to that node, down at