1 | // RUN: %clang_cc1 -verify -fopenmp -ast-print %s -Wno-openmp-target | FileCheck %s |
2 | // RUN: %clang_cc1 -fopenmp -x c++ -std=c++11 -emit-pch -o %t %s |
3 | // RUN: %clang_cc1 -fopenmp -std=c++11 -include-pch %t -fsyntax-only -verify %s -ast-print -Wno-openmp-target | FileCheck %s |
4 | |
5 | // RUN: %clang_cc1 -verify -fopenmp-simd -ast-print %s -Wno-openmp-target | FileCheck %s |
6 | // RUN: %clang_cc1 -fopenmp-simd -x c++ -std=c++11 -emit-pch -o %t %s |
7 | // RUN: %clang_cc1 -fopenmp-simd -std=c++11 -include-pch %t -fsyntax-only -verify %s -ast-print -Wno-openmp-target | FileCheck %s |
8 | // expected-no-diagnostics |
9 | |
10 | #ifndef HEADER |
11 | #define HEADER |
12 | |
13 | void foo() {} |
14 | |
15 | struct S { |
16 | S(): a(0) {} |
17 | S(int v) : a(v) {} |
18 | int a; |
19 | typedef int type; |
20 | }; |
21 | |
22 | template <typename T> |
23 | class S7 : public T { |
24 | protected: |
25 | T a; |
26 | S7() : a(0) {} |
27 | |
28 | public: |
29 | S7(typename T::type v) : a(v) { |
30 | #pragma omp target |
31 | #pragma omp teams distribute simd private(a) private(this->a) private(T::a) |
32 | for (int k = 0; k < a.a; ++k) |
33 | ++this->a.a; |
34 | } |
35 | S7 &operator=(S7 &s) { |
36 | int k; |
37 | #pragma omp target |
38 | #pragma omp teams distribute simd private(a) private(this->a) linear(k) |
39 | for (k = 0; k < s.a.a; ++k) |
40 | ++s.a.a; |
41 | return *this; |
42 | } |
43 | void foo() { |
44 | int b, argv, d, c, e, f; |
45 | #pragma omp target |
46 | #pragma omp teams distribute simd default(none), private(b) firstprivate(argv) shared(d) reduction(+:c) reduction(max:e) num_teams(f) thread_limit(d) |
47 | for (int k = 0; k < a.a; ++k) |
48 | ++a.a; |
49 | } |
50 | void bar() { |
51 | int arr[10]; |
52 | const int alen = 16; |
53 | const int slen1 = 8; |
54 | const int slen2 = 8; |
55 | #pragma omp target |
56 | #pragma omp teams distribute simd simdlen(slen1) safelen(slen2) aligned(arr:alen) |
57 | for (int k = 0; k < a.a; ++k) |
58 | ++a.a; |
59 | } |
60 | }; |
61 | // CHECK: #pragma omp target |
62 | // CHECK-NEXT: #pragma omp teams distribute simd private(this->a) private(this->a) private(T::a) |
63 | // CHECK: #pragma omp target |
64 | // CHECK-NEXT: #pragma omp teams distribute simd private(this->a) private(this->a) linear(k) |
65 | // CHECK: #pragma omp target |
66 | // CHECK-NEXT: #pragma omp teams distribute simd default(none) private(b) firstprivate(argv) shared(d) reduction(+: c) reduction(max: e) num_teams(f) thread_limit(d) |
67 | // CHECK: #pragma omp target |
68 | // CHECK-NEXT: #pragma omp teams distribute simd simdlen(slen1) safelen(slen2) aligned(arr: alen) |
69 | // CHECK: #pragma omp target |
70 | // CHECK-NEXT: #pragma omp teams distribute simd private(this->a) private(this->a) private(this->S::a) |
71 | |
72 | class S8 : public S7<S> { |
73 | S8() {} |
74 | |
75 | public: |
76 | S8(int v) : S7<S>(v){ |
77 | #pragma omp target |
78 | #pragma omp teams distribute simd private(a) private(this->a) private(S7 <S>::a) |
79 | for (int k = 0; k < a.a; ++k) |
80 | ++this->a.a; |
81 | } |
82 | S8 &operator=(S8 &s) { |
83 | #pragma omp target |
84 | #pragma omp teams distribute simd private(a) private(this->a) |
85 | for (int k = 0; k < s.a.a; ++k) |
86 | ++s.a.a; |
87 | return *this; |
88 | } |
89 | void bar() { |
90 | int b, argv, d, c, e, f; |
91 | #pragma omp target |
92 | #pragma omp teams distribute simd default(none), private(b) firstprivate(argv) shared(d) reduction(+:c) reduction(max:e) num_teams(f) thread_limit(d) |
93 | for (int k = 0; k < a.a; ++k) |
94 | ++a.a; |
95 | } |
96 | void foo() { |
97 | const int alen = 16; |
98 | const int slen1 = 8; |
99 | const int slen2 = 8; |
100 | int arr[10]; |
101 | #pragma omp target |
102 | #pragma omp teams distribute simd simdlen(slen1) safelen(slen2) aligned(arr:alen) |
103 | for (int k = 0; k < a.a; ++k) |
104 | ++a.a; |
105 | } |
106 | }; |
107 | // CHECK: #pragma omp target |
108 | // CHECK-NEXT: #pragma omp teams distribute simd private(this->a) private(this->a) private(this->S7<S>::a) |
109 | // CHECK: #pragma omp target |
110 | // CHECK-NEXT: #pragma omp teams distribute simd private(this->a) private(this->a) |
111 | // CHECK: #pragma omp target |
112 | // CHECK-NEXT: #pragma omp teams distribute simd default(none) private(b) firstprivate(argv) shared(d) reduction(+: c) reduction(max: e) num_teams(f) thread_limit(d) |
113 | // CHECK: #pragma omp target |
114 | // CHECK-NEXT: #pragma omp teams distribute simd simdlen(slen1) safelen(slen2) aligned(arr: alen) |
115 | |
116 | template <class T, int N> |
117 | T tmain(T argc) { |
118 | T b = argc, c, d, e, f, g; |
119 | static T a; |
120 | // CHECK: static T a; |
121 | const T clen = 5; |
122 | const T alen = 16; |
123 | int arr[10]; |
124 | #pragma omp target |
125 | #pragma omp teams distribute simd |
126 | for (int i=0; i < 2; ++i) |
127 | a = 2; |
128 | // CHECK: #pragma omp target |
129 | // CHECK-NEXT: #pragma omp teams distribute simd{{$}} |
130 | // CHECK-NEXT: for (int i = 0; i < 2; ++i) |
131 | // CHECK-NEXT: a = 2; |
132 | #pragma omp target |
133 | #pragma omp teams distribute simd allocate(b) private(argc, b), firstprivate(c, d), collapse(2) allocate(c) |
134 | for (int i = 0; i < 10; ++i) |
135 | for (int j = 0; j < 10; ++j) |
136 | foo(); |
137 | // CHECK: #pragma omp target |
138 | // CHECK-NEXT: #pragma omp teams distribute simd allocate(b) private(argc,b) firstprivate(c,d) collapse(2) allocate(c) |
139 | // CHECK-NEXT: for (int i = 0; i < 10; ++i) |
140 | // CHECK-NEXT: for (int j = 0; j < 10; ++j) |
141 | // CHECK-NEXT: foo(); |
142 | for (int i = 0; i < 10; ++i) |
143 | foo(); |
144 | // CHECK: for (int i = 0; i < 10; ++i) |
145 | // CHECK-NEXT: foo(); |
146 | #pragma omp target |
147 | #pragma omp teams distribute simd |
148 | for (int i = 0; i < 10; ++i) |
149 | foo(); |
150 | // CHECK: #pragma omp target |
151 | // CHECK-NEXT: #pragma omp teams distribute simd |
152 | // CHECK-NEXT: for (int i = 0; i < 10; ++i) |
153 | // CHECK-NEXT: foo(); |
154 | #pragma omp target |
155 | #pragma omp teams distribute simd default(none), private(b) firstprivate(argc) shared(d) reduction(+:c) reduction(max:e) num_teams(f) thread_limit(d) |
156 | for (int k = 0; k < 10; ++k) |
157 | e += d + argc; |
158 | // CHECK: #pragma omp target |
159 | // CHECK-NEXT: #pragma omp teams distribute simd default(none) private(b) firstprivate(argc) shared(d) reduction(+: c) reduction(max: e) num_teams(f) thread_limit(d) |
160 | // CHECK-NEXT: for (int k = 0; k < 10; ++k) |
161 | // CHECK-NEXT: e += d + argc; |
162 | #pragma omp target |
163 | #pragma omp teams distribute simd simdlen(clen-1) |
164 | for (int k = 0; k < 10; ++k) |
165 | e += d + argc; |
166 | // CHECK: #pragma omp target |
167 | // CHECK-NEXT: #pragma omp teams distribute simd simdlen(clen - 1) |
168 | // CHECK-NEXT: for (int k = 0; k < 10; ++k) |
169 | // CHECK-NEXT: e += d + argc; |
170 | #pragma omp target |
171 | #pragma omp teams distribute simd safelen(clen-1) aligned(arr:alen) |
172 | for (int k = 0; k < 10; ++k) |
173 | e += d + argc + arr[k]; |
174 | // CHECK: #pragma omp target |
175 | // CHECK-NEXT: #pragma omp teams distribute simd safelen(clen - 1) aligned(arr: alen) |
176 | // CHECK-NEXT: for (int k = 0; k < 10; ++k) |
177 | // CHECK-NEXT: e += d + argc + arr[k]; |
178 | return T(); |
179 | } |
180 | |
181 | int main (int argc, char **argv) { |
182 | int b = argc, c, d, e, f, g; |
183 | static int a; |
184 | // CHECK: static int a; |
185 | const int clen = 5; |
186 | const int N = 10; |
187 | int arr[10]; |
188 | #pragma omp target |
189 | #pragma omp teams distribute simd |
190 | for (int i=0; i < 2; ++i) |
191 | a = 2; |
192 | // CHECK: #pragma omp target |
193 | // CHECK-NEXT: #pragma omp teams distribute simd |
194 | // CHECK-NEXT: for (int i = 0; i < 2; ++i) |
195 | // CHECK-NEXT: a = 2; |
196 | #pragma omp target |
197 | #pragma omp teams distribute simd private(argc,b),firstprivate(argv, c), collapse(2) |
198 | for (int i = 0; i < 10; ++i) |
199 | for (int j = 0; j < 10; ++j) |
200 | foo(); |
201 | // CHECK: #pragma omp target |
202 | // CHECK-NEXT: #pragma omp teams distribute simd private(argc,b) firstprivate(argv,c) collapse(2) |
203 | // CHECK-NEXT: for (int i = 0; i < 10; ++i) |
204 | // CHECK-NEXT: for (int j = 0; j < 10; ++j) |
205 | // CHECK-NEXT: foo(); |
206 | for (int i = 0; i < 10; ++i) |
207 | foo(); |
208 | // CHECK: for (int i = 0; i < 10; ++i) |
209 | // CHECK-NEXT: foo(); |
210 | #pragma omp target |
211 | #pragma omp teams distribute simd |
212 | for (int i = 0; i < 10; ++i)foo(); |
213 | // CHECK: #pragma omp target |
214 | // CHECK-NEXT: #pragma omp teams distribute simd |
215 | // CHECK-NEXT: for (int i = 0; i < 10; ++i) |
216 | // CHECK-NEXT: foo(); |
217 | #pragma omp target |
218 | #pragma omp teams distribute simd default(none), private(b) firstprivate(argc) shared(d) reduction(+:c) reduction(max:e) num_teams(f) thread_limit(d) |
219 | for (int k = 0; k < 10; ++k) |
220 | e += d + argc; |
221 | // CHECK: #pragma omp target |
222 | // CHECK-NEXT: #pragma omp teams distribute simd default(none) private(b) firstprivate(argc) shared(d) reduction(+: c) reduction(max: e) num_teams(f) thread_limit(d) |
223 | // CHECK-NEXT: for (int k = 0; k < 10; ++k) |
224 | // CHECK-NEXT: e += d + argc; |
225 | #pragma omp target |
226 | #pragma omp teams distribute simd simdlen(clen-1) |
227 | for (int k = 0; k < 10; ++k) |
228 | e += d + argc; |
229 | // CHECK: #pragma omp target |
230 | // CHECK-NEXT: #pragma omp teams distribute simd simdlen(clen - 1) |
231 | // CHECK-NEXT: for (int k = 0; k < 10; ++k) |
232 | // CHECK-NEXT: e += d + argc; |
233 | #pragma omp target |
234 | #pragma omp teams distribute simd safelen(clen-1) aligned(arr:N+6) |
235 | for (int k = 0; k < 10; ++k) |
236 | e += d + argc + arr[k]; |
237 | // CHECK: #pragma omp target |
238 | // CHECK-NEXT: #pragma omp teams distribute simd safelen(clen - 1) aligned(arr: N + 6) |
239 | // CHECK-NEXT: for (int k = 0; k < 10; ++k) |
240 | // CHECK-NEXT: e += d + argc + arr[k]; |
241 | return (0); |
242 | } |
243 | |
244 | #endif |
245 | |