Lines Matching defs:count
200 * Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of
203 * entries is the sum of the counts in count[]. The decoding process can be
207 short *count; /* number of symbols of each length */
240 int count; /* number of codes of length len */
246 count = h->count[len];
247 if (code - count < first) /* if length len, return symbol */
249 index += count; /* else update for next length */
250 first += count;
268 int count; /* number of codes of length len */
278 next = h->count + 1;
283 count = *next++;
284 if (code - count < first) { /* if length len, return symbol */
289 index += count; /* else update for next length */
290 first += count;
322 * Not used by decode(), but used for error checking, h->count[0] is the number
323 * of the n symbols not in the code. So n - h->count[0] is the number of
343 int len; /* current length when stepping through h->count[] */
347 /* count number of codes of each length */
349 h->count[len] = 0;
351 (h->count[length[symbol]])++; /* assumes lengths are within bounds */
352 if (h->count[0] == n) /* no codes! */
359 left -= h->count[len]; /* deduct count from possible codes */
367 offs[len + 1] = offs[len] + h->count[len];
549 lencode.count = lencnt;
551 distcode.count = distcnt;
678 lencode.count = lencnt;
680 distcode.count = distcnt;
737 if (err && (err < 0 || nlen != lencode.count[0] + lencode.count[1]))
742 if (err && (err < 0 || ndist != distcode.count[0] + distcode.count[1]))