1 /* { dg-require-effective-target vect_float } */
17 __attribute__ ((noinline))
28 /* Avoid vectorization. */
34 results1[i] = b[i+N/2] * c[i+N/2] - b[i] * c[i];
35 results2[i+N/2] = b[i] * c[i+N/2] + b[i+N/2] * c[i];
36 /* Avoid vectorization. */
41 for (i = 0; i < N/2; i++)
43 a[i] = b[i+N/2] * c[i+N/2] - b[i] * c[i];
44 e[i+N/2] = b[i] * c[i+N/2] + b[i+N/2] * c[i];
50 if (a[i] != results1[i] || e[i] != results2[i])
55 for (i = 1; i <=N-4; i++)
61 for (i = 1; i <=N-4; i++)
77 /* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" } } */
78 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" { target { { vect_aligned_arrays } && {! vect_sizes_32B_16B} } } } } */
79 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { target { {! vect_aligned_arrays } && {vect_sizes_32B_16B} } } } } */
80 /* { dg-final { cleanup-tree-dump "vect" } } */