1 files changed, 148 insertions, 0 deletions
diff --git a/benchmarks/polybench-syn/linear-algebra/solvers/lu.c b/benchmarks/polybench-syn/linear-algebra/solvers/lu.c
new file mode 100644
index 0000000..1cf07ea
--- /dev/null
+++ b/benchmarks/polybench-syn/linear-algebra/solvers/lu.c
@@ -0,0 +1,148 @@
+/**
+ * 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
+ */
+/* lu.c: this file is part of PolyBench/C */
+
+//#include <stdio.h>
+//#include <unistd.h>
+//#include <string.h>
+//#include <math.h>
+
+#define plus(i) i = i + ONE
+
+static
+void init_array (int n,
+   int A[40][40])
+{
+  int ONE = 1;
+  int i, j;
+
+  for (i = 0; i < n; plus(i))
+    {
+      for (j = 0; j <= i; plus(j))
+ A[i][j] = (int)(-j % n) / n + ONE;
+      for (j = plus(i); j < n; plus(j)) {
+ A[i][j] = 0;
+      }
+      A[i][i] = 1;
+    }
+
+
+
+  int r,s,t;
+  int B[40][40]; // B = (int(*)[40 + 0][40 + 0])polybench_alloc_data ((40 + 0) * (40 + 0), sizeof(int));;
+  for (r = 0; r < n; plus(r))
+    for (s = 0; s < n; plus(s))
+      B[r][s] = 0;
+  for (t = 0; t < n; plus(t))
+    for (r = 0; r < n; plus(r))
+      for (s = 0; s < n; plus(s))
+ B[r][s] += A[r][t] * A[s][t];
+    for (r = 0; r < n; plus(r))
+      for (s = 0; s < n; plus(s))
+ A[r][s] = B[r][s];
+  //free((void*)B);;
+
+}
+
+
+
+/*
+static
+void print_array(int n,
+   int A[ 40 + 0][40 + 0])
+
+{
+  int i, j;
+
+  fprintf(stderr, "==BEGIN DUMP_ARRAYS==\n");
+  fprintf(stderr, "begin dump: %s", "A");
+  for (i = 0; i < n; i++)
+    for (j = 0; j < n; j++) {
+      if ((i * n + j) % 20 == 0) fprintf (stderr, "\n");
+      fprintf (stderr, "%d ", A[i][j]);
+    }
+  fprintf(stderr, "\nend   dump: %s\n", "A");
+  fprintf(stderr, "==END   DUMP_ARRAYS==\n");
+}
+*/
+
+
+
+static
+void kernel_lu(int n,
+        int A[ 40][40])
+{
+  int i, j, k;
+  int ONE = 1;
+
+#pragma scop
+ for (i = 0; i < n; plus(i)) {
+    for (j = 0; j <i; plus(j)) {
+       for (k = 0; k < j; plus(k)) {
+          A[i][j] -= A[i][k] * A[k][j];
+       }
+        A[i][j] /= A[j][j];
+    }
+   for (j = i; j < n; plus(j)) {
+       for (k = 0; k < i; plus(k)) {
+          A[i][j] -= A[i][k] * A[k][j];
+       }
+    }
+  }
+#pragma endscop
+}
+
+static
+int check_array(int n,
+   int A[40][40])
+{
+  int res = 0;
+  int i, j;
+  int ONE = 1;
+
+  for (i = 0; i < n; plus(i))
+    for (j = 0; j < n; plus(j)) 
+      if(A[i][j] !=0) res = 1;
+
+  return res;
+}
+
+
+int main()
+{
+  
+  int n = 40;
+
+
+  int A[40][40]; //A = (int(*)[40 + 0][40 + 0])polybench_alloc_data ((40 + 0) * (40 + 0), sizeof(int));;
+
+
+  init_array (n, A);
+
+
+
+  //print_array(n, A);
+  // polybench_timer_start();;
+
+
+  kernel_lu (n, A);
+
+
+  // polybench_timer_stop();;
+  // polybench_timer_print();;
+
+
+
+  //if (argc > 42 && ! strcmp(argv[0], "")) 
+  return check_array(n, A);
+  return 0;
+
+  //free((void*)A);;
+}