diff options
| author | Richard Biener <rguenther@suse.de> | 2012-10-12 08:00:29 +0000 |
|---|---|---|
| committer | Richard Biener <rguenth@gcc.gnu.org> | 2012-10-12 08:00:29 +0000 |
| commit | 60b95d28c0d2b2f16836ceacd5a3a9c5dd2d80f9 (patch) | |
| tree | a9a9494b469a7d228389d94e0e80f352daa12fb4 /gcc/testsuite | |
| parent | 0b6222533e0a76c09f10d5002717bba1a7136e0b (diff) | |
| download | gcc-60b95d28c0d2b2f16836ceacd5a3a9c5dd2d80f9.zip gcc-60b95d28c0d2b2f16836ceacd5a3a9c5dd2d80f9.tar.gz gcc-60b95d28c0d2b2f16836ceacd5a3a9c5dd2d80f9.tar.bz2 | |
re PR tree-optimization/54894 (internal compiler error: in vect_get_vec_def_for_operand, at tree-vect-stmts.c:1286)
2012-10-12 Richard Biener <rguenther@suse.de>
PR tree-optimization/54894
* tree-vect-stmts.c (get_vectype_for_scalar_type_and_size):
Handle over-aligned scalar types properly.
* gcc.dg/torture/pr54894.c: New testcase.
From-SVN: r192390
Diffstat (limited to 'gcc/testsuite')
| -rw-r--r-- | gcc/testsuite/ChangeLog | 5 | ||||
| -rw-r--r-- | gcc/testsuite/gcc.dg/torture/pr54894.c | 27 |
2 files changed, 32 insertions, 0 deletions
diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog index b35fe71..776727c 100644 --- a/gcc/testsuite/ChangeLog +++ b/gcc/testsuite/ChangeLog @@ -1,3 +1,8 @@ +2012-10-12 Richard Biener <rguenther@suse.de> + + PR tree-optimization/54894 + * gcc.dg/torture/pr54894.c: New testcase. + 2012-10-12 Oleg Endo <olegendo@gcc.gnu.org> PR target/51244 diff --git a/gcc/testsuite/gcc.dg/torture/pr54894.c b/gcc/testsuite/gcc.dg/torture/pr54894.c new file mode 100644 index 0000000..277e371 --- /dev/null +++ b/gcc/testsuite/gcc.dg/torture/pr54894.c @@ -0,0 +1,27 @@ +/* { dg-do compile } */ + +typedef unsigned long long uint64_t; + +#define n 4096 +double A[n][n] __attribute__((aligned(16))); +double B[n][n] __attribute__((aligned(16))); +double C[n][n] __attribute__((aligned(16))); + +#define tilesize 128 + +typedef double adouble __attribute__((__aligned__(16))); + +void foo () +{ + int ih, jh, kh, il, kl, jl; + for (ih = 0; ih < n; ih += tilesize) + for (jh = 0; jh < n; jh += tilesize) + for (kh = 0; kh < n; kh += tilesize) + for (il = 0; il < tilesize; ++il) + { + adouble *Ap = (adouble *)&A[ih+il][kh]; + for (kl = 0; kl < tilesize; ++kl) + for (jl = 0; jl < tilesize; ++jl) + C[ih+il][jh+jl] += Ap[kl] * B[kh+kl][jh+jl]; + } +} |