Lines Matching refs:lookahead
114 /* Minimum amount of lookahead, except at the end of the input file.
344 * s->lookahead stays null, so s->ins_h will be recomputed at the next
786 if (strm->avail_in != 0 || s->lookahead != 0 ||
1002 s->lookahead = 0;
1021 * OUT assertion: the match length is not greater than s->lookahead.
1070 if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
1072 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1080 * for insufficient lookahead only occur occasionally for performance
1083 * However the length of the match is limited to the lookahead, so
1097 * lookahead only every 4th comparison; the 128th check will be made
1100 * to check more often for insufficient lookahead.
1135 /* We check for insufficient lookahead only every 8th comparison;
1166 if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
1167 return s->lookahead;
1189 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1208 /* We check for insufficient lookahead only every 8th comparison;
1225 return (uInt)len <= s->lookahead ? (uInt)len : s->lookahead;
1257 * Fill the window when the lookahead becomes insufficient.
1258 * Updates strstart and lookahead.
1260 * IN assertion: lookahead < 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)
1290 /* If the window is almost full and there is insufficient lookahead,
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);
1343 s->lookahead += n;
1346 if (s->lookahead >= MIN_MATCH) {
1357 } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0);
1407 if (s->lookahead <= 1) {
1413 if (s->lookahead == 0 && flush == Z_NO_FLUSH) return need_more;
1415 if (s->lookahead == 0) break; /* flush the current block */
1419 s->strstart += s->lookahead;
1420 s->lookahead = 0;
1426 s->lookahead = (uInt)(s->strstart - max_start);
1456 /* Make sure that we always have enough lookahead, except
1461 if (s->lookahead < MIN_LOOKAHEAD) {
1463 if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {
1466 if (s->lookahead == 0) break; /* flush the current block */
1472 if (s->lookahead >= MIN_MATCH) {
1504 s->lookahead -= s->match_length;
1511 s->lookahead >= MIN_MATCH) {
1531 /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
1539 s->lookahead--;
1563 /* Make sure that we always have enough lookahead, except
1568 if (s->lookahead < MIN_LOOKAHEAD) {
1570 if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {
1573 if (s->lookahead == 0) break; /* flush the current block */
1579 if (s->lookahead >= MIN_MATCH) {
1618 uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1628 * enough lookahead, the last two strings are not inserted in
1631 s->lookahead -= s->prev_length-1;
1655 s->lookahead--;
1663 s->lookahead--;
1694 /* Make sure that we always have enough lookahead, except
1698 if (s->lookahead < MAX_MATCH) {
1700 if (s->lookahead < MAX_MATCH && flush == Z_NO_FLUSH) {
1703 if (s->lookahead == 0) break; /* flush the current block */
1709 max = s->lookahead < MAX_MATCH ? s->lookahead : MAX_MATCH;
1722 s->lookahead -= run;
1728 s->lookahead--;