sys/net/zlib.c

429     uInt strstart;               /* start of string to insert */
923     s->strstart = length;
1075 	if (s->strstart != 0) header |= PRESET_DICT;
1082 	if (s->strstart != 0) {
1325     s->strstart = 0;
1342  *   string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
1354     Bytef *scan = s->window + s->strstart; /* current string */
1359     IPos limit = s->strstart > (IPos)MAX_DIST(s) ?
1360         s->strstart - (IPos)MAX_DIST(s) : NIL;
1371     Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1375     Bytef *strend = s->window + s->strstart + MAX_MATCH;
1394     Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1397         Assert(cur_match < s->strstart, "no future");
1413          * strstart+3, +5, ... up to strstart+257. We check for insufficient
1415          * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
1429         /* Here, scan <= window+strstart+257 */
1453          * the 256th check will be made at strstart+258.
1495     register Bytef *scan = s->window + s->strstart; /* current string */
1498     register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1505     Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1507     Assert(cur_match < s->strstart, "no future");
1525      * the 256th check will be made at strstart+258.
1576  * Updates strstart and lookahead.
1579  * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD
1592         more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
1595         if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
1599             /* Very unlikely, but possible on 16 bit machine if strstart == 0
1607         } else if (s->strstart >= wsize+MAX_DIST(s)) {
1611             s->strstart    -= wsize; /* we now have strstart >= MAX_DIST */
1643          *    strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&
1644          *    more == window_size - lookahead - strstart
1649          *   strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
1655         n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
1660             s->ins_h = s->window[s->strstart];
1661             UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1675  * IN assertion: strstart is set to the end of the current match.
1681 		(ulg)((long)s->strstart - s->block_start), \
1683    s->block_start = s->strstart; \
1720             Assert(s->strstart < s->w_size+MAX_DIST(s) ||
1730 	s->strstart += s->lookahead;
1735         if (s->strstart == 0 || (ulg)s->strstart >= max_start) {
1736 	    /* strstart == 0 is possible when wraparound on 16-bit machine */
1737 	    s->lookahead = (uInt)(s->strstart - max_start);
1738 	    s->strstart = (uInt)max_start;
1744         if (s->strstart - (uInt)s->block_start >= MAX_DIST(s)) {
1778         /* Insert the string window[strstart .. strstart+2] in the
1782             INSERT_STRING(s, s->strstart, hash_head);
1788         if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) {
1799             check_match(s, s->strstart, s->match_start, s->match_length);
1801             _tr_tally_dist(s, s->strstart - s->match_start,
1812                 s->match_length--; /* string at strstart already in hash table */
1814                     s->strstart++;
1815                     INSERT_STRING(s, s->strstart, hash_head);
1816                     /* strstart never exceeds WSIZE-MAX_MATCH, so there are
1820                 s->strstart++;
1824                 s->strstart += s->match_length;
1826                 s->ins_h = s->window[s->strstart];
1827                 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1837             Tracevv((stderr,"%c", s->window[s->strstart]));
1838             _tr_tally_lit (s, s->window[s->strstart], bflush);
1840             s->strstart++;
1873         /* Insert the string window[strstart .. strstart+2] in the
1877             INSERT_STRING(s, s->strstart, hash_head);
1886             s->strstart - hash_head <= MAX_DIST(s)) {
1898                   s->strstart - s->match_start > TOO_FAR))) {
1910             uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1913             check_match(s, s->strstart-1, s->prev_match, s->prev_length);
1915             _tr_tally_dist(s, s->strstart -1 - s->prev_match,
1919              * strstart-1 and strstart are already inserted. If there is not
1926                 if (++s->strstart <= max_insert) {
1927                     INSERT_STRING(s, s->strstart, hash_head);
1932             s->strstart++;
1941             Tracevv((stderr,"%c", s->window[s->strstart-1]));
1942 	    _tr_tally_lit(s, s->window[s->strstart-1], bflush);
1946             s->strstart++;
1954             s->strstart++;
1960         Tracevv((stderr,"%c", s->window[s->strstart-1]));
1961         _tr_tally_lit(s, s->window[s->strstart-1], bflush);
3143         ulg in_length = (ulg)((long)s->strstart - s->block_start);