Home
last modified time | relevance | path

Searched refs:lookahead (Results 1 - 25 of 85) sorted by relevance

1234

/third_party/rust/crates/syn/src/
H A Dderive.rs72 let lookahead = input.lookahead1(); in parse()
73 if lookahead.peek(Token![struct]) { in parse()
92 } else if lookahead.peek(Token![enum]) { in parse()
111 } else if lookahead.peek(Token![union]) { in parse()
130 Err(lookahead.error()) in parse()
138 let mut lookahead = input.lookahead1(); variables
140 if lookahead.peek(Token![where]) {
142 lookahead = input.lookahead1();
145 if where_clause.is_none() && lookahead.peek(token::Paren) {
148 lookahead
[all...]
H A Ditem.rs918 let lookahead = ahead.lookahead1();
919 let mut item = if lookahead.peek(Token![fn]) || peek_signature(&ahead) {
928 } else if lookahead.peek(Token![extern]) {
930 let lookahead = ahead.lookahead1();
931 if lookahead.peek(Token![crate]) {
933 } else if lookahead.peek(token::Brace) {
935 } else if lookahead.peek(LitStr) {
937 let lookahead = ahead.lookahead1();
938 if lookahead.peek(token::Brace) {
941 Err(lookahead
1229 let mut lookahead = input.lookahead1(); parse_macro2() variables
2585 let mut lookahead = ahead.lookahead1(); parse() variables
[all...]
H A Dpat.rs263 let lookahead = input.lookahead1(); in parse_single()
264 if lookahead.peek(Ident) in parse_single()
271 || lookahead.peek(Token![::]) in parse_single()
272 || lookahead.peek(Token![<]) in parse_single()
278 } else if lookahead.peek(Token![_]) { in parse_single()
282 } else if input.peek(Token![-]) || lookahead.peek(Lit) || lookahead.peek(Token![const]) in parse_single()
285 } else if lookahead.peek(Token![ref]) in parse_single()
286 || lookahead.peek(Token![mut]) in parse_single()
291 } else if lookahead in parse_single()
[all...]
H A Dty.rs339 let mut lookahead = input.lookahead1(); variables
340 if lookahead.peek(Token![for]) {
342 lookahead = input.lookahead1();
343 if !lookahead.peek(Ident)
344 && !lookahead.peek(Token![fn])
345 && !lookahead.peek(Token![unsafe])
346 && !lookahead.peek(Token![extern])
347 && !lookahead.peek(Token![super])
348 && !lookahead.peek(Token![self])
349 && !lookahead
[all...]
H A Dlookahead.rs3 use crate::sealed::lookahead::Sealed;
21 /// Consuming tokens from the source stream after constructing a lookahead
22 /// object does not also advance the lookahead object.
35 /// // On invalid input, lookahead gives us a reasonable error message.
49 /// let lookahead = input.lookahead1();
50 /// if lookahead.peek(Ident) {
52 /// } else if lookahead.peek(Lifetime) {
54 /// } else if lookahead.peek(Token![const]) {
57 /// Err(lookahead.error())
77 lookahead in peek_impl()
[all...]
/third_party/node/deps/zlib/
H A Ddeflate.c240 * Fill the window when the lookahead becomes insufficient.
241 * Updates strstart and lookahead.
243 * IN assertion: lookahead < MIN_LOOKAHEAD
254 Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead"); in fill_window()
257 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart); in fill_window()
261 if (more == 0 && s->strstart == 0 && s->lookahead == 0) { in fill_window()
266 * strstart == 0 && lookahead == 1 (input done a byte at time) in fill_window()
272 /* If the window is almost full and there is insufficient lookahead, in fill_window()
289 * strstart <= WSIZE+MAX_DIST-1 && lookahead < in fill_window()
[all...]
/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()
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()
55 * strstart == 0 && lookahead == 1 (input done a byte at time) in fill_window_sse()
61 /* If the window is almost full and there is insufficient lookahead, in fill_window_sse()
111 * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 && in fill_window_sse()
112 * more == window_size - lookahead - strstart in fill_window_sse()
117 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD. in fill_window_sse()
124 s->window + s->strstart + s->lookahead, in fill_window_sse()
[all...]
H A Ddeflate.c446 if (wrap == 2 || (wrap == 1 && s->status != INIT_STATE) || s->lookahead)
472 while (s->lookahead >= MIN_MATCH) {
474 n = s->lookahead - (MIN_MATCH-1);
480 s->lookahead = MIN_MATCH-1;
483 s->strstart += s->lookahead;
485 s->insert = s->lookahead;
486 s->lookahead = 0;
507 len = s->strstart + s->lookahead;
511 zmemcpy(dictionary, s->window + s->strstart + s->lookahead - len, len);
647 if (strm->avail_in || (s->strstart - s->block_start) + s->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()
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()
55 * strstart == 0 && lookahead == 1 (input done a byte at time) in fill_window_sse()
61 /* If the window is almost full and there is insufficient lookahead, in fill_window_sse()
111 * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 && in fill_window_sse()
112 * more == window_size - lookahead - strstart in fill_window_sse()
117 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD. in fill_window_sse()
124 s->window + s->strstart + s->lookahead, in fill_window_sse()
[all...]
H A 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 !
[all...]
/third_party/zlib/
H A Ddeflate.c244 * Fill the window when the lookahead becomes insufficient.
245 * Updates strstart and lookahead.
247 * IN assertion: lookahead < MIN_LOOKAHEAD
259 Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead"); in fill_window()
262 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart); in fill_window()
266 if (more == 0 && s->strstart == 0 && s->lookahead == 0) { in fill_window()
271 * strstart == 0 && lookahead == 1 (input done a byte at time) in fill_window()
277 /* If the window is almost full and there is insufficient lookahead, in fill_window()
294 * strstart <= WSIZE+MAX_DIST-1 && lookahead < in fill_window()
[all...]
/third_party/libwebsockets/win32port/zlib/
H A Ddeflate.c377 * s->lookahead stays null, so s->ins_h will be recomputed at the next
865 if (strm->avail_in != 0 || s->lookahead != 0 ||
899 if (s->lookahead == 0) {
1084 s->lookahead = 0;
1103 * OUT assertion: the match length is not greater than s->lookahead.
1152 if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
1154 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1162 * for insufficient lookahead only occur occasionally for performance
1165 * However the length of the match is limited to the lookahead, s
[all...]
/third_party/skia/third_party/externals/harfbuzz/src/
H A Dhb-ot-layout-gsubgpos.hh1198 const HBUINT16 lookahead[], in match_lookahead()
1208 skippy_iter.set_match_func (match_func, match_data, lookahead); in match_lookahead()
2360 const HBUINT16 lookahead[],
2370 lookaheadCount, lookahead,
2380 const HBUINT16 lookahead[],
2389 lookaheadCount, lookahead,
2406 const HBUINT16 lookahead[],
2418 lookaheadCount, lookahead,
2430 const HBUINT16 lookahead[] HB_UNUSED,
2447 const HBUINT16 lookahead[],
1196 match_lookahead(hb_ot_apply_context_t *c, unsigned int count, const HBUINT16 lookahead[], match_func_t match_func, const void *match_data, unsigned int offset, unsigned int *end_index) match_lookahead() argument
[all...]
/third_party/lzma/C/
H A D7zDec.c178 size_t lookahead = (1 << 18); in SzDecodeLzma() local
179 if (lookahead > inSize) in SzDecodeLzma()
180 lookahead = (size_t)inSize; in SzDecodeLzma()
181 res = ILookInStream_Look(inStream, &inBuf, &lookahead); in SzDecodeLzma()
186 SizeT inProcessed = (SizeT)lookahead, dicPos = state.dicPos; in SzDecodeLzma()
189 lookahead -= inProcessed; in SzDecodeLzma()
240 size_t lookahead = (1 << 18); in SzDecodeLzma2() local
241 if (lookahead > inSize) in SzDecodeLzma2()
242 lookahead = (size_t)inSize; in SzDecodeLzma2()
243 res = ILookInStream_Look(inStream, &inBuf, &lookahead); in SzDecodeLzma2()
[all...]
/third_party/python/Tools/scripts/
H A 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/rust/crates/cxx/gen/lib/src/syntax/
H A Dcfg.rs38 let lookahead = input.lookahead1(); in parse_single()
55 } else if lookahead.peek(Token![=]) { in parse_single()
59 } else if lookahead.peek(Token![,]) || input.is_empty() { in parse_single()
62 Err(lookahead.error()) in parse_single()
/third_party/rust/crates/cxx/syntax/
H A Dcfg.rs38 let lookahead = input.lookahead1(); in parse_single()
55 } else if lookahead.peek(Token![=]) { in parse_single()
59 } else if lookahead.peek(Token![,]) || input.is_empty() { in parse_single()
62 Err(lookahead.error()) in parse_single()
/third_party/rust/crates/cxx/gen/cmd/src/
H A Dcfg.rs83 let lookahead = input.lookahead1(); in parse()
84 if lookahead.peek(LitBool) { in parse()
87 } else if lookahead.peek(LitStr) { in parse()
91 Err(lookahead.error()) in parse()
/third_party/rust/crates/cxx/gen/cmd/src/syntax/
H A Dcfg.rs38 let lookahead = input.lookahead1(); in parse_single()
55 } else if lookahead.peek(Token![=]) { in parse_single()
59 } else if lookahead.peek(Token![,]) || input.is_empty() { in parse_single()
62 Err(lookahead.error()) in parse_single()
/third_party/rust/crates/cxx/macro/src/syntax/
H A Dcfg.rs38 let lookahead = input.lookahead1(); in parse_single()
55 } else if lookahead.peek(Token![=]) { in parse_single()
59 } else if lookahead.peek(Token![,]) || input.is_empty() { in parse_single()
62 Err(lookahead.error()) in parse_single()
/third_party/rust/crates/cxx/gen/build/src/syntax/
H A Dcfg.rs38 let lookahead = input.lookahead1(); in parse_single()
55 } else if lookahead.peek(Token![=]) { in parse_single()
59 } else if lookahead.peek(Token![,]) || input.is_empty() { in parse_single()
62 Err(lookahead.error()) in parse_single()
/third_party/mesa3d/bin/
H A Dperf-annotate-jit.py73 def lookahead(self): member in LineParser
142 if self.eof() or not self.lookahead().startswith('#'):
146 # read lookahead
186 while self.lookahead():
191 if self.lookahead() == '':
/third_party/icu/icu4c/source/tools/genrb/
H A Dparse.cpp118 struct Lookahead lookahead[MAX_LOOKAHEAD + 1]; member
137 /* The nature of the lookahead buffer:
139 MAX_LOOKAHEAD lookahead tokens and a slot for the current token and value.
168 state->lookahead[i].type = getNextToken(state->buffer, &state->lookahead[i].value, &state->lookahead[i].line, &state->lookahead[i].comment, status); in initLookahead()
184 ustr_deinit(&state->lookahead[i].value); in cleanupLookahead()
185 ustr_deinit(&state->lookahead[i].comment); in cleanupLookahead()
196 result = state->lookahead[stat in getToken()
[all...]
/third_party/node/deps/icu-small/source/tools/genrb/
H A Dparse.cpp118 struct Lookahead lookahead[MAX_LOOKAHEAD + 1]; member
137 /* The nature of the lookahead buffer:
139 MAX_LOOKAHEAD lookahead tokens and a slot for the current token and value.
168 state->lookahead[i].type = getNextToken(state->buffer, &state->lookahead[i].value, &state->lookahead[i].line, &state->lookahead[i].comment, status); in initLookahead()
184 ustr_deinit(&state->lookahead[i].value); in cleanupLookahead()
185 ustr_deinit(&state->lookahead[i].comment); in cleanupLookahead()
196 result = state->lookahead[stat in getToken()
[all...]
/third_party/skia/third_party/externals/icu/source/tools/genrb/
H A Dparse.cpp111 struct Lookahead lookahead[MAX_LOOKAHEAD + 1]; member
129 /* The nature of the lookahead buffer:
131 MAX_LOOKAHEAD lookahead tokens and a slot for the current token and value.
160 state->lookahead[i].type = getNextToken(state->buffer, &state->lookahead[i].value, &state->lookahead[i].line, &state->lookahead[i].comment, status); in initLookahead()
176 ustr_deinit(&state->lookahead[i].value); in cleanupLookahead()
177 ustr_deinit(&state->lookahead[i].comment); in cleanupLookahead()
188 result = state->lookahead[stat in getToken()
[all...]

Completed in 22 milliseconds

1234