HomeSort by relevance Sort by last modified time
    Searched refs:decision (Results 1 - 25 of 162) sorted by null

1 2 3 4 5 6 7

  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
NFAConversionThread.java 50 for (int decision=i; decision<=j; decision++) {
51 NFAState decisionStartState = grammar.getDecisionNFAStartState(decision);
53 grammar.createLookaheadDFA(decision,true);
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
GrammarReport2.java 58 for (int decision=1; decision<=numDec; decision++) {
59 Grammar.Decision d = g.getDecision(decision);
61 //System.err.println("no decision "+decision+" dfa for "+d.blockAST.toStringTree());
74 buf.append(" decision "+decision+":");
Grammar.java 154 public static class Decision {
156 public int decision; field in class:Grammar.Decision
302 * a global list of rules, token types, decision numbers, etc...
319 * decision DFA so it can display DFA.
335 /** Be able to assign a number to every decision in grammar;
376 /** At least one backtrack=true in rule or decision or grammar. */
415 /** Each subrule/rule is a decision point and we must track them so we
419 protected Vector<Decision> indexToDecision =
420 new Vector<Decision>(INITIAL_DECISION_LIST_SIZE);
    [all...]
  /external/llvm/utils/TableGen/
X86DisassemblerTables.h 57 /// ModR/M decision. Compacts the ModR/M decision if possible. ModR/M
81 /// @param o2 - The output stream to print the decision structure to.
85 /// @param decision - The ModR/M decision to emit. This decision has 256
89 ModRMDecision &decision) const;
109 /// @param o2 - The output stream for the decision structure itself.
113 /// @param decision - The OpcodeDecision to emit along with its subsidiary
117 OpcodeDecision &decision) const
    [all...]
X86DisassemblerTables.cpp 381 /// getDecisionType - Determines whether a ModRM decision with 255 entries can
384 /// @param decision - The decision to be compacted.
385 /// @return - The compactest available representation for the decision.
386 static ModRMDecisionType getDecisionType(ModRMDecision &decision) {
393 if (decision.instructionIDs[index] != decision.instructionIDs[0])
397 (decision.instructionIDs[index] != decision.instructionIDs[0xc0]))
401 (decision.instructionIDs[index] != decision.instructionIDs[0x00])
    [all...]
  /external/swiftshader/third_party/LLVM/utils/TableGen/
X86DisassemblerTables.h 69 /// ModR/M decision. Compacts the ModR/M decision if possible. ModR/M
93 /// @param o2 - The output stream to print the decision structure to.
96 /// @param decision - The ModR/M decision to emit. This decision has 256
102 ModRMDecision &decision) const;
122 /// @param o2 - The output stream for the decision structure itself.
125 /// @param decision - The OpcodeDecision to emit along with its subsidiary
131 OpcodeDecision &decision) const
    [all...]
X86DisassemblerTables.cpp 201 /// getDecisionType - Determines whether a ModRM decision with 255 entries can
204 /// @param decision - The decision to be compacted.
205 /// @return - The compactest available representation for the decision.
206 static ModRMDecisionType getDecisionType(ModRMDecision &decision)
214 if (decision.instructionIDs[index] != decision.instructionIDs[0])
218 (decision.instructionIDs[index] != decision.instructionIDs[0xc0]))
222 (decision.instructionIDs[index] != decision.instructionIDs[0x00])
    [all...]
  /external/fec/
viterbi27_port.c 23 decision_t *dp; /* Pointer to current decision */
118 unsigned int metric,m0,m1,decision;\
122 decision = (signed int)(m0-m1) > 0;\
123 vp->new_metrics->w[2*i] = decision ? m1 : m0;\
124 d->w[i/16] |= decision << ((2*i)&31);\
127 decision = (signed int)(m0-m1) > 0;\
128 vp->new_metrics->w[2*i+1] = decision ? m1 : m0;\
129 d->w[i/16] |= decision << ((2*i+1)&31);\
viterbi29_port.c 20 decision_t *dp; /* Pointer to current decision */
119 unsigned int metric,m0,m1,decision;\
123 decision = (signed int)(m0-m1) > 0;\
124 vp->new_metrics->w[2*i] = decision ? m1 : m0;\
125 d->w[i/16] |= decision << ((2*i)&31);\
128 decision = (signed int)(m0-m1) > 0;\
129 vp->new_metrics->w[2*i+1] = decision ? m1 : m0;\
130 d->w[i/16] |= decision << ((2*i+1)&31);\
viterbi39_port.c 20 decision_t *dp; /* Pointer to current decision */
119 unsigned int metric,m0,m1,decision;\
124 decision = (signed int)(m0-m1) > 0;\
125 vp->new_metrics->w[2*i] = decision ? m1 : m0;\
126 d->w[i/16] |= decision << ((2*i)&31);\
129 decision = (signed int)(m0-m1) > 0;\
130 vp->new_metrics->w[2*i+1] = decision ? m1 : m0;\
131 d->w[i/16] |= decision << ((2*i+1)&31);\
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/
Profiler.cs 84 // Record a DecisionData for each decision we hit while parsing
171 descriptor.decision = decisionNumber;
182 d.decision = descriptor;
195 d.decision.maxk = Math.Max(d.decision.maxk, depth);
198 Console.WriteLine("exitDecision " + decisionNumber + " in " + d.decision.ruleName +
202 decisionEvents.Add(d); // done with decision; track all
226 d.decision.ruleName + "-" + d.decision.decision + " start index " + d.startIndex)
706 public int decision; field in class:Antlr.Runtime.Debug.Profiler.DecisionDescriptor
722 public DecisionDescriptor decision; field in class:Antlr.Runtime.Debug.Profiler.DecisionEvent
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/
Profiler.cs 84 // Record a DecisionData for each decision we hit while parsing
184 descriptor.decision = decisionNumber;
195 d.decision = descriptor;
209 d.decision.maxk = Math.Max(d.decision.maxk, depth);
213 Console.WriteLine("exitDecision " + decisionNumber + " in " + d.decision.ruleName +
217 decisionEvents.Add(d); // done with decision; track all
245 d.decision.ruleName + "-" + d.decision.decision + " start index " + d.startIndex)
769 public int decision; field in class:Antlr.Runtime.Debug.Profiler.DecisionDescriptor
786 public DecisionDescriptor decision; field in class:Antlr.Runtime.Debug.Profiler.DecisionEvent
    [all...]
  /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/debug/
Profiler.java 86 public int decision; field in class:Profiler.DecisionDescriptor
94 public float avgk; // avg across all decision events
100 // all about a specific exec of a single decision
102 public DecisionDescriptor decision; field in class:Profiler.DecisionEvent
140 // Record a DecisionData for each decision we hit while parsing
227 descriptor.decision = decisionNumber;
238 d.decision = descriptor;
251 d.decision.maxk = Math.max(d.decision.maxk, depth);
253 if (dump) System.out.println("exitDecision "+decisionNumber+" in "+d.decision.ruleName
    [all...]
  /external/wpa_supplicant_8/src/eap_peer/
eap_peap.c 567 ret->decision = DECISION_FAIL;
570 ret->decision = DECISION_UNCOND_SUCC;
575 ret->decision = DECISION_FAIL;
580 ret->decision = DECISION_FAIL;
621 ret->decision = DECISION_FAIL;
627 ret->decision = iret.decision;
653 ret->decision = DECISION_FAIL;
710 ret->decision = DECISION_FAIL;
719 (iret.decision == DECISION_UNCOND_SUCC |
    [all...]
eap_otp.c 63 ret->decision = DECISION_COND_SUCC;
eap_ttls.c 348 (iret.decision == DECISION_UNCOND_SUCC ||
349 iret.decision == DECISION_COND_SUCC ||
350 iret.decision == DECISION_FAIL)) {
352 ret->decision = iret.decision;
649 ret->decision = DECISION_COND_SUCC;
704 ret->decision = DECISION_COND_SUCC;
784 ret->decision = DECISION_COND_SUCC;
853 ret->decision = DECISION_FAIL;
1136 ret->decision = DECISION_FAIL
    [all...]
eap_i.h 47 * decision - Authentication decision (OUT)
49 EapDecision decision; member in struct:eap_method_ret
306 EapDecision decision; member in struct:eap_sm
eap_vendor_test.c 129 ret->decision = DECISION_FAIL;
134 ret->decision = DECISION_UNCOND_SUCC;
eap_md5.c 73 ret->decision = DECISION_COND_SUCC;
  /external/webrtc/webrtc/modules/video_processing/test/
denoiser_test.cc 125 DenoiserDecision decision = local
127 EXPECT_EQ(COPY_BLOCK, decision);
128 decision = df_sse_neon->MbDenoise(running_src, 16, dst, 16, src, 16, 0, 1);
129 EXPECT_EQ(COPY_BLOCK, decision);
  /external/v8/src/compiler/
common-operator-reducer.cc 22 Decision DecideCondition(Node* const cond) {
26 return mcond.Value() ? Decision::kTrue : Decision::kFalse;
30 return mcond.Value()->BooleanValue() ? Decision::kTrue : Decision::kFalse;
33 return Decision::kUnknown;
84 DecideCondition(cond->InputAt(1)) == Decision::kFalse &&
85 DecideCondition(cond->InputAt(2)) == Decision::kTrue)) {
107 Decision const decision = DecideCondition(cond) local
145 Decision const decision = DecideCondition(condition); local
    [all...]
  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Python/
Dbg.stg 69 False, # invalid decision
234 @blockBody.decision() ::= <<
238 <@super.decision()>
243 @ruleBlock.decision() ::= <<
247 <@super.decision()>
  /external/libvpx/libvpx/vp8/encoder/
denoising.c 490 enum vp8_denoiser_decision decision = FILTER_BLOCK; local
563 decision = COPY_BLOCK;
573 decision = COPY_BLOCK;
576 if (decision == FILTER_BLOCK) {
605 decision = COPY_BLOCK;
608 if (decision == FILTER_BLOCK) {
617 decision = vp8_denoiser_filter(mc_running_avg_y, mc_avg_y_stride,
624 decision == FILTER_BLOCK) {
646 if (decision == COPY_BLOCK) {
  /external/nist-sip/java/gov/nist/javax/sip/stack/
UDPMessageProcessor.java 214 boolean decision = Math.random() > 1.0 - threshold;
215 if ( decision ) {
  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/messages/languages/
en.stg 237 Decision can match input such as "<input>" using multiple alternatives:
240 Decision can match input such as "<input>" using multiple alternatives: <conflictingAlts; separator=", ">
246 the decision cannot distinguish between alternative(s) <danglingAlts; separator=","> for input such as "<input>"
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.
265 Alternative <alt>: after matching input such as <input> decision cannot predict what comes next due to recursion overflow <targetRules,callSiteStates:{t,c|to <t> from <c:{s|<s.enclosingRule.name>};separator=", ">}; separator=" and ">
279 Decision can match input such as "<input>" using multiple alternatives:
292 [fatal] rule <ruleName> has non-LL(*) decision due to recursive rule invocations reachable from alts <alts; separator=",">. Resolve by left-factoring or using syntactic predicates or using backtrack=true option.

Completed in 759 milliseconds

1 2 3 4 5 6 7