Lines Matching refs:bits
598 unsigned bits = G1.bi_buf; in bi_windup() local
602 put_8bit(bits); in bi_windup()
603 bits >>= 8; in bi_windup()
1166 int bits; /* bit length */ in gen_bitlen() local
1169 for (bits = 0; bits < ARRAY_SIZE(G2.bl_count); bits++) in gen_bitlen()
1170 G2.bl_count[bits] = 0; in gen_bitlen()
1183 bits = tree[tree[n].Dad].Len + 1; in gen_bitlen()
1184 if (bits > desc->max_length) { in gen_bitlen()
1185 bits = desc->max_length; in gen_bitlen()
1188 tree[n].Len = (ush) bits; in gen_bitlen()
1194 G2.bl_count[bits]++; in gen_bitlen()
1199 G2.opt_len += f * (bits + xbits); in gen_bitlen()
1212 bits = desc->max_length - 1; in gen_bitlen()
1213 while (G2.bl_count[bits] == 0) in gen_bitlen()
1214 bits--; in gen_bitlen()
1215 G2.bl_count[bits]--; /* move one leaf down the tree */ in gen_bitlen()
1216 G2.bl_count[bits + 1] += 2; /* move one overflow item as its brother */ in gen_bitlen()
1229 for (bits = desc->max_length; bits != 0; bits--) { in gen_bitlen()
1230 n = G2.bl_count[bits]; in gen_bitlen()
1235 if (tree[m].Len != (unsigned) bits) { in gen_bitlen()
1236 Trace((stderr, "code %d bits %d->%d\n", m, tree[m].Len, bits)); in gen_bitlen()
1237 G2.opt_len += ((int32_t) bits - tree[m].Len) * tree[m].Freq; in gen_bitlen()
1238 tree[m].Len = bits; in gen_bitlen()
1259 int bits; /* bit index */ in gen_codes() local
1265 for (bits = 1; bits <= MAX_BITS; bits++) { in gen_codes()
1266 next_code[bits] = code = (code + G2.bl_count[bits - 1]) << 1; in gen_codes()