| 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 <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] = rand () % 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::multimap<int,int> _map; |
| 30 |
|
| 31 |
srand (time (NULL)); |
| 32 |
init (keys, KEY_MAX); |
| 33 |
init (data, RAND_MAX); |
| 34 |
|
| 35 |
#ifndef MEM_SHARED |
| 36 |
#pragma omp target enter data map (to: keys[:N], data[:N]) map (alloc: _map) |
| 37 |
#endif |
| 38 |
|
| 39 |
#pragma omp target |
| 40 |
{ |
| 41 |
#ifndef MEM_SHARED |
| 42 |
new (&_map) std::multimap<int,int> (); |
| 43 |
#endif |
| 44 |
for (int i = 0; i < N; ++i) |
| 45 |
_map.insert({keys[i], data[i]}); |
| 46 |
} |
| 47 |
|
| 48 |
long long sum = 0; |
| 49 |
#pragma omp target teams distribute parallel for reduction (+:sum) |
| 50 |
for (int i = 0; i < KEY_MAX; ++i) |
| 51 |
{ |
| 52 |
auto range = _map.equal_range (i); |
| 53 |
for (auto it = range.first; it != range.second; ++it) |
| 54 |
sum += (long long) it->first * it->second; |
| 55 |
} |
| 56 |
|
| 57 |
#ifndef MEM_SHARED |
| 58 |
#pragma omp target |
| 59 |
_map.~multimap (); |
| 60 |
#endif |
| 61 |
|
| 62 |
#ifndef MEM_SHARED |
| 63 |
#pragma omp target exit data map (release: _map) |
| 64 |
#endif |
| 65 |
|
| 66 |
bool ok = validate (sum, keys, data); |
| 67 |
return ok ? 0 : 1; |
| 68 |
} |