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
|
/* **************************************************************************
* Copyright (C) 2018-2024 Advanced Micro Devices, Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
* *************************************************************************/
#pragma once
#include <ostream>
#include <string.h>
#include "common/misc/data_initializer.hpp"
//
// Local declaration of the device batch vector.
//
template <typename T, size_t PAD, typename U>
class device_batch_vector;
//!
//! @brief Implementation of the batch vector on host.
//!
template <typename T>
class host_batch_vector
{
public:
using value_type = T;
public:
//!
//! @brief Delete copy constructor.
//!
host_batch_vector(const host_batch_vector<T>& that) = delete;
//!
//! @brief Delete copy assignement.
//!
host_batch_vector& operator=(const host_batch_vector<T>& that) = delete;
//!
//! @brief Constructor.
//! @param n The length of the vector.
//! @param inc The increment.
//! @param batch_count The batch count.
//!
explicit host_batch_vector(int64_t n, int64_t inc, int64_t batch_count)
: m_n(n)
, m_inc(inc)
, m_batch_count(batch_count)
{
if(false == this->try_initialize_memory())
{
this->free_memory();
}
}
//!
//! @brief Constructor.
//! @param n The length of the vector.
//! @param inc The increment.
//! @param stride (UNUSED) The stride.
//! @param batch_count The batch count.
//!
explicit host_batch_vector(int64_t n, int64_t inc, rocblas_stride stride, int64_t batch_count)
: host_batch_vector(n, inc, batch_count)
{
}
//!
//! @brief Destructor.
//!
~host_batch_vector()
{
this->free_memory();
}
//!
//! @brief Returns the length of the vector.
//!
int64_t n() const
{
return this->m_n;
}
//!
//! @brief Returns the increment of the vector.
//!
int64_t inc() const
{
return this->m_inc;
}
//!
//! @brief Returns the batch count.
//!
int64_t batch_count() const
{
return this->m_batch_count;
}
//!
//! @brief Returns the stride value.
//!
rocblas_stride stride() const
{
return 0;
}
//!
//! @brief Random access.
//! @param batch_index The batch index.
//! @return Pointer to the array on host.
//!
T* operator[](int64_t batch_index)
{
return this->m_data[batch_index];
}
//!
//! @brief Constant random access.
//! @param batch_index The batch index.
//! @return Constant pointer to the array on host.
//!
const T* operator[](int64_t batch_index) const
{
return this->m_data[batch_index];
}
// clang-format off
//!
//! @brief Cast to a double pointer.
//!
operator T**()
{
return this->m_data;
}
// clang-format on
//!
//! @brief Constant cast to a double pointer.
//!
operator const T* const *()
{
return this->m_data;
}
//!
//! @brief Copy from a host batched vector.
//! @param that the vector the data is copied from.
//! @return true if the copy is done successfully, false otherwise.
//!
bool copy_from(const host_batch_vector<T>& that)
{
if((this->batch_count() == that.batch_count()) && (this->n() == that.n())
&& (this->inc() == that.inc()))
{
size_t num_bytes = this->n() * std::abs(this->inc()) * sizeof(T);
for(int64_t batch_index = 0; batch_index < this->m_batch_count; ++batch_index)
{
memcpy((*this)[batch_index], that[batch_index], num_bytes);
}
return true;
}
else
{
return false;
}
}
//!
//! @brief Transfer from a device batched vector.
//! @param that the vector the data is copied from.
//! @return the hip error.
//!
hipError_t transfer_from(const device_batch_vector<T>& that)
{
hipError_t hip_err;
size_t num_bytes = size_t(this->m_n) * std::abs(this->m_inc) * sizeof(T);
for(int64_t batch_index = 0; batch_index < this->m_batch_count; ++batch_index)
{
if(hipSuccess
!= (hip_err = hipMemcpy((*this)[batch_index], that[batch_index], num_bytes,
hipMemcpyDeviceToHost)))
{
return hip_err;
}
}
return hipSuccess;
}
//!
//! @brief Check if memory exists.
//! @return hipSuccess if memory exists, hipErrorOutOfMemory otherwise.
//!
hipError_t memcheck() const
{
return (nullptr != this->m_data) ? hipSuccess : hipErrorOutOfMemory;
}
private:
int64_t m_n{};
int64_t m_inc{};
int64_t m_batch_count{};
T** m_data{};
bool try_initialize_memory()
{
bool success = (nullptr != (this->m_data = (T**)calloc(this->m_batch_count, sizeof(T*))));
if(success)
{
size_t nmemb = size_t(this->m_n) * std::abs(this->m_inc);
for(int64_t batch_index = 0; batch_index < this->m_batch_count; ++batch_index)
{
success = (nullptr != (this->m_data[batch_index] = (T*)calloc(nmemb, sizeof(T))));
if(false == success)
{
break;
}
}
}
return success;
}
void free_memory()
{
if(nullptr != this->m_data)
{
for(int64_t batch_index = 0; batch_index < this->m_batch_count; ++batch_index)
{
if(nullptr != this->m_data[batch_index])
{
free(this->m_data[batch_index]);
this->m_data[batch_index] = nullptr;
}
}
free(this->m_data);
this->m_data = nullptr;
}
}
};
//!
//! @brief Overload output operator.
//! @param os The ostream.
//! @param that That host batch vector.
//!
template <typename T>
std::ostream& operator<<(std::ostream& os, const host_batch_vector<T>& that)
{
auto n = that.n();
auto inc = std::abs(that.inc());
auto batch_count = that.batch_count();
for(int64_t batch_index = 0; batch_index < batch_count; ++batch_index)
{
auto batch_data = that[batch_index];
os << "[" << batch_index << "] = { " << batch_data[0];
for(int64_t i = 1; i < n; ++i)
{
os << ", " << batch_data[i * inc];
}
os << " }" << std::endl;
}
return os;
}
|