Lines Matching refs:predecessor
1018 * this case is handled here, because the predecessor
1035 * needs to be pointed at the DNSSEC predecessor of
1045 * predecessor.
1109 * necessarily the predecessor. If the stop
1111 * predecessor is at the end of a level below
1118 * the predecessor is handily encapsulated
1124 * no predecessor?
1142 * predecessor.
1159 * There is no predecessor.
2269 dns_rbtnode_t *current, *previous, *predecessor;
2275 predecessor = NULL;
2289 predecessor = current;
2303 predecessor = current;
2309 if (predecessor != NULL) {
2311 * Found a predecessor node in this level. It might not
2312 * really be the predecessor, however.
2314 if (DOWN(predecessor) != NULL) {
2316 * The predecessor is really down at least one level.
2327 ADD_LEVEL(chain, predecessor);
2328 predecessor = DOWN(predecessor);
2333 while (RIGHT(predecessor) != NULL)
2334 predecessor = RIGHT(predecessor);
2335 } while (DOWN(predecessor) != NULL);
2344 * Dang, didn't find a predecessor in this level.
2347 * node that points to this tree is the predecessor.
2350 predecessor = chain->levels[--chain->level_count];
2359 (chain->level_count > 0 || OFFSETLEN(predecessor) > 1))
2363 if (predecessor != NULL) {
2364 chain->end = predecessor;