Lines Matching refs:window
11 * sliding window trailing behind the input currently being processed).
182 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
187 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
209 /* To do: ignore strm->next_in if we use it as window */
276 if (windowBits == 8) windowBits = 9; /* until 256-byte window bug fixed */
293 s->window = (Bytef *) ZALLOC(strm, s->w_size, 2*sizeof(Byte));
297 s->high_water = 0; /* nothing written to s->window yet */
305 if (s->window == Z_NULL || s->prev == Z_NULL || s->head == Z_NULL ||
346 /* if dictionary would fill window, just replace the history */
358 /* insert dictionary into window and hash */
368 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
1001 TRY_FREE(strm, strm->state->window);
1040 ds->window = (Bytef *) ZALLOC(dest, ds->w_size, 2*sizeof(Byte));
1046 if (ds->window == Z_NULL || ds->prev == Z_NULL || ds->head == Z_NULL ||
1052 zmemcpy(ds->window, ss->window, ds->w_size * 2 * sizeof(Byte));
1153 register Bytef *scan = s->window + s->strstart; /* current string */
1161 * we prevent matches with the string of window index 0.
1170 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1174 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1197 match = s->window + cur_match;
1220 * necessary to put more guard bytes at the end of the window, or
1233 /* Here, scan <= window+strstart+257 */
1234 Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
1266 Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
1301 register Bytef *scan = s->window + s->strstart; /* current string */
1304 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1315 match = s->window + cur_match;
1340 Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
1362 if (zmemcmp(s->window + match,
1363 s->window + start, length) != EQUAL) {
1367 fprintf(stderr, "%c%c", s->window[match++], s->window[start++]);
1373 do { putc(s->window[start++], stderr); } while (--length != 0);
1381 * Fill the window when the lookahead becomes insufficient.
1395 unsigned more; /* Amount of free space at the end of the window. */
1416 /* If the window is almost full and there is insufficient lookahead,
1421 zmemcpy(s->window, s->window+wsize, (unsigned)wsize);
1467 n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
1473 s->ins_h = s->window[str];
1474 UPDATE_HASH(s, s->ins_h, s->window[str + 1]);
1479 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
1509 * bytes or up to end of window, whichever is less.
1514 zmemzero(s->window + curr, (unsigned)init);
1520 * to end of window, whichever is less.
1525 zmemzero(s->window + s->high_water, (unsigned)init);
1540 (charf *)&s->window[(unsigned)s->block_start] : \
1562 * window to pending_buf.
1580 /* Fill the window as much as possible: */
1649 /* Insert the string window[strstart .. strstart+2] in the
1662 * of window index 0 (in particular we have to avoid a match
1696 s->ins_h = s->window[s->strstart];
1697 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1707 Tracevv((stderr,"%c", s->window[s->strstart]));
1708 _tr_tally_lit (s, s->window[s->strstart], bflush);
1728 * no better match at the next window position.
1752 /* Insert the string window[strstart .. strstart+2] in the
1768 * of window index 0 (in particular we have to avoid a match
1822 Tracevv((stderr,"%c", s->window[s->strstart-1]));
1823 _tr_tally_lit(s, s->window[s->strstart-1], bflush);
1841 Tracevv((stderr,"%c", s->window[s->strstart-1]));
1842 _tr_tally_lit(s, s->window[s->strstart-1], bflush);
1885 scan = s->window + s->strstart - 1;
1888 strend = s->window + s->strstart + MAX_MATCH;
1899 Assert(scan <= s->window+(uInt)(s->window_size-1), "wild scan");
1913 Tracevv((stderr,"%c", s->window[s->strstart]));
1914 _tr_tally_lit (s, s->window[s->strstart], bflush);
1953 Tracevv((stderr,"%c", s->window[s->strstart]));
1954 _tr_tally_lit (s, s->window[s->strstart], bflush);