| /external/valgrind/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 …]
|
| /external/libvpx/libvpx/vpx_dsp/x86/ |
| D | highbd_sad4d_sse2.asm | 29 mova m2, m0
31 psubusw m2, m5
35 por m5, m2
39 mova m2, m0
41 psubusw m2, m7
45 por m7, m2
49 movu m2, [ref1q+%3*2]
51 movhps m2, [ref1q+%5*2]
53 psubusw m3, m2
54 psubusw m2, m0
[all …]
|
| D | subpel_variance_sse2.asm | 410 punpckhbw m2, m0, m4
412 pmaddubsw m2, filter_y_a
414 paddw m2, filter_rnd
417 punpckhbw m2, m0, m5
426 pmullw m2, filter_y_a
428 paddw m2, filter_rnd
432 paddw m2, m3
435 psraw m2, 4
439 packuswb m0, m2
441 punpckhbw m2, m0, m5
[all …]
|
| D | highbd_intrapred_sse2.asm | 25 movq m2, [leftq]
26 paddw m0, m2
49 mova m2, [leftq]
55 paddw m0, m2
85 mova m2, [leftq]
90 paddw m0, m2
93 movhlps m2, m0
94 paddw m0, m2
96 movhlps m2, m0
97 paddd m0, m2
[all …]
|
| /external/eigen/test/ |
| D | vectorwiseop.cpp | 29 m2(rows, cols), in vectorwiseop_array() local
37 m2 = m1; in vectorwiseop_array()
38 m2.colwise() += colvec; in vectorwiseop_array()
39 VERIFY_IS_APPROX(m2, m1.colwise() + colvec); in vectorwiseop_array()
40 VERIFY_IS_APPROX(m2.col(c), m1.col(c) + colvec); in vectorwiseop_array()
42 VERIFY_RAISES_ASSERT(m2.colwise() += colvec.transpose()); in vectorwiseop_array()
45 m2 = m1; in vectorwiseop_array()
46 m2.rowwise() += rowvec; in vectorwiseop_array()
47 VERIFY_IS_APPROX(m2, m1.rowwise() + rowvec); in vectorwiseop_array()
48 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 | 71 SparseMatrixType m2(rows,cols); in sparse_basic() local
77 m2.reserve(VectorXi::Constant(m2.outerSize(), int(nnz))); in sparse_basic()
79 m2.reserve(m2.outerSize() * nnz); in sparse_basic()
88 m2.insert(i,j) = m1(i,j) = internal::random<Scalar>(); in sparse_basic()
97 m2.finalize(); in sparse_basic()
98 VERIFY_IS_APPROX(m2,m1); in sparse_basic()
105 SparseMatrixType m2(rows,cols); in sparse_basic() local
107 m2.reserve(VectorXi::Constant(m2.outerSize(), 2)); in sparse_basic()
113 m2.insert(i,j) = m1(i,j) = internal::random<Scalar>(); in sparse_basic()
117 m2.coeffRef(i,j) += v; 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 | 34 m2 = MatrixType::Random(rows, cols), in nomalloc() local
42 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2); in nomalloc()
43 VERIFY_IS_APPROX((m1+m2)(r,c), (m1(r,c))+(m2(r,c))); in nomalloc()
45 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2)); in nomalloc()
47 m2.col(0).noalias() = m1 * m1.col(0); in nomalloc()
48 m2.col(0).noalias() -= m1.adjoint() * m1.col(0); in nomalloc()
49 m2.col(0).noalias() -= m1 * m1.row(0).adjoint(); in nomalloc()
50 m2.col(0).noalias() -= m1.adjoint() * m1.row(0).adjoint(); in nomalloc()
52 m2.row(0).noalias() = m1.row(0) * m1; in nomalloc()
53 m2.row(0).noalias() -= m1.row(0) * m1.adjoint(); in nomalloc()
[all …]
|
| D | array_replicate.cpp | 27 m2 = MatrixType::Random(rows, cols); in replicate() local
44 x2 << m2, m2, m2, in replicate()
45 m2, m2, m2; in replicate()
46 VERIFY_IS_APPROX(x2, (m2.template replicate<2,3>())); in replicate()
49 x2 << m2, m2, m2; in replicate()
50 VERIFY_IS_APPROX(x2, (m2.template replicate<1,3>())); in replicate()
53 vx1 << m2, m2, m2; in replicate()
54 VERIFY_IS_APPROX(vx1+vx1, vx1+(m2.template replicate<3,1>())); in replicate()
56 vx1=m2+(m2.colwise().replicate(1)); in replicate()
58 if(m2.cols()==1) in replicate()
[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_notemporary.cpp | 30 m2 = MatrixType::Random(rows, cols), in product_notemporary() local
45 VERIFY_EVALUATION_COUNT( m3 = (m1 * m2.adjoint()), 1); in product_notemporary()
46 VERIFY_EVALUATION_COUNT( m3 = (m1 * m2.adjoint()).transpose(), 1); in product_notemporary()
47 VERIFY_EVALUATION_COUNT( m3.noalias() = m1 * m2.adjoint(), 0); in product_notemporary()
49 VERIFY_EVALUATION_COUNT( m3 = s1 * (m1 * m2.transpose()), 1); in product_notemporary()
51 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * (m1 * m2.transpose()), 0); in product_notemporary()
53 VERIFY_EVALUATION_COUNT( m3 = m3 + (m1 * m2.adjoint()), 1); in product_notemporary()
54 VERIFY_EVALUATION_COUNT( m3 = m3 - (m1 * m2.adjoint()), 1); in product_notemporary()
56 VERIFY_EVALUATION_COUNT( m3 = m3 + (m1 * m2.adjoint()).transpose(), 1); in product_notemporary()
57 VERIFY_EVALUATION_COUNT( m3.noalias() = m3 + m1 * m2.transpose(), 0); in product_notemporary()
[all …]
|
| D | lu.cpp | 62 CMatrixType m2(cols, cols2); in lu_non_invertible() local
94 m2 = CMatrixType::Random(cols,cols2); in lu_non_invertible()
95 m3 = m1*m2; in lu_non_invertible()
96 m2 = CMatrixType::Random(cols,cols2); in lu_non_invertible()
98 m2.block(0,0,m2.rows(),m2.cols()) = lu.solve(m3); in lu_non_invertible()
99 VERIFY_IS_APPROX(m3, m1*m2); in lu_non_invertible()
103 m2 = m1.transpose()*m3; in lu_non_invertible()
105 lu.template _solve_impl_transposed<false>(m2, m3); in lu_non_invertible()
106 VERIFY_IS_APPROX(m2, m1.transpose()*m3); in lu_non_invertible()
108 m3 = lu.transpose().solve(m2); in lu_non_invertible()
[all …]
|
| /external/clang/test/CodeGen/ |
| D | 3dnow-builtins.c | 9 __m64 test_m_pavgusb(__m64 m1, __m64 m2) { in test_m_pavgusb() argument
13 return _m_pavgusb(m1, m2); in test_m_pavgusb()
23 __m64 test_m_pfacc(__m64 m1, __m64 m2) { in test_m_pfacc() argument
27 return _m_pfacc(m1, m2); in test_m_pfacc()
30 __m64 test_m_pfadd(__m64 m1, __m64 m2) { in test_m_pfadd() argument
34 return _m_pfadd(m1, m2); in test_m_pfadd()
37 __m64 test_m_pfcmpeq(__m64 m1, __m64 m2) { in test_m_pfcmpeq() argument
41 return _m_pfcmpeq(m1, m2); in test_m_pfcmpeq()
44 __m64 test_m_pfcmpge(__m64 m1, __m64 m2) { in test_m_pfcmpge() argument
48 return _m_pfcmpge(m1, m2); in test_m_pfcmpge()
[all …]
|
| /external/libcxx/test/std/containers/associative/multiset/multiset.special/ |
| D | member_swap.pass.cpp | 28 M m2; in main() local
30 M m2_save = m2; in main()
31 m1.swap(m2); in main()
33 assert(m2 == m1_save); in main()
48 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
50 M m2_save = m2; in main()
51 m1.swap(m2); in main()
53 assert(m2 == m1_save); in main()
64 M m2; in main() local
66 M m2_save = m2; in main()
[all …]
|
| D | non_member_swap.pass.cpp | 28 M m2; in main() local
30 M m2_save = m2; in main()
31 swap(m1, m2); in main()
33 assert(m2 == m1_save); in main()
48 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
50 M m2_save = m2; in main()
51 swap(m1, m2); in main()
53 assert(m2 == m1_save); in main()
64 M m2; in main() local
66 M m2_save = m2; in main()
[all …]
|
| /external/libcxx/test/std/containers/associative/set/set.special/ |
| D | member_swap.pass.cpp | 28 M m2; in main() local
30 M m2_save = m2; in main()
31 m1.swap(m2); in main()
33 assert(m2 == m1_save); in main()
48 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
50 M m2_save = m2; in main()
51 m1.swap(m2); in main()
53 assert(m2 == m1_save); in main()
64 M m2; in main() local
66 M m2_save = m2; in main()
[all …]
|
| D | non_member_swap.pass.cpp | 28 M m2; in main() local
30 M m2_save = m2; in main()
31 swap(m1, m2); in main()
33 assert(m2 == m1_save); in main()
48 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
50 M m2_save = m2; in main()
51 swap(m1, m2); in main()
53 assert(m2 == m1_save); in main()
64 M m2; in main() local
66 M m2_save = m2; in main()
[all …]
|
| /external/libcxx/test/std/containers/associative/map/map.special/ |
| D | non_member_swap.pass.cpp | 31 M m2; in main() local
33 M m2_save = m2; in main()
34 swap(m1, m2); in main()
36 assert(m2 == m1_save); in main()
51 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
53 M m2_save = m2; in main()
54 swap(m1, m2); in main()
56 assert(m2 == m1_save); in main()
67 M m2; in main() local
69 M m2_save = m2; in main()
[all …]
|
| D | member_swap.pass.cpp | 28 M m2; in main() local
30 M m2_save = m2; in main()
31 m1.swap(m2); in main()
33 assert(m2 == m1_save); in main()
48 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
50 M m2_save = m2; in main()
51 m1.swap(m2); in main()
53 assert(m2 == m1_save); in main()
64 M m2; in main() local
66 M m2_save = m2; in main()
[all …]
|
| /external/libcxx/test/std/containers/associative/multimap/multimap.special/ |
| D | non_member_swap.pass.cpp | 31 M m2; in main() local
33 M m2_save = m2; in main()
34 swap(m1, m2); in main()
36 assert(m2 == m1_save); in main()
51 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
53 M m2_save = m2; in main()
54 swap(m1, m2); in main()
56 assert(m2 == m1_save); in main()
67 M m2; in main() local
69 M m2_save = m2; in main()
[all …]
|
| D | member_swap.pass.cpp | 28 M m2; in main() local
30 M m2_save = m2; in main()
31 m1.swap(m2); in main()
33 assert(m2 == m1_save); in main()
48 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); in main() local
50 M m2_save = m2; in main()
51 m1.swap(m2); in main()
53 assert(m2 == m1_save); in main()
64 M m2; in main() local
66 M m2_save = m2; in main()
[all …]
|
| /external/vulkan-validation-layers/libs/glm/detail/ |
| D | type_mat4x3.inl | 428 tmat4x3<T, P> const & m2) argument
431 m1[0] + m2[0],
432 m1[1] + m2[1],
433 m1[2] + m2[2],
434 m1[3] + m2[3]);
452 tmat4x3<T, P> const & m2) argument
455 m1[0] - m2[0],
456 m1[1] - m2[1],
457 m1[2] - m2[2],
458 m1[3] - m2[3]);
[all …]
|
| /external/libcxx/test/std/utilities/variant/variant.monostate.relops/ |
| D | relops.pass.cpp | 30 constexpr M m2{}; in main() local
32 static_assert((m1 < m2) == false, ""); in main()
33 ASSERT_NOEXCEPT(m1 < m2); in main()
36 static_assert((m1 > m2) == false, ""); in main()
37 ASSERT_NOEXCEPT(m1 > m2); in main()
40 static_assert((m1 <= m2) == true, ""); in main()
41 ASSERT_NOEXCEPT(m1 <= m2); in main()
44 static_assert((m1 >= m2) == true, ""); in main()
45 ASSERT_NOEXCEPT(m1 >= m2); in main()
48 static_assert((m1 == m2) == true, ""); in main()
[all …]
|