Lines Matching refs:strstart
336 s->strstart = length;
509 wraplen = 6 + (s->strstart ? 4 : 0);
667 if (s->strstart != 0) header |= PRESET_DICT;
674 if (s->strstart != 0) {
851 s->strstart = 0;
1036 s->strstart = 0;
1056 * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
1068 register Bytef *scan = s->window + s->strstart; /* current string */
1073 IPos limit = s->strstart > (IPos)MAX_DIST(s) ?
1074 s->strstart - (IPos)MAX_DIST(s) : NIL;
1085 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1089 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1108 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1111 Assert(cur_match < s->strstart, "no future");
1132 * strstart+3, +5, ... up to strstart+257. We check for insufficient
1134 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
1148 /* Here, scan <= window+strstart+257 */
1172 * the 256th check will be made at strstart+258.
1216 register Bytef *scan = s->window + s->strstart; /* current string */
1219 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1226 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1228 Assert(cur_match < s->strstart, "no future");
1246 * the 256th check will be made at strstart+258.
1297 * Updates strstart and lookahead.
1300 * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD
1314 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
1318 if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
1323 * strstart == 0 && lookahead == 1 (input done a byte at time)
1332 if (s->strstart >= wsize+MAX_DIST(s)) {
1336 s->strstart -= wsize; /* we now have strstart >= MAX_DIST */
1368 * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&
1369 * more == window_size - lookahead - strstart
1374 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
1380 n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
1385 s->ins_h = s->window[s->strstart];
1386 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1402 * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.
1405 ulg curr = s->strstart + (ulg)(s->lookahead);
1434 * IN assertion: strstart is set to the end of the current match.
1440 (ulg)((long)s->strstart - s->block_start), \
1442 s->block_start = s->strstart; \
1481 Assert(s->strstart < s->w_size+MAX_DIST(s) ||
1491 s->strstart += s->lookahead;
1496 if (s->strstart == 0 || (ulg)s->strstart >= max_start) {
1497 /* strstart == 0 is possible when wraparound on 16-bit machine */
1498 s->lookahead = (uInt)(s->strstart - max_start);
1499 s->strstart = (uInt)max_start;
1505 if (s->strstart - (uInt)s->block_start >= MAX_DIST(s)) {
1541 /* Insert the string window[strstart .. strstart+2] in the
1546 INSERT_STRING(s, s->strstart, hash_head);
1552 if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) {
1561 check_match(s, s->strstart, s->match_start, s->match_length);
1563 _tr_tally_dist(s, s->strstart - s->match_start,
1574 s->match_length--; /* string at strstart already in table */
1576 s->strstart++;
1577 INSERT_STRING(s, s->strstart, hash_head);
1578 /* strstart never exceeds WSIZE-MAX_MATCH, so there are
1582 s->strstart++;
1586 s->strstart += s->match_length;
1588 s->ins_h = s->window[s->strstart];
1589 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1599 Tracevv((stderr,"%c", s->window[s->strstart]));
1600 _tr_tally_lit (s, s->window[s->strstart], bflush);
1602 s->strstart++;
1638 /* Insert the string window[strstart .. strstart+2] in the
1643 INSERT_STRING(s, s->strstart, hash_head);
1652 s->strstart - hash_head <= MAX_DIST(s)) {
1663 s->strstart - s->match_start > TOO_FAR)
1677 uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1680 check_match(s, s->strstart-1, s->prev_match, s->prev_length);
1682 _tr_tally_dist(s, s->strstart -1 - s->prev_match,
1686 * strstart-1 and strstart are already inserted. If there is not
1693 if (++s->strstart <= max_insert) {
1694 INSERT_STRING(s, s->strstart, hash_head);
1699 s->strstart++;
1708 Tracevv((stderr,"%c", s->window[s->strstart-1]));
1709 _tr_tally_lit(s, s->window[s->strstart-1], bflush);
1713 s->strstart++;
1721 s->strstart++;
1727 Tracevv((stderr,"%c", s->window[s->strstart-1]));
1728 _tr_tally_lit(s, s->window[s->strstart-1], bflush);
1764 if (s->lookahead >= MIN_MATCH && s->strstart > 0) {
1765 scan = s->window + s->strstart - 1;
1768 strend = s->window + s->strstart + MAX_MATCH;
1783 check_match(s, s->strstart, s->strstart - 1, s->match_length);
1788 s->strstart += s->match_length;
1792 Tracevv((stderr,"%c", s->window[s->strstart]));
1793 _tr_tally_lit (s, s->window[s->strstart], bflush);
1795 s->strstart++;
1826 Tracevv((stderr,"%c", s->window[s->strstart]));
1827 _tr_tally_lit (s, s->window[s->strstart], bflush);
1829 s->strstart++;