Lines Matching refs:bl_count
202 local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) { in gen_codes() argument
212 code = (code + bl_count[bits - 1]) << 1; in gen_codes()
218 Assert (code + bl_count[MAX_BITS] - 1 == (1 << MAX_BITS) - 1, in gen_codes()
302 ush bl_count[MAX_BITS+1]; in tr_static_init() local
350 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; in tr_static_init()
352 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
353 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
354 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
355 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
360 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
552 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0; in gen_bitlen()
568 s->bl_count[bits]++; in gen_bitlen()
583 while (s->bl_count[bits] == 0) bits--; in gen_bitlen()
584 s->bl_count[bits]--; /* move one leaf down the tree */ in gen_bitlen()
585 s->bl_count[bits + 1] += 2; /* move one overflow item as its brother */ in gen_bitlen()
586 s->bl_count[max_length]--; in gen_bitlen()
599 n = s->bl_count[bits]; in gen_bitlen()
703 gen_codes ((ct_data *)tree, max_code, s->bl_count); in build_tree()