/external/srec/srec/clib/ |
H A D | imeld_tr.c | 45 int ii, jj; local 52 for (ii = 0; ii < dim; ii++) 54 vec[ii] = 0; 56 vec[ii] += prep->matrix[ii][jj] * fram[jj]; 58 vec[ii] = (imeldata) SHIFT_DOWN((int)vec[ii], 65 for (ii 84 int ii, jj; local [all...] |
H A D | cnorm_tr.c | 64 int ii; local 70 for (ii = 0; ii < dimen; ii++) 71 outframe[ii] = MAKEBYTE(frame[ii] + channorm->imelda_adjust[ii]); 78 int ii, adjust; local 83 for (ii = 0; ii < dime 127 int ii; local 153 int ii; local 168 int ii; local 180 int ii; local [all...] |
H A D | matx_ops.c | 40 int ii; local 45 for (ii = 0; ii < dimen; ii++) 46 matrix[ii] = (covdata *) CALLOC(dimen, sizeof(covdata), 53 int ii; local 56 for (ii = 0; ii < dimen; ii++) 57 FREE((char *)matrix[ii]); 64 int ii; local 76 int ii, jj, shift; local 126 int ii; local 139 int ii; local [all...] |
H A D | matrix_i.c | 47 int ii, jj, *index, err_code; local 58 for (ii = 0; ii < dim; ii++) 60 input[ii] = (double *) CALLOC(dim, sizeof(double), "clib.input_imatrix[]"); 62 input[ii][jj] = mat[ii][jj]; 68 for (ii = 0; ii < dim; ii 104 int ii, imax = 0, jj, kk; local 178 int ii, ix = -1, ip, jj; local [all...] |
H A D | matx_ops.h | 28 int ii, jj; local 35 for (ii = 0; ii < dimr; ii++) 39 sum += matrix[ii][jj] * vector[jj]; 40 outvec[ii] = sum;
|
H A D | log_add.c | 48 int ii; local 65 for (ii = 0; ii <= logtab->add_log_limit; ii++) { 66 table[ii] = (prdata)(logtab->scale * mul_scale * log(1 67 + exp(-(float)ii / ((float)logtab->scale * mul_scale))) 69 PRINT_SOME_CODE(" %d,", table[ii]); 78 for (ii = 0; ii <= logtab->add_log_limit; ii [all...] |
H A D | specnorm.c | 94 int ii, jj, count, cumval; local 104 for (ii = 0; ii <= (spec->high_entry - spec->low_entry); ii++) 105 count += spec->hist[ii]; 109 for (ii = 0; ii <= (spec->high_entry - spec->low_entry) 110 && cumval < count; ii++) 111 cumval += spec->hist[ii]; 114 for (jj = ii; j 128 int ii, jj, count, span, totcount; local 267 int ii; local 280 int ii; local 298 int ii, remember; local 312 int ii; local [all...] |
/external/bzip2/ |
H A D | spewG.c | 40 int ii, kk, p; local 45 for (ii = 0; ii < p; ii++) 47 for (ii = 0; ii < p-1; ii++) 49 for (ii = 0; ii < p+1; ii [all...] |
/external/srec/tools/grxmlcompile/ |
H A D | sub_base.cpp | 64 for (int ii= 0; ii < numArc; ii++) 65 new_arc[ii]= arc[ii]; 126 for (int ii= startLoc; ii < endLoc; ii++) { 129 for (int ii= 0; ii < numAr 219 int ii; local 247 int ii, currId, incId, outId; local 272 int ii, currId, outId, inpId; local 293 int ii, fromId, toId; local [all...] |
H A D | sub_supp.cpp | 53 int ii, jj, hired, retd; local 65 for (ii= 0; ii < sortNum && ii < numArc; ii++) 66 sortList[ii]= forwardList[ii]; 67 for (ii= begIx; ii < endIx; ii 133 int ii, jj, hired, retd; local 377 int ii, id, count; local 467 int ii, jj, hired, retd; local [all...] |
H A D | sub_phon.cpp | 33 int ii, wordId, phoneId, currId, newId, nextId, arcCount; local 53 for (ii= 0; ii < arcCount; ii++) { 54 wordId= arc[ii]->GetInput(); 60 arcOne= CreateArc (NONE_LABEL, NONE_LABEL, arc[ii]->GetFromId(), newId); 66 // (void) CreateArc (-wordId, NONE_LABEL, arc[ii]->GetFromId(), newId); 67 arcOne= CreateArc (WB_LABEL, NONE_LABEL, nextId, arc[ii]->GetToId()); 69 // (void) CreateArc (WB_LABEL, wordId, newId, arc[ii]->GetToId()); 76 currId= arc[ii] 112 int ii, rix, currId, leftC; local 135 int ii, rix, currId, rightC; local 158 int ii, currId, newId, arcCount, left, right, centre; local 210 int ii, fix, bix, firstId, newId, modelCount, followCount, currId, count; local 327 int ii; local 358 int ii, currId, rix; local 418 int ii, newId, count; local 440 int ii, rix, newId, intId, count; local [all...] |
H A D | vocab.cpp | 65 for (unsigned int ii=0;ii<m_ModelIDs.size();ii++ ) 67 m_ModelIDs[ii].clear(); 143 for (int ii=0; ii< getPronCount(); ii++) { 144 getPron(ii, s); 146 std::cout << "Pron #" << ii << ": " << s << std::endl; 154 for (int ii [all...] |
H A D | gr_iface.cpp | 38 for (int ii= 0; ii < numSubGraph; ii++) { 39 newSubGraph[ii]= subGraph[ii]; 40 newIndex[ii]= subIndex[ii]; 70 for (int ii= numSubGraph-1; ii >= 0; ii [all...] |
H A D | sub_grph.h | 72 for (int ii= 0; ii < (3*num); ii++) 73 newPack[ii]= dataPack[ii]; 87 for (int ii= 0; ii < num; ii++) 88 if (dataPack[3*ii] == first && dataPack[3*ii 296 int ii; local [all...] |
/external/proguard/examples/dictionaries/ |
H A D | shakespeare.txt | 17 --From Hamlet (II, ii, 206) 23 --From Romeo and Juliet (II, ii, 1-2)
|
/external/srec/portable/src/ |
H A D | pmemfixed.c | 295 int ii; local 298 for (ii = 0; ii < NUM_OF_POOLS; ii++) 300 usedHeapSize += (memBlockSize[ii] + MEM_BLOCK_HDR) * memBlockNum[ii]; 335 for (ii = 0; ii < NUM_OF_POOLS; ii++) 337 pMemPools[ii] 374 int ii; local 419 int ii; local 648 unsigned int ii; local [all...] |
/external/srec/srec/cfront/ |
H A D | wav_acc.c | 80 int ii; local 92 for (ii = 0; ii < MAXHISTBITS; ii++) 93 ws->bithist[ii] = 0; 109 int ii; local 145 for (ii = 0; ii < MAXHISTBITS; ii++) 147 num += ws->bithist[ii]; 176 int ii; local [all...] |
H A D | log_tabl.c | 47 int ii; local 54 for (ii = 0; ii < num_bits; ii++) /* one less than the table size in 70 for (ii = 1; ii <= logtab->size; ii++) 72 val = LOG_SCALE * log((double) ii); 73 table[ii] = (int)(val + 0.5); 75 log_report("log table: %d %d\n", ii, tabl 122 int ii, aa, bb, cc, value, shift; local [all...] |
H A D | chelmel4.c | 130 int ii; local 133 for (ii = 0; ii < channel->num_freq; ii++) 135 channel->filterbank[ii] = (cepdata) log_lookup(&cepobj->logtab, 136 (int)(channel->filterbank[ii] + 137 SHIFT_DOWN(cepobj->mel_offset[ii], channel->shift)), 141 for (ii = 0; ii < channel->num_freq; ii [all...] |
/external/srec/srec/ca/ |
H A D | utt_proc.c | 40 int ii, frames = 0; local 48 for (ii = 0; ii < hUtt->data.gen_utt.num_chan; ii++) 50 evaluate_parameters(hUtt->data.gen_utt.backchan[ii]); 51 /* log_report ("%d ", hUtt->data.gen_utt.backchan[ii]->mean); */
|
H A D | catrans.c | 136 int ii, jj; local 148 for (ii = 0; ii <= hTransform->dim; ii++) 152 hTransform->mllr_acc.between[ii][jj] = 0; 153 hTransform->mllr_acc.within[ii][jj] = 0; 157 for (ii = 0; ii < hTransform->dim; ii++) 159 hTransform->imelda_acc.wmean[ii] 178 int ii, jj; local 253 int ii, jj; local [all...] |
/external/valgrind/main/coregrind/ |
H A D | fixup_macho_loadcmds.c | 191 static void unmap_image ( /*MOD*/ImageInfo* ii ) 194 assert(ii->img); 195 assert(ii->img_szB > 0); 196 r = munmap( ii->img, ii->img_szB ); 200 memset(ii, 0, sizeof(*ii)); 206 thin parts into *ii. Returns 32 (and leaves the file unmapped) if 210 static Int map_image_aboard ( /*OUT*/ImageInfo* ii, HChar* filename ) argument 212 memset(ii, 352 ImageInfo ii; local [all...] |
/external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/ |
H A D | DigestInputStreamTest.java | 121 for (int ii=0; ii<algorithmName.length; ii++) { 123 MessageDigest md = MessageDigest.getInstance(algorithmName[ii]); 134 MDGoldenData.getDigest(algorithmName[ii]))); 154 for (int ii=0; ii<algorithmName.length; ii++) { 156 MessageDigest md = MessageDigest.getInstance(algorithmName[ii]); 169 MDGoldenData.getDigest(algorithmName[ii]))); [all...] |
/external/srec/srec/crec/ |
H A D | get_fram.c | 220 int ii; local 242 for (ii = 0; ii < utt->gen_utt.dim; ii++) 243 prep->seq[ii] = (imeldata)frame_ptr[ii]; 299 int ii; local 304 for (ii = 0; ii < prep->whole_dim; ii 341 int ii; local 376 int ii; local 417 int ii; local 426 int ii; local 440 int ii; local [all...] |
/external/apache-http/src/org/apache/commons/codec/binary/ |
H A D | BinaryCodec.java | 176 for (int ii = 0, jj = ascii.length - 1; ii < l_raw.length; ii++, jj -= 8) { 179 l_raw[ii] |= BITS[bits]; 203 for (int ii = 0, jj = ascii.length - 1; ii < l_raw.length; ii++, jj -= 8) { 206 l_raw[ii] |= BITS[bits]; 232 for (int ii = 0, jj = l_ascii.length - 1; ii < ra [all...] |