Home
last modified time | relevance | path

Searched refs:lookahead (Results 1 – 25 of 136) sorted by relevance

123456

/third_party/skia/third_party/externals/zlib/
Dfill_window_sse.c43 Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead"); in fill_window_sse()
46 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart); in fill_window_sse()
50 if (more == 0 && s->strstart == 0 && s->lookahead == 0) { in fill_window_sse()
124 s->window + s->strstart + s->lookahead, in fill_window_sse()
126 s->lookahead += n; in fill_window_sse()
129 if (s->lookahead >= MIN_MATCH) { in fill_window_sse()
142 } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0); in fill_window_sse()
152 ulg curr = s->strstart + (ulg)(s->lookahead); in fill_window_sse()
Ddeflate.c441 if (wrap == 2 || (wrap == 1 && s->status != INIT_STATE) || s->lookahead)
467 while (s->lookahead >= MIN_MATCH) {
469 n = s->lookahead - (MIN_MATCH-1);
475 s->lookahead = MIN_MATCH-1;
478 s->strstart += s->lookahead;
480 s->insert = s->lookahead;
481 s->lookahead = 0;
502 len = s->strstart + s->lookahead;
506 zmemcpy(dictionary, s->window + s->strstart + s->lookahead - len, len);
1042 if (strm->avail_in != 0 || s->lookahead != 0 ||
[all …]
/third_party/node/deps/zlib/
Dfill_window_sse.c41 Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead"); in fill_window_sse()
44 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart); in fill_window_sse()
48 if (more == 0 && s->strstart == 0 && s->lookahead == 0) { in fill_window_sse()
122 s->window + s->strstart + s->lookahead, in fill_window_sse()
124 s->lookahead += n; in fill_window_sse()
127 if (s->lookahead >= MIN_MATCH) { in fill_window_sse()
140 } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0); in fill_window_sse()
150 ulg curr = s->strstart + (ulg)(s->lookahead); in fill_window_sse()
Ddeflate.c432 if (wrap == 2 || (wrap == 1 && s->status != INIT_STATE) || s->lookahead)
458 while (s->lookahead >= MIN_MATCH) {
460 n = s->lookahead - (MIN_MATCH-1);
466 s->lookahead = MIN_MATCH-1;
469 s->strstart += s->lookahead;
471 s->insert = s->lookahead;
472 s->lookahead = 0;
493 len = s->strstart + s->lookahead;
497 zmemcpy(dictionary, s->window + s->strstart + s->lookahead - len, len);
1033 if (strm->avail_in != 0 || s->lookahead != 0 ||
[all …]
/third_party/flutter/skia/third_party/externals/zlib/
Dfill_window_sse.c40 Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead"); in fill_window_sse()
43 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart); in fill_window_sse()
47 if (more == 0 && s->strstart == 0 && s->lookahead == 0) { in fill_window_sse()
121 s->window + s->strstart + s->lookahead, in fill_window_sse()
123 s->lookahead += n; in fill_window_sse()
126 if (s->lookahead >= MIN_MATCH) { in fill_window_sse()
139 } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0); in fill_window_sse()
149 ulg curr = s->strstart + (ulg)(s->lookahead); in fill_window_sse()
Ddeflate.c481 if (wrap == 2 || (wrap == 1 && s->status != INIT_STATE) || s->lookahead)
507 while (s->lookahead >= MIN_MATCH) {
509 n = s->lookahead - (MIN_MATCH-1);
515 s->lookahead = MIN_MATCH-1;
518 s->strstart += s->lookahead;
520 s->insert = s->lookahead;
521 s->lookahead = 0;
542 len = s->strstart + s->lookahead;
546 zmemcpy(dictionary, s->window + s->strstart + s->lookahead - len, len);
1082 if (strm->avail_in != 0 || s->lookahead != 0 ||
[all …]
/third_party/boost/boost/graph/distributed/
Deager_dijkstra_shortest_paths.hpp50 double lookahead; member
69 << "(P) Lookahead = " << lookahead << "\n" in print()
203 distance_type lookahead) in lookahead_dijkstra_queue() argument
209 lookahead(lookahead) in lookahead_dijkstra_queue()
261 && get(distance_map, queue.top()) <= min_distance + lookahead); in has_suitable_vertex()
330 distance_type lookahead; member in boost::graph::distributed::detail::lookahead_dijkstra_queue
347 typename property_traits<DistanceMap>::value_type lookahead, in eager_dijkstra_shortest_paths() argument
354 eager_dijkstra_shortest_paths_stats.lookahead = lookahead; in eager_dijkstra_shortest_paths()
372 predecessor, lookahead); in eager_dijkstra_shortest_paths()
399 typename property_traits<DistanceMap>::value_type lookahead, in eager_dijkstra_shortest_paths() argument
[all …]
Ddijkstra_shortest_paths.hpp40 typename property_traits<DistanceMap>::value_type lookahead, in run()
45 eager_dijkstra_shortest_paths(g, s, predecessor, distance, lookahead, in run()
86 Lookahead lookahead, in run()
92 ::run(g, s, predecessor, distance, lookahead, weight, index_map, in run()
110 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run_impl()
119 ::run(g, s, predecessor, distance, lookahead, weight, index_map, in run_impl()
133 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run()
144 run_impl(g, s, predecessor, distance, lookahead, weight, index_map, in run()
/third_party/boost/boost/spirit/home/lex/lexer/
Dsupport_functions.hpp147 lookahead(id_actor_(), state_actor_()); in eval()
161 inline typename expression::lookahead<
165 lookahead(T const& id) in lookahead() function
170 return expression::lookahead<id_actor_type, state_actor_type>::make( in lookahead()
176 inline typename expression::lookahead<
180 lookahead(token_def<Attribute, Char, Idtype> const& tok) in lookahead() function
193 return expression::lookahead<id_actor_type, state_actor_type>::make( in lookahead()
Dsupport_functions_expression.hpp33 (boost)(spirit)(lex)(lookahead)
81 struct is_nullary::when<spirit::lex::rule::lookahead, Dummy>
86 struct default_actions::when<spirit::lex::rule::lookahead, Dummy>
/third_party/libwebsockets/win32port/zlib/
Ddeflate.c828 if (strm->avail_in != 0 || s->lookahead != 0 ||
862 if (s->lookahead == 0) {
1050 s->lookahead = 0;
1118 if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
1214 if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
1215 return s->lookahead;
1274 return (uInt)len <= s->lookahead ? (uInt)len : s->lookahead;
1326 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
1330 if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
1392 n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
[all …]
/third_party/zlib/
Ddeflate.c431 if (wrap == 2 || (wrap == 1 && s->status != INIT_STATE) || s->lookahead)
457 while (s->lookahead >= MIN_MATCH) {
459 n = s->lookahead - (MIN_MATCH-1);
469 s->lookahead = MIN_MATCH-1;
472 s->strstart += s->lookahead;
474 s->insert = s->lookahead;
475 s->lookahead = 0;
496 len = s->strstart + s->lookahead;
500 zmemcpy(dictionary, s->window + s->strstart + s->lookahead - len, len);
636 if (strm->avail_in || (s->strstart - s->block_start) + s->lookahead)
[all …]
/third_party/boost/tools/boost_install/test/iostreams/zlib-1.2.11/
Ddeflate.c391 if (wrap == 2 || (wrap == 1 && s->status != INIT_STATE) || s->lookahead)
417 while (s->lookahead >= MIN_MATCH) {
419 n = s->lookahead - (MIN_MATCH-1);
429 s->lookahead = MIN_MATCH-1;
432 s->strstart += s->lookahead;
434 s->insert = s->lookahead;
435 s->lookahead = 0;
456 len = s->strstart + s->lookahead;
460 zmemcpy(dictionary, s->window + s->strstart + s->lookahead - len, len);
996 if (strm->avail_in != 0 || s->lookahead != 0 ||
[all …]
/third_party/boost/libs/beast/test/extern/zlib-1.2.11/
Ddeflate.c391 if (wrap == 2 || (wrap == 1 && s->status != INIT_STATE) || s->lookahead)
417 while (s->lookahead >= MIN_MATCH) {
419 n = s->lookahead - (MIN_MATCH-1);
429 s->lookahead = MIN_MATCH-1;
432 s->strstart += s->lookahead;
434 s->insert = s->lookahead;
435 s->lookahead = 0;
456 len = s->strstart + s->lookahead;
460 zmemcpy(dictionary, s->window + s->strstart + s->lookahead - len, len);
996 if (strm->avail_in != 0 || s->lookahead != 0 ||
[all …]
/third_party/flutter/skia/third_party/externals/harfbuzz/src/
Dhb-ot-layout-gsubgpos.hh1031 const HBUINT16 lookahead[], in match_lookahead() argument
1041 skippy_iter.set_match_func (match_func, match_data, lookahead); in match_lookahead()
1825 const HBUINT16 lookahead[], in chain_context_intersects() argument
1835 lookaheadCount, lookahead, in chain_context_intersects()
1845 const HBUINT16 lookahead[], in chain_context_closure_lookup() argument
1853 lookaheadCount, lookahead, in chain_context_closure_lookup()
1865 const HBUINT16 lookahead[], in chain_context_collect_glyphs_lookup() argument
1877 lookaheadCount, lookahead, in chain_context_collect_glyphs_lookup()
1889 const HBUINT16 lookahead[] HB_UNUSED, in chain_context_would_apply_lookup()
1906 const HBUINT16 lookahead[], in chain_context_apply_lookup() argument
[all …]
/third_party/harfbuzz/src/
Dhb-ot-layout-gsubgpos.hh1198 const HBUINT16 lookahead[], in match_lookahead() argument
1208 skippy_iter.set_match_func (match_func, match_data, lookahead); in match_lookahead()
2333 const HBUINT16 lookahead[], in chain_context_intersects() argument
2343 lookaheadCount, lookahead, in chain_context_intersects()
2353 const HBUINT16 lookahead[], in chain_context_closure_lookup() argument
2362 lookaheadCount, lookahead, in chain_context_closure_lookup()
2379 const HBUINT16 lookahead[], in chain_context_collect_glyphs_lookup() argument
2391 lookaheadCount, lookahead, in chain_context_collect_glyphs_lookup()
2403 const HBUINT16 lookahead[] HB_UNUSED, in chain_context_would_apply_lookup()
2420 const HBUINT16 lookahead[], in chain_context_apply_lookup() argument
[all …]
/third_party/skia/third_party/externals/harfbuzz/src/
Dhb-ot-layout-gsubgpos.hh1188 const HBUINT16 lookahead[], in match_lookahead() argument
1198 skippy_iter.set_match_func (match_func, match_data, lookahead); in match_lookahead()
2350 const HBUINT16 lookahead[], in chain_context_intersects() argument
2360 lookaheadCount, lookahead, in chain_context_intersects()
2370 const HBUINT16 lookahead[], in chain_context_closure_lookup() argument
2379 lookaheadCount, lookahead, in chain_context_closure_lookup()
2396 const HBUINT16 lookahead[], in chain_context_collect_glyphs_lookup() argument
2408 lookaheadCount, lookahead, in chain_context_collect_glyphs_lookup()
2420 const HBUINT16 lookahead[] HB_UNUSED, in chain_context_would_apply_lookup()
2437 const HBUINT16 lookahead[], in chain_context_apply_lookup() argument
[all …]
/third_party/python/Tools/scripts/
Dfixdiv.py321 self.lookahead = []
324 while len(self.lookahead) < self.window and not self.eoflookahead:
329 self.lookahead.append(line)
332 if not self.lookahead:
334 line = self.lookahead.pop(0)
341 lookend = self.lineno + len(self.lookahead)
345 return self.lookahead[index - self.lineno]
/third_party/boost/libs/graph_parallel/doc/
Ddijkstra_shortest_paths.rst97 IN: ``lookahead(distance_type look)``
100 `Eager Dijkstra's algorithm`_ with the given lookahead value.
113 **Default:** no value (lookahead is not employed; uses `Crauser et
122 depending on the distribution of the graph, lookahead, and edge
138 graph contains negative edges or lookahead is employed.
150 without lookahead or negative edges).
161 vertex is not necessarily finished if lookahead is permitted or
254 typename property_traits<DistanceMap>::value_type lookahead,
266 typename property_traits<DistanceMap>::value_type lookahead,
276 typename property_traits<DistanceMap>::value_type lookahead);
[all …]
/third_party/boost/libs/graph/src/
Dread_graphviz_new.cpp199 std::vector< token > lookahead; member
247 if (!lookahead.empty()) in get_token_raw()
249 token t = lookahead.front(); in get_token_raw()
250 lookahead.erase(lookahead.begin()); in get_token_raw()
429 if (lookahead.empty()) in peek_token_raw()
432 lookahead.push_back(t); in peek_token_raw()
434 return lookahead.front(); in peek_token_raw()
524 std::vector< token > lookahead; member
540 : the_tokenizer(gr), lookahead(), r(result), sgcounter(0) in parser()
550 if (lookahead.empty()) in get()
[all …]
/third_party/mesa3d/bin/
Dperf-annotate-jit.py73 def lookahead(self): member in LineParser
142 if self.eof() or not self.lookahead().startswith('#'):
186 while self.lookahead():
191 if self.lookahead() == '':
/third_party/node/deps/icu-small/source/tools/genrb/
Dparse.cpp111 struct Lookahead lookahead[MAX_LOOKAHEAD + 1]; member
160 …state->lookahead[i].type = getNextToken(state->buffer, &state->lookahead[i].value, &state->lookahe… in initLookahead()
176 ustr_deinit(&state->lookahead[i].value); in cleanupLookahead()
177 ustr_deinit(&state->lookahead[i].comment); in cleanupLookahead()
188 result = state->lookahead[state->lookaheadPosition].type; in getToken()
192 *tokenValue = &state->lookahead[state->lookaheadPosition].value; in getToken()
197 *linenumber = state->lookahead[state->lookaheadPosition].line; in getToken()
202 ustr_cpy(comment, &(state->lookahead[state->lookaheadPosition].comment), status); in getToken()
207 ustr_setlen(&state->lookahead[i].comment, 0, status); in getToken()
208 ustr_setlen(&state->lookahead[i].value, 0, status); in getToken()
[all …]
/third_party/icu/icu4c/source/tools/genrb/
Dparse.cpp111 struct Lookahead lookahead[MAX_LOOKAHEAD + 1]; member
160 …state->lookahead[i].type = getNextToken(state->buffer, &state->lookahead[i].value, &state->lookahe… in initLookahead()
176 ustr_deinit(&state->lookahead[i].value); in cleanupLookahead()
177 ustr_deinit(&state->lookahead[i].comment); in cleanupLookahead()
188 result = state->lookahead[state->lookaheadPosition].type; in getToken()
192 *tokenValue = &state->lookahead[state->lookaheadPosition].value; in getToken()
197 *linenumber = state->lookahead[state->lookaheadPosition].line; in getToken()
202 ustr_cpy(comment, &(state->lookahead[state->lookaheadPosition].comment), status); in getToken()
207 ustr_setlen(&state->lookahead[i].comment, 0, status); in getToken()
208 ustr_setlen(&state->lookahead[i].value, 0, status); in getToken()
[all …]
/third_party/skia/third_party/externals/icu/source/tools/genrb/
Dparse.cpp111 struct Lookahead lookahead[MAX_LOOKAHEAD + 1]; member
160 …state->lookahead[i].type = getNextToken(state->buffer, &state->lookahead[i].value, &state->lookahe… in initLookahead()
176 ustr_deinit(&state->lookahead[i].value); in cleanupLookahead()
177 ustr_deinit(&state->lookahead[i].comment); in cleanupLookahead()
188 result = state->lookahead[state->lookaheadPosition].type; in getToken()
192 *tokenValue = &state->lookahead[state->lookaheadPosition].value; in getToken()
197 *linenumber = state->lookahead[state->lookaheadPosition].line; in getToken()
202 ustr_cpy(comment, &(state->lookahead[state->lookaheadPosition].comment), status); in getToken()
207 ustr_setlen(&state->lookahead[i].comment, 0, status); in getToken()
208 ustr_setlen(&state->lookahead[i].value, 0, status); in getToken()
[all …]
/third_party/flutter/skia/third_party/externals/icu/source/tools/genrb/
Dparse.cpp111 struct Lookahead lookahead[MAX_LOOKAHEAD + 1]; member
160 …state->lookahead[i].type = getNextToken(state->buffer, &state->lookahead[i].value, &state->lookahe… in initLookahead()
176 ustr_deinit(&state->lookahead[i].value); in cleanupLookahead()
177 ustr_deinit(&state->lookahead[i].comment); in cleanupLookahead()
188 result = state->lookahead[state->lookaheadPosition].type; in getToken()
192 *tokenValue = &state->lookahead[state->lookaheadPosition].value; in getToken()
197 *linenumber = state->lookahead[state->lookaheadPosition].line; in getToken()
202 ustr_cpy(comment, &(state->lookahead[state->lookaheadPosition].comment), status); in getToken()
207 ustr_setlen(&state->lookahead[i].comment, 0, status); in getToken()
208 ustr_setlen(&state->lookahead[i].value, 0, status); in getToken()
[all …]

123456