| /* 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" |
| |
| /* N / 2 bytes has to be worth vectorizing even with peeling. */ |
| #if VECTOR_BITS > 128 |
| #define N (VECTOR_BITS * 4 / 8) |
| #else |
| #define N 64 |
| #endif |
| |
| struct t{ |
| int k[N]; |
| int l; |
| }; |
| |
| struct s{ |
| char a; /* aligned */ |
| char b[N-1]; /* unaligned (offset 1B) */ |
| char c[N]; /* aligned (offset NB) */ |
| struct t d; /* aligned (offset 2NB) */ |
| struct t e; /* unaligned (offset 2N+4N+4 B) */ |
| }; |
| |
| struct s tmp; |
| __attribute__ ((noinline)) |
| int main1 () |
| { |
| int i; |
| |
| /* unaligned */ |
| for (i = 0; i < N/2; i++) |
| { |
| tmp.b[i] = 5; |
| } |
| |
| /* check results: */ |
| for (i = 0; i <N/2; i++) |
| { |
| if (tmp.b[i] != 5) |
| abort (); |
| } |
| |
| /* aligned */ |
| for (i = 0; i < N/2; i++) |
| { |
| tmp.c[i] = 6; |
| } |
| |
| /* check results: */ |
| for (i = 0; i <N/2; i++) |
| { |
| if (tmp.c[i] != 6) |
| abort (); |
| } |
| |
| /* aligned */ |
| for (i = 0; i < N/2; i++) |
| { |
| tmp.d.k[i] = 7; |
| } |
| |
| /* check results: */ |
| for (i = 0; i <N/2; i++) |
| { |
| if (tmp.d.k[i] != 7) |
| abort (); |
| } |
| |
| /* unaligned */ |
| for (i = 0; i < N/2; i++) |
| { |
| tmp.e.k[i] = 8; |
| } |
| |
| /* check results: */ |
| for (i = 0; i <N/2; i++) |
| { |
| if (tmp.e.k[i] != 8) |
| abort (); |
| } |
| |
| return 0; |
| } |
| |
| int main (void) |
| { |
| check_vect (); |
| |
| return main1 (); |
| } |
| |
| /* { dg-final { scan-tree-dump-times "vectorized 4 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_element_align_preferred } } } */ |
