MAX_BITS
ush bl_count[MAX_BITS+1];
{static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
{static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
ush bl_count[MAX_BITS+1];
for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
ush next_code[MAX_BITS+1]; /* next code value for each bit length */
for (bits = 1; bits <= MAX_BITS; bits++) {
Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
{static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
{static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
ush bl_count[MAX_BITS+1];
for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
ush next_code[MAX_BITS+1]; /* next code value for each bit length */
for (bits = 1; bits <= MAX_BITS; bits++) {
Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
ush bl_count[MAX_BITS+1];
ush bl_count[MAX_BITS+1];
{static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
{static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
ush bl_count[MAX_BITS+1];
for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
ush next_code[MAX_BITS+1]; /* next code value for each bit length */
for (bits = 1; bits <= MAX_BITS; bits++) {
Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
ush bl_count[MAX_BITS+1];
{static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
{static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
ush bl_count[MAX_BITS+1];
for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
ush next_code[MAX_BITS+1]; /* next code value for each bit length */
for (bits = 1; bits <= MAX_BITS; bits++) {
Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,