Lines Matching refs:dist
5817 var dist; /* match distance */
5904 dist = here & 0xffff/*here.val*/;
5914 dist += hold & ((1 << op) - 1);
5916 if (dist > dmax) {
5926 if (dist > op) { /* see if copy from window */
5927 op = dist - op; /* distance back in window */
5966 from = _out - dist; /* rest from output */
5985 from = _out - dist; /* rest from output */
5997 from = _out - dist; /* rest from output */
6015 from = _out - dist; /* copy direct from output */
6400 var dist;
6419 dist = state.wsize - state.wnext;
6420 if (dist > copy) {
6421 dist = copy;
6424 utils.arraySet(state.window,src, end - copy, dist, state.wnext);
6425 copy -= dist;
6433 state.wnext += dist;
6435 if (state.whave < state.wsize) { state.whave += dist; }
8094 function d_code(dist) { argument
8095 return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];
8316 var dist; /* distance index */
8348 dist = 0;
8350 base_dist[code] = dist;
8352 _dist_code[dist++] = code;
8356 dist >>= 7; /* from now on, all distances are divided by 128 */
8358 base_dist[code] = dist << 7;
8360 _dist_code[256 + dist++] = code;
8522 var dist; /* distance of matched string */
8530 dist = (s.pending_buf[s.d_buf + lx*2] << 8) | (s.pending_buf[s.d_buf + lx*2 + 1]);
8534 if (dist === 0) {
8546 dist--; /* dist is now the match distance - 1 */
8547 code = d_code(dist);
8553 dist -= base_dist[code];
8554 send_bits(s, dist, extra); /* send the extra distance bits */
9060 function _tr_tally(s, dist, lc) argument
9067 s.pending_buf[s.d_buf + s.last_lit * 2] = (dist >>> 8) & 0xff;
9068 s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff;
9073 if (dist === 0) {
9079 dist--; /* dist = match distance - 1 */
9085 s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;