Lines Matching defs:successor
1166 * the successor. All the logic for finding
1816 dns_rbtnode_t *successor;
1855 * deleted. Find its immediate in-order successor and
1857 * old site of the successor.
1859 successor = item->right;
1860 while (successor->left != NULL) {
1861 successor = successor->left;
1865 * The successor cannot possibly have a left child;
1868 if (successor->right != NULL) {
1869 child = successor->right;
1874 * the value being deleted with that of the successor,
1882 * First, put the successor in the tree location of the
1885 * delete to the successor's old location.
1887 saved_parent = successor->parent;
1888 saved_right = successor->right;
1889 saved_color = successor->color;
1892 *rootp = successor;
1893 successor->is_root = true;
1896 item->parent->left = successor;
1898 item->parent->right = successor;
1901 successor->parent = item->parent;
1902 successor->left = item->left;
1903 successor->right = item->right;
1904 successor->color = item->color;
1906 if (successor->left != NULL) {
1907 successor->left->parent = successor;
1909 if (successor->right != successor) {
1910 successor->right->parent = successor;
1915 * successor's previous tree location.
1921 * Node being deleted was successor
1923 successor->right = item;
1924 item->parent = successor;
1931 * Original location of successor node has no left.
2608 dns_rbtnode_t *current, *successor;
2614 successor = NULL;
2635 successor = current;
2638 if (successor != NULL) {
2639 chain->end = successor;
2646 * name, and everything in the megatree is a successor
2674 dns_rbtnode_t *current, *previous, *successor;
2679 successor = NULL;
2689 successor = current;
2700 successor = current;
2703 if (successor != NULL) {
2704 chain->end = successor;
2721 dns_rbtnode_t *current, *previous, *successor;
2727 successor = NULL;
2752 successor = current;
2755 * The successor is up, either in this level or a
2758 * successor is the node that has that left link. In
2771 successor = current;
2776 if (successor == NULL) {
2794 * looking for a successor as we
2809 } while (successor == NULL);
2812 if (successor == NULL && current->right != NULL) {
2819 successor = current;
2822 if (successor != NULL) {
2825 * successor to itself, we will run into an infinite
2828 INSIST(chain->end != successor);
2830 chain->end = successor;
2837 * name, and everything in the megatree is a successor
Indexes created Mon Jun 01 00:24:59 UTC 2026