dist              282 lib/zlib/contrib/blast/blast.c     int dist;           /* distance for copy */
dist              333 lib/zlib/contrib/blast/blast.c             dist = decode(s, &distcode) << symbol;
dist              334 lib/zlib/contrib/blast/blast.c             dist += bits(s, symbol);
dist              335 lib/zlib/contrib/blast/blast.c             dist++;
dist              336 lib/zlib/contrib/blast/blast.c             if (s->first && dist > s->next)
dist              342 lib/zlib/contrib/blast/blast.c                 from = to - dist;
dist              344 lib/zlib/contrib/blast/blast.c                 if (s->next < dist) {
dist              346 lib/zlib/contrib/blast/blast.c                     copy = dist;
dist               96 lib/zlib/contrib/inflate86/inffas86.c /*112   68 */ unsigned dist;            /*     r15  match distance */
dist              101 lib/zlib/contrib/masmx64/inffas8664.c /*112   68 */ unsigned dist;            /*     r15  match distance */
dist              420 lib/zlib/contrib/puff/puff.c     unsigned dist;      /* distance for copy */
dist              457 lib/zlib/contrib/puff/puff.c             dist = dists[symbol] + bits(s, dext[symbol]);
dist              458 lib/zlib/contrib/puff/puff.c             if (dist > s->outcnt)
dist              465 lib/zlib/contrib/puff/puff.c                     s->out[s->outcnt] = s->out[s->outcnt - dist];
dist              283 lib/zlib/deflate.h int  _tr_tally        OF((deflate_state *s, unsigned dist, unsigned lc));
dist              290 lib/zlib/deflate.h #define d_code(dist) \
dist              291 lib/zlib/deflate.h    ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)])
dist              317 lib/zlib/deflate.h     ush dist = (distance); \
dist              318 lib/zlib/deflate.h     s->d_buf[s->last_lit] = dist; \
dist              320 lib/zlib/deflate.h     dist--; \
dist              322 lib/zlib/deflate.h     s->dyn_dtree[d_code(dist)].Freq++; \
dist               94 lib/zlib/inffast.c     unsigned dist;              /* match distance */
dist              165 lib/zlib/inffast.c                 dist = (unsigned)(this.val);
dist              175 lib/zlib/inffast.c                 dist += (unsigned)hold & ((1U << op) - 1);
dist              177 lib/zlib/inffast.c                 if (dist > dmax) {
dist              185 lib/zlib/inffast.c                 Tracevv((stderr, "inflate:         distance %u\n", dist));
dist              187 lib/zlib/inffast.c                 if (dist > op) {                /* see if copy from window */
dist              188 lib/zlib/inffast.c                     op = dist - op;             /* distance back in window */
dist              202 lib/zlib/inffast.c                             from = out - dist;  /* rest from output */
dist              220 lib/zlib/inffast.c                                 from = out - dist;      /* rest from output */
dist              231 lib/zlib/inffast.c                             from = out - dist;  /* rest from output */
dist              247 lib/zlib/inffast.c                     from = out - dist;          /* copy direct from output */
dist              328 lib/zlib/inflate.c     unsigned copy, dist;
dist              355 lib/zlib/inflate.c         dist = state->wsize - state->write;
dist              356 lib/zlib/inflate.c         if (dist > copy) dist = copy;
dist              357 lib/zlib/inflate.c         zmemcpy(state->window + state->write, strm->next_out - copy, dist);
dist              358 lib/zlib/inflate.c         copy -= dist;
dist              365 lib/zlib/inflate.c             state->write += dist;
dist              367 lib/zlib/inflate.c             if (state->whave < state->wsize) state->whave += dist;
dist              246 lib/zlib/trees.c     int dist;     /* distance index */
dist              275 lib/zlib/trees.c     dist = 0;
dist              277 lib/zlib/trees.c         base_dist[code] = dist;
dist              279 lib/zlib/trees.c             _dist_code[dist++] = (uch)code;
dist              282 lib/zlib/trees.c     Assert (dist == 256, "tr_static_init: dist != 256");
dist              283 lib/zlib/trees.c     dist >>= 7; /* from now on, all distances are divided by 128 */
dist              285 lib/zlib/trees.c         base_dist[code] = dist << 7;
dist              287 lib/zlib/trees.c             _dist_code[256 + dist++] = (uch)code;
dist              290 lib/zlib/trees.c     Assert (dist == 256, "tr_static_init: 256+dist != 512");
dist             1022 lib/zlib/trees.c int _tr_tally (s, dist, lc)
dist             1024 lib/zlib/trees.c     unsigned dist;  /* distance of matched string */
dist             1027 lib/zlib/trees.c     s->d_buf[s->last_lit] = (ush)dist;
dist             1029 lib/zlib/trees.c     if (dist == 0) {
dist             1035 lib/zlib/trees.c         dist--;             /* dist = match distance - 1 */
dist             1036 lib/zlib/trees.c         Assert((ush)dist < (ush)MAX_DIST(s) &&
dist             1038 lib/zlib/trees.c                (ush)d_code(dist) < (ush)D_CODES,  "_tr_tally: bad match");
dist             1041 lib/zlib/trees.c         s->dyn_dtree[d_code(dist)].Freq++;
dist             1077 lib/zlib/trees.c     unsigned dist;      /* distance of matched string */
dist             1084 lib/zlib/trees.c         dist = s->d_buf[lx];
dist             1086 lib/zlib/trees.c         if (dist == 0) {
dist             1098 lib/zlib/trees.c             dist--; /* dist is now the match distance - 1 */
dist             1099 lib/zlib/trees.c             code = d_code(dist);
dist             1105 lib/zlib/trees.c                 dist -= base_dist[code];
dist             1106 lib/zlib/trees.c                 send_bits(s, dist, extra);   /* send the extra distance bits */