blob: c54acea1d25488c73a39a4fa0fe9a7afa8e90f64 (
plain)
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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
|
// { dg-do run }
// { dg-additional-options -DMEM_SHARED { target offload_device_shared_as } }
#include <stdlib.h>
#include <time.h>
#include <set>
#include <map>
#define N 3000
void init (int data[], bool unique)
{
std::set<int> _set;
for (int i = 0; i < N; ++i)
{
// Avoid duplicates in data array if unique is true.
do
data[i] = rand ();
while (unique && _set.find (data[i]) != _set.end ());
_set.insert (data[i]);
}
}
bool validate (long long sum, int keys[], int data[])
{
long long total = 0;
for (int i = 0; i < N; ++i)
total += (long long) keys[i] * data[i];
return sum == total;
}
int main (void)
{
int keys[N], data[N];
std::map<int,int> _map;
srand (time (NULL));
init (keys, true);
init (data, false);
#ifndef MEM_SHARED
#pragma omp target enter data map (to: keys[ :N], data[ :N]) map (alloc: _map)
#endif
#pragma omp target
{
#ifndef MEM_SHARED
new (&_map) std::map<int,int> ();
#endif
for (int i = 0; i < N; ++i)
_map[keys[i]] = data[i];
}
long long sum = 0;
#pragma omp target teams distribute parallel for reduction (+:sum)
for (int i = 0; i < N; ++i)
sum += (long long) keys[i] * _map[keys[i]];
#ifndef MEM_SHARED
#pragma omp target
_map.~map ();
#endif
#ifndef MEM_SHARED
#pragma omp target exit data map (release: _map)
#endif
bool ok = validate (sum, keys, data);
return ok ? 0 : 1;
}
|
