forked from OSchip/llvm-project
				
			
		
			
				
	
	
		
			95 lines
		
	
	
		
			5.5 KiB
		
	
	
	
		
			C++
		
	
	
	
			
		
		
	
	
			95 lines
		
	
	
		
			5.5 KiB
		
	
	
	
		
			C++
		
	
	
	
| // RUN: %clang_cc1 -verify -fopenmp -fopenmp-version=45 -ast-print %s | FileCheck %s --check-prefix CHECK --check-prefix OMP45
 | |
| // RUN: %clang_cc1 -fopenmp -fopenmp-version=45 -x c++ -std=c++11 -emit-pch -o %t %s
 | |
| // RUN: %clang_cc1 -fopenmp -fopenmp-version=45 -std=c++11 -include-pch %t -fsyntax-only -verify %s -ast-print | FileCheck %s --check-prefix CHECK --check-prefix OMP45
 | |
| // RUN: %clang_cc1 -verify -fopenmp -fopenmp-version=50 -ast-print %s -DOMP5 | FileCheck %s --check-prefix CHECK --check-prefix OMP50
 | |
| // RUN: %clang_cc1 -fopenmp -fopenmp-version=50 -x c++ -std=c++11 -emit-pch -o %t %s -DOMP5
 | |
| // RUN: %clang_cc1 -fopenmp -fopenmp-version=50 -std=c++11 -include-pch %t -fsyntax-only -verify %s -ast-print -DOMP5 | FileCheck %s --check-prefix CHECK --check-prefix OMP50
 | |
| 
 | |
| // RUN: %clang_cc1 -verify -fopenmp-simd -fopenmp-version=45 -ast-print %s | FileCheck %s --check-prefix CHECK --check-prefix OMP45
 | |
| // RUN: %clang_cc1 -fopenmp-simd -fopenmp-version=45 -x c++ -std=c++11 -emit-pch -o %t %s
 | |
| // RUN: %clang_cc1 -fopenmp-simd -fopenmp-version=45 -std=c++11 -include-pch %t -fsyntax-only -verify %s -ast-print | FileCheck %s --check-prefix CHECK --check-prefix OMP45
 | |
| // RUN: %clang_cc1 -verify -fopenmp-simd -fopenmp-version=50 -ast-print %s -DOMP5 | FileCheck %s --check-prefix CHECK --check-prefix OMP50
 | |
| // RUN: %clang_cc1 -fopenmp-simd -fopenmp-version=50 -x c++ -std=c++11 -emit-pch -o %t %s -DOMP5
 | |
| // RUN: %clang_cc1 -fopenmp-simd -fopenmp-version=50 -std=c++11 -include-pch %t -fsyntax-only -verify %s -ast-print -DOMP5 | FileCheck %s --check-prefix CHECK --check-prefix OMP50
 | |
| // 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 taskgroup allocate(d) task_reduction(+: d)
 | |
| #pragma omp parallel master taskloop simd if(taskloop: argc > N) default(shared) untied priority(N) grainsize(N) reduction(+:g) allocate(g) simdlen(8)
 | |
|   // CHECK-NEXT: #pragma omp taskgroup allocate(d) task_reduction(+: d)
 | |
|   // CHECK-NEXT: #pragma omp parallel master taskloop simd if(taskloop: argc > N) default(shared) untied priority(N) grainsize(N) reduction(+: g) allocate(g) simdlen(8){{$}}
 | |
|   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 parallel master taskloop simd private(argc, b), firstprivate(c, d), lastprivate(d, f) collapse(N) shared(g) if (c) final(d) mergeable priority(f) nogroup num_tasks(N) safelen(8)
 | |
|   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 parallel master taskloop simd private(argc,b) firstprivate(c,d) lastprivate(d,f) collapse(N) shared(g) if(c) final(d) mergeable priority(f) nogroup num_tasks(N) safelen(8)
 | |
|   // 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();
 | |
| }
 | |
| 
 | |
| // CHECK-LABEL: int main(int argc, char **argv) {
 | |
| int main(int argc, char **argv) {
 | |
|   int b = argc, c, d, e, f, g, h;
 | |
|   static int a;
 | |
| // CHECK: static int a;
 | |
| #pragma omp taskgroup task_reduction(+: d)
 | |
| #pragma omp parallel master taskloop simd if(parallel: a) default(none) shared(a, b, argc) final(b) priority(5) num_tasks(argc) reduction(*: g) aligned(argv: 8) linear(c:b)
 | |
|   // CHECK-NEXT: #pragma omp taskgroup task_reduction(+: d)
 | |
|   // CHECK-NEXT: #pragma omp parallel master taskloop simd if(parallel: a) default(none) shared(a,b,argc) final(b) priority(5) num_tasks(argc) reduction(*: g) aligned(argv: 8) linear(c: b)
 | |
|   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
 | |
| #ifdef OMP5
 | |
| #pragma omp parallel master taskloop simd private(argc, b), firstprivate(argv, c), lastprivate(d, f) collapse(2) shared(g) if(simd:argc) mergeable priority(argc) grainsize(argc) reduction(max: a, e) nontemporal(argc, c, d) order(concurrent)
 | |
| #else
 | |
| #pragma omp parallel master taskloop simd private(argc, b), firstprivate(argv, c), lastprivate(d, f) collapse(2) shared(g) if(argc) mergeable priority(argc) grainsize(argc) reduction(max: a, e)
 | |
| #endif // OMP5
 | |
|   for (int i = 0; i < 10; ++i)
 | |
|     for (int j = 0; j < 10; ++j)
 | |
|       foo();
 | |
|   // CHECK-NEXT: #pragma omp parallel
 | |
|   // OMP45-NEXT: #pragma omp parallel master taskloop simd private(argc,b) firstprivate(argv,c) lastprivate(d,f) collapse(2) shared(g) if(argc) mergeable priority(argc) grainsize(argc) reduction(max: a,e)
 | |
|   // OMP50-NEXT: #pragma omp parallel master taskloop simd private(argc,b) firstprivate(argv,c) lastprivate(d,f) collapse(2) shared(g) if(simd: argc) mergeable priority(argc) grainsize(argc) reduction(max: a,e) nontemporal(argc,c,d) order(concurrent)
 | |
|   // 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
 |