You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
75 lines
3.0 KiB
75 lines
3.0 KiB
4 months ago
|
// RUN: %clang_cc1 -verify -fopenmp -ast-print %s | FileCheck %s
|
||
|
|
// RUN: %clang_cc1 -fopenmp -x c++ -std=c++11 -emit-pch -o %t %s
|
||
|
|
// RUN: %clang_cc1 -fopenmp -std=c++11 -include-pch %t -fsyntax-only -verify %s -ast-print | FileCheck %s
|
||
|
|
// expected-no-diagnostics
|
||
|
|
|
||
|
|
#ifndef HEADER
|
||
|
|
#define HEADER
|
||
|
|
|
||
|
|
void foo() {}
|
||
|
|
|
||
|
|
template <class T, int N>
|
||
|
|
T tmain(T argc) {
|
||
|
|
T b = argc, c, d, e, f, g;
|
||
|
|
static T a;
|
||
|
|
// CHECK: static T a;
|
||
|
|
#pragma omp taskloop if(taskloop: argc > N) default(shared) untied priority(N) grainsize(N)
|
||
|
|
// CHECK-NEXT: #pragma omp taskloop if(taskloop: argc > N) default(shared) untied priority(N) grainsize(N)
|
||
|
|
for (int i = 0; i < 2; ++i)
|
||
|
|
a = 2;
|
||
|
|
// CHECK-NEXT: for (int i = 0; i < 2; ++i)
|
||
|
|
// CHECK-NEXT: a = 2;
|
||
|
|
#pragma omp parallel
|
||
|
|
#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)
|
||
|
|
for (int i = 0; i < 2; ++i)
|
||
|
|
for (int j = 0; j < 2; ++j)
|
||
|
|
for (int j = 0; j < 2; ++j)
|
||
|
|
for (int j = 0; j < 2; ++j)
|
||
|
|
for (int j = 0; j < 2; ++j)
|
||
|
|
for (int i = 0; i < 2; ++i)
|
||
|
|
for (int j = 0; j < 2; ++j)
|
||
|
|
for (int j = 0; j < 2; ++j)
|
||
|
|
for (int j = 0; j < 2; ++j)
|
||
|
|
for (int j = 0; j < 2; ++j)
|
||
|
|
foo();
|
||
|
|
// CHECK-NEXT: #pragma omp parallel
|
||
|
|
// 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)
|
||
|
|
// CHECK-NEXT: for (int i = 0; i < 2; ++i)
|
||
|
|
// CHECK-NEXT: for (int j = 0; j < 2; ++j)
|
||
|
|
// CHECK-NEXT: for (int j = 0; j < 2; ++j)
|
||
|
|
// CHECK-NEXT: for (int j = 0; j < 2; ++j)
|
||
|
|
// CHECK-NEXT: for (int j = 0; j < 2; ++j)
|
||
|
|
// CHECK-NEXT: for (int i = 0; i < 2; ++i)
|
||
|
|
// CHECK-NEXT: for (int j = 0; j < 2; ++j)
|
||
|
|
// CHECK-NEXT: for (int j = 0; j < 2; ++j)
|
||
|
|
// CHECK-NEXT: for (int j = 0; j < 2; ++j)
|
||
|
|
// CHECK-NEXT: for (int j = 0; j < 2; ++j)
|
||
|
|
// CHECK-NEXT: foo();
|
||
|
|
return T();
|
||
|
|
}
|
||
|
|
|
||
|
|
int main(int argc, char **argv) {
|
||
|
|
int b = argc, c, d, e, f, g;
|
||
|
|
static int a;
|
||
|
|
// CHECK: static int a;
|
||
|
|
#pragma omp taskloop if(taskloop: a) default(none) shared(a) final(b) priority(5) nogroup num_tasks(argc)
|
||
|
|
// CHECK-NEXT: #pragma omp taskloop if(taskloop: a) default(none) shared(a) final(b) priority(5) nogroup num_tasks(argc)
|
||
|
|
for (int i = 0; i < 2; ++i)
|
||
|
|
a = 2;
|
||
|
|
// CHECK-NEXT: for (int i = 0; i < 2; ++i)
|
||
|
|
// CHECK-NEXT: a = 2;
|
||
|
|
#pragma omp parallel
|
||
|
|
#pragma omp taskloop private(argc, b), firstprivate(argv, c), lastprivate(d, f) collapse(2) shared(g) if(argc) mergeable priority(argc) grainsize(argc)
|
||
|
|
for (int i = 0; i < 10; ++i)
|
||
|
|
for (int j = 0; j < 10; ++j)
|
||
|
|
foo();
|
||
|
|
// CHECK-NEXT: #pragma omp parallel
|
||
|
|
// 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)
|
||
|
|
// CHECK-NEXT: for (int i = 0; i < 10; ++i)
|
||
|
|
// CHECK-NEXT: for (int j = 0; j < 10; ++j)
|
||
|
|
// CHECK-NEXT: foo();
|
||
|
|
return (tmain<int, 5>(argc) + tmain<char, 1>(argv[0][0]));
|
||
|
|
}
|
||
|
|
|
||
|
|
#endif
|