6 int a
, b
[3] = { 1, 1, 1 };
7 unsigned long int c
[2] = { ~0UL, ~0UL };
12 #pragma omp task in_reduction (*: b[:3]) in_reduction (&: c[1:]) \
17 c
[1] &= ~(1UL << (i
+ 16));
22 foo (unsigned long long int x
, unsigned long long int y
, unsigned long long int z
)
24 unsigned long long int i
;
25 #pragma omp for schedule(runtime) reduction (task, +: a) \
26 reduction (task, *: b) reduction (task, &: c[1:1])
27 for (i
= x
; i
< y
; i
+= z
)
41 foo (two
, 7 * two
, two
);
42 if (a
!= 30 || b
[0] != 64 || b
[1] != (1 << 12) || b
[2] != 3 * 3 * 3 * 3 * 3 * 3
43 || c
[0] != ~0UL || c
[1] != ~0x15541554UL
)
51 foo (two
, 8 * two
, two
);
52 if (a
!= 35 || b
[0] != 128 || b
[1] != (1 << 14) || b
[2] != 3 * 3 * 3 * 3 * 3 * 3 * 3
53 || c
[0] != ~0UL || c
[1] != ~0x55545554UL
)