-
Notifications
You must be signed in to change notification settings - Fork 31
/
Copy pathonedpl_test_fill.cpp
460 lines (364 loc) · 14.4 KB
/
onedpl_test_fill.cpp
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
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
// ====------ onedpl_test_fill.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 "oneapi/dpl/execution"
#include "oneapi/dpl/iterator"
#include "oneapi/dpl/algorithm"
#include "dpct/dpct.hpp"
#include "dpct/dpl_utils.hpp"
#include <sycl/sycl.hpp>
#include <iostream>
template<typename String, typename _T1, typename _T2>
int ASSERT_EQUAL(String msg, _T1&& X, _T2&& Y) {
if(X!=Y) {
std::cout << "FAIL: " << msg << " - (" << X << "," << Y << ")" << std::endl;
return 1;
}
return 0;
}
int test_passed(int failing_elems, std::string test_name) {
if (failing_elems == 0) {
std::cout << "PASS: " << test_name << std::endl;
return 0;
}
return 1;
}
template<typename Buffer> void init_buffer(Buffer& src, int start_index, int end_index, uint64_t value) {
for (int i = start_index; i != end_index; ++i) {
src[i] = value;
}
}
template<typename Vector> void iota_vector(Vector& vec, int start_index, int end_index) {
for (int i = start_index; i != end_index; ++i) {
vec[i] = i;
}
}
int main() {
// used to detect failures
int failed_tests = 0;
int num_failing = 0;
// First 3 tests: Testing regular call to std::fill
{
// test 1/3
// create buffer
sycl::buffer<uint64_t, 1> src_buf{ sycl::range<1>(8) };
auto src_it = oneapi::dpl::begin(src_buf);
auto src_end_it = oneapi::dpl::end(src_buf);
{
auto src = src_it.get_buffer().template get_access<sycl::access::mode::write>();
init_buffer(src, 0, 8, 0);
}
// call algorithm
std::fill(oneapi::dpl::execution::dpcpp_default, src_it, src_it + 4, 2);
{
std::string test_name = "Regular call to std::fill 1/3";
auto src = src_it.get_buffer().template get_access<sycl::access::mode::read>();
for (int i = 0; i != 8; ++i) {
if (i < 4)
num_failing += ASSERT_EQUAL(test_name, src[i], 2);
else
num_failing += ASSERT_EQUAL(test_name, src[i], 0);
}
failed_tests += test_passed(num_failing, test_name);
num_failing = 0;
}
// test 2/3
{
auto src = src_it.get_buffer().template get_access<sycl::access::mode::write>();
init_buffer(src, 0, 8, 0);
}
// call algorithm:
std::fill(oneapi::dpl::execution::dpcpp_default, src_it + 2, src_end_it, 5);
{
std::string test_name = "Regular call to std::fill 2/3";
auto src = src_it.get_buffer().template get_access<sycl::access::mode::read>();
for (int i = 0; i != 8; ++i) {
if (i > 1)
num_failing += ASSERT_EQUAL(test_name, src[i], 5);
else
num_failing += ASSERT_EQUAL(test_name, src[i], 0);
}
failed_tests += test_passed(num_failing, test_name);
num_failing = 0;
}
// test 3/3
{
auto src = src_it.get_buffer().template get_access<sycl::access::mode::write>();
init_buffer(src, 0, 8, 0);
}
// call algorithm
std::fill(oneapi::dpl::execution::dpcpp_default, src_it + 2, src_it + 6, 3);
{
std::string test_name = "Regular call to std::fill 3/3";
auto src = src_it.get_buffer().template get_access<sycl::access::mode::read>();
for (int i = 0; i != 8; ++i) {
if (i > 1 && i < 6)
num_failing += ASSERT_EQUAL(test_name, src[i], 3);
else
num_failing += ASSERT_EQUAL(test_name, src[i], 0);
}
failed_tests += test_passed(num_failing, test_name);
num_failing = 0;
}
}
// Second 3 tests: Testing call to std::fill using make_permutation_iterator
{
// test 1/3
// create buffer
sycl::buffer<uint64_t, 1> src_buf{ sycl::range<1>(8) };
sycl::buffer<uint64_t, 1> map_buf{ sycl::range<1>(4) };
{
auto src = src_buf.template get_access<sycl::access::mode::write>();
auto map = map_buf.template get_access<sycl::access::mode::write>();
for (int i = 0; i != 8; ++i) {
src[i] = i;
}
map[0] = 7; map[1] = 6; map[2] = 5; map[3] = 4;
// src buffer: { 0, 1, 2, 3, 4, 5, 6, 7 }
// map buffer: { 7, 6, 5, 4 }
}
auto src_it = oneapi::dpl::begin(src_buf);
auto map_it = oneapi::dpl::begin(map_buf);
{
auto perm_begin = oneapi::dpl::make_permutation_iterator(src_it, map_it);
auto perm_end = perm_begin + 4;
// call algorithm
std::fill(oneapi::dpl::execution::dpcpp_default, perm_begin, perm_end, 20);
}
{
std::string test_name = "std::fill with perm_it 1/3";
auto src = src_it.get_buffer().template get_access<sycl::access::mode::read>();
for (int i = 0; i != 8; ++i) {
if (i < 4)
num_failing += ASSERT_EQUAL(test_name, src[i], i);
else
num_failing += ASSERT_EQUAL(test_name, src[i], 20);
}
failed_tests += test_passed(num_failing, test_name);
num_failing = 0;
}
// test 2/3
{
auto src = src_buf.template get_access<sycl::access::mode::write>();
auto map = map_buf.template get_access<sycl::access::mode::write>();
for (int i = 0; i != 8; ++i) {
src[i] = i;
}
map[0] = 3; map[1] = 0; map[2] = 2; map[3] = 1;
// src buffer: { 0, 1, 2, 3, 4, 5, 6, 7 }
// map buffer: { 3, 0, 2, 1 }
}
{
auto perm_begin = oneapi::dpl::make_permutation_iterator(src_it, map_it);
auto perm_end = perm_begin + 4;
// call algorithm
std::fill(oneapi::dpl::execution::dpcpp_default, perm_begin, perm_end, 20);
}
{
std::string test_name = "std::fill with perm_it 2/3";
auto src = src_it.get_buffer().template get_access<sycl::access::mode::read>();
for (int i = 0; i != 8; ++i) {
if (i < 4)
num_failing += ASSERT_EQUAL(test_name, src[i], 20);
else
num_failing += ASSERT_EQUAL(test_name, src[i], i);
}
failed_tests += test_passed(num_failing, test_name);
num_failing = 0;
}
// test 3/3
{
auto src = src_buf.template get_access<sycl::access::mode::write>();
auto map = map_buf.template get_access<sycl::access::mode::write>();
for (int i = 0; i != 8; ++i) {
src[i] = i;
}
map[0] = 2; map[1] = 4; map[2] = 3; map[3] = 5;
// src buffer: { 0, 1, 2, 3, 4, 5, 6, 7 }
// map buffer: { 2, 4, 3, 5 }
}
{
auto perm_begin = oneapi::dpl::make_permutation_iterator(src_it, map_it);
auto perm_end = perm_begin + 4;
// call algorithm
std::fill(oneapi::dpl::execution::dpcpp_default, perm_begin, perm_end, 20);
}
{
std::string test_name = "std::fill with perm_it 3/3";
auto src = src_it.get_buffer().template get_access<sycl::access::mode::read>();
for (int i = 0; i != 8; ++i) {
if (i > 1 && i < 6)
num_failing += ASSERT_EQUAL(test_name, src[i], 20);
else
num_failing += ASSERT_EQUAL(test_name, src[i], i);
}
failed_tests += test_passed(num_failing, test_name);
num_failing = 0;
}
}
// Third 3 tests: Testing call to std::fill using device_pointer<T>
// These tests assume USM is available, disable when it isn't
#ifndef DPCT_USM_LEVEL_NONE
{
// test 1/3
// create queue
sycl::queue myQueue;
auto dev = myQueue.get_device();
auto ctxt = myQueue.get_context();
// create host and device arrays
int hostArray[8];
int *deviceArray = (int*) malloc_device(8 * sizeof(int), dev, ctxt);
// fill hostArray with 0s
init_buffer(hostArray, 0, 8, 0);
myQueue.submit([&](sycl::handler& h) {
// copy hostArray to deviceArray
h.memcpy(deviceArray, hostArray, 8 * sizeof(int));
});
myQueue.wait();
{
auto dptr_begin = dpct::device_pointer<int>(deviceArray);
auto dptr_end = dpct::device_pointer<int>(deviceArray + 4);
// call algorithm
std::fill(oneapi::dpl::execution::dpcpp_default, dptr_begin, dptr_end, 12);
}
myQueue.submit([&](sycl::handler& h) {
// copy deviceArray back to hostArray
h.memcpy(hostArray, deviceArray, 8 * sizeof(int));
});
myQueue.wait();
std::string test_name = "std::fill with device_pointer<T> 1/3";
for (int i = 0; i != 8; ++i) {
if (i < 4)
num_failing += ASSERT_EQUAL(test_name, hostArray[i], 12);
else
num_failing += ASSERT_EQUAL(test_name, hostArray[i], 0);
}
failed_tests += test_passed(num_failing, test_name);
num_failing = 0;
// test 2/3
// fill hostArray again with 0s
init_buffer(hostArray, 0, 8, 0);
myQueue.submit([&](sycl::handler& h) {
// copy hostArray to deviceArray
h.memcpy(deviceArray, hostArray, 8 * sizeof(int));
});
myQueue.wait();
{
auto dptr_begin = dpct::device_pointer<int>(deviceArray + 4);
auto dptr_end = dpct::device_pointer<int>(deviceArray + 8);
// call algorithm
std::fill(oneapi::dpl::execution::dpcpp_default, dptr_begin, dptr_end, 12);
}
myQueue.submit([&](sycl::handler& h) {
// copy deviceArray back to hostArray
h.memcpy(hostArray, deviceArray, 8 * sizeof(int));
});
myQueue.wait();
test_name = "std::fill with device_pointer<T> 2/3";
for (int i = 0; i != 8; ++i) {
if (i > 3)
num_failing += ASSERT_EQUAL(test_name, hostArray[i], 12);
else
num_failing += ASSERT_EQUAL(test_name, hostArray[i], 0);
}
failed_tests += test_passed(num_failing, test_name);
num_failing = 0;
// test 3/3
// fill hostArray again with 0s
init_buffer(hostArray, 0, 8, 0);
myQueue.submit([&](sycl::handler& h) {
// copy hostArray to deviceArray
h.memcpy(deviceArray, hostArray, 8 * sizeof(int));
});
myQueue.wait();
{
auto dptr_begin = dpct::device_pointer<int>(deviceArray + 2);
auto dptr_end = dpct::device_pointer<int>(deviceArray + 6);
// call algorithm
std::fill(oneapi::dpl::execution::dpcpp_default, dptr_begin, dptr_end, 12);
}
myQueue.submit([&](sycl::handler& h) {
// copy deviceArray back to hostArray
h.memcpy(hostArray, deviceArray, 8 * sizeof(int));
});
myQueue.wait();
test_name = "std::fill with device_pointer<T> 3/3";
for (int i = 0; i != 8; ++i) {
if (i > 1 && i < 6)
num_failing += ASSERT_EQUAL(test_name, hostArray[i], 12);
else
num_failing += ASSERT_EQUAL(test_name, hostArray[i], 0);
}
failed_tests += test_passed(num_failing, test_name);
num_failing = 0;
}
// std::fill_n tests
{
// test 1/2: call to std::fill_n using device_pointer<T>
// create queue
sycl::queue myQueue;
auto dev = myQueue.get_device();
auto ctxt = myQueue.get_context();
// create host and device arrays
float hostArray[8];
float *deviceArray = (float*) malloc_device(8 * sizeof(float), dev, ctxt);
// fill hostArray with 0s
iota_vector(hostArray, 0, 8);
myQueue.submit([&](sycl::handler& h) {
// copy hostArray to deviceArray
h.memcpy(deviceArray, hostArray, 8 * sizeof(float));
});
myQueue.wait();
{
auto dptr_begin = dpct::device_pointer<float>(deviceArray + 2);
// call algorithm
std::fill_n(oneapi::dpl::execution::make_device_policy(myQueue), dptr_begin, 4, 10.5f);
}
myQueue.submit([&](sycl::handler& h) {
// copy deviceArray back to hostArray
h.memcpy(hostArray, deviceArray, 8 * sizeof(float));
});
myQueue.wait();
std::string test_name = "std::fill_n with device_pointer<T> 1/2";
for (int i = 0; i != 8; ++i) {
if (i > 1 && i < 6)
num_failing += ASSERT_EQUAL(test_name, hostArray[i], 10.5);
else
num_failing += ASSERT_EQUAL(test_name, hostArray[i], i);
}
failed_tests += test_passed(num_failing, test_name);
num_failing = 0;
}
#endif //DPCT_USM_LEVEL_NONE
{
// test 2/2: call to std::fill_n using device_vector<T>
// create device_vector and src vector
std::vector<int> src(8);
iota_vector(src, 0, 8);
dpct::device_vector<int> dv(src);
dpct::get_default_queue().wait();
{
// call algorithm on dv
std::fill_n(oneapi::dpl::execution::make_device_policy(dpct::get_default_queue()), dv.begin(), 4, 10);
}
std::string test_name = "std::fill_n with device_pointer<T> 2/2";
for (int i = 0; i != 8; ++i) {
if (i < 4)
num_failing += ASSERT_EQUAL(test_name, dv[i], 10);
else
num_failing += ASSERT_EQUAL(test_name, dv[i], i);
}
failed_tests += test_passed(num_failing, test_name);
num_failing = 0;
}
std::cout << std::endl << failed_tests << " failing test(s) detected." << std::endl;
if (failed_tests == 0) {
return 0;
}
return 1;
}