brintos

brintos / llvm-project-archived public Read only

0
0
Text · 4.1 KiB · a35fd03 Raw
94 lines · cpp
1// RUN: %clang_cc1 -verify -fopenmp -ast-print %s | FileCheck %s2// RUN: %clang_cc1 -fopenmp -x c++ -std=c++11 -emit-pch -o %t %s3// RUN: %clang_cc1 -fopenmp -std=c++11 -include-pch %t -verify %s -ast-print | FileCheck %s4 5// RUN: %clang_cc1 -verify -fopenmp-simd -ast-print %s | FileCheck %s6// RUN: %clang_cc1 -fopenmp-simd -x c++ -std=c++11 -emit-pch -o %t %s7// RUN: %clang_cc1 -fopenmp-simd -std=c++11 -include-pch %t -verify %s -ast-print | FileCheck %s8// expected-no-diagnostics9 10#ifndef HEADER11#define HEADER12 13void foo() {}14 15template <class T, int N>16T tmain(T argc) {17  T b = argc, c, d, e, f, g;18  static T a;19// CHECK: static T a;20#pragma omp taskgroup allocate(d) task_reduction(+: d)21#pragma omp master taskloop if(taskloop: argc > N) default(shared) untied priority(N) grainsize(N) reduction(+:g) in_reduction(+: d) allocate(d)22  // CHECK-NEXT: #pragma omp taskgroup allocate(d) task_reduction(+: d)23  // CHECK-NEXT: #pragma omp master taskloop if(taskloop: argc > N) default(shared) untied priority(N) grainsize(N) reduction(+: g) in_reduction(+: d) allocate(d){{$}}24  for (int i = 0; i < 2; ++i)25    a = 2;26// CHECK-NEXT: for (int i = 0; i < 2; ++i)27// CHECK-NEXT: a = 2;28#pragma omp parallel29#pragma omp master 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)30  for (int i = 0; i < 2; ++i)31    for (int j = 0; j < 2; ++j)32      for (int j = 0; j < 2; ++j)33        for (int j = 0; j < 2; ++j)34          for (int j = 0; j < 2; ++j)35  for (int i = 0; i < 2; ++i)36    for (int j = 0; j < 2; ++j)37      for (int j = 0; j < 2; ++j)38        for (int j = 0; j < 2; ++j)39          for (int j = 0; j < 2; ++j) {40#pragma omp cancel taskgroup41#pragma omp cancellation point taskgroup42            foo();43          }44  // CHECK-NEXT: #pragma omp parallel45  // CHECK-NEXT: #pragma omp master 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)46  // CHECK-NEXT: for (int i = 0; i < 2; ++i)47  // CHECK-NEXT: for (int j = 0; j < 2; ++j)48  // CHECK-NEXT: for (int j = 0; j < 2; ++j)49  // CHECK-NEXT: for (int j = 0; j < 2; ++j)50  // CHECK-NEXT: for (int j = 0; j < 2; ++j)51  // CHECK-NEXT: for (int i = 0; i < 2; ++i)52  // CHECK-NEXT: for (int j = 0; j < 2; ++j)53  // CHECK-NEXT: for (int j = 0; j < 2; ++j)54  // CHECK-NEXT: for (int j = 0; j < 2; ++j)55  // CHECK-NEXT: for (int j = 0; j < 2; ++j) {56  // CHECK-NEXT: #pragma omp cancel taskgroup57  // CHECK-NEXT: #pragma omp cancellation point taskgroup58  // CHECK-NEXT: foo();59  return T();60}61 62// CHECK-LABEL: int main(int argc, char **argv) {63int main(int argc, char **argv) {64  int b = argc, c, d, e, f, g;65  static int a;66// CHECK: static int a;67#pragma omp taskgroup task_reduction(+: d)68#pragma omp master taskloop if(taskloop: a) default(none) shared(a) final(b) priority(5) num_tasks(argc) reduction(*: g) in_reduction(+:d)69  // CHECK-NEXT: #pragma omp taskgroup task_reduction(+: d)70  // CHECK-NEXT: #pragma omp master taskloop if(taskloop: a) default(none) shared(a) final(b) priority(5) num_tasks(argc) reduction(*: g) in_reduction(+: d)71  for (int i = 0; i < 2; ++i)72    a = 2;73// CHECK-NEXT: for (int i = 0; i < 2; ++i)74// CHECK-NEXT: a = 2;75#pragma omp parallel76#pragma omp master taskloop private(argc, b), firstprivate(argv, c), lastprivate(d, f) collapse(2) shared(g) if(argc) mergeable priority(argc) grainsize(argc) reduction(max: a, e)77  for (int i = 0; i < 10; ++i)78    for (int j = 0; j < 10; ++j) {79#pragma omp cancel taskgroup80#pragma omp cancellation point taskgroup81      foo();82    }83  // CHECK-NEXT: #pragma omp parallel84  // CHECK-NEXT: #pragma omp master taskloop private(argc,b) firstprivate(argv,c) lastprivate(d,f) collapse(2) shared(g) if(argc) mergeable priority(argc) grainsize(argc) reduction(max: a,e)85  // CHECK-NEXT: for (int i = 0; i < 10; ++i)86  // CHECK-NEXT: for (int j = 0; j < 10; ++j) {87  // CHECK-NEXT: #pragma omp cancel taskgroup88  // CHECK-NEXT: #pragma omp cancellation point taskgroup89  // CHECK-NEXT: foo();90  return (tmain<int, 5>(argc) + tmain<char, 1>(argv[0][0]));91}92 93#endif94