Clang-format tests, examples, libraries, benchmarks, etc.

bench/perf_monitoring/gemm.cpp

@@ -1,12 +1,5 @@
 #include "gemm_common.h"
 
-EIGEN_DONT_INLINE
-void gemm(const Mat &A, const Mat &B, Mat &C)
-{
-  C.noalias() += A * B;
-}
+EIGEN_DONT_INLINE void gemm(const Mat &A, const Mat &B, Mat &C) { C.noalias() += A * B; }
 
-int main(int argc, char **argv)
-{
-  return main_gemm(argc, argv, gemm);
-}
+int main(int argc, char **argv) { return main_gemm(argc, argv, gemm); }

bench/perf_monitoring/gemm_common.h

@@ -12,56 +12,50 @@ using namespace Eigen;
 
 typedef SCALAR Scalar;
 
-typedef Matrix<Scalar,Dynamic,Dynamic> Mat;
+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);
+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 up = 1e8 * 4 / sizeof(Scalar);
   double tm0 = 4, tm1 = 10;
-  if(NumTraits<Scalar>::IsComplex)
-  {
+  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));
-  
+  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)
-{
+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]);
+  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) );
+  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;
 }

bench/perf_monitoring/gemv.cpp

@@ -1,12 +1,5 @@
 #include "gemv_common.h"
 
-EIGEN_DONT_INLINE
-void gemv(const Mat &A, const Vec &B, Vec &C)
-{
-  C.noalias() += A * B;
-}
+EIGEN_DONT_INLINE void gemv(const Mat &A, const Vec &B, Vec &C) { C.noalias() += A * B; }
 
-int main(int argc, char **argv)
-{
-  return main_gemv(argc, argv, gemv);
-}
+int main(int argc, char **argv) { return main_gemv(argc, argv, gemv); }

bench/perf_monitoring/gemv_common.h

@@ -13,14 +13,12 @@ using namespace Eigen;
 
 typedef SCALAR Scalar;
 
-typedef Matrix<Scalar,Dynamic,Dynamic> Mat;
-typedef Matrix<Scalar,Dynamic,1>       Vec;
+typedef Matrix<Scalar, Dynamic, Dynamic> Mat;
+typedef Matrix<Scalar, Dynamic, 1> Vec;
 
-template<typename Func>
-EIGEN_DONT_INLINE
-double bench(long m, long n, Func &f)
-{
-  Mat A(m,n);
+template <typename Func>
+EIGEN_DONT_INLINE double bench(long m, long n, Func &f) {
+  Mat A(m, n);
   Vec B(n);
   Vec C(m);
   A.setRandom();
@@ -29,38 +27,34 @@ double bench(long m, long n, Func &f)
 
   BenchTimer t;
 
-  double up = 1e8/sizeof(Scalar);
+  double up = 1e8 / sizeof(Scalar);
   double tm0 = 4, tm1 = 10;
-  if(NumTraits<Scalar>::IsComplex)
-  {
+  if (NumTraits<Scalar>::IsComplex) {
     up /= 4;
     tm0 = 2;
     tm1 = 4;
   }
 
   double flops = 2. * m * n;
-  long rep = std::max(1., std::min(100., up/flops) );
-  long tries = std::max(tm0, std::min(tm1, up/flops) );
+  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));
+  BENCH(t, tries, rep, f(A, B, C));
 
   return 1e-9 * rep * flops / t.best();
 }
 
