Lines Matching defs:bl_count

196  * IN assertion: the array bl_count contains the bit length statistics for
201 local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) {
211         code = (code + bl_count[bits - 1]) << 1;
214     /* Check that the bit counts in bl_count are consistent. The last code
217     Assert (code + bl_count[MAX_BITS] - 1 == (1 << MAX_BITS) - 1,
301     ush bl_count[MAX_BITS+1];
349     for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
351     while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
352     while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
353     while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
354     while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
359     gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
534  *     array bl_count contains the frequencies for each bit length.
552     for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
568         s->bl_count[bits]++;
583         while (s->bl_count[bits] == 0) bits--;
584         s->bl_count[bits]--;        /* move one leaf down the tree */
585         s->bl_count[bits + 1] += 2; /* move one overflow item as its brother */
586         s->bl_count[max_length]--;
588          * but this does not affect bl_count[max_length]
599         n = s->bl_count[bits];
703     gen_codes ((ct_data *)tree, max_code, s->bl_count);