Lines Matching defs:dist
240 int dist; /* distance index */
270 /* Initialize the mapping dist (0..32K) -> dist code (0..29) */
271 dist = 0;
273 base_dist[code] = dist;
275 _dist_code[dist++] = (uch)code;
278 Assert (dist == 256, "tr_static_init: dist != 256");
279 dist >>= 7; /* from now on, all distances are divided by 128 */
281 base_dist[code] = dist << 7;
283 _dist_code[256 + dist++] = (uch)code;
286 Assert (dist == 256, "tr_static_init: 256+dist != 512");
1014 int ZLIB_INTERNAL _tr_tally (s, dist, lc)
1016 unsigned dist; /* distance of matched string */
1017 unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */
1019 s->d_buf[s->last_lit] = (ush)dist;
1021 if (dist == 0) {
1027 dist--; /* dist = match distance - 1 */
1028 Assert((ush)dist < (ush)MAX_DIST(s) &&
1030 (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");
1033 s->dyn_dtree[d_code(dist)].Freq++;
1069 unsigned dist; /* distance of matched string */
1070 int lc; /* match length or unmatched char (if dist == 0) */
1076 dist = s->d_buf[lx];
1078 if (dist == 0) {
1090 dist--; /* dist is now the match distance - 1 */
1091 code = d_code(dist);
1097 dist -= (unsigned)base_dist[code];
1098 send_bits(s, dist, extra); /* send the extra distance bits */