1 /* { dg-do compile } */
2 /* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized" } */
8 extern void abort (void);
9 typedef unsigned char T
;
11 __attribute__ ((noinline
)) void
12 testmax (const T
*c
, T init
, T result
)
14 T lc
[N
], accum
= init
;
17 __builtin_memcpy (lc
, c
, sizeof(lc
));
19 for (i
= 0; i
< N
; i
++) {
20 accum
= accum
< lc
[i
] ? lc
[i
] : accum
;
27 __attribute__ ((noinline
)) void
28 testmin (const T
*c
, T init
, T result
)
30 T lc
[N
], accum
= init
;
33 __builtin_memcpy (lc
, c
, sizeof(lc
));
35 for (i
= 0; i
< N
; i
++) {
36 accum
= accum
> lc
[i
] ? lc
[i
] : accum
;
45 static unsigned char A
[N
] = {
46 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08,
47 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, 0x10,
48 0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77,
49 0x78, 0x79, 0x7a, 0x7b, 0x7c, 0x7d, 0x7e, 0x7f
52 static unsigned char B
[N
] = {
53 0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77,
54 0x78, 0x79, 0x7a, 0x7b, 0x7c, 0x7d, 0x7e, 0x7f,
55 0x80, 0x81, 0x82, 0x83, 0x84, 0x85, 0x86, 0x87,
56 0x88, 0x89, 0x8a, 0x8b, 0x8c, 0x8d, 0x8e, 0x8f
59 static unsigned char C
[N
] = {
60 0xff, 0xfe, 0xfd, 0xfc, 0xfb, 0xfa, 0xf9, 0xf8,
61 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, 0x10,
62 0x80, 0x81, 0x82, 0x83, 0x84, 0x85, 0x86, 0x87,
63 0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77,
76 testmin (B
, 0x7f, 0x70);
77 testmin (C
, 0x7f, 0x09);
87 /* { dg-final { scan-tree-dump-times "Detected reduction" 2 "parloops2" } } */
88 /* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 3 "parloops2" } } */