Lines Matching defs:dist
242 int dist; /* distance index */
272 /* Initialize the mapping dist (0..32K) -> dist code (0..29) */
273 dist = 0;
275 base_dist[code] = dist;
277 _dist_code[dist++] = (uch)code;
280 Assert (dist == 256, "tr_static_init: dist != 256");
281 dist >>= 7; /* from now on, all distances are divided by 128 */
283 base_dist[code] = dist << 7;
285 _dist_code[256 + dist++] = (uch)code;
288 Assert (dist == 256, "tr_static_init: 256+dist != 512");
1010 int ZLIB_INTERNAL _tr_tally (s, dist, lc)
1012 unsigned dist; /* distance of matched string */
1013 unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */
1015 s->d_buf[s->last_lit] = (ush)dist;
1017 if (dist == 0) {
1023 dist--; /* dist = match distance - 1 */
1024 Assert((ush)dist < (ush)MAX_DIST(s) &&
1026 (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");
1029 s->dyn_dtree[d_code(dist)].Freq++;
1065 unsigned dist; /* distance of matched string */
1066 int lc; /* match length or unmatched char (if dist == 0) */
1072 dist = s->d_buf[lx];
1074 if (dist == 0) {
1086 dist--; /* dist is now the match distance - 1 */
1087 code = d_code(dist);
1093 dist -= base_dist[code];
1094 send_bits(s, dist, extra); /* send the extra distance bits */
