1 /* { dg-require-effective-target vect_int } */
9 void main1 (short x, short max_result, short min_result)
12 short b[N] = {1,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
13 short c[N] = {1,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
18 for (i = 0; i < N; i++) {
19 diff += (short)(b[i] - c[i]);
21 for (i = 0; i < N; i++) {
22 max = max < c[i] ? c[i] : max;
25 for (i = 0; i < N; i++) {
26 min = min > c[i] ? c[i] : min;
32 if (max != max_result)
34 if (min != min_result)
47 /* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" } } */
48 /* { dg-final { cleanup-tree-dump "vect" } } */