Lines Matching refs:dist
159 #define d_code(dist) \
160 ((dist) < 256 ? dist_code[dist] : dist_code[256+((dist)>>7)])
161 /* Mapping from a distance to a distance code. dist is the distance - 1 and
178 int dist; /* distance index */
199 /* Initialize the mapping dist (0..32K) -> dist code (0..29) */
200 dist = 0;
202 base_dist[code] = dist;
204 dist_code[dist++] = (uch)code;
207 Assert (dist == 256, "tr_static_init: dist != 256");
208 dist >>= 7; /* from now on, all distances are divided by 128 */
210 base_dist[code] = dist << 7;
212 dist_code[256 + dist++] = (uch)code;
215 Assert (dist == 256, "tr_static_init: 256+dist != 512");
917 unsigned dist, /* distance of matched string */
918 unsigned lc /* match length-MIN_MATCH or unmatched char (if dist==0) */
921 s->d_buf[s->last_lit] = (ush)dist;
923 if (dist == 0) {
929 dist--; /* dist = match distance - 1 */
930 Assert((ush)dist < (ush)MAX_DIST(s) &&
932 (ush)d_code(dist) < (ush)D_CODES, "zlib_tr_tally: bad match");
935 s->dyn_dtree[d_code(dist)].Freq++;
970 unsigned dist; /* distance of matched string */
971 int lc; /* match length or unmatched char (if dist == 0) */
977 dist = s->d_buf[lx];
979 if (dist == 0) {
991 dist--; /* dist is now the match distance - 1 */
992 code = d_code(dist);
998 dist -= base_dist[code];
999 send_bits(s, dist, extra); /* send the extra distance bits */