1 /* { dg-require-effective-target vect_float } */
3 /* need -funsafe-math-optimizations to vectorize the summation.
4 also need -ffinite-math-only to create the min/max expr. */
12 int main1 (float x, float max_result)
15 float b[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
16 float c[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
21 for (i = 0; i < N; i++) {
22 diff += (b[i] - c[i]);
25 for (i = 0; i < N; i++) {
26 max = max < c[i] ? c[i] : max;
29 for (i = 0; i < N; i++) {
30 min = min > c[i] ? c[i] : min;
36 if (max != max_result)
53 /* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" } } */
54 /* { dg-final { cleanup-tree-dump "vect" } } */