Debian Codegraph @

libgomp/testsuite/libgomp.c++/target-std__unordered_set-concurrent.C

raw
1 // { dg-do run }
2 // { dg-additional-options -DMEM_SHARED { target offload_device_shared_as } }
3
4 #include <stdlib.h>
5 #include <time.h>
6 #include <unordered_set>
7 #include <algorithm>
8
9 #define N 4000
10 #define MAX 16384
11
12 void init (int data[])
13 {
14 std::unordered_set<int> _set;
15 for (int i = 0; i < N; ++i)
16 {
17 // Avoid duplicates in data array.
18 do
19 data[i] = rand () % MAX;
20 while (_set.count (data[i]) != 0);
21 _set.insert (data[i]);
22 }
23 }
24
25 bool validate (int sum, int data[])
26 {
27 int total = 0;
28 for (int i = 0; i < N; ++i)
29 total += data[i];
30 return sum == total;
31 }
32
33 int main (void)
34 {
35 int data[N];
36 std::unordered_set<int> _set;
37 int sum = 0;
38
39 srand (time (NULL));
40 init (data);
41
42 #pragma omp target data map (to: data[:N]) map (alloc: _set)
43 {
44 #pragma omp target
45 {
46 #ifndef MEM_SHARED
47 new (&_set) std::unordered_set<int> ();
48 #endif
49 for (int i = 0; i < N; ++i)
50 _set.insert (data[i]);
51 }
52
53 #pragma omp target teams distribute parallel for reduction (+:sum)
54 for (int i = 0; i < MAX; ++i)
55 if (_set.count (i) > 0)
56 sum += i;
57
58 #ifndef MEM_SHARED
59 #pragma omp target
60 _set.~unordered_set ();
61 #endif
62 }
63
64 bool ok = validate (sum, data);
65 return ok ? 0 : 1;
66 }