Lines Matching refs:strstart

413     uInt strstart;               /* start of string to insert */  member
859     s->strstart = length;
1014 	if (s->strstart != 0) header |= PRESET_DICT;
1021 	if (s->strstart != 0) {
1256     s->strstart = 0;
1285     Bytef *scan = s->window + s->strstart;      /* current string */
1290     IPos limit = s->strstart > (IPos)MAX_DIST(s) ?
1291         s->strstart - (IPos)MAX_DIST(s) : NIL;
1302     Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1306     Bytef *strend = s->window + s->strstart + MAX_MATCH;
1325     Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1328         Assert(cur_match < s->strstart, "no future");
1466         more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
1469         if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
1481         } else if (s->strstart >= wsize+MAX_DIST(s)) {
1486             s->strstart    -= wsize; /* we now have strstart >= MAX_DIST */
1528         n = read_buf(s->strm, (charf *)s->window + s->strstart + s->lookahead,
1534             s->ins_h = s->window[s->strstart];
1535             UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1555 		(ulg)((long)s->strstart - s->block_start), \
1557    s->block_start = s->strstart; \
1596             Assert(s->strstart < s->w_size+MAX_DIST(s) ||
1606 	s->strstart += s->lookahead;
1611         if (s->strstart == 0 || (ulg)s->strstart >= max_start) {
1613 	    s->lookahead = (uInt)(s->strstart - max_start);
1614 	    s->strstart = (uInt)max_start;
1620         if (s->strstart - (uInt)s->block_start >= MAX_DIST(s)) {
1660             INSERT_STRING(s, s->strstart, hash_head);
1666         if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) {
1677             check_match(s, s->strstart, s->match_start, s->match_length);
1679             bflush = _tr_tally(s, s->strstart - s->match_start,
1691                     s->strstart++;
1692                     INSERT_STRING(s, s->strstart, hash_head);
1697                 s->strstart++; 
1699                 s->strstart += s->match_length;
1701                 s->ins_h = s->window[s->strstart];
1702                 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1712             Tracevv((stderr,"%c", s->window[s->strstart]));
1713             bflush = _tr_tally (s, 0, s->window[s->strstart]);
1715             s->strstart++; 
1754             INSERT_STRING(s, s->strstart, hash_head);
1763             s->strstart - hash_head <= MAX_DIST(s)) {
1775                   s->strstart - s->match_start > TOO_FAR))) {
1787             uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1790             check_match(s, s->strstart-1, s->prev_match, s->prev_length);
1792             bflush = _tr_tally(s, s->strstart -1 - s->prev_match,
1803                 if (++s->strstart <= max_insert) {
1804                     INSERT_STRING(s, s->strstart, hash_head);
1809             s->strstart++;
1818             Tracevv((stderr,"%c", s->window[s->strstart-1]));
1819             if (_tr_tally (s, 0, s->window[s->strstart-1])) {
1822             s->strstart++;
1830             s->strstart++;
1836         Tracevv((stderr,"%c", s->window[s->strstart-1]));
1837         _tr_tally (s, 0, s->window[s->strstart-1]);
2830         ulg in_length = (ulg)((long)s->strstart - s->block_start);