1 /* { dg-require-effective-target vect_float } */
2 /* { dg-additional-options "-fdump-tree-optimized-details-blocks" } */
16 __attribute__ ((noinline
))
27 asm volatile ("" ::: "memory");
31 results1
[i
] = b
[i
+N
/2] * c
[i
+N
/2] - b
[i
] * c
[i
];
32 results2
[i
+N
/2] = b
[i
] * c
[i
+N
/2] + b
[i
+N
/2] * c
[i
];
33 asm volatile ("" ::: "memory");
36 for (i
= 0; i
< N
/2; i
++)
38 a
[i
] = b
[i
+N
/2] * c
[i
+N
/2] - b
[i
] * c
[i
];
39 e
[i
+N
/2] = b
[i
] * c
[i
+N
/2] + b
[i
+N
/2] * c
[i
];
46 if (a
[i
] != results1
[i
] || e
[i
] != results2
[i
])
51 for (i
= 1; i
<=N
-4; i
++)
58 for (i
= 1; i
<=N
-4; i
++)
74 /* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" } } */
75 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" { target { { vect_aligned_arrays } && {! vect_sizes_32B_16B} } } } } */
76 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { target { {! vect_aligned_arrays } && {vect_sizes_32B_16B} } } } } */
77 /* { dg-final { scan-tree-dump-not "Invalid sum" "optimized" } } */