Mercurial > hg > CbC > CbC_gcc
view gcc/testsuite/gcc.dg/vect/slp-25.c @ 145:1830386684a0
gcc-9.2.0
author | anatofuz |
---|---|
date | Thu, 13 Feb 2020 11:34:05 +0900 |
parents | 84e7813d76e9 |
children |
line wrap: on
line source
/* Disabling epilogues until we find a better way to deal with scans. */ /* { dg-additional-options "--param vect-epilogues-nomask=0" } */ /* { 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_unaligned_possible } || { ! vect_natural_alignment } } } } } */