Lines Matching refs:strstart
340 s->strstart = length;
515 wraplen = 6 + (s->strstart ? 4 : 0);
673 if (s->strstart != 0) header |= PRESET_DICT;
680 if (s->strstart != 0) {
874 s->strstart = 0;
1060 s->strstart = 0;
1131 * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
1144 register Bytef *scan = s->window + s->strstart; /* current string */
1149 IPos limit = s->strstart > (IPos)MAX_DIST(s) ?
1150 s->strstart - (IPos)MAX_DIST(s) : NIL;
1161 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1165 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1184 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1187 Assert(cur_match < s->strstart, "no future");
1211 * strstart+3, +5, ... up to strstart+257. We check for insufficient
1213 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
1227 /* Here, scan <= window+strstart+257 */
1254 * the 256th check will be made at strstart+258.
1357 register Bytef *scan = s->window + s->strstart; /* current string */
1360 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1369 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1371 Assert(cur_match < s->strstart, "no future");
1389 * the 256th check will be made at strstart+258.
1440 * Updates strstart and lookahead.
1443 * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD
1457 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
1461 if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
1466 * strstart == 0 && lookahead == 1 (input done a byte at time)
1475 if (s->strstart >= wsize+MAX_DIST(s)) {
1479 s->strstart -= wsize; /* we now have strstart >= MAX_DIST */
1526 * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&
1527 * more == window_size - lookahead - strstart
1532 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
1538 n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
1540 class_set(s, s->strstart + s->lookahead, n, s->strm->clas);
1546 s->ins_h = s->window[s->strstart];
1547 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1563 * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.
1566 ulg curr = s->strstart + (ulg)(s->lookahead);
1595 * IN assertion: strstart is set to the end of the current match.
1601 (ulg)((long)s->strstart - s->block_start), \
1603 s->block_start = s->strstart; \
1643 Assert(s->strstart < s->w_size+MAX_DIST(s) ||
1653 s->strstart += s->lookahead;
1658 if (s->strstart == 0 || (ulg)s->strstart >= max_start) {
1659 /* strstart == 0 is possible when wraparound on 16-bit machine */
1660 s->lookahead = (uInt)(s->strstart - max_start);
1661 s->strstart = (uInt)max_start;
1667 if (s->strstart - (uInt)s->block_start >= MAX_DIST(s)) {
1709 /* Insert the string window[strstart .. strstart+2] in the
1714 INSERT_STRING(s, s->strstart, hash_head);
1720 if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) {
1729 check_match(s, s->strstart, s->match_start, s->match_length);
1731 _tr_tally_dist(s, s->strstart - s->match_start,
1742 s->match_length--; /* string at strstart already in table */
1744 s->strstart++;
1745 INSERT_STRING(s, s->strstart, hash_head);
1746 /* strstart never exceeds WSIZE-MAX_MATCH, so there are
1750 s->strstart++;
1754 s->strstart += s->match_length;
1756 s->ins_h = s->window[s->strstart];
1757 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1767 Tracevv((stderr,"%c", s->window[s->strstart]));
1768 _tr_tally_lit (s, s->window[s->strstart], bflush);
1770 s->strstart++;
1819 /* Insert the string window[strstart .. strstart+2] in the
1824 INSERT_STRING(s, s->strstart, hash_head);
1833 s->match_length = cookie_match(s, s->strstart, input_length);
1837 s->strstart - hash_head <= MAX_DIST(s)) {
1849 s->strstart - s->match_start > TOO_FAR)
1876 uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1879 check_match(s, s->strstart-1, s->prev_match, s->prev_length);
1881 _tr_tally_dist(s, s->strstart -1 - s->prev_match,
1885 * strstart-1 and strstart are already inserted. If there is not
1892 if (++s->strstart <= max_insert) {
1893 INSERT_STRING(s, s->strstart, hash_head);
1898 s->strstart++;
1907 Tracevv((stderr,"%c", s->window[s->strstart-1]));
1908 _tr_tally_lit(s, s->window[s->strstart-1], bflush);
1912 s->strstart++;
1920 s->strstart++;
1926 Tracevv((stderr,"%c", s->window[s->strstart-1]));
1927 _tr_tally_lit(s, s->window[s->strstart-1], bflush);
1963 if (s->lookahead >= MIN_MATCH && s->strstart > 0) {
1964 scan = s->window + s->strstart - 1;
1967 strend = s->window + s->strstart + MAX_MATCH;
1982 check_match(s, s->strstart, s->strstart - 1, s->match_length);
1987 s->strstart += s->match_length;
1991 Tracevv((stderr,"%c", s->window[s->strstart]));
1992 _tr_tally_lit (s, s->window[s->strstart], bflush);
1994 s->strstart++;
2025 Tracevv((stderr,"%c", s->window[s->strstart]));
2026 _tr_tally_lit (s, s->window[s->strstart], bflush);
2028 s->strstart++;
