| /external/valgrind/main/none/tests/s390x/ |
| D | mul.h | 3 #define MUL_REG_MEM(insn, m1, m2) \ argument
13 : "Q" (m2) \
15 printf(#insn " %16.16lX * %16.16lX = %16.16lX%16.16lX\n", m1, m2, tmp1, tmp2); \
18 #define MUL_REG_REG(insn, m1, m2) \ argument
28 : "d" (m2) \
30 printf(#insn " %16.16lX * %16.16lX = %16.16lX%16.16lX\n", m1, m2, tmp1, tmp2); \
33 #define MUL_REG_IMM(insn, m1, m2) \ argument
39 #insn " 2, " #m2 "\n" \
44 printf(#insn " %16.16lX * %16.16lX = %16.16lX%16.16lX\n", m1, (unsigned long) m2, tmp1, tmp2); \
47 #define MUL_REG_XIMM(insn, m1, um2, m2) \ argument
[all …]
|
| D | mul.c | 18 static void do_regmem_insns(unsigned long m2) in do_regmem_insns() argument
20 memsweep(m, m2); in do_regmem_insns()
21 regsweep(mr, m2); in do_regmem_insns()
22 memsweep(mh, m2); in do_regmem_insns()
23 memsweep(mlg, m2); in do_regmem_insns()
24 regsweep(mlgr, m2); in do_regmem_insns()
25 memsweep(ml, m2); in do_regmem_insns()
26 regsweep(mlr, m2); in do_regmem_insns()
27 memsweep(ms, m2); in do_regmem_insns()
28 regsweep(msr, m2); in do_regmem_insns()
[all …]
|
| D | div.c | 4 static void do_regmem_insns(unsigned long m2) in do_regmem_insns() argument
6 memsweep(d, m2); in do_regmem_insns()
7 regsweep(dr, m2); in do_regmem_insns()
8 memsweep(dl, m2); in do_regmem_insns()
9 regsweep(dlr, m2); in do_regmem_insns()
10 memsweep(dlg, m2); in do_regmem_insns()
11 regsweep(dlgr, m2); in do_regmem_insns()
12 memsweep(dsg, m2); in do_regmem_insns()
13 regsweep(dsgr, m2); in do_regmem_insns()
14 memsweep(dsgf, m2); in do_regmem_insns()
[all …]
|
| /external/eigen/test/ |
| D | vectorwiseop.cpp | 27 m2(rows, cols), in vectorwiseop_array() local
35 m2 = m1; in vectorwiseop_array()
36 m2.colwise() += colvec; in vectorwiseop_array()
37 VERIFY_IS_APPROX(m2, m1.colwise() + colvec); in vectorwiseop_array()
38 VERIFY_IS_APPROX(m2.col(c), m1.col(c) + colvec); in vectorwiseop_array()
40 VERIFY_RAISES_ASSERT(m2.colwise() += colvec.transpose()); in vectorwiseop_array()
43 m2 = m1; in vectorwiseop_array()
44 m2.rowwise() += rowvec; in vectorwiseop_array()
45 VERIFY_IS_APPROX(m2, m1.rowwise() + rowvec); in vectorwiseop_array()
46 VERIFY_IS_APPROX(m2.row(r), m1.row(r) + rowvec); in vectorwiseop_array()
[all …]
|
| D | determinant.cpp | 22 MatrixType m1(size, size), m2(size, size); in determinant() local
24 m2.setRandom(); in determinant()
28 VERIFY_IS_APPROX((m1*m2).eval().determinant(), m1.determinant() * m2.determinant()); in determinant()
35 m2 = m1; in determinant()
36 m2.row(i).swap(m2.row(j)); in determinant()
37 VERIFY_IS_APPROX(m2.determinant(), -m1.determinant()); in determinant()
38 m2 = m1; in determinant()
39 m2.col(i).swap(m2.col(j)); in determinant()
40 VERIFY_IS_APPROX(m2.determinant(), -m1.determinant()); in determinant()
41 VERIFY_IS_APPROX(m2.determinant(), m2.transpose().determinant()); in determinant()
[all …]
|
| D | sparse_basic.cpp | 105 SparseMatrixType m2(rows,cols); in sparse_basic() local
107 m2.reserve(VectorXi::Constant(m2.outerSize(), 2)); in sparse_basic()
114 m2.insert(i,j) = m1(i,j) = internal::random<Scalar>(); in sparse_basic()
117 m2.finalize(); in sparse_basic()
118 VERIFY_IS_APPROX(m2,m1); in sparse_basic()
125 SparseMatrixType m2(rows,cols); in sparse_basic() local
127 m2.reserve(VectorXi::Constant(m2.outerSize(), 2)); in sparse_basic()
133 m2.insert(i,j) = m1(i,j) = internal::random<Scalar>(); in sparse_basic()
137 m2.coeffRef(i,j) += v; in sparse_basic()
141 VERIFY_IS_APPROX(m2,m1); in sparse_basic()
[all …]
|
| D | triangular.cpp | 26 m2 = MatrixType::Random(rows, cols), in triangular_square() local
34 MatrixType m2up = m2.template triangularView<Upper>(); in triangular_square()
40 VERIFY(!m2.isLowerTriangular()); in triangular_square()
54 m1.template triangularView<Upper>() = m2.transpose() + m2; in triangular_square()
55 m3 = m2.transpose() + m2; in triangular_square()
60 m1.template triangularView<Lower>() = m2.transpose() + m2; in triangular_square()
83 …VERIFY(m2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(m2)), large… in triangular_square()
85 …VERIFY(m2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(m2)), l… in triangular_square()
87 VERIFY(m2.isApprox(m3 * (m1.template triangularView<Upper>().solve(m2)), largerEps)); in triangular_square()
89 …VERIFY(m2.isApprox(m3.conjugate() * (m1.conjugate().template triangularView<Lower>().solve(m2)), l… in triangular_square()
[all …]
|
| D | nomalloc.cpp | 44 m2 = MatrixType::Random(rows, cols), in nomalloc() local
52 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2); in nomalloc()
53 VERIFY_IS_APPROX((m1+m2)(r,c), (m1(r,c))+(m2(r,c))); in nomalloc()
55 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2)); in nomalloc()
57 m2.col(0).noalias() = m1 * m1.col(0); in nomalloc()
58 m2.col(0).noalias() -= m1.adjoint() * m1.col(0); in nomalloc()
59 m2.col(0).noalias() -= m1 * m1.row(0).adjoint(); in nomalloc()
60 m2.col(0).noalias() -= m1.adjoint() * m1.row(0).adjoint(); in nomalloc()
62 m2.row(0).noalias() = m1.row(0) * m1; in nomalloc()
63 m2.row(0).noalias() -= m1.row(0) * m1.adjoint(); in nomalloc()
[all …]
|
| D | integer_types.cpp | 31 m2 = MatrixType::Random(rows, cols), in signed_integer_type_tests() local
36 } while(m1 == mzero || m1 == m2); in signed_integer_type_tests()
46 VERIFY_IS_EQUAL(-m2+m1+m2, m1); in signed_integer_type_tests()
47 VERIFY_IS_EQUAL((-m1+m2)*s1, -s1*m1+s1*m2); in signed_integer_type_tests()
67 m2 = MatrixType::Random(rows, cols), in integer_type_tests() local
80 } while(m1 == mzero || m1 == m2); in integer_type_tests()
103 VERIFY(m1!=m2); in integer_type_tests()
104 VERIFY(!(m1==m2)); in integer_type_tests()
106 m1 = m2; in integer_type_tests()
107 VERIFY(m1==m2); in integer_type_tests()
[all …]
|
| D | product_syrk.cpp | 25 m2 = MatrixType::Random(rows, cols), in syrk() local
37 m2.setZero(); in syrk()
38 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()), in syrk()
40 m2.setZero(); in syrk()
41 …VERIFY_IS_APPROX(((m2.template triangularView<Lower>() += s1 * rhs2 * rhs22.adjoint()).nestedExpr… in syrk()
45 m2.setZero(); in syrk()
46 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs2,s1)._expression(), in syrk()
48 m2.setZero(); in syrk()
49 …VERIFY_IS_APPROX((m2.template triangularView<Upper>() += s1 * rhs22 * rhs2.adjoint()).nestedExpres… in syrk()
53 m2.setZero(); in syrk()
[all …]
|
| /external/clang/test/CodeGen/ |
| D | 3dnow-builtins.c | 8 __m64 test_m_pavgusb(__m64 m1, __m64 m2) { in test_m_pavgusb() argument
11 return _m_pavgusb(m1, m2); in test_m_pavgusb()
20 __m64 test_m_pfacc(__m64 m1, __m64 m2) { in test_m_pfacc() argument
23 return _m_pfacc(m1, m2); in test_m_pfacc()
26 __m64 test_m_pfadd(__m64 m1, __m64 m2) { in test_m_pfadd() argument
29 return _m_pfadd(m1, m2); in test_m_pfadd()
32 __m64 test_m_pfcmpeq(__m64 m1, __m64 m2) { in test_m_pfcmpeq() argument
35 return _m_pfcmpeq(m1, m2); in test_m_pfcmpeq()
38 __m64 test_m_pfcmpge(__m64 m1, __m64 m2) { in test_m_pfcmpge() argument
41 return _m_pfcmpge(m1, m2); in test_m_pfcmpge()
[all …]
|
| /external/libcxx/test/containers/associative/multiset/multiset.special/ |
| D | member_swap.pass.cpp | 34 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
36 M m2_save = m2; in main()
37 m1.swap(m2); in main()
39 assert(m2 == m1_save); in main()
57 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
59 M m2_save = m2; in main()
60 m1.swap(m2); in main()
62 assert(m2 == m1_save); in main()
76 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
78 M m2_save = m2; in main()
[all …]
|
| D | non_member_swap.pass.cpp | 33 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
35 M m2_save = m2; in main()
36 swap(m1, m2); in main()
38 assert(m2 == m1_save); in main()
56 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
58 M m2_save = m2; in main()
59 swap(m1, m2); in main()
61 assert(m2 == m1_save); in main()
75 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
77 M m2_save = m2; in main()
[all …]
|
| /external/libcxx/test/containers/associative/set/set.special/ |
| D | member_swap.pass.cpp | 34 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
36 M m2_save = m2; in main()
37 m1.swap(m2); in main()
39 assert(m2 == m1_save); in main()
57 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
59 M m2_save = m2; in main()
60 m1.swap(m2); in main()
62 assert(m2 == m1_save); in main()
76 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
78 M m2_save = m2; in main()
[all …]
|
| D | non_member_swap.pass.cpp | 33 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
35 M m2_save = m2; in main()
36 swap(m1, m2); in main()
38 assert(m2 == m1_save); in main()
56 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
58 M m2_save = m2; in main()
59 swap(m1, m2); in main()
61 assert(m2 == m1_save); in main()
75 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
77 M m2_save = m2; in main()
[all …]
|
| /external/libcxx/test/containers/associative/multimap/multimap.special/ |
| D | non_member_swap.pass.cpp | 37 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
39 M m2_save = m2; in main()
40 swap(m1, m2); in main()
42 assert(m2 == m1_save); in main()
60 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
62 M m2_save = m2; in main()
63 swap(m1, m2); in main()
65 assert(m2 == m1_save); in main()
79 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
81 M m2_save = m2; in main()
[all …]
|
| D | member_swap.pass.cpp | 34 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
36 M m2_save = m2; in main()
37 m1.swap(m2); in main()
39 assert(m2 == m1_save); in main()
57 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
59 M m2_save = m2; in main()
60 m1.swap(m2); in main()
62 assert(m2 == m1_save); in main()
76 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
78 M m2_save = m2; in main()
[all …]
|
| /external/libcxx/test/containers/associative/map/map.special/ |
| D | non_member_swap.pass.cpp | 37 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
39 M m2_save = m2; in main()
40 swap(m1, m2); in main()
42 assert(m2 == m1_save); in main()
60 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
62 M m2_save = m2; in main()
63 swap(m1, m2); in main()
65 assert(m2 == m1_save); in main()
79 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
81 M m2_save = m2; in main()
[all …]
|
| D | member_swap.pass.cpp | 34 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
36 M m2_save = m2; in main()
37 m1.swap(m2); in main()
39 assert(m2 == m1_save); in main()
57 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
59 M m2_save = m2; in main()
60 m1.swap(m2); in main()
62 assert(m2 == m1_save); in main()
76 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
78 M m2_save = m2; in main()
[all …]
|
| /external/libvpx/libvpx/vp9/common/x86/ |
| D | vp9_intrapred_sse2.asm | 48 movq m2, [leftq]
52 psadbw m2, m1
53 paddw m0, m2
77 mova m2, [leftq]
82 psadbw m2, m1
83 paddw m0, m2
84 movhlps m2, m0
85 paddw m0, m2
109 mova m2, [aboveq+16]
116 psadbw m2, m1
[all …]
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/x86/ |
| D | vp9_intrapred_sse2.asm | 48 movq m2, [leftq]
52 psadbw m2, m1
53 paddw m0, m2
77 mova m2, [leftq]
82 psadbw m2, m1
83 paddw m0, m2
84 movhlps m2, m0
85 paddw m0, m2
109 mova m2, [aboveq+16]
116 psadbw m2, m1
[all …]
|
| /external/eigen/test/eigen2/ |
| D | eigen2_determinant.cpp | 21 MatrixType m1(size, size), m2(size, size); in determinant() local
23 m2.setRandom(); in determinant()
27 VERIFY_IS_APPROX((m1*m2).determinant(), m1.determinant() * m2.determinant()); in determinant()
34 m2 = m1; in determinant()
35 m2.row(i).swap(m2.row(j)); in determinant()
36 VERIFY_IS_APPROX(m2.determinant(), -m1.determinant()); in determinant()
37 m2 = m1; in determinant()
38 m2.col(i).swap(m2.col(j)); in determinant()
39 VERIFY_IS_APPROX(m2.determinant(), -m1.determinant()); in determinant()
40 VERIFY_IS_APPROX(m2.determinant(), m2.transpose().determinant()); in determinant()
[all …]
|
| D | eigen2_sparse_basic.cpp | 169 SparseMatrixType m2(rows,cols); in sparse_basic() local
170 m2.startFill(); in sparse_basic()
177 m2.fillrand(i,j) = m1(i,j) = ei_random<Scalar>(); in sparse_basic()
180 m2.endFill(); in sparse_basic()
181 VERIFY_IS_APPROX(m2,m1); in sparse_basic()
207 SparseMatrixType m2(rows, rows); in sparse_basic() local
211 initSparse<Scalar>(density, refM2, m2); in sparse_basic()
215 VERIFY_IS_APPROX(m1+m2, refM1+refM2); in sparse_basic()
216 VERIFY_IS_APPROX(m1+m2+m3, refM1+refM2+refM3); in sparse_basic()
217 VERIFY_IS_APPROX(m3.cwise()*(m1+m2), refM3.cwise()*(refM1+refM2)); in sparse_basic()
[all …]
|
| D | eigen2_linearstructure.cpp | 27 m2 = MatrixType::Random(rows, cols), in linearStructure() local
39 VERIFY_IS_APPROX(m1+m2-m1, m2); in linearStructure()
40 VERIFY_IS_APPROX(-m2+m1+m2, m1); in linearStructure()
42 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2); in linearStructure()
43 VERIFY_IS_APPROX((-m1+m2)*s1, -s1*m1+s1*m2); in linearStructure()
44 m3 = m2; m3 += m1; in linearStructure()
45 VERIFY_IS_APPROX(m3, m1+m2); in linearStructure()
46 m3 = m2; m3 -= m1; in linearStructure()
47 VERIFY_IS_APPROX(m3, m2-m1); in linearStructure()
48 m3 = m2; m3 *= s1; in linearStructure()
[all …]
|
| /external/chromium_org/third_party/tlslite/tlslite/utils/ |
| D | openssl_rsakey.py | 38 self.rsa = m2.rsa_new()
39 m2.rsa_set_n(self.rsa, numberToMPI(n))
40 m2.rsa_set_e(self.rsa, numberToMPI(e))
44 m2.rsa_free(self.rsa)
50 return mpiToNumber(m2.rsa_get_e(self.rsa))
54 return mpiToNumber(m2.rsa_get_n(self.rsa))
63 s = m2.rsa_private_encrypt(self.rsa, bytes(b), m2.no_padding)
69 s = m2.rsa_public_decrypt(self.rsa, bytes(b), m2.no_padding)
76 bio = m2.bio_new(m2.bio_s_mem())
80 m2.rsa_write_key(self.rsa, bio, m2.des_ede_cbc(), f)
[all …]
|