1*67e74705SXin Li // RUN: %clang_cc1 -verify -fopenmp -ast-print %s | FileCheck %s
2*67e74705SXin Li // RUN: %clang_cc1 -fopenmp -x c++ -std=c++11 -emit-pch -o %t %s
3*67e74705SXin Li // RUN: %clang_cc1 -fopenmp -std=c++11 -include-pch %t -fsyntax-only -verify %s -ast-print | FileCheck %s
4*67e74705SXin Li // expected-no-diagnostics
5*67e74705SXin Li
6*67e74705SXin Li #ifndef HEADER
7*67e74705SXin Li #define HEADER
8*67e74705SXin Li
foo()9*67e74705SXin Li void foo() {}
10*67e74705SXin Li
11*67e74705SXin Li template <class T, int N>
tmain(T argc)12*67e74705SXin Li T tmain(T argc) {
13*67e74705SXin Li T b = argc, c, d, e, f, g;
14*67e74705SXin Li static T a;
15*67e74705SXin Li // CHECK: static T a;
16*67e74705SXin Li #pragma omp taskloop if(taskloop: argc > N) default(shared) untied priority(N) grainsize(N)
17*67e74705SXin Li // CHECK-NEXT: #pragma omp taskloop if(taskloop: argc > N) default(shared) untied priority(N) grainsize(N)
18*67e74705SXin Li for (int i = 0; i < 2; ++i)
19*67e74705SXin Li a = 2;
20*67e74705SXin Li // CHECK-NEXT: for (int i = 0; i < 2; ++i)
21*67e74705SXin Li // CHECK-NEXT: a = 2;
22*67e74705SXin Li #pragma omp parallel
23*67e74705SXin Li #pragma omp taskloop private(argc, b), firstprivate(c, d), lastprivate(d, f) collapse(N) shared(g) if (c) final(d) mergeable priority(f) nogroup num_tasks(N)
24*67e74705SXin Li for (int i = 0; i < 2; ++i)
25*67e74705SXin Li for (int j = 0; j < 2; ++j)
26*67e74705SXin Li for (int j = 0; j < 2; ++j)
27*67e74705SXin Li for (int j = 0; j < 2; ++j)
28*67e74705SXin Li for (int j = 0; j < 2; ++j)
29*67e74705SXin Li for (int i = 0; i < 2; ++i)
30*67e74705SXin Li for (int j = 0; j < 2; ++j)
31*67e74705SXin Li for (int j = 0; j < 2; ++j)
32*67e74705SXin Li for (int j = 0; j < 2; ++j)
33*67e74705SXin Li for (int j = 0; j < 2; ++j)
34*67e74705SXin Li foo();
35*67e74705SXin Li // CHECK-NEXT: #pragma omp parallel
36*67e74705SXin Li // CHECK-NEXT: #pragma omp taskloop private(argc,b) firstprivate(c,d) lastprivate(d,f) collapse(N) shared(g) if(c) final(d) mergeable priority(f) nogroup num_tasks(N)
37*67e74705SXin Li // CHECK-NEXT: for (int i = 0; i < 2; ++i)
38*67e74705SXin Li // CHECK-NEXT: for (int j = 0; j < 2; ++j)
39*67e74705SXin Li // CHECK-NEXT: for (int j = 0; j < 2; ++j)
40*67e74705SXin Li // CHECK-NEXT: for (int j = 0; j < 2; ++j)
41*67e74705SXin Li // CHECK-NEXT: for (int j = 0; j < 2; ++j)
42*67e74705SXin Li // CHECK-NEXT: for (int i = 0; i < 2; ++i)
43*67e74705SXin Li // CHECK-NEXT: for (int j = 0; j < 2; ++j)
44*67e74705SXin Li // CHECK-NEXT: for (int j = 0; j < 2; ++j)
45*67e74705SXin Li // CHECK-NEXT: for (int j = 0; j < 2; ++j)
46*67e74705SXin Li // CHECK-NEXT: for (int j = 0; j < 2; ++j)
47*67e74705SXin Li // CHECK-NEXT: foo();
48*67e74705SXin Li return T();
49*67e74705SXin Li }
50*67e74705SXin Li
main(int argc,char ** argv)51*67e74705SXin Li int main(int argc, char **argv) {
52*67e74705SXin Li int b = argc, c, d, e, f, g;
53*67e74705SXin Li static int a;
54*67e74705SXin Li // CHECK: static int a;
55*67e74705SXin Li #pragma omp taskloop if(taskloop: a) default(none) shared(a) final(b) priority(5) nogroup num_tasks(argc)
56*67e74705SXin Li // CHECK-NEXT: #pragma omp taskloop if(taskloop: a) default(none) shared(a) final(b) priority(5) nogroup num_tasks(argc)
57*67e74705SXin Li for (int i = 0; i < 2; ++i)
58*67e74705SXin Li a = 2;
59*67e74705SXin Li // CHECK-NEXT: for (int i = 0; i < 2; ++i)
60*67e74705SXin Li // CHECK-NEXT: a = 2;
61*67e74705SXin Li #pragma omp parallel
62*67e74705SXin Li #pragma omp taskloop private(argc, b), firstprivate(argv, c), lastprivate(d, f) collapse(2) shared(g) if(argc) mergeable priority(argc) grainsize(argc)
63*67e74705SXin Li for (int i = 0; i < 10; ++i)
64*67e74705SXin Li for (int j = 0; j < 10; ++j)
65*67e74705SXin Li foo();
66*67e74705SXin Li // CHECK-NEXT: #pragma omp parallel
67*67e74705SXin Li // CHECK-NEXT: #pragma omp taskloop private(argc,b) firstprivate(argv,c) lastprivate(d,f) collapse(2) shared(g) if(argc) mergeable priority(argc) grainsize(argc)
68*67e74705SXin Li // CHECK-NEXT: for (int i = 0; i < 10; ++i)
69*67e74705SXin Li // CHECK-NEXT: for (int j = 0; j < 10; ++j)
70*67e74705SXin Li // CHECK-NEXT: foo();
71*67e74705SXin Li return (tmain<int, 5>(argc) + tmain<char, 1>(argv[0][0]));
72*67e74705SXin Li }
73*67e74705SXin Li
74*67e74705SXin Li #endif
75