master_taskloop_simd_ast_print.cpp 4.1 KB

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