Lines Matching refs:nlen
608 * - Given the number of literal/length code lengths (nlen) and distance code
609 * lengths (ndist), then they are treated as one long list of nlen + ndist
628 int nlen, ndist, ncode; /* number of lengths in descriptor */
640 nlen = bits(s, 5) + 257;
643 if (nlen > MAXLCODES || ndist > MAXDCODES)
658 while (index < nlen + ndist) {
676 if (index + symbol > nlen + ndist)
684 err = construct(&lencode, lengths, nlen);
685 if (err < 0 || (err > 0 && nlen - lencode.count[0] != 1))
689 err = construct(&distcode, lengths + nlen, ndist);