1 /* { dg-require-effective-target vect_float } */
2 /* { dg-add-options double_vectors } */
9 __attribute__ ((noinline))
10 void bar (float *pa, float *pb, float *pc)
15 for (i = 0; i < N/2; i++)
17 if (pa[i+1] != (pb[i+1] * pc[i+1]))
24 /* Unaligned pointer accesses, with a known alignment.
25 The loop bound is known and divisible by the vectorization factor.
27 vect-58.c is similar to this one with one difference:
28 the loop bound is unknown. */
30 float b[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {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__))) = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19};
33 __attribute__ ((noinline)) int
37 float a[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
42 for (i = 0; i < N/2; i++)
44 pa[i+1] = pb[i+1] * pc[i+1];
62 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
63 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
64 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" } } */
65 /* { dg-final { cleanup-tree-dump "vect" } } */