24f836e8fd
This patch fuses the RUN lines for most libomptarget tests. The previous patch D101315 created separate test targets for each supported offloading triple. This patch updates the RUN lines in libomptarget tests to use a generic run line independent of the offloading target selected for the lit instance. In cases, where no RUN line was defined for a specific offloading target, the corresponding target is declared as XFAIL. If it turns out that a test actually supports the target, the XFAIL line can be removed. Differential Revision: https://reviews.llvm.org/D101326
82 lines
2.1 KiB
C++
82 lines
2.1 KiB
C++
// RUN: %libomptarget-compilexx-generic -O3 && %libomptarget-run-generic
|
|
|
|
#include <iostream>
|
|
|
|
template <typename T> int test_map() {
|
|
std::cout << "map(complex<>)" << std::endl;
|
|
T a(0.2), a_check;
|
|
#pragma omp target map(from : a_check)
|
|
{ a_check = a; }
|
|
|
|
if (a_check != a) {
|
|
std::cout << " wrong results";
|
|
return 1;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
template <typename T> int test_reduction() {
|
|
std::cout << "flat parallelism" << std::endl;
|
|
T sum(0), sum_host(0);
|
|
const int size = 100;
|
|
T array[size];
|
|
for (int i = 0; i < size; i++) {
|
|
array[i] = i;
|
|
sum_host += array[i];
|
|
}
|
|
|
|
#pragma omp target teams distribute parallel for map(to: array[:size]) \
|
|
reduction(+ : sum)
|
|
for (int i = 0; i < size; i++)
|
|
sum += array[i];
|
|
|
|
if (sum != sum_host)
|
|
std::cout << " wrong results " << sum << " host " << sum_host << std::endl;
|
|
|
|
std::cout << "hierarchical parallelism" << std::endl;
|
|
const int nblock(10), block_size(10);
|
|
T block_sum[nblock];
|
|
#pragma omp target teams distribute map(to \
|
|
: array[:size]) \
|
|
map(from \
|
|
: block_sum[:nblock])
|
|
for (int ib = 0; ib < nblock; ib++) {
|
|
T partial_sum = 0;
|
|
const int istart = ib * block_size;
|
|
const int iend = (ib + 1) * block_size;
|
|
#pragma omp parallel for reduction(+ : partial_sum)
|
|
for (int i = istart; i < iend; i++)
|
|
partial_sum += array[i];
|
|
block_sum[ib] = partial_sum;
|
|
}
|
|
|
|
sum = 0;
|
|
for (int ib = 0; ib < nblock; ib++) {
|
|
sum += block_sum[ib];
|
|
}
|
|
|
|
if (sum != sum_host) {
|
|
std::cout << " wrong results " << sum << " host " << sum_host << std::endl;
|
|
return 1;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
template <typename T> int test_complex() {
|
|
int ret = 0;
|
|
ret |= test_map<T>();
|
|
ret |= test_reduction<T>();
|
|
return ret;
|
|
}
|
|
|
|
int main() {
|
|
int ret = 0;
|
|
std::cout << "Testing float" << std::endl;
|
|
ret |= test_complex<float>();
|
|
std::cout << "Testing double" << std::endl;
|
|
ret |= test_complex<double>();
|
|
return ret;
|
|
}
|