brintos

brintos / llvm-project-archived public Read only

0
0
Text · 2.2 KiB · f4c2af6 Raw
101 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 tile sizes(3, 3)14    for (int j = 0; j < 4; ++j)15      for (int k = 0; k < 5; ++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 25// Full tile26// CHECK-NEXT: i=0 j=0 k=027// CHECK-NEXT: i=0 j=0 k=128// CHECK-NEXT: i=0 j=0 k=229// CHECK-NEXT: i=0 j=1 k=030// CHECK-NEXT: i=0 j=1 k=131// CHECK-NEXT: i=0 j=1 k=232// CHECK-NEXT: i=0 j=2 k=033// CHECK-NEXT: i=0 j=2 k=134// CHECK-NEXT: i=0 j=2 k=235 36// Partial tile37// CHECK-NEXT: i=0 j=0 k=338// CHECK-NEXT: i=0 j=0 k=439// CHECK-NEXT: i=0 j=1 k=340// CHECK-NEXT: i=0 j=1 k=441// CHECK-NEXT: i=0 j=2 k=342// CHECK-NEXT: i=0 j=2 k=443 44// Partial tile45// CHECK-NEXT: i=0 j=3 k=046// CHECK-NEXT: i=0 j=3 k=147// CHECK-NEXT: i=0 j=3 k=248 49// Partial tile50// CHECK-NEXT: i=0 j=3 k=351// CHECK-NEXT: i=0 j=3 k=452 53// Full tile54// CHECK-NEXT: i=1 j=0 k=055// CHECK-NEXT: i=1 j=0 k=156// CHECK-NEXT: i=1 j=0 k=257// CHECK-NEXT: i=1 j=1 k=058// CHECK-NEXT: i=1 j=1 k=159// CHECK-NEXT: i=1 j=1 k=260// CHECK-NEXT: i=1 j=2 k=061// CHECK-NEXT: i=1 j=2 k=162// CHECK-NEXT: i=1 j=2 k=263 64// Partial tiles65// CHECK-NEXT: i=1 j=0 k=366// CHECK-NEXT: i=1 j=0 k=467// CHECK-NEXT: i=1 j=1 k=368// CHECK-NEXT: i=1 j=1 k=469// CHECK-NEXT: i=1 j=2 k=370// CHECK-NEXT: i=1 j=2 k=471// CHECK-NEXT: i=1 j=3 k=072// CHECK-NEXT: i=1 j=3 k=173// CHECK-NEXT: i=1 j=3 k=274// CHECK-NEXT: i=1 j=3 k=375// CHECK-NEXT: i=1 j=3 k=476 77// Full tile78// CHECK-NEXT: i=2 j=0 k=079// CHECK-NEXT: i=2 j=0 k=180// CHECK-NEXT: i=2 j=0 k=281// CHECK-NEXT: i=2 j=1 k=082// CHECK-NEXT: i=2 j=1 k=183// CHECK-NEXT: i=2 j=1 k=284// CHECK-NEXT: i=2 j=2 k=085// CHECK-NEXT: i=2 j=2 k=186// CHECK-NEXT: i=2 j=2 k=287 88// Partial tiles89// CHECK-NEXT: i=2 j=0 k=390// CHECK-NEXT: i=2 j=0 k=491// CHECK-NEXT: i=2 j=1 k=392// CHECK-NEXT: i=2 j=1 k=493// CHECK-NEXT: i=2 j=2 k=394// CHECK-NEXT: i=2 j=2 k=495// CHECK-NEXT: i=2 j=3 k=096// CHECK-NEXT: i=2 j=3 k=197// CHECK-NEXT: i=2 j=3 k=298// CHECK-NEXT: i=2 j=3 k=399// CHECK-NEXT: i=2 j=3 k=4100// CHECK-NEXT: done101