| 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 |
// MAX should be less than N to ensure that some duplicates occur. |
| 10 |
#define N 4000 |
| 11 |
#define MAX 1000 |
| 12 |
|
| 13 |
void init (int data[]) |
| 14 |
{ |
| 15 |
for (int i = 0; i < N; ++i) |
| 16 |
data[i] = rand () % MAX; |
| 17 |
} |
| 18 |
|
| 19 |
bool validate (int sum, int data[]) |
| 20 |
{ |
| 21 |
int total = 0; |
| 22 |
for (int i = 0; i < N; ++i) |
| 23 |
total += data[i]; |
| 24 |
return sum == total; |
| 25 |
} |
| 26 |
|
| 27 |
int main (void) |
| 28 |
{ |
| 29 |
int data[N]; |
| 30 |
std::unordered_multiset<int> set; |
| 31 |
int sum = 0; |
| 32 |
|
| 33 |
srand (time (NULL)); |
| 34 |
init (data); |
| 35 |
|
| 36 |
#pragma omp target data map (to: data[:N]) map (alloc: set) |
| 37 |
{ |
| 38 |
#pragma omp target |
| 39 |
{ |
| 40 |
#ifndef MEM_SHARED |
| 41 |
new (&set) std::unordered_multiset<int> (); |
| 42 |
#endif |
| 43 |
for (int i = 0; i < N; ++i) |
| 44 |
set.insert (data[i]); |
| 45 |
} |
| 46 |
|
| 47 |
#pragma omp target teams distribute parallel for reduction (+:sum) |
| 48 |
for (int i = 0; i < MAX; ++i) |
| 49 |
sum += i * set.count (i); |
| 50 |
|
| 51 |
#ifndef MEM_SHARED |
| 52 |
#pragma omp target |
| 53 |
set.~unordered_multiset (); |
| 54 |
#endif |
| 55 |
} |
| 56 |
|
| 57 |
bool ok = validate (sum, data); |
| 58 |
return ok ? 0 : 1; |
| 59 |
} |