From 045c0dc29fc31a8d3f15da8b3130dbc4706ea581 Mon Sep 17 00:00:00 2001
From: Yann Herklotz <git@yannherklotz.com>
Date: Thu, 13 Aug 2020 23:24:40 +0100
Subject: Add modified polybench benchmarks

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

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

diff --git a/benchmarks/polybench-syn/linear-algebra/blas/syr2k.c b/benchmarks/polybench-syn/linear-algebra/blas/syr2k.c
new file mode 100644
index 0000000..82b4d3b
--- /dev/null
+++ b/benchmarks/polybench-syn/linear-algebra/blas/syr2k.c
@@ -0,0 +1,120 @@
+/**
+ * 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
+ */
+/* syr2k.c: this file is part of PolyBench/C */
+
+
+#define plus(i) i = i + ONE
+static
+void init_array(int n, int m,
+  int *alpha,
+  int *beta,
+  int C[ 30 + 0][30 + 0],
+  int A[ 30 + 0][20 + 0],
+  int B[ 30 + 0][20 + 0])
+{
+  int i, j;
+  int ONE = 1;
+
+  *alpha = 3;
+  *beta = 2;
+  for (i = 0; i < n; plus(i))
+    for (j = 0; j < m; plus(j)) {
+      A[i][j] = (int) ((i*j+ONE)%n) / n;
+      B[i][j] = (int) ((i*j+ONE+ONE)%m) / m;
+    }
+  for (i = 0; i < n; plus(i))
+    for (j = 0; j < n; plus(j)) {
+      C[i][j] = (int) ((i*j+4-ONE)%n) / m;
+    }
+}
+
+
+
+
+static
+int print_array(int n,
+   int C[ 30 + 0][30 + 0])
+{
+  int i, j;
+  int ONE = 1;
+  int res = 0;
+
+  for (i = 0; i < n; plus(i))
+    for (j = 0; j < n; plus(j)) {
+      res ^= C[i][j];
+    }
+    return res;
+}
+
+
+static
+void kernel_syr2k(int n, int m,
+    int alpha,
+    int beta,
+    int C[ 30 + 0][30 + 0],
+    int A[ 30 + 0][20 + 0],
+    int B[ 30 + 0][20 + 0])
+{
+  int i, j, k;
+  int ONE = 1;
+
+#pragma scop
+ for (i = 0; i < n; plus(i)) {
+    for (j = 0; j <= i; plus(j))
+      C[i][j] *= beta;
+    for (k = 0; k < m; plus(k))
+      for (j = 0; j <= i; plus(j))
+ {
+   C[i][j] += A[j][k]*alpha*B[i][k] + B[j][k]*alpha*A[i][k];
+ }
+  }
+#pragma endscop
+
+}
+
+
+int main()
+{
+
+  int n = 30;
+  int m = 20;
+
+
+  int alpha;
+  int beta;
+  int C[30 + 0][30 + 0];
+  int A[30 + 0][20 + 0];
+  int B[30 + 0][20 + 0];
+
+
+  init_array (n, m, &alpha, &beta,
+       C,
+       A,
+       B);
+
+
+                             ;
+
+
+  kernel_syr2k (n, m,
+  alpha, beta,
+  C,
+  A,
+  B);
+
+
+                            ;
+                             ;
+
+
+
+  return print_array(n, C);
+
+}
-- 
cgit