Home | History | Annotate | Download | only in net

Lines Matching defs:DIST

556 int  _tr_tally(deflate_state *s, unsigned dist, unsigned lc);
564 #define d_code(dist) \
565 ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)])
566 /* Mapping from a distance to a distance code. dist is the distance - 1 and
591 ush dist = (distance); \
592 s->d_buf[s->last_lit] = dist; \
594 dist--; \
596 s->dyn_dtree[d_code(dist)].Freq++; \
2344 int dist; /* distance index */
2372 /* Initialize the mapping dist (0..32K) -> dist code (0..29) */
2373 dist = 0;
2375 base_dist[code] = dist;
2377 _dist_code[dist++] = (uch)code;
2380 Assert (dist == 256, "tr_static_init: dist != 256");
2381 dist >>= 7; /* from now on, all distances are divided by 128 */
2383 base_dist[code] = dist << 7;
2385 _dist_code[256 + dist++] = (uch)code;
2388 Assert (dist == 256, "tr_static_init: 256+dist != 512");
3118 unsigned dist, /* distance of matched string */
3119 unsigned lc) /* match length-MIN_MATCH or unmatched char (if dist==0) */
3121 s->d_buf[s->last_lit] = (ush)dist;
3123 if (dist == 0) {
3129 dist--; /* dist = match distance - 1 */
3130 Assert((ush)dist < (ush)MAX_DIST(s) &&
3132 (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");
3135 s->dyn_dtree[d_code(dist)].Freq++;
3171 unsigned dist; /* distance of matched string */
3172 int lc; /* match length or unmatched char (if dist == 0) */
3178 dist = s->d_buf[lx];
3180 if (dist == 0) {
3192 dist--; /* dist is now the match distance - 1 */
3193 code = d_code(dist);
3199 dist -= base_dist[code];
3200 send_bits(s, dist, extra); /* send the extra distance bits */
5077 DIST, /* i: get distance next */
5098 } code; /* if LEN or DIST, where in tree */
5102 uInt dist; /* distance back to copy from */
5218 c->mode = DIST;
5220 case DIST: /* i: get distance next */
5229 c->sub.copy.dist = t->base;
5246 c->sub.copy.dist += (uInt)b & inflate_mask[j];
5248 Tracevv((stderr, "inflate: distance %u\n", c->sub.copy.dist));
5252 f = q - c->sub.copy.dist;