| /* { dg-require-effective-target vect_int } */ |
| |
| #include <stdarg.h> |
| #include "tree-vect.h" |
| |
| #define N 40 |
| |
| int a[N]; |
| int b[N]; |
| |
| __attribute__ ((noinline)) int |
| foo (){ |
| int i,j; |
| int sum,x,y; |
| |
| for (i = 0; i < N/2; i++) { |
| sum = 0; |
| x = b[2*i]; |
| y = b[2*i+1]; |
| for (j = 0; j < N; j++) { |
| sum += j; |
| } |
| a[2*i] = sum + x; |
| a[2*i+1] = sum + y; |
| } |
| } |
| |
| int main (void) |
| { |
| int i,j; |
| int sum; |
| |
| check_vect (); |
| |
| for (i=0; i<N; i++) |
| b[i] = i; |
| |
| foo (); |
| |
| /* check results: */ |
| for (i=0; i<N/2; i++) |
| { |
| sum = 0; |
| for (j = 0; j < N; j++) |
| sum += j; |
| if (a[2*i] != sum + b[2*i] || a[2*i+1] != sum + b[2*i+1]) |
| abort(); |
| } |
| |
| return 0; |
| } |
| |
| /* { dg-final { scan-tree-dump-times "OUTER LOOP VECTORIZED." 1 "vect" { target { vect_interleave && vect_extract_even_odd } } } } */ |
| /* { dg-final { cleanup-tree-dump "vect" } } */ |