1 /* { dg-require-effective-target vect_int } */
9 int b
[N
] = {1,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
10 int c
[N
] = {1,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
12 /* Test vectorization of reduction of signed-int. */
14 __attribute__ ((noinline
))
15 void main1 (int x
, int max_result
, int min_result
)
22 for (i
= 0; i
< N
; i
++) {
23 diff
+= (b
[i
] - c
[i
]);
26 for (i
= 0; i
< N
; i
++) {
27 max
= max
< c
[i
] ? c
[i
] : max
;
30 for (i
= 0; i
< N
; i
++) {
31 min
= min
> c
[i
] ? c
[i
] : min
;
37 if (max
!= max_result
)
39 if (min
!= min_result
)
52 /* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" { xfail { vect_no_int_add || vect_no_int_max } } } } */
53 /* { dg-final { cleanup-tree-dump "vect" } } */