diff options
| author | Sebastian Pop <sebastian.pop@amd.com> | 2011-01-25 21:24:53 +0000 |
|---|---|---|
| committer | Sebastian Pop <spop@gcc.gnu.org> | 2011-01-25 21:24:53 +0000 |
| commit | d15232769160ac7352de1d2bae7a6993bc979166 (patch) | |
| tree | 91598f68729ee4dfc968db96b370edb9811be13e /gcc | |
| parent | 254b78598000c699d6fd7a962b407feeb6776e8e (diff) | |
| download | gcc-d15232769160ac7352de1d2bae7a6993bc979166.zip gcc-d15232769160ac7352de1d2bae7a6993bc979166.tar.gz gcc-d15232769160ac7352de1d2bae7a6993bc979166.tar.bz2 | |
Add testcase for PR43657.
2011-01-18 Sebastian Pop <sebastian.pop@amd.com>
PR tree-optimization/43657
* gcc.dg/graphite/pr43657.c: New.
From-SVN: r169254
Diffstat (limited to 'gcc')
| -rw-r--r-- | gcc/testsuite/ChangeLog | 5 | ||||
| -rw-r--r-- | gcc/testsuite/gcc.dg/graphite/pr43657.c | 52 |
2 files changed, 57 insertions, 0 deletions
diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog index 3ba48df..25199cf 100644 --- a/gcc/testsuite/ChangeLog +++ b/gcc/testsuite/ChangeLog @@ -1,5 +1,10 @@ 2011-01-25 Sebastian Pop <sebastian.pop@amd.com> + PR tree-optimization/43657 + * gcc.dg/graphite/pr43657.c: New. + +2011-01-25 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..18afe1e --- /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; +} |