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

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

(limited to 'benchmarks/polybench-syn-div/linear-algebra/kernels/bicg.c')

diff --git a/benchmarks/polybench-syn-div/linear-algebra/kernels/bicg.c b/benchmarks/polybench-syn-div/linear-algebra/kernels/bicg.c
new file mode 100644
index 0000000..4d1f9b6
--- /dev/null
+++ b/benchmarks/polybench-syn-div/linear-algebra/kernels/bicg.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
+ */
+/* bicg.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 m, int n,
+   int A[ 42 + 0][38 + 0],
+   int r[ 42 + 0],
+   int p[ 38 + 0])
+{
+  int i, j;
+  int ONE = 1;
+
+  for (i = 0; i < m; plus(i))
+    p[i] = ((i % m) / m);
+  for (i = 0; i < n; plus(i)) {
+    r[i] = ((i % n) / n);
+    for (j = 0; j < m; plus(j))
+      A[i][j] = (((i*(j+ONE)) % n) / n);
+  }
+}
+
+
+
+
+static
+int print_array(int m, int n,
+   int s[ 38 + 0],
+   int q[ 42 + 0])
+
+{
+  int i;
+  int ONE = 1;
+  int res = 0;
+
+  for (i = 0; i < m; plus(i)) {
+    res ^= s[i];
+  }
+  for (i = 0; i < n; plus(i)) {
+    res ^= q[i];
+  }
+#ifndef SYNTHESIS
+  printf("finished %u\n", res);
+#endif
+  return res;
+}
+
+
+
+
+static
+void kernel_bicg(int m, int n,
+   int A[ 42 + 0][38 + 0],
+   int s[ 38 + 0],
+   int q[ 42 + 0],
+   int p[ 38 + 0],
+   int r[ 42 + 0])
+{
+  int i, j;
+  int ONE = 1;
+
+ for (i = 0; i < m; plus(i))
+    s[i] = 0;
+  for (i = 0; i < n; plus(i))
+    {
+      q[i] = 0;
+      for (j = 0; j < m; plus(j))
+ {
+   s[j] = s[j] + r[i] * A[i][j];
+   q[i] = q[i] + A[i][j] * p[j];
+ }
+    }
+
+}
+
+
+int main()
+{
+
+  int n = 42;
+  int m = 38;
+
+
+  int A[42 + 0][38 + 0]; 
+  int s[38 + 0]; 
+  int q[42 + 0]; 
+  int p[38 + 0]; 
+  int r[42 + 0]; 
+
+
+  init_array (m, n,
+       A,
+       r,
+       p);
+
+  kernel_bicg (m, n,
+        A,
+        s,
+        q,
+        p,
+        r);
+
+
+  return print_array(m, n, s, q);
+
+
+}
-- 
cgit