| /* 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 } */ |
| |
| #include <stdarg.h> |
| #include "tree-vect.h" |
| |
| #define N 120 |
| #define OFF 8 |
| |
| /* Check handling of accesses for which the "initial condition" - |
| the expression that represents the first location accessed - is |
| more involved than just an ssa_name. */ |
| |
| int ib[N+OFF] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0, 1, 3, 5, 7, 11, 13, 17}; |
| |
| __attribute__ ((noinline)) |
| int main1 (int *ib) |
| { |
| int i; |
| int ia[N]; |
| |
| for (i = OFF; i < N+OFF; i++) |
| { |
| ib[i] = ib[i%OFF]*(i/OFF); |
| asm volatile ("" ::: "memory"); |
| } |
| for (i = 0; i < N; i++) |
| { |
| ia[i] = ib[i+OFF]; |
| } |
| |
| |
| /* check results: */ |
| for (i = 0; i < N; i++) |
| { |
| if (ia[i] != ib[i+OFF]) |
| abort (); |
| } |
| |
| return 0; |
| } |
| |
| int main (void) |
| { |
| check_vect (); |
| |
| main1 (ib); |
| return 0; |
| } |
| |
| |
| /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */ |
| /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 1 "vect" { target { vect_no_align && { ! vect_hw_misalign } } } } } */ |
| /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { target { ! vect_align_stack_vars } xfail { ! vect_unaligned_possible } } } } */ |
| /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { target vect_align_stack_vars xfail { ! vect_unaligned_possible } } } } */ |