| /external/chromium_org/third_party/re2/re2/ |
| D | dfa.cc | 57 class DFA { class
59 DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem);
60 ~DFA();
386 class DFA::Workq : public SparseSet {
436 DFA::DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem) in DFA() function in re2::DFA
456 mem_budget_ -= sizeof(DFA); in DFA()
487 DFA::~DFA() { in ~DFA()
509 string DFA::DumpWorkq(Workq* q) { in DumpWorkq()
512 for (DFA::Workq::iterator it = q->begin(); it != q->end(); ++it) { in DumpWorkq()
525 string DFA::DumpState(State* state) { in DumpState()
[all …]
|
| D | prog.h | 74 class DFA; variable
340 DFA* GetDFA(MatchKind kind);
358 DFA* volatile dfa_first_; // DFA cached for kFirstMatch
359 DFA* volatile dfa_longest_; // DFA cached for kLongestMatch and kFullMatch
361 void (*delete_dfa_)(DFA* dfa);
|
| /external/regex-re2/re2/ |
| D | dfa.cc | 55 class DFA { class
57 DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem);
58 ~DFA();
384 class DFA::Workq : public SparseSet {
434 DFA::DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem) in DFA() function in re2::DFA
454 mem_budget_ -= sizeof(DFA); in DFA()
485 DFA::~DFA() { in ~DFA()
507 string DFA::DumpWorkq(Workq* q) { in DumpWorkq()
510 for (DFA::Workq::iterator it = q->begin(); it != q->end(); ++it) { in DumpWorkq()
523 string DFA::DumpState(State* state) { in DumpState()
[all …]
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/re2c/ |
| D | dfa.h | 10 struct DFA;
81 typedef struct DFA { struct
87 } DFA; argument
89 DFA *DFA_new(Ins*, unsigned int, unsigned int, unsigned int, Char*);
90 void DFA_delete(DFA*);
91 void DFA_addState(DFA*, State**, State*);
92 State *DFA_findState(DFA*, Ins**, unsigned int);
93 void DFA_split(DFA*, State*);
95 void DFA_findSCCs(DFA*);
96 void DFA_emit(DFA*, FILE *);
[all …]
|
| D | dfa.c | 67 DFA_out(FILE *o, const DFA *dfa){ in DFA_out()
123 DFA *
126 DFA *d = malloc(sizeof(DFA)); in DFA_new()
197 DFA_delete(DFA *d){ in DFA_delete()
205 void DFA_addState(DFA *d, State **a, State *s){ in DFA_addState()
213 State *DFA_findState(DFA *d, Ins **kernel, unsigned int kCount){ in DFA_findState()
|
| /external/antlr/antlr-3.4/runtime/ActionScript/project/test/org/antlr/runtime/test/ |
| D | TestDFA.as | 4 import org.antlr.runtime.DFA;
12 assertEquals("2,9,9,9", DFA.unpackEncodedString("\x01\x02\x03\x09"));
18 assertEquals("32767,32767,32767", DFA.unpackEncodedString(testVal));
19 assertEquals("32767,32767,32767", DFA.unpackEncodedString(testVal, true));
23 assertEquals("-1,-1", DFA.unpackEncodedString(testVal));
24 assertEquals("65535,65535", DFA.unpackEncodedString(testVal, true));
|
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| D | TestDFAMatching.java | 30 import org.antlr.analysis.DFA;
48 DFA dfa = g.getLookaheadDFA(1); in testSimpleAltCharTest()
61 DFA dfa = g.getLookaheadDFA(1); in testSets()
75 DFA dfa = g.getLookaheadDFA(1); in testFiniteCommonLeftPrefixes()
89 DFA dfa = g.getLookaheadDFA(3); in testSimpleLoops()
95 protected void checkPrediction(DFA dfa, String input, int expected) in checkPrediction()
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/JavaScript/ |
| D | JavaScript.stg | 40 …<cyclicDFAs:{dfa | this.dfa<dfa.decisionNumber> = new <grammar.recognizerName>.DFA<dfa.decisionNum…
78 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
165 …<cyclicDFAs:{dfa | this.dfa<dfa.decisionNumber> = new <grammar.recognizerName>.DFA<dfa.decisionNum…
215 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
604 * number. A DFA predicts the alternative and then a simple switch
843 /** Same as a normal DFA state except that we don't examine lookahead
853 /** A DFA state that is actually the loopback decision of a closure
888 /** A DFA state where a SWITCH may be generated. The code generator
932 /** The code to initiate execution of a cyclic DFA; this is used
933 * in the rule to predict an alt just like the fixed DFA case.
[all …]
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Java/ |
| D | Java.stg | 128 …<cyclicDFAs:{dfa | protected DFA<dfa.decisionNumber> dfa<dfa.decisionNumber> = new DFA<dfa.decisio…
129 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
255 …<cyclicDFAs:{dfa | protected DFA<dfa.decisionNumber> dfa<dfa.decisionNumber> = new DFA<dfa.decisio…
256 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
649 * number. A DFA predicts the alternative and then a simple switch
908 /** Same as a normal DFA state except that we don't examine lookahead
918 /** A DFA state that is actually the loopback decision of a closure
953 /** A DFA state where a SWITCH may be generated. The code generator
999 /** The code to initiate execution of a cyclic DFA; this is used
1000 * in the rule to predict an alt just like the fixed DFA case.
[all …]
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/ |
| D | SimpleCLexer.java | 695 static final short[] DFA4_eot = DFA.unpackEncodedString(DFA4_eotS);
696 static final short[] DFA4_eof = DFA.unpackEncodedString(DFA4_eofS);
697 static final char[] DFA4_min = DFA.unpackEncodedStringToUnsignedChars(DFA4_minS);
698 static final char[] DFA4_max = DFA.unpackEncodedStringToUnsignedChars(DFA4_maxS);
699 static final short[] DFA4_accept = DFA.unpackEncodedString(DFA4_acceptS);
700 static final short[] DFA4_special = DFA.unpackEncodedString(DFA4_specialS);
707 DFA4_transition[i] = DFA.unpackEncodedString(DFA4_transitionS[i]);
711 class DFA4 extends DFA {
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/ |
| D | SimpleCLexer.java | 695 static final short[] DFA4_eot = DFA.unpackEncodedString(DFA4_eotS);
696 static final short[] DFA4_eof = DFA.unpackEncodedString(DFA4_eofS);
697 static final char[] DFA4_min = DFA.unpackEncodedStringToUnsignedChars(DFA4_minS);
698 static final char[] DFA4_max = DFA.unpackEncodedStringToUnsignedChars(DFA4_maxS);
699 static final short[] DFA4_accept = DFA.unpackEncodedString(DFA4_acceptS);
700 static final short[] DFA4_special = DFA.unpackEncodedString(DFA4_specialS);
707 DFA4_transition[i] = DFA.unpackEncodedString(DFA4_transitionS[i]);
711 class DFA4 extends DFA {
|
| /external/llvm/utils/TableGen/ |
| D | DFAPacketizerEmitter.cpp | 129 class DFA { class
131 DFA();
158 DFA::DFA(): currentState(nullptr) {} in DFA() function in DFA
241 const State &DFA::newState() { in newState()
266 void DFA::writeTableAndAPI(raw_ostream &OS, const std::string &TargetName) { in writeTableAndAPI()
268 DFA::StateSet::iterator SI = states.begin(); in writeTableAndAPI()
434 DFA D; in run()
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Scala/ |
| D | Scala.stg | 72 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
111 …<cyclicDFAs:{dfa | private val dfa<dfa.decisionNumber> = new <grammar.recognizerName>.DFA<dfa.deci…
194 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
240 …<cyclicDFAs:{dfa | private val dfa<dfa.decisionNumber> = new <grammar.recognizerName>.DFA<dfa.deci…
630 * number. A DFA predicts the alternative and then a simple switch
901 /** Same as a normal DFA state except that we don't examine lookahead
911 /** A DFA state that is actually the loopback decision of a closure
946 /** A DFA state where a SWITCH may be generated. The code generator
990 /** The code to initiate execution of a cyclic DFA; this is used
991 * in the rule to predict an alt just like the fixed DFA case.
[all …]
|
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
| D | DFA.as | 3 /** A DFA implemented as a set of transition tables.
12 * lexer's Tokens rule DFA has 326 states roughly.
14 public class DFA { class in org.antlr.runtime
25 /** Which recognizer encloses this DFA? Needed to check backtracking */
32 public function DFA(recognizer:BaseRecognizer, decisionNumber:int, description:String, method in org.antlr.runtime.DFA
57 * using this DFA (representing the covering regular approximation
63 trace("Enter DFA.predict for decision "+decisionNumber);
70 …if ( debug ) trace("DFA "+decisionNumber+" state "+s+" LA(1)="+String.fromCharCode(input.LA(1))+"(…
75 trace("DFA "+decisionNumber+
80 trace("DFA "+decisionNumber+
[all …]
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp2/ |
| D | CSharp2.stg | 184 #region DFA
185 <cyclicDFAs:{dfa | DFA<dfa.decisionNumber> dfa<dfa.decisionNumber>;}; separator="\n">
190 …<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>(this<if(dfa.specialStateS…
193 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
330 #region DFA
331 <cyclicDFAs:{dfa | private DFA<dfa.decisionNumber> dfa<dfa.decisionNumber>;}; separator="\n">
336 …<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>( this<if(dfa.specialState…
339 <cyclicDFAs:cyclicDFA()><! dump tables for all DFA !>
340 #endregion DFA
872 * number. A DFA predicts the alternative and then a simple switch
[all …]
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp3/ |
| D | CSharp3.stg | 179 #region DFA
180 <cyclicDFAs:{dfa | DFA<dfa.decisionNumber> dfa<dfa.decisionNumber>;}; separator="\n">
185 …<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>(this<if(dfa.specialStateS…
188 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
322 #region DFA
323 <cyclicDFAs:{dfa | private DFA<dfa.decisionNumber> dfa<dfa.decisionNumber>;}; separator="\n">
328 …<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>( this<if(dfa.specialState…
331 <cyclicDFAs:cyclicDFA()><! dump tables for all DFA !>
332 #endregion DFA
848 * number. A DFA predicts the alternative and then a simple switch
[all …]
|
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/ |
| D | DFA.js | 12 org.antlr.runtime.DFA = function() {}; class in org.antlr.runtime
14 org.antlr.runtime.DFA.prototype = {
119 org.antlr.lang.augmentObject(org.antlr.runtime.DFA, {
147 return org.antlr.runtime.DFA.unpackEncodedString(encodedString);
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
| D | DFA.cs | 38 public delegate int SpecialStateTransitionHandler(DFA dfa, int s, IIntStream input); in SpecialStateTransitionHandler()
53 public class DFA { class
54 public DFA() in DFA() method in Antlr.Runtime.DFA
57 public DFA(SpecialStateTransitionHandler specialStateTransition) { in DFA() method in Antlr.Runtime.DFA
203 static int SpecialStateTransitionDefault(DFA dfa, int s, IIntStream input) { in SpecialStateTransitionDefault()
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
| D | DFA.cs | 39 public delegate int SpecialStateTransitionHandler( DFA dfa, int s, IIntStream input ); in SpecialStateTransitionHandler()
54 public class DFA class
71 public DFA() in DFA() method in Antlr.Runtime.DFA
76 public DFA( SpecialStateTransitionHandler specialStateTransition ) in DFA() method in Antlr.Runtime.DFA
238 static int SpecialStateTransitionDefault( DFA dfa, int s, IIntStream input ) in SpecialStateTransitionDefault()
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| D | NonLLStarDecisionException.java | 34 public DFA abortedDFA;
35 public NonLLStarDecisionException(DFA abortedDFA) { in NonLLStarDecisionException()
|
| D | AnalysisTimeoutException.java | 32 public DFA abortedDFA;
33 public AnalysisTimeoutException(DFA abortedDFA) { in AnalysisTimeoutException()
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ActionScript/ |
| D | ActionScript.stg | 102 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
218 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
592 * number. A DFA predicts the alternative and then a simple switch
832 /** Same as a normal DFA state except that we don't examine lookahead
842 /** A DFA state that is actually the loopback decision of a closure
877 /** A DFA state where a SWITCH may be generated. The code generator
921 /** The code to initiate execution of a cyclic DFA; this is used
922 * in the rule to predict an alt just like the fixed DFA case.
931 dfa<dfa.decisionNumber> = new DFA(this, <dfa.decisionNumber>,
933 DFA<dfa.decisionNumber>_eot, DFA<dfa.decisionNumber>_eof, DFA<dfa.decisionNumber>_min,
[all …]
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Perl5/ |
| D | Perl5.stg | 67 use ANTLR::Runtime::DFA;
106 $self->dfa<dfa.decisionNumber>(<name>::DFA<dfa.decisionNumber>->new({ recognizer => $self }));
112 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
241 <cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = __PACKAGE__::DFA<dfa.decisionNumber>->new($self);}; se…
242 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
624 * number. A DFA predicts the alternative and then a simple switch
872 /** Same as a normal DFA state except that we don't examine lookahead
882 /** A DFA state that is actually the loopback decision of a closure
917 /** A DFA state where a SWITCH may be generated. The code generator
963 /** The code to initiate execution of a cyclic DFA; this is used
[all …]
|
| /external/antlr/antlr-3.4/runtime/Python/unittests/ |
| D | testdfa.py | 30 dfa = antlr3.DFA(
46 antlr3.DFA.unpack(
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Python/ |
| D | Python.stg | 152 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
290 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
735 * number. A DFA predicts the alternative and then a simple switch
991 /** Same as a normal DFA state except that we don't examine lookahead
1001 /** A DFA state that is actually the loopback decision of a closure
1035 /** A DFA state where a SWITCH may be generated. The code generator
1080 /** The code to initiate execution of a cyclic DFA; this is used
1081 * in the rule to predict an alt just like the fixed DFA case.
1088 /* Dump DFA tables as run-length-encoded Strings of octal values.
1093 * encode/decode approach. See analysis and runtime DFA for
[all …]
|