Searched refs:lookahead (Results 51 - 75 of 131) sorted by relevance

123456

/external/bison/data/
H A Dlalr1.cc117 /// \param tok the lookahead token.
511 /// Lookahead and lookahead in internal form.
524 /// Semantic value of the lookahead.
527 /// Location of the lookahead.
575 /* Try to take a decision without lookahead. */
580 /* Read a lookahead token. */
618 /* Shift the lookahead token. */
685 lookahead is translated. */
709 /* Make sure we have latest lookahead translation. See comments at
725 /* If just tried and failed to reuse lookahead toke
[all...]
H A Dglr.c79 # Same as above, but on the lookahead, hence &yylloc instead of yylocp.
94 # Same as above, but on the lookahead, hence &yylloc instead of yylocp.
706 * stacks have actually needed the current lookahead. During deterministic
720 /** The lookahead for this reduction. */
2037 - The only way there can be no lookahead present (in yychar) is if
2039 detecting the absence of a lookahead is sufficient to determine
2042 - Don't assume there isn't a lookahead just because this state is a
2047 correct lookahead information, and it depends on the parser not
2048 to perform extra reductions after fetching a lookahead from the
2145 of the lookahead
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/
H A Dtemporal_filter.c450 num_frames_forward = vp8_lookahead_depth(cpi->lookahead)
507 struct lookahead_entry* buf = vp8_lookahead_peek(cpi->lookahead,
H A Donyx_int.h31 #include "lookahead.h"
314 struct lookahead_ctx *lookahead; member in struct:VP8_COMP
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/
H A Dvp9_mbgraph.c376 int i, n_frames = vp9_lookahead_depth(cpi->lookahead);
401 struct lookahead_entry *q_cur = vp9_lookahead_peek(cpi->lookahead, i);
H A Dvp9_temporal_filter.c368 vp9_lookahead_depth(cpi->lookahead) - distance - 1;
447 struct lookahead_entry *buf = vp9_lookahead_peek(cpi->lookahead,
H A Dvp9_encoder.h234 struct lookahead_ctx *lookahead; member in struct:VP9_COMP
/external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/tests/
H A Dopt-gvmat64.asm218 ;;; if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
475 ;;; if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
476 ;;; return s->lookahead;
/external/libvpx/libvpx/vp8/encoder/
H A Dtemporal_filter.c449 num_frames_forward = vp8_lookahead_depth(cpi->lookahead)
506 struct lookahead_entry* buf = vp8_lookahead_peek(cpi->lookahead,
H A Donyx_int.h31 #include "lookahead.h"
317 struct lookahead_ctx *lookahead; member in struct:VP8_COMP
/external/libvpx/libvpx/vp9/encoder/
H A Dvp9_mbgraph.c385 int i, n_frames = vp9_lookahead_depth(cpi->lookahead);
410 struct lookahead_entry *q_cur = vp9_lookahead_peek(cpi->lookahead, i);
H A Dvp9_onyx_int.h289 struct lookahead_ctx *lookahead; member in struct:VP9_COMP
/external/chromium_org/third_party/sqlite/src/tool/
H A Dlemon.c449 ** The yy_action table maps the pair (state_number, lookahead) into an
451 ** determines an initial offset into the yy_action array. The lookahead
453 ** yy_action array. If the aAction[X].lookahead equals the value of the
454 ** of the lookahead input, then the value of the action_number output is
466 int lookahead; /* Value of the lookahead token */ member in struct:lookahead_action
467 int action; /* Action to take on the given lookahead */
476 int mnLookahead; /* Minimum aLookahead[].lookahead */
478 int mxLookahead; /* Maximum aLookahead[].lookahead */
490 #define acttab_yylookahead(X,N) ((X)->aAction[N].lookahead)
515 acttab_action(acttab *p, int lookahead, int action) argument
[all...]
/external/chromium_org/third_party/zlib/
H A Ddeflate.h163 uInt lookahead; /* number of valid bytes ahead in window */ member in struct:internal_state
284 /* Minimum amount of lookahead, except at the end of the input file.
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
H A Ddeflate.h161 uInt lookahead; /* number of valid bytes ahead in window */ member in struct:internal_state
282 /* Minimum amount of lookahead, except at the end of the input file.
/external/qemu/distrib/zlib-1.2.8/
H A Ddeflate.h161 uInt lookahead; /* number of valid bytes ahead in window */ member in struct:internal_state
282 /* Minimum amount of lookahead, except at the end of the input file.
/external/zlib/src/
H A Ddeflate.h161 uInt lookahead; /* number of valid bytes ahead in window */ member in struct:internal_state
282 /* Minimum amount of lookahead, except at the end of the input file.
/external/bison/doc/
H A Drefcard.tex460 \key{Current lookahead token.} {yychar}
491 \key{Value in {\tt yychar} if no lookahead token.} {YYEMPTY}
492 \key{Clear previous lookahead token.} {yyclearin}
/external/zlib/src/contrib/masmx64/
H A Dgvmat64.asm256 ;;; if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
516 ;;; if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
517 ;;; return s->lookahead;
/external/zlib/src/contrib/masmx86/
H A Dmatch686.asm242 ;;; if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
435 ;;; if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
436 ;;; return s->lookahead;
/external/chromium_org/third_party/skia/third_party/lua/src/
H A Dllex.c161 ls->lookahead.token = TK_EOS; /* no look-ahead token */
513 if (ls->lookahead.token != TK_EOS) { /* is there a look-ahead token? */
514 ls->t = ls->lookahead; /* use this one */
515 ls->lookahead.token = TK_EOS; /* and discharge it */
523 lua_assert(ls->lookahead.token == TK_EOS);
524 ls->lookahead.token = llex(ls, &ls->lookahead.seminfo);
525 return ls->lookahead.token;
/external/linux-tools-perf/perf-3.12.0/tools/perf/util/
H A Dpmu-bison.c961 - The only way there can be no lookahead present (in yychar) is if
963 detecting the absence of a lookahead is sufficient to determine
966 - Don't assume there isn't a lookahead just because this state is a
971 correct lookahead information, and it depends on the parser not
972 to perform extra reductions after fetching a lookahead from the
1117 /* The lookahead symbol. */
1120 /* The semantic value of the lookahead symbol. */
1304 lookahead token if we need one and don't already have one. */
1306 /* First try to decide what to do without reference to lookahead token. */
1311 /* Not known => get a lookahead toke
[all...]
/external/openfst/src/include/fst/
H A Dmatcher-fst.h26 #include <fst/lookahead-matcher.h>
/external/openfst/src/include/fst/script/
H A Dinfo-impl.h31 #include <fst/lookahead-matcher.h>
299 os << "input lookahead"
302 os << "output lookahead"
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
H A DAntlr.Runtime.Tree.pas1067 /// the lookahead mechanism is fairly complicated.
1984 /// to fit new lookahead depths, but Consume() wraps like a circular
1989 /// <summary>lookahead[head] is the first symbol of lookahead, LT(1). </summary>
1993 /// Add new lookahead at lookahead[tail]. tail wraps around at the
1994 /// end of the lookahead buffer so tail could be less than head.
2062 /// the lookahead buffer.
2073 /// <summary>Make sure we have at least k symbols in lookahead buffer </summary>
2078 /// Add a node to the lookahead buffe
[all...]

Completed in 677 milliseconds

123456