Searched refs:j1 (Results 1 - 25 of 84) sorted by relevance

1234

/external/svox/pico/lib/
H A Dpicofftsg.c670 picoos_int32 j0, k0, j1, k1, l, m, i, j, k, nh, m2; local
692 j1 = j + m;
694 xr = a[j1];
695 xi = a[j1 + 1];
698 a[j1] = yr;
699 a[j1 + 1] = yi;
702 j1 += m;
704 xr = a[j1];
705 xi = a[j1 + 1];
708 a[j1]
1029 picoos_int32 j0, k0, j1, k1, l, m, i, j, k, nh, m2; local
1583 picoos_int32 j0, k0, j1, k1, l, m, i, j, k, nh; local
1707 picoos_int32 i, i0, j, j0, j1, j2, j3, m, mh; local
2034 picoos_int32 i, i0, j, j0, j1, j2, j3, m, mh; local
2248 picoos_int32 i, i0, j, j0, j1, j2, j3, m, mh; local
[all...]
/external/webrtc/webrtc/modules/audio_processing/aec/
H A Daec_rdft.c140 unsigned int j, j1, k, k1; local
146 j1 = 2 * j + ip[k];
148 xr = a[j1 + 0];
149 xi = a[j1 + 1];
152 a[j1 + 0] = yr;
153 a[j1 + 1] = yi;
156 j1 += 8;
158 xr = a[j1 + 0];
159 xi = a[j1 + 1];
162 a[j1
311 int j0, j1, j2, j3, k, k1, k2, m2; local
435 int j, j1, j2, j3, l; local
465 int j, j1, j2, j3, l; local
497 int j1, j2, k1, k2; local
518 int j1, j2, k1, k2; local
[all...]
H A Daec_rdft_neon.c190 int j1, j2; local
195 for (j1 = 1, j2 = 2; j2 + 7 < 64; j1 += 4, j2 += 8) {
197 const float32x4_t c_j1 = vld1q_f32(&c[j1]); // 1, 2, 3, 4,
198 const float32x4_t c_k1 = vld1q_f32(&c[29 - j1]); // 28, 29, 30, 31,
251 for (; j2 < 64; j1 += 1, j2 += 2) {
253 const int k1 = 32 - j1;
255 const float wki = c[j1];
269 int j1, j2; local
275 for (j1
[all...]
H A Daec_rdft_sse2.c242 int j1, j2, k1, k2; local
251 for (j1 = 1, j2 = 2; j2 + 7 < 64; j1 += 4, j2 += 8) {
253 const __m128 c_j1 = _mm_loadu_ps(&c[j1]); // 1, 2, 3, 4,
254 const __m128 c_k1 = _mm_loadu_ps(&c[29 - j1]); // 28, 29, 30, 31,
314 for (; j2 < 64; j1 += 1, j2 += 2) {
316 k1 = 32 - j1;
318 wki = c[j1];
332 int j1, j2, k1, k2; local
342 for (j1
[all...]
/external/webrtc/webrtc/common_audio/
H A Dfft4g.c701 size_t j, j1, k, k1, l, m, m2; local
718 j1 = 2 * j + ip[k];
720 xr = a[j1];
721 xi = a[j1 + 1];
724 a[j1] = yr;
725 a[j1 + 1] = yi;
728 j1 += m2;
730 xr = a[j1];
731 xi = a[j1 + 1];
734 a[j1]
910 size_t j, j1, j2, j3, l; local
960 size_t j, j1, j2, j3, l; local
1115 size_t j, j1, j2, j3, k, k1, k2, m, m2; local
[all...]
/external/clang/test/SemaCXX/
H A Dms-property.cpp49 // CHECK-NEXT: float j1 = (p2->x[223][11]);
50 float j1 = (p2->x[223][11]); local
51 // CHECK-NEXT: ((p2->x)[23])[1] = j1;
52 ((p2->x)[23])[1] = j1;
55 // CHECK-NEXT: j1 = ((p2->x)[23])[1] = j1;
56 j1 = ((p2->x)[23])[1] = j1;
H A Ddr1301.cpp59 int j1 = J().n; // ok variable
H A Daddress-of-temporary.cpp47 void j1() { (void)S { Y{}.a }; } function in namespace:PointerToArrayDecay
H A Dms-property-error.cpp33 float j1 = (p2->x); // expected-error {{too few arguments to function call, expected 2, have 0}} local
/external/v8/test/mjsunit/regress/
H A Dregress-2825.js15 var j1 = 1;
/external/mesa3d/src/mesa/program/
H A Dprog_noise.c265 int i1, j1; /* Offsets for second (middle) corner of simplex in (i,j) coords */ local
268 j1 = 0;
272 j1 = 1;
280 y1 = y0 - j1 + G2;
302 n1 = t1 * t1 * grad2(perm[ii + i1 + perm[jj + j1]], x1, y1);
352 int i1, j1, k1; /* Offsets for second corner of simplex in (i,j,k) coords */ local
359 j1 = 0;
367 j1 = 0;
375 j1 = 0;
385 j1
525 int i1, j1, k1, l1; /* The integer offsets for the second simplex corner */ local
[all...]
/external/eigen/test/
H A Dsparseqr.cpp28 int j1 = internal::random<int>(0,cols-1); local
30 A.col(j0) = s * A.col(j1);
31 dA.col(j0) = s * dA.col(j1);
H A Dsparse_basic.cpp204 Index j1 = internal::random<Index>(0,rows-1); local
211 VERIFY_IS_APPROX(m2.innerVector(j0)+m2.innerVector(j1), refMat2.row(j0)+refMat2.row(j1));
213 VERIFY_IS_APPROX(m2.innerVector(j0)+m2.innerVector(j1), refMat2.col(j0)+refMat2.col(j1));
234 //m2.innerVector(j0) = 2*m2.innerVector(j1);
235 //refMat2.col(j0) = 2*refMat2.col(j1);
247 Index j1 = internal::random<Index>(0,rows-2); local
248 Index n0 = internal::random<Index>(1,rows-(std::max)(j0,j1));
254 VERIFY_IS_APPROX(m2.innerVectors(j0,n0)+m2.innerVectors(j1,n
337 Index j1 = internal::random<Index>(0,rows-2); local
[all...]
/external/opencv3/modules/shape/src/
H A Dsc_dis.cpp509 int j=0, j1=0, j2=0, endofpath=0, last=0, low=0, up=0; local
548 j1=rowsol[i];
552 if (j!=j1)
560 v[j1] = v[j1]-min;
577 j1=0;
593 j2 = j1;
594 j1 = j;
598 i0 = colsol[j1];
602 v[j1]
[all...]
/external/eigen/test/eigen2/
H A Deigen2_sparse_basic.cpp240 int j1 = ei_random(0,rows-1); local
242 VERIFY_IS_APPROX(m2.innerVector(j0)+m2.innerVector(j1), refMat2.col(j0)+refMat2.col(j1));
243 //m2.innerVector(j0) = 2*m2.innerVector(j1);
244 //refMat2.col(j0) = 2*refMat2.col(j1);
254 int j1 = ei_random(0,rows-2); local
255 int n0 = ei_random<int>(1,rows-std::max(j0,j1));
257 VERIFY_IS_APPROX(m2.innerVectors(j0,n0)+m2.innerVectors(j1,n0),
258 refMat2.block(0,j0,rows,n0)+refMat2.block(0,j1,rows,n0));
259 //m2.innerVectors(j0,n0) = m2.innerVectors(j0,n0) + m2.innerVectors(j1,n
[all...]
/external/eigen/Eigen/src/LU/
H A DInverse.h122 j1 = (j+1) % 3, enumerator in enum:Eigen::internal::__anon5397
125 return m.coeff(i1, j1) * m.coeff(i2, j2)
126 - m.coeff(i1, j2) * m.coeff(i2, j1);
192 (const MatrixBase<Derived>& matrix, int i1, int i2, int i3, int j1, int j2, int j3)
194 return matrix.coeff(i1,j1)
205 j1 = (j+1) % 4, enumerator in enum:Eigen::internal::__anon5398
209 return general_det3_helper(matrix, i1, i2, i3, j1, j2, j3)
210 + general_det3_helper(matrix, i2, i3, i1, j1, j2, j3)
211 + general_det3_helper(matrix, i3, i1, i2, j1, j2, j3);
191 general_det3_helper(const MatrixBase<Derived>& matrix, int i1, int i2, int i3, int j1, int j2, int j3) argument
/external/opencv3/modules/imgproc/src/
H A Dphasecorr.cpp65 int j1 = ncols - (cols % 2 == 0 && cn == 1); local
102 dataDst[j1] = dataSrc[j1]*dataSrc[j1];
105 for( j = j0; j < j1; j += 2 )
146 dataDst[j1] = dataSrc[j1]*dataSrc[j1];
149 for( j = j0; j < j1; j += 2 )
178 int j1 local
[all...]
/external/clang/test/CodeGenCXX/
H A Dms-property.cpp62 float j1 = p2->x[223][11]; local
67 argc = p2->x[23][1] = j1;
/external/opencv/ml/src/
H A Dmlknearest.cpp218 int i, j, j1, count = end - start; local
247 for( j1 = 0; j1 < j; j1++ )
248 if( sort_buf[j1].i > sort_buf[j1+1].i )
251 CV_SWAP( sort_buf[j1].i, sort_buf[j1+1].i, t );
/external/v8/test/cctest/compiler/
H A Dtest-jump-threading.cc660 int j1 = code.Jump(1); local
668 CheckJump(code, j1, 2);
680 int j1 = code.Jump(1); local
691 CheckJump(code, j1, 3);
705 int j1 = code.Jump(1); local
717 CheckJump(code, j1, 1);
730 int j1 = code.Jump(1); local
742 CheckJump(code, j1, 1);
/external/mesa3d/src/mesa/swrast/
H A Ds_texfilter.c555 GLint *i0, GLint *i1, GLint *j0, GLint *j1, GLint *slice,
568 height, j0, j1, wj);
577 texcoord[1], j0, j1, wj);
585 *j1 = *j0;
593 texcoord[1], j0, j1, wj);
1156 GLint i0, j0, i1, j1; local
1162 linear_texel_locations(samp->WrapT, img, height, texcoord[1], &j0, &j1, &b);
1168 j1 += img->Border;
1174 if (j1 < 0 || j1 >
551 linear_texcoord(const struct gl_sampler_object *samp, const struct gl_texture_object *texObj, GLuint level, const GLfloat texcoord[4], GLint *i0, GLint *i1, GLint *j0, GLint *j1, GLint *slice, GLfloat *wi, GLfloat *wj) argument
1221 GLint i0, j0, i1, j1; local
2056 GLint i0, j0, k0, i1, j1, k1; local
2729 GLint i0, j0, i1, j1; local
2862 GLint i0, j0, i1, j1; local
3597 GLint i0, i1, j0, j1; local
[all...]
/external/eigen/Eigen/src/Core/products/
H A DGeneralMatrixMatrixTriangular.h163 for(Index j1=0; j1<actualBlockSize; ++j1)
165 ResScalar* r = res + (j+j1)*resStride + i;
166 for(Index i1=UpLo==Lower ? j1 : 0;
167 UpLo==Lower ? i1<actualBlockSize : i1<=j1; ++i1)
168 r[i1] += buffer(i1,j1);
/external/opencv/cv/src/
H A Dcvhough.cpp628 int i1, j1; local
632 j1 = x;
637 j1 = x >> shift;
641 if( j1 < 0 || j1 >= width || i1 < 0 || i1 >= height )
644 mdata = mdata0 + i1*width + j1;
654 line_end[k].x = j1;
676 int i1, j1; local
680 j1 = x;
685 j1
[all...]
/external/libvpx/libvpx/vpx_dsp/
H A Dfastssim.c150 int j1; local
152 j1 = FS_MINI(j0 + 1, _h);
159 + _src1[j0 * _s1ystride + i1] + _src1[j1 * _s1ystride + i0]
160 + _src1[j1 * _s1ystride + i1];
162 + _src2[j0 * _s2ystride + i1] + _src2[j1 * _s2ystride + i0]
163 + _src2[j1 * _s2ystride + i1];
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
H A DECAlgorithms.java420 int j0 = i << 1, j1 = j0 + 1;
423 BigInteger kj1 = ks[j1]; negs[j1] = kj1.signum() < 0; kj1 = kj1.abs();
429 infos[j1] = WNafUtil.getWNafPreCompInfo(Q);
431 wnafs[j1] = WNafUtil.generateWindowNaf(width, kj1);

Completed in 774 milliseconds

1234