blob: a69a3738a2017f643a42a3f745ec5f34be1464b4 [file] [log] [blame]
Gael Guennebaudcb71dc42009-01-07 22:20:03 +00001// This file is part of Eigen, a lightweight C++ template library
Benoit Jacob6347b1d2009-05-22 20:25:33 +02002// for linear algebra.
Gael Guennebaudcb71dc42009-01-07 22:20:03 +00003//
Gael Guennebaud28e64b02010-06-24 23:21:58 +02004// Copyright (C) 2008 Gael Guennebaud <gael.guennebaud@inria.fr>
Gael Guennebaudcb71dc42009-01-07 22:20:03 +00005//
6// Eigen is free software; you can redistribute it and/or
7// modify it under the terms of the GNU Lesser General Public
8// License as published by the Free Software Foundation; either
9// version 3 of the License, or (at your option) any later version.
10//
11// Alternatively, you can redistribute it and/or
12// modify it under the terms of the GNU General Public License as
13// published by the Free Software Foundation; either version 2 of
14// the License, or (at your option) any later version.
15//
16// Eigen is distributed in the hope that it will be useful, but WITHOUT ANY
17// WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
18// FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License or the
19// GNU General Public License for more details.
20//
21// You should have received a copy of the GNU Lesser General Public
22// License and a copy of the GNU General Public License along with
23// Eigen. If not, see <http://www.gnu.org/licenses/>.
24
Benoit Jacob27f52502010-02-27 19:04:22 -050025#define EIGEN_DEBUG_ASSIGN
Gael Guennebaudcb71dc42009-01-07 22:20:03 +000026#include "main.h"
27#include <typeinfo>
28
Gael Guennebaud51ec1882010-07-08 23:30:16 +020029std::string demangle_traversal(int t)
30{
31 if(t==DefaultTraversal) return "DefaultTraversal";
32 if(t==LinearTraversal) return "LinearTraversal";
33 if(t==InnerVectorizedTraversal) return "InnerVectorizedTraversal";
34 if(t==LinearVectorizedTraversal) return "LinearVectorizedTraversal";
35 if(t==SliceVectorizedTraversal) return "SliceVectorizedTraversal";
36 return "?";
37}
38std::string demangle_unrolling(int t)
39{
40 if(t==NoUnrolling) return "NoUnrolling";
41 if(t==InnerUnrolling) return "InnerUnrolling";
42 if(t==CompleteUnrolling) return "CompleteUnrolling";
43 return "?";
44}
45
Gael Guennebaudcb71dc42009-01-07 22:20:03 +000046template<typename Dst, typename Src>
Benoit Jacob94c706d2009-11-18 11:57:07 -050047bool test_assign(const Dst&, const Src&, int traversal, int unrolling)
Gael Guennebaudcb71dc42009-01-07 22:20:03 +000048{
Benoit Jacob47160402010-10-25 10:15:22 -040049 internal::assign_traits<Dst,Src>::debug();
50 bool res = internal::assign_traits<Dst,Src>::Traversal==traversal
51 && internal::assign_traits<Dst,Src>::Unrolling==unrolling;
Gael Guennebaud51ec1882010-07-08 23:30:16 +020052 if(!res)
53 {
54 std::cerr << " Expected Traversal == " << demangle_traversal(traversal)
Benoit Jacob47160402010-10-25 10:15:22 -040055 << " got " << demangle_traversal(internal::assign_traits<Dst,Src>::Traversal) << "\n";
Gael Guennebaud51ec1882010-07-08 23:30:16 +020056 std::cerr << " Expected Unrolling == " << demangle_unrolling(unrolling)
Benoit Jacob47160402010-10-25 10:15:22 -040057 << " got " << demangle_unrolling(internal::assign_traits<Dst,Src>::Unrolling) << "\n";
Gael Guennebaud51ec1882010-07-08 23:30:16 +020058 }
59 return res;
Gael Guennebaudcb71dc42009-01-07 22:20:03 +000060}
61
Benoit Jacobb1f666d2010-02-26 20:12:51 -050062template<typename Dst, typename Src>
63bool test_assign(int traversal, int unrolling)
64{
Benoit Jacob47160402010-10-25 10:15:22 -040065 internal::assign_traits<Dst,Src>::debug();
66 bool res = internal::assign_traits<Dst,Src>::Traversal==traversal
67 && internal::assign_traits<Dst,Src>::Unrolling==unrolling;
Gael Guennebaud51ec1882010-07-08 23:30:16 +020068 if(!res)
69 {
70 std::cerr << " Expected Traversal == " << demangle_traversal(traversal)
Benoit Jacob47160402010-10-25 10:15:22 -040071 << " got " << demangle_traversal(internal::assign_traits<Dst,Src>::Traversal) << "\n";
Gael Guennebaud51ec1882010-07-08 23:30:16 +020072 std::cerr << " Expected Unrolling == " << demangle_unrolling(unrolling)
Benoit Jacob47160402010-10-25 10:15:22 -040073 << " got " << demangle_unrolling(internal::assign_traits<Dst,Src>::Unrolling) << "\n";
Gael Guennebaud51ec1882010-07-08 23:30:16 +020074 }
75 return res;
Benoit Jacobb1f666d2010-02-26 20:12:51 -050076}
77
Gael Guennebaudcb71dc42009-01-07 22:20:03 +000078template<typename Xpr>
Benoit Jacob94c706d2009-11-18 11:57:07 -050079bool test_redux(const Xpr&, int traversal, int unrolling)
Gael Guennebaudcb71dc42009-01-07 22:20:03 +000080{
Benoit Jacob47160402010-10-25 10:15:22 -040081 typedef internal::redux_traits<internal::scalar_sum_op<typename Xpr::Scalar>,Xpr> traits;
Gael Guennebaud51ec1882010-07-08 23:30:16 +020082 bool res = traits::Traversal==traversal && traits::Unrolling==unrolling;
83 if(!res)
84 {
85 std::cerr << " Expected Traversal == " << demangle_traversal(traversal)
86 << " got " << demangle_traversal(traits::Traversal) << "\n";
87 std::cerr << " Expected Unrolling == " << demangle_unrolling(unrolling)
88 << " got " << demangle_unrolling(traits::Unrolling) << "\n";
89 }
90 return res;
Gael Guennebaudcb71dc42009-01-07 22:20:03 +000091}
92
Benoit Jacob47160402010-10-25 10:15:22 -040093template<typename Scalar, bool Enable = internal::packet_traits<Scalar>::Vectorizable> struct vectorization_logic
Gael Guennebaud51ec1882010-07-08 23:30:16 +020094{
95 enum {
Benoit Jacob47160402010-10-25 10:15:22 -040096 PacketSize = internal::packet_traits<Scalar>::size
Gael Guennebaud51ec1882010-07-08 23:30:16 +020097 };
98 static void run()
99 {
100
101 typedef Matrix<Scalar,PacketSize,1> Vector1;
102 typedef Matrix<Scalar,Dynamic,1> VectorX;
103 typedef Matrix<Scalar,Dynamic,Dynamic> MatrixXX;
104 typedef Matrix<Scalar,PacketSize,PacketSize> Matrix11;
105 typedef Matrix<Scalar,2*PacketSize,2*PacketSize> Matrix22;
Gael Guennebaud64356a62011-01-04 14:18:07 +0100106 typedef Matrix<Scalar,(Matrix11::Flags&RowMajorBit)?16:4*PacketSize,(Matrix11::Flags&RowMajorBit)?4*PacketSize:16> Matrix44;
107 typedef Matrix<Scalar,(Matrix11::Flags&RowMajorBit)?16:4*PacketSize,(Matrix11::Flags&RowMajorBit)?4*PacketSize:16,DontAlign|EIGEN_DEFAULT_MATRIX_STORAGE_ORDER_OPTION> Matrix44u;
Gael Guennebaud51ec1882010-07-08 23:30:16 +0200108 typedef Matrix<Scalar,4*PacketSize,16,ColMajor> Matrix44c;
109 typedef Matrix<Scalar,4*PacketSize,16,RowMajor> Matrix44r;
110
111 typedef Matrix<Scalar,
112 (PacketSize==8 ? 4 : PacketSize==4 ? 2 : PacketSize==2 ? 1 : /*PacketSize==1 ?*/ 1),
113 (PacketSize==8 ? 2 : PacketSize==4 ? 2 : PacketSize==2 ? 2 : /*PacketSize==1 ?*/ 1)
114 > Matrix1;
115
116 typedef Matrix<Scalar,
117 (PacketSize==8 ? 4 : PacketSize==4 ? 2 : PacketSize==2 ? 1 : /*PacketSize==1 ?*/ 1),
118 (PacketSize==8 ? 2 : PacketSize==4 ? 2 : PacketSize==2 ? 2 : /*PacketSize==1 ?*/ 1),
119 DontAlign|((Matrix1::Flags&RowMajorBit)?RowMajor:ColMajor)> Matrix1u;
120
Gael Guennebaud64356a62011-01-04 14:18:07 +0100121 // this type is made such that it can only be vectorized when viewed as a linear 1D vector
Gael Guennebaud51ec1882010-07-08 23:30:16 +0200122 typedef Matrix<Scalar,
Gael Guennebaud64356a62011-01-04 14:18:07 +0100123 (PacketSize==8 ? 4 : PacketSize==4 ? 6 : PacketSize==2 ? ((Matrix11::Flags&RowMajorBit)?2:3) : /*PacketSize==1 ?*/ 1),
124 (PacketSize==8 ? 6 : PacketSize==4 ? 2 : PacketSize==2 ? ((Matrix11::Flags&RowMajorBit)?3:2) : /*PacketSize==1 ?*/ 3)
Gael Guennebaud51ec1882010-07-08 23:30:16 +0200125 > Matrix3;
Gael Guennebaud501bc602011-05-19 21:52:40 +0200126
127 #if !EIGEN_GCC_AND_ARCH_DOESNT_WANT_STACK_ALIGNMENT
Gael Guennebaud51ec1882010-07-08 23:30:16 +0200128 VERIFY(test_assign(Vector1(),Vector1(),
129 InnerVectorizedTraversal,CompleteUnrolling));
130 VERIFY(test_assign(Vector1(),Vector1()+Vector1(),
131 InnerVectorizedTraversal,CompleteUnrolling));
132 VERIFY(test_assign(Vector1(),Vector1().cwiseProduct(Vector1()),
133 InnerVectorizedTraversal,CompleteUnrolling));
134 VERIFY(test_assign(Vector1(),Vector1().template cast<Scalar>(),
135 InnerVectorizedTraversal,CompleteUnrolling));
136
137
138 VERIFY(test_assign(Vector1(),Vector1(),
139 InnerVectorizedTraversal,CompleteUnrolling));
140 VERIFY(test_assign(Vector1(),Vector1()+Vector1(),
141 InnerVectorizedTraversal,CompleteUnrolling));
142 VERIFY(test_assign(Vector1(),Vector1().cwiseProduct(Vector1()),
143 InnerVectorizedTraversal,CompleteUnrolling));
144
145 VERIFY(test_assign(Matrix44(),Matrix44()+Matrix44(),
146 InnerVectorizedTraversal,InnerUnrolling));
147
148 VERIFY(test_assign(Matrix44u(),Matrix44()+Matrix44(),
149 LinearTraversal,NoUnrolling));
150
151 VERIFY(test_assign(Matrix1u(),Matrix1()+Matrix1(),
152 LinearTraversal,CompleteUnrolling));
153
Gael Guennebaudaa2b46a2010-07-23 16:29:29 +0200154 VERIFY(test_assign(Matrix44c().col(1),Matrix44c().col(2)+Matrix44c().col(3),
155 InnerVectorizedTraversal,CompleteUnrolling));
156
157 VERIFY(test_assign(Matrix44r().row(2),Matrix44r().row(1)+Matrix44r().row(1),
158 InnerVectorizedTraversal,CompleteUnrolling));
159
Gael Guennebaud51ec1882010-07-08 23:30:16 +0200160 if(PacketSize>1)
161 {
Gael Guennebaudaa2b46a2010-07-23 16:29:29 +0200162 typedef Matrix<Scalar,3,3,ColMajor> Matrix33c;
163 VERIFY(test_assign(Matrix33c().row(2),Matrix33c().row(1)+Matrix33c().row(1),
164 LinearTraversal,CompleteUnrolling));
165 VERIFY(test_assign(Matrix33c().col(0),Matrix33c().col(1)+Matrix33c().col(1),
166 LinearTraversal,CompleteUnrolling));
167
Gael Guennebaud51ec1882010-07-08 23:30:16 +0200168 VERIFY(test_assign(Matrix3(),Matrix3().cwiseQuotient(Matrix3()),
169 LinearVectorizedTraversal,CompleteUnrolling));
170
171 VERIFY(test_assign(Matrix<Scalar,17,17>(),Matrix<Scalar,17,17>()+Matrix<Scalar,17,17>(),
172 LinearTraversal,NoUnrolling));
173
174 VERIFY(test_assign(Matrix11(),Matrix<Scalar,17,17>().template block<PacketSize,PacketSize>(2,3)+Matrix<Scalar,17,17>().template block<PacketSize,PacketSize>(10,4),
175 DefaultTraversal,CompleteUnrolling));
176 }
Gael Guennebaud501bc602011-05-19 21:52:40 +0200177
Gael Guennebaud51ec1882010-07-08 23:30:16 +0200178 VERIFY(test_redux(Matrix3(),
179 LinearVectorizedTraversal,CompleteUnrolling));
180
181 VERIFY(test_redux(Matrix44(),
182 LinearVectorizedTraversal,NoUnrolling));
183
Gael Guennebaud64356a62011-01-04 14:18:07 +0100184 VERIFY(test_redux(Matrix44().template block<(Matrix1::Flags&RowMajorBit)?4:PacketSize,(Matrix1::Flags&RowMajorBit)?PacketSize:4>(1,2),
Gael Guennebaud51ec1882010-07-08 23:30:16 +0200185 DefaultTraversal,CompleteUnrolling));
186
187 VERIFY(test_redux(Matrix44c().template block<2*PacketSize,1>(1,2),
188 LinearVectorizedTraversal,CompleteUnrolling));
189
190 VERIFY(test_redux(Matrix44r().template block<1,2*PacketSize>(2,1),
191 LinearVectorizedTraversal,CompleteUnrolling));
Gael Guennebaud501bc602011-05-19 21:52:40 +0200192
193 VERIFY((test_assign<
194 Map<Matrix22, Aligned, OuterStride<3*PacketSize> >,
195 Matrix22
196 >(InnerVectorizedTraversal,CompleteUnrolling)));
197
198 VERIFY((test_assign<
199 Map<Matrix22, Aligned, InnerStride<3*PacketSize> >,
200 Matrix22
201 >(DefaultTraversal,CompleteUnrolling)));
202
203 VERIFY((test_assign(Matrix11(), Matrix11()*Matrix11(), InnerVectorizedTraversal, CompleteUnrolling)));
204 #endif
205
206 VERIFY(test_assign(MatrixXX(10,10),MatrixXX(20,20).block(10,10,2,3),
207 SliceVectorizedTraversal,NoUnrolling));
208
209 VERIFY(test_redux(VectorX(10),
210 LinearVectorizedTraversal,NoUnrolling));
211
212
Gael Guennebaud51ec1882010-07-08 23:30:16 +0200213 }
214};
215
216template<typename Scalar> struct vectorization_logic<Scalar,false>
217{
218 static void run() {}
219};
220
Gael Guennebaudcb71dc42009-01-07 22:20:03 +0000221void test_vectorization_logic()
222{
223
224#ifdef EIGEN_VECTORIZE
225
Gael Guennebaud501bc602011-05-19 21:52:40 +0200226 CALL_SUBTEST( vectorization_logic<float>::run() );
227 CALL_SUBTEST( vectorization_logic<double>::run() );
228 CALL_SUBTEST( vectorization_logic<std::complex<float> >::run() );
229 CALL_SUBTEST( vectorization_logic<std::complex<double> >::run() );
Gael Guennebaud51ec1882010-07-08 23:30:16 +0200230
Benoit Jacob47160402010-10-25 10:15:22 -0400231 if(internal::packet_traits<float>::Vectorizable)
Gael Guennebaud51ec1882010-07-08 23:30:16 +0200232 {
233 VERIFY(test_assign(Matrix<float,3,3>(),Matrix<float,3,3>()+Matrix<float,3,3>(),
234 LinearTraversal,CompleteUnrolling));
235
236 VERIFY(test_redux(Matrix<float,5,2>(),
237 DefaultTraversal,CompleteUnrolling));
238 }
239
Benoit Jacob47160402010-10-25 10:15:22 -0400240 if(internal::packet_traits<double>::Vectorizable)
Gael Guennebaud51ec1882010-07-08 23:30:16 +0200241 {
242 VERIFY(test_assign(Matrix<double,3,3>(),Matrix<double,3,3>()+Matrix<double,3,3>(),
243 LinearTraversal,CompleteUnrolling));
244
245 VERIFY(test_redux(Matrix<double,7,3>(),
246 DefaultTraversal,CompleteUnrolling));
247 }
Gael Guennebaudcb71dc42009-01-07 22:20:03 +0000248#endif // EIGEN_VECTORIZE
249
250}