Lines Matching defs:bl_count
321 ush bl_count[MAX_BITS+1];
1573 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
1677 ush bl_count[MAX_BITS+1];
1714 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
1716 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
1717 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
1718 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
1719 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
1724 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
1844 * array bl_count contains the frequencies for each bit length.
1865 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
1881 s->bl_count[bits]++;
1896 while (s->bl_count[bits] == 0) bits--;
1897 s->bl_count[bits]--; /* move one leaf down the tree */
1898 s->bl_count[bits+1] += 2; /* move one overflow item as its brother */
1899 s->bl_count[max_length]--;
1901 * but this does not affect bl_count[max_length]
1912 n = s->bl_count[bits];
1930 * IN assertion: the array bl_count contains the bit length statistics for
1935 local void gen_codes (tree, max_code, bl_count)
1938 ushf *bl_count; /* number of codes at each bit length */
1949 next_code[bits] = code = (code + bl_count[bits-1]) << 1;
1951 /* Check that the bit counts in bl_count are consistent. The last code
1954 Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
2057 gen_codes ((ct_data *)tree, max_code, s->bl_count);