blob: 1af391d2cf61d14e772eb2c88369463522922327 [file] [log] [blame]
Alexey Bataevdb390212015-05-20 04:24:19 +00001// RUN: %clang_cc1 -verify -fopenmp -ast-print %s | 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 | FileCheck %s
Alexey Bataevf29276e2014-06-18 04:14:57 +00004// expected-no-diagnostics
5
6#ifndef HEADER
7#define HEADER
8
9void foo() {}
10
11template <class T, int N>
12T tmain(T argc) {
13 T b = argc, c, d, e, f, g;
14 static T a;
15// CHECK: static T a;
Alexey Bataev54acd402015-08-04 11:18:19 +000016#pragma omp for schedule(dynamic) linear(a)
17 // CHECK-NEXT: #pragma omp for schedule(dynamic) linear(a)
Alexey Bataev7ff55242014-06-19 09:13:45 +000018 for (int i = 0; i < 2; ++i)
19 a = 2;
Alexey Bataevf29276e2014-06-18 04:14:57 +000020// CHECK-NEXT: for (int i = 0; i < 2; ++i)
21// CHECK-NEXT: a = 2;
22#pragma omp parallel
Alexey Bataev54acd402015-08-04 11:18:19 +000023#pragma omp for private(argc, b), firstprivate(c, d), lastprivate(d, f) collapse(N) schedule(static, N) ordered(N) nowait linear(a : N)
24 for (int i = 0; i < 2; ++i)
25 for (int j = 0; j < 2; ++j)
26 for (int j = 0; j < 2; ++j)
27 for (int j = 0; j < 2; ++j)
28 for (int j = 0; j < 2; ++j)
29 for (int i = 0; i < 2; ++i)
30 for (int j = 0; j < 2; ++j)
31 for (int j = 0; j < 2; ++j)
32 for (int j = 0; j < 2; ++j)
33 for (int j = 0; j < 2; ++j)
Alexey Bataeve2f07d42014-06-24 12:55:56 +000034 foo();
Alexey Bataev7ff55242014-06-19 09:13:45 +000035 // CHECK-NEXT: #pragma omp parallel
Alexey Bataev54acd402015-08-04 11:18:19 +000036 // CHECK-NEXT: #pragma omp for private(argc,b) firstprivate(c,d) lastprivate(d,f) collapse(N) schedule(static, N) ordered(N) nowait linear(a: N)
37 // CHECK-NEXT: for (int i = 0; i < 2; ++i)
38 // CHECK-NEXT: for (int j = 0; j < 2; ++j)
39 // CHECK-NEXT: for (int j = 0; j < 2; ++j)
40 // CHECK-NEXT: for (int j = 0; j < 2; ++j)
41 // CHECK-NEXT: for (int j = 0; j < 2; ++j)
42 // CHECK-NEXT: for (int i = 0; i < 2; ++i)
43 // CHECK-NEXT: for (int j = 0; j < 2; ++j)
44 // CHECK-NEXT: for (int j = 0; j < 2; ++j)
45 // CHECK-NEXT: for (int j = 0; j < 2; ++j)
46 // CHECK-NEXT: for (int j = 0; j < 2; ++j)
Alexey Bataev7ff55242014-06-19 09:13:45 +000047 // CHECK-NEXT: foo();
Alexey Bataevf29276e2014-06-18 04:14:57 +000048 return T();
49}
50
51int main(int argc, char **argv) {
52 int b = argc, c, d, e, f, g;
53 static int a;
54// CHECK: static int a;
Alexey Bataev56dafe82014-06-20 07:16:17 +000055#pragma omp for schedule(guided, argc)
56 // CHECK-NEXT: #pragma omp for schedule(guided, argc)
Alexey Bataev7ff55242014-06-19 09:13:45 +000057 for (int i = 0; i < 2; ++i)
58 a = 2;
Alexey Bataevf29276e2014-06-18 04:14:57 +000059// CHECK-NEXT: for (int i = 0; i < 2; ++i)
60// CHECK-NEXT: a = 2;
61#pragma omp parallel
Alexey Bataev54acd402015-08-04 11:18:19 +000062#pragma omp for private(argc, b), firstprivate(argv, c), lastprivate(d, f) collapse(2) schedule(auto) ordered nowait linear(g:-1)
Alexey Bataevf29276e2014-06-18 04:14:57 +000063 for (int i = 0; i < 10; ++i)
Alexey Bataev7ff55242014-06-19 09:13:45 +000064 for (int j = 0; j < 10; ++j)
65 foo();
66 // CHECK-NEXT: #pragma omp parallel
Alexey Bataev54acd402015-08-04 11:18:19 +000067 // CHECK-NEXT: #pragma omp for private(argc,b) firstprivate(argv,c) lastprivate(d,f) collapse(2) schedule(auto) ordered nowait linear(g: -1)
Alexey Bataev7ff55242014-06-19 09:13:45 +000068 // CHECK-NEXT: for (int i = 0; i < 10; ++i)
69 // CHECK-NEXT: for (int j = 0; j < 10; ++j)
70 // CHECK-NEXT: foo();
Alexey Bataevf29276e2014-06-18 04:14:57 +000071 return (tmain<int, 5>(argc) + tmain<char, 1>(argv[0][0]));
72}
73
74#endif