| /* { dg-require-effective-target vect_float } */ |
| |
| #include <stdarg.h> |
| #include "tree-vect.h" |
| |
| #define N 256 |
| |
| void bar (float *pa, float *pb, float *pc) |
| { |
| int i; |
| |
| /* check results: */ |
| for (i = 0; i < N; i++) |
| { |
| if (pa[i] != (pb[i] * pc[i])) |
| abort (); |
| } |
| |
| return; |
| } |
| |
| /* Unaligned write access, aligned read accesses. |
| Since we are handling an unaligned store by peeling the loop, |
| the loads will become unaligned. |
| The loop bound is known and divisible by the vectorization factor. |
| No aliasing problems. */ |
| |
| int |
| main1 (float * __restrict__ pa) |
| { |
| int i; |
| float pb[N] __attribute__ ((__aligned__(16))) = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57}; |
| float pc[N] __attribute__ ((__aligned__(16))) = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; |
| |
| for (i = 0; i < N; i++) |
| { |
| pa[i] = pb[i] * pc[i]; |
| } |
| |
| return 0; |
| } |
| |
| int main (void) |
| { |
| int i; |
| float a[N] __attribute__ ((__aligned__(16))); |
| float b[N] __attribute__ ((__aligned__(16))) = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57}; |
| float c[N] __attribute__ ((__aligned__(16))) = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; |
| |
| check_vect (); |
| |
| main1 (a); |
| bar (a,b,c); |
| return 0; |
| } |
| |
| /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail vect_no_align } } } */ |
| /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { xfail vect_no_align } } } */ |
| /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail vect_no_align } } } */ |
| /* { dg-final { cleanup-tree-dump "vect" } } */ |