Debian Codegraph @

libgomp/testsuite/libgomp.c++/target-std__bitset-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 <bitset>
7 #include <set>
8 #include <algorithm>
9
10 #define N 4000
11 #define MAX 16384
12
13 void init (int data[])
14 {
15 std::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.find (data[i]) != _set.end ());
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::bitset<MAX> _set;
38 int sum = 0;
39
40 srand (time (NULL));
41 init (data);
42
43 #ifndef MEM_SHARED
44 #pragma omp target data map (to: data[:N]) map (alloc: _set)
45 #endif
46 {
47 #pragma omp target
48 {
49 #ifndef MEM_SHARED
50 new (&_set) std::bitset<MAX> ();
51 #endif
52 for (int i = 0; i < N; ++i)
53 _set[data[i]] = true;
54 }
55
56 #pragma omp target teams distribute parallel for reduction (+:sum)
57 for (int i = 0; i < MAX; ++i)
58 if (_set[i])
59 sum += i;
60
61 #ifndef MEM_SHARED
62 #pragma omp target
63 _set.~bitset ();
64 #endif
65 }
66
67 bool ok = validate (sum, data);
68 return ok ? 0 : 1;
69 }