Lines Matching refs:window
13 * sliding window trailing behind the input currently being processed).
158 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
163 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
180 * Slide the hash table when sliding the window down (could be avoided with 32
244 * Fill the window when the lookahead becomes insufficient.
255 unsigned more; /* Amount of free space at the end of the window. */
276 /* If the window is almost full and there is insufficient lookahead,
281 zmemcpy(s->window, s->window + wsize, (unsigned)wsize - more);
305 n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
311 s->ins_h = s->window[str];
312 UPDATE_HASH(s, s->ins_h, s->window[str + 1]);
317 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
347 * bytes or up to end of window, whichever is less.
352 zmemzero(s->window + curr, (unsigned)init);
358 * to end of window, whichever is less.
363 zmemzero(s->window + s->high_water, (unsigned)init);
377 /* To do: ignore strm->next_in if we use it as window */
433 if (windowBits == 8) windowBits = 9; /* until 256-byte window bug fixed */
451 s->window = (Bytef *) ZALLOC(strm, s->w_size, 2*sizeof(Byte));
455 s->high_water = 0; /* nothing written to s->window yet */
501 if (s->window == Z_NULL || s->prev == Z_NULL || s->head == Z_NULL ||
572 /* if dictionary would fill window, just replace the history */
584 /* insert dictionary into window and hash */
594 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
630 zmemcpy(dictionary, s->window + s->strstart + s->lookahead - len, len);
826 * The larger expansion of 13% results from a window size less than or equal to
828 * the data being compressed may have slid out of the sliding window, impeding
1271 TRY_FREE(strm, strm->state->window);
1308 ds->window = (Bytef *) ZALLOC(dest, ds->w_size, 2*sizeof(Byte));
1313 if (ds->window == Z_NULL || ds->prev == Z_NULL || ds->head == Z_NULL ||
1319 zmemcpy(ds->window, ss->window, ds->w_size * 2 * sizeof(Byte));
1352 register Bytef *scan = s->window + s->strstart; /* current string */
1360 * we prevent matches with the string of window index 0.
1369 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1373 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1397 match = s->window + cur_match;
1420 * necessary to put more guard bytes at the end of the window, or
1433 /* Here, scan <= window + strstart + 257 */
1434 Assert(scan <= s->window + (unsigned)(s->window_size - 1),
1467 Assert(scan <= s->window + (unsigned)(s->window_size - 1),
1499 register Bytef *scan = s->window + s->strstart; /* current string */
1502 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1514 match = s->window + cur_match;
1539 Assert(scan <= s->window + (unsigned)(s->window_size - 1), "wild scan");
1561 Bytef *back = s->window + (int)match, *here = s->window + start;
1564 /* match starts one byte before the current window -- just compare the
1580 do { putc(s->window[start++], stderr); } while (--length != 0);
1593 (charf *)&s->window[(unsigned)s->block_start] : \
1645 * would be copied from what's left in the window.
1653 left = s->strstart - s->block_start; /* bytes left in window */
1661 * copying to the window and the pending buffer instead. Also don't
1690 /* Copy uncompressed bytes from the window to next_out. */
1694 zmemcpy(s->strm->next_out, s->window + s->block_start, left);
1713 /* Update the sliding window with the last s->w_size bytes of the copied
1714 * data, or append all of the copied data to the existing window if less
1721 /* If any input was used, then no unused input remains in the window,
1726 zmemcpy(s->window, s->strm->next_in - s->w_size, s->w_size);
1732 /* Slide the window down. */
1734 zmemcpy(s->window, s->window + s->w_size, s->strstart);
1740 zmemcpy(s->window + s->strstart, s->strm->next_in - used, used);
1758 /* Fill the window with any remaining input. */
1761 /* Slide the window down. */
1764 zmemcpy(s->window, s->window + s->w_size, s->strstart);
1774 read_buf(s->strm, s->window + s->strstart, have);
1797 _tr_stored_block(s, (charf *)s->window + s->block_start, len, last);
1831 /* Insert the string window[strstart .. strstart + 2] in the
1844 * of window index 0 (in particular we have to avoid a match
1878 s->ins_h = s->window[s->strstart];
1879 UPDATE_HASH(s, s->ins_h, s->window[s->strstart + 1]);
1889 Tracevv((stderr,"%c", s->window[s->strstart]));
1890 _tr_tally_lit(s, s->window[s->strstart], bflush);
1910 * no better match at the next window position.
1931 /* Insert the string window[strstart .. strstart + 2] in the
1947 * of window index 0 (in particular we have to avoid a match
2001 Tracevv((stderr,"%c", s->window[s->strstart - 1]));
2002 _tr_tally_lit(s, s->window[s->strstart - 1], bflush);
2020 Tracevv((stderr,"%c", s->window[s->strstart - 1]));
2021 _tr_tally_lit(s, s->window[s->strstart - 1], bflush);
2061 scan = s->window + s->strstart - 1;
2064 strend = s->window + s->strstart + MAX_MATCH;
2075 Assert(scan <= s->window + (uInt)(s->window_size - 1),
2090 Tracevv((stderr,"%c", s->window[s->strstart]));
2091 _tr_tally_lit(s, s->window[s->strstart], bflush);
2127 Tracevv((stderr,"%c", s->window[s->strstart]));
2128 _tr_tally_lit(s, s->window[s->strstart], bflush);