Debian Codegraph @

libgomp/testsuite/libgomp.c++/target-std__unordered_map-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 <set>
7 #include <unordered_map>
8
9 #define N 3000
10
11 void init (int data[], bool unique)
12 {
13 std::set<int> _set;
14 for (int i = 0; i < N; ++i)
15 {
16 // Avoid duplicates in data array if unique is true.
17 do
18 data[i] = rand ();
19 while (unique && _set.count (data[i]) > 0);
20 _set.insert (data[i]);
21 }
22 }
23
24 bool validate (long long sum, int keys[], int data[])
25 {
26 long long total = 0;
27 for (int i = 0; i < N; ++i)
28 total += (long long) keys[i] * data[i];
29 return sum == total;
30 }
31
32 int main (void)
33 {
34 int keys[N], data[N];
35 std::unordered_map<int,int> _map;
36
37 srand (time (NULL));
38 init (keys, true);
39 init (data, false);
40
41 #pragma omp target enter data map (to: keys[:N], data[:N]) map (alloc: _map)
42
43 #pragma omp target
44 {
45 #ifndef MEM_SHARED
46 new (&_map) std::unordered_map<int,int> ();
47 #endif
48 for (int i = 0; i < N; ++i)
49 _map[keys[i]] = data[i];
50 }
51
52 long long sum = 0;
53 #pragma omp target teams distribute parallel for reduction (+:sum)
54 for (int i = 0; i < N; ++i)
55 sum += (long long) keys[i] * _map[keys[i]];
56
57 #ifndef MEM_SHARED
58 #pragma omp target
59 _map.~unordered_map ();
60 #endif
61
62 #pragma omp target exit data map (release: _map)
63
64 bool ok = validate (sum, keys, data);
65 return ok ? 0 : 1;
66 }