Lines Matching refs:window

18  *      sliding window trailing behind the input currently being processed).
190 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
195 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
218 /* 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));
303 if (s->window == Z_NULL || s->prev == Z_NULL || s->head == Z_NULL ||
345 (void) zmemcpy(s->window, dictionary, length);
353 s->ins_h = s->window[0];
354 UPDATE_HASH(s, s->ins_h, s->window[1]);
887 TRY_FREE(strm, strm->state->window);
926 ds->window = (Bytef *) ZALLOC(dest, ds->w_size, 2*sizeof(Byte));
932 if (ds->window == Z_NULL || ds->prev == Z_NULL || ds->head == Z_NULL ||
938 zmemcpy(ds->window, ss->window, ds->w_size * 2 * sizeof(Byte));
1038 register Bytef *scan = s->window + s->strstart; /* current string */
1046 * we prevent matches with the string of window index 0.
1055 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1059 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1082 match = s->window + cur_match;
1105 * necessary to put more guard bytes at the end of the window, or
1118 /* Here, scan <= window+strstart+257 */
1119 Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
1151 Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
1185 register Bytef *scan = s->window + s->strstart; /* current string */
1188 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1199 match = s->window + cur_match;
1224 Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
1244 if (zmemcmp(s->window + match,
1245 s->window + start, length) != EQUAL) {
1249 fprintf(stderr, "%c%c", s->window[match++], s->window[start++]);
1255 do { putc(s->window[start++], stderr); } while (--length != 0);
1263 * Fill the window when the lookahead becomes insufficient.
1277 unsigned more; /* Amount of free space at the end of the window. */
1296 /* If the window is almost full and there is insufficient lookahead,
1301 zmemcpy(s->window, s->window+wsize, (unsigned)wsize);
1348 n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
1353 s->ins_h = s->window[s->strstart];
1354 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1372 (charf *)&s->window[(unsigned)s->block_start] : \
1394 * window to pending_buf.
1412 /* Fill the window as much as possible: */
1475 /* Insert the string window[strstart .. strstart+2] in the
1487 * of window index 0 (in particular we have to avoid a match
1532 s->ins_h = s->window[s->strstart];
1533 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1543 Tracevv((stderr,"%c", s->window[s->strstart]));
1544 _tr_tally_lit (s, s->window[s->strstart], bflush);
1558 * no better match at the next window position.
1582 /* Insert the string window[strstart .. strstart+2] in the
1597 * of window index 0 (in particular we have to avoid a match
1655 Tracevv((stderr,"%c", s->window[s->strstart-1]));
1656 _tr_tally_lit(s, s->window[s->strstart-1], bflush);
1674 Tracevv((stderr,"%c", s->window[s->strstart-1]));
1675 _tr_tally_lit(s, s->window[s->strstart-1], bflush);
1716 scan = s->window + s->strstart - 1;
1732 Tracevv((stderr,"%c", s->window[s->strstart]));
1733 _tr_tally_lit (s, s->window[s->strstart], bflush);