diff options
author | upstream source tree <ports@midipix.org> | 2015-03-15 20:14:05 -0400 |
---|---|---|
committer | upstream source tree <ports@midipix.org> | 2015-03-15 20:14:05 -0400 |
commit | 554fd8c5195424bdbcabf5de30fdc183aba391bd (patch) | |
tree | 976dc5ab7fddf506dadce60ae936f43f58787092 /gcc/testsuite/gcc.dg/vect/vect-70.c | |
download | cbb-gcc-4.6.4-554fd8c5195424bdbcabf5de30fdc183aba391bd.tar.bz2 cbb-gcc-4.6.4-554fd8c5195424bdbcabf5de30fdc183aba391bd.tar.xz |
obtained gcc-4.6.4.tar.bz2 from upstream website;upstream
verified gcc-4.6.4.tar.bz2.sig;
imported gcc-4.6.4 source tree from verified upstream tarball.
downloading a git-generated archive based on the 'upstream' tag
should provide you with a source tree that is binary identical
to the one extracted from the above tarball.
if you have obtained the source via the command 'git clone',
however, do note that line-endings of files in your working
directory might differ from line-endings of the respective
files in the upstream repository.
Diffstat (limited to 'gcc/testsuite/gcc.dg/vect/vect-70.c')
-rw-r--r-- | gcc/testsuite/gcc.dg/vect/vect-70.c | 69 |
1 files changed, 69 insertions, 0 deletions
diff --git a/gcc/testsuite/gcc.dg/vect/vect-70.c b/gcc/testsuite/gcc.dg/vect/vect-70.c new file mode 100644 index 000000000..24677c2f8 --- /dev/null +++ b/gcc/testsuite/gcc.dg/vect/vect-70.c @@ -0,0 +1,69 @@ +/* { dg-require-effective-target vect_int } */ + +#include <stdarg.h> +#include "tree-vect.h" + +#define N 24 + +struct s{ + int m; + int n[N/6][N/6][N]; +}; + +struct test1{ + struct s a; /* array a.n is unaligned */ + int b; + int c; + struct s e[N]; /* array e.n is aligned */ +}; + +__attribute__ ((noinline)) +int main1 () +{ + int i,j; + struct test1 tmp1; + + for (i = 0; i < N; i++) + for (j = 3; j < N-3; j++) + { + tmp1.e[i].n[1][2][j] = 8; + } + + /* check results: */ + for (i = 0; i < N; i++) + for (j = 3; j < N-3; j++) + { + if (tmp1.e[i].n[1][2][j] != 8) + abort (); + } + + /* not consecutive */ + for (i = 0; i < N; i++) + for (j = 3; j < N-3; j++) + { + tmp1.e[j].n[1][2][j] = 8; + } + + /* check results: */ + for (i = 0; i < N; i++) + for (j = 3; j < N-3; j++) + { + if (tmp1.e[j].n[1][2][j] != 8) + abort (); + } + + return 0; +} + +int main (void) +{ + check_vect (); + + return main1 (); +} + +/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */ +/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */ +/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" {target { vector_alignment_reachable} } } } */ +/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 1 "vect" {target {{! vector_alignment_reachable} && {! vect_hw_misalign} } } } } */ +/* { dg-final { cleanup-tree-dump "vect" } } */ |