Searched defs:jj (Results 1 - 25 of 70) sorted by relevance

123

/external/webrtc/webrtc/common_audio/signal_processing/
H A Dget_hanning_window.c58 size_t jj; local
71 for (jj = 0; jj < size; jj++)
/external/clang/test/CodeGenCXX/
H A Ddebug-info-template-explicit-specialization.cpp107 j<int> jj; variable
/external/eigen/unsupported/Eigen/src/LevenbergMarquardt/
H A DLMcovar.h28 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 Dcovar.h15 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 Dtest.cpp28 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/eigen/Eigen/src/SparseLU/
H A DSparseLU_panel_bmod.h61 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 DSparseLU_panel_dfs.h44 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/boringssl/src/decrepit/bio/
H A Dbase64_bio.c263 int z, jj; local
265 jj = i & ~3; /* process per 4 */
266 z = EVP_DecodeBlock((uint8_t *)ctx->buf, (uint8_t *)ctx->tmp, jj);
267 if (jj > 2) {
268 if (ctx->tmp[jj - 1] == '=') {
270 if (ctx->tmp[jj - 2] == '=') {
275 /* z is now number of output bytes and jj is the number consumed. */
276 if (jj != i) {
277 memmove(ctx->tmp, &ctx->tmp[jj], i - jj);
[all...]
/external/bzip2/
H A Ddecompress.c360 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/clang/test/OpenMP/
H A Dfor_loop_messages.cpp23 int ii, jj, kk; local
122 for (int i = 0; jj < kk; ii++)
164 for (ii = 0; ii < 10; ++jj)
165 c[ii] = a[jj];
195 for (ii = 0; ii < 10; jj = ii + 2)
202 for (ii = 0; ii<10; jj> kk + 2)
221 for (ii = 0; ii < 10; ii ? ++ii : ++jj)
H A Dfor_simd_loop_messages.cpp19 int ii, jj, kk; local
117 for (int i = 0; jj < kk; ii++)
159 for (ii = 0; ii < 10; ++jj)
160 c[ii] = a[jj];
190 for (ii = 0; ii < 10; jj = ii + 2)
197 for (ii = 0; ii<10; jj> kk + 2)
216 for (ii = 0; ii < 10; ii ? ++ii : ++jj)
H A Dparallel_for_loop_messages.cpp19 int ii, jj, kk; local
100 for (int i = 0; jj < kk; ii++)
135 for (ii = 0; ii < 10; ++jj)
136 c[ii] = a[jj];
161 for (ii = 0; ii < 10; jj = ii + 2)
167 for (ii = 0; ii<10; jj> kk + 2)
183 for (ii = 0; ii < 10; ii ? ++ii : ++jj)
H A Dparallel_for_simd_loop_messages.cpp19 int ii, jj, kk; local
100 for (int i = 0; jj < kk; ii++)
135 for (ii = 0; ii < 10; ++jj)
136 c[ii] = a[jj];
161 for (ii = 0; ii < 10; jj = ii + 2)
167 for (ii = 0; ii<10; jj> kk + 2)
183 for (ii = 0; ii < 10; ii ? ++ii : ++jj)
H A Dsimd_loop_messages.cpp10 int ii, jj, kk; local
91 for (int i = 0; jj < kk; ii++)
126 for (ii = 0; ii < 10; ++jj)
127 c[ii] = a[jj];
152 for (ii = 0; ii < 10; jj = ii + 2)
158 for (ii = 0; ii < 10; jj > kk + 2)
174 for (ii = 0; ii < 10; ii ? ++ii : ++jj)
247 #pragma omp simd lastprivate(ii) linear(jj) collapse(2) // expected-note {{defined as linear}}
249 for (jj = 0; jj < 1
[all...]
H A Dtaskloop_loop_messages.cpp23 int ii, jj, kk; local
122 for (int i = 0; jj < kk; ii++)
164 for (ii = 0; ii < 10; ++jj)
165 c[ii] = a[jj];
195 for (ii = 0; ii < 10; jj = ii + 2)
202 for (ii = 0; ii<10; jj> kk + 2)
221 for (ii = 0; ii < 10; ii ? ++ii : ++jj)
H A Dtaskloop_simd_loop_messages.cpp23 int ii, jj, kk; local
122 for (int i = 0; jj < kk; ii++)
164 for (ii = 0; ii < 10; ++jj)
165 c[ii] = a[jj];
195 for (ii = 0; ii < 10; jj = ii + 2)
202 for (ii = 0; ii<10; jj> kk + 2)
221 for (ii = 0; ii < 10; ii ? ++ii : ++jj)
/external/eigen/bench/
H A Dsparse_setter.cpp364 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...]
/external/libopus/tests/
H A Dtest_opus_decode.c287 int jj; local
288 for(jj=0;jj<j;jj++)packet[jj+1]=fast_rand()&255;
H A Dtest_opus_api.c711 opus_int32 i,j,jj,sz; local
742 for(jj=0;jj<=1275*2+3;jj++)
745 ret=opus_packet_parse(packet,jj,&toc,frames,size,&payload_offset);
747 if((jj&1)==1 && jj<=2551)
752 if(size[0]!=size[1] || size[0]!=((jj-1)>>1))test_failed();
826 for(jj=49;jj<
[all...]
/external/libselinux/src/
H A Dlabel_android_property.c53 unsigned int ii, jj; local
58 for (jj = ii + 1; jj < data->nspec; jj++) {
59 if (!strcmp(spec_arr[jj].property_key,
63 if (strcmp(spec_arr[jj].lr.ctx_raw,
69 spec_arr[jj].lr.ctx_raw,
/external/mesa3d/src/gallium/drivers/llvmpipe/
H A Dlp_tile_image.c160 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/rmi4utils/f54test/
H A Df54test.cpp1406 unsigned int jj; local
1437 for (jj = 0; jj < (rx_num - 1); jj++) {
/external/selinux/libselinux/src/
H A Dlabel_android_property.c53 unsigned int ii, jj; local
58 for (jj = ii + 1; jj < data->nspec; jj++) {
59 if (!strcmp(spec_arr[jj].property_key,
63 if (strcmp(spec_arr[jj].lr.ctx_raw,
69 spec_arr[jj].lr.ctx_raw,
/external/clang/test/Analysis/
H A Dtaint-tester.c122 int jj = ii;// expected-warning + {{tainted}} local
/external/eigen/Eigen/src/IterativeLinearSolvers/
H A DIncompleteLUT.h326 Index jj = 0; local
328 while (jj < sizel)
331 // we must select first the smallest column index among ju(jj:sizel)
333 Index minrow = ju.segment(jj,sizel-jj).minCoeff(&k); // k is relative to the segment
334 k += jj;
335 if (minrow != ju(jj))
338 Index j = ju(jj);
339 swap(ju(jj), ju(k));
340 jr(minrow) = jj; j
[all...]

Completed in 1952 milliseconds

123