1*bf2c3715SXin Li // This file is part of Eigen, a lightweight C++ template library
2*bf2c3715SXin Li // for linear algebra.
3*bf2c3715SXin Li //
4*bf2c3715SXin Li // Copyright (C) 2009 Gael Guennebaud <[email protected]>
5*bf2c3715SXin Li //
6*bf2c3715SXin Li // This Source Code Form is subject to the terms of the Mozilla
7*bf2c3715SXin Li // Public License v. 2.0. If a copy of the MPL was not distributed
8*bf2c3715SXin Li // with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
9*bf2c3715SXin Li
10*bf2c3715SXin Li static int nb_load;
11*bf2c3715SXin Li static int nb_loadu;
12*bf2c3715SXin Li static int nb_store;
13*bf2c3715SXin Li static int nb_storeu;
14*bf2c3715SXin Li
15*bf2c3715SXin Li #define EIGEN_DEBUG_ALIGNED_LOAD { nb_load++; }
16*bf2c3715SXin Li #define EIGEN_DEBUG_UNALIGNED_LOAD { nb_loadu++; }
17*bf2c3715SXin Li #define EIGEN_DEBUG_ALIGNED_STORE { nb_store++; }
18*bf2c3715SXin Li #define EIGEN_DEBUG_UNALIGNED_STORE { nb_storeu++; }
19*bf2c3715SXin Li
20*bf2c3715SXin Li #define VERIFY_ALIGNED_UNALIGNED_COUNT(XPR,AL,UL,AS,US) {\
21*bf2c3715SXin Li nb_load = nb_loadu = nb_store = nb_storeu = 0; \
22*bf2c3715SXin Li XPR; \
23*bf2c3715SXin Li if(!(nb_load==AL && nb_loadu==UL && nb_store==AS && nb_storeu==US)) \
24*bf2c3715SXin Li std::cerr << " >> " << nb_load << ", " << nb_loadu << ", " << nb_store << ", " << nb_storeu << "\n"; \
25*bf2c3715SXin Li VERIFY( (#XPR) && nb_load==AL && nb_loadu==UL && nb_store==AS && nb_storeu==US ); \
26*bf2c3715SXin Li }
27*bf2c3715SXin Li
28*bf2c3715SXin Li
29*bf2c3715SXin Li #include "main.h"
30*bf2c3715SXin Li
EIGEN_DECLARE_TEST(unalignedcount)31*bf2c3715SXin Li EIGEN_DECLARE_TEST(unalignedcount)
32*bf2c3715SXin Li {
33*bf2c3715SXin Li #if defined(EIGEN_VECTORIZE_AVX512)
34*bf2c3715SXin Li VectorXf a(48), b(48);
35*bf2c3715SXin Li VERIFY_ALIGNED_UNALIGNED_COUNT(a += b, 6, 0, 3, 0);
36*bf2c3715SXin Li VERIFY_ALIGNED_UNALIGNED_COUNT(a.segment(0,48) += b.segment(0,48), 3, 3, 3, 0);
37*bf2c3715SXin Li VERIFY_ALIGNED_UNALIGNED_COUNT(a.segment(0,48) -= b.segment(0,48), 3, 3, 3, 0);
38*bf2c3715SXin Li VERIFY_ALIGNED_UNALIGNED_COUNT(a.segment(0,48) *= 3.5, 3, 0, 3, 0);
39*bf2c3715SXin Li VERIFY_ALIGNED_UNALIGNED_COUNT(a.segment(0,48) /= 3.5, 3, 0, 3, 0);
40*bf2c3715SXin Li #elif defined(EIGEN_VECTORIZE_AVX)
41*bf2c3715SXin Li VectorXf a(40), b(40);
42*bf2c3715SXin Li VERIFY_ALIGNED_UNALIGNED_COUNT(a += b, 10, 0, 5, 0);
43*bf2c3715SXin Li VERIFY_ALIGNED_UNALIGNED_COUNT(a.segment(0,40) += b.segment(0,40), 5, 5, 5, 0);
44*bf2c3715SXin Li VERIFY_ALIGNED_UNALIGNED_COUNT(a.segment(0,40) -= b.segment(0,40), 5, 5, 5, 0);
45*bf2c3715SXin Li VERIFY_ALIGNED_UNALIGNED_COUNT(a.segment(0,40) *= 3.5, 5, 0, 5, 0);
46*bf2c3715SXin Li VERIFY_ALIGNED_UNALIGNED_COUNT(a.segment(0,40) /= 3.5, 5, 0, 5, 0);
47*bf2c3715SXin Li #elif defined(EIGEN_VECTORIZE_SSE)
48*bf2c3715SXin Li VectorXf a(40), b(40);
49*bf2c3715SXin Li VERIFY_ALIGNED_UNALIGNED_COUNT(a += b, 20, 0, 10, 0);
50*bf2c3715SXin Li VERIFY_ALIGNED_UNALIGNED_COUNT(a.segment(0,40) += b.segment(0,40), 10, 10, 10, 0);
51*bf2c3715SXin Li VERIFY_ALIGNED_UNALIGNED_COUNT(a.segment(0,40) -= b.segment(0,40), 10, 10, 10, 0);
52*bf2c3715SXin Li VERIFY_ALIGNED_UNALIGNED_COUNT(a.segment(0,40) *= 3.5, 10, 0, 10, 0);
53*bf2c3715SXin Li VERIFY_ALIGNED_UNALIGNED_COUNT(a.segment(0,40) /= 3.5, 10, 0, 10, 0);
54*bf2c3715SXin Li #else
55*bf2c3715SXin Li // The following line is to eliminate "variable not used" warnings
56*bf2c3715SXin Li nb_load = nb_loadu = nb_store = nb_storeu = 0;
57*bf2c3715SXin Li int a(0), b(0);
58*bf2c3715SXin Li VERIFY(a==b);
59*bf2c3715SXin Li #endif
60*bf2c3715SXin Li }
61