Debian Codegraph @

libgomp/testsuite/libgomp.c++/target-std__flat_set-concurrent.C

raw
1 // { dg-do run }
2 // { dg-additional-options "-std=c++23" }
3 // { dg-additional-options -DMEM_SHARED { target offload_device_shared_as } }
4
5 #include <stdlib.h>
6 #include <time.h>
7 #include <flat_set>
8 #include <algorithm>
9
10 #define N 4000
11 #define MAX 16384
12
13 void init (int data[])
14 {
15 std::flat_set<int> _set;
16 for (int i = 0; i < N; ++i)
17 {
18 // Avoid duplicates in data array.
19 do
20 data[i] = rand () % MAX;
21 while (_set.count (data[i]) != 0);
22 _set.insert (data[i]);
23 }
24 }
25
26 bool validate (int sum, int data[])
27 {
28 int total = 0;
29 for (int i = 0; i < N; ++i)
30 total += data[i];
31 return sum == total;
32 }
33
34 int main (void)
35 {
36 int data[N];
37 std::flat_set<int> _set;
38 int sum = 0;
39
40 srand (time (NULL));
41 init (data);
42
43 #pragma omp target data map (to: data[:N]) map (alloc: _set)
44 {
45 #pragma omp target
46 {
47 #ifndef MEM_SHARED
48 new (&_set) std::flat_set<int> ();
49 #endif
50 for (int i = 0; i < N; ++i)
51 _set.insert (data[i]);
52 }
53
54 #pragma omp target teams distribute parallel for reduction (+:sum)
55 for (int i = 0; i < MAX; ++i)
56 if (_set.count (i) > 0)
57 sum += i;
58
59 #ifndef MEM_SHARED
60 #pragma omp target
61 _set.~flat_set ();
62 #endif
63 }
64
65 bool ok = validate (sum, data);
66 return ok ? 0 : 1;
67 }