| /external/clang/test/SemaCXX/ |
| D | complex-folding.cpp | 1 // RUN: %clang_cc1 %s -std=c++1z -fsyntax-only -verify
5 static_assert((0.0 + 0.0j) == (0.0 + 0.0j));
6 static_assert((0.0 + 0.0j) != (0.0 + 0.0j)); // expected-error {{static_assert}}
8 static_assert((0.0 + 0.0j) == 0.0);
9 static_assert(0.0 == (0.0 + 0.0j));
10 static_assert(0.0 == 0.0j);
11 static_assert((0.0 + 1.0j) != 0.0);
12 static_assert(1.0 != (0.0 + 0.0j));
13 static_assert(0.0 != 1.0j);
17 static_assert((1.0 + 0.0j) == (0.0 + 0.0j)); // expected-error {{static_assert}}
[all …]
|
| /external/mesa3d/src/gallium/drivers/softpipe/ |
| D | sp_quad_depth_test.c | 21 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
62 unsigned j; in get_depth_stencil_values() local
63 const struct softpipe_cached_tile *tile = data->tile; in get_depth_stencil_values()
65 switch (data->format) { in get_depth_stencil_values()
67 for (j = 0; j < TGSI_QUAD_SIZE; j++) { in get_depth_stencil_values()
68 int x = quad->input.x0 % TILE_SIZE + (j & 1); in get_depth_stencil_values()
69 int y = quad->input.y0 % TILE_SIZE + (j >> 1); in get_depth_stencil_values()
70 data->bzzzz[j] = tile->data.depth16[y][x]; in get_depth_stencil_values()
74 for (j = 0; j < TGSI_QUAD_SIZE; j++) { in get_depth_stencil_values()
75 int x = quad->input.x0 % TILE_SIZE + (j & 1); in get_depth_stencil_values()
[all …]
|
| /external/mesa3d/src/mesa/tnl/ |
| D | t_vb_rendertmp.h | 2 * Mesa 3-D graphics library
5 * Copyright (C) 1999-2005 Brian Paul All Rights Reserved.
78 GLuint j; in TAG() local
83 for (j=start+1; j<count; j+=2 ) { in TAG()
85 if (ctx->Light.ProvokingVertex == GL_LAST_VERTEX_CONVENTION_EXT) in TAG()
86 RENDER_LINE( ELT(j-1), ELT(j) ); in TAG()
88 RENDER_LINE( ELT(j), ELT(j-1) ); in TAG()
99 GLuint j; in TAG() local
109 for (j=start+1; j<count; j++ ) { in TAG()
110 if (ctx->Light.ProvokingVertex == GL_LAST_VERTEX_CONVENTION_EXT) in TAG()
[all …]
|
| /external/libcxx/test/std/containers/sequences/vector/vector.modifiers/ |
| D | push_back.pass.cpp | 1 //===----------------------------------------------------------------------===//
8 //===----------------------------------------------------------------------===//
27 for (int j = 0; j < c.size(); ++j) in main() local
28 assert(c[j] == j); in main()
32 for (int j = 0; j < c.size(); ++j) in main() local
33 assert(c[j] == j); in main()
37 for (int j = 0; j < c.size(); ++j) in main() local
38 assert(c[j] == j); in main()
42 for (int j = 0; j < c.size(); ++j) in main() local
43 assert(c[j] == j); in main()
[all …]
|
| D | push_back_rvalue.pass.cpp | 1 //===----------------------------------------------------------------------===//
8 //===----------------------------------------------------------------------===//
29 for (int j = 0; j < c.size(); ++j) in main() local
30 assert(c[j] == MoveOnly(j)); in main()
34 for (int j = 0; j < c.size(); ++j) in main() local
35 assert(c[j] == MoveOnly(j)); in main()
39 for (int j = 0; j < c.size(); ++j) in main() local
40 assert(c[j] == MoveOnly(j)); in main()
44 for (int j = 0; j < c.size(); ++j) in main() local
45 assert(c[j] == MoveOnly(j)); in main()
[all …]
|
| D | insert_iter_size_value.pass.cpp | 1 //===----------------------------------------------------------------------===//
8 //===----------------------------------------------------------------------===//
32 int j; in main() local
33 for (j = 0; j < 10; ++j) in main()
34 assert(v[j] == 0); in main()
35 for (; j < 15; ++j) in main()
36 assert(v[j] == 1); in main()
37 for (++j; j < 105; ++j) in main()
38 assert(v[j] == 0); in main()
48 int j; in main() local
[all …]
|
| D | insert_iter_iter_iter.pass.cpp | 1 //===----------------------------------------------------------------------===//
8 //===----------------------------------------------------------------------===//
37 int j; in main() local
38 for (j = 0; j < 10; ++j) in main()
39 assert(v[j] == 0); in main()
40 for (int k = 0; k < N; ++j, ++k) in main()
41 assert(v[j] == a[k]); in main()
42 for (; j < 105; ++j) in main()
43 assert(v[j] == 0); in main()
54 int j; in main() local
[all …]
|
| /external/webrtc/src/modules/audio_processing/utility/ |
| D | fft4g.c | 2 * http://www.kurims.kyoto-u.ac.jp/~ooura/fft.html
3 * Copyright Takuya OOURA, 1996-2001
27 dfst: Sine Transform of RDFT (Real Anti-symmetric DFT)
37 -------- Complex DFT (Discrete Fourier Transform) --------
40 X[k] = sum_j=0^n-1 x[j]*exp(2*pi*i*j*k/n), 0<=k<n
42 X[k] = sum_j=0^n-1 x[j]*exp(-2*pi*i*j*k/n), 0<=k<n
43 (notes: sum_j=0^n-1 is a summation from j=0 to n-1)
50 cdft(2*n, -1, a, ip, w);
54 a[0...2*n-1] :input/output data (float *)
56 a[2*j] = Re(x[j]),
[all …]
|
| /external/opencv/cv/src/ |
| D | cvutils.cpp | 61 eltype = CV_MAT_TYPE( mat->type ); in cvPointSeqFromMat()
67 if( (mat->width != 1 && mat->height != 1) || !CV_IS_MAT_CONT(mat->type)) in cvPointSeqFromMat()
70 "1-dimensional and continuous" ); in cvPointSeqFromMat()
74 sizeof(CvContour), CV_ELEM_SIZE(eltype), mat->data.ptr, in cvPointSeqFromMat()
75 mat->width*mat->height, (CvSeq*)contour_header, block )); in cvPointSeqFromMat()
116 int i, j; in icvCopyReplicateBorder_8u() local
166 for( j = 0; j < srcroi.width; j++ ) in icvCopyReplicateBorder_8u()
167 idst[j + left] = isrc[j]; in icvCopyReplicateBorder_8u()
168 for( j = left - 1; j >= 0; j-- ) in icvCopyReplicateBorder_8u()
169 idst[j] = idst[j + cn]; in icvCopyReplicateBorder_8u()
[all …]
|
| /external/cblas/testing/ |
| D | c_sblas2.c | 16 int i,j,LDA; in F77_sgemv() local
24 for( j=0; j<*n; j++ ) in F77_sgemv()
25 A[ LDA*i+j ]=a[ (*lda)*j+i ]; in F77_sgemv()
42 int i,j,LDA; in F77_sger() local
49 for( j=0; j<*n; j++ ) in F77_sger()
50 A[ LDA*i+j ]=a[ (*lda)*j+i ]; in F77_sger()
55 for( j=0; j<*n; j++ ) in F77_sger()
56 a[ (*lda)*j+i ]=A[ LDA*i+j ]; in F77_sger()
66 int i,j,LDA; in F77_strmv() local
79 for( j=0; j<*n; j++ ) in F77_strmv()
[all …]
|
| D | c_dblas2.c | 16 int i,j,LDA; in F77_dgemv() local
24 for( j=0; j<*n; j++ ) in F77_dgemv()
25 A[ LDA*i+j ]=a[ (*lda)*j+i ]; in F77_dgemv()
42 int i,j,LDA; in F77_dger() local
49 for( j=0; j<*n; j++ ) in F77_dger()
50 A[ LDA*i+j ]=a[ (*lda)*j+i ]; in F77_dger()
55 for( j=0; j<*n; j++ ) in F77_dger()
56 a[ (*lda)*j+i ]=A[ LDA*i+j ]; in F77_dger()
66 int i,j,LDA; in F77_dtrmv() local
79 for( j=0; j<*n; j++ ) in F77_dtrmv()
[all …]
|
| D | c_cblas2.c | 17 int i,j,LDA; in F77_cgemv() local
25 for( j=0; j<*n; j++ ){ in F77_cgemv()
26 A[ LDA*i+j ].real=a[ (*lda)*j+i ].real; in F77_cgemv()
27 A[ LDA*i+j ].imag=a[ (*lda)*j+i ].imag; in F77_cgemv()
47 int i,j,irow,jcol,LDA; in F77_cgbmv() local
55 irow=*ku+*kl-i; in F77_cgbmv()
56 jcol=(*ku)-i; in F77_cgbmv()
57 for( j=jcol; j<*n; j++ ){ in F77_cgbmv()
58 A[ LDA*(j-jcol)+irow ].real=a[ (*lda)*j+i ].real; in F77_cgbmv()
59 A[ LDA*(j-jcol)+irow ].imag=a[ (*lda)*j+i ].imag; in F77_cgbmv()
[all …]
|
| D | c_zblas2.c | 17 int i,j,LDA; in F77_zgemv() local
25 for( j=0; j<*n; j++ ){ in F77_zgemv()
26 A[ LDA*i+j ].real=a[ (*lda)*j+i ].real; in F77_zgemv()
27 A[ LDA*i+j ].imag=a[ (*lda)*j+i ].imag; in F77_zgemv()
47 int i,j,irow,jcol,LDA; in F77_zgbmv() local
55 irow=*ku+*kl-i; in F77_zgbmv()
56 jcol=(*ku)-i; in F77_zgbmv()
57 for( j=jcol; j<*n; j++ ){ in F77_zgbmv()
58 A[ LDA*(j-jcol)+irow ].real=a[ (*lda)*j+i ].real; in F77_zgbmv()
59 A[ LDA*(j-jcol)+irow ].imag=a[ (*lda)*j+i ].imag; in F77_zgbmv()
[all …]
|
| /external/opencv/cxcore/src/ |
| D | cxsvd.cpp | 58 _y[_i] = -t0*s + t1*c; \
68 int i, j; in icvMatrAXPY_64f() local
74 for( j = 0; j <= n - 4; j += 4 ) in icvMatrAXPY_64f()
76 double t0 = y[j] + s*x[j]; in icvMatrAXPY_64f()
77 double t1 = y[j+1] + s*x[j+1]; in icvMatrAXPY_64f()
78 y[j] = t0; in icvMatrAXPY_64f()
79 y[j+1] = t1; in icvMatrAXPY_64f()
80 t0 = y[j+2] + s*x[j+2]; in icvMatrAXPY_64f()
81 t1 = y[j+3] + s*x[j+3]; in icvMatrAXPY_64f()
82 y[j+2] = t0; in icvMatrAXPY_64f()
[all …]
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/pkb/en-US/ |
| D | en-US_klex.pkb | 3 …-�cou.�cre/�dag0�dec1�def2�del3�dep4�des5�dev6�dir7�dis8�dis9�dis:�dra;�eac<�ele=�ene>�esc?�eve@�e…
6 )K!+F?%CP!GL()D!;>LH'J!;F1'K+K))J!6LH'J!;F1'K+K* )!IKL'J+KC+)HD!4K,)C!(E'-)@!6>'F.)!9(…
9 $!Q,#JG#">.J05
11 …/ "!@4F#9J'9110\o/"!L;F111 $+#"D;#O'F11\o/ "+#!D;#O'F112$!LP;DO12\o/ "!LP;D>1��13 $"1$J#!L…
12 ""=#!LAF119 $"F6F#!LAF19\o/ ""F6F#!LAF11\o/"!>$JKL1hnd\/$!P4F#"@4F#9J'92$!LN20
13 $!LP;F#La2000\o/""LN#!17#Q'F91200\o/"!LN#"@4F#9J'9120\o/
14 …""LP;F#LA#!K;#C'F923$"LP;F#La#!1JA23\o/""LP;F#LA#!1$J924$"LP;F#La#!>.J24\o/""LP;F#LA#!>.J…
15 …2hnd\/$!LN#"@4F#9J'93$!1JA30 $!1$J#La3000\o/""1JA#!17#Q'F91300\o/"!1JA#"@4F#9J'9130\o/ "!…
16 $"1$J#La#!LN32\o/""1$J#LA#!K;#C'F933$"1$J#La#!1JA33\o/""1$J#LA#!1$J934$"1$J#La#!>.J34\o/"…
|
| /external/valgrind/none/tests/amd64/ |
| D | fma.c | 27 int res = 0, i, j; in test_fmaf() local
48 thisres |= testf( -w, ft.expected[i] ); in test_fmaf()
50 thisres |= testf( -w, ft.expected[i] ); in test_fmaf()
52 thisres |= testf( -w, ft.expected[i] ); in test_fmaf()
54 thisres |= testf( -w, ft.expected[i] ); in test_fmaf()
56 thisres |= testf( -w, ft.expected[i] ); in test_fmaf()
58 thisres |= testf( -w, ft.expected[i] ); in test_fmaf()
64 ft.z[i] = -ft.z[i]; in test_fmaf()
84 thisres |= testf( -w, ft.expected[i] ); in test_fmaf()
86 thisres |= testf( -w, ft.expected[i] ); in test_fmaf()
[all …]
|
| /external/mesa3d/src/mesa/drivers/dri/i915/ |
| D | i915_debug.c | 20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
38 GLuint *ptr = (GLuint *)(stream->ptr + stream->offset); in debug()
41 printf("Error - zero length packet (0x%08x)\n", stream->ptr[0]); in debug()
46 if (stream->print_addresses) in debug()
47 printf("%08x: ", stream->offset); in debug()
55 stream->offset += len * sizeof(GLuint); in debug()
84 GLuint *ptr = (GLuint *)(stream->ptr + stream->offset); in debug_prim()
102 stream->offset += len * sizeof(GLuint); in debug_prim()
113 GLuint *ptr = (GLuint *)(stream->ptr + stream->offset); in debug_program()
116 printf("Error - zero length packet (0x%08x)\n", stream->ptr[0]); in debug_program()
[all …]
|
| /external/valgrind/none/tests/s390x/ |
| D | pfpo.c | 46 /* Test BFP <-> DFP conversions */
50 uint8_t i, j; in main() local
82 /* f32 -> d32 */ in main()
83 for(j = 0; j < 3; j++) { in main()
84 printf("f32 -> d32: round=%x ", i); in main()
85 printf("%f -> ", f32_in[j]); in main()
86 d32 = PFPO(f32_in[j], float, _Decimal32, PFPO_F32_TO_D32, in main()
92 /* f32 -> d64 */ in main()
93 for(j = 0; j < 3; j++) { in main()
94 printf("f32 -> d64: round=%x ", i); in main()
[all …]
|
| /external/openssh/ |
| D | smult_curve25519_ref.c | 6 Derived from public domain code by D. J. Bernstein.
13 unsigned int j; in add() local
16 for (j = 0;j < 31;++j) { u += a[j] + b[j]; out[j] = u & 255; u >>= 8; } in add()
22 unsigned int j; in sub() local
25 for (j = 0;j < 31;++j) { in sub()
26 u += a[j] + 65280 - b[j]; in sub()
27 out[j] = u & 255; in sub()
30 u += a[31] - b[31]; in sub()
36 unsigned int j; in squeeze() local
39 for (j = 0;j < 31;++j) { u += a[j]; a[j] = u & 255; u >>= 8; } in squeeze()
[all …]
|
| /external/speex/libspeex/ |
| D | cb_search.c | 1 /* Copyright (C) 2002-2006 Jean-Marc Valin
8 - Redistributions of source code must retain the above copyright
11 - Redistributions in binary form must reproduce the above copyright
15 - Neither the name of the Xiph.org Foundation nor the names of its
55 int i, j, k; in compute_weighted_codebook() local
68 for(j=0;j<subvect_size;j++) in compute_weighted_codebook()
72 for (k=0;k<=j;k++) in compute_weighted_codebook()
73 resj = MAC16_16(resj,shape[k],r[j-k]); in compute_weighted_codebook()
81 res[j] = res16; in compute_weighted_codebook()
82 /*printf ("%d\n", (int)res[j]);*/ in compute_weighted_codebook()
[all …]
|
| /external/libopus/celt/ |
| D | rate.c | 1 /* Copyright (c) 2007-2008 CSIRO
2 Copyright (c) 2007-2009 Xiph.Org Foundation
3 Written by Jean-Marc Valin */
9 - Redistributions of source code must retain the above copyright
12 - Redistributions in binary form must reproduce the above copyright
52 /*Determines if V(N,K) fits in a 32-bit unsigned integer.
77 int j; in compute_pulse_cache() local
81 const opus_int16 *eBands = m->eBands; in compute_pulse_cache()
82 PulseCache *cache = &m->cache; in compute_pulse_cache()
87 cindex = (opus_int16 *)opus_alloc(sizeof(cache->index[0])*m->nbEBands*(LM+2)); in compute_pulse_cache()
[all …]
|
| /external/libcxx/test/std/containers/sequences/vector.bool/ |
| D | insert_iter_size_value.pass.cpp | 1 //===----------------------------------------------------------------------===//
8 //===----------------------------------------------------------------------===//
27 int j; in main() local
28 for (j = 0; j < 10; ++j) in main()
29 assert(v[j] == 0); in main()
30 for (; j < 15; ++j) in main()
31 assert(v[j] == 1); in main()
32 for (++j; j < v.size(); ++j) in main()
33 assert(v[j] == 0); in main()
42 int j; in main() local
[all …]
|
| /external/eigen/blas/fortran/ |
| D | ztbmv.f | 13 * ZTBMV performs one of the matrix-vector operations
17 * where x is an n element vector and A is an n by n unit, or non-unit,
23 * UPLO - CHARACTER*1.
33 * TRANS - CHARACTER*1.
45 * DIAG - CHARACTER*1.
56 * N - INTEGER.
61 * K - INTEGER.
63 * super-diagonals of the matrix A.
65 * sub-diagonals of the matrix A.
69 * A - COMPLEX*16 array of DIMENSION ( LDA, n ).
[all …]
|
| D | ctbmv.f | 13 * CTBMV performs one of the matrix-vector operations
17 * where x is an n element vector and A is an n by n unit, or non-unit,
23 * UPLO - CHARACTER*1.
33 * TRANS - CHARACTER*1.
45 * DIAG - CHARACTER*1.
56 * N - INTEGER.
61 * K - INTEGER.
63 * super-diagonals of the matrix A.
65 * sub-diagonals of the matrix A.
69 * A - COMPLEX array of DIMENSION ( LDA, n ).
[all …]
|
| /external/gtest/include/gtest/internal/ |
| D | gtest-param-util-generated.h.pump | 1 $$ -*- mode: c++; -*-
51 #include "gtest/internal/gtest-param-util.h"
52 #include "gtest/internal/gtest-port.h"
59 // include/gtest/gtest-param-test.h.
84 // No implementation - assignment is unsupported.
92 $range j 1..i
94 template <$for j, [[typename T$j]]>
97 ValueArray$i($for j, [[T$j v$j]]) : $for j, [[v$(j)_(v$j)]] {}
101 const T array[] = {$for j, [[static_cast<T>(v$(j)_)]]};
106 // No implementation - assignment is unsupported.
[all …]
|