bl_count          200 lib/zlib/deflate.h     ush bl_count[MAX_BITS+1];
bl_count          146 lib/zlib/trees.c local void gen_codes      OF((ct_data *tree, int max_code, ushf *bl_count));
bl_count          247 lib/zlib/trees.c     ush bl_count[MAX_BITS+1];
bl_count          293 lib/zlib/trees.c     for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
bl_count          295 lib/zlib/trees.c     while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
bl_count          296 lib/zlib/trees.c     while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
bl_count          297 lib/zlib/trees.c     while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
bl_count          298 lib/zlib/trees.c     while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
bl_count          303 lib/zlib/trees.c     gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
bl_count          507 lib/zlib/trees.c     for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
bl_count          523 lib/zlib/trees.c         s->bl_count[bits]++;
bl_count          538 lib/zlib/trees.c         while (s->bl_count[bits] == 0) bits--;
bl_count          539 lib/zlib/trees.c         s->bl_count[bits]--;      /* move one leaf down the tree */
bl_count          540 lib/zlib/trees.c         s->bl_count[bits+1] += 2; /* move one overflow item as its brother */
bl_count          541 lib/zlib/trees.c         s->bl_count[max_length]--;
bl_count          554 lib/zlib/trees.c         n = s->bl_count[bits];
bl_count          577 lib/zlib/trees.c local void gen_codes (tree, max_code, bl_count)
bl_count          580 lib/zlib/trees.c     ushf *bl_count;            /* number of codes at each bit length */
bl_count          591 lib/zlib/trees.c         next_code[bits] = code = (code + bl_count[bits-1]) << 1;
bl_count          596 lib/zlib/trees.c     Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
bl_count          700 lib/zlib/trees.c     gen_codes ((ct_data *)tree, max_code, s->bl_count);