| /* { dg-require-effective-target vect_int } */ |
| |
| #include <stdarg.h> |
| #include "tree-vect.h" |
| |
| #define N 64 |
| |
| typedef struct { |
| unsigned char a; |
| unsigned char b; |
| } s; |
| |
| __attribute__ ((noinline)) int |
| main1 () |
| { |
| s arr[N]; |
| s *ptr = arr; |
| s res[N]; |
| int i; |
| |
| for (i = 0; i < N; i++) |
| { |
| arr[i].a = i; |
| arr[i].b = i * 2; |
| asm volatile ("" ::: "memory"); |
| } |
| |
| for (i = 0; i < N; i++) |
| { |
| res[i].a = ptr->a; |
| res[i].b = ptr->a; |
| ptr++; |
| } |
| |
| /* check results: */ |
| for (i = 0; i < N; i++) |
| { |
| if (res[i].a != arr[i].a |
| || res[i].b != arr[i].a) |
| abort (); |
| } |
| |
| ptr = arr; |
| /* gap in store, use strided stores */ |
| for (i = 0; i < N; i++) |
| { |
| res[i].a = ptr->b; |
| ptr++; |
| } |
| |
| /* check results: */ |
| for (i = 0; i < N; i++) |
| { |
| if (res[i].a != arr[i].b) |
| abort (); |
| } |
| |
| |
| return 0; |
| } |
| |
| int main (void) |
| { |
| check_vect (); |
| |
| main1 (); |
| |
| return 0; |
| } |
| |
| /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_strided2 && { ! vect_hw_misalign } } } } } */ |
| /* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" { target { vect_strided2 && vect_hw_misalign } } } } */ |
| |