|
7 | 7 | #include "utils/logger.h" |
8 | 8 | #include <device.h> |
9 | 9 |
|
| 10 | +#include <limits> |
10 | 11 | #include <sycl/sycl.hpp> |
11 | 12 |
|
| 13 | +#if 1 |
| 14 | + |
| 15 | +namespace { |
| 16 | + using namespace device; |
| 17 | + |
| 18 | + template<ReductionType Type, typename T> |
| 19 | + T neutral() { |
| 20 | + if constexpr(Type == ReductionType::Sum) { |
| 21 | + return T(0); |
| 22 | + } |
| 23 | + if constexpr(Type == ReductionType::Max) { |
| 24 | + return std::numeric_limits<T>::min(); |
| 25 | + } |
| 26 | + if constexpr(Type == ReductionType::Min) { |
| 27 | + return std::numeric_limits<T>::max(); |
| 28 | + } |
| 29 | + return T(0); |
| 30 | + } |
| 31 | + |
| 32 | + template <ReductionType Type, typename AccT, typename VecT, typename OpT> void launchReduction(AccT* result, const VecT *buffer, size_t size, OpT operation, bool overrideResult, void* streamPtr) { |
| 33 | + |
| 34 | + constexpr auto DefaultValue = neutral<Type, AccT>(); |
| 35 | + |
| 36 | + ((sycl::queue *) streamPtr)->submit([&](sycl::handler &cgh) { |
| 37 | + sycl::local_accessor<AccT, 1> shmem(256, cgh); |
| 38 | + cgh.parallel_for(sycl::nd_range<1> { 1024, 1024 }, |
| 39 | + [=](sycl::nd_item<1> idx) { |
| 40 | + const auto threadIdx = idx.get_local_id(0); |
| 41 | + const auto blockDim = idx.get_group_size(0); |
| 42 | + const auto blockIdx = idx.get_group_id(0); |
| 43 | + const auto subgroup = idx.get_sub_group(); |
| 44 | + const auto sgSize = subgroup.get_local_size(); |
| 45 | + |
| 46 | + const auto warpCount = blockDim / sgSize; |
| 47 | + const auto currentWarp = threadIdx / sgSize; |
| 48 | + const auto threadInWarp = threadIdx % sgSize; |
| 49 | + const auto warpsNeeded = (size + sgSize - 1) / sgSize; |
| 50 | + |
| 51 | + auto acc = DefaultValue; |
| 52 | + |
| 53 | + #pragma unroll 4 |
| 54 | + for (std::size_t i = currentWarp; i < warpsNeeded; i += warpCount) { |
| 55 | + const auto id = threadInWarp + i * sgSize; |
| 56 | + auto value = (id < size) ? static_cast<AccT>(ntload(&buffer[id])) : DefaultValue; |
| 57 | + |
| 58 | + value = sycl::reduce_over_group(subgroup, value, operation); |
| 59 | + |
| 60 | + acc = operation(acc, value); |
| 61 | + } |
| 62 | + |
| 63 | + if (threadInWarp == 0) { |
| 64 | + shmem[currentWarp] = acc; |
| 65 | + } |
| 66 | + |
| 67 | + idx.barrier(); |
| 68 | + |
| 69 | + if (currentWarp == 0) { |
| 70 | + const auto lastWarpsNeeded = (warpCount + sgSize - 1) / sgSize; |
| 71 | + auto lastAcc = DefaultValue; |
| 72 | + #pragma unroll 2 |
| 73 | + for (int i = 0; i < lastWarpsNeeded; ++i) { |
| 74 | + const auto id = threadInWarp + i * sgSize; |
| 75 | + auto value = (id < warpCount) ? shmem[id] : DefaultValue; |
| 76 | + |
| 77 | + value = sycl::reduce_over_group(subgroup, value, operation); |
| 78 | + |
| 79 | + lastAcc = operation(lastAcc, value); |
| 80 | + } |
| 81 | + |
| 82 | + if (threadIdx.x == 0) { |
| 83 | + if (overrideResult) { |
| 84 | + ntstore(result, lastAcc); |
| 85 | + } |
| 86 | + else { |
| 87 | + ntstore(result, operation(ntload(result), lastAcc)); |
| 88 | + } |
| 89 | + } |
| 90 | + } |
| 91 | + }); |
| 92 | + }); |
| 93 | + } |
| 94 | +} |
| 95 | + |
| 96 | +namespace device { |
| 97 | +template <typename AccT, typename VecT> void Algorithms::reduceVector(AccT* result, const VecT *buffer, bool overrideResult, size_t size, ReductionType type, void* streamPtr) { |
| 98 | + switch (type) { |
| 99 | + case ReductionType::Add: { |
| 100 | + return launchReduction<ReductionType::Add>(result, buffer, size, sycl::plus<AccT>(), overrideResult, streamPtr); |
| 101 | + } |
| 102 | + case ReductionType::Max: { |
| 103 | + return launchReduction<ReductionType::Max>(result, buffer, size, sycl::maximum<AccT>(), overrideResult, streamPtr); |
| 104 | + } |
| 105 | + case ReductionType::Min: { |
| 106 | + return launchReduction<ReductionType::Min>(result, buffer, size, sycl::minimum<AccT>(), overrideResult, streamPtr); |
| 107 | + } |
| 108 | + } |
| 109 | +} |
| 110 | + |
| 111 | +#else |
| 112 | + |
12 | 113 | namespace { |
13 | 114 | template <typename AccT, typename VecT, typename S> void launchReduction(AccT* result, const VecT *buffer, size_t size, S reducer, void* streamPtr) { |
14 | 115 | ((sycl::queue *) streamPtr)->submit([&](sycl::handler &cgh) { |
@@ -43,6 +144,8 @@ template <typename AccT, typename VecT> void Algorithms::reduceVector(AccT* resu |
43 | 144 | } |
44 | 145 | } |
45 | 146 |
|
| 147 | +#endif |
| 148 | + |
46 | 149 | template void Algorithms::reduceVector(int* result, const int *buffer, bool overrideResult, size_t size, ReductionType type, void* streamPtr); |
47 | 150 | template void Algorithms::reduceVector(unsigned* result, const unsigned *buffer, bool overrideResult, size_t size, ReductionType type, void* streamPtr); |
48 | 151 | template void Algorithms::reduceVector(long* result, const int *buffer, bool overrideResult, size_t size, ReductionType type, void* streamPtr); |
|
0 commit comments