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