| /external/libcxx/www/ |
| atomic_design.html | 62 The decision to implement lock-free operations on any given type (or not) is an
63 ABI-binding decision. One can not change from treating a type as not lock free,
|
| /external/selinux/libselinux/man/man3/ |
| security_compute_av.3 | 58 access vector. The decision is returned in
70 which indicates the decision is computed on a permissive domain.
|
| /external/wpa_supplicant_8/src/eap_peer/ |
| eap_vendor_test.c | 129 ret->decision = DECISION_FAIL;
134 ret->decision = DECISION_UNCOND_SUCC;
|
| eap_otp.c | 63 ret->decision = DECISION_COND_SUCC;
|
| eap_psk.c | 111 ret->decision = DECISION_FAIL;
212 ret->decision = DECISION_FAIL;
244 ret->decision = DECISION_FAIL;
252 ret->decision = DECISION_FAIL;
279 ret->decision = DECISION_FAIL;
363 ret->decision = failed ? DECISION_FAIL : DECISION_UNCOND_SUCC;
388 ret->decision = DECISION_FAIL;
|
| 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...] |
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
| FailedPredicateException.as | 33 * a prediction decision.
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
| FailedPredicateException.java | 33 * a prediction decision.
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLREarlyExitException.m | 48 [desc appendFormat:@" decision:%d", decisionNumber];
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| LeftRecursionCyclesMessage.java | 36 * invoked when a decision DFA construction finds a problem in closure.
|
| Interpreter.java | 116 * it is using an NFA because it uses DFAs at each decision point to
140 // Create the DFA predictors for each decision
178 // Create the DFA predictors for each decision
233 // CASE 1: decision state
235 // decision point, must predict and jump to alt
239 System.out.println("decision: "+
|
| /external/javassist/ |
| NOTICE | 22 decision by deleting the provisions above and replace them with the notice
|
| /external/kernel-headers/original/uapi/linux/ |
| atmsvc.h | 47 * tries to do better than that, but only if there's no routing decision (i.e.
|
| /external/libchrome/base/third_party/nspr/ |
| LICENSE | 30 * decision by deleting the provisions above and replace them with the notice
|
| /external/libchrome/crypto/third_party/nss/ |
| LICENSE | 30 * decision by deleting the provisions above and replace them with the notice
|
| /external/webrtc/webrtc/modules/audio_coding/codecs/ilbc/ |
| constants.h | 30 /* Window for start state decision */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/linux/ |
| atmsvc.h | 47 * tries to do better than that, but only if there's no routing decision (i.e.
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/linux/ |
| atmsvc.h | 47 * tries to do better than that, but only if there's no routing decision (i.e.
|
| /system/core/debuggerd/ |
| utility.h | 63 // List of types of logs to simplify the logging decision in _LOG
|
| /external/webrtc/webrtc/modules/audio_coding/neteq/ |
| decision_logic.h | 30 // This is the base class for the decision tree implementations. Derived classes
91 // Reports back to DecisionLogic whether the decision to do expand remains or
92 // not. Note that this is necessary, since an expand decision can be changed
|
| /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/libopus/silk/ |
| NSQ_del_dec.c | 63 NSQ_del_dec_struct psDelDec[], /* I/O Delayed decision states */
74 const opus_int decisionDelay /* I Decision delay */
82 NSQ_del_dec_struct psDelDec[], /* I/O Delayed decision states */
104 opus_int nStatesDelayedDecision, /* I Number of states in decision tree */
147 /* Initialize delayed decision states */
166 /* For voiced frames limit the decision delay to lower than the pitch lag */
308 NSQ_del_dec_struct psDelDec[], /* I/O Delayed decision states */
330 opus_int nStatesDelayedDecision, /* I Number of states in decision tree */
385 /* Delayed decision state */
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Ruby/ |
| Ruby.stg | 281 # implement a syntactic predicate decision
345 <@decision><decision><@end>
358 while true # decision <decisionNumber>
360 <@decisionBody><decision><@end>
364 break # out of loop for decision <decisionNumber>
366 end # loop for decision <decisionNumber>
397 <@decisionBody><decision><@end>
573 block(alts,decls,decision,enclosingBlockLevel,blockLevel,decisionNumber,maxK,maxAlt,description) ::= <<
581 ruleBlock(alts,decls,decision,enclosingBlockLevel,blockLevel,decisionNumber,maxK,maxAlt,description) ::= <
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| DecisionProbe.java | 40 /** Collection of information about what is wrong with a decision as
50 * A decision normally only has one problem; e.g., some input sequence
56 * have multiple problems. So in general, you should approach a decision
59 * all DFAStates where ANTLR has discovered a problem. Recall that a decision
116 /** The overall list of alts within the decision that have at least one
121 /** If decision with > 1 alt has recursion in > 1 alt, it's (likely) nonregular
122 * lookahead. The decision cannot be made with a DFA.
143 /** Did ANTLR have to terminate early on the analysis of this decision? */
175 * decision.
190 * no nondeterminisms unresolved by syn preds, all is ok with decision
[all...] |
| /external/libvorbis/doc/ |
| 03-codebook.tex | 198 \paragraph{Huffman decision tree representation}
201 \varname{[codebook_entries]} value uniquely define the Huffman decision
244 decision tree with the entry numbers equivalent to the leaves numbered
275 process. They have no codeword and do not appear in the decision
394 and using the bit as a decision boolean to take the 0 branch (left in
397 decision tree; the result is the entry number corresponding to that
|
