| /external/eigen/test/ |
| D | diagonal.cpp | 34 N2 = MatrixType::RowsAtCompileTime>1 ? -1 : 0 in diagonal() enumerator
41 VERIFY(m1.template diagonal<N2>().RowsAtCompileTime == m1.diagonal(N2).size()); in diagonal()
50 m2.template diagonal<N2>() = 2 * m1.template diagonal<N2>(); in diagonal()
51 m2.template diagonal<N2>()[0] *= 3; in diagonal()
52 …VERIFY_IS_APPROX(m2.template diagonal<N2>()[0], static_cast<Scalar>(6) * m1.template diagonal<N2>(… in diagonal()
59 m2.diagonal(N2) = 2 * m1.diagonal(N2); in diagonal()
60 VERIFY_IS_APPROX(m2.template diagonal<N2>(), static_cast<Scalar>(2) * m1.diagonal(N2)); in diagonal()
61 m2.diagonal(N2)[0] *= 3; in diagonal() local
62 VERIFY_IS_APPROX(m2.diagonal(N2)[0], static_cast<Scalar>(6) * m1.diagonal(N2)[0]); in diagonal()
64 m2.diagonal(N2).x() = s1; in diagonal()
[all …]
|
| D | commainitializer.cpp | 13 template<int M1, int M2, int N1, int N2>
16 Matrix<int, M1+M2, N1+N2> m_fixed; in test_blocks()
17 MatrixXi m_dynamic(M1+M2, N1+N2); in test_blocks()
20 Matrix<int, M1, N2> mat12; mat12.setRandom(); in test_blocks()
22 Matrix<int, M2, N2> mat22; mat22.setRandom(); in test_blocks()
29 VERIFY_IS_EQUAL((m_fixed.template topRightCorner<M1,N2>()), mat12); in test_blocks()
31 VERIFY_IS_EQUAL((m_fixed.template bottomRightCorner<M2,N2>()), mat22); in test_blocks()
|
| /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| D | StringSwitch.h | 112 template<unsigned N0, unsigned N1, unsigned N2>
115 const char (&S2)[N2], const T& Value) { in Cases() argument
119 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3>
122 const char (&S2)[N2], const char (&S3)[N3], in Cases() argument
127 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4>
130 const char (&S2)[N2], const char (&S3)[N3], in Cases() argument
135 template <unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4,
139 const char (&S2)[N2], const char (&S3)[N3], in Cases() argument
145 template <unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4,
149 const char (&S2)[N2], const char (&S3)[N3], in Cases() argument
[all …]
|
| /external/libopus/celt/ |
| D | mdct.c | 68 int N2=N>>1; in clt_mdct_init() local
82 … l->trig = trig = (kiss_twiddle_scalar*)opus_alloc((N-(N2>>maxshift))*sizeof(kiss_twiddle_scalar)); in clt_mdct_init()
90 for (i=0;i<N2;i++) in clt_mdct_init()
91 trig[i] = TRIG_UPSCALE*celt_cos_norm(DIV32(ADD32(SHL32(EXTEND32(i),17),N2+16384),N)); in clt_mdct_init()
93 for (i=0;i<N2;i++) in clt_mdct_init()
97 for (i=0;i<N2;i++) in clt_mdct_init()
100 trig += N2; in clt_mdct_init()
101 N2 >>= 1; in clt_mdct_init()
123 int N, N2, N4; in clt_mdct_forward_c() local
145 N2 = N>>1; in clt_mdct_forward_c()
[all …]
|
| /external/llvm/include/llvm/ADT/ |
| D | StringSwitch.h | 102 template<unsigned N0, unsigned N1, unsigned N2>
105 const char (&S2)[N2], const T& Value) { in Cases() argument
109 (N2-1 == Str.size() && std::memcmp(S2, Str.data(), N2-1) == 0))) { in Cases()
116 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3>
119 const char (&S2)[N2], const char (&S3)[N3], in Cases() argument
124 (N2-1 == Str.size() && std::memcmp(S2, Str.data(), N2-1) == 0) || in Cases()
132 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4>
135 const char (&S2)[N2], const char (&S3)[N3], in Cases() argument
140 (N2-1 == Str.size() && std::memcmp(S2, Str.data(), N2-1) == 0) || in Cases()
|
| /external/clang/test/SemaCXX/ |
| D | out-of-line-def-mismatch.cpp | 3 namespace N2 { namespace
20 void N2::N1::S2::func(S1*) {} // expected-error {{out-of-line definition of 'func' does not match a… in func()
21 void N2::N1::S2::func(C1&, unsigned, const S1*) {} // expected-error {{out-of-line definition of 'f… in func()
22 void N2::N1::S2::func(S1*, double) {} // expected-error {{out-of-line definition of 'func' does not… in func()
23 void N2::N1::S2::func(S1, unsigned) {} // expected-error {{out-of-line definition of 'func' does no… in func()
24 void N2::N1::S2::func(unsigned*, S1*) {} // expected-error {{out-of-line definition of 'func' does … in func()
|
| /external/libopus/celt/arm/ |
| D | celt_ne10_mdct.c | 51 int N, N2, N4; in clt_mdct_forward_neon() local
66 N2 = N>>1; in clt_mdct_forward_neon()
69 ALLOC(f, N2, kiss_fft_scalar); in clt_mdct_forward_neon()
77 const kiss_fft_scalar * OPUS_RESTRICT xp2 = in+N2-1+(overlap>>1); in clt_mdct_forward_neon()
84 *yp++ = MULT16_32_Q15(*wp2, xp1[N2]) + MULT16_32_Q15(*wp1,*xp2); in clt_mdct_forward_neon()
85 *yp++ = MULT16_32_Q15(*wp1, *xp1) - MULT16_32_Q15(*wp2, xp2[-N2]); in clt_mdct_forward_neon()
104 *yp++ = -MULT16_32_Q15(*wp1, xp1[-N2]) + MULT16_32_Q15(*wp2, *xp2); in clt_mdct_forward_neon()
105 *yp++ = MULT16_32_Q15(*wp2, *xp1) + MULT16_32_Q15(*wp1, xp2[N2]); in clt_mdct_forward_neon()
140 kiss_fft_scalar * OPUS_RESTRICT yp2 = out+stride*(N2-1); in clt_mdct_forward_neon()
165 int N, N2, N4; in clt_mdct_backward_neon() local
[all …]
|
| /external/libopus/celt/mips/ |
| D | mdct_mipsr1.h | 64 int N, N2, N4; in clt_mdct_forward() local
88 N2 = N>>1; in clt_mdct_forward()
91 ALLOC(f, N2, kiss_fft_scalar); in clt_mdct_forward()
99 const kiss_fft_scalar * OPUS_RESTRICT xp2 = in+N2-1+(overlap>>1); in clt_mdct_forward()
106 *yp++ = S_MUL_ADD(*wp2, xp1[N2],*wp1,*xp2); in clt_mdct_forward()
107 *yp++ = S_MUL_SUB(*wp1, *xp1,*wp2, xp2[-N2]); in clt_mdct_forward()
126 *yp++ = S_MUL_SUB(*wp2, *xp2, *wp1, xp1[-N2]); in clt_mdct_forward()
127 *yp++ = S_MUL_ADD(*wp2, *xp1, *wp1, xp2[N2]); in clt_mdct_forward()
167 kiss_fft_scalar * OPUS_RESTRICT yp2 = out+stride*(N2-1); in clt_mdct_forward()
190 int N, N2, N4; in clt_mdct_backward() local
[all …]
|
| /external/clang/test/Modules/Inputs/ |
| D | namespaces-right.h | 10 namespace N2 { }
12 namespace N2 { }
14 namespace N2 { }
16 namespace N2 { }
18 namespace N2 {
|
| /external/clang/test/SemaTemplate/ |
| D | temp_explicit.cpp | 75 namespace N2 { namespace
92 template struct N2::X5<void>::Inner2;
94 using namespace N2;
101 …template struct N2::X5<int>::Inner2; // expected-warning {{explicit instantiation of 'Inner2' not …
145 namespace N2 { namespace
|
| D | instantiate-expr-3.cpp | 25 namespace N2 { namespace
42 template struct N2::PlusEquals0<N1::X, int, int&>;
43 template struct N2::PlusEquals0<N1::X, long, long&>;
44 template struct N2::PlusEquals0<N3::Y, long, short&>;
45 template struct N2::PlusEquals0<int, int, int&>;
46 template struct N2::PlusEquals0<N3::Y, int, short&>; // expected-note{{instantiation}}
|
| /external/llvm/unittests/IR/ |
| D | MDBuilderTest.cpp | 87 MDNode *N2 = MDHelper.createTBAANode("Node", R, true); in TEST_F() local
91 EXPECT_NE(N0, N2); in TEST_F()
94 EXPECT_GE(N2->getNumOperands(), 3U); in TEST_F()
97 EXPECT_TRUE(isa<MDString>(N2->getOperand(0))); in TEST_F()
100 EXPECT_EQ(cast<MDString>(N2->getOperand(0))->getString(), "Node"); in TEST_F()
103 EXPECT_EQ(N2->getOperand(1), R); in TEST_F()
104 EXPECT_TRUE(mdconst::hasa<ConstantInt>(N2->getOperand(2))); in TEST_F()
105 EXPECT_EQ(mdconst::extract<ConstantInt>(N2->getOperand(2))->getZExtValue(), in TEST_F()
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| D | StringSwitch.h | 90 template<unsigned N0, unsigned N1, unsigned N2>
92 const char (&S2)[N2], const T& Value) { in Cases() argument
96 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3>
98 const char (&S2)[N2], const char (&S3)[N3], in Cases() argument
103 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4>
105 const char (&S2)[N2], const char (&S3)[N3], in Cases() argument
|
| /external/arm-neon-tests/ |
| D | ref_vqdmulh_lane.c | 42 #define TEST_VQDMULH_LANE2(INSN, Q, T1, T2, W, N, N2, L) \ in FNNAME() argument
46 VECT_VAR(vector2, T1, W, N2), \ in FNNAME()
54 #define TEST_VQDMULH_LANE1(INSN, Q, T1, T2, W, N, N2, L) \ in FNNAME() argument
55 TEST_VQDMULH_LANE2(INSN, Q, T1, T2, W, N, N2, L) in FNNAME()
57 #define TEST_VQDMULH_LANE(Q, T1, T2, W, N, N2, L) \ in FNNAME() argument
58 TEST_VQDMULH_LANE1(INSN, Q, T1, T2, W, N, N2, L) in FNNAME()
|
| D | ref_vqrdmulh_lane.c | 43 #define TEST_VQRDMULH_LANE2(INSN, Q, T1, T2, W, N, N2, L) \ in FNNAME() argument
47 VECT_VAR(vector2, T1, W, N2), \ in FNNAME()
55 #define TEST_VQRDMULH_LANE1(INSN, Q, T1, T2, W, N, N2, L) \ in FNNAME() argument
56 TEST_VQRDMULH_LANE2(INSN, Q, T1, T2, W, N, N2, L) in FNNAME()
58 #define TEST_VQRDMULH_LANE(Q, T1, T2, W, N, N2, L) \ in FNNAME() argument
59 TEST_VQRDMULH_LANE1(INSN, Q, T1, T2, W, N, N2, L) in FNNAME()
|
| D | ref_vpaddl.c | 43 #define TEST_VPADDL1(INSN, Q, T1, T2, W, N, W2, N2) \ in FNNAME() argument
44 VECT_VAR(vector_res, T1, W2, N2) = \ in FNNAME()
46 vst1##Q##_##T2##W2(VECT_VAR(result, T1, W2, N2), \ in FNNAME()
47 VECT_VAR(vector_res, T1, W2, N2)) in FNNAME()
49 #define TEST_VPADDL(INSN, Q, T1, T2, W, N, W2, N2) \ in FNNAME() argument
50 TEST_VPADDL1(INSN, Q, T1, T2, W, N, W2, N2) in FNNAME()
|
| D | ref_vpadal.c | 43 #define TEST_VPADAL1(INSN, Q, T1, T2, W, N, W2, N2) \ in FNNAME() argument
44 VECT_VAR(vector_res, T1, W2, N2) = \ in FNNAME()
45 INSN##Q##_##T2##W(VECT_VAR(vector, T1, W2, N2), VECT_VAR(vector2, T1, W, N)); \ in FNNAME()
46 vst1##Q##_##T2##W2(VECT_VAR(result, T1, W2, N2), \ in FNNAME()
47 VECT_VAR(vector_res, T1, W2, N2)) in FNNAME()
49 #define TEST_VPADAL(INSN, Q, T1, T2, W, N, W2, N2) \ in FNNAME() argument
50 TEST_VPADAL1(INSN, Q, T1, T2, W, N, W2, N2) in FNNAME()
|
| /external/eigen/bench/btl/libs/BLAS/ |
| D | blas_interface_impl.hh | 67 int N2 = N*N; in cholesky() local
68 BLAS_FUNC(copy)(&N2, X, &intone, C, &intone); in cholesky()
76 int N2 = N*N; in partial_lu_decomp() local
77 BLAS_FUNC(copy)(&N2, X, &intone, C, &intone); in partial_lu_decomp()
101 int N2 = N*N; in lu_decomp() local
102 BLAS_FUNC(copy)(&N2, X, &intone, C, &intone); in lu_decomp()
113 int N2 = N*N; in hessenberg() local
115 BLAS_FUNC(copy)(&N2, X, &inc, C, &inc); in hessenberg()
129 int N2 = N*N; in tridiagonalization() local
131 BLAS_FUNC(copy)(&N2, X, &inc, C, &inc); in tridiagonalization()
|
| /external/clang/test/CodeGenCXX/ |
| D | copy-assign-synthesis-1.cpp | 38 N() : N1(20), N2(21) {} in N()
40 int N2; member
42 printf("N1 = %d N2 = %d\n", N1, N2); in pr()
49 N1 = arg.N1; N2 = arg.N2; in operator =()
|
| /external/libcxx/test/std/numerics/numarray/template.mask.array/mask.array.assign/ |
| D | mask_array.pass.cpp | 27 const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); in main() local
28 bool b2[N2] = {true, false, true, true, in main()
31 const std::valarray<int> v2(a2, N2); in main()
33 std::valarray<bool> vb2(b2, N2); in main()
|
| /external/valgrind/memcheck/tests/ |
| D | long_namespace_xml.cpp | 19 #define N2 ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJ… macro
34 namespace N2 { namespace
45 N1::N2::f(); in main()
|
| /external/libcxx/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/ |
| D | or.pass.cpp | 28 const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); in main() local
29 std::size_t s[N2] = { 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, in main()
32 std::valarray<int> v2(a2, N2); in main()
33 std::valarray<std::size_t> ia(s, N2); in main()
|
| D | subtraction.pass.cpp | 28 const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); in main() local
29 std::size_t s[N2] = { 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, in main()
32 std::valarray<int> v2(a2, N2); in main()
33 std::valarray<std::size_t> ia(s, N2); in main()
|
| D | modulo.pass.cpp | 28 const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); in main() local
29 std::size_t s[N2] = { 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, in main()
32 std::valarray<int> v2(a2, N2); in main()
33 std::valarray<std::size_t> ia(s, N2); in main()
|
| D | shift_right.pass.cpp | 28 const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); in main() local
29 std::size_t s[N2] = { 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, in main()
32 std::valarray<int> v2(a2, N2); in main()
33 std::valarray<std::size_t> ia(s, N2); in main()
|