| /* { dg-require-effective-target vect_int } */ |
| |
| #include <stdarg.h> |
| #include "tree-vect.h" |
| |
| #define N 16 |
| |
| __attribute__ ((noinline)) |
| int main1 () |
| { |
| struct { |
| char ca[N]; |
| } s; |
| int i; |
| |
| for (i = 0; i < N; i++) |
| { |
| s.ca[i] = 5; |
| } |
| |
| /* check results: */ |
| for (i = 0; i < N; i++) |
| { |
| if (s.ca[i] != 5) |
| 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 { cleanup-tree-dump "vect" } } */ |
