Lines Matching refs:bl_count
20 * 00000020 b bl_count
904 ush bl_count[MAX_BITS + 1];
1058 * array bl_count contains the frequencies for each bit length.
1078 G2.bl_count[bits] = 0;
1098 G2.bl_count[bits]++;
1117 while (G2.bl_count[bits] == 0)
1119 G2.bl_count[bits]--; /* move one leaf down the tree */
1120 G2.bl_count[bits + 1] += 2; /* move one overflow item as its brother */
1121 G2.bl_count[max_length]--;
1123 * but this does not affect bl_count[max_length]
1134 n = G2.bl_count[bits];
1153 * IN assertion: the array bl_count contains the bit length statistics for
1169 next_code[bits] = code = (code + G2.bl_count[bits - 1]) << 1;
1171 /* Check that the bit counts in bl_count are consistent. The last code
1174 Assert(code + G2.bl_count[MAX_BITS] - 1 == (1 << MAX_BITS) - 1,
1935 G2.bl_count[n] = 0; */
1940 G2.bl_count[8]++;
1944 G2.bl_count[9]++;
1948 G2.bl_count[7]++;
1952 G2.bl_count[8]++;