| /external/eigen/test/ |
| D | product_notemporary.cpp | 31 m3(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 | 61 MatrixType m1(rows, cols), m3(rows, cols2); in lu_non_invertible() local
95 m3 = m1*m2; 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()
102 m3 = MatrixType::Random(rows,cols2); in lu_non_invertible()
103 m2 = m1.transpose()*m3; in lu_non_invertible()
104 m3 = MatrixType::Random(rows,cols2); 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()
107 m3 = MatrixType::Random(rows,cols2); in lu_non_invertible()
[all …]
|
| 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 | array.cpp | 25 m3(rows, cols); in array() local
42 m3 = m1; in array()
43 m3 += s2; in array()
44 VERIFY_IS_APPROX(m3, m1 + s2); in array()
45 m3 = m1; in array()
46 m3 -= s1; in array()
47 VERIFY_IS_APPROX(m3, m1 - s1); in array()
50 m3 = m1; in array()
52 VERIFY_IS_APPROX(m1, m3 - m2); in array()
54 m3 = m1; in array()
[all …]
|
| D | selfadjoint.cpp | 25 m3(rows, cols), in selfadjoint() local
31 m3 = m1.template selfadjointView<Upper>(); in selfadjoint()
32 …VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Upper>()), MatrixType(m1.template triangula… in selfadjoint()
33 VERIFY_IS_APPROX(m3, m3.adjoint()); in selfadjoint()
35 m3 = m1.template selfadjointView<Lower>(); in selfadjoint()
36 …VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Lower>()), MatrixType(m1.template triangula… in selfadjoint()
37 VERIFY_IS_APPROX(m3, m3.adjoint()); in selfadjoint()
39 m3 = m1.template selfadjointView<Upper>(); in selfadjoint()
42 VERIFY_IS_APPROX(m4, m2+m3); in selfadjoint()
44 m3 = m1.template selfadjointView<Lower>(); in selfadjoint()
[all …]
|
| /external/libaom/libaom/aom_dsp/x86/ |
| D | highbd_sad4d_sse2.asm | 31 mova m3, m0
33 psubusw m3, m4
37 por m4, m3
41 mova m3, m0
43 psubusw m3, m6
47 por m6, m3
55 mova m3, m0
56 psubusw m3, m2
58 por m2, m3
63 mova m3, m0
[all …]
|
| D | highbd_sad_sse2.asm | 68 movu m3, [refq+32]
73 pavgw m3, [second_predq+mmsize*2]
86 psubusw m5, m3
87 psubusw m3, [srcq+32]
88 por m3, m5
94 paddw m3, m4
96 movhlps m4, m3
98 paddw m3, m4
100 punpcklwd m3, m6
102 paddd m0, m3
[all …]
|
| D | highbd_subpel_variance_impl_sse2.asm | 68 movhlps m3, m7
70 paddd m7, m3
72 pshufd m3, m7, 0x1
74 paddd m7, m3
187 mova m3, [dstq + 16]
192 SUM_SSE m0, m1, m2, m3, m6, m7
203 mova m3, [dstq + dst_strideq*2]
209 SUM_SSE m0, m1, m2, m3, m6, m7
233 mova m3, [dstq+16]
240 SUM_SSE m0, m2, m1, m3, m6, m7
[all …]
|
| D | fwd_txfm_ssse3_x86_64.asm | 61 mova m3, [inputq + r3]
73 psllw m3, 2
90 paddw m6, m3, m4
91 psubw m3, m4
131 paddw m9, m3, m1
132 psubw m3, m1
157 punpcklwd m11, m0, m3
158 punpckhwd m0, m3
161 pmaddwd m3, m0, [GLOBAL(pw_9102_13623)]
165 paddd m3, m8
[all …]
|
| D | aom_convolve_copy_sse2.asm | 65 movu m3, [srcq+48]
70 pavg m3, [dstq+48]
75 mova [dstq+48], m3
79 movu m3, [srcq+112]
84 pavg m3, [dstq+112]
89 mova [dstq+112], m3
93 movu m3, [srcq+128+48]
98 pavg m3, [dstq+128+48]
103 mova [dstq+128+48], m3
107 movu m3, [srcq+128+112]
[all …]
|
| D | aom_subpixel_8t_ssse3.asm | 46 pshuflw m3, m4, 11111111b ;k6_k7
50 punpcklqdq m3, m3
54 mova k6k7, m3
123 punpckhbw m3, m5, m5
129 palignr m2, m3, m5, 1
131 palignr m3, m5, 5
132 pmaddubsw m3, k2k3k6k7
135 punpckhqdq m5, m1, m3
136 punpcklqdq m1, m3
147 pxor m3, m3
[all …]
|
| D | sad_sse2.asm | 60 movu m3, [refq+32]
65 pavgb m3, [second_predq+mmsize*2]
70 psadbw m3, [srcq+32]
74 paddd m3, m4
76 paddd m0, m3
80 movu m3, [refq+96]
85 pavgb m3, [second_predq+mmsize*6]
91 psadbw m3, [srcq+96]
98 paddd m3, m4
100 paddd m0, m3
[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 | intrapred_ssse3.asm | 43 pavgb m3, m2, m0
47 psubb m3, m2
48 pavgb m0, m3
96 pavgb m3, m2, m4
102 psubb m3, m2
103 pavgb m4, m3
104 pavgb m3, m0, m6
107 psubb m3, m0
108 pavgb m5, m3
116 palignr m3, m4, m5, 1
[all …]
|
| D | fwd_txfm_ssse3_x86_64.asm | 43 mova m3, [inputq + r3]
55 psllw m3, 2
72 paddw m6, m3, m4
73 psubw m3, m4
113 paddw m9, m3, m1
114 psubw m3, m1
139 punpcklwd m11, m0, m3
140 punpckhwd m0, m3
143 pmaddwd m3, m0, [GLOBAL(pw_9102_13623)]
147 paddd m3, m8
[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
184 mova m3, [refq + 16]
189 SUM_SSE m0, m1, m2, m3, m6, m7
200 mova m3, [refq + ref_strideq*2]
206 SUM_SSE m0, m1, m2, m3, m6, m7
230 mova m3, [refq+16]
237 SUM_SSE m0, m2, m1, m3, m6, m7
[all …]
|
| /external/python/cpython3/Modules/_blake2/impl/ |
| D | blake2s-load-sse41.h | 26 buf = TOI(_mm_shuffle_ps(TOF(m2), TOF(m3), _MM_SHUFFLE(2,0,2,0)));
29 buf = TOI(_mm_shuffle_ps(TOF(m2), TOF(m3), _MM_SHUFFLE(3,1,3,1)));
33 t1 = _mm_slli_si128(m3, 4); \
39 t1 = _mm_blend_epi16(m1,m3,0xC0); \
51 t1 = _mm_slli_si128(m3, 4); \
56 t0 = _mm_unpackhi_epi32(m2,m3); \
57 t1 = _mm_blend_epi16(m3,m1,0x0C); \
64 t2 = _mm_slli_si128(m3, 8); \
74 t0 = _mm_slli_si128(m3, 4); \
82 t2 = _mm_blend_epi16(t1, m3, 0x0C); \
[all …]
|
| D | blake2b-load-sse41.h | 23 b1 = _mm_unpacklo_epi64(m2, m3); \
31 b1 = _mm_unpackhi_epi64(m2, m3); \
63 b1 = _mm_alignr_epi8(m3, m7, 8); \
79 b1 = _mm_unpackhi_epi64(m3, m1); \
103 b1 = _mm_unpackhi_epi64(m3, m4); \
110 b0 = _mm_unpacklo_epi64(m7, m3); \
118 b0 = _mm_unpackhi_epi64(m3, m1); \
142 b0 = _mm_unpacklo_epi64(m3, m5); \
158 b0 = _mm_blend_epi16(m0, m3, 0xF0); \
167 b1 = _mm_blend_epi16(m3, m1, 0xF0); \
[all …]
|
| /external/libcxx/test/std/containers/associative/multiset/multiset.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()
99 M m3(C(3), A(5)); in main() local
100 m3 = std::move(m1); in main()
101 assert(m3 == m2); in main()
102 assert(m3.get_allocator() == A(5)); in main()
103 assert(m3.key_comp() == C(5)); in main()
[all …]
|
| /external/libcxx/test/std/containers/associative/set/set.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()
99 M m3(C(3), A(5)); in main() local
100 m3 = std::move(m1); in main()
101 assert(m3 == m2); in main()
102 assert(m3.get_allocator() == A(5)); in main()
103 assert(m3.key_comp() == C(5)); in main()
[all …]
|
| /external/libcxx/test/std/containers/associative/map/map.cons/ |
| D | move_assign.pass.cpp | 61 M m3(C(3), A(7)); in main() local
62 m3 = std::move(m1); in main()
63 assert(m3 == m2); in main()
64 assert(m3.get_allocator() == A(7)); in main()
65 assert(m3.key_comp() == C(5)); in main()
101 M m3(C(3), A(5)); in main() local
102 m3 = std::move(m1); in main()
103 assert(m3 == m2); in main()
104 assert(m3.get_allocator() == A(5)); in main()
105 assert(m3.key_comp() == C(5)); in main()
[all …]
|
| /external/libcxx/test/std/containers/associative/multimap/multimap.cons/ |
| D | move_assign.pass.cpp | 61 M m3(C(3), A(7)); in main() local
62 m3 = std::move(m1); in main()
63 assert(m3 == m2); in main()
64 assert(m3.get_allocator() == A(7)); in main()
65 assert(m3.key_comp() == C(5)); in main()
101 M m3(C(3), A(5)); in main() local
102 m3 = std::move(m1); in main()
103 assert(m3 == m2); in main()
104 assert(m3.get_allocator() == A(5)); in main()
105 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 …]
|