From aa986aacbb80e9f92f77d65de74ba5051054eac7 Mon Sep 17 00:00:00 2001
From: Yann Herklotz <git@yannherklotz.com>
Date: Sun, 11 Jul 2021 01:19:52 +0200
Subject: Add divider benchmarks

---
 .../polybench-syn-div/linear-algebra/blas/gemm.c   | 115 +++++++++++++++++++++
 1 file changed, 115 insertions(+)
 create mode 100644 benchmarks/polybench-syn-div/linear-algebra/blas/gemm.c

(limited to 'benchmarks/polybench-syn-div/linear-algebra/blas/gemm.c')

diff --git a/benchmarks/polybench-syn-div/linear-algebra/blas/gemm.c b/benchmarks/polybench-syn-div/linear-algebra/blas/gemm.c
new file mode 100644
index 0000000..a2c507f
--- /dev/null
+++ b/benchmarks/polybench-syn-div/linear-algebra/blas/gemm.c
@@ -0,0 +1,115 @@
+/**
+ * This version is stamped on May 10, 2016
+ *
+ * Contact:
+ *   Louis-Noel Pouchet <pouchet.ohio-state.edu>
+ *   Tomofumi Yuki <tomofumi.yuki.fr>
+ *
+ * Web address: http://polybench.sourceforge.net
+ */
+/* gemm.c: this file is part of PolyBench/C */
+
+#ifndef SYNTHESIS
+  #include <stdio.h>
+#endif
+#define plus(i) i = i + ONE
+  static
+void init_array(int ni, int nj, int nk,
+    int *alpha,
+    int *beta,
+    int C[ 20 + 0][25 + 0],
+    int A[ 20 + 0][30 + 0],
+    int B[ 30 + 0][25 + 0])
+{
+  int i, j;
+  int ONE = 1;
+
+  *alpha = 2;
+  *beta = 2;
+  for (i = 0; i < ni; plus(i))
+    for (j = 0; j < nj; plus(j))
+      C[i][j] = (int) ((i*j+ONE) % ni) / ni;
+  for (i = 0; i < ni; plus(i))
+    for (j = 0; j < nk; plus(j))
+      A[i][j] = (int) (((i*(j+ONE)) % nk) / nk);
+  for (i = 0; i < nk; plus(i))
+    for (j = 0; j < nj; plus(j))
+      B[i][j] = (int) (((i*(j+ONE+ONE)) % nj) / nj);
+}
+
+
+
+
+  static
+int print_array(int ni, int nj,
+    int C[ 20 + 0][25 + 0])
+{
+  int i, j;
+  int ONE = 1;
+  int res = 0;
+  for (i = 0; i < ni; plus(i))
+    for (j = 0; j < nj; plus(j)) {
+      res ^= C[i][j];
+    }
+#ifndef SYNTHESIS
+  printf("finished %u\n", res);
+#endif
+  return res;
+}
+
+  static
+void kernel_gemm(int ni, int nj, int nk,
+    int alpha,
+    int beta,
+    int C[ 20 + 0][25 + 0],
+    int A[ 20 + 0][30 + 0],
+    int B[ 30 + 0][25 + 0])
+{
+  int i, j, k;
+  int ONE = 1;
+
+  for (i = 0; i < ni; plus(i)) {
+    for (j = 0; j < nj; plus(j))
+      C[i][j] *= beta;
+    for (k = 0; k < nk; plus(k)) {
+      for (j = 0; j < nj; plus(j))
+        C[i][j] += alpha * A[i][k] * B[k][j];
+    }
+  }
+
+}
+
+
+int main()
+{
+
+  int ni = 20;
+  int nj = 25;
+  int nk = 30;
+
+
+  int alpha;
+  int beta;
+  int C[20 + 0][25 + 0]; 
+  int A[20 + 0][30 + 0]; 
+  int B[30 + 0][25 + 0]; 
+
+
+  init_array (ni, nj, nk, &alpha, &beta,
+      C,
+      A,
+      B);
+
+
+  kernel_gemm (ni, nj, nk,
+      alpha, beta,
+      C,
+      A,
+      B);
+
+
+  return 
+    print_array(ni, nj, C);
+
+
+}
-- 
cgit