bl_count 140 lib/zlib_deflate/deftree.c static void gen_codes (ct_data *tree, int max_code, ush *bl_count); bl_count 233 lib/zlib_deflate/deftree.c ush bl_count[MAX_BITS+1]; bl_count 272 lib/zlib_deflate/deftree.c for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; bl_count 274 lib/zlib_deflate/deftree.c while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; bl_count 275 lib/zlib_deflate/deftree.c while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; bl_count 276 lib/zlib_deflate/deftree.c while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; bl_count 277 lib/zlib_deflate/deftree.c while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; bl_count 282 lib/zlib_deflate/deftree.c gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); bl_count 425 lib/zlib_deflate/deftree.c for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0; bl_count 441 lib/zlib_deflate/deftree.c s->bl_count[bits]++; bl_count 456 lib/zlib_deflate/deftree.c while (s->bl_count[bits] == 0) bits--; bl_count 457 lib/zlib_deflate/deftree.c s->bl_count[bits]--; /* move one leaf down the tree */ bl_count 458 lib/zlib_deflate/deftree.c s->bl_count[bits+1] += 2; /* move one overflow item as its brother */ bl_count 459 lib/zlib_deflate/deftree.c s->bl_count[max_length]--; bl_count 472 lib/zlib_deflate/deftree.c n = s->bl_count[bits]; bl_count 498 lib/zlib_deflate/deftree.c ush *bl_count /* number of codes at each bit length */ bl_count 510 lib/zlib_deflate/deftree.c next_code[bits] = code = (code + bl_count[bits-1]) << 1; bl_count 515 lib/zlib_deflate/deftree.c Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1, bl_count 619 lib/zlib_deflate/deftree.c gen_codes ((ct_data *)tree, max_code, s->bl_count); bl_count 176 lib/zlib_deflate/defutil.h ush bl_count[MAX_BITS+1];