Lines Matching refs:window
38 * sliding window trailing behind the input currently being processed).
212 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
217 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
239 /* To do: ignore strm->next_in if we use it as window */
299 if (windowBits == 8) windowBits = 9; /* until 256-byte window bug fixed */
316 s->window = (Bytef *) ZALLOC(strm, s->w_size, 2*sizeof(Byte));
326 if (s->window == Z_NULL || s->prev == Z_NULL || s->head == Z_NULL ||
368 zmemcpy(s->window, dictionary, length);
376 s->ins_h = s->window[0];
377 UPDATE_HASH(s, s->ins_h, s->window[1]);
910 TRY_FREE(strm, strm->state->window);
949 ds->window = (Bytef *) ZALLOC(dest, ds->w_size, 2*sizeof(Byte));
955 if (ds->window == Z_NULL || ds->prev == Z_NULL || ds->head == Z_NULL ||
961 zmemcpy(ds->window, ss->window, ds->w_size * 2 * sizeof(Byte));
1061 register Bytef *scan = s->window + s->strstart; /* current string */
1069 * we prevent matches with the string of window index 0.
1078 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1082 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1105 match = s->window + cur_match;
1128 * necessary to put more guard bytes at the end of the window, or
1141 /* Here, scan <= window+strstart+257 */
1142 Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
1174 Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
1208 register Bytef *scan = s->window + s->strstart; /* current string */
1211 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1222 match = s->window + cur_match;
1247 Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
1267 if (zmemcmp(s->window + match,
1268 s->window + start, length) != EQUAL) {
1272 fprintf(stderr, "%c%c", s->window[match++], s->window[start++]);
1278 do { putc(s->window[start++], stderr); } while (--length != 0);
1286 * Fill the window when the lookahead becomes insufficient.
1300 unsigned more; /* Amount of free space at the end of the window. */
1319 /* If the window is almost full and there is insufficient lookahead,
1324 zmemcpy(s->window, s->window+wsize, (unsigned)wsize);
1371 n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
1376 s->ins_h = s->window[s->strstart];
1377 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1395 (charf *)&s->window[(unsigned)s->block_start] : \
1417 * window to pending_buf.
1435 /* Fill the window as much as possible: */
1498 /* Insert the string window[strstart .. strstart+2] in the
1510 * of window index 0 (in particular we have to avoid a match
1555 s->ins_h = s->window[s->strstart];
1556 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1566 Tracevv((stderr,"%c", s->window[s->strstart]));
1567 _tr_tally_lit (s, s->window[s->strstart], bflush);
1581 * no better match at the next window position.
1605 /* Insert the string window[strstart .. strstart+2] in the
1620 * of window index 0 (in particular we have to avoid a match
1678 Tracevv((stderr,"%c", s->window[s->strstart-1]));
1679 _tr_tally_lit(s, s->window[s->strstart-1], bflush);
1697 Tracevv((stderr,"%c", s->window[s->strstart-1]));
1698 _tr_tally_lit(s, s->window[s->strstart-1], bflush);
1739 scan = s->window + s->strstart - 1;
1755 Tracevv((stderr,"%c", s->window[s->strstart]));
1756 _tr_tally_lit (s, s->window[s->strstart], bflush);