Mercurial > hg > CbC > CbC_gcc
diff gcc/testsuite/gcc.dg/vect/slp-25.c @ 111:04ced10e8804
gcc 7
author | kono |
---|---|
date | Fri, 27 Oct 2017 22:46:09 +0900 |
parents | |
children | 84e7813d76e9 |
line wrap: on
line diff
--- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/gcc/testsuite/gcc.dg/vect/slp-25.c Fri Oct 27 22:46:09 2017 +0900 @@ -0,0 +1,60 @@ +/* { dg-require-effective-target vect_int } */ +/* { dg-add-options bind_pic_locally } */ + +#include <stdarg.h> +#include "tree-vect.h" + +#define N 128 + +/* Unaligned stores. */ + +int ia[N+2]; +short sa[N+2]; + +int main1 (int n) +{ + int i; + + for (i = 1; i <= N/2; i++) + { + ia[2*i] = 25; + ia[2*i + 1] = 5; + } + + /* check results: */ + for (i = 1; i <= N/2; i++) + { + if (ia[2*i] != 25 + || ia[2*i + 1] != 5) + abort (); + } + + for (i = 1; i <= n/2; i++) + { + sa[2*i] = 25; + sa[2*i + 1] = 5; + } + + /* check results: */ + for (i = 1; i <= n/2; i++) + { + if (sa[2*i] != 25 + || sa[2*i + 1] != 5) + abort (); + } + + + return 0; +} + +int main (void) +{ + + check_vect (); + + return main1 (N); +} + +/* { dg-final { scan-tree-dump-times "vectorized 2 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" 2 "vect" { xfail { { vect_no_align && { ! vect_hw_misalign } } || { ! vect_natural_alignment } } } } } */