Lines Matching refs:level_count
137 (chain)->levels[(chain)->level_count++] = (node)
331 for (i = (int)chain->level_count - 1; i >= 0; i--) {
514 if (chain.level_count ==
957 chain->level_matches = chain->level_count;
980 * chain->level_count is guaranteed to be at least 1
984 chain->level_matches = chain->level_count - 1;
992 unsigned int saved_count = chain->level_count;
994 chain->level_count = chain->level_matches + 1;
999 chain->level_count = saved_count;
1047 INSIST(chain->level_count > 0);
1049 chain->level_count);
1051 chain->levels[--chain->level_count];
2215 chain->level_count = 0;
2239 if (chain->level_count == 0) {
2256 if (chain->level_count > 0)
2342 } else if (chain->level_count > 0) {
2349 INSIST(chain->level_count > 0 && IS_ROOT(current));
2350 predecessor = chain->levels[--chain->level_count];
2359 (chain->level_count > 0 || OFFSETLEN(predecessor) > 1))
2402 if (chain->level_count > 0 ||
2513 if (chain->level_count > 0 ||
2552 if (chain->level_count == 0)
2555 current = chain->levels[--chain->level_count];
2661 chain->level_count = 0;