Lines Matching refs:bl_count
135 static void gen_codes (ct_data *tree, int max_code, ush *bl_count);
179 ush bl_count[MAX_BITS+1]; in tr_static_init() local
218 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; in tr_static_init()
220 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
221 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
222 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
223 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
228 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
371 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0; in gen_bitlen()
387 s->bl_count[bits]++; in gen_bitlen()
402 while (s->bl_count[bits] == 0) bits--; in gen_bitlen()
403 s->bl_count[bits]--; /* move one leaf down the tree */ in gen_bitlen()
404 s->bl_count[bits+1] += 2; /* move one overflow item as its brother */ in gen_bitlen()
405 s->bl_count[max_length]--; in gen_bitlen()
418 n = s->bl_count[bits]; in gen_bitlen()
444 ush *bl_count /* number of codes at each bit length */ in gen_codes() argument
456 next_code[bits] = code = (code + bl_count[bits-1]) << 1; in gen_codes()
461 Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1, in gen_codes()
565 gen_codes ((ct_data *)tree, max_code, s->bl_count); in build_tree()