Patchwork [3/6] Add testcase for PR43657.

login
register
mail settings
Submitter Sebastian Pop
Date Jan. 18, 2011, 8:51 p.m.
Message ID <1295383896-27122-4-git-send-email-sebpop@gmail.com>
Download mbox | patch
Permalink /patch/79356/
State New
Headers show

Comments

Sebastian Pop - Jan. 18, 2011, 8:51 p.m.
2011-01-18  Sebastian Pop  <sebastian.pop@amd.com>

	PR tree-optimization/43657
	* gcc.dg/graphite/pr43657.c: New.
---
 gcc/ChangeLog.graphite                  |    5 +++
 gcc/testsuite/gcc.dg/graphite/pr43657.c |   52 +++++++++++++++++++++++++++++++
 2 files changed, 57 insertions(+), 0 deletions(-)
 create mode 100644 gcc/testsuite/gcc.dg/graphite/pr43657.c

Patch

diff --git a/gcc/ChangeLog.graphite b/gcc/ChangeLog.graphite
index ee16496..4863236 100644
--- a/gcc/ChangeLog.graphite
+++ b/gcc/ChangeLog.graphite
@@ -1,5 +1,10 @@ 
 2011-01-18  Sebastian Pop  <sebastian.pop@amd.com>
 
+	PR tree-optimization/43657
+	* gcc.dg/graphite/pr43657.c: New.
+
+2011-01-18  Sebastian Pop  <sebastian.pop@amd.com>
+
 	PR tree-optimization/29832
 	* gfortran.dg/graphite/pr29832.f90: New.
 
diff --git a/gcc/testsuite/gcc.dg/graphite/pr43657.c b/gcc/testsuite/gcc.dg/graphite/pr43657.c
new file mode 100644
index 0000000..f9d393f
--- /dev/null
+++ b/gcc/testsuite/gcc.dg/graphite/pr43657.c
@@ -0,0 +1,52 @@ 
+/* { dg-do run } */
+/* { dg-options "-O1 -ftree-loop-linear" } */
+
+extern void abort (void);
+
+#define K 32
+
+int cond_array[2*K][K];
+int a[K][K];
+int out[K];
+int check_result[K] = {2,2,2,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
+
+__attribute__ ((noinline)) void 
+foo (int c)
+{
+  int res, i, j, k, next;
+
+  for (k = 0; k < K; k++)
+    {
+      res = 0;
+      for (j = 0; j < K; j++) 
+        for (i = 0; i < K; i++)
+          { 
+            next = a[i][j]; 
+            res = c > cond_array[i+k][j] ? next : res;
+          }
+ 
+      out[k] = res;
+    }
+}
+
+int main ()
+{
+  int i, j, k;
+
+  for  (j = 0; j < K; j++)
+    {
+      for (i = 0; i < 2*K; i++)
+        cond_array[i][j] = i+j;
+
+      for (i = 0; i < K; i++)
+        a[i][j] = i+2;
+    }
+
+  foo(5);
+  
+  for (k = 0; k < K; k++)
+    if (out[k] != check_result[k])
+      abort ();
+
+  return 0;
+}