Lines Matching defs:level
26 int level = 0;
32 level++;
33 if (level > max_depth) return BROTLI_FALSE;
34 stack[level] = pool[p].index_right_or_value_;
38 depth[pool[p].index_right_or_value_] = (uint8_t)level;
40 while (level >= 0 && stack[level] == -1) level--;
41 if (level < 0) return BROTLI_TRUE;
42 p = stack[level];
43 stack[level] = -1;