blob: edb4b9a7ac0efd491d6b42ad56cfcd9a28993b25 [file] [log] [blame]
Alexey Bataevbef93a92019-10-07 18:54:57 +00001// RUN: %clang_cc1 -verify -fopenmp -fopenmp-version=50 -ast-print %s | FileCheck %s
2// RUN: %clang_cc1 -fopenmp -fopenmp-version=50 -x c++ -std=c++11 -emit-pch -o %t %s
3// RUN: %clang_cc1 -fopenmp -fopenmp-version=50 -std=c++11 -include-pch %t -fsyntax-only -verify %s -ast-print | FileCheck %s
Alexey Bataeva8a9153a2017-12-29 18:07:07 +00004
Alexey Bataevbef93a92019-10-07 18:54:57 +00005// RUN: %clang_cc1 -verify -fopenmp-simd -fopenmp-version=50 -ast-print %s | FileCheck %s
6// RUN: %clang_cc1 -fopenmp-simd -fopenmp-version=50 -x c++ -std=c++11 -emit-pch -o %t %s
7// RUN: %clang_cc1 -fopenmp-simd -fopenmp-version=50 -std=c++11 -include-pch %t -fsyntax-only -verify %s -ast-print | FileCheck %s
Alexey Bataevf29276e2014-06-18 04:14:57 +00008// expected-no-diagnostics
9
10#ifndef HEADER
11#define HEADER
12
13void foo() {}
14
Alexey Bataev48c0bfb2016-01-20 09:07:54 +000015struct S {
16 S(): a(0) {}
17 S(int v) : a(v) {}
18 int a;
19 typedef int type;
20};
21
22template <typename T>
23class S7 : public T {
24protected:
25 T a;
Alexey Bataev2bbf7212016-03-03 03:52:24 +000026 T &b;
27 typename T::type c:12;
28 typename T::type &d;
29 S7() : a(0), b(a), c(0), d(a.a) {}
Alexey Bataev48c0bfb2016-01-20 09:07:54 +000030
31public:
Alexey Bataev2bbf7212016-03-03 03:52:24 +000032 S7(typename T::type v) : a(v), b(a), c(v), d(a.a) {
Alexey Bataev48c0bfb2016-01-20 09:07:54 +000033#pragma omp for private(a) private(this->a) private(T::a)
34 for (int k = 0; k < a.a; ++k)
35 ++this->a.a;
Alexey Bataev74caaf22016-02-20 04:09:36 +000036#pragma omp for lastprivate(a) lastprivate(this->a) lastprivate(T::a)
37 for (int k = 0; k < a.a; ++k)
38 ++this->a.a;
Alexey Bataev2bbf7212016-03-03 03:52:24 +000039#pragma omp for linear(val(c))
40 for (int k = 0; k < a.a; ++k)
41 ++this->a.a;
Alexey Bataev48c0bfb2016-01-20 09:07:54 +000042 }
43 S7 &operator=(S7 &s) {
44#pragma omp for private(a) private(this->a)
45 for (int k = 0; k < s.a.a; ++k)
46 ++s.a.a;
Alexey Bataev74caaf22016-02-20 04:09:36 +000047#pragma omp for lastprivate(a) lastprivate(this->a)
48 for (int k = 0; k < s.a.a; ++k)
49 ++s.a.a;
Alexey Bataev2bbf7212016-03-03 03:52:24 +000050#pragma omp for linear(uval(this->b))
51 for (int k = 0; k < s.a.a; ++k)
52 ++s.a.a;
Alexey Bataev48c0bfb2016-01-20 09:07:54 +000053 return *this;
54 }
55};
56
Alexey Bataev48c0bfb2016-01-20 09:07:54 +000057// CHECK: #pragma omp for private(this->a) private(this->a) private(T::a)
Alexey Bataev74caaf22016-02-20 04:09:36 +000058// CHECK: #pragma omp for lastprivate(this->a) lastprivate(this->a) lastprivate(T::a)
Alexey Bataev2bbf7212016-03-03 03:52:24 +000059// CHECK: #pragma omp for linear(val(this->c))
Alexey Bataev48c0bfb2016-01-20 09:07:54 +000060// CHECK: #pragma omp for private(this->a) private(this->a)
Alexey Bataev74caaf22016-02-20 04:09:36 +000061// CHECK: #pragma omp for lastprivate(this->a) lastprivate(this->a)
Alexey Bataev2bbf7212016-03-03 03:52:24 +000062// CHECK: #pragma omp for linear(uval(this->b))
Serge Pavlova67a4d22016-11-10 08:49:37 +000063// CHECK: #pragma omp for private(this->a) private(this->a) private(this->S::a)
64// CHECK: #pragma omp for lastprivate(this->a) lastprivate(this->a) lastprivate(this->S::a)
65// CHECK: #pragma omp for linear(val(this->c))
Alexey Bataev48c0bfb2016-01-20 09:07:54 +000066
67class S8 : public S7<S> {
68 S8() {}
69
70public:
71 S8(int v) : S7<S>(v){
Alexey Bataev74caaf22016-02-20 04:09:36 +000072#pragma omp for private(a) private(this->a) private(S7<S>::a)
73 for (int k = 0; k < a.a; ++k)
74 ++this->a.a;
75#pragma omp for lastprivate(a) lastprivate(this->a) lastprivate(S7<S>::a)
Alexey Bataev48c0bfb2016-01-20 09:07:54 +000076 for (int k = 0; k < a.a; ++k)
77 ++this->a.a;
Alexey Bataev2bbf7212016-03-03 03:52:24 +000078#pragma omp for linear(ref(S7<S>::d))
79 for (int k = 0; k < a.a; ++k)
80 ++this->a.a;
Alexey Bataev48c0bfb2016-01-20 09:07:54 +000081 }
82 S8 &operator=(S8 &s) {
83#pragma omp for private(a) private(this->a)
84 for (int k = 0; k < s.a.a; ++k)
85 ++s.a.a;
Alexey Bataev74caaf22016-02-20 04:09:36 +000086#pragma omp for lastprivate(a) lastprivate(this->a)
87 for (int k = 0; k < s.a.a; ++k)
88 ++s.a.a;
Alexey Bataev2bbf7212016-03-03 03:52:24 +000089#pragma omp for linear(this->c)
90 for (int k = 0; k < s.a.a; ++k)
91 ++s.a.a;
Alexey Bataev48c0bfb2016-01-20 09:07:54 +000092 return *this;
93 }
94};
95
96// CHECK: #pragma omp for private(this->a) private(this->a) private(this->S7<S>::a)
Alexey Bataev74caaf22016-02-20 04:09:36 +000097// CHECK: #pragma omp for lastprivate(this->a) lastprivate(this->a) lastprivate(this->S7<S>::a)
Alexey Bataev2bbf7212016-03-03 03:52:24 +000098// CHECK: #pragma omp for linear(ref(this->S7<S>::d))
Alexey Bataev48c0bfb2016-01-20 09:07:54 +000099// CHECK: #pragma omp for private(this->a) private(this->a)
Alexey Bataev74caaf22016-02-20 04:09:36 +0000100// CHECK: #pragma omp for lastprivate(this->a) lastprivate(this->a)
Alexey Bataev2bbf7212016-03-03 03:52:24 +0000101// CHECK: #pragma omp for linear(this->c)
Alexey Bataev48c0bfb2016-01-20 09:07:54 +0000102
Alexey Bataevf29276e2014-06-18 04:14:57 +0000103template <class T, int N>
104T tmain(T argc) {
105 T b = argc, c, d, e, f, g;
Alexey Bataevbef93a92019-10-07 18:54:57 +0000106 T arr[N];
Alexey Bataevf29276e2014-06-18 04:14:57 +0000107 static T a;
108// CHECK: static T a;
Alexey Bataeve04483e2019-03-27 14:14:31 +0000109#pragma omp for schedule(dynamic) linear(a) allocate(a)
110 // CHECK-NEXT: #pragma omp for schedule(dynamic) linear(a) allocate(a)
Alexey Bataev7ff55242014-06-19 09:13:45 +0000111 for (int i = 0; i < 2; ++i)
112 a = 2;
Alexey Bataevf29276e2014-06-18 04:14:57 +0000113// CHECK-NEXT: for (int i = 0; i < 2; ++i)
114// CHECK-NEXT: a = 2;
115#pragma omp parallel
Alexey Bataeve04483e2019-03-27 14:14:31 +0000116#pragma omp for allocate(argc) private(argc, b), firstprivate(c, d), lastprivate(d, f) collapse(N) schedule(static, N) ordered(N) nowait
Alexey Bataevbef93a92019-10-07 18:54:57 +0000117 for (auto &x : arr)
Alexey Bataev54acd402015-08-04 11:18:19 +0000118 for (int i = 0; i < 2; ++i)
119 for (int j = 0; j < 2; ++j)
120 for (int j = 0; j < 2; ++j)
121 for (int j = 0; j < 2; ++j)
122 for (int j = 0; j < 2; ++j)
123 for (int i = 0; i < 2; ++i)
124 for (int j = 0; j < 2; ++j)
125 for (int j = 0; j < 2; ++j)
126 for (int j = 0; j < 2; ++j)
127 for (int j = 0; j < 2; ++j)
Alexey Bataeve2f07d42014-06-24 12:55:56 +0000128 foo();
Alexey Bataev7ff55242014-06-19 09:13:45 +0000129 // CHECK-NEXT: #pragma omp parallel
Alexey Bataeve04483e2019-03-27 14:14:31 +0000130 // CHECK-NEXT: #pragma omp for allocate(argc) private(argc,b) firstprivate(c,d) lastprivate(d,f) collapse(N) schedule(static, N) ordered(N) nowait
Alexey Bataevbef93a92019-10-07 18:54:57 +0000131 // CHECK-NEXT: for (auto &x : arr)
Alexey Bataev54acd402015-08-04 11:18:19 +0000132 // CHECK-NEXT: for (int i = 0; i < 2; ++i)
133 // CHECK-NEXT: for (int j = 0; j < 2; ++j)
134 // CHECK-NEXT: for (int j = 0; j < 2; ++j)
135 // CHECK-NEXT: for (int j = 0; j < 2; ++j)
136 // CHECK-NEXT: for (int j = 0; j < 2; ++j)
137 // CHECK-NEXT: for (int i = 0; i < 2; ++i)
138 // CHECK-NEXT: for (int j = 0; j < 2; ++j)
139 // CHECK-NEXT: for (int j = 0; j < 2; ++j)
140 // CHECK-NEXT: for (int j = 0; j < 2; ++j)
141 // CHECK-NEXT: for (int j = 0; j < 2; ++j)
Alexey Bataev7ff55242014-06-19 09:13:45 +0000142 // CHECK-NEXT: foo();
Alexey Bataevf29276e2014-06-18 04:14:57 +0000143 return T();
144}
145
146int main(int argc, char **argv) {
Serge Pavlova67a4d22016-11-10 08:49:37 +0000147// CHECK: int main(int argc, char **argv) {
Alexey Bataevf29276e2014-06-18 04:14:57 +0000148 int b = argc, c, d, e, f, g;
Alexey Bataevbef93a92019-10-07 18:54:57 +0000149 float arr[20];
Alexey Bataevf29276e2014-06-18 04:14:57 +0000150 static int a;
151// CHECK: static int a;
Alexey Bataevbc529672018-09-28 19:33:14 +0000152#pragma omp for schedule(guided, argc) reduction(+:argv[0][:1])
153 // CHECK-NEXT: #pragma omp for schedule(guided, argc) reduction(+: argv[0][:1])
Alexey Bataev7ff55242014-06-19 09:13:45 +0000154 for (int i = 0; i < 2; ++i)
155 a = 2;
Alexey Bataevf29276e2014-06-18 04:14:57 +0000156// CHECK-NEXT: for (int i = 0; i < 2; ++i)
157// CHECK-NEXT: a = 2;
158#pragma omp parallel
Alexey Bataevbef93a92019-10-07 18:54:57 +0000159#pragma omp for private(argc, b), firstprivate(argv, c), lastprivate(d, f) collapse(3) schedule(auto) ordered nowait linear(g:-1)
Alexey Bataevf29276e2014-06-18 04:14:57 +0000160 for (int i = 0; i < 10; ++i)
Alexey Bataev7ff55242014-06-19 09:13:45 +0000161 for (int j = 0; j < 10; ++j)
Alexey Bataevbef93a92019-10-07 18:54:57 +0000162 for (auto x : arr)
163 foo(), (void)x;
Alexey Bataev7ff55242014-06-19 09:13:45 +0000164 // CHECK-NEXT: #pragma omp parallel
Alexey Bataevbef93a92019-10-07 18:54:57 +0000165 // CHECK-NEXT: #pragma omp for private(argc,b) firstprivate(argv,c) lastprivate(d,f) collapse(3) schedule(auto) ordered nowait linear(g: -1)
Alexey Bataev7ff55242014-06-19 09:13:45 +0000166 // CHECK-NEXT: for (int i = 0; i < 10; ++i)
167 // CHECK-NEXT: for (int j = 0; j < 10; ++j)
Alexey Bataevbef93a92019-10-07 18:54:57 +0000168 // CHECK-NEXT: for (auto x : arr)
169 // CHECK-NEXT: foo() , (void)x;
Alexey Bataev11481f52016-02-17 10:29:05 +0000170 char buf[9] = "01234567";
171 char *p, *q;
172#pragma omp parallel
173#pragma omp for
174 for (p = buf; p < &buf[8]; p++)
175 for (q = &buf[0]; q <= buf + 7; q++)
176 foo();
177 // CHECK: #pragma omp parallel
Alexey Bataevcbecfdf2018-02-14 17:38:47 +0000178 // CHECK-NEXT: #pragma omp for{{$}}
Alexey Bataev11481f52016-02-17 10:29:05 +0000179 // CHECK-NEXT: for (p = buf; p < &buf[8]; p++)
180 // CHECK-NEXT: for (q = &buf[0]; q <= buf + 7; q++)
181 // CHECK-NEXT: foo();
Alexey Bataevf29276e2014-06-18 04:14:57 +0000182 return (tmain<int, 5>(argc) + tmain<char, 1>(argv[0][0]));
183}
184
185#endif