Debian Codegraph @

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