Lines Matching defs:bl_count
146 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
247 ush bl_count[MAX_BITS+1];
293 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
295 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
296 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
297 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
298 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
303 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
486 * array bl_count contains the frequencies for each bit length.
507 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
523 s->bl_count[bits]++;
538 while (s->bl_count[bits] == 0) bits--;
539 s->bl_count[bits]--; /* move one leaf down the tree */
540 s->bl_count[bits+1] += 2; /* move one overflow item as its brother */
541 s->bl_count[max_length]--;
543 * but this does not affect bl_count[max_length]
554 n = s->bl_count[bits];
572 * IN assertion: the array bl_count contains the bit length statistics for
577 local void gen_codes (tree, max_code, bl_count)
580 ushf *bl_count; /* number of codes at each bit length */
591 next_code[bits] = code = (code + bl_count[bits-1]) << 1;
593 /* Check that the bit counts in bl_count are consistent. The last code
596 Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
700 gen_codes ((ct_data *)tree, max_code, s->bl_count);