Lines Matching defs:ndist
628 * lengths (ndist), then they are treated as one long list of nlen + ndist
647 int nlen, ndist, ncode; /* number of lengths in descriptor */
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))
