Lines Matching defs:bl_count
473 ush bl_count[MAX_BITS+1];
2246 local void gen_codes(ct_data *tree, int max_code, ushf *bl_count);
2345 ush bl_count[MAX_BITS+1];
2391 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
2393 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
2394 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
2395 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
2396 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
2401 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
2581 * array bl_count contains the frequencies for each bit length.
2601 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
2617 s->bl_count[bits]++;
2632 while (s->bl_count[bits] == 0) bits--;
2633 s->bl_count[bits]--; /* move one leaf down the tree */
2634 s->bl_count[bits+1] += 2; /* move one overflow item as its brother */
2635 s->bl_count[max_length]--;
2637 * but this does not affect bl_count[max_length]
2648 n = s->bl_count[bits];
2666 * IN assertion: the array bl_count contains the bit length statistics for
2673 ushf *bl_count) /* number of codes at each bit length */
2684 next_code[bits] = code = (code + bl_count[bits-1]) << 1;
2686 /* Check that the bit counts in bl_count are consistent. The last code
2689 Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
2791 gen_codes ((ct_data *)tree, max_code, s->bl_count);