Lines Matching defs:minLen
87 int minLen, maxLen;
236 int minLen, maxLen, pp;
272 minLen = maxLen = length[0];
277 else if (length[i] < minLen)
278 minLen = length[i];
297 hufGroup->minLen = minLen;
299 /* Note that minLen can't be smaller than 1, so we
308 for (i = minLen; i <= maxLen; i++) {
324 for (i = minLen; i < maxLen; i++) {
343 base[minLen] = 0;
370 back up than it is to read minLen bits and then an
395 i = hufGroup->minLen;