| /* { dg-require-effective-target vect_int } */ | |
| #include <stdarg.h> | |
| #include "tree-vect.h" | |
| #define N 16 | |
| int main1 () | |
| { | |
| int i; | |
| int a[N]; | |
| int b[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45}; | |
| /* Not vectorizable yet (reverse access and forward access). */ | |
| for (i = N; i > 0; i--) | |
| { | |
| a[N-i] = b[i-1]; | |
| } | |
| /* check results: */ | |
| for (i = 0; i <N; i++) | |
| { | |
| if (a[i] != b[N-1-i]) | |
| abort (); | |
| } | |
| return 0; | |
| } | |
| int main (void) | |
| { | |
| check_vect(); | |
| return main1 (); | |
| } | |
| /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail *-*-* } } } */ |