1 /* { dg-require-effective-target vect_int } */
2 /* { dg-do compile } */
10 int main1 (int x
, int max_result
)
13 int b
[N
] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
14 int c
[N
] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
19 for (i
= 0; i
< N
; i
++) {
20 diff
+= (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
)
49 /* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" } } */
50 /* { dg-final { cleanup-tree-dump "vect" } } */