Home | History | Annotate | Download | only in zlib

Lines Matching refs:bl_count

142 local void gen_codes      OF((ct_data *tree, int max_code, ushf *bl_count));

243     ush bl_count[MAX_BITS+1];

291     for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;

293     while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;

294     while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;

295     while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;

296     while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;

301     gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);

484  *     array bl_count contains the frequencies for each bit length.

505     for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;

521         s->bl_count[bits]++;

536         while (s->bl_count[bits] == 0) bits--;

537         s->bl_count[bits]--;      /* move one leaf down the tree */

538         s->bl_count[bits+1] += 2; /* move one overflow item as its brother */

539         s->bl_count[max_length]--;

541          * but this does not affect bl_count[max_length]

552         n = s->bl_count[bits];

570  * IN assertion: the array bl_count contains the bit length statistics for

575 local void gen_codes (tree, max_code, bl_count)

578     ushf *bl_count;            /* number of codes at each bit length */

589         next_code[bits] = code = (code + bl_count[bits-1]) << 1;

591     /* Check that the bit counts in bl_count are consistent. The last code

594     Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,

698     gen_codes ((ct_data *)tree, max_code, s->bl_count);