1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
|
// REQUIRES: ompx_taskgraph
// RUN: %libomp-cxx-compile-and-run
#include <iostream>
#include <cassert>
#define NT 20
#define N 128*128
typedef struct ident {
void* dummy;
} ident_t;
#ifdef __cplusplus
extern "C" {
int __kmpc_global_thread_num(ident_t *);
int __kmpc_start_record_task(ident_t *, int, int, int);
void __kmpc_end_record_task(ident_t *, int, int , int);
}
#endif
int main() {
int num_tasks = 0;
int array[N];
for (int i = 0; i < N; ++i)
array[i] = 1;
long sum = 0;
#pragma omp parallel
#pragma omp single
for (int iter = 0; iter < NT; ++iter) {
int gtid = __kmpc_global_thread_num(nullptr);
int res = __kmpc_start_record_task(nullptr, gtid, /* kmp_tdg_flags */0, /* tdg_id */0);
if (res) {
num_tasks++;
#pragma omp taskloop reduction(+:sum) num_tasks(4096)
for (int i = 0; i < N; ++i) {
sum += array[i];
}
}
__kmpc_end_record_task(nullptr, gtid, /* kmp_tdg_flags */0, /* tdg_id */0);
}
assert(sum==N*NT);
assert(num_tasks==1);
std::cout << "Passed" << std::endl;
return 0;
}
// CHECK: Passed
|
