Lines Matching refs:strstart
346 s->strstart = length;
643 if (s->strstart != 0) header |= PRESET_DICT;
650 if (s->strstart != 0) {
1006 s->strstart = 0;
1038 register Bytef *scan = s->window + s->strstart; /* current string */
1043 IPos limit = s->strstart > (IPos)MAX_DIST(s) ?
1044 s->strstart - (IPos)MAX_DIST(s) : NIL;
1055 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1059 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1078 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1081 Assert(cur_match < s->strstart, "no future");
1185 register Bytef *scan = s->window + s->strstart; /* current string */
1188 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1195 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1197 Assert(cur_match < s->strstart, "no future");
1281 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
1285 if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
1299 if (s->strstart >= wsize+MAX_DIST(s)) {
1303 s->strstart -= wsize; /* we now have strstart >= MAX_DIST */
1348 n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
1353 s->ins_h = s->window[s->strstart];
1354 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1374 (ulg)((long)s->strstart - s->block_start), \
1376 s->block_start = s->strstart; \
1415 Assert(s->strstart < s->w_size+MAX_DIST(s) ||
1425 s->strstart += s->lookahead;
1430 if (s->strstart == 0 || (ulg)s->strstart >= max_start) {
1432 s->lookahead = (uInt)(s->strstart - max_start);
1433 s->strstart = (uInt)max_start;
1439 if (s->strstart - (uInt)s->block_start >= MAX_DIST(s)) {
1479 INSERT_STRING(s, s->strstart, hash_head);
1485 if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) {
1492 (s->strategy == Z_RLE && s->strstart - hash_head == 1)) {
1498 } else if (s->strategy == Z_RLE && s->strstart - hash_head == 1) {
1505 check_match(s, s->strstart, s->match_start, s->match_length);
1507 _tr_tally_dist(s, s->strstart - s->match_start,
1520 s->strstart++;
1521 INSERT_STRING(s, s->strstart, hash_head);
1526 s->strstart++;
1530 s->strstart += s->match_length;
1532 s->ins_h = s->window[s->strstart];
1533 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1543 Tracevv((stderr,"%c", s->window[s->strstart]));
1544 _tr_tally_lit (s, s->window[s->strstart], bflush);
1546 s->strstart++;
1586 INSERT_STRING(s, s->strstart, hash_head);
1595 s->strstart - hash_head <= MAX_DIST(s)) {
1602 } else if (s->strategy == Z_RLE && s->strstart - hash_head == 1) {
1610 s->strstart - s->match_start > TOO_FAR)
1624 uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1627 check_match(s, s->strstart-1, s->prev_match, s->prev_length);
1629 _tr_tally_dist(s, s->strstart -1 - s->prev_match,
1640 if (++s->strstart <= max_insert) {
1641 INSERT_STRING(s, s->strstart, hash_head);
1646 s->strstart++;
1655 Tracevv((stderr,"%c", s->window[s->strstart-1]));
1656 _tr_tally_lit(s, s->window[s->strstart-1], bflush);
1660 s->strstart++;
1668 s->strstart++;
1674 Tracevv((stderr,"%c", s->window[s->strstart-1]));
1675 _tr_tally_lit(s, s->window[s->strstart-1], bflush);
1714 if (s->strstart > 0) { /* if there is a previous byte, that is */
1716 scan = s->window + s->strstart - 1;
1726 check_match(s, s->strstart, s->strstart - 1, run);
1729 s->strstart += run;
1732 Tracevv((stderr,"%c", s->window[s->strstart]));
1733 _tr_tally_lit (s, s->window[s->strstart], bflush);
1735 s->strstart++;