devtools/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2026-04-10 11:34:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

Migrate Eigen benchmarks to the Google benchmark framework

Browse Source 
libeigen/eigen!2132

Closes #3025

Co-authored-by: Rasmus Munk Larsen <rmlarsen@gmail.com>
This commit is contained in:
Rasmus Munk Larsen
2026-02-17 20:51:36 -08:00
parent 740cac97b4
commit 3108f6360e
23 changed files with 1632 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

51
benchmarks/print_blocking.cpp Normal file
View File

@@ -0,0 +1,51 @@
#include <Eigen/Core>
#include <cstdio>
using namespace Eigen;
using namespace Eigen::internal;
int main() {
printf("%-8s %-8s %-8s | %-8s %-8s %-8s | %-8s %-8s %-8s | %-8s %-8s %-8s\n", "m", "n", "k", "kc_f", "mc_f", "nc_f",
"kc_d", "mc_d", "nc_d", "mr_f", "nr_f", "LhsPr_f");
// Print gebp_traits info
{
using Traits = gebp_traits<float, float>;
printf("Float traits: mr=%d, nr=%d, LhsProgress=%d, RhsProgress=%d, NumberOfRegisters=%d\n", Traits::mr, Traits::nr,
Traits::LhsProgress, Traits::RhsProgress, Traits::NumberOfRegisters);
}
{
using Traits = gebp_traits<double, double>;
printf("Double traits: mr=%d, nr=%d, LhsProgress=%d, RhsProgress=%d, NumberOfRegisters=%d\n", Traits::mr,
Traits::nr, Traits::LhsProgress, Traits::RhsProgress, Traits::NumberOfRegisters);
}
// Print cache sizes
std::ptrdiff_t l1, l2, l3;
manage_caching_sizes(GetAction, &l1, &l2, &l3);
printf("Cache sizes: L1=%ld, L2=%ld, L3=%ld\n", (long)l1, (long)l2, (long)l3);
for (int size : {8, 16, 32, 64, 96, 128, 160, 192, 224, 256, 288, 320, 384, 448, 512, 768, 1024, 1536, 2048}) {
{
Index kf = size, mf = size, nf = size;
computeProductBlockingSizes<float, float>(kf, mf, nf);
Index kd = size, md = size, nd = size;
computeProductBlockingSizes<double, double>(kd, md, nd);
printf("%-8d %-8d %-8d | %-8ld %-8ld %-8ld | %-8ld %-8ld %-8ld\n", size, size, size, (long)kf, (long)mf, (long)nf,
(long)kd, (long)md, (long)nd);
}
}
// Non-square
for (auto [m, n, k] :
std::initializer_list<std::tuple<int, int, int>>{{64, 64, 1024}, {1024, 64, 64}, {64, 1024, 64}}) {
Index kf = k, mf = m, nf = n;
computeProductBlockingSizes<float, float>(kf, mf, nf);
Index kd = k, md = m, nd = n;
computeProductBlockingSizes<double, double>(kd, md, nd);
printf("%-8d %-8d %-8d | %-8ld %-8ld %-8ld | %-8ld %-8ld %-8ld\n", m, n, k, (long)kf, (long)mf, (long)nf, (long)kd,
(long)md, (long)nd);
}
return 0;
}