Debian Codegraph @

libgomp/testsuite/libgomp.c++/target-std__forward_list-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 <omp.h>
7 #include <forward_list>
8 #include <algorithm>
9
10 #define N 3000
11
12 void init (int data[])
13 {
14 for (int i = 0; i < N; ++i)
15 data[i] = rand ();
16 }
17
18 #pragma omp declare target
19 bool validate (const std::forward_list<int> &list, int data[])
20 {
21 int i = 0;
22 for (auto &v : list)
23 {
24 if (v != data[i] * data[i])
25 return false;
26 ++i;
27 }
28 return true;
29 }
30 #pragma omp end declare target
31
32 int main (void)
33 {
34 int data[N];
35 bool ok;
36
37 srand (time (NULL));
38 init (data);
39
40 #ifdef MEM_SHARED
41 std::forward_list<int> list (std::begin (data), std::end (data));
42 #else
43 std::forward_list<int> list;
44 #endif
45
46 #ifndef MEM_SHARED
47 #pragma omp target data map (to: data[:N]) map (alloc: list)
48 #endif
49 {
50 #ifndef MEM_SHARED
51 #pragma omp target
52 new (&list) std::forward_list<int> (std::begin (data), std::end (data));
53 #endif
54
55 #pragma omp target teams
56 do
57 {
58 int len = N / omp_get_num_teams () + (N % omp_get_num_teams () > 0);
59 int start = len * omp_get_team_num ();
60 if (start >= N)
61 break;
62 if (start + len >= N)
63 len = N - start;
64 auto it = list.begin ();
65 std::advance (it, start);
66 for (int i = 0; i < len; ++i)
67 {
68 *it *= *it;
69 ++it;
70 }
71 } while (false);
72
73 #pragma omp target map (from: ok)
74 {
75 ok = validate (list, data);
76 #ifndef MEM_SHARED
77 list.~forward_list ();
78 #endif
79 }
80 }
81
82 return ok ? 0 : 1;
83 }