1 /* { dg-require-effective-target vect_float } */
8 typedef float afloat __attribute__ ((__aligned__(16)));
10 void bar (float *pd, float *pa, float *pb, float *pc)
15 for (i = 0; i < N; i++)
17 if (pa[i] != (pb[i] * pc[i]))
28 main1 (int n, float * __restrict__ pd, float * __restrict__ pa, float * __restrict__ pb, float * __restrict__ pc)
32 for (i = 0; i < n; i++)
34 pa[i] = pb[i] * pc[i];
48 float b[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57};
49 float c[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19};
53 main1 (N,&d[1],a,b,c);
54 main1 (N-2,&d[1],a,b,c);
59 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
60 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" } } */
62 /* For targets that support unaligned loads we version for the two unaligned stores and
63 generate misaligned accesses for the loads. For targets that don't support unaligned
64 loads we version for all four accesses. */
66 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { xfail vect_no_align } } } */
67 /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 2 "vect" { xfail vect_no_align } } } */
68 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" { target vect_no_align } } }
69 /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 4 "vect" { target vect_no_align } } } */
70 /* { dg-final { cleanup-tree-dump "vect" } } */