| /external/eigen/test/eigen2/ |
| D | eigen2_triangular.cpp | 24 m3(rows, cols), in triangular() local
51 m3 = m2.transpose() * m2; in triangular()
52 VERIFY_IS_APPROX(m3.template part<Eigen::LowerTriangular>().transpose(), m1); in triangular()
57 VERIFY_IS_APPROX(m3.template part<Eigen::LowerTriangular>(), m1); in triangular()
59 VERIFY_IS_APPROX(m3.template part<Diagonal>(), m3.diagonal().asDiagonal()); in triangular()
67 m3 = m1.template part<Eigen::LowerTriangular>(); in triangular()
68 …VERIFY(m3.template marked<Eigen::LowerTriangular>().solveTriangular(m3).cwise().abs().isIdentity(t… in triangular()
69 VERIFY(m3.transpose().template marked<Eigen::UpperTriangular>() in triangular()
70 .solveTriangular(m3.transpose()).cwise().abs().isIdentity(test_precision<RealScalar>())); in triangular()
72 m4 = m3; in triangular()
[all …]
|
| D | eigen2_commainitializer.cpp | 14 Matrix3d m3; in test_eigen2_commainitializer() local
17 VERIFY_RAISES_ASSERT( (m3 << 1, 2, 3, 4, 5, 6, 7, 8) ); in test_eigen2_commainitializer()
20 VERIFY_RAISES_ASSERT( (m3 << 1, 2, 3, 4, 5, 6, 7, 8, 9, 10) ); in test_eigen2_commainitializer()
26 m3 = Matrix3d::Random(); in test_eigen2_commainitializer()
27 m3 << 1, 2, 3, 4, 5, 6, 7, 8, 9; in test_eigen2_commainitializer()
28 VERIFY_IS_APPROX(m3, ref ); in test_eigen2_commainitializer()
34 m3 = Matrix3d::Random(); in test_eigen2_commainitializer()
35 m3 << vec[0], vec[1], vec[2]; in test_eigen2_commainitializer()
36 VERIFY_IS_APPROX(m3, ref); in test_eigen2_commainitializer()
41 m3 = Matrix3d::Random(); in test_eigen2_commainitializer()
[all …]
|
| D | eigen2_cwiseop.cpp | 33 m3(rows, cols), in cwiseops() local
49 m3 = MatrixType::Constant(rows, cols, s1); in cwiseops()
55 VERIFY_IS_APPROX(m3(i,j), s1); in cwiseops()
59 VERIFY(m3.isConstant(s1)); in cwiseops()
61 VERIFY_IS_APPROX(m4.setConstant(s1), m3); in cwiseops()
62 VERIFY_IS_APPROX(m4.setConstant(rows,cols,s1), m3); in cwiseops()
68 VERIFY_IS_APPROX(m4, m3); in cwiseops()
82 m3 = m1; m3.cwise() += 1; in cwiseops()
83 VERIFY_IS_APPROX(m1 + mones, m3); in cwiseops()
84 m3 = m1; m3.cwise() -= 1; in cwiseops()
[all …]
|
| D | eigen2_sparse_product.cpp | 30 SparseMatrixType m3(rows, rows); in sparse_product() local
33 initSparse<Scalar>(density, refMat3, m3); in sparse_product()
35 VERIFY_IS_APPROX(m4=m2*m3, refMat4=refMat2*refMat3); in sparse_product()
36 VERIFY_IS_APPROX(m4=m2.transpose()*m3, refMat4=refMat2.transpose()*refMat3); in sparse_product()
37 …VERIFY_IS_APPROX(m4=m2.transpose()*m3.transpose(), refMat4=refMat2.transpose()*refMat3.transpose()… in sparse_product()
38 VERIFY_IS_APPROX(m4=m2*m3.transpose(), refMat4=refMat2*refMat3.transpose()); in sparse_product()
47 VERIFY_IS_APPROX(dm4=refMat2*m3, refMat4=refMat2*refMat3); in sparse_product()
48 VERIFY_IS_APPROX(dm4=refMat2*m3.transpose(), refMat4=refMat2*refMat3.transpose()); in sparse_product()
49 VERIFY_IS_APPROX(dm4=refMat2.transpose()*m3, refMat4=refMat2.transpose()*refMat3); in sparse_product()
50 …VERIFY_IS_APPROX(dm4=refMat2.transpose()*m3.transpose(), refMat4=refMat2.transpose()*refMat3.trans… in sparse_product()
[all …]
|
| D | eigen2_linearstructure.cpp | 28 m3(rows, cols); in linearStructure() local
43 m3 = m2; m3 += m1; in linearStructure()
44 VERIFY_IS_APPROX(m3, m1+m2); in linearStructure()
45 m3 = m2; m3 -= m1; in linearStructure()
46 VERIFY_IS_APPROX(m3, m2-m1); in linearStructure()
47 m3 = m2; m3 *= s1; in linearStructure()
48 VERIFY_IS_APPROX(m3, s1*m2); in linearStructure()
51 m3 = m2; m3 /= s1; in linearStructure()
52 VERIFY_IS_APPROX(m3, m2/s1); in linearStructure()
|
| /external/eigen/test/ |
| D | product_trmv.cpp | 25 m3(rows, cols); in trmv() local
33 m3 = m1.template triangularView<Eigen::Lower>(); in trmv()
34 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Lower>() * v1, largerEps)); in trmv()
35 m3 = m1.template triangularView<Eigen::Upper>(); in trmv()
36 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Upper>() * v1, largerEps)); in trmv()
37 m3 = m1.template triangularView<Eigen::UnitLower>(); in trmv()
38 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::UnitLower>() * v1, largerEps)); in trmv()
39 m3 = m1.template triangularView<Eigen::UnitUpper>(); in trmv()
40 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::UnitUpper>() * v1, largerEps)); in trmv()
43 m3 = m1.template triangularView<Eigen::Lower>(); in trmv()
[all …]
|
| D | triangular.cpp | 27 m3(rows, cols), in triangular_square() local
55 m3 = m2.transpose() + m2; in triangular_square()
56 VERIFY_IS_APPROX(m3.template triangularView<Lower>().transpose().toDenseMatrix(), m1); in triangular_square()
61 VERIFY_IS_APPROX(m3.template triangularView<Lower>().toDenseMatrix(), m1); in triangular_square()
63 VERIFY_IS_APPROX(m3.template triangularView<Lower>().conjugate().toDenseMatrix(), in triangular_square()
64 m3.conjugate().template triangularView<Lower>().toDenseMatrix()); in triangular_square()
72 m3 = m1.template triangularView<Upper>(); in triangular_square()
73 …VERIFY(v2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(v2)), large… in triangular_square()
74 m3 = m1.template triangularView<Lower>(); in triangular_square()
75 …VERIFY(v2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(v2)), l… in triangular_square()
[all …]
|
| D | product_notemporary.cpp | 46 m3(rows, cols); in product_notemporary() local
60 VERIFY_EVALUATION_COUNT( m3 = (m1 * m2.adjoint()), 1); in product_notemporary()
61 VERIFY_EVALUATION_COUNT( m3.noalias() = m1 * m2.adjoint(), 0); in product_notemporary()
63 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * (m1 * m2.transpose()), 0); in product_notemporary()
65 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * m2.adjoint(), 0); in product_notemporary()
66 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * (m1*s3+m2*s2).adjoint(), 1); in product_notemporary()
67 VERIFY_EVALUATION_COUNT( m3.noalias() = (s1 * m1).adjoint() * s2 * m2, 0); in product_notemporary()
68 VERIFY_EVALUATION_COUNT( m3.noalias() += s1 * (-m1*s3).adjoint() * (s2 * m2 * s3), 0); in product_notemporary()
69 VERIFY_EVALUATION_COUNT( m3.noalias() -= s1 * (m1.transpose() * m2), 0); in product_notemporary()
71 …VERIFY_EVALUATION_COUNT(( m3.block(r0,r0,r1,r1).noalias() += -m1.block(r0,c0,r1,c1) * (s2*m2.block… in product_notemporary()
[all …]
|
| D | commainitializer.cpp | 14 Matrix3d m3; in test_commainitializer() local
17 VERIFY_RAISES_ASSERT( (m3 << 1, 2, 3, 4, 5, 6, 7, 8) ); in test_commainitializer()
20 VERIFY_RAISES_ASSERT( (m3 << 1, 2, 3, 4, 5, 6, 7, 8, 9, 10) ); in test_commainitializer()
26 m3 = Matrix3d::Random(); in test_commainitializer()
27 m3 << 1, 2, 3, 4, 5, 6, 7, 8, 9; in test_commainitializer()
28 VERIFY_IS_APPROX(m3, ref ); in test_commainitializer()
34 m3 = Matrix3d::Random(); in test_commainitializer()
35 m3 << vec[0], vec[1], vec[2]; in test_commainitializer()
36 VERIFY_IS_APPROX(m3, ref); in test_commainitializer()
41 m3 = Matrix3d::Random(); in test_commainitializer()
[all …]
|
| D | cwiseop.cpp | 35 cwiseops_real_only(MatrixType& m1, MatrixType& m2, MatrixType& m3, MatrixType& mones) in cwiseops_real_only() argument
41 m3 = m1.cwise().abs().cwise().sqrt(); in cwiseops_real_only()
42 VERIFY_IS_APPROX(m3.cwise().square(), m1.cwise().abs()); in cwiseops_real_only()
47 m3 = (m1.cwise().abs().cwise()<=RealScalar(0.01)).select(mones,m1); in cwiseops_real_only()
48 VERIFY_IS_APPROX(m3.cwise().pow(-1), m3.cwise().inverse()); in cwiseops_real_only()
49 m3 = m1.cwise().abs(); in cwiseops_real_only()
50 VERIFY_IS_APPROX(m3.cwise().pow(RealScalar(0.5)), m3.cwise().sqrt()); in cwiseops_real_only()
54 m3 = m1; in cwiseops_real_only()
55 m3.cwise() /= m2; in cwiseops_real_only()
56 VERIFY_IS_APPROX(m3, m1.cwise() / m2); in cwiseops_real_only()
[all …]
|
| D | array.cpp | 24 m3(rows, cols); in array() local
39 m3 = m1; in array()
40 m3 += s2; in array()
41 VERIFY_IS_APPROX(m3, m1 + s2); in array()
42 m3 = m1; in array()
43 m3 -= s1; in array()
44 VERIFY_IS_APPROX(m3, m1 - s1); in array()
47 m3 = m1; in array()
49 VERIFY_IS_APPROX(m1, m3 - m2); in array()
51 m3 = m1; in array()
[all …]
|
| /external/libvpx/libvpx/vpx_dsp/x86/ |
| D | highbd_sad4d_sse2.asm | 28 mova m3, m0
30 psubusw m3, m4
34 por m4, m3
38 mova m3, m0
40 psubusw m3, m6
44 por m6, m3
52 mova m3, m0
53 psubusw m3, m2
55 por m2, m3
60 mova m3, m0
[all …]
|
| D | highbd_sad_sse2.asm | 65 movu m3, [refq+32]
70 pavgw m3, [second_predq+mmsize*2]
83 psubusw m5, m3
84 psubusw m3, [srcq+32]
85 por m3, m5
91 paddw m3, m4
93 movhlps m4, m3
95 paddw m3, m4
97 punpcklwd m3, m6
99 paddd m0, m3
[all …]
|
| D | vpx_subpixel_8t_ssse3.asm | 41 pshuflw m3, m4, 11111111b ;k6_k7
45 punpcklqdq m3, m3
49 mova k6k7, m3
74 mova m3, %2
76 palignr m3, %1, 5
79 pmaddubsw m3, k2k3k6k7
82 mova m5, m3
84 psrldq m3, 8
87 paddsw m4, m3
143 movh m3, [srcq + sstrideq + 5]
[all …]
|
| D | intrapred_ssse3.asm | 118 pavgb m3, m2, m1
121 psubb m3, m2
122 pavgb m0, m3
146 pavgb m3, m2, m0
150 psubb m3, m2
151 pavgb m0, m3
186 pavgb m3, m2, m0
190 psubb m3, m2
191 pavgb m0, m3
239 pavgb m3, m2, m4
[all …]
|
| D | highbd_subpel_variance_impl_sse2.asm | 65 movhlps m3, m7
67 paddd m7, m3
69 pshufd m3, m7, 0x1
71 paddd m7, m3
203 mova m3, [dstq + 16]
208 SUM_SSE m0, m1, m2, m3, m6, m7
219 mova m3, [dstq + dst_strideq*2]
225 SUM_SSE m0, m1, m2, m3, m6, m7
249 mova m3, [dstq+16]
256 SUM_SSE m0, m2, m1, m3, m6, m7
[all …]
|
| D | highbd_intrapred_sse2.asm | 29 movd m3, oned
30 pshufw m3, m3, 0x0
32 pmaddwd m0, m3
34 pmaddwd m0, m3
57 movd m3, oned
58 pshufd m3, m3, 0x0
60 pmaddwd m0, m3
62 pmaddwd m0, m3
64 pmaddwd m0, m3
88 mova m3, [aboveq+16]
[all …]
|
| D | vpx_convolve_copy_sse2.asm | 52 movu m3, [srcq+48]
57 pavg m3, [dstq+48]
62 mova [dstq+48], m3
66 movu m3, [srcq+112]
72 pavg m3, [dstq+112]
77 mova [dstq+112], m3
90 movu m3, [srcq+48]
96 pavg m3, [dstq+48]
101 mova [dstq+48], m3
113 movu m3, [srcq+src_strideq+16]
[all …]
|
| /external/valgrind/none/tests/s390x/ |
| D | opcodes.h | 41 #define RIS_RURDI(op1,r1,m3,b4,d4,i2,op2) \ argument
42 ".short 0x" #op1 #r1 #m3 "\n\t" \
44 #define RIE_RUPI(op1,r1,m3,i4,i2,op2) \ argument
45 ".short 0x" #op1 #r1 #m3 "\n\t" \
47 #define RRS(op1,r1,r2,b4,d4,m3,u0,op2) \ argument
49 ".long 0x" #b4 #d4 #m3 #u0 #op2 "\n\t"
50 #define RIE_RRPU(op1,r1,r2,i4,m3,u0,op2) \ argument
52 ".long 0x" #i4 #m3 #u0 #op2 "\n\t"
59 #define RIS_RURDU(op1,r1,m3,b4,d4,i2,op2) \ argument
60 ".short 0x" #op1 #r1 #m3 "\n\t" \
[all …]
|
| /external/libcxx/test/std/containers/associative/multiset/multiset.cons/ |
| D | move_assign.pass.cpp | 59 M m3(C(3), A(7)); in main() local
60 m3 = std::move(m1); in main()
61 assert(m3 == m2); in main()
62 assert(m3.get_allocator() == A(7)); in main()
63 assert(m3.key_comp() == C(5)); in main()
98 M m3(C(3), A(5)); in main() local
99 m3 = std::move(m1); in main()
100 assert(m3 == m2); in main()
101 assert(m3.get_allocator() == A(5)); in main()
102 assert(m3.key_comp() == C(5)); in main()
[all …]
|
| /external/libcxx/test/std/containers/associative/set/set.cons/ |
| D | move_assign.pass.cpp | 59 M m3(C(3), A(7)); in main() local
60 m3 = std::move(m1); in main()
61 assert(m3 == m2); in main()
62 assert(m3.get_allocator() == A(7)); in main()
63 assert(m3.key_comp() == C(5)); in main()
98 M m3(C(3), A(5)); in main() local
99 m3 = std::move(m1); in main()
100 assert(m3 == m2); in main()
101 assert(m3.get_allocator() == A(5)); in main()
102 assert(m3.key_comp() == C(5)); in main()
[all …]
|
| /external/libcxx/test/std/containers/associative/multimap/multimap.cons/ |
| D | move_assign.pass.cpp | 60 M m3(C(3), A(7)); in main() local
61 m3 = std::move(m1); in main()
62 assert(m3 == m2); in main()
63 assert(m3.get_allocator() == A(7)); in main()
64 assert(m3.key_comp() == C(5)); in main()
100 M m3(C(3), A(5)); in main() local
101 m3 = std::move(m1); in main()
102 assert(m3 == m2); in main()
103 assert(m3.get_allocator() == A(5)); in main()
104 assert(m3.key_comp() == C(5)); in main()
[all …]
|
| /external/libcxx/test/std/containers/associative/map/map.cons/ |
| D | move_assign.pass.cpp | 60 M m3(C(3), A(7)); in main() local
61 m3 = std::move(m1); in main()
62 assert(m3 == m2); in main()
63 assert(m3.get_allocator() == A(7)); in main()
64 assert(m3.key_comp() == C(5)); in main()
100 M m3(C(3), A(5)); in main() local
101 m3 = std::move(m1); in main()
102 assert(m3 == m2); in main()
103 assert(m3.get_allocator() == A(5)); in main()
104 assert(m3.key_comp() == C(5)); in main()
[all …]
|
| /external/eigen/doc/ |
| D | tutorial.cpp | 8 Eigen::Matrix3f m3 = Eigen::Matrix3f::Random(); in main() local
11 std::cout << "*** Step 1 ***\nm3:\n" << m3 << "\nm4:\n" << m4 << std::endl; in main()
15 m3.diagonal().setOnes(); in main()
17 std::cout << "*** Step 2 ***\nm3:\n" << m3 << "\nm4:\n" << m4 << std::endl; in main()
20 m4.block<3,3>(0,1) = m3; in main()
21 m3.row(2) = m4.block<1,3>(2,0); in main()
23 std::cout << "*** Step 3 ***\nm3:\n" << m3 << "\nm4:\n" << m4 << std::endl; in main()
39 m3 = m3.cwise().cos(); in main()
40 std::cout << "*** Step 6 ***\nm3:\n" << m3 << "\nm4:\n" << m4 << std::endl; in main()
55 m3 = m3 * m4.block<3,3>(1,1); // here Eigen chooses NOT to evaluate block() into a temporary in main()
[all …]
|
| /external/libvpx/libvpx/vp9/encoder/x86/ |
| D | vp9_dct_mmx.asm | 20 psubw m3, m2
21 psubw m4, m3
27 paddw m3, m5
31 SWAP 3, 5 ; m3 b1
39 punpcklwd m5, m3
40 punpckhwd m2, m3
42 movq m3, m0
45 punpckldq m3, m2
56 movq m3, [r3q + strideq*2] ;d1
66 psllw m3, 2
[all …]
|