Lines Matching refs:bl_count
147 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
248 ush bl_count[MAX_BITS+1];
296 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
298 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
299 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
300 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
301 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
306 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
490 * array bl_count contains the frequencies for each bit length.
511 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
527 s->bl_count[bits]++;
542 while (s->bl_count[bits] == 0) bits--;
543 s->bl_count[bits]--; /* move one leaf down the tree */
544 s->bl_count[bits+1] += 2; /* move one overflow item as its brother */
545 s->bl_count[max_length]--;
547 * but this does not affect bl_count[max_length]
558 n = s->bl_count[bits];
576 * IN assertion: the array bl_count contains the bit length statistics for
581 local void gen_codes (tree, max_code, bl_count)
584 ushf *bl_count; /* number of codes at each bit length */
595 next_code[bits] = code = (code + bl_count[bits-1]) << 1;
597 /* Check that the bit counts in bl_count are consistent. The last code
600 Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
704 gen_codes ((ct_data *)tree, max_code, s->bl_count);
