| /external/zlib/contrib/infback9/ |
| inflate9.h | 41 unsigned ndist; /* number of distance code lengths */ member in struct:inflate_state
|
| 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),
|
| /external/qemu/distrib/zlib-1.2.3/ |
| inflate.h | 109 unsigned ndist; /* number of distance code lengths */ member in struct:inflate_state
|
| infback.c | 354 state->ndist = BITS(5) + 1;
359 if (state->nlen > 286 || state->ndist > 30) {
390 while (state->have < state->nlen + state->ndist) {
428 if (state->have + copy > state->nlen + state->ndist) {
454 ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,
|
| inflate.c | 841 state->ndist = BITS(5) + 1;
846 if (state->nlen > 286 || state->ndist > 30) {
877 while (state->have < state->nlen + state->ndist) {
[all...] |
| /external/zlib/ |
| inflate.h | 113 unsigned ndist; /* number of distance code lengths */ member in struct:inflate_state
|
| infback.c | 354 state->ndist = BITS(5) + 1;
359 if (state->nlen > 286 || state->ndist > 30) {
390 while (state->have < state->nlen + state->ndist) {
428 if (state->have + copy > state->nlen + state->ndist) {
463 ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,
|
| inflate.c | 885 state->ndist = BITS(5) + 1;
890 if (state->nlen > 286 || state->ndist > 30) {
[all...] |
| /external/zlib/contrib/puff/ |
| puff.c | 628 * lengths (ndist), then they are treated as one long list of nlen + ndist
647 int nlen, ndist, ncode; /* number of lengths in descriptor */ local
665 ndist = bits(s, 5) + 1;
667 if (nlen > MAXLCODES || ndist > MAXDCODES)
682 while (index < nlen + ndist) {
700 if (index + symbol > nlen + ndist)
717 err = construct(&distcode, lengths + nlen, ndist);
718 if (err < 0 || (err > 0 && ndist - distcode.count[0] != 1)
[all...] |
| /external/speex/libspeex/ |
| cb_search.c | 270 VARDECL(spx_word32_t *ndist);
335 ALLOC(ndist, N, spx_word32_t);
361 ndist[j]=VERY_LARGE32;
392 if (err<ndist[N-1])
396 if (err < ndist[m])
400 ndist[n] = ndist[n-1];
405 ndist[m] = err;
461 odist[j]=ndist[j];
|
