1*bf2c3715SXin Li
2*bf2c3715SXin Li #include <iostream>
3*bf2c3715SXin Li #include <Eigen/Core>
4*bf2c3715SXin Li #include <bench/BenchUtil.h>
5*bf2c3715SXin Li using namespace Eigen;
6*bf2c3715SXin Li
7*bf2c3715SXin Li #ifndef REPEAT
8*bf2c3715SXin Li #define REPEAT 100000
9*bf2c3715SXin Li #endif
10*bf2c3715SXin Li
11*bf2c3715SXin Li #ifndef TRIES
12*bf2c3715SXin Li #define TRIES 20
13*bf2c3715SXin Li #endif
14*bf2c3715SXin Li
15*bf2c3715SXin Li typedef double Scalar;
16*bf2c3715SXin Li
17*bf2c3715SXin Li template <typename MatrixType>
bench_reverse(const MatrixType & m)18*bf2c3715SXin Li __attribute__ ((noinline)) void bench_reverse(const MatrixType& m)
19*bf2c3715SXin Li {
20*bf2c3715SXin Li int rows = m.rows();
21*bf2c3715SXin Li int cols = m.cols();
22*bf2c3715SXin Li int size = m.size();
23*bf2c3715SXin Li
24*bf2c3715SXin Li int repeats = (REPEAT*1000)/size;
25*bf2c3715SXin Li MatrixType a = MatrixType::Random(rows,cols);
26*bf2c3715SXin Li MatrixType b = MatrixType::Random(rows,cols);
27*bf2c3715SXin Li
28*bf2c3715SXin Li BenchTimer timerB, timerH, timerV;
29*bf2c3715SXin Li
30*bf2c3715SXin Li Scalar acc = 0;
31*bf2c3715SXin Li int r = internal::random<int>(0,rows-1);
32*bf2c3715SXin Li int c = internal::random<int>(0,cols-1);
33*bf2c3715SXin Li for (int t=0; t<TRIES; ++t)
34*bf2c3715SXin Li {
35*bf2c3715SXin Li timerB.start();
36*bf2c3715SXin Li for (int k=0; k<repeats; ++k)
37*bf2c3715SXin Li {
38*bf2c3715SXin Li asm("#begin foo");
39*bf2c3715SXin Li b = a.reverse();
40*bf2c3715SXin Li asm("#end foo");
41*bf2c3715SXin Li acc += b.coeff(r,c);
42*bf2c3715SXin Li }
43*bf2c3715SXin Li timerB.stop();
44*bf2c3715SXin Li }
45*bf2c3715SXin Li
46*bf2c3715SXin Li if (MatrixType::RowsAtCompileTime==Dynamic)
47*bf2c3715SXin Li std::cout << "dyn ";
48*bf2c3715SXin Li else
49*bf2c3715SXin Li std::cout << "fixed ";
50*bf2c3715SXin Li std::cout << rows << " x " << cols << " \t"
51*bf2c3715SXin Li << (timerB.value() * REPEAT) / repeats << "s "
52*bf2c3715SXin Li << "(" << 1e-6 * size*repeats/timerB.value() << " MFLOPS)\t";
53*bf2c3715SXin Li
54*bf2c3715SXin Li std::cout << "\n";
55*bf2c3715SXin Li // make sure the compiler does not optimize too much
56*bf2c3715SXin Li if (acc==123)
57*bf2c3715SXin Li std::cout << acc;
58*bf2c3715SXin Li }
59*bf2c3715SXin Li
main(int argc,char * argv[])60*bf2c3715SXin Li int main(int argc, char* argv[])
61*bf2c3715SXin Li {
62*bf2c3715SXin Li const int dynsizes[] = {4,6,8,16,24,32,49,64,128,256,512,900,0};
63*bf2c3715SXin Li std::cout << "size no sqrt standard";
64*bf2c3715SXin Li // #ifdef BENCH_GSL
65*bf2c3715SXin Li // std::cout << " GSL (standard + double + ATLAS) ";
66*bf2c3715SXin Li // #endif
67*bf2c3715SXin Li std::cout << "\n";
68*bf2c3715SXin Li for (uint i=0; dynsizes[i]>0; ++i)
69*bf2c3715SXin Li {
70*bf2c3715SXin Li bench_reverse(Matrix<Scalar,Dynamic,Dynamic>(dynsizes[i],dynsizes[i]));
71*bf2c3715SXin Li bench_reverse(Matrix<Scalar,Dynamic,1>(dynsizes[i]*dynsizes[i]));
72*bf2c3715SXin Li }
73*bf2c3715SXin Li // bench_reverse(Matrix<Scalar,2,2>());
74*bf2c3715SXin Li // bench_reverse(Matrix<Scalar,3,3>());
75*bf2c3715SXin Li // bench_reverse(Matrix<Scalar,4,4>());
76*bf2c3715SXin Li // bench_reverse(Matrix<Scalar,5,5>());
77*bf2c3715SXin Li // bench_reverse(Matrix<Scalar,6,6>());
78*bf2c3715SXin Li // bench_reverse(Matrix<Scalar,7,7>());
79*bf2c3715SXin Li // bench_reverse(Matrix<Scalar,8,8>());
80*bf2c3715SXin Li // bench_reverse(Matrix<Scalar,12,12>());
81*bf2c3715SXin Li // bench_reverse(Matrix<Scalar,16,16>());
82*bf2c3715SXin Li return 0;
83*bf2c3715SXin Li }
84*bf2c3715SXin Li
85