Lines Matching refs:bl_count
139 static void gen_codes (ct_data *tree, int max_code, ush *bl_count);
233 ush bl_count[MAX_BITS+1];
272 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
274 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
275 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
276 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
277 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
282 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
403 * array bl_count contains the frequencies for each bit length.
425 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
441 s->bl_count[bits]++;
456 while (s->bl_count[bits] == 0) bits--;
457 s->bl_count[bits]--; /* move one leaf down the tree */
458 s->bl_count[bits+1] += 2; /* move one overflow item as its brother */
459 s->bl_count[max_length]--;
461 * but this does not affect bl_count[max_length]
472 n = s->bl_count[bits];
490 * IN assertion: the array bl_count contains the bit length statistics for
498 ush *bl_count /* number of codes at each bit length */
510 next_code[bits] = code = (code + bl_count[bits-1]) << 1;
512 /* Check that the bit counts in bl_count are consistent. The last code
515 Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
619 gen_codes ((ct_data *)tree, max_code, s->bl_count);