Skip to content
This repository was archived by the owner on Mar 28, 2023. It is now read-only.

[SYCL] Disable AtomicRef tests on accelerator #48

Merged
merged 1 commit into from
Nov 3, 2020
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 0 additions & 1 deletion SYCL/AtomicRef/accessor.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,6 @@
// RUN: %HOST_RUN_PLACEHOLDER %t.out
// RUN: %CPU_RUN_PLACEHOLDER %t.out
// RUN: %GPU_RUN_PLACEHOLDER %t.out
// RUN: %ACC_RUN_PLACEHOLDER %t.out

#include <CL/sycl.hpp>
#include <algorithm>
Expand Down
5 changes: 0 additions & 5 deletions SYCL/AtomicRef/add.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,6 @@
// RUN: %HOST_RUN_PLACEHOLDER %t.out
// RUN: %CPU_RUN_PLACEHOLDER %t.out
// RUN: %GPU_RUN_PLACEHOLDER %t.out
// RUN: %ACC_RUN_PLACEHOLDER %t.out

#include <CL/sycl.hpp>
#include <algorithm>
Expand Down Expand Up @@ -178,10 +177,6 @@ template <> void add_test<double>(queue q, size_t N) {
int main() {
queue q;
std::string version = q.get_device().get_info<info::device::version>();
if (version < std::string("2.0")) {
std::cout << "Skipping test\n";
return 0;
}

constexpr int N = 32;
add_test<int>(q, N);
Expand Down
5 changes: 0 additions & 5 deletions SYCL/AtomicRef/compare_exchange.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,6 @@
// RUN: %HOST_RUN_PLACEHOLDER %t.out
// RUN: %CPU_RUN_PLACEHOLDER %t.out
// RUN: %GPU_RUN_PLACEHOLDER %t.out
// RUN: %ACC_RUN_PLACEHOLDER %t.out

#include <CL/sycl.hpp>
#include <algorithm>
Expand Down Expand Up @@ -58,10 +57,6 @@ template <typename T> void compare_exchange_test(queue q, size_t N) {
int main() {
queue q;
std::string version = q.get_device().get_info<info::device::version>();
if (version < std::string("2.0")) {
std::cout << "Skipping test\n";
return 0;
}

constexpr int N = 32;
compare_exchange_test<int>(q, N);
Expand Down
5 changes: 0 additions & 5 deletions SYCL/AtomicRef/exchange.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,6 @@
// RUN: %HOST_RUN_PLACEHOLDER %t.out
// RUN: %CPU_RUN_PLACEHOLDER %t.out
// RUN: %GPU_RUN_PLACEHOLDER %t.out
// RUN: %ACC_RUN_PLACEHOLDER %t.out

#include <CL/sycl.hpp>
#include <algorithm>
Expand Down Expand Up @@ -50,10 +49,6 @@ template <typename T> void exchange_test(queue q, size_t N) {
int main() {
queue q;
std::string version = q.get_device().get_info<info::device::version>();
if (version < std::string("2.0")) {
std::cout << "Skipping test\n";
return 0;
}

constexpr int N = 32;
exchange_test<int>(q, N);
Expand Down
5 changes: 0 additions & 5 deletions SYCL/AtomicRef/load.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,6 @@
// RUN: %HOST_RUN_PLACEHOLDER %t.out
// RUN: %CPU_RUN_PLACEHOLDER %t.out
// RUN: %GPU_RUN_PLACEHOLDER %t.out
// RUN: %ACC_RUN_PLACEHOLDER %t.out

#include <CL/sycl.hpp>
#include <algorithm>
Expand Down Expand Up @@ -46,10 +45,6 @@ template <typename T> void load_test(queue q, size_t N) {
int main() {
queue q;
std::string version = q.get_device().get_info<info::device::version>();
if (version < std::string("2.0")) {
std::cout << "Skipping test\n";
return 0;
}

constexpr int N = 32;
load_test<int>(q, N);
Expand Down
5 changes: 0 additions & 5 deletions SYCL/AtomicRef/max.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,6 @@
// RUN: %HOST_RUN_PLACEHOLDER %t.out
// RUN: %CPU_RUN_PLACEHOLDER %t.out
// RUN: %GPU_RUN_PLACEHOLDER %t.out
// RUN: %ACC_RUN_PLACEHOLDER %t.out

#include <CL/sycl.hpp>
#include <algorithm>
Expand Down Expand Up @@ -54,10 +53,6 @@ template <typename T> void max_test(queue q, size_t N) {
int main() {
queue q;
std::string version = q.get_device().get_info<info::device::version>();
if (version < std::string("2.0")) {
std::cout << "Skipping test\n";
return 0;
}

constexpr int N = 32;
max_test<int>(q, N);
Expand Down
5 changes: 0 additions & 5 deletions SYCL/AtomicRef/min.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,6 @@
// RUN: %HOST_RUN_PLACEHOLDER %t.out
// RUN: %CPU_RUN_PLACEHOLDER %t.out
// RUN: %GPU_RUN_PLACEHOLDER %t.out
// RUN: %ACC_RUN_PLACEHOLDER %t.out

#include <CL/sycl.hpp>
#include <algorithm>
Expand Down Expand Up @@ -52,10 +51,6 @@ template <typename T> void min_test(queue q, size_t N) {
int main() {
queue q;
std::string version = q.get_device().get_info<info::device::version>();
if (version < std::string("2.0")) {
std::cout << "Skipping test\n";
return 0;
}

constexpr int N = 32;
min_test<int>(q, N);
Expand Down
5 changes: 0 additions & 5 deletions SYCL/AtomicRef/store.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,6 @@
// RUN: %HOST_RUN_PLACEHOLDER %t.out
// RUN: %CPU_RUN_PLACEHOLDER %t.out
// RUN: %GPU_RUN_PLACEHOLDER %t.out
// RUN: %ACC_RUN_PLACEHOLDER %t.out

#include <CL/sycl.hpp>
#include <algorithm>
Expand Down Expand Up @@ -40,10 +39,6 @@ template <typename T> void store_test(queue q, size_t N) {
int main() {
queue q;
std::string version = q.get_device().get_info<info::device::version>();
if (version < std::string("2.0")) {
std::cout << "Skipping test\n";
return 0;
}

constexpr int N = 32;
store_test<int>(q, N);
Expand Down
5 changes: 0 additions & 5 deletions SYCL/AtomicRef/sub.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,6 @@
// RUN: %HOST_RUN_PLACEHOLDER %t.out
// RUN: %CPU_RUN_PLACEHOLDER %t.out
// RUN: %GPU_RUN_PLACEHOLDER %t.out
// RUN: %ACC_RUN_PLACEHOLDER %t.out

#include <CL/sycl.hpp>
#include <algorithm>
Expand Down Expand Up @@ -178,10 +177,6 @@ template <> void sub_test<double>(queue q, size_t N) {
int main() {
queue q;
std::string version = q.get_device().get_info<info::device::version>();
if (version < std::string("2.0")) {
std::cout << "Skipping test\n";
return 0;
}

constexpr int N = 32;
sub_test<int>(q, N);
Expand Down