HomeSort by: relevance | last modified time | path
    Searched refs:ndist (Results 1 - 6 of 6) sorted by relevancy

  /src/common/dist/zlib/contrib/infback9/
inflate9.h 41 unsigned ndist; /* number of distance code lengths */ member in struct:inflate_state
infback9.c 339 state->ndist = BITS(5) + 1;
373 while (state->have < state->nlen + state->ndist) {
411 if (state->have + copy > state->nlen + state->ndist) {
447 state->ndist, &(state->next), &(distbits),
  /src/common/dist/zlib/contrib/puff/
puff.c 648 * lengths (ndist), then they are treated as one long list of nlen + ndist
667 int nlen, ndist, ncode; /* number of lengths in descriptor */ local in function:dynamic
685 ndist = bits(s, 5) + 1;
687 if (nlen > MAXLCODES || ndist > MAXDCODES)
703 while (index < nlen + ndist) {
724 if (index + symbol > nlen + ndist)
741 err = construct(&distcode, lengths + nlen, ndist);
742 if (err && (err < 0 || ndist != distcode.count[0] + distcode.count[1]))
  /src/common/dist/zlib/
inflate.h 117 unsigned ndist; /* number of distance code lengths */ member in struct:inflate_state
infback.c 352 state->ndist = BITS(5) + 1;
357 if (state->nlen > 286 || state->ndist > 30) {
388 while (state->have < state->nlen + state->ndist) {
425 if (state->have + copy > state->nlen + state->ndist) {
460 ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,
inflate.c 911 state->ndist = BITS(5) + 1;
916 if (state->nlen > 286 || state->ndist > 30) {
949 while (state->have < state->nlen + state->ndist) {
986 if (state->have + copy > state->nlen + state->ndist) {
1021 ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,

Completed in 17 milliseconds