| /external/srec/srec/clib/ |
| matrix_i.c | 47 int ii, jj, *index, err_code; local
61 for (jj = 0; jj < dim; jj++)
62 input[ii][jj] = mat[ii][jj];
66 for (jj = 0; jj < dim; jj++)
70 col[jj] = 1
104 int ii, imax = 0, jj, kk; local
178 int ii, ix = -1, ip, jj; local
[all...] |
| matx_ops.h | 28 int ii, jj; local
38 for (jj = 0; jj < dimc; jj++)
39 sum += matrix[ii][jj] * vector[jj];
|
| imeld_tr.c | 45 int ii, jj; local
55 for (jj = 0; jj < prep->dim; jj++)
56 vec[ii] += prep->matrix[ii][jj] * fram[jj];
84 int ii, jj; local
97 for (jj= 0; jj < prep->dim; jj++
[all...] |
| matx_ops.c | 76 int ii, jj, shift; local
88 for (jj = 0; jj < dimen; jj++)
89 sum_coef += fabs(matrix[ii][jj]);
110 for (jj = 0; jj < dimen; jj++)
112 xfp = ((double)scale_coef) * matrix[ii][jj];
119 fixmat[ii][jj] = (imeldata) xfp
[all...] |
| imeld_rd.c | 95 int ii, jj; local
150 for (jj = 0; jj < matdim; jj++)
151 prep->imelda[ii][jj] = (covdata)(scale * onerow[jj]);
176 for (jj = 0; jj < matdim; jj++)
177 prep->inverse[ii][jj] = (covdata)(onerow[jj] / scale)
[all...] |
| specnorm.c | 94 int ii, jj, count, cumval; local
114 for (jj = ii; jj <= (spec->high_entry - spec->low_entry); jj++)
116 count += spec->hist[jj];
117 accum += spec->hist[jj] * (jj - ii);
128 int ii, jj, count, span, totcount; local
138 for (ii = 0, jj = spec->high_entry - spec->low_entry;
139 ii <= span; ii++, jj--
[all...] |
| /external/srec/tools/grxmlcompile/ |
| sub_supp.cpp | 53 int ii, jj, hired, retd; local
77 jj= hired << 1;
78 while (jj <= numArc) {
79 if (jj < numArc && ARC_COMPARE (sortList[jj], sortList[jj+1]) <= 0 )
80 jj++;
81 if (ARC_COMPARE (holdArc, sortList[jj]) < 0) {
82 sortList[ii]= sortList[jj];
83 ii= jj;
133 int ii, jj, hired, retd; local
467 int ii, jj, hired, retd; local
[all...] |
| sub_phon.cpp | 75 for (int jj= 0; jj < pronCount; jj++) {
77 int modelCount = pron.getPhonemeCount(jj);
80 pron.getPhoneme(jj, kk, modelLabel);
180 for (int jj= 0; jj < modelCount; jj++) {
181 if (jj == (modelCount - 1))
185 arcOne= CreateArc (modelSequence[jj], NONE_LABEL, currId, newId)
[all...] |
| vocab.cpp | 160 for (int jj=0;jj<getModelCount(ii);jj++) {
161 std::cout << " " << getModelID(ii,jj);
240 for ( int jj=0;jj<numPhonemes;jj++ )
243 getPIC(ii, jj, pic);
|
| /external/srec/srec/ca/ |
| catrans.c | 136 int ii, jj; local
150 for (jj = 0; jj <= hTransform->dim; jj++)
152 hTransform->mllr_acc.between[ii][jj] = 0;
153 hTransform->mllr_acc.within[ii][jj] = 0;
161 for (jj = 0; jj < hTransform->dim; jj++)
163 hTransform->imelda_acc.between[ii][jj] = 0
178 int ii, jj; local
253 int ii, jj; local
[all...] |
| /external/apache-http/src/org/apache/commons/codec/binary/ |
| BinaryCodec.java | 173 * We decr index jj by 8 as we go along to not recompute indices using multiplication every time inside the
176 for (int ii = 0, jj = ascii.length - 1; ii < l_raw.length; ii++, jj -= 8) {
178 if (ascii[jj - bits] == '1') {
200 * We decr index jj by 8 as we go along to not recompute indices using multiplication every time inside the
203 for (int ii = 0, jj = ascii.length - 1; ii < l_raw.length; ii++, jj -= 8) {
205 if (ascii[jj - bits] == '1') {
229 * We decr index jj by 8 as we go along to not recompute indices using multiplication every time inside the
232 for (int ii = 0, jj = l_ascii.length - 1; ii < raw.length; ii++, jj -= 8)
[all...] |
| /dalvik/tests/004-annotations/src/android/test/anno/ |
| AnnoArrayField.java | 16 long[] jj() default {};
|
| /sdk/emulator/qtools/ |
| dump_regions.cpp | 50 for (int jj = 1; jj < pstate->argc; ++jj) {
51 printf(" %s", pstate->argv[jj]);
|
| profile_pid.cpp | 87 for (int jj = 1; jj < pstate->argc; ++jj) {
88 printf(" %s", pstate->argv[jj]);
|
| read_trace.cpp | 99 for (int jj = 0; jj < 10 && jj < nsymbols; ++jj) {
101 manager->regions[ii]->symbols[jj].addr,
102 manager->regions[ii]->symbols[jj].name);
|
| bbprof.cpp | 145 for (int jj = 0; jj < num_insns; ++jj) {
146 uint32_t elapsed = sorted[ii]->cycles[jj];
147 uint32_t insn = sorted[ii]->insns[jj];
158 if (thumb_pair && (jj + 1 < num_insns)) {
159 insn2 = sorted[ii]->insns[jj + 1];
161 jj += 1;
|
| /frameworks/base/media/libeffects/lvm/lib/Common/src/ |
| LVC_Core_MixInSoft_D16C31_SAT.c | 38 LVM_INT32 ii,jj; local
76 for (jj = 4; jj!=0 ; jj--){
113 for (jj = 4; jj!=0 ; jj--){
|
| Core_MixInSoft_D32C31_SAT.c | 39 LVM_INT16 ii,jj; local
76 for (jj = 4; jj!=0 ; jj--){
|
| /sdk/emulator/qtools/tests/gtrace/ |
| test.c | 143 int ii, jj; local
146 for (jj = 0; jj < 10; ++jj)
147 a += mem[jj * kStride];
|
| /bootable/recovery/applypatch/ |
| bsdiff.c | 62 off_t i,j,k,x,tmp,jj,kk; local
84 jj=0;kk=0;
86 if(V[I[i]+h]<x) jj++;
89 jj+=start;kk+=jj;
92 while(i<jj) {
96 tmp=I[i];I[i]=I[jj+j];I[jj+j]=tmp;
104 while(jj+j<kk) {
105 if(V[I[jj+j]+h]==x)
[all...] |
| /external/bsdiff/ |
| bsdiff.c | 45 off_t i,j,k,x,tmp,jj,kk; local
67 jj=0;kk=0;
69 if(V[I[i]+h]<x) jj++;
72 jj+=start;kk+=jj;
75 while(i<jj) {
79 tmp=I[i];I[i]=I[jj+j];I[jj+j]=tmp;
87 while(jj+j<kk) {
88 if(V[I[jj+j]+h]==x)
[all...] |
| /libcore/luni/src/test/java/org/apache/harmony/luni/tests/java/util/ |
| LinkedHashMapTest.java | 566 Integer jj = (Integer) m.getKey(); local
567 assertTrue("Returned incorrect entry set 1", jj.intValue() == i);
582 Integer jj = (Integer) m.getKey(); local
583 assertTrue("Returned incorrect entry set 2", jj.intValue() == i);
600 Integer jj = (Integer) m.getKey(); local
601 assertTrue("Returned incorrect entry set 3", jj.intValue() == i);
605 Integer jj = (Integer) m.getKey(); local
606 assertTrue("Returned incorrect entry set 4", jj.intValue() == i);
633 Integer jj = (Integer) it1.next(); local
634 assertTrue("Returned incorrect entry set", jj.intValue() == i)
647 Integer jj = (Integer) it3.next(); local
663 Integer jj = (Integer) it2.next(); local
667 Integer jj = (Integer) it2.next(); local
695 Integer jj = (Integer) it1.next(); local
709 Integer jj = (Integer) it3.next(); local
725 Integer jj = (Integer) it2.next(); local
729 Integer jj = (Integer) it2.next(); local
757 Integer jj = (Integer) it1.next(); local
[all...] |
| /libcore/luni/src/test/java/tests/api/java/util/ |
| LinkedHashMapTest.java | 679 Integer jj = (Integer) m.getKey(); local
680 assertTrue("Returned incorrect entry set 1", jj.intValue() == i);
695 Integer jj = (Integer) m.getKey(); local
696 assertTrue("Returned incorrect entry set 2", jj.intValue() == i);
713 Integer jj = (Integer) m.getKey(); local
714 assertTrue("Returned incorrect entry set 3", jj.intValue() == i);
718 Integer jj = (Integer) m.getKey(); local
719 assertTrue("Returned incorrect entry set 4", jj.intValue() == i);
746 Integer jj = (Integer) it1.next(); local
747 assertTrue("Returned incorrect entry set", jj.intValue() == i)
760 Integer jj = (Integer) it3.next(); local
776 Integer jj = (Integer) it2.next(); local
780 Integer jj = (Integer) it2.next(); local
808 Integer jj = (Integer) it1.next(); local
822 Integer jj = (Integer) it3.next(); local
838 Integer jj = (Integer) it2.next(); local
842 Integer jj = (Integer) it2.next(); local
870 Integer jj = (Integer) it1.next(); local
[all...] |
| /external/openssl/crypto/evp/ |
| bio_b64.c | 305 int z,jj; local
308 jj=(i>>2)<<2;
310 jj = i & ~3; /* process per 4 */
313 (unsigned char *)ctx->tmp,jj);
314 if (jj > 2)
316 if (ctx->tmp[jj-1] == '=')
319 if (ctx->tmp[jj-2] == '=')
323 /* z is now number of output bytes and jj is the
325 if (jj != i)
327 memmove(ctx->tmp, &ctx->tmp[jj], i-jj)
[all...] |
| /external/srec/srec/cfront/ |
| spec_anl.c | 324 int ii, jj, freq_step; local
341 for (jj = lo; jj <= hi;jj++)
345 freqobj->spectrum_filter[freqobj->spectrum_filter_num++] = jj;
347 /* jj=0;
348 while (((jj+1)*freq_step)>>12 <= freq[ii]-spread[ii])
349 jj++;
350 while (((jj-1)*freq_step>>12) < freq[ii]+spread[ii]){
353 freqobj->spectrum_filter[freqobj->spectrum_filter_num++]= jj;
375 int ii, jj, temp; local
[all...] |
