blob: 13d2ff921d054a0d34b740d25e0c99c021d3ce18 (
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
|
// { dg-do run }
// { dg-additional-options "-std=c++23" }
// { dg-additional-options -DMEM_SHARED { target offload_device_shared_as } }
#include <stdlib.h>
#include <time.h>
#include <flat_set>
#include <algorithm>
// MAX should be less than N to ensure that some duplicates occur.
#define N 4000
#define MAX 1000
void init (int data[])
{
for (int i = 0; i < N; ++i)
data[i] = rand () % MAX;
}
bool validate (int sum, int data[])
{
int total = 0;
for (int i = 0; i < N; ++i)
total += data[i];
return sum == total;
}
int main (void)
{
int data[N];
std::flat_multiset<int> set;
int sum = 0;
srand (time (NULL));
init (data);
#pragma omp target data map (to: data[ :N]) map (alloc: set)
{
#pragma omp target
{
#ifndef MEM_SHARED
new (&set) std::flat_multiset<int> ();
#endif
for (int i = 0; i < N; ++i)
set.insert (data[i]);
}
#pragma omp target teams distribute parallel for reduction (+:sum)
for (int i = 0; i < MAX; ++i)
sum += i * set.count (i);
#ifndef MEM_SHARED
#pragma omp target
set.~flat_multiset ();
#endif
}
bool ok = validate (sum, data);
return ok ? 0 : 1;
}
|
