Searched refs:levels (Results 1 - 4 of 4) sorted by relevance

/bind-9.6-ESV-R11/lib/dns/
H A Drbt.c137 (chain)->levels[(chain)->level_count++] = (node)
332 NODENAME(chain->levels[i], &nodename);
501 * Ensure the number of levels in the tree
503 * levels allowed by DNSSEC.
515 (sizeof(chain.levels) /
516 sizeof(*chain.levels))) {
986 while (chain->levels[chain->level_matches] != *node) {
1051 chain->levels[--chain->level_count];
1113 * Move down levels until the rightmost node
1248 * that had "b.c" as one of its levels
[all...]
H A Drbtdb.c1838 * case, the number of iteration is the number of tree levels, which is at
3142 level_node = search->chain.levels[j];
3204 * present at higher levels has no
3213 node = search->chain.levels[i];
3520 * At least one of the levels in the search chain
4198 level_node = search->chain.levels[i];
4248 node = search->chain.levels[i];
/bind-9.6-ESV-R11/lib/dns/include/dns/
H A Drbt.h185 * number of levels is allocated directly in the structure, but future
187 * growth. Allocating space for 256 levels when the tree is almost never that
198 * The terminal node of the chain. It is not in levels[].
207 * compute) of logical levels because splitting can potentially occur
212 dns_rbtnode_t * levels[DNS_RBT_LEVELBLOCK]; member in struct:dns_rbtnodechain
215 * tree of trees, and is the index into the levels[] array.
216 * Thus, levels[level_count - 1] is the last level node stored.
223 * level_matches tells how many levels matched above the node
404 *\li Within the chain structure, the 'levels' member of the structure holds
408 * predecessor name is, as an index into the 'levels[]' arra
[all...]
/bind-9.6-ESV-R11/bin/tests/
H A Dnamed.conf449 * Channels have a severity level. Messages at severity levels
451 * the channel. In order of decreasing severity, the levels are:

Completed in 49 milliseconds