Lines Matching refs:strstart
402 uInt strstart; /* start of string to insert */
848 s->strstart = length;
1003 if (s->strstart != 0) header |= PRESET_DICT;
1010 if (s->strstart != 0) {
1245 s->strstart = 0;
1262 * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
1274 register Bytef *scan = s->window + s->strstart; /* current string */
1279 IPos limit = s->strstart > (IPos)MAX_DIST(s) ?
1280 s->strstart - (IPos)MAX_DIST(s) : NIL;
1291 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1295 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1314 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1317 Assert(cur_match < s->strstart, "no future");
1333 * strstart+3, +5, ... up to strstart+257. We check for insufficient
1335 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
1349 /* Here, scan <= window+strstart+257 */
1373 * the 256th check will be made at strstart+258.
1438 * Updates strstart and lookahead.
1441 * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD
1455 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
1458 if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
1462 /* Very unlikely, but possible on 16 bit machine if strstart == 0
1470 } else if (s->strstart >= wsize+MAX_DIST(s)) {
1475 s->strstart -= wsize; /* we now have strstart >= MAX_DIST */
1505 * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&
1506 * more == window_size - lookahead - strstart
1511 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
1517 n = read_buf(s->strm, (charf *)s->window + s->strstart + s->lookahead,
1523 s->ins_h = s->window[s->strstart];
1524 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1538 * IN assertion: strstart is set to the end of the current match.
1544 (ulg)((long)s->strstart - s->block_start), \
1546 s->block_start = s->strstart; \
1585 Assert(s->strstart < s->w_size+MAX_DIST(s) ||
1595 s->strstart += s->lookahead;
1600 if (s->strstart == 0 || (ulg)s->strstart >= max_start) {
1601 /* strstart == 0 is possible when wraparound on 16-bit machine */
1602 s->lookahead = (uInt)(s->strstart - max_start);
1603 s->strstart = (uInt)max_start;
1609 if (s->strstart - (uInt)s->block_start >= MAX_DIST(s)) {
1645 /* Insert the string window[strstart .. strstart+2] in the
1649 INSERT_STRING(s, s->strstart, hash_head);
1655 if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) {
1666 check_match(s, s->strstart, s->match_start, s->match_length);
1668 bflush = _tr_tally(s, s->strstart - s->match_start,
1678 s->match_length--; /* string at strstart already in hash table */
1680 s->strstart++;
1681 INSERT_STRING(s, s->strstart, hash_head);
1682 /* strstart never exceeds WSIZE-MAX_MATCH, so there are
1686 s->strstart++;
1688 s->strstart += s->match_length;
1690 s->ins_h = s->window[s->strstart];
1691 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1701 Tracevv((stderr,"%c", s->window[s->strstart]));
1702 bflush = _tr_tally (s, 0, s->window[s->strstart]);
1704 s->strstart++;
1739 /* Insert the string window[strstart .. strstart+2] in the
1743 INSERT_STRING(s, s->strstart, hash_head);
1752 s->strstart - hash_head <= MAX_DIST(s)) {
1764 s->strstart - s->match_start > TOO_FAR))) {
1776 uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1779 check_match(s, s->strstart-1, s->prev_match, s->prev_length);
1781 bflush = _tr_tally(s, s->strstart -1 - s->prev_match,
1785 * strstart-1 and strstart are already inserted. If there is not
1792 if (++s->strstart <= max_insert) {
1793 INSERT_STRING(s, s->strstart, hash_head);
1798 s->strstart++;
1807 Tracevv((stderr,"%c", s->window[s->strstart-1]));
1808 if (_tr_tally (s, 0, s->window[s->strstart-1])) {
1811 s->strstart++;
1819 s->strstart++;
1825 Tracevv((stderr,"%c", s->window[s->strstart-1]));
1826 _tr_tally (s, 0, s->window[s->strstart-1]);
2821 ulg in_length = (ulg)((long)s->strstart - s->block_start);