Lines Matching refs:bl_count
276 local ush near bl_count[MAX_BITS+1];
534 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
536 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
537 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
538 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
539 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
635 * array bl_count contains the frequencies for each bit length.
655 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
671 bl_count[bits]++;
686 while (bl_count[bits] == 0) bits--;
687 bl_count[bits]--; /* move one leaf down the tree */
688 bl_count[bits+1] += (ush)2; /* move one overflow item as its brother */
689 bl_count[max_length]--;
691 * but this does not affect bl_count[max_length]
702 n = bl_count[bits];
719 * IN assertion: the array bl_count contains the bit length statistics for
737 next_code[bits] = code = (ush)((code + bl_count[bits-1]) << 1);
739 /* Check that the bit counts in bl_count are consistent. The last code
742 Assert(code + bl_count[MAX_BITS]-1 == (1<< ((ush) MAX_BITS)) - 1,