| /external/eigen/test/ |
| D | array.cpp | 23 ArrayType m1 = ArrayType::Random(rows, cols), in array() local
26 ArrayType m4 = m1; // copy constructor in array()
27 VERIFY_IS_APPROX(m1, m4); in array()
36 VERIFY_IS_APPROX(m1 + s1, s1 + m1); in array()
37 VERIFY_IS_APPROX(m1 + s1, ArrayType::Constant(rows,cols,s1) + m1); in array()
38 VERIFY_IS_APPROX(s1 - m1, (-m1)+s1 ); in array()
39 VERIFY_IS_APPROX(m1 - s1, m1 - ArrayType::Constant(rows,cols,s1)); in array()
40 VERIFY_IS_APPROX(s1 - m1, ArrayType::Constant(rows,cols,s1) - m1); in array()
41 VERIFY_IS_APPROX((m1*Scalar(2)) - s2, (m1+m1) - ArrayType::Constant(rows,cols,s2) ); in array()
42 m3 = m1; in array()
[all …]
|
| D | vectorwiseop.cpp | 28 ArrayType m1 = ArrayType::Random(rows, cols), in vectorwiseop_array() local
37 m2 = m1; 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()
43 VERIFY_RAISES_ASSERT(m1.colwise() + colvec.transpose()); in vectorwiseop_array()
45 m2 = m1; 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()
51 VERIFY_RAISES_ASSERT(m1.rowwise() + rowvec.transpose()); in vectorwiseop_array()
55 m2 = m1; in vectorwiseop_array()
[all …]
|
| D | nesting_ops.cpp | 53 MatrixType m1 = MatrixType::Random(rows,cols); in run_nesting_ops_2() local
58 VERIFY_EVALUATION_COUNT( use_n_times<1>(m1 + m1*m1), 1 ); in run_nesting_ops_2()
59 VERIFY_EVALUATION_COUNT( use_n_times<10>(m1 + m1*m1), 1 ); in run_nesting_ops_2()
61 …VERIFY_EVALUATION_COUNT( use_n_times<1>(m1.template triangularView<Lower>().solve(m1.col(0))), 1 ); in run_nesting_ops_2()
62 …VERIFY_EVALUATION_COUNT( use_n_times<10>(m1.template triangularView<Lower>().solve(m1.col(0))), 1 … in run_nesting_ops_2()
64 …VERIFY_EVALUATION_COUNT( use_n_times<1>(Scalar(2)*m1.template triangularView<Lower>().solve(m1.col… in run_nesting_ops_2()
65 …VERIFY_EVALUATION_COUNT( use_n_times<1>(m1.col(0)+m1.template triangularView<Lower>().solve(m1.col… in run_nesting_ops_2()
66 …VERIFY_EVALUATION_COUNT( use_n_times<10>(m1.col(0)+m1.template triangularView<Lower>().solve(m1.co… in run_nesting_ops_2()
70 VERIFY( verify_eval_type<10>(m1, m1) ); in run_nesting_ops_2()
73 VERIFY( verify_eval_type<3>(2*m1, 2*m1) ); in run_nesting_ops_2()
[all …]
|
| D | array_for_matrix.cpp | 22 MatrixType m1 = MatrixType::Random(rows, cols), in array_for_matrix() local
33 VERIFY_IS_APPROX(m1.array() + s1, s1 + m1.array()); in array_for_matrix()
34 VERIFY_IS_APPROX((m1.array() + s1).matrix(), MatrixType::Constant(rows,cols,s1) + m1); in array_for_matrix()
35 …VERIFY_IS_APPROX(((m1*Scalar(2)).array() - s2).matrix(), (m1+m1) - MatrixType::Constant(rows,cols,… in array_for_matrix()
36 m3 = m1; in array_for_matrix()
38 VERIFY_IS_APPROX(m3, (m1.array() + s2).matrix()); in array_for_matrix()
39 m3 = m1; in array_for_matrix()
41 VERIFY_IS_APPROX(m3, (m1.array() - s1).matrix()); in array_for_matrix()
44 VERIFY_IS_MUCH_SMALLER_THAN(m1.colwise().sum().sum() - m1.sum(), m1.squaredNorm()); in array_for_matrix()
45 VERIFY_IS_MUCH_SMALLER_THAN(m1.rowwise().sum().sum() - m1.sum(), m1.squaredNorm()); in array_for_matrix()
[all …]
|
| D | linearstructure.cpp | 31 MatrixType m1 = MatrixType::Random(rows, cols), in linearStructure() local
41 VERIFY_IS_APPROX(-(-m1), m1); in linearStructure()
42 VERIFY_IS_APPROX(m1+m1, 2*m1); in linearStructure()
43 VERIFY_IS_APPROX(m1+m2-m1, m2); in linearStructure()
44 VERIFY_IS_APPROX(-m2+m1+m2, m1); in linearStructure()
45 VERIFY_IS_APPROX(m1*s1, s1*m1); in linearStructure()
46 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2); in linearStructure()
47 VERIFY_IS_APPROX((-m1+m2)*s1, -s1*m1+s1*m2); in linearStructure()
48 m3 = m2; m3 += m1; in linearStructure()
49 VERIFY_IS_APPROX(m3, m1+m2); in linearStructure()
[all …]
|
| D | integer_types.cpp | 30 MatrixType m1(rows, cols), in signed_integer_type_tests() local
35 m1 = MatrixType::Random(rows, cols); in signed_integer_type_tests()
36 } while(m1 == mzero || m1 == m2); in signed_integer_type_tests()
45 VERIFY_IS_EQUAL(-(-m1), m1); 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()
66 MatrixType m1(rows, cols), in integer_type_tests() local
79 m1 = MatrixType::Random(rows, cols); in integer_type_tests()
80 } while(m1 == mzero || m1 == m2); in integer_type_tests()
89 VERIFY_IS_APPROX( m1, m1); in integer_type_tests()
[all …]
|
| D | product.h | 14 bool areNotApprox(const MatrixBase<Derived1>& m1, const MatrixBase<Derived2>& m2, typename Derived1…
16 return !((m1-m2).cwiseAbs2().maxCoeff() < epsilon * epsilon
17 * (std::max)(m1.cwiseAbs2().maxCoeff(), m2.cwiseAbs2().maxCoeff()));
38 MatrixType m1 = MatrixType::Random(rows, cols), in product() local
50 OtherMajorMatrixType tm1 = m1; in product()
60 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2)); in product()
61 m3 = m1; in product()
62 m3 *= m1.transpose() * m2; in product()
63 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2)); in product()
64 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2)); in product()
[all …]
|
| D | block.cpp | 15 block_real_only(const MatrixType &m1, Index r1, Index r2, Index c1, Index c2, const Scalar& s1) { in block_real_only() argument
17 VERIFY_IS_APPROX(m1.row(r1).cwiseMax(s1), m1.cwiseMax(s1).row(r1)); in block_real_only()
18 VERIFY_IS_APPROX(m1.col(c1).cwiseMin(s1), m1.cwiseMin(s1).col(c1)); in block_real_only()
20 …VERIFY_IS_APPROX(m1.block(r1,c1,r2-r1+1,c2-c1+1).cwiseMin(s1), m1.cwiseMin(s1).block(r1,c1,r2-r1+1… in block_real_only()
21 …VERIFY_IS_APPROX(m1.block(r1,c1,r2-r1+1,c2-c1+1).cwiseMax(s1), m1.cwiseMax(s1).block(r1,c1,r2-r1+1… in block_real_only()
46 MatrixType m1 = MatrixType::Random(rows, cols), in block() local
47 m1_copy = m1, in block()
60 block_real_only(m1, r1, r2, c1, c1, s1); in block()
63 VERIFY_IS_EQUAL(m1.col(c1).transpose(), m1.transpose().row(c1)); in block()
65 m1 = m1_copy; in block()
[all …]
|
| D | triangular.cpp | 25 MatrixType m1 = MatrixType::Random(rows, cols), in triangular_square() local
33 MatrixType m1up = m1.template triangularView<Upper>(); in triangular_square()
48 r1.template triangularView<Upper>() += m1; in triangular_square()
53 m1.setZero(); in triangular_square()
54 m1.template triangularView<Upper>() = m2.transpose() + m2; in triangular_square()
56 VERIFY_IS_APPROX(m3.template triangularView<Lower>().transpose().toDenseMatrix(), m1); in triangular_square()
59 m1.setZero(); in triangular_square()
60 m1.template triangularView<Lower>() = m2.transpose() + m2; in triangular_square()
61 VERIFY_IS_APPROX(m3.template triangularView<Lower>().toDenseMatrix(), m1); in triangular_square()
66 m1 = MatrixType::Random(rows, cols); in triangular_square()
[all …]
|
| D | nomalloc.cpp | 33 MatrixType m1 = 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()
44 VERIFY_IS_APPROX(m1.cwiseProduct(m1.block(0,0,rows,cols)), (m1.array()*m1.array()).matrix()); 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()
[all …]
|
| D | product_notemporary.cpp | 29 ColMajorMatrixType m1 = 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 | eigen2support.cpp | 22 MatrixType m1 = MatrixType::Random(rows, cols), in eigen2support() local
29 VERIFY_IS_APPROX(m1.cwise() + s1, s1 + m1.cwise()); in eigen2support()
30 VERIFY_IS_APPROX(m1.cwise() + s1, MatrixType::Constant(rows,cols,s1) + m1); in eigen2support()
31 VERIFY_IS_APPROX((m1*Scalar(2)).cwise() - s2, (m1+m1) - MatrixType::Constant(rows,cols,s2) ); in eigen2support()
32 m3 = m1; in eigen2support()
34 VERIFY_IS_APPROX(m3, m1.cwise() + s2); in eigen2support()
35 m3 = m1; in eigen2support()
37 VERIFY_IS_APPROX(m3, m1.cwise() - s1); in eigen2support()
39 VERIFY_IS_EQUAL((m1.corner(TopLeft,1,1)), (m1.block(0,0,1,1))); in eigen2support()
40 VERIFY_IS_EQUAL((m1.template corner<1,1>(TopLeft)), (m1.template block<1,1>(0,0))); in eigen2support()
[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/set/set.special/ |
| D | member_swap.pass.cpp | 27 M m1; in main() local
29 M m1_save = m1; in main()
31 m1.swap(m2); in main()
32 assert(m1 == m2_save); in main()
47 M m1; in main() local
49 M m1_save = m1; in main()
51 m1.swap(m2); in main()
52 assert(m1 == m2_save); in main()
63 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); in main() local
65 M m1_save = m1; in main()
[all …]
|
| D | non_member_swap.pass.cpp | 27 M m1; in main() local
29 M m1_save = m1; in main()
31 swap(m1, m2); in main()
32 assert(m1 == m2_save); in main()
47 M m1; in main() local
49 M m1_save = m1; in main()
51 swap(m1, m2); in main()
52 assert(m1 == m2_save); in main()
63 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); in main() local
65 M m1_save = m1; in main()
[all …]
|
| /external/libcxx/test/std/containers/associative/multiset/multiset.special/ |
| D | member_swap.pass.cpp | 27 M m1; in main() local
29 M m1_save = m1; in main()
31 m1.swap(m2); in main()
32 assert(m1 == m2_save); in main()
47 M m1; in main() local
49 M m1_save = m1; in main()
51 m1.swap(m2); in main()
52 assert(m1 == m2_save); in main()
63 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); in main() local
65 M m1_save = m1; in main()
[all …]
|
| D | non_member_swap.pass.cpp | 27 M m1; in main() local
29 M m1_save = m1; in main()
31 swap(m1, m2); in main()
32 assert(m1 == m2_save); in main()
47 M m1; in main() local
49 M m1_save = m1; in main()
51 swap(m1, m2); in main()
52 assert(m1 == m2_save); in main()
63 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); in main() local
65 M m1_save = m1; in main()
[all …]
|
| /external/libcxx/test/std/containers/associative/multimap/multimap.special/ |
| D | non_member_swap.pass.cpp | 30 M m1; in main() local
32 M m1_save = m1; in main()
34 swap(m1, m2); in main()
35 assert(m1 == m2_save); in main()
50 M m1; in main() local
52 M m1_save = m1; in main()
54 swap(m1, m2); in main()
55 assert(m1 == m2_save); in main()
66 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); in main() local
68 M m1_save = m1; in main()
[all …]
|
| D | member_swap.pass.cpp | 27 M m1; in main() local
29 M m1_save = m1; in main()
31 m1.swap(m2); in main()
32 assert(m1 == m2_save); in main()
47 M m1; in main() local
49 M m1_save = m1; in main()
51 m1.swap(m2); in main()
52 assert(m1 == m2_save); in main()
63 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); in main() local
65 M m1_save = m1; in main()
[all …]
|
| /external/libcxx/test/std/containers/associative/map/map.special/ |
| D | non_member_swap.pass.cpp | 30 M m1; in main() local
32 M m1_save = m1; in main()
34 swap(m1, m2); in main()
35 assert(m1 == m2_save); in main()
50 M m1; in main() local
52 M m1_save = m1; in main()
54 swap(m1, m2); in main()
55 assert(m1 == m2_save); in main()
66 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); in main() local
68 M m1_save = m1; in main()
[all …]
|
| D | member_swap.pass.cpp | 27 M m1; in main() local
29 M m1_save = m1; in main()
31 m1.swap(m2); in main()
32 assert(m1 == m2_save); in main()
47 M m1; in main() local
49 M m1_save = m1; in main()
51 m1.swap(m2); in main()
52 assert(m1 == m2_save); in main()
63 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); in main() local
65 M m1_save = m1; in main()
[all …]
|
| /external/skqp/tests/ |
| D | MetaDataTest.cpp | 39 SkMetaData m1; in DEF_TEST() local
41 REPORTER_ASSERT(reporter, !m1.findS32("int")); in DEF_TEST()
42 REPORTER_ASSERT(reporter, !m1.findScalar("scalar")); in DEF_TEST()
43 REPORTER_ASSERT(reporter, !m1.findString("hello")); in DEF_TEST()
44 REPORTER_ASSERT(reporter, !m1.removeS32("int")); in DEF_TEST()
45 REPORTER_ASSERT(reporter, !m1.removeScalar("scalar")); in DEF_TEST()
46 REPORTER_ASSERT(reporter, !m1.removeString("hello")); in DEF_TEST()
47 REPORTER_ASSERT(reporter, !m1.removeString("true")); in DEF_TEST()
48 REPORTER_ASSERT(reporter, !m1.removeString("false")); in DEF_TEST()
50 m1.setS32("int", 12345); in DEF_TEST()
[all …]
|
| /external/skia/tests/ |
| D | MetaDataTest.cpp | 39 SkMetaData m1; in DEF_TEST() local
41 REPORTER_ASSERT(reporter, !m1.findS32("int")); in DEF_TEST()
42 REPORTER_ASSERT(reporter, !m1.findScalar("scalar")); in DEF_TEST()
43 REPORTER_ASSERT(reporter, !m1.findString("hello")); in DEF_TEST()
44 REPORTER_ASSERT(reporter, !m1.removeS32("int")); in DEF_TEST()
45 REPORTER_ASSERT(reporter, !m1.removeScalar("scalar")); in DEF_TEST()
46 REPORTER_ASSERT(reporter, !m1.removeString("hello")); in DEF_TEST()
47 REPORTER_ASSERT(reporter, !m1.removeString("true")); in DEF_TEST()
48 REPORTER_ASSERT(reporter, !m1.removeString("false")); in DEF_TEST()
50 m1.setS32("int", 12345); in DEF_TEST()
[all …]
|
| /external/libcxx/test/std/thread/thread.mutex/thread.lock/thread.lock.scoped/ |
| D | mutex.pass.cpp | 73 TestMutex m1; in main() local
75 LG lg(m1); in main()
76 assert(m1.locked); in main()
78 assert(!m1.locked); in main()
82 TestMutex m1, m2; in main() local
84 LG lg(m1, m2); in main()
85 assert(m1.locked && m2.locked); in main()
87 assert(!m1.locked && !m2.locked); in main()
91 TestMutex m1, m2, m3; in main() local
93 LG lg(m1, m2, m3); in main()
[all …]
|
| /external/libvpx/libvpx/vpx_dsp/x86/ |
| D | highbd_sad_sse2.asm | 63 movu m1, [refq]
68 pavgw m1, [second_predq+mmsize*0]
75 psubusw m5, m1
76 psubusw m1, [srcq]
77 por m1, m5
90 paddw m1, m2
92 movhlps m2, m1
94 paddw m1, m2
96 punpcklwd m1, m6
98 paddd m0, m1
[all …]
|