-
Notifications
You must be signed in to change notification settings - Fork 11
Expand file tree
/
Copy pathekat_pack_kokkos.hpp
More file actions
640 lines (569 loc) · 24.5 KB
/
Copy pathekat_pack_kokkos.hpp
File metadata and controls
640 lines (569 loc) · 24.5 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
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
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
#ifndef EKAT_PACK_KOKKOS_HPP
#define EKAT_PACK_KOKKOS_HPP
#include "ekat/ekat.hpp"
#include "ekat/ekat_pack.hpp"
#include "ekat/kokkos/ekat_kokkos_utils.hpp"
#include <vector>
#include <type_traits>
namespace ekat {
/* These functions combine Pack, Mask, and Kokkos::Views.
*/
// Index a scalar array with Pack indices, returning a compatible Pack of array
// values.
template<typename Array1, typename IdxPack> KOKKOS_INLINE_FUNCTION
OnlyPackReturn<IdxPack, Pack<typename Array1::non_const_value_type, IdxPack::n> >
index (const Array1& a, const IdxPack& i0,
typename std::enable_if<Array1::Rank == 1>::type* = nullptr) {
Pack<typename Array1::non_const_value_type, IdxPack::n> p;
vector_simd for (int i = 0; i < IdxPack::n; ++i)
p[i] = a(i0[i]);
return p;
}
template<typename Array2, typename IdxPack> KOKKOS_INLINE_FUNCTION
OnlyPackReturn<IdxPack, Pack<typename Array2::non_const_value_type, IdxPack::n> >
index (const Array2& a, const IdxPack& i0, const IdxPack& i1,
typename std::enable_if<Array2::Rank == 2>::type* = nullptr) {
Pack<typename Array2::non_const_value_type, IdxPack::n> p;
vector_simd for (int i = 0; i < IdxPack::n; ++i)
p[i] = a(i0[i], i1[i]);
return p;
}
template<typename Array3, typename IdxPack> KOKKOS_INLINE_FUNCTION
OnlyPackReturn<IdxPack, Pack<typename Array3::non_const_value_type, IdxPack::n> >
index (const Array3& a, const IdxPack& i0, const IdxPack& i1, const IdxPack& i2,
typename std::enable_if<Array3::Rank == 3>::type* = nullptr) {
Pack<typename Array3::non_const_value_type, IdxPack::n> p;
vector_simd for (int i = 0; i < IdxPack::n; ++i)
p[i] = a(i0[i], i1[i], i2[i]);
return p;
}
template<typename Array4, typename IdxPack> KOKKOS_INLINE_FUNCTION
OnlyPackReturn<IdxPack, Pack<typename Array4::non_const_value_type, IdxPack::n> >
index (const Array4& a, const IdxPack& i0, const IdxPack& i1, const IdxPack& i2, const IdxPack& i3,
typename std::enable_if<Array4::Rank == 4>::type* = nullptr) {
Pack<typename Array4::non_const_value_type, IdxPack::n> p;
vector_simd for (int i = 0; i < IdxPack::n; ++i)
p[i] = a(i0[i], i1[i], i2[i], i3[i]);
return p;
}
template<typename Array5, typename IdxPack> KOKKOS_INLINE_FUNCTION
OnlyPackReturn<IdxPack, Pack<typename Array5::non_const_value_type, IdxPack::n> >
index (const Array5& a, const IdxPack& i0, const IdxPack& i1, const IdxPack& i2, const IdxPack& i3, const IdxPack& i4,
typename std::enable_if<Array5::Rank == 5>::type* = nullptr) {
Pack<typename Array5::non_const_value_type, IdxPack::n> p;
vector_simd for (int i = 0; i < IdxPack::n; ++i)
p[i] = a(i0[i], i1[i], i2[i], i3[i], i4[i]);
return p;
}
// Index a scalar array with Pack indices, returning a two compatible Packs of array
// values, one with the indexes shifted by Shift. This is useful for implementing
// functions like:
// y2(k2) = y1(k1) + y1(k1+1);
// which becomes
// index_and_shift<1>(y1, kpk, y1k, y1k1);
// y2(k2) = y1k + y1k1
template<int Shift, typename Array1, typename IdxPack> KOKKOS_INLINE_FUNCTION
void
index_and_shift (const Array1& a, const IdxPack& i0, Pack<typename Array1::non_const_value_type, IdxPack::n>& index, Pack<typename Array1::non_const_value_type, IdxPack::n>& index_shift,
typename std::enable_if<Array1::Rank == 1>::type* = nullptr) {
vector_simd for (int i = 0; i < IdxPack::n; ++i) {
const auto i0i = i0[i];
index[i] = a(i0i);
index_shift[i] = a(i0i + Shift);
}
}
// Turn a View of Packs into a View of scalars.
// Example: const auto b = scalarize(a);
// 4d
template <typename T, typename ...Parms, int pack_size> KOKKOS_FORCEINLINE_FUNCTION
Unmanaged<Kokkos::View<T****, Parms...> >
scalarize (const Kokkos::View<Pack<T, pack_size>****, Parms...>& vp) {
return Unmanaged<Kokkos::View<T****, Parms...> >(
reinterpret_cast<T*>(vp.data()),
vp.extent_int(0), vp.extent_int(1), vp.extent_int(2),
pack_size * vp.extent_int(3));
}
// 4d const
template <typename T, typename ...Parms, int pack_size> KOKKOS_FORCEINLINE_FUNCTION
Unmanaged<Kokkos::View<const T****, Parms...> >
scalarize (const Kokkos::View<const Pack<T, pack_size>****, Parms...>& vp) {
return Unmanaged<Kokkos::View<const T****, Parms...> >(
reinterpret_cast<const T*>(vp.data()),
vp.extent_int(0), vp.extent_int(1), vp.extent_int(2),
pack_size * vp.extent_int(3));
}
// 3d
template <typename T, typename ...Parms, int pack_size> KOKKOS_FORCEINLINE_FUNCTION
Unmanaged<Kokkos::View<T***, Parms...> >
scalarize (const Kokkos::View<Pack<T, pack_size>***, Parms...>& vp) {
return Unmanaged<Kokkos::View<T***, Parms...> >(
reinterpret_cast<T*>(vp.data()), vp.extent_int(0), vp.extent_int(1),
pack_size * vp.extent_int(2));
}
// 3d const
template <typename T, typename ...Parms, int pack_size> KOKKOS_FORCEINLINE_FUNCTION
Unmanaged<Kokkos::View<const T***, Parms...> >
scalarize (const Kokkos::View<const Pack<T, pack_size>***, Parms...>& vp) {
return Unmanaged<Kokkos::View<const T***, Parms...> >(
reinterpret_cast<const T*>(vp.data()), vp.extent_int(0), vp.extent_int(1),
pack_size * vp.extent_int(2));
}
// 2d
template <typename T, typename ...Parms, int pack_size> KOKKOS_FORCEINLINE_FUNCTION
Unmanaged<Kokkos::View<T**, Parms...> >
scalarize (const Kokkos::View<Pack<T, pack_size>**, Parms...>& vp) {
return Unmanaged<Kokkos::View<T**, Parms...> >(
reinterpret_cast<T*>(vp.data()), vp.extent_int(0), pack_size * vp.extent_int(1));
}
// 2d const
template <typename T, typename ...Parms, int pack_size> KOKKOS_FORCEINLINE_FUNCTION
Unmanaged<Kokkos::View<const T**, Parms...> >
scalarize (const Kokkos::View<const Pack<T, pack_size>**, Parms...>& vp) {
return Unmanaged<Kokkos::View<const T**, Parms...> >(
reinterpret_cast<const T*>(vp.data()), vp.extent_int(0), pack_size * vp.extent_int(1));
}
// 1d
template <typename T, typename ...Parms, int pack_size> KOKKOS_FORCEINLINE_FUNCTION
Unmanaged<Kokkos::View<T*, Parms...> >
scalarize (const Kokkos::View<Pack<T, pack_size>*, Parms...>& vp) {
return Unmanaged<Kokkos::View<T*, Parms...> >(
reinterpret_cast<T*>(vp.data()), pack_size * vp.extent_int(0));
}
// 1d const
template <typename T, typename ...Parms, int pack_size> KOKKOS_FORCEINLINE_FUNCTION
Unmanaged<Kokkos::View<const T*, Parms...> >
scalarize (const Kokkos::View<const Pack<T, pack_size>*, Parms...>& vp) {
return Unmanaged<Kokkos::View<const T*, Parms...> >(
reinterpret_cast<const T*>(vp.data()), pack_size * vp.extent_int(0));
}
// Turn a View of Pack<T,N>s into a View of Pack<T,M>s.
// Requirement: the smaller number must divide the larger one:
// max(M,N) % min(M,N) == 0.
// Example: const auto b = repack<4>(a);
// Helper struct
template<int N, typename OldPackT>
struct RepackType;
template<int N, typename T, int M>
struct RepackType <N,Pack<T,M>>{
using type = Pack<T,N>;
};
template<int N, typename T, int M>
struct RepackType <N,const Pack<T,M>>{
using type = const Pack<T,N>;
};
// 2d shrinking
template <typename NewPackT, typename OldPackT, typename... ViewProps>
KOKKOS_FORCEINLINE_FUNCTION
typename std::enable_if<NewPackT::packtag && OldPackT::packtag &&
std::is_same<typename NewPackT::scalar,typename OldPackT::scalar>::value &&
(OldPackT::n > NewPackT::n),
Unmanaged<Kokkos::View<NewPackT**,ViewProps...>>
>::type
repack_impl (const Kokkos::View<OldPackT**, ViewProps...>& vp) {
constexpr auto new_pack_size = NewPackT::n;
constexpr auto old_pack_size = OldPackT::n;
static_assert(new_pack_size > 0 &&
old_pack_size % new_pack_size == 0,
"New pack size must divide old pack size.");
return Unmanaged<Kokkos::View<NewPackT**, ViewProps...> >(
reinterpret_cast<NewPackT*>(vp.data()),
vp.extent_int(0),
(old_pack_size / new_pack_size) * vp.extent_int(1));
}
// 2d growing
template <typename NewPackT, typename OldPackT, typename... ViewProps>
KOKKOS_FORCEINLINE_FUNCTION
typename std::enable_if<NewPackT::packtag && OldPackT::packtag &&
std::is_same<typename NewPackT::scalar,typename OldPackT::scalar>::value &&
(OldPackT::n < NewPackT::n),
Unmanaged<Kokkos::View<NewPackT**,ViewProps...>>
>::type
repack_impl (const Kokkos::View<OldPackT**, ViewProps...>& vp) {
constexpr auto new_pack_size = NewPackT::n;
constexpr auto old_pack_size = OldPackT::n;
static_assert(old_pack_size > 0 &&
new_pack_size % old_pack_size == 0,
"Old pack size must divide new pack size.");
return Unmanaged<Kokkos::View<NewPackT**, ViewProps...> >(
reinterpret_cast<NewPackT*>(vp.data()),
vp.extent_int(0),
(new_pack_size / old_pack_size) * vp.extent_int(1));
}
// 2d staying the same
template <typename NewPackT, typename OldPackT, typename... ViewProps>
KOKKOS_FORCEINLINE_FUNCTION
typename std::enable_if<NewPackT::packtag && OldPackT::packtag &&
std::is_same<typename NewPackT::scalar,typename OldPackT::scalar>::value &&
(OldPackT::n == NewPackT::n),
Unmanaged<Kokkos::View<NewPackT**,ViewProps...>>
>::type
repack_impl (const Kokkos::View<OldPackT**, ViewProps...>& vp) {
return vp;
}
// General access point for repack (calls one of the three above)
template <int N, typename OldPackT, typename... ViewProps>
KOKKOS_FORCEINLINE_FUNCTION
Unmanaged<Kokkos::View<typename RepackType<N,OldPackT>::type**,ViewProps...>>
repack (const Kokkos::View<OldPackT**, ViewProps...>& vp) {
return repack_impl<typename RepackType<N,OldPackT>::type>(vp);
}
// 1d shrinking
template <typename NewPackT, typename OldPackT, typename... ViewProps>
KOKKOS_FORCEINLINE_FUNCTION
typename std::enable_if<NewPackT::packtag && OldPackT::packtag &&
std::is_same<typename NewPackT::scalar,typename OldPackT::scalar>::value &&
(OldPackT::n > NewPackT::n),
Unmanaged<Kokkos::View<NewPackT*,ViewProps...>>
>::type
repack_impl (const Kokkos::View<OldPackT*, ViewProps...>& vp) {
constexpr auto new_pack_size = NewPackT::n;
constexpr auto old_pack_size = OldPackT::n;
static_assert(new_pack_size > 0 &&
old_pack_size % new_pack_size == 0,
"New pack size must divide old pack size.");
return Unmanaged<Kokkos::View<NewPackT*, ViewProps...> >(
reinterpret_cast<NewPackT*>(vp.data()),
(old_pack_size / new_pack_size) * vp.extent_int(0));
}
// 1d growing
template <typename NewPackT, typename OldPackT, typename... ViewProps>
KOKKOS_FORCEINLINE_FUNCTION
typename std::enable_if<NewPackT::packtag && OldPackT::packtag &&
std::is_same<typename NewPackT::scalar,typename OldPackT::scalar>::value &&
(OldPackT::n < NewPackT::n),
Unmanaged<Kokkos::View<NewPackT*,ViewProps...>>
>::type
repack_impl (const Kokkos::View<OldPackT*, ViewProps...>& vp) {
constexpr auto new_pack_size = NewPackT::n;
constexpr auto old_pack_size = OldPackT::n;
static_assert(new_pack_size > 0 &&
new_pack_size % old_pack_size == 0,
"Old pack size must divide new pack size.");
EKAT_KERNEL_ASSERT(vp.extent_int(0) % (new_pack_size / old_pack_size) == 0);
return Unmanaged<Kokkos::View<NewPackT*, ViewProps...> >(
reinterpret_cast<NewPackT*>(vp.data()),
vp.extent_int(0) / (new_pack_size / old_pack_size));
}
// 1d staying the same
template <typename NewPackT, typename OldPackT, typename... ViewProps>
KOKKOS_FORCEINLINE_FUNCTION
typename std::enable_if<NewPackT::packtag && OldPackT::packtag &&
std::is_same<typename NewPackT::scalar,typename OldPackT::scalar>::value &&
(OldPackT::n == NewPackT::n),
Unmanaged<Kokkos::View<NewPackT*,ViewProps...>>
>::type
repack_impl (const Kokkos::View<OldPackT*, ViewProps...>& vp) {
return vp;
}
// General access point for repack (calls one of the three above)
template <int N, typename OldPackT, typename... ViewProps>
KOKKOS_FORCEINLINE_FUNCTION
Unmanaged<Kokkos::View<typename RepackType<N,OldPackT>::type*,ViewProps...>>
repack (const Kokkos::View<OldPackT*, ViewProps...>& vp) {
return repack_impl<typename RepackType<N,OldPackT>::type>(vp);
}
//
// Take an array of Host scalar pointers and turn them into device pack views
//
template <typename T>
struct HTDVectorT
{ using type = T; };
template<>
struct HTDVectorT<bool>
{
static_assert(
sizeof(bool) == sizeof(char),
"host_to_device/device_to_host use vectors as flexible memory buffers "
"and they make use of vector API calls that are not available in the "
"vector<bool> specialization, so if a user is sending bool data, we must "
"use vector<char> instead and reinterpret the data as bool*. This is only "
"valid if chars and bools are the same size");
using type = char;
};
// 1d
template <typename SizeT, typename ViewT>
void host_to_device(const std::vector<typename ViewT::value_type::scalar const*>& data,
const std::vector<SizeT>& sizes,
std::vector<ViewT>& views)
{
using PackT = typename ViewT::value_type;
EKAT_ASSERT(data.size() == sizes.size());
EKAT_ASSERT(data.size() == sizes.size());
for (size_t i = 0; i < data.size(); ++i) {
const size_t size = static_cast<size_t>(sizes[i]);
const size_t npack = (size + PackT::n - 1) / PackT::n;
views[i] = ViewT("", npack);
auto host_view = Kokkos::create_mirror_view(views[i]);
for (size_t k = 0; k < npack; ++k) {
const size_t scalar_offset = k*PackT::n;
for (size_t s = 0; s < PackT::n && scalar_offset+s < size; ++s) {
host_view(k)[s] = data[i][scalar_offset + s];
}
}
Kokkos::deep_copy(views[i], host_view);
}
}
// 2d - set do_transpose to true if host data is coming from fortran
template <typename SizeT, typename ViewT>
void host_to_device(const std::vector<typename ViewT::value_type::scalar const*>& data,
const std::vector<SizeT>& dim1_sizes,
const std::vector<SizeT>& dim2_sizes,
std::vector<ViewT>& views,
bool do_transpose=false)
{
using PackT = typename ViewT::value_type;
using ScalarT = typename PackT::scalar;
using VectorT = typename HTDVectorT<ScalarT>::type;
EKAT_ASSERT(data.size() == dim1_sizes.size());
EKAT_ASSERT(data.size() == dim2_sizes.size());
EKAT_ASSERT(data.size() == views.size());
std::vector<VectorT> tdata;
for (size_t n = 0; n < data.size(); ++n) {
const size_t dim1_size = static_cast<size_t>(dim1_sizes[n]);
const size_t dim2_size = static_cast<size_t>(dim2_sizes[n]);
const size_t npack = (dim2_size + PackT::n - 1) / PackT::n;
views[n] = ViewT("", dim1_size, npack);
auto host_view = Kokkos::create_mirror_view(views[n]);
ScalarT* the_data = nullptr;
if (do_transpose) {
tdata.reserve(dim1_size * dim2_size);
the_data = reinterpret_cast<ScalarT*>(tdata.data());
transpose<TransposeDirection::f2c>(data[n], the_data, dim1_size, dim2_size);
}
else {
the_data = const_cast<ScalarT*>(data[n]);
}
for (size_t i = 0; i < dim1_size; ++i) {
for (size_t k = 0; k < npack; ++k) {
const size_t num_scalars_this_col = k*PackT::n;
const size_t scalar_offset = i*dim2_size + num_scalars_this_col;
for (size_t s = 0; s < PackT::n && num_scalars_this_col+s < dim2_size; ++s) {
host_view(i, k)[s] = the_data[scalar_offset + s];
}
}
}
Kokkos::deep_copy(views[n], host_view);
}
}
// 3d - set do_transpose to true if host data is coming from fortran
template <typename SizeT, typename ViewT>
void host_to_device(const std::vector<typename ViewT::value_type::scalar const*>& data,
const std::vector<SizeT>& dim1_sizes,
const std::vector<SizeT>& dim2_sizes,
const std::vector<SizeT>& dim3_sizes,
std::vector<ViewT>& views,
bool do_transpose=false)
{
using PackT = typename ViewT::value_type;
using ScalarT = typename PackT::scalar;
using VectorT = typename HTDVectorT<ScalarT>::type;
EKAT_ASSERT(data.size() == dim1_sizes.size());
EKAT_ASSERT(data.size() == dim2_sizes.size());
EKAT_ASSERT(data.size() == dim3_sizes.size());
EKAT_ASSERT(data.size() == views.size());
std::vector<VectorT> tdata;
for (size_t n = 0; n < data.size(); ++n) {
const size_t dim1_size = static_cast<size_t>(dim1_sizes[n]);
const size_t dim2_size = static_cast<size_t>(dim2_sizes[n]);
const size_t dim3_size = static_cast<size_t>(dim3_sizes[n]);
const size_t npack = (dim3_size + PackT::n - 1) / PackT::n;
views[n] = ViewT("", dim1_size, dim2_size, npack);
auto host_view = Kokkos::create_mirror_view(views[n]);
ScalarT* the_data = nullptr;
if (do_transpose) {
tdata.reserve(dim1_size * dim2_size * dim3_size);
the_data = reinterpret_cast<ScalarT*>(tdata.data());
transpose<TransposeDirection::f2c>(data[n], the_data, dim1_size, dim2_size, dim3_size);
}
else {
the_data = const_cast<ScalarT*>(data[n]);
}
for (size_t i = 0; i < dim1_size; ++i) {
for (size_t k = 0; k < dim2_size; ++k) {
for (size_t p = 0; p < npack; ++p) {
const size_t num_scalars_this_col = p*PackT::n;
const size_t scalar_offset = i*(dim2_size*dim3_size) + k*dim3_size + num_scalars_this_col;
for (size_t s = 0; s < PackT::n && num_scalars_this_col+s < dim3_size; ++s) {
host_view(i, k, p)[s] = the_data[scalar_offset + s];
}
}
}
}
Kokkos::deep_copy(views[n], host_view);
}
}
// Sugar for when size is uniform (1d)
template <typename SizeT, typename ViewT>
void host_to_device(const std::vector<typename ViewT::value_type::scalar const*>& data,
const SizeT size,
std::vector<ViewT>& views)
{
std::vector<SizeT> sizes(data.size(), size);
host_to_device(data, sizes, views);
}
// Sugar for when size is uniform (2d)
template <typename SizeT, typename ViewT>
void host_to_device(const std::vector<typename ViewT::value_type::scalar const*>& data,
const SizeT dim1_size, const SizeT dim2_size,
std::vector<ViewT>& views,
bool do_transpose=false)
{
std::vector<SizeT> dim1_sizes(data.size(), dim1_size), dim2_sizes(data.size(), dim2_size);
host_to_device(data, dim1_sizes, dim2_sizes, views, do_transpose);
}
// Sugar for when size is uniform (3d)
template <typename SizeT, typename ViewT>
void host_to_device(const std::vector<typename ViewT::value_type::scalar const*>& data,
const SizeT dim1_size, const SizeT dim2_size, const SizeT dim3_size,
std::vector<ViewT>& views,
bool do_transpose=false)
{
std::vector<SizeT> dim1_sizes(data.size(), dim1_size), dim2_sizes(data.size(), dim2_size), dim3_sizes(data.size(), dim3_size);
host_to_device(data, dim1_sizes, dim2_sizes, dim3_sizes, views, do_transpose);
}
//
// Take an array of device pack views and sync them to host scalar pointers
//
// 1d
template <typename SizeT, typename ViewT>
void device_to_host(const std::vector<typename ViewT::value_type::scalar*>& data,
const std::vector<SizeT>& sizes,
std::vector<ViewT>& views)
{
using PackT = typename ViewT::value_type;
EKAT_ASSERT(data.size() == sizes.size());
EKAT_ASSERT(data.size() == sizes.size());
for (size_t i = 0; i < data.size(); ++i) {
const size_t size = static_cast<size_t>(sizes[i]);
const auto host_view = Kokkos::create_mirror_view(views[i]);
Kokkos::deep_copy(host_view, views[i]);
for (size_t k = 0; k < views[i].extent(0); ++k) {
const size_t scalar_offset = k*PackT::n;
for (size_t s = 0; s < PackT::n && scalar_offset+s < size; ++s) {
data[i][scalar_offset + s] = host_view(k)[s];
}
}
}
}
// 2d - set do_transpose to true if host data is going to fortran
template <typename SizeT, typename ViewT>
void device_to_host(const std::vector<typename ViewT::value_type::scalar*>& data,
const std::vector<SizeT>& dim1_sizes,
const std::vector<SizeT>& dim2_sizes,
std::vector<ViewT>& views,
bool do_transpose=false)
{
using PackT = typename ViewT::value_type;
using ScalarT = typename PackT::scalar;
using VectorT = typename HTDVectorT<ScalarT>::type;
EKAT_ASSERT(data.size() == dim1_sizes.size());
EKAT_ASSERT(data.size() == dim2_sizes.size());
EKAT_ASSERT(data.size() == views.size());
std::vector<VectorT> tdata;
for (size_t n = 0; n < data.size(); ++n) {
const size_t dim1_size = static_cast<size_t>(dim1_sizes[n]);
const size_t dim2_size = static_cast<size_t>(dim2_sizes[n]);
const size_t npack = views[n].extent(1);
const auto host_view = Kokkos::create_mirror_view(views[n]);
Kokkos::deep_copy(host_view, views[n]);
ScalarT* the_data = nullptr;
if (do_transpose) {
tdata.reserve(dim1_size * dim2_size);
the_data = reinterpret_cast<ScalarT*>(tdata.data());
}
else {
the_data = data[n];
}
for (size_t i = 0; i < dim1_size; ++i) {
for (size_t k = 0; k < npack; ++k) {
const size_t num_scalars_this_col = k*PackT::n;
const size_t scalar_offset = i*dim2_size + num_scalars_this_col;
for (size_t s = 0; s < PackT::n && num_scalars_this_col+s < dim2_size; ++s) {
the_data[scalar_offset + s] = host_view(i, k)[s];
}
}
}
if (do_transpose) {
transpose<TransposeDirection::c2f>(the_data, data[n], dim1_size, dim2_size);
}
}
}
// 3d - set do_transpose to true if host data is going to fortran
template <typename SizeT, typename ViewT>
void device_to_host(const std::vector<typename ViewT::value_type::scalar*>& data,
const std::vector<SizeT>& dim1_sizes,
const std::vector<SizeT>& dim2_sizes,
const std::vector<SizeT>& dim3_sizes,
std::vector<ViewT>& views,
bool do_transpose=false)
{
using PackT = typename ViewT::value_type;
using ScalarT = typename PackT::scalar;
using VectorT = typename HTDVectorT<ScalarT>::type;
EKAT_ASSERT(data.size() == dim1_sizes.size());
EKAT_ASSERT(data.size() == dim2_sizes.size());
EKAT_ASSERT(data.size() == dim3_sizes.size());
EKAT_ASSERT(data.size() == views.size());
std::vector<VectorT> tdata;
for (size_t n = 0; n < data.size(); ++n) {
const size_t dim1_size = static_cast<size_t>(dim1_sizes[n]);
const size_t dim2_size = static_cast<size_t>(dim2_sizes[n]);
const size_t dim3_size = static_cast<size_t>(dim3_sizes[n]);
const size_t npack = views[n].extent(2);
const auto host_view = Kokkos::create_mirror_view(views[n]);
Kokkos::deep_copy(host_view, views[n]);
ScalarT* the_data = nullptr;
if (do_transpose) {
tdata.reserve(dim1_size * dim2_size * dim3_size);
the_data = reinterpret_cast<ScalarT*>(tdata.data());
}
else {
the_data = data[n];
}
for (size_t i = 0; i < dim1_size; ++i) {
for (size_t k = 0; k < dim2_size; ++k) {
for (size_t p = 0; p < npack; ++p) {
const size_t num_scalars_this_col = p*PackT::n;
const size_t scalar_offset = i*(dim2_size*dim3_size) + k*dim3_size + num_scalars_this_col;
for (size_t s = 0; s < PackT::n && num_scalars_this_col+s < dim3_size; ++s) {
the_data[scalar_offset + s] = host_view(i, k, p)[s];
}
}
}
}
if (do_transpose) {
transpose<TransposeDirection::c2f>(the_data, data[n], dim1_size, dim2_size, dim3_size);
}
}
}
// Sugar for when size is uniform (1d)
template <typename SizeT, typename ViewT>
void device_to_host(const std::vector<typename ViewT::value_type::scalar*>& data,
const SizeT size,
std::vector<ViewT>& views)
{
std::vector<SizeT> sizes(data.size(), size);
device_to_host(data, sizes, views);
}
// Sugar for when size is uniform (2d)
template <typename SizeT, typename ViewT>
void device_to_host(const std::vector<typename ViewT::value_type::scalar*>& data,
const SizeT dim1_size, const SizeT dim2_size,
std::vector<ViewT>& views,
bool do_transpose=false)
{
std::vector<SizeT> dim1_sizes(data.size(), dim1_size), dim2_sizes(data.size(), dim2_size);
device_to_host(data, dim1_sizes, dim2_sizes, views, do_transpose);
}
// Sugar for when size is uniform (3d)
template <typename SizeT, typename ViewT>
void device_to_host(const std::vector<typename ViewT::value_type::scalar*>& data,
const SizeT dim1_size, const SizeT dim2_size, const SizeT dim3_size,
std::vector<ViewT>& views,
bool do_transpose=false)
{
std::vector<SizeT> dim1_sizes(data.size(), dim1_size), dim2_sizes(data.size(), dim2_size), dim3_sizes(data.size(), dim3_size);
device_to_host(data, dim1_sizes, dim2_sizes, dim3_sizes, views, do_transpose);
}
} // namespace ekat
#endif // EKAT_PACK_KOKKOS_HPP