Searched refs:ndist (Results 1 - 12 of 12) sorted by relevance
/haiku-buildtools/gcc/zlib/contrib/infback9/ |
H A D | inflate9.h | 41 unsigned ndist; /* number of distance code lengths */ member in struct:inflate_state
|
H A D | infback9.c | 351 state->ndist = BITS(5) + 1; 385 while (state->have < state->nlen + state->ndist) { 423 if (state->have + copy > state->nlen + state->ndist) { 459 state->ndist, &(state->next), &(distbits),
|
/haiku-buildtools/binutils/zlib/contrib/infback9/ |
H A D | inflate9.h | 41 unsigned ndist; /* number of distance code lengths */ member in struct:inflate_state
|
H A D | infback9.c | 349 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),
|
/haiku-buildtools/gcc/zlib/ |
H A D | inflate.h | 113 unsigned ndist; /* number of distance code lengths */ member in struct:inflate_state
|
H A D | infback.c | 363 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,
|
H A D | inflate.c | 900 state->ndist = BITS(5) + 1; 905 if (state->nlen > 286 || state->ndist > 30) { 936 while (state->have < state->nlen + state->ndist) { 973 if (state->have + copy > state->nlen + state->ndist) { 1008 ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,
|
/haiku-buildtools/binutils/zlib/ |
H A D | inflate.h | 113 unsigned ndist; /* number of distance code lengths */ member in struct:inflate_state
|
H A D | infback.c | 363 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,
|
H A D | inflate.c | 901 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,
|
/haiku-buildtools/gcc/zlib/contrib/puff/ |
H A D | puff.c | 647 * lengths (ndist), then they are treated as one long list of nlen + ndist 666 int nlen, ndist, ncode; /* number of lengths in descriptor */ local 684 ndist = bits(s, 5) + 1; 686 if (nlen > MAXLCODES || ndist > MAXDCODES) 702 while (index < nlen + ndist) { 721 if (index + symbol > nlen + ndist) 738 err = construct(&distcode, lengths + nlen, ndist); 739 if (err && (err < 0 || ndist != distcode.count[0] + distcode.count[1]))
|
/haiku-buildtools/binutils/zlib/contrib/puff/ |
H A D | 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 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]))
|
Completed in 137 milliseconds