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