1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
// SPDX-FileCopyrightText: Copyright Contributors to the Kokkos project
#include <Kokkos_Macros.hpp>
#ifdef KOKKOS_ENABLE_EXPERIMENTAL_CXX20_MODULES
import kokkos.core;
#else
#include <Kokkos_Core.hpp>
#endif
#include <TestSYCL_Category.hpp>
#include <array>
namespace Test {
// Test whether external allocations can be accessed by the default queue.
TEST(sycl, raw_sycl_interop_context_1) {
// Make sure all queues use the same context
Kokkos::SYCL default_space;
sycl::context default_context = default_space.sycl_queue().get_context();
sycl::queue queue(default_context, sycl::default_selector_v,
sycl::property::queue::in_order());
constexpr int n = 100;
int* p = sycl::malloc_device<int>(n, queue);
Kokkos::SYCL space(queue);
Kokkos::View<int*, Kokkos::MemoryTraits<Kokkos::Unmanaged>> v(p, n);
Kokkos::deep_copy(v, 5);
queue.submit([&](sycl::handler& cgh) {
cgh.parallel_for(sycl::range<1>(n), [=](int idx) { p[idx] += idx; });
});
queue.wait_and_throw();
std::array<int, n> h_p;
queue.memcpy(h_p.data(), p, sizeof(int) * n);
queue.wait_and_throw();
sycl::free(p, queue);
int64_t sum = 0;
int64_t sum_expect = 0;
for (int i = 0; i < n; i++) {
sum += h_p[i];
sum_expect += 5 + i;
}
ASSERT_EQ(sum, sum_expect);
}
// Test whether regular View allocations can be accessed by non-default queues.
TEST(sycl, raw_sycl_interop_context_2) {
Kokkos::SYCL default_space;
sycl::context default_context = default_space.sycl_queue().get_context();
sycl::queue queue(default_context, sycl::default_selector_v,
sycl::property::queue::in_order());
constexpr int n = 100;
Kokkos::SYCL space(queue);
Kokkos::View<int*, Kokkos::SYCLDeviceUSMSpace> v("default_view", n);
Kokkos::deep_copy(space, v, 5);
auto* v_ptr = v.data();
queue.submit([&](sycl::handler& cgh) {
cgh.parallel_for(sycl::range<1>(n), [=](int idx) { v_ptr[idx] += idx; });
});
queue.wait_and_throw();
std::array<int, n> h_p;
queue.memcpy(h_p.data(), v_ptr, sizeof(int) * n);
queue.wait_and_throw();
int64_t sum = 0;
int64_t sum_expect = 0;
for (int i = 0; i < n; i++) {
sum += h_p[i];
sum_expect += 5 + i;
}
ASSERT_EQ(sum, sum_expect);
}
TEST(sycl_DeathTest, explicit_out_of_order_queue) {
Kokkos::SYCL default_space;
sycl::context default_context = default_space.sycl_queue().get_context();
sycl::queue queue(default_context, sycl::default_selector_v);
#ifdef KOKKOS_IMPL_SYCL_USE_IN_ORDER_QUEUES
::testing::FLAGS_gtest_death_test_style = "threadsafe";
ASSERT_DEATH(Kokkos::SYCL{queue},
"User provided sycl::queues must be in-order!");
#else
Kokkos::SYCL space{queue};
const int N = 1000;
int result;
Kokkos::parallel_reduce(
Kokkos::RangePolicy<Kokkos::SYCL>(space, 0, N),
KOKKOS_LAMBDA(const int i, int& sum) { sum += i; }, result);
ASSERT_EQ(result, N * (N - 1) / 2);
#endif
}
} // namespace Test
|
