/external/fdlibm/ |
D | s_ceil.c | 38 int i0,i1,j0; local 42 j0 = ((i0>>20)&0x7ff)-0x3ff; 43 if(j0<20) { 44 if(j0<0) { /* raise inexact if x != 0 */ 50 i = (0x000fffff)>>j0; 53 if(i0>0) i0 += (0x00100000)>>j0; 57 } else if (j0>51) { 58 if(j0==0x400) return x+x; /* inf or NaN */ 61 i = ((unsigned)(0xffffffff))>>(j0-20); 65 if(j0==20) i0+=1; [all …]
|
D | s_floor.c | 38 int i0,i1,j0; local 42 j0 = ((i0>>20)&0x7ff)-0x3ff; 43 if(j0<20) { 44 if(j0<0) { /* raise inexact if x != 0 */ 51 i = (0x000fffff)>>j0; 54 if(i0<0) i0 += (0x00100000)>>j0; 58 } else if (j0>51) { 59 if(j0==0x400) return x+x; /* inf or NaN */ 62 i = ((unsigned)(0xffffffff))>>(j0-20); 66 if(j0==20) i0+=1; [all …]
|
D | s_rint.c | 43 int i0,j0,sx; local 49 j0 = ((i0>>20)&0x7ff)-0x3ff; 50 if(j0<20) { 51 if(j0<0) { 63 i = (0x000fffff)>>j0; 67 if(j0==19) i1 = 0x40000000; else 68 i0 = (i0&(~i))|((0x20000)>>j0); 71 } else if (j0>51) { 72 if(j0==0x400) return x+x; /* inf or NaN */ 75 i = ((unsigned)(0xffffffff))>>(j0-20); [all …]
|
D | s_modf.c | 39 int i0,i1,j0; local 43 j0 = ((i0>>20)&0x7ff)-0x3ff; /* exponent of x */ 44 if(j0<20) { /* integer part in high x */ 45 if(j0<0) { /* |x|<1 */ 50 i = (0x000fffff)>>j0; 62 } else if (j0>51) { /* no fraction part */ 68 i = ((unsigned)(0xffffffff))>>(j0-20);
|
/external/webrtc/src/modules/audio_processing/aec/ |
D | aec_rdft_sse2.c | 87 int j0; in cftmdl_128_SSE2() local 90 for (j0 = 0; j0 < l; j0 += 2) { in cftmdl_128_SSE2() 91 const __m128i a_00 = _mm_loadl_epi64((__m128i*)&a[j0 + 0]); in cftmdl_128_SSE2() 92 const __m128i a_08 = _mm_loadl_epi64((__m128i*)&a[j0 + 8]); in cftmdl_128_SSE2() 93 const __m128i a_32 = _mm_loadl_epi64((__m128i*)&a[j0 + 32]); in cftmdl_128_SSE2() 94 const __m128i a_40 = _mm_loadl_epi64((__m128i*)&a[j0 + 40]); in cftmdl_128_SSE2() 104 const __m128i a_16 = _mm_loadl_epi64((__m128i*)&a[j0 + 16]); in cftmdl_128_SSE2() 105 const __m128i a_24 = _mm_loadl_epi64((__m128i*)&a[j0 + 24]); in cftmdl_128_SSE2() 106 const __m128i a_48 = _mm_loadl_epi64((__m128i*)&a[j0 + 48]); in cftmdl_128_SSE2() 107 const __m128i a_56 = _mm_loadl_epi64((__m128i*)&a[j0 + 56]); in cftmdl_128_SSE2() [all …]
|
D | aec_rdft.c | 318 int j0, j1, j2, j3, k, k1, k2, m2; in cftmdl_128_C() local 322 for (j0 = 0; j0 < l; j0 += 2) { in cftmdl_128_C() 323 j1 = j0 + 8; in cftmdl_128_C() 324 j2 = j0 + 16; in cftmdl_128_C() 325 j3 = j0 + 24; in cftmdl_128_C() 326 x0r = a[j0 + 0] + a[j1 + 0]; in cftmdl_128_C() 327 x0i = a[j0 + 1] + a[j1 + 1]; in cftmdl_128_C() 328 x1r = a[j0 + 0] - a[j1 + 0]; in cftmdl_128_C() 329 x1i = a[j0 + 1] - a[j1 + 1]; in cftmdl_128_C() 334 a[j0 + 0] = x0r + x2r; in cftmdl_128_C() [all …]
|
/external/eigen/test/ |
D | sparse_basic.cpp | 171 Index j0 = internal::random<Index>(0,rows-1); in sparse_basic() local 174 VERIFY_IS_APPROX(m2.innerVector(j0), refMat2.row(j0)); in sparse_basic() 176 VERIFY_IS_APPROX(m2.innerVector(j0), refMat2.col(j0)); in sparse_basic() 179 VERIFY_IS_APPROX(m2.innerVector(j0)+m2.innerVector(j1), refMat2.row(j0)+refMat2.row(j1)); in sparse_basic() 181 VERIFY_IS_APPROX(m2.innerVector(j0)+m2.innerVector(j1), refMat2.col(j0)+refMat2.col(j1)); in sparse_basic() 214 Index j0 = internal::random<Index>(0,rows-2); in sparse_basic() local 216 Index n0 = internal::random<Index>(1,rows-(std::max)(j0,j1)); in sparse_basic() 218 VERIFY_IS_APPROX(m2.innerVectors(j0,n0), refMat2.block(j0,0,n0,cols)); in sparse_basic() 220 VERIFY_IS_APPROX(m2.innerVectors(j0,n0), refMat2.block(0,j0,rows,n0)); in sparse_basic() 222 VERIFY_IS_APPROX(m2.innerVectors(j0,n0)+m2.innerVectors(j1,n0), in sparse_basic() [all …]
|
D | sparseqr.cpp | 27 int j0 = 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/svox/pico/lib/ |
D | picofftsg.c | 670 picoos_int32 j0, k0, j1, k1, l, m, i, j, k, nh, m2; in bitrv2() local 680 j0 = 0; in bitrv2() 683 for (j = j0; j < j0 + k0; j += 4) { in bitrv2() 846 k1 = j0 + k0; in bitrv2() 907 for (i = nh >> 1; i > (j0 ^= i); i >>= 1) { in bitrv2() 912 j0 = 0; in bitrv2() 915 for (j = j0; j < j0 + k0; j += 4) { in bitrv2() 998 k1 = j0 + k0; in bitrv2() 1019 for (i = nh >> 1; i > (j0 ^= i); i >>= 1){ in bitrv2() 1029 picoos_int32 j0, k0, j1, k1, l, m, i, j, k, nh, m2; in bitrv2conj() local [all …]
|
/external/eigen/test/eigen2/ |
D | eigen2_sparse_basic.cpp | 239 int j0 = ei_random(0,rows-1); in sparse_basic() local 241 VERIFY_IS_APPROX(m2.innerVector(j0), refMat2.col(j0)); in sparse_basic() 242 VERIFY_IS_APPROX(m2.innerVector(j0)+m2.innerVector(j1), refMat2.col(j0)+refMat2.col(j1)); in sparse_basic() 253 int j0 = ei_random(0,rows-2); in sparse_basic() local 255 int n0 = ei_random<int>(1,rows-std::max(j0,j1)); in sparse_basic() 256 VERIFY_IS_APPROX(m2.innerVectors(j0,n0), refMat2.block(0,j0,rows,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()
|
/external/llvm/test/Feature/ |
D | testlogical.ll | 5 define i32 @simpleAdd(i32 %i0, i32 %j0) { 6 %t1 = xor i32 %i0, %j0 ; <i32> [#uses=1] 7 %t2 = or i32 %i0, %j0 ; <i32> [#uses=1]
|
D | testconstants.ll | 9 define [2 x i32]* @testfunction(i32 %i0, i32 %j0) {
|
D | testalloca.ll | 8 define i32 @testfunction(i32 %i0, i32 %j0) {
|
/external/mesa3d/src/mesa/swrast/ |
D | s_texfilter.c | 555 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() 584 *j0 = tex_array_slice(texcoord[1], height); 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() 1167 j0 += img->Border; in sample_2d_linear() 1173 if (j0 < 0 || j0 >= height) useBorderColor |= J0BIT; in sample_2d_linear() [all …]
|
/external/libvpx/libvpx/vpx_dsp/ |
D | fastssim.c | 149 int j0; in fs_downsample_level0() local 151 j0 = 2 * j; in fs_downsample_level0() 152 j1 = FS_MINI(j0 + 1, _h); in fs_downsample_level0() 158 dst1[j * w + i] = _src1[j0 * _s1ystride + i0] in fs_downsample_level0() 159 + _src1[j0 * _s1ystride + i1] + _src1[j1 * _s1ystride + i0] in fs_downsample_level0() 161 dst2[j * w + i] = _src2[j0 * _s2ystride + i0] in fs_downsample_level0() 162 + _src2[j0 * _s2ystride + i1] + _src2[j1 * _s2ystride + i0] in fs_downsample_level0()
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
D | ECAlgorithms.java | 411 int j0 = i << 1, j1 = j0 + 1; 413 BigInteger kj0 = ks[j0]; negs[j0] = kj0.signum() < 0; kj0 = kj0.abs(); 419 infos[j0] = WNafUtil.getWNafPreCompInfo(P); 421 wnafs[j0] = WNafUtil.generateWindowNaf(width, kj0);
|
/external/deqp/framework/common/ |
D | tcuTexCompareVerifier.cpp | 672 for (int j0 = minJ0; j0 <= maxJ0; j0++) in isNearestMipmapLinearCompareResultValid() local 676 …0 = lookupDepth(level0, sampler, wrap(sampler.wrapS, i0, w0), wrap(sampler.wrapT, j0, h0), coordZ); in isNearestMipmapLinearCompareResultValid() 729 for (int j0 = minJ0; j0 <= maxJ0; j0++) in isLinearMipmapLinearCompareResultValid() local 735 const float minB0 = de::clamp((vBounds0.x()-0.5f)-float(j0), 0.0f, 1.0f); in isLinearMipmapLinearCompareResultValid() 736 const float maxB0 = de::clamp((vBounds0.y()-0.5f)-float(j0), 0.0f, 1.0f); in isLinearMipmapLinearCompareResultValid() 742 const int y0 = wrap(sampler.wrapT, j0 , h0); in isLinearMipmapLinearCompareResultValid() 743 const int y1 = wrap(sampler.wrapT, j0+1, h0); in isLinearMipmapLinearCompareResultValid() 911 for (int j0 = minJ0; j0 <= maxJ0; j0++) in isSeamplessLinearMipmapLinearCompareResultValid() local 917 const float minB0 = de::clamp((vBounds0.x()-0.5f)-float(j0), 0.0f, 1.0f); in isSeamplessLinearMipmapLinearCompareResultValid() 918 const float maxB0 = de::clamp((vBounds0.y()-0.5f)-float(j0), 0.0f, 1.0f); in isSeamplessLinearMipmapLinearCompareResultValid() [all …]
|
D | tcuTexLookupVerifier.cpp | 814 for (int j0 = minJ0; j0 <= maxJ0; j0++) in isNearestMipmapLinearSampleResultValid() local 822 …= lookup<float>(level0, sampler, wrap(sampler.wrapS, i0, w0), wrap(sampler.wrapT, j0, h0), coordZ); in isNearestMipmapLinearSampleResultValid() 873 for (int j0 = minJ0; j0 <= maxJ0; j0++) in isNearestMipmapLinearSampleResultValid() local 883 …p<float>(level0, sampler, wrap(sampler.wrapS, i0, w0), wrap(sampler.wrapT, j0, h0), wrap(sampler.w… in isNearestMipmapLinearSampleResultValid() 1010 for (int j0 = minJ0; j0 <= maxJ0; j0++) in isLinearMipmapLinearSampleResultValid() local 1020 const int y0 = wrap(sampler.wrapT, j0 , h0); in isLinearMipmapLinearSampleResultValid() 1021 const int y1 = wrap(sampler.wrapT, j0+1, h0); in isLinearMipmapLinearSampleResultValid() 1032 const float minB0 = de::clamp((vBounds0.x()-0.5f)-float(j0), 0.0f, 1.0f); in isLinearMipmapLinearSampleResultValid() 1033 const float maxB0 = de::clamp((vBounds0.y()-0.5f)-float(j0), 0.0f, 1.0f); in isLinearMipmapLinearSampleResultValid() 1117 for (int j0 = minJ0; j0 <= maxJ0; j0++) in isLinearMipmapLinearSampleResultValid() local [all …]
|
D | tcuFuzzyImageCompare.cpp | 134 int j0 = de::clamp(y0, 0, h-1); in bilinearSample() local 140 deUint32 p00 = readUnorm8<NumChannels>(src, i0, j0); in bilinearSample() 141 deUint32 p10 = readUnorm8<NumChannels>(src, i1, j0); in bilinearSample()
|
/external/openssh/openbsd-compat/ |
D | chacha_private.h | 92 u32 j0, j1, j2, j3, j4, j5, j6, j7, j8, j9, j10, j11, j12, j13, j14, j15; in chacha_encrypt_bytes() local 99 j0 = x->input[0]; in chacha_encrypt_bytes() 123 x0 = j0; in chacha_encrypt_bytes() 149 x0 = PLUS(x0,j0); in chacha_encrypt_bytes()
|
/external/openssh/ |
D | chacha.c | 93 u32 j0, j1, j2, j3, j4, j5, j6, j7, j8, j9, j10, j11, j12, j13, j14, j15; in chacha_encrypt_bytes() local 100 j0 = x->input[0]; in chacha_encrypt_bytes() 124 x0 = j0; in chacha_encrypt_bytes() 150 x0 = PLUS(x0,j0); in chacha_encrypt_bytes()
|
/external/v8/benchmarks/ |
D | navier-stokes.js | 225 var j0 = y | 0; 226 var j1 = j0 + 1; 229 var t1 = y - j0; 231 var row1 = j0 * rowSize;
|
/external/clang/test/SemaCXX/ |
D | address-of-temporary.cpp | 46 void j0() { (void)S { Y().a }; } in j0() function
|
/external/llvm/test/Transforms/LoopDeletion/ |
D | dcetest.ll | 6 define i32 @"test function"(i32 %i0, i32 %j0) {
|
/external/llvm/test/Transforms/SCCP/ |
D | sccptest.ll | 24 define i32 @test2(i32 %i0, i32 %j0) {
|