Lines Matching refs:strstart
190 unsigned near strstart; /* start of string to insert */
356 strstart = 0;
409 * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
420 register uch far *scan = window + strstart; /* current string */
424 IPos limit = strstart > (IPos)MAX_DIST ? strstart - (IPos)MAX_DIST : NIL;
440 register uch far *strend = window + strstart + MAX_MATCH - 1;
444 register uch far *strend = window + strstart + MAX_MATCH;
454 Assert(strstart <= window_size-MIN_LOOKAHEAD, "insufficient lookahead");
457 Assert(cur_match < strstart, "no future");
473 * strstart+3, +5, ... up to strstart+257. We check for insufficient
475 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
488 /* Here, scan <= window+strstart+257 */
511 * the 256th check will be made at strstart+258.
576 * IN assertion: strstart is set to the end of the current match.
580 (char*)NULL, (ulg)strstart - (ulg)block_start, (eof))
584 * Updates strstart and lookahead, and sets eofile if end of input file.
586 * IN assertion: lookahead < MIN_LOOKAHEAD && strstart + lookahead > 0
587 * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD
597 more = (unsigned)(window_size - (ulg)lookahead - (ulg)strstart);
603 /* Very unlikely, but possible on 16 bit machine if strstart == 0
612 } else if (strstart >= WSIZE+MAX_DIST && sliding) {
618 if (level <= 2) FLUSH_BLOCK(0), block_start = strstart;
625 strstart -= WSIZE; /* we now have strstart >= MAX_DIST: */
668 * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&
669 * more == window_size - lookahead - strstart
674 * strstart + lookahead <= input_size => more >= MIN_LOOKAHEAD.
680 n = (*read_buf)((char*)window+strstart+lookahead, more);
703 /* Insert the string window[strstart .. strstart+2] in the
709 INSERT_STRING(strstart, hash_head);
714 if (hash_head != NIL && strstart - hash_head <= MAX_DIST) {
732 check_match(strstart, match_start, match_length);
734 flush = ct_tally(strstart-match_start, match_length - MIN_MATCH);
746 match_length--; /* string at strstart already in hash table */
748 strstart++;
749 INSERT_STRING(strstart, hash_head);
750 /* strstart never exceeds WSIZE-MAX_MATCH, so there are
760 strstart++;
762 strstart += match_length;
764 ins_h = window[strstart];
765 UPDATE_HASH(ins_h, window[strstart+1]);
772 Tracevv((stderr,"%c",window[strstart]));
773 flush = ct_tally (0, window[strstart]);
775 strstart++;
777 if (flush) FLUSH_BLOCK(0), block_start = strstart;
809 /* Insert the string window[strstart .. strstart+2] in the
815 INSERT_STRING(strstart, hash_head);
823 strstart - hash_head <= MAX_DIST) {
845 if (match_length == MIN_MATCH && strstart-match_start > TOO_FAR){
858 unsigned max_insert = strstart + lookahead - MIN_MATCH;
861 check_match(strstart-1, prev_match, prev_length);
863 flush = ct_tally(strstart-1-prev_match, prev_length - MIN_MATCH);
866 * strstart-1 and strstart are already inserted.
872 if (++strstart <= max_insert) {
873 INSERT_STRING(strstart, hash_head);
874 /* strstart never exceeds WSIZE-MAX_MATCH, so there are
879 strstart++;
882 strstart++;
883 INSERT_STRING(strstart, hash_head);
884 /* strstart never exceeds WSIZE-MAX_MATCH, so there are
890 strstart++;
895 if (flush) FLUSH_BLOCK(0), block_start = strstart;
902 Tracevv((stderr,"%c",window[strstart-1]));
903 if (ct_tally (0, window[strstart-1])) {
904 FLUSH_BLOCK(0), block_start = strstart;
906 strstart++;
913 strstart++;
916 Assert(strstart <= isize && lookahead <= isize, "a bit too far");
925 if (match_available) ct_tally (0, window[strstart-1]);