/external/chromium_org/third_party/webrtc/common_audio/signal_processing/ |
H A D | get_hanning_window.c | 58 int jj; local 71 for (jj = 0; jj < size; jj++)
|
/external/srec/srec/clib/ |
H A D | 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...] |
H A D | matx_ops.h | 28 int ii, jj; local 38 for (jj = 0; jj < dimc; jj++) 39 sum += matrix[ii][jj] * vector[jj];
|
H A D | 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] [all...] |
H A D | 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] [all...] |
H A D | 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] 104 int ii, imax = 0, jj, kk; local 178 int ii, ix = -1, ip, jj; local [all...] |
H A D | 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/webrtc/src/common_audio/signal_processing/ |
H A D | get_hanning_window.c | 58 int jj; local 71 for (jj = 0; jj < size; jj++)
|
/external/srec/srec/ca/ |
H A D | 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] 178 int ii, jj; local 253 int ii, jj; local [all...] |
/external/clang/test/CodeGenCXX/ |
H A D | debug-info-template-explicit-specialization.cpp | 92 j<int> jj; variable
|
/external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
H A D | LMcovar.h | 28 Index i, j, k, l, ii, jj; local 62 jj = ipvt[j]; 68 if (ii > jj) 69 r(ii,jj) = r(i,j); 70 if (ii < jj) 71 r(jj,ii) = r(i,j); 73 wa[jj] = r(j,j);
|
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
H A D | covar.h | 15 Index i, j, k, l, ii, jj; local 49 jj = ipvt[j]; 55 if (ii > jj) 56 r(ii,jj) = r(i,j); 57 if (ii < jj) 58 r(jj,ii) = r(i,j); 60 wa[jj] = r(j,j);
|
/external/llvm/test/tools/llvm-cov/Inputs/ |
H A D | test.cpp | 28 void assign(int ii, int jj) { argument 29 grid[ii][jj] = (ii+1) * (jj+1); 34 for (int jj = 0; jj < 2; jj++) 35 assign(ii, jj);
|
/external/chromium_org/gpu/command_buffer/client/ |
H A D | vertex_array_object_manager_unittest.cc | 88 for (size_t jj = 0; jj < 4u; ++jj) { 89 manager_->SetAttribEnable(jj, true); 110 for (size_t jj = 0; jj < 4; ++jj) { 113 jj, GL_VERTEX_ATTRIB_ARRAY_BUFFER_BINDING, ¶m)); 114 EXPECT_EQ(expected[ii][jj], param) 115 << "id: " << ids[ii] << ", attrib: " << jj; local [all...] |
/external/eigen/Eigen/src/SparseLU/ |
H A D | SparseLU_panel_bmod.h | 61 Index ksub,jj,nextl_col; local 88 for (jj = jcol; jj < jcol + w; jj++) 90 nextl_col = (jj-jcol) * m; 109 for (jj = jcol; jj < jcol + w; jj++) 111 nextl_col = (jj-jcol) * m; 156 for (jj [all...] |
H A D | SparseLU_panel_dfs.h | 44 bool update_segrep(Index krep, Index jj) argument 48 m_marker[krep] = jj; 62 void SparseLUImpl<Scalar,Index>::dfs_kernel(const Index jj, IndexVector& perm_r, argument 72 // For each unmarked krow of jj 73 marker(krow) = jj; 76 // krow is in L : place it in structure of L(*, jj) 115 if (chmark != jj ) 117 marker(kchild) = jj; 152 } // end if chmark !=jj 160 if(traits.update_segrep(krep,jj)) [all...] |
/external/srec/tools/grxmlcompile/ |
H A D | 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 468 int ii, jj, hired, retd; local [all...] |
/external/bsdiff/ |
H A D | 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 [all...] |
/external/bzip2/ |
H A D | decompress.c | 360 Int32 ii, jj, kk; local 363 for (jj = MTFL_SIZE-1; jj >= 0; jj--) { 364 s->mtfa[kk] = (UChar)(ii * MTFL_SIZE + jj); 425 Int32 ii, jj, kk, pp, lno, off; local 466 for (jj = MTFL_SIZE-1; jj >= 0; jj--) { 467 s->mtfa[kk] = s->mtfa[s->mtfbase[ii] + jj]; [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/ |
H A D | lp_tile_image.c | 160 uint ii = i + x, jj = j + y; local 161 uint src_offset = (jj / tile_h * tiles_per_row + ii / tile_w) 163 uint dst_offset = jj * dst_stride + ii; 180 uint ii = i + x, jj = j + y; local 181 uint src_offset = (jj / tile_h * tiles_per_row + ii / tile_w) 183 uint dst_offset = jj * dst_stride + ii; 200 uint ii = i + x, jj = j + y; local 201 uint tile_offset = ((jj / tile_h) * tiles_per_row + ii / tile_w); 208 ii, jj); 250 uint ii = i + x, jj local 270 uint ii = i + x, jj = j + y; local 289 uint ii = i + x, jj = j + y; local [all...] |
/external/chromium_org/third_party/opus/src/tests/ |
H A D | test_opus_decode.c | 287 int jj; local 288 for(jj=0;jj<j;jj++)packet[jj+1]=fast_rand()&255;
|
/external/clang/test/OpenMP/ |
H A D | for_loop_messages.cpp | 18 int ii, jj, kk; local 116 for (int i = 0; jj < kk; ii++) 158 for (ii = 0; ii < 10; ++jj) 159 c[ii] = a[jj]; 189 for (ii = 0; ii < 10; jj = ii + 2) 196 for (ii = 0; ii<10; jj> kk + 2) 215 for (ii = 0; ii < 10; ii ? ++ii : ++jj)
|
H A D | parallel_for_loop_messages.cpp | 18 int ii, jj, kk; local 99 for (int i = 0; jj < kk; ii++) 134 for (ii = 0; ii < 10; ++jj) 135 c[ii] = a[jj]; 160 for (ii = 0; ii < 10; jj = ii + 2) 166 for (ii = 0; ii<10; jj> kk + 2) 182 for (ii = 0; ii < 10; ii ? ++ii : ++jj)
|
H A D | simd_loop_messages.cpp | 9 int ii, jj, kk; local 90 for (int i = 0; jj < kk; ii++) 125 for (ii = 0; ii < 10; ++jj) 126 c[ii] = a[jj]; 151 for (ii = 0; ii < 10; jj = ii + 2) 157 for (ii = 0; ii < 10; jj > kk + 2) 173 for (ii = 0; ii < 10; ii ? ++ii : ++jj) 246 #pragma omp simd lastprivate(ii) linear(jj) collapse(2) // expected-note {{defined as linear}} 248 for (jj = 0; jj < 1 [all...] |
/external/eigen/bench/ |
H A D | sparse_setter.cpp | 364 for(I jj = row_start; jj < row_end; jj++){ 365 temp.push_back(std::make_pair(Aj[jj],Ax[jj])); 370 for(I jj = row_start, n = 0; jj < row_end; jj++, n++){ 371 Aj[jj] = temp[n].first; 372 Ax[jj] 387 I jj = row_end; local [all...] |