From 38b249970456a55f0a69ff28070887367e113205 Mon Sep 17 00:00:00 2001
From: Nadesh Ramanathan <nadeshramanathan88@gmail.com>
Date: Tue, 17 Nov 2020 09:06:04 +0000
Subject: final checks reworked and including compilation time in script

---
 .../linear-algebra/solvers/cholesky.c              |  8 +++++
 .../polybench-syn/linear-algebra/solvers/lu.c      | 34 +++++-----------------
 .../polybench-syn/linear-algebra/solvers/ludcmp.c  |  9 +++++-
 3 files changed, 23 insertions(+), 28 deletions(-)

(limited to 'benchmarks/polybench-syn/linear-algebra/solvers')

diff --git a/benchmarks/polybench-syn/linear-algebra/solvers/cholesky.c b/benchmarks/polybench-syn/linear-algebra/solvers/cholesky.c
index 05e85ea..b43402b 100644
--- a/benchmarks/polybench-syn/linear-algebra/solvers/cholesky.c
+++ b/benchmarks/polybench-syn/linear-algebra/solvers/cholesky.c
@@ -11,6 +11,10 @@
 
 #include "../../include/misc.h"
 
+#ifndef SYNTHESIS
+#include <stdio.h>
+#endif 
+
 #  define SQRT_FUN(x) sqrtf(x)
 
 #define plus(i) i = i + ONE
@@ -63,6 +67,10 @@ int check_array(int n,
     for (j = 0; j <= i; plus(j)) {
     if(A[i][j]!=0) res = 1;
   }
+    #ifndef SYNTHESIS
+    printf("finished: %u\n", res);
+    #endif 
+
   return res;
 }
 
diff --git a/benchmarks/polybench-syn/linear-algebra/solvers/lu.c b/benchmarks/polybench-syn/linear-algebra/solvers/lu.c
index a7ec246..1365f54 100644
--- a/benchmarks/polybench-syn/linear-algebra/solvers/lu.c
+++ b/benchmarks/polybench-syn/linear-algebra/solvers/lu.c
@@ -16,6 +16,10 @@
 
 #include "../../include/misc.h"
 
+#ifndef SYNTHESIS
+#include <stdio.h>
+#endif 
+
 #define plus(i) i = i + ONE
 
 static
@@ -53,30 +57,6 @@ void init_array (int n,
 
 }
 
-
-
-/*
-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])
@@ -110,6 +90,9 @@ int check_array(int n,
   for (i = 0; i < n; plus(i))
     for (j = 0; j < n; plus(j)) 
       if(A[i][j] !=0) res = 1;
+    #ifndef SYNTHESIS
+    printf("finished: %u\n", res);
+    #endif 
 
   return res;
 }
@@ -126,11 +109,8 @@ int main()
 
   init_array (n, A);
 
-
-
   kernel_lu (n, A);
 
-
   return check_array(n, A);
   return 0;
 
diff --git a/benchmarks/polybench-syn/linear-algebra/solvers/ludcmp.c b/benchmarks/polybench-syn/linear-algebra/solvers/ludcmp.c
index f37d983..0f4522e 100644
--- a/benchmarks/polybench-syn/linear-algebra/solvers/ludcmp.c
+++ b/benchmarks/polybench-syn/linear-algebra/solvers/ludcmp.c
@@ -11,6 +11,10 @@
 
 #include "../../include/misc.h"
 
+#ifndef SYNTHESIS
+#include <stdio.h>
+#endif 
+
 #define plus(i) i = i + ONE
 
   static
@@ -71,8 +75,11 @@ int check_array(int n,
   int res = 0;
 
   for (i = 0; i < n; plus(i)) {
-    res += x[i];
+    res ^= x[i];
   }
+#ifndef SYNTHESIS
+    printf("finished: %u\n", res);
+#endif
   return res;
 }
 
-- 
cgit