mirror of
https://gitlab.com/libeigen/eigen.git
synced 2025-04-23 10:09:36 +08:00
62 lines
1.3 KiB
C++
62 lines
1.3 KiB
C++
#include <iostream>
|
|
#include <fstream>
|
|
#include <vector>
|
|
#include <string>
|
|
#include "eigen_src/Eigen/Core"
|
|
#include "../BenchTimer.h"
|
|
using namespace Eigen;
|
|
|
|
#ifndef SCALAR
|
|
#error SCALAR must be defined
|
|
#endif
|
|
|
|
typedef SCALAR Scalar;
|
|
|
|
typedef Matrix<Scalar, Dynamic, Dynamic> Mat;
|
|
|
|
template <typename Func>
|
|
EIGEN_DONT_INLINE double bench(long m, long n, long k, const Func& f) {
|
|
Mat A(m, k);
|
|
Mat B(k, n);
|
|
Mat C(m, n);
|
|
A.setRandom();
|
|
B.setRandom();
|
|
C.setZero();
|
|
|
|
BenchTimer t;
|
|
|
|
double up = 1e8 * 4 / sizeof(Scalar);
|
|
double tm0 = 4, tm1 = 10;
|
|
if (NumTraits<Scalar>::IsComplex) {
|
|
up /= 4;
|
|
tm0 = 2;
|
|
tm1 = 4;
|
|
}
|
|
|
|
double flops = 2. * m * n * k;
|
|
long rep = std::max(1., std::min(100., up / flops));
|
|
long tries = std::max(tm0, std::min(tm1, up / flops));
|
|
|
|
BENCH(t, tries, rep, f(A, B, C));
|
|
|
|
return 1e-9 * rep * flops / t.best();
|
|
}
|
|
|
|
template <typename Func>
|
|
int main_gemm(int argc, char** argv, const Func& f) {
|
|
std::vector<double> results;
|
|
|
|
std::string filename = std::string("gemm_settings.txt");
|
|
if (argc > 1) filename = std::string(argv[1]);
|
|
std::ifstream settings(filename);
|
|
long m, n, k;
|
|
while (settings >> m >> n >> k) {
|
|
// std::cerr << " Testing " << m << " " << n << " " << k << std::endl;
|
|
results.push_back(bench(m, n, k, f));
|
|
}
|
|
|
|
std::cout << RowVectorXd::Map(results.data(), results.size());
|
|
|
|
return 0;
|
|
}
|