-template<typename Func>
-int main_gemv(int argc, char **argv, Func& f)
-{
+template <typename Func>
+int main_gemv(int argc, char **argv, Func &f) {
   std::vector<double> results;
 
   std::string filename = std::string("gemv_settings.txt");
-  if(argc>1)
-    filename = std::string(argv[1]);
+  if (argc > 1) filename = std::string(argv[1]);
   std::ifstream settings(filename);
   long m, n;
-  while(settings >> m >> n)
-  {
-    //std::cerr << "  Testing " << m << " " << n << std::endl;
-    results.push_back( bench(m, n, f) );
+  while (settings >> m >> n) {
+    // std::cerr << "  Testing " << m << " " << n << std::endl;
+    results.push_back(bench(m, n, f));
   }
 
   std::cout << RowVectorXd::Map(results.data(), results.size());

bench/perf_monitoring/gemvt.cpp

@@ -1,12 +1,5 @@
 #include "gemv_common.h"
 
-EIGEN_DONT_INLINE
-void gemv(const Mat &A, Vec &B, const Vec &C)
-{
-  B.noalias() += A.transpose() * C;
-}
+EIGEN_DONT_INLINE void gemv(const Mat &A, Vec &B, const Vec &C) { B.noalias() += A.transpose() * C; }
 
-int main(int argc, char **argv)
-{
-  return main_gemv(argc, argv, gemv);
-}
+int main(int argc, char **argv) { return main_gemv(argc, argv, gemv); }

bench/perf_monitoring/lazy_gemm.cpp

@@ -11,91 +11,105 @@ using namespace Eigen;
 
 typedef SCALAR Scalar;
 
-template<typename MatA, typename MatB, typename MatC>
-EIGEN_DONT_INLINE
-void lazy_gemm(const MatA &A, const MatB &B, MatC &C)
-{
-//   escape((void*)A.data());
-//   escape((void*)B.data());
+template <typename MatA, typename MatB, typename MatC>
+EIGEN_DONT_INLINE void lazy_gemm(const MatA &A, const MatB &B, MatC &C) {
+  //   escape((void*)A.data());
+  //   escape((void*)B.data());
   C.noalias() += A.lazyProduct(B);
-//   escape((void*)C.data());
+  //   escape((void*)C.data());
 }
 
-template<int m, int n, int k, int TA>
-EIGEN_DONT_INLINE
-double bench()
-{
-  typedef Matrix<Scalar,m,k,TA> MatA;
-  typedef Matrix<Scalar,k,n> MatB;
-  typedef Matrix<Scalar,m,n> MatC;
+template <int m, int n, int k, int TA>
+EIGEN_DONT_INLINE double bench() {
+  typedef Matrix<Scalar, m, k, TA> MatA;
+  typedef Matrix<Scalar, k, n> MatB;
+  typedef Matrix<Scalar, m, n> MatC;
 
-  MatA A(m,k);
-  MatB B(k,n);
-  MatC C(m,n);
+  MatA A(m, k);
+  MatB B(k, n);
+  MatC C(m, n);
   A.setRandom();
   B.setRandom();
   C.setZero();
 
   BenchTimer t;
 
-  double up = 1e7*4/sizeof(Scalar);
+  double up = 1e7 * 4 / sizeof(Scalar);
   double tm0 = 10, tm1 = 20;
 
   double flops = 2. * m * n * k;
-  long rep = std::max(10., std::min(10000., up/flops) );
-  long tries = std::max(tm0, std::min(tm1, up/flops) );
+  long rep = std::max(10., std::min(10000., up / flops));
+  long tries = std::max(tm0, std::min(tm1, up / flops));
 
-  BENCH(t, tries, rep, lazy_gemm(A,B,C));
+  BENCH(t, tries, rep, lazy_gemm(A, B, C));
 
   return 1e-9 * rep * flops / t.best();
 }
 
-template<int m, int n, int k>
-double bench_t(int t)
-{
-  if(t)
-    return bench<m,n,k,RowMajor>();
+template <int m, int n, int k>
+double bench_t(int t) {
+  if (t)
+    return bench<m, n, k, RowMajor>();
   else
-    return bench<m,n,k,0>();
+    return bench<m, n, k, 0>();
 }
 
-EIGEN_DONT_INLINE
-double bench_mnk(int m, int n, int k, int t)
-{
-  int id = m*10000 + n*100 + k;
-  switch(id) {
-    case  10101 : return bench_t< 1, 1, 1>(t); break;
-    case  20202 : return bench_t< 2, 2, 2>(t); break;
-    case  30303 : return bench_t< 3, 3, 3>(t); break;
-    case  40404 : return bench_t< 4, 4, 4>(t); break;
-    case  50505 : return bench_t< 5, 5, 5>(t); break;
-    case  60606 : return bench_t< 6, 6, 6>(t); break;
-    case  70707 : return bench_t< 7, 7, 7>(t); break;
-    case  80808 : return bench_t< 8, 8, 8>(t); break;
-    case  90909 : return bench_t< 9, 9, 9>(t); break;
-    case 101010 : return bench_t<10,10,10>(t); break;
-    case 111111 : return bench_t<11,11,11>(t); break;
-    case 121212 : return bench_t<12,12,12>(t); break;
+EIGEN_DONT_INLINE double bench_mnk(int m, int n, int k, int t) {
+  int id = m * 10000 + n * 100 + k;
+  switch (id) {
+    case 10101:
+      return bench_t<1, 1, 1>(t);
+      break;
+    case 20202:
+      return bench_t<2, 2, 2>(t);
+      break;
+    case 30303:
+      return bench_t<3, 3, 3>(t);
+      break;
+    case 40404:
+      return bench_t<4, 4, 4>(t);
+      break;
+    case 50505:
+      return bench_t<5, 5, 5>(t);
+      break;
+    case 60606:
+      return bench_t<6, 6, 6>(t);
+      break;
+    case 70707:
+      return bench_t<7, 7, 7>(t);
+      break;
+    case 80808:
+      return bench_t<8, 8, 8>(t);
+      break;
+    case 90909:
+      return bench_t<9, 9, 9>(t);
+      break;
+    case 101010:
+      return bench_t<10, 10, 10>(t);
+      break;
+    case 111111:
+      return bench_t<11, 11, 11>(t);
+      break;
+    case 121212:
+      return bench_t<12, 12, 12>(t);
+      break;
   }
   return 0;
 }
 
-int main(int argc, char **argv)
-{
+int main(int argc, char **argv) {
   std::vector<double> results;
-  
+
   std::string filename = std::string("lazy_gemm_settings.txt");
-  if(argc>1)
-    filename = std::string(argv[1]);
+  if (argc > 1) filename = std::string(argv[1]);
   std::ifstream settings(filename);
   long m, n, k, t;
-  while(settings >> m >> n >> k >> t)
-  {
-    //std::cerr << "  Testing " << m << " " << n << " " << k << std::endl;
-    results.push_back( bench_mnk(m, n, k, t) );
+  while (settings >> m >> n >> k >> t) {
+    // std::cerr << "  Testing " << m << " " << n << " " << k << std::endl;
+    results.push_back(bench_mnk(m, n, k, t));
   }
-  
+
   std::cout << RowVectorXd::Map(results.data(), results.size());
-  
+
   return 0;
 }

bench/perf_monitoring/llt.cpp

@@ -1,15 +1,10 @@
 #include "gemm_common.h"
 #include <Eigen/Cholesky>
 
-EIGEN_DONT_INLINE
-void llt(const Mat &A, const Mat &B, Mat &C)
-{
+EIGEN_DONT_INLINE void llt(const Mat &A, const Mat &B, Mat &C) {
   C = A;
   C.diagonal().array() += 1000;
   Eigen::internal::llt_inplace<Mat::Scalar, Lower>::blocked(C);
 }
 
-int main(int argc, char **argv)
-{
-  return main_gemm(argc, argv, llt);
-}
+int main(int argc, char **argv) { return main_gemm(argc, argv, llt); }

bench/perf_monitoring/trmv_lo.cpp

@@ -1,12 +1,5 @@
 #include "gemv_common.h"
 
-EIGEN_DONT_INLINE
-void trmv(const Mat &A, const Vec &B, Vec &C)
-{
-  C.noalias() += A.triangularView<Lower>() * B;
-}
+EIGEN_DONT_INLINE void trmv(const Mat &A, const Vec &B, Vec &C) { C.noalias() += A.triangularView<Lower>() * B; }
 
-int main(int argc, char **argv)
-{
-  return main_gemv(argc, argv, trmv);
-}
+int main(int argc, char **argv) { return main_gemv(argc, argv, trmv); }

bench/perf_monitoring/trmv_lot.cpp

@@ -1,12 +1,7 @@
 #include "gemv_common.h"
 
-EIGEN_DONT_INLINE
-void trmv(const Mat &A, Vec &B, const Vec &C)
-{
+EIGEN_DONT_INLINE void trmv(const Mat &A, Vec &B, const Vec &C) {
   B.noalias() += A.transpose().triangularView<Lower>() * C;
 }
 
-int main(int argc, char **argv)
-{
-  return main_gemv(argc, argv, trmv);
-}
+int main(int argc, char **argv) { return main_gemv(argc, argv, trmv); }

bench/perf_monitoring/trmv_up.cpp

@@ -1,12 +1,5 @@
 #include "gemv_common.h"
 
-EIGEN_DONT_INLINE
-void trmv(const Mat &A, const Vec &B, Vec &C)
-{
-  C.noalias() += A.triangularView<Upper>() * B;
-}
+EIGEN_DONT_INLINE void trmv(const Mat &A, const Vec &B, Vec &C) { C.noalias() += A.triangularView<Upper>() * B; }
 
-int main(int argc, char **argv)
-{
-  return main_gemv(argc, argv, trmv);
-}
+int main(int argc, char **argv) { return main_gemv(argc, argv, trmv); }

bench/perf_monitoring/trmv_upt.cpp

@@ -1,12 +1,7 @@
 #include "gemv_common.h"
 
-EIGEN_DONT_INLINE
-void trmv(const Mat &A, Vec &B, const Vec &C)
-{
+EIGEN_DONT_INLINE void trmv(const Mat &A, Vec &B, const Vec &C) {
   B.noalias() += A.transpose().triangularView<Upper>() * C;
 }
 
-int main(int argc, char **argv)
-{
-  return main_gemv(argc, argv, trmv);
-}
+int main(int argc, char **argv) { return main_gemv(argc, argv, trmv); }