lib/libz/deflate.h

208

ush bl_count[MAX_BITS+1];

lib/libz/trees.c

130

{static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};

lib/libz/trees.c

133

{static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};

lib/libz/trees.c

202

ush next_code[MAX_BITS+1]; /* next code value for each bit length */

lib/libz/trees.c

210

for (bits = 1; bits <= MAX_BITS; bits++) {

lib/libz/trees.c

217

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

lib/libz/trees.c

301

ush bl_count[MAX_BITS+1];

lib/libz/trees.c

349

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

lib/libz/trees.c

552

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

sys/lib/libz/deflate.h

208

ush bl_count[MAX_BITS+1];

sys/lib/libz/trees.c

130

{static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};

sys/lib/libz/trees.c

133

{static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};

sys/lib/libz/trees.c

202

ush next_code[MAX_BITS+1]; /* next code value for each bit length */

sys/lib/libz/trees.c

210

for (bits = 1; bits <= MAX_BITS; bits++) {

sys/lib/libz/trees.c

217

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

sys/lib/libz/trees.c

301

ush bl_count[MAX_BITS+1];

sys/lib/libz/trees.c

349

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

sys/lib/libz/trees.c

552

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