Lines Matching refs:strstart
337 s->strstart = length;
634 if (s->strstart != 0) header |= PRESET_DICT;
641 if (s->strstart != 0) {
997 s->strstart = 0;
1017 * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
1029 register Bytef *scan = s->window + s->strstart; /* current string */
1034 IPos limit = s->strstart > (IPos)MAX_DIST(s) ?
1035 s->strstart - (IPos)MAX_DIST(s) : NIL;
1046 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1050 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1069 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1072 Assert(cur_match < s->strstart, "no future");
1093 * strstart+3, +5, ... up to strstart+257. We check for insufficient
1095 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
1109 /* Here, scan <= window+strstart+257 */
1133 * the 256th check will be made at strstart+258.
1176 register Bytef *scan = s->window + s->strstart; /* current string */
1179 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1186 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1188 Assert(cur_match < s->strstart, "no future");
1206 * the 256th check will be made at strstart+258.
1258 * Updates strstart and lookahead.
1261 * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD
1275 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
1279 if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
1284 * strstart == 0 && lookahead == 1 (input done a byte at time)
1293 if (s->strstart >= wsize+MAX_DIST(s)) {
1297 s->strstart -= wsize; /* we now have strstart >= MAX_DIST */
1330 * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&
1331 * more == window_size - lookahead - strstart
1336 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
1342 n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
1347 s->ins_h = s->window[s->strstart];
1348 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1362 * IN assertion: strstart is set to the end of the current match.
1368 (ulg)((long)s->strstart - s->block_start), \
1370 s->block_start = s->strstart; \
1409 Assert(s->strstart < s->w_size+MAX_DIST(s) ||
1419 s->strstart += s->lookahead;
1424 if (s->strstart == 0 || (ulg)s->strstart >= max_start) {
1425 /* strstart == 0 is possible when wraparound on 16-bit machine */
1426 s->lookahead = (uInt)(s->strstart - max_start);
1427 s->strstart = (uInt)max_start;
1433 if (s->strstart - (uInt)s->block_start >= MAX_DIST(s)) {
1469 /* Insert the string window[strstart .. strstart+2] in the
1473 INSERT_STRING(s, s->strstart, hash_head);
1479 if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) {
1486 (s->strategy == Z_RLE && s->strstart - hash_head == 1)) {
1492 } else if (s->strategy == Z_RLE && s->strstart - hash_head == 1) {
1499 check_match(s, s->strstart, s->match_start, s->match_length);
1501 _tr_tally_dist(s, s->strstart - s->match_start,
1512 s->match_length--; /* string at strstart already in table */
1514 s->strstart++;
1515 INSERT_STRING(s, s->strstart, hash_head);
1516 /* strstart never exceeds WSIZE-MAX_MATCH, so there are
1520 s->strstart++;
1524 s->strstart += s->match_length;
1526 s->ins_h = s->window[s->strstart];
1527 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1537 Tracevv((stderr,"%c", s->window[s->strstart]));
1538 _tr_tally_lit (s, s->window[s->strstart], bflush);
1540 s->strstart++;
1576 /* Insert the string window[strstart .. strstart+2] in the
1580 INSERT_STRING(s, s->strstart, hash_head);
1589 s->strstart - hash_head <= MAX_DIST(s)) {
1596 } else if (s->strategy == Z_RLE && s->strstart - hash_head == 1) {
1604 s->strstart - s->match_start > TOO_FAR)
1618 uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1621 check_match(s, s->strstart-1, s->prev_match, s->prev_length);
1623 _tr_tally_dist(s, s->strstart -1 - s->prev_match,
1627 * strstart-1 and strstart are already inserted. If there is not
1634 if (++s->strstart <= max_insert) {
1635 INSERT_STRING(s, s->strstart, hash_head);
1640 s->strstart++;
1649 Tracevv((stderr,"%c", s->window[s->strstart-1]));
1650 _tr_tally_lit(s, s->window[s->strstart-1], bflush);
1654 s->strstart++;
1662 s->strstart++;
1668 Tracevv((stderr,"%c", s->window[s->strstart-1]));
1669 _tr_tally_lit(s, s->window[s->strstart-1], bflush);
1708 if (s->strstart > 0) { /* if there is a previous byte, that is */
1710 scan = s->window + s->strstart - 1;
1720 check_match(s, s->strstart, s->strstart - 1, run);
1723 s->strstart += run;
1726 Tracevv((stderr,"%c", s->window[s->strstart]));
1727 _tr_tally_lit (s, s->window[s->strstart], bflush);
1729 s->strstart++;