Debian Codegraph @

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

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