Lines Matching defs:level_count
265 INSIST((chain)->level_count < DNS_RBT_LEVELBLOCK); \
266 (chain)->levels[(chain)->level_count++] = (node); \
1100 for (i = (int)chain->level_count - 1; i >= 0; i--) {
1147 unsigned int level_count;
1210 level_count = 0;
1290 INSIST(level_count < DNS_RBT_LEVELBLOCK);
1291 level_count++;
1311 if (level_count >= DNS_RBT_LEVELBLOCK) {
1379 INSIST(level_count < DNS_RBT_LEVELBLOCK);
1380 level_count++;
1794 chain->level_matches = chain->level_count;
1817 * chain->level_count is guaranteed to be at least 1
1821 chain->level_matches = chain->level_count - 1;
1829 unsigned int saved_count = chain->level_count;
1831 chain->level_count = chain->level_matches + 1;
1836 chain->level_count = saved_count;
1884 INSIST(chain->level_count > 0);
1886 chain->level_count);
1888 chain->levels[--chain->level_count];
3190 chain->level_count = 0;
3214 if (chain->level_count == 0) {
3231 if (chain->level_count > 0)
3317 } else if (chain->level_count > 0) {
3324 INSIST(chain->level_count > 0 && IS_ROOT(current));
3325 predecessor = chain->levels[--chain->level_count];
3334 (chain->level_count > 0 || OFFSETLEN(predecessor) > 1))
3377 if (chain->level_count > 0 ||
3488 if (chain->level_count > 0 ||
3527 if (chain->level_count == 0) {
3544 current = chain->levels[--chain->level_count];
3656 chain->level_count = 0;