-
Notifications
You must be signed in to change notification settings - Fork 30
Expand file tree
/
Copy pathutil_group_store_test.cpp
More file actions
263 lines (227 loc) · 9.41 KB
/
util_group_store_test.cpp
File metadata and controls
263 lines (227 loc) · 9.41 KB
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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
// ====------ util_group_store_test.cpp------------ *- C++ -* ----===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//
// ===----------------------------------------------------------------------===//
#include <dpct/dpct.hpp>
#include <dpct/dpl_utils.hpp>
#include <iostream>
#include <oneapi/dpl/iterator>
#include <sycl/sycl.hpp>
template <dpct::group::store_algorithm S>
bool helper_validation_function(const int *ptr, const char *func_name) {
for (int i = 0; i < 512; ++i) {
if (ptr[i] != i) {
if constexpr (S == dpct::group::store_algorithm::BLOCK_STORE_DIRECT) {
std::cout << func_name << "_blocked"
<< " failed\n";}
else{
std::cout << func_name << "_striped"
<< " failed\n";
}
std::ostream_iterator<int> Iter(std::cout, ", ");
std::copy(ptr, ptr + 512, Iter);
std::cout << std::endl;
return false;
}
}
if constexpr (S == dpct::group::store_algorithm::BLOCK_STORE_DIRECT) {
std::cout << func_name << "_blocked"
<< " passed\n";}
else{
std::cout << func_name << "_striped"
<< " passed\n";
}
return true;
}
bool subgroup_helper_validation_function(const int *ptr, const uint32_t *sg_sz,
const char *func_name) {
int expected[512];
int num_threads = 128;
int items_per_thread = 4;
uint32_t sg_sz_val = *sg_sz;
for (int i = 0; i < num_threads; ++i) {
for (int j = 0; j < items_per_thread; ++j) {
expected[items_per_thread * i + j] =
(i / sg_sz_val) * sg_sz_val * items_per_thread + sg_sz_val * j +
i % sg_sz_val;
}
}
for (int i = 0; i < 512; ++i) {
if (ptr[i] != i) {
std::cout << " failed\n";
std::ostream_iterator<int> Iter(std::cout, ", ");
std::copy(ptr, ptr + 512, Iter);
std::cout << std::endl;
return false;
}
}
std::cout << func_name << " pass\n";
return true;
}
template < dpct::group::store_algorithm S> bool test_group_store() {
// Tests dpct::group::workgroup_store using the specified store algorithm
sycl::queue q(dpct::get_default_queue());
int data[512];
int num_threads = 128;
int items_per_thread = 4;
if constexpr(S == dpct::group::store_algorithm::BLOCK_STORE_DIRECT) {
for (int i = 0; i < 512; i++) {data[i] = i;}
}
else{
for (int i = 0; i < num_threads; ++i) {
for (int j = 0; j < items_per_thread; ++j) {
data[i * items_per_thread + j] = j * num_threads + i;
}
}
}
int data_out[512];
sycl::buffer<int, 1> buffer(data, 512);
sycl::buffer<int, 1> buffer_out(data_out, 512);
q.submit([&](sycl::handler &h) {
using group_store =
dpct::group::workgroup_store<4, S, int, int *, sycl::nd_item<3>>;
size_t temp_storage_size = group_store::get_local_memory_size(128);
sycl::local_accessor<uint8_t, 1> tacc(sycl::range<1>(temp_storage_size), h);
sycl::accessor dacc_read(buffer, h, sycl::read_only);
sycl::accessor dacc_write(buffer_out, h, sycl::read_write);
h.parallel_for(
sycl::nd_range<3>(sycl::range<3>(1, 1, 128), sycl::range<3>(1, 1, 128)),
[=](sycl::nd_item<3> item) {
int thread_data[4];
int global_index =
item.get_group(2) * item.get_local_range().get(2) +
item.get_local_id(2);
#pragma unroll
for (int i = 0; i < 4; ++i) {
thread_data[i] = dacc_read[global_index * 4 + i];
}
auto *d_w =
dacc_write.get_multi_ptr<sycl::access::decorated::yes>().get();
auto *tmp = tacc.get_multi_ptr<sycl::access::decorated::yes>().get();
// Store thread_data of each work item from blocked arrangement
group_store(tmp).store(item, d_w, thread_data);
});
});
q.wait_and_throw();
sycl::host_accessor data_accessor(buffer_out, sycl::read_write);
const int *ptr = data_accessor.get_multi_ptr<sycl::access::decorated::yes>();
return helper_validation_function<S>(ptr, "test_group_store");
}
bool test_store_subgroup_striped_standalone() {
// Tests dpct::group::store_subgroup_striped as standalone method
sycl::queue q(dpct::get_default_queue());
int data[512];
for(int i=0;i<512;i++){data[i]=i;}
sycl::buffer<int, 1> buffer(data, 512);
sycl::buffer<uint32_t, 1> sg_sz_buf{sycl::range<1>(1)};
int data_out[512];
sycl::buffer<int, 1> buffer_out(data_out, 512);
q.submit([&](sycl::handler &h) {
sycl::accessor dacc_read(buffer, h, sycl::read_only);
sycl::accessor dacc_write(buffer_out, h, sycl::read_write);
sycl::accessor sg_sz_dacc(sg_sz_buf, h, sycl::read_write);
h.parallel_for(
sycl::nd_range<3>(sycl::range<3>(1, 1, 128), sycl::range<3>(1, 1, 128)),
[=](sycl::nd_item<3> item) {
int thread_data[4];
int global_index =
item.get_group(2) * item.get_local_range().get(2) +
item.get_local_id(2);
#pragma unroll
for (int i = 0; i < 4; ++i) {
thread_data[i] = dacc_read[global_index * 4 + i];
}
auto *d_w =
dacc_write.get_multi_ptr<sycl::access::decorated::yes>().get();
auto *sg_sz_acc =
sg_sz_dacc.get_multi_ptr<sycl::access::decorated::yes>().get();
size_t gid = item.get_global_linear_id();
if (gid == 0) {
sg_sz_acc[0] = item.get_sub_group().get_local_linear_range();
}
dpct::group::store_subgroup_striped<4, int>(item, d_w, thread_data);
// reapply global mapping
global_index =
(item.get_group(2) * item.get_local_range().get(2)) +
item.get_local_id(2); // Each thread_data has 4 elements
#pragma unroll
for (int i = 0; i < 4; ++i) {
dacc_write[global_index * 4 + i] = thread_data[i];
}
});
});
q.wait_and_throw();
sycl::host_accessor data_accessor(buffer_out, sycl::read_only);
const int *ptr = data_accessor.get_multi_ptr<sycl::access::decorated::yes>();
sycl::host_accessor data_accessor_sg(sg_sz_buf, sycl::read_only);
const uint32_t *ptr_sg =
data_accessor_sg.get_multi_ptr<sycl::access::decorated::yes>();
return subgroup_helper_validation_function(
ptr, ptr_sg, "test_subgroup_striped_standalone");
}
template <dpct::group::store_algorithm S> bool test_group_store_standalone() {
// Tests standalone methods for group store using the specified store algorithm
sycl::queue q(dpct::get_default_queue());
int data[512];
int num_threads = 128;
int items_per_thread = 4;
if constexpr(S == dpct::group::store_algorithm::BLOCK_STORE_DIRECT) {
for (int i = 0; i < 512; i++) {data[i] = i;}
}
else{
for (int i = 0; i < num_threads; ++i) {
for (int j = 0; j < items_per_thread; ++j) {
data[i * items_per_thread + j] = j * num_threads + i;
}
}
}
std::cout<<std::endl;
int data_out[512];
sycl::buffer<int, 1> buffer(data, 512);
sycl::buffer<int, 1> buffer_out(data_out, 512);
q.submit([&](sycl::handler &h) {
sycl::accessor dacc_read(buffer, h, sycl::read_only);
sycl::accessor dacc_write(buffer_out, h, sycl::read_write);
h.parallel_for(
sycl::nd_range<3>(sycl::range<3>(1, 1, 128), sycl::range<3>(1, 1, 128)),
[=](sycl::nd_item<3> item) {
int thread_data[4];
int global_index =
item.get_group(2) * item.get_local_range().get(2) +
item.get_local_id(2);
#pragma unroll
for (int i = 0; i < 4; ++i) {
thread_data[i] = dacc_read[global_index * 4 + i];
}
auto *d_w =
dacc_write.get_multi_ptr<sycl::access::decorated::yes>().get();
// Store thread_data of each work item from blocked arrangement
if (S == dpct::group::store_algorithm::BLOCK_STORE_DIRECT) {
dpct::group::store_blocked<4, int>(item, d_w, thread_data);
} else {
dpct::group::store_striped<4, int>(item, d_w, thread_data);
}
});
});
q.wait_and_throw();
sycl::host_accessor data_accessor(buffer_out, sycl::read_write);
const int *ptr = data_accessor.get_multi_ptr<sycl::access::decorated::yes>();
return helper_validation_function<S>(ptr, "test_group_load_store");
}
int main() {
return !(
// Calls test_group_load with blocked and striped strategies , should pass
// both results.
test_group_store<dpct::group::store_algorithm::BLOCK_STORE_DIRECT>() &&
test_group_store<dpct::group::store_algorithm::BLOCK_STORE_STRIPED>() &&
// Calls test_load_subgroup_striped_standalone and should pass
test_store_subgroup_striped_standalone() &&
// Calls test_group_load_standalone with blocked and striped strategies as
// free functions, should pass both results.
test_group_store_standalone<dpct::group::store_algorithm::BLOCK_STORE_DIRECT>() &&
test_group_store_standalone<dpct::group::store_algorithm::BLOCK_STORE_STRIPED>());
}