Home
last modified time | relevance | path

Searched refs:MIN_LOOKAHEAD (Results 1 - 13 of 13) sorted by relevance

/third_party/node/deps/v8/third_party/zlib/
H A Dfill_window_sse.c43 Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead"); in fill_window_sse()
111 * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 && in fill_window_sse()
113 * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1) in fill_window_sse()
116 * window_size == input_size + MIN_LOOKAHEAD && in fill_window_sse()
117 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD. in fill_window_sse()
142 } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0); in fill_window_sse()
178 Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD, in fill_window_sse()
H A Ddeflate.h279 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) macro
284 #define MAX_DIST(s) ((s)->w_size-MIN_LOOKAHEAD)
H A Ddeflate.c1334 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1470 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1547 * IN assertion: lookahead < MIN_LOOKAHEAD
1548 * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD
1573 Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead");
1608 * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&
1610 * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
1613 * window_size == input_size + MIN_LOOKAHEAD &&
1614 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
1647 } while (s->lookahead < MIN_LOOKAHEAD
[all...]
/third_party/skia/third_party/externals/zlib/
H A Dfill_window_sse.c43 Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead"); in fill_window_sse()
111 * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 && in fill_window_sse()
113 * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1) in fill_window_sse()
116 * window_size == input_size + MIN_LOOKAHEAD && in fill_window_sse()
117 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD. in fill_window_sse()
142 } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0); in fill_window_sse()
178 Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD, in fill_window_sse()
H A Ddeflate.h279 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) macro
284 #define MAX_DIST(s) ((s)->w_size-MIN_LOOKAHEAD)
H A Ddeflate.c1326 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1462 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1539 * IN assertion: lookahead < MIN_LOOKAHEAD
1540 * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD
1565 Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead");
1598 * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&
1600 * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
1603 * window_size == input_size + MIN_LOOKAHEAD &&
1604 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
1637 } while (s->lookahead < MIN_LOOKAHEAD
[all...]
/third_party/node/deps/zlib/
H A Ddeflate.h293 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) macro
298 #define MAX_DIST(s) ((s)->w_size-MIN_LOOKAHEAD)
H A Ddeflate.c243 * IN assertion: lookahead < MIN_LOOKAHEAD
244 * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD
254 Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead"); in fill_window()
289 * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 && in fill_window()
291 * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1) in fill_window()
294 * window_size == input_size + MIN_LOOKAHEAD && in fill_window()
295 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD. in fill_window()
342 } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0); in fill_window()
378 Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD, in fill_window()
1437 Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD, in longest_match()
[all...]
/third_party/libwebsockets/win32port/zlib/
H A Ddeflate.h273 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) macro
278 #define MAX_DIST(s) ((s)->w_size-MIN_LOOKAHEAD)
H A Ddeflate.c1154 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1272 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1345 * IN assertion: lookahead < MIN_LOOKAHEAD
1346 * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD
1414 * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&
1416 * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
1419 * window_size == input_size + MIN_LOOKAHEAD &&
1420 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
1441 } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0);
1579 if (s->lookahead < MIN_LOOKAHEAD) {
[all...]
/third_party/zlib/
H A Ddeflate.h290 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) macro
295 #define MAX_DIST(s) ((s)->w_size-MIN_LOOKAHEAD)
H A Ddeflate.c247 * IN assertion: lookahead < MIN_LOOKAHEAD
248 * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD
259 Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead"); in fill_window()
294 * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 && in fill_window()
296 * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1) in fill_window()
299 * window_size == input_size + MIN_LOOKAHEAD && in fill_window()
300 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD. in fill_window()
333 } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0); in fill_window()
369 Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD, in fill_window()
1399 Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD, in longest_match()
[all...]
/third_party/zlib/contrib/gcc_gvmat64/
H A Dgvmat64.S95 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) define
268 sub eax, MIN_LOOKAHEAD

Completed in 16 milliseconds