Lines Matching refs:HDIST
943 unsigned n, HLIT, HDIST, HCLEN, i;
958 HDIST = readBitsFromStream(bp, in, 5) + 1;
989 while(i < HLIT + HDIST)
1013 if(i >= HLIT + HDIST) ERROR_BREAK(13); /*error: i is larger than the amount of codes*/
1029 if(i >= HLIT + HDIST) ERROR_BREAK(14); /*error: i is larger than the amount of codes*/
1046 if(i >= HLIT + HDIST) ERROR_BREAK(15); /*error: i is larger than the amount of codes*/
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
1855 - HDIST + 1 code lengths of distance alphabet (encoded using the code length
1866 /*write the HLIT, HDIST and HCLEN values*/
1868 HDIST = (unsigned)(numcodes_d - 1);
1870 /*trim zeroes for HCLEN. HLIT and HDIST were already trimmed at tree creation*/
1873 addBitsToStream(bp, out, HDIST, 5);