1 // 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
4 
5 // 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
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   T &b;
27   typename T::type c:12;
28   typename T::type &d;
29   S7() : a(0), b(a), c(0), d(a.a) {}
30 
31 public:
32   S7(typename T::type v) : a(v), b(a), c(v), d(a.a) {
33 #pragma omp for private(a) private(this->a) private(T::a)
34     for (int k = 0; k < a.a; ++k)
35       ++this->a.a;
36 #pragma omp for lastprivate(a) lastprivate(this->a) lastprivate(T::a)
37     for (int k = 0; k < a.a; ++k)
38       ++this->a.a;
39 #pragma omp for linear(val(c))
40     for (int k = 0; k < a.a; ++k)
41       ++this->a.a;
42   }
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;
47 #pragma omp for lastprivate(a) lastprivate(this->a)
48     for (int k = 0; k < s.a.a; ++k)
49       ++s.a.a;
50 #pragma omp for linear(uval(this->b))
51     for (int k = 0; k < s.a.a; ++k)
52       ++s.a.a;
53     return *this;
54   }
55 };
56 
57 // CHECK: #pragma omp for private(this->a) private(this->a) private(T::a)
58 // CHECK: #pragma omp for lastprivate(this->a) lastprivate(this->a) lastprivate(T::a)
59 // CHECK: #pragma omp for linear(val(this->c))
60 // CHECK: #pragma omp for private(this->a) private(this->a)
61 // CHECK: #pragma omp for lastprivate(this->a) lastprivate(this->a)
62 // CHECK: #pragma omp for linear(uval(this->b))
63 // 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))
66 
67 class S8 : public S7<S> {
68   S8() {}
69 
70 public:
71   S8(int v) : S7<S>(v){
72 #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)
76     for (int k = 0; k < a.a; ++k)
77       ++this->a.a;
78 #pragma omp for linear(ref(S7<S>::d))
79     for (int k = 0; k < a.a; ++k)
80       ++this->a.a;
81   }
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;
86 #pragma omp for lastprivate(a) lastprivate(this->a)
87     for (int k = 0; k < s.a.a; ++k)
88       ++s.a.a;
89 #pragma omp for linear(this->c)
90     for (int k = 0; k < s.a.a; ++k)
91       ++s.a.a;
92     return *this;
93   }
94 };
95 
96 // CHECK: #pragma omp for private(this->a) private(this->a) private(this->S7<S>::a)
97 // CHECK: #pragma omp for lastprivate(this->a) lastprivate(this->a) lastprivate(this->S7<S>::a)
98 // CHECK: #pragma omp for linear(ref(this->S7<S>::d))
99 // CHECK: #pragma omp for private(this->a) private(this->a)
100 // CHECK: #pragma omp for lastprivate(this->a) lastprivate(this->a)
101 // CHECK: #pragma omp for linear(this->c)
102 
103 template <class T, int N>
104 T tmain(T argc) {
105   T b = argc, c, d, e, f, g;
106   T arr[N];
107   static T a;
108 // CHECK: static T a;
109 #pragma omp for schedule(dynamic) linear(a) allocate(a)
110   // CHECK-NEXT: #pragma omp for schedule(dynamic) linear(a) allocate(a)
111   for (int i = 0; i < 2; ++i)
112     a = 2;
113 // CHECK-NEXT: for (int i = 0; i < 2; ++i)
114 // CHECK-NEXT: a = 2;
115 #pragma omp parallel
116 #pragma omp for allocate(argc) private(argc, b), firstprivate(c, d), lastprivate(d, f) collapse(N) schedule(static, N) ordered(N) nowait
117   for (auto &x : arr) {
118     int j, hhh = 0;
119     for (int i = 0; i < 2; ++i) {
120       int j, hhh = 0;
121       for (int j = 0; j < 2; ++j)
122         for (int j = 0; j < 2; ++j)
123           for (int j = 0; j < 2; ++j)
124             for (int j = 0; j < 2; ++j)
125               for (int i = 0; i < 2; ++i)
126                 for (int j = 0; j < 2; ++j)
127                   for (int j = 0; j < 2; ++j)
128                     for (int j = 0; j < 2; ++j)
129                       for (int j = 0; j < 2; ++j)
130                         foo();
131       ++hhh;
132     }
133     ++hhh;
134   }
135   // CHECK-NEXT: #pragma omp parallel
136   // CHECK-NEXT: #pragma omp for allocate(argc) private(argc,b) firstprivate(c,d) lastprivate(d,f) collapse(N) schedule(static, N) ordered(N) nowait
137   // CHECK-NEXT: for (auto &x : arr) {
138   // CHECK-NEXT: int j, hhh = 0;
139   // CHECK-NEXT: for (int i = 0; i < 2; ++i) {
140   // CHECK-NEXT: int j, hhh = 0;
141   // CHECK-NEXT: for (int j = 0; j < 2; ++j)
142   // CHECK-NEXT: for (int j = 0; j < 2; ++j)
143   // CHECK-NEXT: for (int j = 0; j < 2; ++j)
144   // CHECK-NEXT: for (int j = 0; j < 2; ++j)
145   // CHECK-NEXT: for (int i = 0; i < 2; ++i)
146   // CHECK-NEXT: for (int j = 0; j < 2; ++j)
147   // CHECK-NEXT: for (int j = 0; j < 2; ++j)
148   // CHECK-NEXT: for (int j = 0; j < 2; ++j)
149   // CHECK-NEXT: for (int j = 0; j < 2; ++j)
150   // CHECK-NEXT: foo();
151   // CHECK-NEXT: ++hhh;
152   // CHECK-NEXT: }
153   // CHECK-NEXT: ++hhh;
154   // CHECK-NEXT: }
155   return T();
156 }
157 
158 int main(int argc, char **argv) {
159 // CHECK: int main(int argc, char **argv) {
160   int b = argc, c, d, e, f, g;
161   float arr[20];
162   static int a;
163 // CHECK: static int a;
164 #pragma omp for schedule(guided, argc) reduction(+:argv[0][:1]) order(concurrent)
165   // CHECK-NEXT: #pragma omp for schedule(guided, argc) reduction(+: argv[0][:1]) order(concurrent)
166   for (int i = 0; i < 2; ++i)
167     a = 2;
168 // CHECK-NEXT: for (int i = 0; i < 2; ++i)
169 // CHECK-NEXT: a = 2;
170 #pragma omp parallel
171 #pragma omp for private(argc, b), firstprivate(argv, c), lastprivate(d, f) collapse(3) schedule(auto) ordered nowait linear(g:-1)
172   for (int i = 0; i < 10; ++i)
173     for (int j = 0; j < 10; ++j)
174       for (auto x : arr)
175         foo(), (void)x;
176   // CHECK-NEXT: #pragma omp parallel
177   // CHECK-NEXT: #pragma omp for private(argc,b) firstprivate(argv,c) lastprivate(d,f) collapse(3) schedule(auto) ordered nowait linear(g: -1)
178   // CHECK-NEXT: for (int i = 0; i < 10; ++i)
179   // CHECK-NEXT: for (int j = 0; j < 10; ++j)
180   // CHECK-NEXT: for (auto x : arr)
181   // CHECK-NEXT: foo() , (void)x;
182   char buf[9] = "01234567";
183   char *p, *q;
184 #pragma omp parallel
185 #pragma omp for
186   for (p = buf; p < &buf[8]; p++)
187     for (q = &buf[0]; q <= buf + 7; q++)
188       foo();
189   // CHECK: #pragma omp parallel
190   // CHECK-NEXT: #pragma omp for{{$}}
191   // CHECK-NEXT: for (p = buf; p < &buf[8]; p++)
192   // CHECK-NEXT: for (q = &buf[0]; q <= buf + 7; q++)
193   // CHECK-NEXT: foo();
194   return (tmain<int, 5>(argc) + tmain<char, 1>(argv[0][0]));
195 }
196 
197 #endif
198