forked from OSchip/llvm-project
204 lines
7.3 KiB
C++
204 lines
7.3 KiB
C++
// RUN: %clang_cc1 -verify -fopenmp -ast-print %s | FileCheck %s
|
|
// RUN: %clang_cc1 -fopenmp -x c++ -std=c++11 -emit-pch -o %t %s
|
|
// RUN: %clang_cc1 -fopenmp -std=c++11 -include-pch %t -fsyntax-only -verify %s -ast-print | FileCheck %s
|
|
|
|
// RUN: %clang_cc1 -verify -fopenmp-simd -ast-print %s | FileCheck %s
|
|
// RUN: %clang_cc1 -fopenmp-simd -x c++ -std=c++11 -emit-pch -o %t %s
|
|
// RUN: %clang_cc1 -fopenmp-simd -std=c++11 -include-pch %t -fsyntax-only -verify %s -ast-print | FileCheck %s
|
|
// expected-no-diagnostics
|
|
|
|
#ifndef HEADER
|
|
#define HEADER
|
|
|
|
void foo() {}
|
|
|
|
struct S {
|
|
S(): a(0) {}
|
|
S(int v) : a(v) {}
|
|
int a;
|
|
typedef int type;
|
|
};
|
|
|
|
template <typename T>
|
|
class S7 : public T {
|
|
protected:
|
|
T a;
|
|
S7() : a(0) {}
|
|
|
|
public:
|
|
S7(typename T::type v) : a(v) {
|
|
#pragma omp target teams distribute simd private(a) private(this->a) private(T::a)
|
|
for (int k = 0; k < a.a; ++k)
|
|
++this->a.a;
|
|
}
|
|
S7 &operator=(S7 &s) {
|
|
int k;
|
|
#pragma omp target teams distribute simd private(a) private(this->a) linear(k)
|
|
for (k = 0; k < s.a.a; ++k)
|
|
++s.a.a;
|
|
return *this;
|
|
}
|
|
void foo() {
|
|
int b, argv, d, c, e, f;
|
|
#pragma omp target teams distribute simd private(b), firstprivate(argv) shared(d) reduction(+:c) reduction(max:e) num_teams(f) thread_limit(d)
|
|
for (int k = 0; k < a.a; ++k)
|
|
++a.a;
|
|
}
|
|
void bar() {
|
|
int arr[10];
|
|
const int alen = 16;
|
|
const int slen1 = 8;
|
|
const int slen2 = 8;
|
|
#pragma omp target teams distribute simd simdlen(slen1) safelen(slen2) aligned(arr:alen)
|
|
for (int k = 0; k < a.a; ++k)
|
|
++a.a;
|
|
}
|
|
};
|
|
// CHECK: #pragma omp target teams distribute simd private(this->a) private(this->a) private(T::a)
|
|
// CHECK: #pragma omp target teams distribute simd private(this->a) private(this->a) linear(k)
|
|
// CHECK: #pragma omp target teams distribute simd private(b) firstprivate(argv) shared(d) reduction(+: c) reduction(max: e) num_teams(f) thread_limit(d)
|
|
// CHECK: #pragma omp target teams distribute simd simdlen(slen1) safelen(slen2) aligned(arr: alen)
|
|
// CHECK: #pragma omp target teams distribute simd private(this->a) private(this->a) private(this->S::a)
|
|
|
|
class S8 : public S7<S> {
|
|
S8() {}
|
|
|
|
public:
|
|
S8(int v) : S7<S>(v){
|
|
#pragma omp target teams distribute simd private(a) private(this->a) private(S7<S>::a)
|
|
for (int k = 0; k < a.a; ++k)
|
|
++this->a.a;
|
|
}
|
|
S8 &operator=(S8 &s) {
|
|
#pragma omp target teams distribute simd private(a) private(this->a)
|
|
for (int k = 0; k < s.a.a; ++k)
|
|
++s.a.a;
|
|
return *this;
|
|
}
|
|
void bar() {
|
|
int b, argv, d, c, e, f;
|
|
#pragma omp target teams distribute simd private(b), firstprivate(argv) shared(d) reduction(+:c) reduction(max:e) num_teams(f) thread_limit(d)
|
|
for (int k = 0; k < a.a; ++k)
|
|
++a.a;
|
|
}
|
|
void foo() {
|
|
const int alen = 16;
|
|
const int slen1 = 8;
|
|
const int slen2 = 8;
|
|
int arr[10];
|
|
#pragma omp target teams distribute simd simdlen(slen1) safelen(slen2) aligned(arr:alen)
|
|
for (int k = 0; k < a.a; ++k)
|
|
++a.a;
|
|
}
|
|
};
|
|
// CHECK: #pragma omp target teams distribute simd private(this->a) private(this->a) private(this->S7<S>::a)
|
|
// CHECK: #pragma omp target teams distribute simd private(this->a) private(this->a)
|
|
// CHECK: #pragma omp target teams distribute simd private(b) firstprivate(argv) shared(d) reduction(+: c) reduction(max: e) num_teams(f) thread_limit(d)
|
|
// CHECK: #pragma omp target teams distribute simd simdlen(slen1) safelen(slen2) aligned(arr: alen)
|
|
|
|
template <class T, int N>
|
|
T tmain(T argc) {
|
|
T b = argc, c, d, e, f, g;
|
|
static T a;
|
|
// CHECK: static T a;
|
|
const T clen = 5;
|
|
const T alen = 16;
|
|
int arr[10];
|
|
#pragma omp target teams distribute simd
|
|
for (int i=0; i < 2; ++i)
|
|
a = 2;
|
|
// CHECK: #pragma omp target teams distribute simd
|
|
// CHECK-NEXT: for (int i = 0; i < 2; ++i)
|
|
// CHECK-NEXT: a = 2;
|
|
#pragma omp target teams distribute simd private(argc, b), firstprivate(c, d), collapse(2)
|
|
for (int i = 0; i < 10; ++i)
|
|
for (int j = 0; j < 10; ++j)
|
|
foo();
|
|
// CHECK: #pragma omp target teams distribute simd private(argc,b) firstprivate(c,d) collapse(2)
|
|
// CHECK-NEXT: for (int i = 0; i < 10; ++i)
|
|
// CHECK-NEXT: for (int j = 0; j < 10; ++j)
|
|
// CHECK-NEXT: foo();
|
|
for (int i = 0; i < 10; ++i)
|
|
foo();
|
|
// CHECK: for (int i = 0; i < 10; ++i)
|
|
// CHECK-NEXT: foo();
|
|
#pragma omp target teams distribute simd
|
|
for (int i = 0; i < 10; ++i)
|
|
foo();
|
|
// CHECK: #pragma omp target teams distribute simd
|
|
// CHECK-NEXT: for (int i = 0; i < 10; ++i)
|
|
// CHECK-NEXT: foo();
|
|
#pragma omp target teams distribute simd private(b), firstprivate(argc) shared(d) reduction(+:c) reduction(max:e) num_teams(f) thread_limit(d)
|
|
for (int k = 0; k < 10; ++k)
|
|
e += d + argc;
|
|
// CHECK: #pragma omp target teams distribute simd private(b) firstprivate(argc) shared(d) reduction(+: c) reduction(max: e) num_teams(f) thread_limit(d)
|
|
// CHECK-NEXT: for (int k = 0; k < 10; ++k)
|
|
// CHECK-NEXT: e += d + argc;
|
|
#pragma omp target teams distribute simd simdlen(clen-1)
|
|
for (int k = 0; k < 10; ++k)
|
|
e += d + argc;
|
|
// CHECK: #pragma omp target teams distribute simd simdlen(clen - 1)
|
|
// CHECK-NEXT: for (int k = 0; k < 10; ++k)
|
|
// CHECK-NEXT: e += d + argc;
|
|
#pragma omp target teams distribute simd safelen(clen-1) aligned(arr:alen)
|
|
for (int k = 0; k < 10; ++k)
|
|
e += d + argc + arr[k];
|
|
// CHECK: #pragma omp target teams distribute simd safelen(clen - 1) aligned(arr: alen)
|
|
// CHECK-NEXT: for (int k = 0; k < 10; ++k)
|
|
// CHECK-NEXT: e += d + argc + arr[k];
|
|
return T();
|
|
}
|
|
|
|
int main (int argc, char **argv) {
|
|
int b = argc, c, d, e, f, g;
|
|
static int a;
|
|
// CHECK: static int a;
|
|
const int clen = 5;
|
|
const int N = 10;
|
|
int arr[10];
|
|
#pragma omp target teams distribute simd
|
|
for (int i=0; i < 2; ++i)
|
|
a = 2;
|
|
// CHECK: #pragma omp target teams distribute simd
|
|
// CHECK-NEXT: for (int i = 0; i < 2; ++i)
|
|
// CHECK-NEXT: a = 2;
|
|
#pragma omp target teams distribute simd private(argc,b),firstprivate(argv, c), collapse(2)
|
|
for (int i = 0; i < 10; ++i)
|
|
for (int j = 0; j < 10; ++j)
|
|
foo();
|
|
// CHECK: #pragma omp target teams distribute simd private(argc,b) firstprivate(argv,c) collapse(2)
|
|
// CHECK-NEXT: for (int i = 0; i < 10; ++i)
|
|
// CHECK-NEXT: for (int j = 0; j < 10; ++j)
|
|
// CHECK-NEXT: foo();
|
|
for (int i = 0; i < 10; ++i)
|
|
foo();
|
|
// CHECK: for (int i = 0; i < 10; ++i)
|
|
// CHECK-NEXT: foo();
|
|
#pragma omp target teams distribute simd
|
|
for (int i = 0; i < 10; ++i)foo();
|
|
// CHECK: #pragma omp target teams distribute simd
|
|
// CHECK-NEXT: for (int i = 0; i < 10; ++i)
|
|
// CHECK-NEXT: foo();
|
|
#pragma omp target teams distribute simd private(b), firstprivate(argc) shared(d) reduction(+:c) reduction(max:e) num_teams(f) thread_limit(d)
|
|
for (int k = 0; k < 10; ++k)
|
|
e += d + argc;
|
|
// CHECK: #pragma omp target teams distribute simd private(b) firstprivate(argc) shared(d) reduction(+: c) reduction(max: e) num_teams(f) thread_limit(d)
|
|
// CHECK-NEXT: for (int k = 0; k < 10; ++k)
|
|
// CHECK-NEXT: e += d + argc;
|
|
#pragma omp target teams distribute simd simdlen(clen-1)
|
|
for (int k = 0; k < 10; ++k)
|
|
e += d + argc;
|
|
// CHECK: #pragma omp target teams distribute simd simdlen(clen - 1)
|
|
// CHECK-NEXT: for (int k = 0; k < 10; ++k)
|
|
// CHECK-NEXT: e += d + argc;
|
|
#pragma omp target teams distribute simd safelen(clen-1) aligned(arr:N+6)
|
|
for (int k = 0; k < 10; ++k)
|
|
e += d + argc + arr[k];
|
|
// CHECK: #pragma omp target teams distribute simd safelen(clen - 1) aligned(arr: N + 6)
|
|
// CHECK-NEXT: for (int k = 0; k < 10; ++k)
|
|
// CHECK-NEXT: e += d + argc + arr[k];
|
|
return (0);
|
|
}
|
|
|
|
#endif
|