Lines Matching refs:bl_count
473 ush bl_count[MAX_BITS+1]; member
2246 local void gen_codes(ct_data *tree, int max_code, ushf *bl_count);
2345 ush bl_count[MAX_BITS+1]; in tr_static_init() local
2391 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; in tr_static_init()
2393 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
2394 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
2395 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
2396 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
2401 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
2601 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0; in gen_bitlen()
2617 s->bl_count[bits]++; in gen_bitlen()
2632 while (s->bl_count[bits] == 0) bits--; in gen_bitlen()
2633 s->bl_count[bits]--; /* move one leaf down the tree */ in gen_bitlen()
2634 s->bl_count[bits+1] += 2; /* move one overflow item as its brother */ in gen_bitlen()
2635 s->bl_count[max_length]--; in gen_bitlen()
2648 n = s->bl_count[bits]; in gen_bitlen()
2673 ushf *bl_count) /* number of codes at each bit length */ in gen_codes() argument
2684 next_code[bits] = code = (code + bl_count[bits-1]) << 1; in gen_codes()
2689 Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1, in gen_codes()
2791 gen_codes ((ct_data *)tree, max_code, s->bl_count); in build_tree()