1 /* { dg-do compile } */
2 /* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-final_cleanup" } */
10 __attribute__ ((noinline
))
11 void main1 (signed char x
, signed char max_result
, signed char min_result
)
14 signed char b
[N
] = {1,2,3,6,8,10,12,14,16,18,20,22,24,26,28,30};
15 signed char c
[N
] = {1,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
20 for (i
= 0; i
< N
; i
++) {
21 diff
+= (signed char)(b
[i
] - c
[i
]);
24 for (i
= 0; i
< N
; i
++) {
25 max
= max
< c
[i
] ? c
[i
] : max
;
28 for (i
= 0; i
< N
; i
++) {
29 min
= min
> c
[i
] ? c
[i
] : min
;
35 if (max
!= max_result
)
37 if (min
!= min_result
)
48 /* { dg-final { scan-tree-dump-times "Detected reduction" 2 "parloops" } } */
49 /* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 2 "parloops" } } */
50 /* { dg-final { cleanup-tree-dump "parloops" } } */
51 /* { dg-final { cleanup-tree-dump "final_cleanup" } } */