Lines Matching defs:bl_count
209 * IN assertion: the array bl_count contains the bit length statistics for
214 local void gen_codes(ct_data *tree, int max_code, ushf *bl_count)
225 code = (code + bl_count[bits - 1]) << 1;
228 /* Check that the bit counts in bl_count are consistent. The last code
231 Assert (code + bl_count[MAX_BITS] - 1 == (1 << MAX_BITS) - 1,
317 ush bl_count[MAX_BITS+1];
365 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
367 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
368 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
369 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
370 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
375 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
552 * array bl_count contains the frequencies for each bit length.
571 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
587 s->bl_count[bits]++;
602 while (s->bl_count[bits] == 0) bits--;
603 s->bl_count[bits]--; /* move one leaf down the tree */
604 s->bl_count[bits + 1] += 2; /* move one overflow item as its brother */
605 s->bl_count[max_length]--;
607 * but this does not affect bl_count[max_length]
618 n = s->bl_count[bits];
723 gen_codes ((ct_data *)tree, max_code, s->bl_count);