Lines Matching defs:count
97 * Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of
100 * entries is the sum of the counts in count[]. The decoding process can be
104 short *count; /* number of symbols of each length */
134 int count; /* number of codes of length len */
144 next = h->count + 1;
149 count = *next++;
150 if (code < first + count) { /* if length len, return symbol */
155 index += count; /* else update for next length */
156 first += count;
176 * count (high four bits + 1) and a code length (low four bits), generate the
194 int len; /* current length when stepping through h->count[] */
211 /* count number of codes of each length */
213 h->count[len] = 0;
215 (h->count[length[symbol]])++; /* assumes lengths are within bounds */
216 if (h->count[0] == n) /* no codes! */
223 left -= h->count[len]; /* deduct count from possible codes */
230 offs[len + 1] = offs[len] + h->count[len];
457 /* count any leftover bytes */