1 /* { dg-require-effective-target vect_int } */
9 unsigned short ub[N] = {1,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
10 unsigned short uc[N] = {1,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
12 __attribute__ ((noinline)) void
13 main1 (unsigned short x, unsigned short max_result, unsigned short min_result)
16 unsigned short udiff = 2;
17 unsigned short umax = x;
18 unsigned short umin = x;
20 for (i = 0; i < N; i++) {
21 udiff += (unsigned short)(ub[i] - uc[i]);
24 for (i = 0; i < N; i++) {
25 umax = umax < uc[i] ? uc[i] : umax;
28 for (i = 0; i < N; i++) {
29 umin = umin > uc[i] ? uc[i] : umin;
35 if (umax != max_result)
37 if (umin != min_result)
50 /* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" { xfail vect_no_int_max } } } */
51 /* { dg-final { cleanup-tree-dump "vect" } } */