Home
last modified time | relevance | path

Searched refs:ndist (Results 1 – 6 of 6) sorted by relevance

/toolchain/binutils/binutils-2.27/zlib/contrib/puff/
Dpuff.c667 int nlen, ndist, ncode; /* number of lengths in descriptor */ in dynamic() local
685 ndist = bits(s, 5) + 1; in dynamic()
687 if (nlen > MAXLCODES || ndist > MAXDCODES) in dynamic()
703 while (index < nlen + ndist) { in dynamic()
724 if (index + symbol > nlen + ndist) in dynamic()
741 err = construct(&distcode, lengths + nlen, ndist); in dynamic()
742 if (err && (err < 0 || ndist != distcode.count[0] + distcode.count[1])) in dynamic()
/toolchain/binutils/binutils-2.27/zlib/
Dinfback.c363 state->ndist = BITS(5) + 1;
368 if (state->nlen > 286 || state->ndist > 30) {
399 while (state->have < state->nlen + state->ndist) {
436 if (state->have + copy > state->nlen + state->ndist) {
471 ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,
Dinflate.h113 unsigned ndist; /* number of distance code lengths */ member
Dinflate.c901 state->ndist = BITS(5) + 1;
906 if (state->nlen > 286 || state->ndist > 30) {
937 while (state->have < state->nlen + state->ndist) {
974 if (state->have + copy > state->nlen + state->ndist) {
1009 ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,
/toolchain/binutils/binutils-2.27/zlib/contrib/infback9/
Dinflate9.h41 unsigned ndist; /* number of distance code lengths */ member
Dinfback9.c349 state->ndist = BITS(5) + 1;
383 while (state->have < state->nlen + state->ndist) {
421 if (state->have + copy > state->nlen + state->ndist) {
457 state->ndist, &(state->next), &(distbits),