Home
last modified time | relevance | path

Searched refs:j1 (Results 1 – 25 of 96) sorted by relevance

1234

/external/svox/pico/lib/
Dpicofftsg.c670 picoos_int32 j0, k0, j1, k1, l, m, i, j, k, nh, m2; in bitrv2() local
692 j1 = j + m; in bitrv2()
694 xr = a[j1]; in bitrv2()
695 xi = a[j1 + 1]; in bitrv2()
698 a[j1] = yr; in bitrv2()
699 a[j1 + 1] = yi; in bitrv2()
702 j1 += m; in bitrv2()
704 xr = a[j1]; in bitrv2()
705 xi = a[j1 + 1]; in bitrv2()
708 a[j1] = yr; in bitrv2()
[all …]
/external/webrtc/webrtc/modules/audio_processing/aec/
Daec_rdft.c140 unsigned int j, j1, k, k1; in bitrv2_128_C() local
146 j1 = 2 * j + ip[k]; in bitrv2_128_C()
148 xr = a[j1 + 0]; in bitrv2_128_C()
149 xi = a[j1 + 1]; in bitrv2_128_C()
152 a[j1 + 0] = yr; in bitrv2_128_C()
153 a[j1 + 1] = yi; in bitrv2_128_C()
156 j1 += 8; in bitrv2_128_C()
158 xr = a[j1 + 0]; in bitrv2_128_C()
159 xi = a[j1 + 1]; in bitrv2_128_C()
162 a[j1 + 0] = yr; in bitrv2_128_C()
[all …]
Daec_rdft_neon.c190 int j1, j2; in rftfsub_128_neon() local
195 for (j1 = 1, j2 = 2; j2 + 7 < 64; j1 += 4, j2 += 8) { in rftfsub_128_neon()
197 const float32x4_t c_j1 = vld1q_f32(&c[j1]); // 1, 2, 3, 4, in rftfsub_128_neon()
198 const float32x4_t c_k1 = vld1q_f32(&c[29 - j1]); // 28, 29, 30, 31, in rftfsub_128_neon()
251 for (; j2 < 64; j1 += 1, j2 += 2) { in rftfsub_128_neon()
253 const int k1 = 32 - j1; in rftfsub_128_neon()
255 const float wki = c[j1]; in rftfsub_128_neon()
269 int j1, j2; in rftbsub_128_neon() local
275 for (j1 = 1, j2 = 2; j2 + 7 < 64; j1 += 4, j2 += 8) { in rftbsub_128_neon()
277 const float32x4_t c_j1 = vld1q_f32(&c[j1]); // 1, 2, 3, 4, in rftbsub_128_neon()
[all …]
Daec_rdft_sse2.c242 int j1, j2, k1, k2; in rftfsub_128_SSE2() local
251 for (j1 = 1, j2 = 2; j2 + 7 < 64; j1 += 4, j2 += 8) { in rftfsub_128_SSE2()
253 const __m128 c_j1 = _mm_loadu_ps(&c[j1]); // 1, 2, 3, 4, in rftfsub_128_SSE2()
254 const __m128 c_k1 = _mm_loadu_ps(&c[29 - j1]); // 28, 29, 30, 31, in rftfsub_128_SSE2()
314 for (; j2 < 64; j1 += 1, j2 += 2) { in rftfsub_128_SSE2()
316 k1 = 32 - j1; in rftfsub_128_SSE2()
318 wki = c[j1]; in rftfsub_128_SSE2()
332 int j1, j2, k1, k2; in rftbsub_128_SSE2() local
342 for (j1 = 1, j2 = 2; j2 + 7 < 64; j1 += 4, j2 += 8) { in rftbsub_128_SSE2()
344 const __m128 c_j1 = _mm_loadu_ps(&c[j1]); // 1, 2, 3, 4, in rftbsub_128_SSE2()
[all …]
/external/webrtc/webrtc/common_audio/
Dfft4g.c701 size_t j, j1, k, k1, l, m, m2; in bitrv2() local
718 j1 = 2 * j + ip[k]; in bitrv2()
720 xr = a[j1]; in bitrv2()
721 xi = a[j1 + 1]; in bitrv2()
724 a[j1] = yr; in bitrv2()
725 a[j1 + 1] = yi; in bitrv2()
728 j1 += m2; in bitrv2()
730 xr = a[j1]; in bitrv2()
731 xi = a[j1 + 1]; in bitrv2()
734 a[j1] = yr; in bitrv2()
[all …]
/external/mesa3d/src/mesa/program/
Dprog_noise.c265 int i1, j1; /* Offsets for second (middle) corner of simplex in (i,j) coords */ in _mesa_noise2() local
268 j1 = 0; in _mesa_noise2()
272 j1 = 1; in _mesa_noise2()
280 y1 = y0 - j1 + G2; in _mesa_noise2()
302 n1 = t1 * t1 * grad2(perm[ii + i1 + perm[jj + j1]], x1, y1); in _mesa_noise2()
352 int i1, j1, k1; /* Offsets for second corner of simplex in (i,j,k) coords */ in _mesa_noise3() local
359 j1 = 0; in _mesa_noise3()
367 j1 = 0; in _mesa_noise3()
375 j1 = 0; in _mesa_noise3()
385 j1 = 0; in _mesa_noise3()
[all …]
/external/llvm/test/Transforms/StraightLineStrengthReduce/AMDGPU/
Dreassociate-geps-and-slsr-addrspace.ll12 %j1 = add nsw i32 %i, 1023
13 %tmp = sext i32 %j1 to i64
32 ; CHECK: %j1 = add nsw i32 %i, 1024
33 ; CHECK: %tmp = sext i32 %j1 to i64
39 %j1 = add nsw i32 %i, 1024
40 %tmp = sext i32 %j1 to i64
67 %j1 = add nsw i32 %i, 16383
68 %p1 = getelementptr inbounds float, float addrspace(3)* %arr, i32 %j1
85 ; CHECK: %j1 = add nsw i32 %i, 16384
86 ; CHECK: getelementptr inbounds float, float addrspace(3)* %arr, i32 %j1
[all …]
/external/opencv3/modules/shape/src/
Dsc_dis.cpp509 int j=0, j1=0, j2=0, endofpath=0, last=0, low=0, up=0; in hungarian() local
548 j1=rowsol[i]; in hungarian()
552 if (j!=j1) in hungarian()
560 v[j1] = v[j1]-min; in hungarian()
577 j1=0; in hungarian()
593 j2 = j1; in hungarian()
594 j1 = j; in hungarian()
598 i0 = colsol[j1]; in hungarian()
602 v[j1] = v[j1] - (usubmin - umin); in hungarian()
608 j1 = j2; in hungarian()
[all …]
/external/clang/test/SemaCXX/
Dms-property.cpp50 float j1 = (p2->x[223][11]); in main() local
52 ((p2->x)[23])[1] = j1; in main()
56 j1 = ((p2->x)[23])[1] = j1; in main()
/external/opencv3/modules/imgproc/src/
Dphasecorr.cpp65 int j1 = ncols - (cols % 2 == 0 && cn == 1); in magSpectrums() local
102 dataDst[j1] = dataSrc[j1]*dataSrc[j1]; in magSpectrums()
105 for( j = j0; j < j1; j += 2 ) in magSpectrums()
146 dataDst[j1] = dataSrc[j1]*dataSrc[j1]; in magSpectrums()
149 for( j = j0; j < j1; j += 2 ) in magSpectrums()
178 int j1 = ncols - (cols % 2 == 0 && cn == 1); in divSpectrums() local
242 dataC[j1] = dataA[j1] / (dataB[j1] + eps); in divSpectrums()
246 for( j = j0; j < j1; j += 2 ) in divSpectrums()
255 for( j = j0; j < j1; j += 2 ) in divSpectrums()
326 dataC[j1] = dataA[j1] / (dataB[j1] + eps); in divSpectrums()
[all …]
/external/eigen/test/
Dsparse_basic.cpp204 Index j1 = internal::random<Index>(0,rows-1); in sparse_basic() local
211 VERIFY_IS_APPROX(m2.innerVector(j0)+m2.innerVector(j1), refMat2.row(j0)+refMat2.row(j1)); in sparse_basic()
213 VERIFY_IS_APPROX(m2.innerVector(j0)+m2.innerVector(j1), refMat2.col(j0)+refMat2.col(j1)); in sparse_basic()
247 Index j1 = internal::random<Index>(0,rows-2); in sparse_basic() local
248 Index n0 = internal::random<Index>(1,rows-(std::max)(j0,j1)); in sparse_basic()
254 VERIFY_IS_APPROX(m2.innerVectors(j0,n0)+m2.innerVectors(j1,n0), in sparse_basic()
255 refMat2.middleRows(j0,n0)+refMat2.middleRows(j1,n0)); in sparse_basic()
257 VERIFY_IS_APPROX(m2.innerVectors(j0,n0)+m2.innerVectors(j1,n0), in sparse_basic()
258 refMat2.block(0,j0,rows,n0)+refMat2.block(0,j1,rows,n0)); in sparse_basic()
262 m2.innerVectors(j0,n0) = m2.innerVectors(j0,n0) + m2.innerVectors(j1,n0); in sparse_basic()
[all …]
Dsparseqr.cpp28 int j1 = internal::random<int>(0,cols-1); in generate_sparse_rectangular_problem() local
30 A.col(j0) = s * A.col(j1); in generate_sparse_rectangular_problem()
31 dA.col(j0) = s * dA.col(j1); in generate_sparse_rectangular_problem()
/external/opencv/ml/src/
Dmlknearest.cpp218 int i, j, j1, count = end - start; in write_results() local
247 for( j1 = 0; j1 < j; j1++ ) in write_results()
248 if( sort_buf[j1].i > sort_buf[j1+1].i ) in write_results()
251 CV_SWAP( sort_buf[j1].i, sort_buf[j1+1].i, t ); in write_results()
/external/eigen/Eigen/src/LU/
DInverse.h122 j1 = (j+1) % 3,
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,
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);
/external/eigen/test/eigen2/
Deigen2_sparse_basic.cpp240 int j1 = ei_random(0,rows-1); in sparse_basic() local
242 VERIFY_IS_APPROX(m2.innerVector(j0)+m2.innerVector(j1), refMat2.col(j0)+refMat2.col(j1)); in sparse_basic()
254 int j1 = ei_random(0,rows-2); in sparse_basic() local
255 int n0 = ei_random<int>(1,rows-std::max(j0,j1)); in sparse_basic()
257 VERIFY_IS_APPROX(m2.innerVectors(j0,n0)+m2.innerVectors(j1,n0), in sparse_basic()
258 refMat2.block(0,j0,rows,n0)+refMat2.block(0,j1,rows,n0)); in sparse_basic()
/external/v8/test/cctest/compiler/
Dtest-jump-threading.cc659 int j1 = code.Jump(1); in TEST() local
667 CheckJump(code, j1, 2); in TEST()
679 int j1 = code.Jump(1); in TEST() local
690 CheckJump(code, j1, 3); in TEST()
704 int j1 = code.Jump(1); in TEST() local
716 CheckJump(code, j1, 1); in TEST()
729 int j1 = code.Jump(1); in TEST() local
741 CheckJump(code, j1, 1); in TEST()
/external/eigen/Eigen/src/Core/products/
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/mesa3d/src/mesa/swrast/
Ds_texfilter.c555 GLint *i0, GLint *i1, GLint *j0, GLint *j1, GLint *slice, in linear_texcoord() argument
568 height, j0, j1, wj); in linear_texcoord()
577 texcoord[1], j0, j1, wj); in linear_texcoord()
585 *j1 = *j0; in linear_texcoord()
593 texcoord[1], j0, j1, wj); in linear_texcoord()
1156 GLint i0, j0, i1, j1; in sample_2d_linear() local
1162 linear_texel_locations(samp->WrapT, img, height, texcoord[1], &j0, &j1, &b); in sample_2d_linear()
1168 j1 += img->Border; in sample_2d_linear()
1174 if (j1 < 0 || j1 >= height) useBorderColor |= J1BIT; in sample_2d_linear()
1194 swImg->FetchTexel(swImg, i0, j1, 0, t01); in sample_2d_linear()
[all …]
/external/opencv/cv/src/
Dcvhough.cpp628 int i1, j1; in icvHoughLinesProbabalistic() local
632 j1 = x; in icvHoughLinesProbabalistic()
637 j1 = x >> shift; in icvHoughLinesProbabalistic()
641 if( j1 < 0 || j1 >= width || i1 < 0 || i1 >= height ) in icvHoughLinesProbabalistic()
644 mdata = mdata0 + i1*width + j1; in icvHoughLinesProbabalistic()
654 line_end[k].x = j1; in icvHoughLinesProbabalistic()
676 int i1, j1; in icvHoughLinesProbabalistic() local
680 j1 = x; in icvHoughLinesProbabalistic()
685 j1 = x >> shift; in icvHoughLinesProbabalistic()
689 mdata = mdata0 + i1*width + j1; in icvHoughLinesProbabalistic()
[all …]
/external/llvm/test/Analysis/BasicAA/
Dstruct-geps.ll61 define void @test_in_array([1 x %struct]* %st, i64 %i, i64 %j, i64 %k, i64 %i1, i64 %j1, i64 %k1) {
63 %y = getelementptr [1 x %struct], [1 x %struct]* %st, i64 %j, i64 %j1, i32 1
93 …rray([1 x [1 x [1 x %struct]]]* %st, i64 %i, i64 %j, i64 %k, i64 %i1, i64 %j1, i64 %k1, i64 %i2, i…
95 …%y = getelementptr [1 x [1 x [1 x %struct]]], [1 x [1 x [1 x %struct]]]* %st, i64 %j, i64 %j1, i64…
144 define void @test_same_underlying_object_different_indices(%struct* %st, i64 %i1, i64 %j1, i64 %k1,…
150 %y = getelementptr %struct, %struct* %st, i64 %j1, i32 1
/external/llvm/test/CodeGen/Generic/
D2006-07-03-schedulers.ll23 %j1 = add i32 %i, 7 ; <i32> [#uses=1]
24 %m1 = add i32 %i1, %j1 ; <i32> [#uses=2]
/external/clang/test/CodeGenCXX/
Dms-property.cpp62 float j1 = p2->x[223][11]; in main() local
67 argc = p2->x[23][1] = j1; in main()
/external/deqp/framework/common/
DtcuTexCompareVerifier.cpp680 for (int j1 = minJ1; j1 <= maxJ1; j1++) in isNearestMipmapLinearCompareResultValid() local
684 …1 = lookupDepth(level1, sampler, wrap(sampler.wrapS, i1, w1), wrap(sampler.wrapT, j1, h1), coordZ); in isNearestMipmapLinearCompareResultValid()
753 for (int j1 = minJ1; j1 <= maxJ1; j1++) in isLinearMipmapLinearCompareResultValid() local
759 const float minB1 = de::clamp((vBounds1.x()-0.5f)-float(j1), 0.0f, 1.0f); in isLinearMipmapLinearCompareResultValid()
760 const float maxB1 = de::clamp((vBounds1.y()-0.5f)-float(j1), 0.0f, 1.0f); in isLinearMipmapLinearCompareResultValid()
766 const int y0 = wrap(sampler.wrapT, j1 , h1); in isLinearMipmapLinearCompareResultValid()
767 const int y1 = wrap(sampler.wrapT, j1+1, h1); in isLinearMipmapLinearCompareResultValid()
940 for (int j1 = minJ1; j1 <= maxJ1; j1++) in isSeamplessLinearMipmapLinearCompareResultValid() local
946 const float minB1 = de::clamp((vBounds1.x()-0.5f)-float(j1), 0.0f, 1.0f); in isSeamplessLinearMipmapLinearCompareResultValid()
947 const float maxB1 = de::clamp((vBounds1.y()-0.5f)-float(j1), 0.0f, 1.0f); in isSeamplessLinearMipmapLinearCompareResultValid()
[all …]
/external/llvm/test/Transforms/BBVectorize/
Dfunc-alias.ll16 @j1.4581 = external global i32
151 …_st_parameter_dt*, i32*, i32)*)(%struct.__st_parameter_dt* %memtmp3, i32* @j1.4581, i32 4) nounwind
154 %j1.8760_353 = load i32, i32* @j1.4581, align 4
155 %D.75773_354 = sext i32 %j1.8760_353 to i64
179 %j1.8760_374 = load i32, i32* @j1.4581, align 4
180 %D.75773_375 = sext i32 %j1.8760_374 to i64
204 %j1.8760_395 = load i32, i32* @j1.4581, align 4
205 %D.75773_396 = sext i32 %j1.8760_395 to i64
/external/libvpx/libvpx/vpx_dsp/
Dfastssim.c150 int j1; in fs_downsample_level0() local
152 j1 = FS_MINI(j0 + 1, _h); in fs_downsample_level0()
159 + _src1[j0 * _s1ystride + i1] + _src1[j1 * _s1ystride + i0] in fs_downsample_level0()
160 + _src1[j1 * _s1ystride + i1]; in fs_downsample_level0()
162 + _src2[j0 * _s2ystride + i1] + _src2[j1 * _s2ystride + i0] in fs_downsample_level0()
163 + _src2[j1 * _s2ystride + i1]; in fs_downsample_level0()

1234