Home | History | Annotate | Download | only in net

Lines Matching defs:lookahead

431     uInt lookahead;              /* number of valid bytes ahead in window */
545 /* Minimum amount of lookahead, except at the end of the input file.
718 /* Minimum amount of lookahead, except at the end of the input file.
927 * s->lookahead stays null, so s->ins_h will be recomputed at the next
1119 if (strm->avail_in != 0 || s->lookahead != 0 ||
1327 s->lookahead = 0;
1343 * OUT assertion: the match length is not greater than s->lookahead.
1392 if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
1394 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1414 * lookahead only every 4th comparison; the 128th check will be made
1417 * to check more often for insufficient lookahead.
1452 /* We check for insufficient lookahead only every 8th comparison;
1483 if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
1484 return s->lookahead;
1505 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1524 /* We check for insufficient lookahead only every 8th comparison;
1541 return len <= s->lookahead ? len : s->lookahead;
1575 * Fill the window when the lookahead becomes insufficient.
1576 * Updates strstart and lookahead.
1578 * IN assertion: lookahead < MIN_LOOKAHEAD
1592 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
1595 if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
1600 * and lookahead == 1 (input done one byte at time)
1604 /* If the window is almost full and there is insufficient lookahead,
1643 * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&
1644 * more == window_size - lookahead - strstart
1649 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
1655 n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
1656 s->lookahead += n;
1659 if (s->lookahead >= MIN_MATCH) {
1670 } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0);
1718 if (s->lookahead <= 1) {
1724 if (s->lookahead == 0 && flush == Z_NO_FLUSH) return need_more;
1726 if (s->lookahead == 0) break; /* flush the current block */
1730 s->strstart += s->lookahead;
1731 s->lookahead = 0;
1737 s->lookahead = (uInt)(s->strstart - max_start);
1765 /* Make sure that we always have enough lookahead, except
1770 if (s->lookahead < MIN_LOOKAHEAD) {
1772 if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {
1775 if (s->lookahead == 0) break; /* flush the current block */
1781 if (s->lookahead >= MIN_MATCH) {
1804 s->lookahead -= s->match_length;
1811 s->lookahead >= MIN_MATCH) {
1831 /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
1839 s->lookahead--;
1860 /* Make sure that we always have enough lookahead, except
1865 if (s->lookahead < MIN_LOOKAHEAD) {
1867 if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {
1870 if (s->lookahead == 0) break; /* flush the current block */
1876 if (s->lookahead >= MIN_MATCH) {
1910 uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1920 * enough lookahead, the last two strings are not inserted in
1923 s->lookahead -= s->prev_length-1;
1947 s->lookahead--;
1955 s->lookahead--;
2495 s->last_eob_len = 8; /* enough lookahead for inflate */
2979 * Send one empty static block to give enough lookahead for inflate.
2981 * The current inflate code requires 9 bits of lookahead. If the
2983 * on 5 bits or less, inflate may have only 5+3 bits of lookahead to decode
2998 * (10 - bi_valid) bits. The lookahead for the last real code (before
3289 s->last_eob_len = 8; /* enough lookahead for inflate */
4259 bl = 9; /* must be <= 9 for lookahead assumptions */
4260 bd = 6; /* must be <= 9 for lookahead assumptions */