Lines Matching refs:distance
318 /* number of distance codes */
389 * bytes. With this organization, matches are limited to a distance of
466 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
470 struct tree_desc_s d_desc; /* desc. for distance tree */
566 /* Mapping from a distance to a distance code. dist is the distance - 1 and
589 # define _tr_tally_dist(s, distance, length, flush) \
591 ush dist = (distance); \
601 # define _tr_tally_dist(s, distance, length, flush) \
602 flush = _tr_tally(s, distance, length)
715 /* Matches of length 3 are discarded if their distance exceeds TOO_FAR */
822 * output size for (length,distance) codes is <= 24 bits.
1342 * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
2034 local const int extra_dbits[D_CODES] /* extra bits for each distance code */
2068 /* The static distance tree. (Actually a trivial tree since all codes use
2073 /* Distance codes. The first 256 values correspond to the distances
2085 /* First normalized distance for each code (0 = distance of 1) */
2344 int dist; /* distance index */
2403 /* The static distance tree is trivial: */
2737 /* The pkzip format requires that at least one distance code exists,
2795 * Scan a literal or distance tree to determine the frequencies of the codes
2839 * Send a literal or distance tree in compressed form, using the codes in
2896 /* Determine the bit length frequencies for literal and distance trees */
2923 * lengths of the bit length codes, the literal tree and the distance tree.
2947 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
3031 /* Construct the literal and distance trees */
3118 unsigned dist, /* distance of matched string */
3129 dist--; /* dist = match distance - 1 */
3169 const ct_data *dtree) /* distance tree */
3171 unsigned dist; /* distance of matched string */
3192 dist--; /* dist is now the match distance - 1 */
3196 send_code(s, code, dtree); /* send the distance code */
3200 send_bits(s, dist, extra); /* send the extra distance bits */
3794 uInt base; /* literal, length base, distance base,
3814 uInt, /* number of distance codes */
3817 uIntf *, /* distance desired/actual bit depth */
3819 inflate_huft * FAR *, /* distance tree result */
3825 uIntf *, /* distance desired/actual bit depth */
3827 inflate_huft * FAR *, /* distance tree result */
3883 DTREE, /* get length, distance trees for a dynamic block */
3981 1. Distance pointers never point before the beginning of the output
3983 2. Distance pointers can point back across blocks, up to 32k away.
3989 5. There is no way of sending zero distance codes--a dummy must be
3991 store blocks with no distance codes, but this was discovered to be
3993 zero distance codes, which is sent as one code of zero bits in
3999 defined for them. Similarly, there are up to 30 distance codes.
4017 13. The literal/length and distance code bit lengths are read as a
4170 z->msg = "too many length or distance symbols";
4471 local const uInt cpdist[30] = { /* Copy offsets for distance codes 0..29 */
4475 local const uInt cpdext[30] = { /* Extra bits for distance codes */
4495 the distance codes. Subsequent tables are also less than or equal to
4505 bits. The distance table codes 30 possible values, or a little less
4747 uIntf *c, /* number of distance codes */
4751 inflate_huft * FAR *td, /* distance tree result */
4778 /* build distance tree */
4783 z->msg = "oversubscribed distance tree";
4789 z->msg = "incomplete distance tree";
4794 z->msg = "empty distance tree with lengths";
4978 uIntf *bd, /* distance desired/actual bit depth */
4980 inflate_huft * FAR *td, /* distance tree result */
5014 /* distance table */
5037 /* infcodes.c -- process literals and length/distance pairs
5077 DIST, /* i: get distance next */
5078 DISTEXT, /* i: getting distance extra */
5102 uInt dist; /* distance back to copy from */
5110 inflate_huft *dtree; /* distance tree */
5220 case DIST: /* i: get distance next */
5226 if (e & 16) /* distance */
5240 z->msg = "invalid distance code";
5243 case DISTEXT: /* i: getting distance extra */
5248 Tracevv((stderr, "inflate: distance %u\n", c->sub.copy.dist));
5402 /* inffast.c -- process literals and length/distance pairs fast
5429 distance pair plus four bytes for overloading the bit buffer. */
5446 uInt md; /* mask for distance tree */
5448 uInt d; /* distance back to copy from */
5482 /* decode distance base of block to copy */
5483 GRABBITS(15); /* max bits for distance code */
5489 /* get extra bits to add to distance base */
5494 Tracevv((stderr, "inflate: * distance %u\n", d));
5542 z->msg = "invalid distance code";
Indexes created Mon Oct 13 16:09:52 GMT 2025