bl_count          333 net/zlib.c         ush bl_count[MAX_BITS+1];
bl_count         1586 net/zlib.c     local void gen_codes      OF((ct_data *tree, int max_code, ushf *bl_count));
bl_count         1689 net/zlib.c         ush bl_count[MAX_BITS+1];
bl_count         1726 net/zlib.c         for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
bl_count         1728 net/zlib.c         while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
bl_count         1729 net/zlib.c         while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
bl_count         1730 net/zlib.c         while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
bl_count         1731 net/zlib.c         while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
bl_count         1736 net/zlib.c         gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
bl_count         1877 net/zlib.c         for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
bl_count         1893 net/zlib.c             s->bl_count[bits]++;
bl_count         1908 net/zlib.c             while (s->bl_count[bits] == 0) bits--;
bl_count         1909 net/zlib.c             s->bl_count[bits]--;      /* move one leaf down the tree */
bl_count         1910 net/zlib.c             s->bl_count[bits+1] += 2; /* move one overflow item as its brother */
bl_count         1911 net/zlib.c             s->bl_count[max_length]--;
bl_count         1924 net/zlib.c             n = s->bl_count[bits];
bl_count         1947 net/zlib.c     local void gen_codes (tree, max_code, bl_count)
bl_count         1950 net/zlib.c         ushf *bl_count;            /* number of codes at each bit length */
bl_count         1961 net/zlib.c             next_code[bits] = code = (code + bl_count[bits-1]) << 1;
bl_count         1966 net/zlib.c         Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
bl_count         2069 net/zlib.c         gen_codes ((ct_data *)tree, max_code, s->bl_count);