Lines Matching full:distance
12 * example Ben provided in the post is incorrect. The distance 110001 should
24 * 1.1 16 Feb 2003 - Fixed distance check for > 4 GB uncompressed data
246 * byte is 4, 5, or 6 for the number of extra bits in the distance code.
249 * - Compressed data is a combination of literals and length/distance pairs
251 * uncoded bytes. A length/distance pair is a coded length followed by a
252 * coded distance to represent a string that occurs earlier in the
255 * - A bit preceding a literal or length/distance pair indicates which comes
256 * next, 0 for literals, 1 for length/distance.
260 * no bit reversal is needed for either the length extra bits or the distance
263 * - Literal bytes are simply written to the output. A length/distance pair is
265 * copy is from distance bytes back in the output stream, copying for length
271 * - Overlapped copies, where the length is greater than the distance, are
272 * allowed and common. For example, a distance of one and a length of 518
273 * simply copies the last byte 518 times. A distance of four and a length of
275 * ignoring whether the length is greater than the distance or not implements
282 int symbol; /* decoded symbol, extra bits for distance */
284 unsigned dist; /* distance for copy */
293 static struct huffman distcode = {distcnt, distsym};/* distance code */
304 /* bit lengths of distance codes 0..63 */
325 /* decode literals and length/distance pairs */
333 /* get distance */
339 return -3; /* distance too far back */
341 /* copy length bytes from distance bytes back */
