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/slp-28.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/slp-28.c')
-rw-r--r-- | gcc/testsuite/gcc.dg/vect/slp-28.c | 86 |
1 files changed, 86 insertions, 0 deletions
diff --git a/gcc/testsuite/gcc.dg/vect/slp-28.c b/gcc/testsuite/gcc.dg/vect/slp-28.c new file mode 100644 index 000000000..41c482709 --- /dev/null +++ b/gcc/testsuite/gcc.dg/vect/slp-28.c @@ -0,0 +1,86 @@ +/* { dg-require-effective-target vect_int } */ + +#include <stdarg.h> +#include "tree-vect.h" + +#define N 32 + +unsigned short in[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31}; +unsigned short in2[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31}; +unsigned short in3[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31}; +unsigned short check[N] = {0,1,2,3,5,6,7,8,10,11,12,13,15,16,17,18,20,21,22,23,25,26,27,28,30,31,32,33,35,36,37,38}; +unsigned short check3[N] = {0,1,2,3,4,5,6,7,8,9,10,11,5,6,7,8,9,10,11,12,13,14,15,16,10,11,12,13,14,15,16,17}; + +int +main1 () +{ + int i; + + for (i = 0; i < N/4; i++) + { + in[i*4] = in[i*4] + 5; + in[i*4 + 1] = in[i*4 + 1] + 5; + in[i*4 + 2] = in[i*4 + 2] + 5; + in[i*4 + 3] = in[i*4 + 3] + 5; + + } + + /* check results: */ + for (i = 0; i < N; i++) + { + if (in[i] != i+5) + abort (); + } + + /* Not vectorizable because of data dependencies. */ + for (i = 1; i < N/4; i++) + { + in2[i*4] = in2[(i-1)*4] + 5; + in2[i*4 + 1] = in2[(i-1)*4 + 1] + 5; + in2[i*4 + 2] = in2[(i-1)*4 + 2] + 5; + in2[i*4 + 3] = in2[(i-1)*4 + 3] + 5; + + } + + /* check results: */ + for (i = 4; i < N; i++) + { + if (in2[i] != check[i]) + abort (); + } + + /* Not vectorizable because of data dependencies: distance 3 is greater than + the actual VF with SLP (2), but the analysis fail to detect that for now. */ + for (i = 3; i < N/4; i++) + { + in3[i*4] = in3[(i-3)*4] + 5; + in3[i*4 + 1] = in3[(i-3)*4 + 1] + 5; + in3[i*4 + 2] = in3[(i-3)*4 + 2] + 5; + in3[i*4 + 3] = in3[(i-3)*4 + 3] + 5; + + } + + /* check results: */ + for (i = 12; i < N; i++) + { + if (in3[i] != check3[i]) + abort (); + } + + + return 0; +} + +int main (void) +{ + check_vect (); + + main1 (); + + return 0; +} + +/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */ +/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" } } */ +/* { dg-final { cleanup-tree-dump "vect" } } */ + |