Lines Matching refs:levels
137 (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 -- and the RBT has no idea what
2217 memset(chain->levels, 0, sizeof(chain->levels));
2350 predecessor = chain->levels[--chain->level_count];
2555 current = chain->levels[--chain->level_count];