| /external/fec/ |
| viterbi27_mmx.c | 25 decision_t *decisions; /* Beginning of decisions for block */ member in struct:v27
40 vp->dp = vp->decisions;
75 if((vp->decisions = (decision_t *)malloc((len+6)*sizeof(decision_t))) == NULL){
95 d = (decision_t *)vp->decisions;
112 free(vp->decisions);
|
| viterbi27_sse.c | 23 decision_t *decisions; /* Beginning of decisions for block */ member in struct:v27
37 if((vp->decisions = malloc((len+6)*sizeof(decision_t))) == NULL){
67 vp->dp = vp->decisions;
84 d = vp->decisions;
110 free(vp->decisions);
|
| viterbi27_sse2.c | 23 decision_t *decisions; /* Beginning of decisions for block */ member in struct:v27
38 vp->dp = vp->decisions;
72 vp->decisions = (decision_t *)p;
89 d = vp->decisions;
115 free(vp->decisions);
164 /* Pack each set of decisions into 16 bits */
|
| viterbi29_mmx.c | 26 decision_t *decisions; /* Beginning of decisions for block */ member in struct:v29
41 if((vp->decisions = (decision_t *)malloc((len+8)*sizeof(decision_t))) == NULL){
80 vp->dp = vp->decisions;
98 d = (decision_t *)vp->decisions;
115 free(vp->decisions);
|
| viterbi29_sse.c | 25 decision_t *decisions; /* Beginning of decisions for block */ member in struct:v29
39 if((vp->decisions = (decision_t *)malloc((len+8)*sizeof(decision_t))) == NULL){
69 vp->dp = vp->decisions;
85 d = vp->decisions;
111 free(vp->decisions);
|
| viterbi29_sse2.c | 25 decision_t *decisions; /* Beginning of decisions for block */ member in struct:v29
38 vp->dp = vp->decisions;
72 vp->decisions = (decision_t *)p;
89 d = vp->decisions;
116 free(vp->decisions);
|
| viterbi615_port.c | 23 decision_t *decisions; /* Beginning of decisions for block */ member in struct:v615
36 if((vp->decisions = malloc((len+14)*sizeof(decision_t))) == NULL){
67 vp->dp = vp->decisions;
83 d = (decision_t *)vp->decisions;
106 free(vp->decisions);
|
| viterbi27_port.c | 25 decision_t *decisions; /* Beginning of decisions for block */ member in struct:v27
40 vp->dp = vp->decisions;
65 if((vp->decisions = malloc((len+6)*sizeof(decision_t))) == NULL){
85 d = vp->decisions;
111 free(vp->decisions);
|
| viterbi29_port.c | 22 decision_t *decisions; /* Beginning of decisions for block */ member in struct:v29
37 vp->dp = vp->decisions;
64 if((vp->decisions = (decision_t *)malloc((len+8)*sizeof(decision_t))) == NULL){
86 d = vp->decisions;
112 free(vp->decisions);
|
| viterbi39_port.c | 22 decision_t *decisions; /* Beginning of decisions for block */ member in struct:v39
37 vp->dp = vp->decisions;
64 if((vp->decisions = (decision_t *)malloc((len+8)*sizeof(decision_t))) == NULL){
86 d = vp->decisions;
112 free(vp->decisions);
|
| viterbi27_av.c | 23 decision_t *decisions; /* Beginning of decisions for block */ member in struct:v27
37 vp->dp = vp->decisions;
62 if((vp->decisions = (decision_t *)malloc((len+6)*sizeof(decision_t))) == NULL){
77 decision_t *d = (decision_t *)vp->decisions;
107 free(vp->decisions);
163 /* Interleave and store first decisions and survivors */
175 /* Interleave and store second set of decisions and survivors */
|
| viterbi29_av.c | 23 decision_t *decisions; /* Beginning of decisions for block */ member in struct:v29
38 vp->dp = vp->decisions;
63 if((vp->decisions = (decision_t *)malloc((len+8)*sizeof(decision_t))) == NULL){
82 d = (decision_t *)vp->decisions;
108 free(vp->decisions);
154 /* Interleave and store decisions and survivors */
|
| viterbi39_av.c | 24 void *decisions; /* Beginning of decisions for block */ member in struct:v39
37 vp->dp = vp->decisions;
63 vp->decisions = malloc(sizeof(decision_t)*(len+8));
75 decision_t *d = (decision_t *)vp->decisions;
105 free(vp->decisions);
114 vector unsigned char decisions = (vector unsigned char)(0); local
157 /* Store decisions and survivors.
161 decisions = vec_add(decisions,decisions); /* Shift each byte 1 bit to the left *
[all...] |
| viterbi39_mmx.c | 23 void *decisions; /* Beginning of decisions for block */ member in struct:v39
38 vp->dp = vp->decisions;
64 if((vp->decisions = malloc((len+8)*sizeof(decision_t))) == NULL){
87 d = (decision_t *)vp->decisions;
113 free(vp->decisions);
160 * to form the decisions and then do the select the hard way
167 /* Merge decisions and store as bytes */
|
| viterbi39_sse.c | 24 void *decisions; /* Beginning of decisions for block */ member in struct:v39
39 vp->dp = vp->decisions;
56 if((vp->decisions = malloc((len+8)*sizeof(decision_t))) == NULL){
87 d = (decision_t *)vp->decisions;
113 free(vp->decisions);
162 /* Pack decisions into 8 bits and store */
|
| viterbi39_sse2.c | 24 void *decisions; /* Beginning of decisions for block */ member in struct:v39
37 vp->dp = vp->decisions;
61 vp->decisions = (decision_t *)p;
84 decision_t *d = (decision_t *)vp->decisions;
111 free(vp->decisions);
158 /* Pack each set of decisions into 8 8-bit bytes, then interleave them and compress into 16 bits */
|
| viterbi615_av.c | 24 void *decisions; /* Beginning of decisions for block */ member in struct:v615
40 vp->dp = vp->decisions;
54 vp->decisions = malloc(sizeof(decision_t)*(len+14));
78 decision_t *d = (decision_t *)vp->decisions;
105 free(vp->decisions);
114 vector unsigned char decisions = (vector unsigned char)(0); local
162 /* Store decisions and survivors.
166 decisions = vec_add(decisions,decisions); /* Shift each byte 1 bit to the left *
[all...] |
| viterbi615_mmx.c | 23 void *decisions; /* Beginning of decisions for block */ member in struct:v615
38 vp->dp = vp->decisions;
54 if((vp->decisions = malloc((len+14)*sizeof(decision_t))) == NULL){
85 d = (decision_t *)vp->decisions;
109 free(vp->decisions);
160 * to form the decisions and then do the select the hard way
167 /* Merge decisions and store as bytes */
|
| viterbi615_sse.c | 24 void *decisions; /* Beginning of decisions for block */ member in struct:v615
39 vp->dp = vp->decisions;
56 if((vp->decisions = malloc((len+14)*sizeof(decision_t))) == NULL){
86 d = (decision_t *)vp->decisions;
110 free(vp->decisions);
163 /* Pack decisions into 8 bits and store */
|
| viterbi615_sse2.c | 24 void *decisions; /* Beginning of decisions for block */ member in struct:v615
39 vp->dp = vp->decisions;
63 vp->decisions = (decision_t *)p;
86 decision_t *d = (decision_t *)vp->decisions;
110 free(vp->decisions);
161 /* Pack each set of decisions into 8 8-bit bytes, then interleave them and compress into 16 bits */
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/debug/ |
| Profiler.java | 136 //protected Vector decisions = new Vector(200); // need setSize
137 protected DoubleKeyMap<String,Integer, DecisionDescriptor> decisions = field in class:Profiler
223 DecisionDescriptor descriptor = decisions.get(g, decisionNumber);
226 decisions.put(g, decisionNumber, descriptor);
280 * works for backtracking also, which can have nested decisions.
323 /** Track backtracking decisions. You'll see a fixed or cyclic decision
401 for (DecisionDescriptor d : decisions.values()) {
522 return decisions;
558 buf.append("num decisions that potentially backtrack ");
561 buf.append("num decisions that do backtrack ")
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/ |
| Profiler.cs | 81 //protected Vector decisions = new Vector(200); // need setSize
82 protected DoubleKeyMap<string, int, DecisionDescriptor> decisions = new DoubleKeyMap<string, int, DecisionDescriptor>(); field in class:Antlr.Runtime.Debug.Profiler
167 DecisionDescriptor descriptor = decisions.Get(g, decisionNumber);
170 decisions.Put(g, decisionNumber, descriptor);
231 * works for backtracking also, which can have nested decisions.
280 /** Track backtracking decisions. You'll see a fixed or cyclic decision
360 foreach (DecisionDescriptor d in decisions.Values()) {
483 return decisions;
515 // buf.Append("number of fixed lookahead decisions ");
524 // buf.Append("average lookahead depth used in fixed lookahead decisions ");
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/ |
| Profiler.cs | 81 //protected Vector decisions = new Vector(200); // need setSize
82 protected DoubleKeyMap<string, int, DecisionDescriptor> decisions = new DoubleKeyMap<string, int, DecisionDescriptor>(); field in class:Antlr.Runtime.Debug.Profiler
179 DecisionDescriptor descriptor = decisions.Get(g, decisionNumber);
183 decisions.Put(g, decisionNumber, descriptor);
250 * works for backtracking also, which can have nested decisions.
306 /** Track backtracking decisions. You'll see a fixed or cyclic decision
400 foreach (DecisionDescriptor d in decisions.Values())
531 return decisions;
566 // buf.Append("number of fixed lookahead decisions ");
575 // buf.Append("average lookahead depth used in fixed lookahead decisions ");
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| GrammarReport.java | 283 buf.append("Number of decisions that backtrack: ");
291 Set decisions = new HashSet(); local
297 if ( decisions.contains(Utils.integer(dfa.decisionNumber)) ) {
300 decisions.add(Utils.integer(dfa.decisionNumber));
381 buf.append("Decisions: ");
384 buf.append("Decisions (ignoring decisions in synpreds): ");
387 buf.append("Fixed k DFA decisions: ");
390 buf.append("Cyclic DFA decisions: ");
393 buf.append("LL(1) decisions: "); buf.append(data.numLL1)
[all...] |
| /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-swf-libraries/1.11.18/ |
| aws-java-sdk-swf-libraries-1.11.18.jar | |
