| /device/linaro/bootloader/edk2/MdeModulePkg/Library/LzmaCustomDecompressLib/Sdk/C/ |
| 7zTypes.h | 207 void LookToRead_CreateVTable(CLookToRead *p, int lookahead);
|
| /external/adhd/cras/src/dsp/ |
| drc.h | 68 * PARAM_PRE_DELAY - The lookahead time for the compressor, in seconds.
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| LL1DFA.java | 42 /** From list of lookahead sets (one per alt in decision), create
|
| DFAState.java | 52 * so I have to add one to simulate the proper lookahead sequences for
80 /** When doing an acyclic DFA, this is the number of lookahead symbols
83 * a max fixed lookahead.
496 // if fixed lookahead, then more than 1 alt is a nondeterminism
497 // if we have hit the max lookahead
|
| /external/chromium-trace/catapult/common/py_vulcanize/third_party/rjsmin/bench/ |
| jsmin.c | 48 /* get -- return the next character from stdin. Watch out for lookahead. If
|
| /external/clang/lib/AST/ |
| CommentBriefParser.cpp | 60 // Get lookahead token.
|
| /external/javassist/src/main/javassist/bytecode/analysis/ |
| SubroutineScanner.java | 69 int old = iter.lookAhead();
|
| /external/lzma/C/ |
| 7zTypes.h | 203 void LookToRead_CreateVTable(CLookToRead *p, int lookahead);
|
| /external/smali/smalidea/src/main/java/org/jf/smalidea/ |
| PsiBuilderTokenStream.java | 110 IElementType elementType = psiBuilder.lookAhead(i-1);
|
| /external/swiftshader/third_party/LLVM/lib/Target/ARM/ |
| ARMHazardRecognizer.cpp | 36 assert(Stalls == 0 && "ARM hazards don't support scoreboard lookahead");
|
| /external/swiftshader/third_party/LLVM/lib/Target/CellSPU/ |
| SPUHazardRecognizers.cpp | 50 assert(Stalls == 0 && "SPU hazards don't yet support scoreboard lookahead");
|
| /external/syslinux/lzo/src/ |
| lzo_mchw.ch | 37 lzo_uint look; /* bytes in lookahead buffer */
|
| /external/webrtc/webrtc/modules/audio_processing/aec/ |
| aec_resampler.c | 83 // Add new frame data in lookahead
|
| /external/libpcap/ |
| grammar.c | [all...] |
| /external/libxkbcommon/xkbcommon/src/xkbcomp/ |
| parser.c | [all...] |
| /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/ |
| fset2.c | [all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/zlib/ |
| deflate.h | 161 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.
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/zlib/ |
| deflate.h | 158 uInt lookahead; /* number of valid bytes ahead in window */
member in struct:internal_state
272 /* Minimum amount of lookahead, except at the end of the input file.
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| Interpreter.java | 391 * The first symbol of lookahead is presumed to be primed; that is,
392 * input.lookahead(1) must point at the input symbol you want to start
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/messages/languages/ |
| en.stg | 87 "cannot generate a sample input sequence from lookahead DFA"
261 ANTLR could not analyze this decision in rule <enclosingRule>; often this is because of recursive rule references visible from the left edge of alternatives. ANTLR will re-analyze the decision with a fixed lookahead of k=1. Consider using "options {k=1;}" for that decision and possibly adding a syntactic predicate.
|
| /external/apache-xml/src/main/java/org/apache/xpath/compiler/ |
| Lexer.java | 507 if (m_processor.lookahead('(', 1))
544 if (m_processor.lookahead(':', 1))
|
| /external/clang/lib/Parse/ |
| ParseOpenMP.cpp | 126 Tok = P.getPreprocessor().LookAhead(0);
838 if (PP.LookAhead(0).is(tok::l_paren)) {
[all...] |
| /external/freetype/src/gzip/ |
| infblock.c | 312 bl = 9; /* must be <= 9 for lookahead assumptions */
313 bd = 6; /* must be <= 9 for lookahead assumptions */
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| RBBINode.java | 29 static final int lookAhead = 4;
48 "lookAhead",
|
| RBBITableBuilder.java | 219 if (n.fType == RBBINode.lookAhead || n.fType == RBBINode.tag) {
220 // Lookahead marker node. It's a leaf, so no recursion on children.
261 n.fType == RBBINode.lookAhead ||
304 n.fType == RBBINode.lookAhead ||
650 // Both lookahead and non-lookahead accepting for this state.
683 fRB.fTreeRoots[fRootIx].findNodes(lookAheadNodes, RBBINode.lookAhead);
[all...] |
