1 /* { dg-require-effective-target vect_float } */
8 __attribute__ ((noinline))
9 void bar (float *pa, float *pb, float *pc)
14 for (i = 0; i < N; i++)
16 if (pa[i] != (pb[i] * pc[i]))
23 /* Aligned pointer accesses.
24 The loop bound is known and divisible by the vectorization factor.
26 vect-46.c is similar to this one with one difference:
27 the loop bound is unknown. */
29 float b[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)))
30 = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57};
31 float c[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)))
32 = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19};
34 __attribute__ ((noinline)) int
38 float a[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
43 for (i = 0; i < N; i++)
45 pa[i] = pb[i] * pc[i];
60 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect"} } */
61 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
62 /* { dg-final { cleanup-tree-dump "vect" } } */