#include #include #include using namespace Eigen; #ifndef REPEAT #define REPEAT 100000 #endif #ifndef TRIES #define TRIES 20 #endif typedef double Scalar; template __attribute__((noinline)) void bench_reverse(const MatrixType& m) { int rows = m.rows(); int cols = m.cols(); int size = m.size(); int repeats = (REPEAT * 1000) / size; MatrixType a = MatrixType::Random(rows, cols); MatrixType b = MatrixType::Random(rows, cols); BenchTimer timerB, timerH, timerV; Scalar acc = 0; int r = internal::random(0, rows - 1); int c = internal::random(0, cols - 1); for (int t = 0; t < TRIES; ++t) { timerB.start(); for (int k = 0; k < repeats; ++k) { asm("#begin foo"); b = a.reverse(); asm("#end foo"); acc += b.coeff(r, c); } timerB.stop(); } if (MatrixType::RowsAtCompileTime == Dynamic) std::cout << "dyn "; else std::cout << "fixed "; std::cout << rows << " x " << cols << " \t" << (timerB.value() * REPEAT) / repeats << "s " << "(" << 1e-6 * size * repeats / timerB.value() << " MFLOPS)\t"; std::cout << "\n"; // make sure the compiler does not optimize too much if (acc == 123) std::cout << acc; } int main(int argc, char* argv[]) { const int dynsizes[] = {4, 6, 8, 16, 24, 32, 49, 64, 128, 256, 512, 900, 0}; std::cout << "size no sqrt standard"; // #ifdef BENCH_GSL // std::cout << " GSL (standard + double + ATLAS) "; // #endif std::cout << "\n"; for (uint i = 0; dynsizes[i] > 0; ++i) { bench_reverse(Matrix(dynsizes[i], dynsizes[i])); bench_reverse(Matrix(dynsizes[i] * dynsizes[i])); } // bench_reverse(Matrix()); // bench_reverse(Matrix()); // bench_reverse(Matrix()); // bench_reverse(Matrix()); // bench_reverse(Matrix()); // bench_reverse(Matrix()); // bench_reverse(Matrix()); // bench_reverse(Matrix()); // bench_reverse(Matrix()); return 0; }