Lines Matching refs:HLIT
943 unsigned n, HLIT, HDIST, HCLEN, i;
956 HLIT = readBitsFromStream(bp, in, 5) + 257;
989 while(i < HLIT + HDIST)
994 if(i < HLIT) bitlen_ll[i] = code;
995 else bitlen_d[i - HLIT] = code;
1008 if(i < HLIT + 1) value = bitlen_ll[i - 1];
1009 else value = bitlen_d[i - HLIT - 1];
1013 if(i >= HLIT + HDIST) ERROR_BREAK(13); /*error: i is larger than the amount of codes*/
1014 if(i < HLIT) bitlen_ll[i] = value;
1015 else bitlen_d[i - HLIT] = value;
1029 if(i >= HLIT + HDIST) ERROR_BREAK(14); /*error: i is larger than the amount of codes*/
1031 if(i < HLIT) bitlen_ll[i] = 0;
1032 else bitlen_d[i - HLIT] = 0;
1046 if(i >= HLIT + HDIST) ERROR_BREAK(15); /*error: i is larger than the amount of codes*/
1048 if(i < HLIT) bitlen_ll[i] = 0;
1049 else bitlen_d[i - HLIT] = 0;
1069 /*now we've finally got HLIT and HDIST, so generate the code trees, and the function is done*/
1713 unsigned HLIT, HDIST, HCLEN;
1851 - 5 bits HLIT, 5 bits HDIST, 4 bits HCLEN
1853 - HLIT + 257 code lenghts of lit/length alphabet (encoded using the code length
1866 /*write the HLIT, HDIST and HCLEN values*/
1867 HLIT = (unsigned)(numcodes_ll - 257);
1870 /*trim zeroes for HCLEN. HLIT and HDIST were already trimmed at tree creation*/
1872 addBitsToStream(bp, out, HLIT, 5);
