diff options
author | Dan Albert <danalbert@google.com> | 2016-02-24 13:48:45 -0800 |
---|---|---|
committer | Dan Albert <danalbert@google.com> | 2016-02-24 13:51:18 -0800 |
commit | b9de1157289455b0ca26daff519d4a0ddcd1fa13 (patch) | |
tree | 4c56cc0a34b91f17033a40a455f26652304f7b8d /gcc-4.8.1/gcc/testsuite/gcc.dg/vect/slp-13-big-array.c | |
parent | 098157a754787181cfa10e71325832448ddcea98 (diff) | |
download | toolchain_gcc-b9de1157289455b0ca26daff519d4a0ddcd1fa13.tar.gz toolchain_gcc-b9de1157289455b0ca26daff519d4a0ddcd1fa13.tar.bz2 toolchain_gcc-b9de1157289455b0ca26daff519d4a0ddcd1fa13.zip |
Update 4.8.1 to 4.8.3.
My previous drop was the wrong version. The platform mingw is
currently using 4.8.3, not 4.8.1 (not sure how I got that wrong).
From ftp://ftp.gnu.org/gnu/gcc/gcc-4.8.3/gcc-4.8.3.tar.bz2.
Bug: http://b/26523949
Change-Id: Id85f1bdcbbaf78c7d0b5a69e74c798a08f341c35
Diffstat (limited to 'gcc-4.8.1/gcc/testsuite/gcc.dg/vect/slp-13-big-array.c')
-rw-r--r-- | gcc-4.8.1/gcc/testsuite/gcc.dg/vect/slp-13-big-array.c | 141 |
1 files changed, 0 insertions, 141 deletions
diff --git a/gcc-4.8.1/gcc/testsuite/gcc.dg/vect/slp-13-big-array.c b/gcc-4.8.1/gcc/testsuite/gcc.dg/vect/slp-13-big-array.c deleted file mode 100644 index c40822b62..000000000 --- a/gcc-4.8.1/gcc/testsuite/gcc.dg/vect/slp-13-big-array.c +++ /dev/null @@ -1,141 +0,0 @@ -/* { dg-require-effective-target vect_int } */ - -#include <stdarg.h> -#include "tree-vect.h" - -#define N 64 -volatile int y = 0; - -int -main1 () -{ - int i; - unsigned short out[N*8]; - unsigned short in[N*8]; - unsigned int in2[N*8]; - unsigned int out2[N*8]; - - for (i = 0; i < N*8; i++) - { - in[i] = in2[i] = i; - if (y) /* Avoid vectorization. */ - abort (); - } - - /* Induction is not SLPable yet. */ - for (i = 0; i < N; i++) - { - out[i*8] = in[i*8] + i; - out[i*8 + 1] = in[i*8 + 1] + i; - out[i*8 + 2] = in[i*8 + 2] + i; - out[i*8 + 3] = in[i*8 + 3] + i; - out[i*8 + 4] = in[i*8 + 4] + i; - out[i*8 + 5] = in[i*8 + 5] + i; - out[i*8 + 6] = in[i*8 + 6] + i; - out[i*8 + 7] = in[i*8 + 7] + i; - } - - /* check results: */ - for (i = 0; i < N; i++) - { - if (out[i*8] != in[i*8] + i - || out[i*8 + 1] != in[i*8 + 1] + i - || out[i*8 + 2] != in[i*8 + 2] + i - || out[i*8 + 3] != in[i*8 + 3] + i - || out[i*8 + 4] != in[i*8 + 4] + i - || out[i*8 + 5] != in[i*8 + 5] + i - || out[i*8 + 6] != in[i*8 + 6] + i - || out[i*8 + 7] != in[i*8 + 7] + i) - abort (); - } - - /* Induction is not SLPable yet and strided group size must be a power of 2 - to get vectorized. */ - for (i = 0; i < N/2; i++) - { - out2[i*12] = in2[i*12] + i; - out2[i*12 + 1] = in2[i*12 + 1] + i; - out2[i*12 + 2] = in2[i*12 + 2] + i; - out2[i*12 + 3] = in2[i*12 + 3] + i; - out2[i*12 + 4] = in2[i*12 + 4] + i; - out2[i*12 + 5] = in2[i*12 + 5] + i; - out2[i*12 + 6] = in2[i*12 + 6] + i; - out2[i*12 + 7] = in2[i*12 + 7] + i; - out2[i*12 + 8] = in2[i*12 + 8] + i; - out2[i*12 + 9] = in2[i*12 + 9] + i; - out2[i*12 + 10] = in2[i*12 + 10] + i; - out2[i*12 + 11] = in2[i*12 + 11] + i; - } - - /* check results: */ - for (i = 0; i < N/2; i++) - { - if (out2[i*12] != in2[i*12] + i - || out2[i*12 + 1] != in2[i*12 + 1] + i - || out2[i*12 + 2] != in2[i*12 + 2] + i - || out2[i*12 + 3] != in2[i*12 + 3] + i - || out2[i*12 + 4] != in2[i*12 + 4] + i - || out2[i*12 + 5] != in2[i*12 + 5] + i - || out2[i*12 + 6] != in2[i*12 + 6] + i - || out2[i*12 + 7] != in2[i*12 + 7] + i - || out2[i*12 + 8] != in2[i*12 + 8] + i - || out2[i*12 + 9] != in2[i*12 + 9] + i - || out2[i*12 + 10] != in2[i*12 + 10] + i - || out2[i*12 + 11] != in2[i*12 + 11] + i) - abort (); - } - - /* Not power of 2 but SLPable. */ - for (i = 0; i < N/2; i++) - { - out2[i*12] = in2[i*12] + 1; - out2[i*12 + 1] = in2[i*12 + 1] + 2; - out2[i*12 + 2] = in2[i*12 + 2] + 3; - out2[i*12 + 3] = in2[i*12 + 3] + 4; - out2[i*12 + 4] = in2[i*12 + 4] + 5; - out2[i*12 + 5] = in2[i*12 + 5] + 6; - out2[i*12 + 6] = in2[i*12 + 6] + 7; - out2[i*12 + 7] = in2[i*12 + 7] + 8; - out2[i*12 + 8] = in2[i*12 + 8] + 9; - out2[i*12 + 9] = in2[i*12 + 9] + 10; - out2[i*12 + 10] = in2[i*12 + 10] + 11; - out2[i*12 + 11] = in2[i*12 + 11] + 12; - } - - /* check results: */ - for (i = 0; i < N/2; i++) - { - if (out2[i*12] != in2[i*12] + 1 - || out2[i*12 + 1] != in2[i*12 + 1] + 2 - || out2[i*12 + 2] != in2[i*12 + 2] + 3 - || out2[i*12 + 3] != in2[i*12 + 3] + 4 - || out2[i*12 + 4] != in2[i*12 + 4] + 5 - || out2[i*12 + 5] != in2[i*12 + 5] + 6 - || out2[i*12 + 6] != in2[i*12 + 6] + 7 - || out2[i*12 + 7] != in2[i*12 + 7] + 8 - || out2[i*12 + 8] != in2[i*12 + 8] + 9 - || out2[i*12 + 9] != in2[i*12 + 9] + 10 - || out2[i*12 + 10] != in2[i*12 + 10] + 11 - || out2[i*12 + 11] != in2[i*12 + 11] + 12) - abort (); - } - - - - return 0; -} - -int main (void) -{ - check_vect (); - - main1 (); - - return 0; -} - -/* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" { target { vect_interleave && vect_extract_even_odd } } } } */ -/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 3 "vect" { xfail *-*-* } } } */ -/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" } } */ -/* { dg-final { cleanup-tree-dump "vect" } } */ - |