Lines Matching refs:strstart
277 uInt strstart; /* start of string to insert */
916 s->strstart = 0;
933 * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
944 register Bytef *scan = s->window + s->strstart; /* current string */
948 IPos limit = s->strstart > (IPos)MAX_DIST(s) ?
949 s->strstart - (IPos)MAX_DIST(s) : NIL;
960 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
964 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
978 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
981 Assert(cur_match < s->strstart, "no future");
997 * strstart+3, +5, ... up to strstart+257. We check for insufficient
999 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
1013 /* Here, scan <= window+strstart+257 */
1037 * the 256th check will be made at strstart+258.
1101 * Updates strstart and lookahead.
1104 * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD
1118 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
1121 if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
1124 /* Very unlikely, but possible on 16 bit machine if strstart == 0
1132 } else if (s->strstart >= wsize+MAX_DIST(s)) {
1140 s->strstart -= wsize; /* we now have strstart >= MAX_DIST */
1169 * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&
1170 * more == window_size - lookahead - strstart
1175 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
1181 n = read_buf(s->strm, (charf *)s->window + s->strstart + s->lookahead,
1187 s->ins_h = s->window[s->strstart];
1188 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1202 * IN assertion: strstart is set to the end of the current match.
1207 (charf *)Z_NULL), (long)s->strstart - s->block_start, (flush)); \
1208 s->block_start = s->strstart; \
1248 /* Insert the string window[strstart .. strstart+2] in the
1252 INSERT_STRING(s, s->strstart, hash_head);
1258 if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) {
1271 check_match(s, s->strstart, s->match_start, s->match_length);
1273 bflush = ct_tally(s, s->strstart - s->match_start,
1283 s->match_length--; /* string at strstart already in hash table */
1285 s->strstart++;
1286 INSERT_STRING(s, s->strstart, hash_head);
1287 /* strstart never exceeds WSIZE-MAX_MATCH, so there are
1291 s->strstart++;
1293 s->strstart += s->match_length;
1295 s->ins_h = s->window[s->strstart];
1296 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1306 Tracevv((stderr,"%c", s->window[s->strstart]));
1307 bflush = ct_tally (s, 0, s->window[s->strstart]);
1309 s->strstart++;
1343 /* Insert the string window[strstart .. strstart+2] in the
1347 INSERT_STRING(s, s->strstart, hash_head);
1356 s->strstart - hash_head <= MAX_DIST(s)) {
1369 s->strstart - s->match_start > TOO_FAR))) {
1381 uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1384 check_match(s, s->strstart-1, s->prev_match, s->prev_length);
1386 bflush = ct_tally(s, s->strstart -1 - s->prev_match,
1390 * strstart-1 and strstart are already inserted. If there is not
1397 if (++s->strstart <= max_insert) {
1398 INSERT_STRING(s, s->strstart, hash_head);
1403 s->strstart++;
1412 Tracevv((stderr,"%c", s->window[s->strstart-1]));
1413 if (ct_tally (s, 0, s->window[s->strstart-1])) {
1416 s->strstart++;
1424 s->strstart++;
1430 Tracevv((stderr,"%c", s->window[s->strstart-1]));
1431 ct_tally (s, 0, s->window[s->strstart-1]);
2429 ulg in_length = (ulg)s->strstart - s->block_start;