1 /*
2 //@HEADER
3 // ************************************************************************
4 //
5 // Kokkos v. 3.0
6 // Copyright (2020) National Technology & Engineering
7 // Solutions of Sandia, LLC (NTESS).
8 //
9 // Under the terms of Contract DE-NA0003525 with NTESS,
10 // the U.S. Government retains certain rights in this software.
11 //
12 // Redistribution and use in source and binary forms, with or without
13 // modification, are permitted provided that the following conditions are
14 // met:
15 //
16 // 1. Redistributions of source code must retain the above copyright
17 // notice, this list of conditions and the following disclaimer.
18 //
19 // 2. Redistributions in binary form must reproduce the above copyright
20 // notice, this list of conditions and the following disclaimer in the
21 // documentation and/or other materials provided with the distribution.
22 //
23 // 3. Neither the name of the Corporation nor the names of the
24 // contributors may be used to endorse or promote products derived from
25 // this software without specific prior written permission.
26 //
27 // THIS SOFTWARE IS PROVIDED BY NTESS "AS IS" AND ANY
28 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
30 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL NTESS OR THE
31 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
32 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
33 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
34 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
35 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
36 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
37 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
38 //
39 // Questions? Contact Christian R. Trott (crtrott@sandia.gov)
40 //
41 // ************************************************************************
42 //@HEADER
43 */
44
45 #include <TestSYCL_Category.hpp>
46 #include <Test_InterOp_Streams.hpp>
47
48 namespace Test {
49 // Test Interoperability with SYCL Streams
TEST(sycl,raw_sycl_queues)50 TEST(sycl, raw_sycl_queues) {
51 sycl::default_selector device_selector;
52 sycl::queue queue(device_selector);
53 Kokkos::InitArguments arguments{-1, -1, -1, false};
54 Kokkos::initialize(arguments);
55 int* p = sycl::malloc_device<int>(100, queue);
56 using MemorySpace = typename TEST_EXECSPACE::memory_space;
57
58 {
59 TEST_EXECSPACE space0(queue);
60 Kokkos::View<int*, TEST_EXECSPACE> v(p, 100);
61 Kokkos::deep_copy(space0, v, 5);
62 int sum = 0;
63
64 Kokkos::parallel_for("Test::sycl::raw_sycl_queue::Range",
65 Kokkos::RangePolicy<TEST_EXECSPACE>(space0, 0, 100),
66 FunctorRange<MemorySpace>(v));
67 Kokkos::parallel_reduce("Test::sycl::raw_sycl_queue::RangeReduce",
68 Kokkos::RangePolicy<TEST_EXECSPACE>(space0, 0, 100),
69 FunctorRangeReduce<MemorySpace>(v), sum);
70 space0.fence();
71 ASSERT_EQ(6 * 100, sum);
72
73 Kokkos::parallel_for("Test::sycl::raw_sycl_queue::MDRange",
74 Kokkos::MDRangePolicy<TEST_EXECSPACE, Kokkos::Rank<2>>(
75 space0, {0, 0}, {10, 10}),
76 FunctorMDRange<MemorySpace>(v));
77 space0.fence();
78 Kokkos::parallel_reduce(
79 "Test::sycl::raw_sycl_queue::MDRangeReduce",
80 Kokkos::MDRangePolicy<TEST_EXECSPACE, Kokkos::Rank<2>>(space0, {0, 0},
81 {10, 10}),
82 FunctorMDRangeReduce<MemorySpace>(v), sum);
83 space0.fence();
84 ASSERT_EQ(7 * 100, sum);
85
86 Kokkos::parallel_for("Test::sycl::raw_sycl_queue::Team",
87 Kokkos::TeamPolicy<TEST_EXECSPACE>(space0, 10, 10),
88 FunctorTeam<MemorySpace, TEST_EXECSPACE>(v));
89 space0.fence();
90 Kokkos::parallel_reduce("Test::sycl::raw_sycl_queue::Team",
91 Kokkos::TeamPolicy<TEST_EXECSPACE>(space0, 10, 10),
92 FunctorTeamReduce<MemorySpace, TEST_EXECSPACE>(v),
93 sum);
94 space0.fence();
95 ASSERT_EQ(8 * 100, sum);
96 }
97 Kokkos::finalize();
98
99 // Try to use the queue after Kokkos' copy got out-of-scope.
100 // This kernel corresponds to "offset_streams" in the HIP and CUDA tests.
101 queue.submit([&](sycl::handler& cgh) {
102 cgh.parallel_for(sycl::range<1>(100), [=](int idx) { p[idx] += idx; });
103 });
104 queue.wait_and_throw();
105
106 int h_p[100];
107 queue.memcpy(h_p, p, sizeof(int) * 100);
108 queue.wait_and_throw();
109 int64_t sum = 0;
110 int64_t sum_expect = 0;
111 for (int i = 0; i < 100; i++) {
112 sum += h_p[i];
113 sum_expect += 8 + i;
114 }
115
116 ASSERT_EQ(sum, sum_expect);
117 }
118 } // namespace Test
119