diff options
| author | H.J. Lu <hongjiu.lu@intel.com> | 2010-10-14 02:11:59 +0000 |
|---|---|---|
| committer | H.J. Lu <hjl@gcc.gnu.org> | 2010-10-13 19:11:59 -0700 |
| commit | 1f561f9ba415e6252c29aaad13e6637ed9cc1f07 (patch) | |
| tree | dbb4aa2229fec6750cf35e211978772a67d7e98e /gcc | |
| parent | 208d8b55ac10145e08bfcbae82c141b9b4e4e209 (diff) | |
| download | gcc-1f561f9ba415e6252c29aaad13e6637ed9cc1f07.zip gcc-1f561f9ba415e6252c29aaad13e6637ed9cc1f07.tar.gz gcc-1f561f9ba415e6252c29aaad13e6637ed9cc1f07.tar.bz2 | |
Add a testcase for PR target/44180.
2010-10-13 H.J. Lu <hongjiu.lu@intel.com>
PR target/44180
* gcc.target/i386/pr44180.c: New.
From-SVN: r165445
Diffstat (limited to 'gcc')
| -rw-r--r-- | gcc/testsuite/ChangeLog | 5 | ||||
| -rw-r--r-- | gcc/testsuite/gcc.target/i386/pr44180.c | 35 |
2 files changed, 40 insertions, 0 deletions
diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog index e7d06f0..5e10ba5 100644 --- a/gcc/testsuite/ChangeLog +++ b/gcc/testsuite/ChangeLog @@ -1,3 +1,8 @@ +2010-10-13 H.J. Lu <hongjiu.lu@intel.com> + + PR target/44180 + * gcc.target/i386/pr44180.c: New. + 2010-10-13 Jason Merrill <jason@redhat.com> * g++.dg/template/canon-type-8.C: New. diff --git a/gcc/testsuite/gcc.target/i386/pr44180.c b/gcc/testsuite/gcc.target/i386/pr44180.c new file mode 100644 index 0000000..b27b7ba --- /dev/null +++ b/gcc/testsuite/gcc.target/i386/pr44180.c @@ -0,0 +1,35 @@ +/* { dg-do run } */ +/* { dg-require-effective-target avx } */ +/* { dg-options "-O2 -ftree-vectorize -mavx" } */ + +#include "avx-check.h" + +#define N 16 + +float b[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45}; +float c[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}; +float d[N] = {0,2,4,6,8,10,12,14,16,18,20,22,24,26,28,30}; + +static void +__attribute__ ((noinline)) +avx_test () +{ + int i; + float a[N]; + + /* Strided access. Vectorizable on platforms that support load of strided + accesses (extract of even/odd vector elements). */ + for (i = 0; i < N/2; i++) + { + a[i] = b[2*i+1] * c[2*i+1] - b[2*i] * c[2*i]; + d[i] = b[2*i] * c[2*i+1] + b[2*i+1] * c[2*i]; + } + + /* Check results. */ + for (i = 0; i < N/2; i++) + { + if (a[i] != b[2*i+1] * c[2*i+1] - b[2*i] * c[2*i] + || d[i] != b[2*i] * c[2*i+1] + b[2*i+1] * c[2*i]) + abort(); + } +} |