Lines Matching refs:strstart
350 s->strstart = 0;
365 str = s->strstart;
375 s->strstart = str;
379 s->strstart += s->lookahead;
380 s->block_start = (long)s->strstart;
587 wraplen = 6 + (s->strstart ? 4 : 0);
748 if (s->strstart != 0) header |= PRESET_DICT;
755 if (s->strstart != 0) {
932 s->strstart = 0;
1118 s->strstart = 0;
1139 * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
1151 register Bytef *scan = s->window + s->strstart; /* current string */
1156 IPos limit = s->strstart > (IPos)MAX_DIST(s) ?
1157 s->strstart - (IPos)MAX_DIST(s) : NIL;
1168 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1172 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1191 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1194 Assert(cur_match < s->strstart, "no future");
1215 * strstart+3, +5, ... up to strstart+257. We check for insufficient
1217 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
1231 /* Here, scan <= window+strstart+257 */
1255 * the 256th check will be made at strstart+258.
1299 register Bytef *scan = s->window + s->strstart; /* current string */
1302 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1309 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1311 Assert(cur_match < s->strstart, "no future");
1329 * the 256th check will be made at strstart+258.
1380 * Updates strstart and lookahead.
1383 * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD
1399 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
1403 if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
1408 * strstart == 0 && lookahead == 1 (input done a byte at time)
1417 if (s->strstart >= wsize+MAX_DIST(s)) {
1421 s->strstart -= wsize; /* we now have strstart >= MAX_DIST */
1453 * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&
1454 * more == window_size - lookahead - strstart
1459 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
1465 n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
1470 uInt str = s->strstart - s->insert;
1499 * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.
1502 ulg curr = s->strstart + (ulg)(s->lookahead);
1528 Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,
1534 * IN assertion: strstart is set to the end of the current match.
1540 (ulg)((long)s->strstart - s->block_start), \
1542 s->block_start = s->strstart; \
1581 Assert(s->strstart < s->w_size+MAX_DIST(s) ||
1591 s->strstart += s->lookahead;
1596 if (s->strstart == 0 || (ulg)s->strstart >= max_start) {
1597 /* strstart == 0 is possible when wraparound on 16-bit machine */
1598 s->lookahead = (uInt)(s->strstart - max_start);
1599 s->strstart = (uInt)max_start;
1605 if (s->strstart - (uInt)s->block_start >= MAX_DIST(s)) {
1614 if ((long)s->strstart > s->block_start)
1647 /* Insert the string window[strstart .. strstart+2] in the
1652 INSERT_STRING(s, s->strstart, hash_head);
1658 if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) {
1667 check_match(s, s->strstart, s->match_start, s->match_length);
1669 _tr_tally_dist(s, s->strstart - s->match_start,
1680 s->match_length--; /* string at strstart already in table */
1682 s->strstart++;
1683 INSERT_STRING(s, s->strstart, hash_head);
1684 /* strstart never exceeds WSIZE-MAX_MATCH, so there are
1688 s->strstart++;
1692 s->strstart += s->match_length;
1694 s->ins_h = s->window[s->strstart];
1695 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1705 Tracevv((stderr,"%c", s->window[s->strstart]));
1706 _tr_tally_lit (s, s->window[s->strstart], bflush);
1708 s->strstart++;
1712 s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;
1750 /* Insert the string window[strstart .. strstart+2] in the
1755 INSERT_STRING(s, s->strstart, hash_head);
1764 s->strstart - hash_head <= MAX_DIST(s)) {
1775 s->strstart - s->match_start > TOO_FAR)
1789 uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1792 check_match(s, s->strstart-1, s->prev_match, s->prev_length);
1794 _tr_tally_dist(s, s->strstart -1 - s->prev_match,
1798 * strstart-1 and strstart are already inserted. If there is not
1805 if (++s->strstart <= max_insert) {
1806 INSERT_STRING(s, s->strstart, hash_head);
1811 s->strstart++;
1820 Tracevv((stderr,"%c", s->window[s->strstart-1]));
1821 _tr_tally_lit(s, s->window[s->strstart-1], bflush);
1825 s->strstart++;
1833 s->strstart++;
1839 Tracevv((stderr,"%c", s->window[s->strstart-1]));
1840 _tr_tally_lit(s, s->window[s->strstart-1], bflush);
1843 s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;
1882 if (s->lookahead >= MIN_MATCH && s->strstart > 0) {
1883 scan = s->window + s->strstart - 1;
1886 strend = s->window + s->strstart + MAX_MATCH;
1902 check_match(s, s->strstart, s->strstart - 1, s->match_length);
1907 s->strstart += s->match_length;
1911 Tracevv((stderr,"%c", s->window[s->strstart]));
1912 _tr_tally_lit (s, s->window[s->strstart], bflush);
1914 s->strstart++;
1951 Tracevv((stderr,"%c", s->window[s->strstart]));
1952 _tr_tally_lit (s, s->window[s->strstart], bflush);
1954 s->strstart++;