1 /* { dg-do compile } */
2 /* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
10 short b[N] = {1,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
11 short c[N] = {1,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
13 __attribute__ ((noinline))
14 void main1 (short x, short max_result, short min_result)
21 for (i = 0; i < N; i++) {
22 diff += (short)(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)
41 __attribute__((noinline))
62 /* { dg-final { scan-tree-dump-times "Detected reduction" 2 "parloops" } } */
63 /* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 3 "parloops" } } */
64 /* { dg-final { cleanup-tree-dump "parloops" } } */
65 /* { dg-final { cleanup-tree-dump "optimized" } } */