1 | // RUN: %clang_cc1 -verify -fopenmp -fopenmp-version=45 -ast-print %s | FileCheck %s |
2 | // RUN: %clang_cc1 -fopenmp -fopenmp-version=45 -x c++ -std=c++11 -emit-pch -o %t %s |
3 | // RUN: %clang_cc1 -fopenmp -fopenmp-version=45 -std=c++11 -include-pch %t -fsyntax-only -verify %s -ast-print | FileCheck %s |
4 | |
5 | // RUN: %clang_cc1 -verify -fopenmp-simd -fopenmp-version=45 -ast-print %s | FileCheck %s |
6 | // RUN: %clang_cc1 -fopenmp-simd -fopenmp-version=45 -x c++ -std=c++11 -emit-pch -o %t %s |
7 | // RUN: %clang_cc1 -fopenmp-simd -fopenmp-version=45 -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 | S7() : a(0) {} |
27 | |
28 | public: |
29 | S7(typename T::type v) : a(v) { |
30 | #pragma omp parallel for private(a) private(this->a) private(T::a) |
31 | for (int k = 0; k < a.a; ++k) |
32 | ++this->a.a; |
33 | } |
34 | S7 &operator=(S7 &s) { |
35 | #pragma omp parallel for private(a) private(this->a) |
36 | for (int k = 0; k < s.a.a; ++k) |
37 | ++s.a.a; |
38 | return *this; |
39 | } |
40 | }; |
41 | |
42 | // CHECK: #pragma omp parallel for private(this->a) private(this->a) private(T::a){{$}} |
43 | // CHECK: #pragma omp parallel for private(this->a) private(this->a) |
44 | // CHECK: #pragma omp parallel for private(this->a) private(this->a) private(this->S::a) |
45 | |
46 | class S8 : public S7<S> { |
47 | S8() {} |
48 | |
49 | public: |
50 | S8(int v) : S7<S>(v){ |
51 | #pragma omp parallel for private(a) private(this->a) private(S7<S>::a) |
52 | for (int k = 0; k < a.a; ++k) |
53 | ++this->a.a; |
54 | } |
55 | S8 &operator=(S8 &s) { |
56 | #pragma omp parallel for private(a) private(this->a) |
57 | for (int k = 0; k < s.a.a; ++k) |
58 | ++s.a.a; |
59 | return *this; |
60 | } |
61 | }; |
62 | |
63 | // CHECK: #pragma omp parallel for private(this->a) private(this->a) private(this->S7<S>::a) |
64 | // CHECK: #pragma omp parallel for private(this->a) private(this->a) |
65 | |
66 | template <class T, int N> |
67 | T tmain(T argc) { |
68 | T b = argc, c, d, e, f, h; |
69 | static T a; |
70 | // CHECK: static T a; |
71 | static T g; |
72 | #pragma omp threadprivate(g) |
73 | #pragma omp parallel for schedule(dynamic) default(none) copyin(g) linear(a) allocate(a) |
74 | // CHECK: #pragma omp parallel for schedule(dynamic) default(none) copyin(g) linear(a) allocate(a) |
75 | for (int i = 0; i < 2; ++i) |
76 | a = 2; |
77 | // CHECK-NEXT: for (int i = 0; i < 2; ++i) |
78 | // CHECK-NEXT: a = 2; |
79 | #pragma omp parallel for allocate(argc) private(argc, b), firstprivate(c, d), lastprivate(d, f) collapse(N) schedule(static, N) ordered(N) if (parallel :argc) num_threads(N) default(shared) shared(e) reduction(+ : h) |
80 | for (int i = 0; i < 2; ++i) |
81 | for (int j = 0; j < 2; ++j) |
82 | for (int j = 0; j < 2; ++j) |
83 | for (int j = 0; j < 2; ++j) |
84 | for (int j = 0; j < 2; ++j) |
85 | for (int i = 0; i < 2; ++i) |
86 | for (int j = 0; j < 2; ++j) |
87 | for (int j = 0; j < 2; ++j) |
88 | for (int j = 0; j < 2; ++j) |
89 | for (int j = 0; j < 2; ++j) |
90 | foo(); |
91 | // CHECK-NEXT: #pragma omp parallel for allocate(argc) private(argc,b) firstprivate(c,d) lastprivate(d,f) collapse(N) schedule(static, N) ordered(N) if(parallel: argc) num_threads(N) default(shared) shared(e) reduction(+: h) |
92 | // CHECK-NEXT: for (int i = 0; i < 2; ++i) |
93 | // CHECK-NEXT: for (int j = 0; j < 2; ++j) |
94 | // CHECK-NEXT: for (int j = 0; j < 2; ++j) |
95 | // CHECK-NEXT: for (int j = 0; j < 2; ++j) |
96 | // CHECK-NEXT: for (int j = 0; j < 2; ++j) |
97 | // CHECK-NEXT: for (int i = 0; i < 2; ++i) |
98 | // CHECK-NEXT: for (int j = 0; j < 2; ++j) |
99 | // CHECK-NEXT: for (int j = 0; j < 2; ++j) |
100 | // CHECK-NEXT: for (int j = 0; j < 2; ++j) |
101 | // CHECK-NEXT: for (int j = 0; j < 2; ++j) |
102 | // CHECK-NEXT: foo(); |
103 | return T(); |
104 | } |
105 | |
106 | int increment () { |
107 | #pragma omp for |
108 | for (int i = 5 ; i != 0; ++i) |
109 | ; |
110 | // CHECK: int increment() { |
111 | // CHECK-NEXT: #pragma omp for |
112 | // CHECK-NEXT: for (int i = 5; i != 0; ++i) |
113 | // CHECK-NEXT: ; |
114 | return 0; |
115 | } |
116 | |
117 | int decrement_nowait () { |
118 | #pragma omp for nowait |
119 | for (int j = 5 ; j != 0; --j) |
120 | ; |
121 | // CHECK: int decrement_nowait() { |
122 | // CHECK-NEXT: #pragma omp for nowait |
123 | // CHECK-NEXT: for (int j = 5; j != 0; --j) |
124 | // CHECK-NEXT: ; |
125 | return 0; |
126 | } |
127 | |
128 | |
129 | int main(int argc, char **argv) { |
130 | int b = argc, c, d, e, f, h; |
131 | static int a; |
132 | // CHECK: static int a; |
133 | static float g; |
134 | #pragma omp threadprivate(g) |
135 | #pragma omp parallel for schedule(guided, argc) default(none) copyin(g) linear(a) |
136 | // CHECK: #pragma omp parallel for schedule(guided, argc) default(none) copyin(g) linear(a) |
137 | for (int i = 0; i < 2; ++i) |
138 | a = 2; |
139 | // CHECK-NEXT: for (int i = 0; i < 2; ++i) |
140 | // CHECK-NEXT: a = 2; |
141 | #pragma omp parallel for private(argc, b), firstprivate(argv, c), lastprivate(d, f) collapse(2) schedule(auto) ordered if (argc) num_threads(a) default(shared) shared(e) reduction(+ : h) linear(a:-5) |
142 | for (int i = 0; i < 10; ++i) |
143 | for (int j = 0; j < 10; ++j) |
144 | foo(); |
145 | // CHECK-NEXT: #pragma omp parallel for private(argc,b) firstprivate(argv,c) lastprivate(d,f) collapse(2) schedule(auto) ordered if(argc) num_threads(a) default(shared) shared(e) reduction(+: h) linear(a: -5) |
146 | // CHECK-NEXT: for (int i = 0; i < 10; ++i) |
147 | // CHECK-NEXT: for (int j = 0; j < 10; ++j) |
148 | // CHECK-NEXT: foo(); |
149 | return (tmain<int, 5>(argc) + tmain<char, 1>(argv[0][0])); |
150 | } |
151 | |
152 | #endif |
153 | |