1 /* { dg-require-effective-target vect_int } */
9 /* Test vectorization of reduction of unsigned-int. */
11 void main1 (unsigned int x, unsigned int max_result, unsigned int min_result)
14 unsigned int ub[N] = {1,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
15 unsigned int uc[N] = {1,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
16 unsigned int udiff = 2;
17 unsigned int umax = x;
18 unsigned int umin = x;
21 for (i = 0; i < N; i++) {
22 udiff += (ub[i] - uc[i]);
26 for (i = 0; i < N; i++) {
27 umax = umax < uc[i] ? uc[i] : umax;
31 for (i = 0; i < N; i++) {
32 umin = umin > uc[i] ? uc[i] : umin;
38 if (umax != max_result)
40 if (umin != min_result)
53 /* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" { xfail { vect_no_int_add || vect_no_int_max } } } } */
54 /* { dg-final { cleanup-tree-dump "vect" } } */