Lines Matching defs:lookahead
434 uInt lookahead; /* number of valid bytes ahead in window */
573 * Minimum amount of lookahead, except at the end of the input file.
748 * Minimum amount of lookahead, except at the end of the input file.
982 * two bytes). s->lookahead stays null, so s->ins_h will be
1195 if (strm->avail_in != 0 || s->lookahead != 0 ||
1427 s->lookahead = 0;
1444 * OUT assertion: the match length is not greater than s->lookahead.
1502 if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
1505 "need lookahead");
1530 * for insufficient lookahead only every 4th
1535 * insufficient lookahead.
1575 * We check for insufficient lookahead only every 8th
1608 if ((uInt)best_len <= s->lookahead)
1610 return (s->lookahead);
1635 "need lookahead");
1656 * We check for insufficient lookahead only every 8th comparison;
1674 return (len <= s->lookahead ? len : s->lookahead);
1711 * Fill the window when the lookahead becomes insufficient.
1712 * Updates strstart and lookahead.
1714 * IN assertion: lookahead < MIN_LOOKAHEAD
1730 more = (unsigned)(s->window_size -(ulg)s->lookahead -
1734 if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
1740 * machine if strstart == 0 and lookahead == 1
1747 * insufficient lookahead, move the upper half
1798 * lookahead <= MIN_LOOKAHEAD - 1 &&
1799 * more == window_size - lookahead - strstart
1805 * strstart + s->lookahead <= input_size =>
1812 Assert(s->strstart + s->lookahead + more <= s->window_size,
1815 n = read_buf(s->strm, s->window + s->strstart + s->lookahead,
1817 s->lookahead += n;
1820 if (s->lookahead >= MIN_MATCH) {
1833 } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0);
1889 if (s->lookahead <= 1) {
1896 if (s->lookahead == 0 && flush == Z_NO_FLUSH)
1899 if (s->lookahead == 0)
1904 s->strstart += s->lookahead;
1905 s->lookahead = 0;
1914 s->lookahead = (uInt)(s->strstart - max_start);
1949 * Make sure that we always have enough lookahead,
1955 if (s->lookahead < MIN_LOOKAHEAD) {
1957 if (s->lookahead < MIN_LOOKAHEAD &&
1961 if (s->lookahead == 0)
1970 if (s->lookahead >= MIN_MATCH) {
2000 s->lookahead -= s->match_length;
2009 s->lookahead >= MIN_MATCH) {
2036 * If lookahead < MIN_MATCH, ins_h is
2046 s->lookahead--;
2072 * Make sure that we always have enough lookahead,
2078 if (s->lookahead < MIN_LOOKAHEAD) {
2080 if (s->lookahead < MIN_LOOKAHEAD &&
2085 if (s->lookahead == 0)
2094 if (s->lookahead >= MIN_MATCH) {
2140 uInt max_insert = s->strstart + s->lookahead -
2154 * enough lookahead, the last two strings are
2157 s->lookahead -= s->prev_length-1;
2185 s->lookahead--;
2195 s->lookahead--;
2557 s->last_eob_len = 8; /* enough lookahead for inflate */
3117 * Send one empty static block to give enough lookahead for inflate.
3119 * The current inflate code requires 9 bits of lookahead. If the
3121 * on 5 bits or less, inflate may have only 5+3 bits of lookahead to decode
3137 * (10 - bi_valid) bits. The lookahead for the last real code
3508 s->last_eob_len = 8; /* enough lookahead for inflate */
4558 /* must be <= 9 for lookahead assumptions */
4560 /* must be <= 9 for lookahead assumptions */