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
; i
++)
17 if (pa
[i
] != (pb
[i
] * pc
[i
]))
24 /* Aligned pointer accesses.
25 The loop bound is unknown.
27 vect-40.c is similar to this one with one difference:
28 the loop bound is known. */
30 float b
[N
] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__
)))
31 = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57};
32 float c
[N
] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__
)))
33 = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19};
35 __attribute__ ((noinline
)) int
39 float a
[N
] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__
)));
44 for (i
= 0; i
< n
; i
++)
46 pa
[i
] = pb
[i
] * pc
[i
];
63 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
64 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
65 /* { dg-final { cleanup-tree-dump "vect" } } */