Debian Codegraph @

libgomp/testsuite/libgomp.c++/target-std__unordered_multimap-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_map>
7
8 // Make sure that KEY_MAX is less than N to ensure some duplicate keys.
9 #define N 3000
10 #define KEY_MAX 1000
11
12 void init (int data[], int max)
13 {
14 for (int i = 0; i < N; ++i)
15 data[i] = i % max;
16 }
17
18 bool validate (long long sum, int keys[], int data[])
19 {
20 long long total = 0;
21 for (int i = 0; i < N; ++i)
22 total += (long long) keys[i] * data[i];
23 return sum == total;
24 }
25
26 int main (void)
27 {
28 int keys[N], data[N];
29 std::unordered_multimap<int,int> _map;
30
31 srand (time (NULL));
32 init (keys, KEY_MAX);
33 init (data, RAND_MAX);
34
35 #pragma omp target enter data map (to: keys[:N], data[:N]) map (alloc: _map)
36
37 #pragma omp target
38 {
39 #ifndef MEM_SHARED
40 new (&_map) std::unordered_multimap<int,int> ();
41 #endif
42 for (int i = 0; i < N; ++i)
43 _map.insert({keys[i], data[i]});
44 }
45
46 long long sum = 0;
47 #pragma omp target teams distribute parallel for reduction (+:sum)
48 for (int i = 0; i < KEY_MAX; ++i)
49 {
50 auto range = _map.equal_range (i);
51 for (auto it = range.first; it != range.second; ++it) {
52 sum += (long long) it->first * it->second;
53 }
54 }
55
56 #ifndef MEM_SHARED
57 #pragma omp target
58 _map.~unordered_multimap ();
59 #endif
60
61 #pragma omp target exit data map (release: _map)
62
63 bool ok = validate (sum, keys, data);
64 return ok ? 0 : 1;
65 }