80865c01e1
Add the reverse directive which will be introduced in the upcoming OpenMP 6.0 specification. A preview has been published in [Technical Report 12](https://www.openmp.org/wp-content/uploads/openmp-TR12.pdf). --------- Co-authored-by: Alexey Bataev <a.bataev@outlook.com>
52 lines
1.2 KiB
C++
52 lines
1.2 KiB
C++
// RUN: %libomp-cxx-compile-and-run | FileCheck %s --match-full-lines
|
|
|
|
#ifndef HEADER
|
|
#define HEADER
|
|
|
|
#include <cstdlib>
|
|
#include <cstdio>
|
|
|
|
int main() {
|
|
printf("do\n");
|
|
#pragma omp parallel for collapse(3) num_threads(1)
|
|
for (int i = 0; i < 3; ++i)
|
|
#pragma omp reverse
|
|
for (int j = 0; j < 3; ++j)
|
|
for (int k = 0; k < 3; ++k)
|
|
printf("i=%d j=%d k=%d\n", i, j, k);
|
|
printf("done\n");
|
|
return EXIT_SUCCESS;
|
|
}
|
|
|
|
#endif /* HEADER */
|
|
|
|
// CHECK: do
|
|
// CHECK-NEXT: i=0 j=2 k=0
|
|
// CHECK-NEXT: i=0 j=2 k=1
|
|
// CHECK-NEXT: i=0 j=2 k=2
|
|
// CHECK-NEXT: i=0 j=1 k=0
|
|
// CHECK-NEXT: i=0 j=1 k=1
|
|
// CHECK-NEXT: i=0 j=1 k=2
|
|
// CHECK-NEXT: i=0 j=0 k=0
|
|
// CHECK-NEXT: i=0 j=0 k=1
|
|
// CHECK-NEXT: i=0 j=0 k=2
|
|
// CHECK-NEXT: i=1 j=2 k=0
|
|
// CHECK-NEXT: i=1 j=2 k=1
|
|
// CHECK-NEXT: i=1 j=2 k=2
|
|
// CHECK-NEXT: i=1 j=1 k=0
|
|
// CHECK-NEXT: i=1 j=1 k=1
|
|
// CHECK-NEXT: i=1 j=1 k=2
|
|
// CHECK-NEXT: i=1 j=0 k=0
|
|
// CHECK-NEXT: i=1 j=0 k=1
|
|
// CHECK-NEXT: i=1 j=0 k=2
|
|
// CHECK-NEXT: i=2 j=2 k=0
|
|
// CHECK-NEXT: i=2 j=2 k=1
|
|
// CHECK-NEXT: i=2 j=2 k=2
|
|
// CHECK-NEXT: i=2 j=1 k=0
|
|
// CHECK-NEXT: i=2 j=1 k=1
|
|
// CHECK-NEXT: i=2 j=1 k=2
|
|
// CHECK-NEXT: i=2 j=0 k=0
|
|
// CHECK-NEXT: i=2 j=0 k=1
|
|
// CHECK-NEXT: i=2 j=0 k=2
|
|
// CHECK-NEXT: done
|