Searched refs:jj (Results 1 - 25 of 69) sorted by relevance

123

/external/webrtc/src/common_audio/signal_processing/
H A Dget_hanning_window.c58 int jj; local
71 for (jj = 0; jj < size; jj++)
/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/apache-http/src/org/apache/commons/codec/binary/
H A DBinaryCodec.java178 * We decr index jj by 8 as we go along to not recompute indices using multiplication every time inside the
181 for (int ii = 0, jj = ascii.length - 1; ii < l_raw.length; ii++, jj -= 8) {
183 if (ascii[jj - bits] == '1') {
205 * We decr index jj by 8 as we go along to not recompute indices using multiplication every time inside the
208 for (int ii = 0, jj = ascii.length - 1; ii < l_raw.length; ii++, jj -= 8) {
210 if (ascii[jj - bits] == '1') {
234 * We decr index jj by 8 as we go along to not recompute indices using multiplication every time inside the
237 for (int ii = 0, jj
[all...]
/external/clang/test/SemaCXX/
H A Ddefault1.cpp52 void jj (int f = 4);
54 void jj (int f); // expected-note{{'jj' declared here}}
55 jj(); // expected-error{{too few arguments to function call, single argument 'f' was not specified}}
H A Dinit-priority-attr.cpp8 Two( int ii, int jj ) { i = ii; j = jj; k = count++; };
/external/toybox/toys/other/
H A Dbzcat.c147 int hh, ii, jj, kk, symCount, *base, *limit; local
152 jj = get_bits(bd, 24);
156 if (ii==0x177245 && jj==0x385090) return RETVAL_LAST_BLOCK;
159 if (ii!=0x314159 || jj!=0x265359) return RETVAL_NOT_BZIP_DATA;
175 for (jj=0; jj<16; jj++)
176 if (kk & (1 << (15 - jj)))
177 bd->symToByte[bd->symTotal++] = (16 * ii) + jj;
197 for(jj
305 int hh, ii, jj, kk, runPos, dbufCount, symCount, selector, nextSym, local
435 int ii, jj; local
[all...]
/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/eigen/Eigen/src/SparseLU/
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...]
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...]
/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/opencv/cv/src/
H A Dcvoptflowlk.cpp375 int jj; local
383 for( jj = -j; jj <= HorRadius; jj++ )
385 float Ker = KerX[jj];
387 WII[address].xx += II[address + jj].xx * Ker;
388 WII[address].xy += II[address + jj].xy * Ker;
389 WII[address].yy += II[address + jj].yy * Ker;
390 WII[address].xt += II[address + jj].xt * Ker;
391 WII[address].yt += II[address + jj]
398 int jj; local
428 int jj; local
[all...]
H A Dcvinpaint.cpp238 int i, j, ii = 0, jj = 0, q; local
241 while (Heap->Pop(&ii,&jj)) {
244 CV_MAT_ELEM(*f,uchar,ii,jj) = (uchar)known;
248 if (q==0) {i=ii-1; j=jj;}
249 else if(q==1) {i=ii; j=jj-1;}
250 else if(q==2) {i=ii+1; j=jj;}
251 else {i=ii; j=jj+1;}
281 int i = 0, j = 0, ii = 0, jj = 0, k, l, q, color = 0; local
286 while (Heap->Pop(&ii,&jj)) {
288 CV_MAT_ELEM(*f,uchar,ii,jj)
515 int i = 0, j = 0, ii = 0, jj = 0, k, l, q, color = 0; local
[all...]
/external/google-tv-pairing-protocol/java/src/com/google/polo/json/
H A DTest.java22 JSONStringer jj;
121 jj = new JSONStringer();
122 s = jj
156 jj = new JSONStringer();
157 jj.array();
158 jj.value(1);
159 jj.array();
160 jj.value(null);
161 jj.array();
162 jj
[all...]
/external/mesa3d/src/mesa/tnl/
H A Dt_pipeline.h70 extern void _tnl_RenderClippedLine( struct gl_context *ctx, GLuint ii, GLuint 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/eigen/Eigen/src/IterativeLinearSolvers/
H A DIncompleteLUT.h325 Index jj = 0; local
327 while (jj < sizel)
330 // we must select first the smallest column index among ju(jj:sizel)
332 Index minrow = ju.segment(jj,sizel-jj).minCoeff(&k); // k is relative to the segment
333 k += jj;
334 if (minrow != ju(jj))
337 Index j = ju(jj);
338 swap(ju(jj), ju(k));
339 jr(minrow) = jj; j
[all...]
/external/bsdiff/
H A Dbsdiff.c45 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/mesa3d/src/mesa/program/
H A Dprog_noise.c260 int ii, jj; local
286 jj = j % 256;
294 n0 = t0 * t0 * grad2(perm[ii + perm[jj]], x0, y0);
302 n1 = t1 * t1 * grad2(perm[ii + i1 + perm[jj + j1]], x1, y1);
310 n2 = t2 * t2 * grad2(perm[ii + 1 + perm[jj + 1]], x2, y2);
347 int ii, jj, kk; local
427 jj = j % 256;
436 n0 = t0 * t0 * grad3(perm[ii + perm[jj + perm[kk]]], x0, y0, z0);
445 t1 * t1 * grad3(perm[ii + i1 + perm[jj + j1 + perm[kk + k1]]], x1,
455 t2 * t2 * grad3(perm[ii + i2 + perm[jj
530 int ii, jj, kk, ll; local
[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, curr_spec->property_key))) {
63 (spec_arr[jj].lr.ctx_raw,
69 spec_arr[jj].lr.ctx_raw,
/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, curr_spec->property_key)) {
62 if (strcmp(spec_arr[jj].lr.ctx_raw, curr_spec->lr.ctx_raw)) {
67 spec_arr[jj].lr.ctx_raw,
/external/libopus/tests/
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/webrtc/src/modules/audio_coding/codecs/isac/main/source/
H A Dfft.c276 int j, jc, jf, jj, k, k1, k2, k3, k4, kk, kt, nn, ns, nt; local
381 jj = 9;
383 while (k % jj == 0) {
386 k /= jj;
389 jj = j * j;
390 } while (jj <= k);
688 jj = j;
696 ak += Rtmp [k - 1] * Cos [jj - 1];
697 bk += Itmp [k - 1] * Cos [jj - 1];
699 aj += Rtmp [k - 1] * Sin [jj
[all...]
/external/clang/test/CodeGenCXX/
H A Ddebug-info-template-explicit-specialization.cpp107 j<int> jj; variable
/external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/heightmap/
H A DParticleDepositionHeightMap.java200 for (int jj = 0; jj < 8; jj++) {
201 tx = (sx + dx[(jj + m) % 8]) % (size);
202 ty = (sy + dy[(jj + m) % 8]) % (size);

Completed in 1519 milliseconds

123