brintos

brintos / llvm-project-archived public Read only

0
0
Text · 1.2 KiB · ae545b8 Raw
52 lines · cpp
1// RUN: %libomp-cxx-compile-and-run | FileCheck %s --match-full-lines2 3#ifndef HEADER4#define HEADER5 6#include <cstdlib>7#include <cstdio>8 9int main() {10  printf("do\n");11#pragma omp parallel for collapse(3) num_threads(1)12  for (int i = 0; i < 3; ++i)13#pragma omp reverse14    for (int j = 0; j < 3; ++j)15      for (int k = 0; k < 3; ++k)16        printf("i=%d j=%d k=%d\n", i, j, k);17  printf("done\n");18  return EXIT_SUCCESS;19}20 21#endif /* HEADER */22 23// CHECK:      do24// CHECK-NEXT: i=0 j=2 k=025// CHECK-NEXT: i=0 j=2 k=126// CHECK-NEXT: i=0 j=2 k=227// CHECK-NEXT: i=0 j=1 k=028// CHECK-NEXT: i=0 j=1 k=129// CHECK-NEXT: i=0 j=1 k=230// CHECK-NEXT: i=0 j=0 k=031// CHECK-NEXT: i=0 j=0 k=132// CHECK-NEXT: i=0 j=0 k=233// CHECK-NEXT: i=1 j=2 k=034// CHECK-NEXT: i=1 j=2 k=135// CHECK-NEXT: i=1 j=2 k=236// CHECK-NEXT: i=1 j=1 k=037// CHECK-NEXT: i=1 j=1 k=138// CHECK-NEXT: i=1 j=1 k=239// CHECK-NEXT: i=1 j=0 k=040// CHECK-NEXT: i=1 j=0 k=141// CHECK-NEXT: i=1 j=0 k=242// CHECK-NEXT: i=2 j=2 k=043// CHECK-NEXT: i=2 j=2 k=144// CHECK-NEXT: i=2 j=2 k=245// CHECK-NEXT: i=2 j=1 k=046// CHECK-NEXT: i=2 j=1 k=147// CHECK-NEXT: i=2 j=1 k=248// CHECK-NEXT: i=2 j=0 k=049// CHECK-NEXT: i=2 j=0 k=150// CHECK-NEXT: i=2 j=0 k=251// CHECK-NEXT: done52