Lines Matching defs:predecessor
1855 * this case is handled here, because the predecessor
1872 * needs to be pointed at the DNSSEC predecessor of
1882 * predecessor.
1946 * necessarily the predecessor. If the stop
1948 * predecessor is at the end of a level below
1955 * the predecessor is handily encapsulated
1961 * no predecessor?
1979 * predecessor.
1996 * There is no predecessor.
3244 dns_rbtnode_t *current, *previous, *predecessor;
3250 predecessor = NULL;
3264 predecessor = current;
3278 predecessor = current;
3284 if (predecessor != NULL) {
3286 * Found a predecessor node in this level. It might not
3287 * really be the predecessor, however.
3289 if (DOWN(predecessor) != NULL) {
3291 * The predecessor is really down at least one level.
3302 ADD_LEVEL(chain, predecessor);
3303 predecessor = DOWN(predecessor);
3308 while (RIGHT(predecessor) != NULL)
3309 predecessor = RIGHT(predecessor);
3310 } while (DOWN(predecessor) != NULL);
3319 * Dang, didn't find a predecessor in this level.
3322 * node that points to this tree is the predecessor.
3325 predecessor = chain->levels[--chain->level_count];
3334 (chain->level_count > 0 || OFFSETLEN(predecessor) > 1))
3338 if (predecessor != NULL) {
3339 chain->end = predecessor;