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