Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 2 additions & 1 deletion clients/CMakeLists.txt
Original file line number Diff line number Diff line change
Expand Up @@ -100,7 +100,7 @@ if( BUILD_CLIENTS_BENCHMARKS OR BUILD_CLIENTS_TESTS)
find_package(ROCmSMI REQUIRED)
list( APPEND COMMON_LINK_LIBS rocm_smi )
endif()

# common source files used in subdirectories benchmarks and gtest thus ../common
set( hipblaslt_test_bench_common
../common/singletons.cpp
Expand All @@ -111,6 +111,7 @@ if( BUILD_CLIENTS_BENCHMARKS OR BUILD_CLIENTS_TESTS)
../common/hipblaslt_parse_data.cpp
../common/hipblaslt_arguments.cpp
../common/hipblaslt_random.cpp
../common/hipblaslt_init_device.cpp
${BLIS_CPP}
)

Expand Down
250 changes: 250 additions & 0 deletions clients/common/hipblaslt_init_device.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,250 @@
/*******************************************************************************
*
* MIT License
*
* Copyright (C) 2024 Advanced Micro Devices, Inc.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*
*******************************************************************************/

#include "hipblaslt_datatype2string.hpp"
#include "hipblaslt_init.hpp"
#include "hipblaslt_ostream.hpp"
#include "hipblaslt_random.hpp"
#include <hipblaslt/hipblaslt.h>

template <typename T, typename F>
__global__ void fill_kernel(T* A, size_t size, F f)
{
size_t idx = blockIdx.x * blockDim.x + threadIdx.x;
if(idx < size)
A[idx] = f(idx);
}

template <typename T, typename F>
void fill_batch(T* A, size_t M, size_t N, size_t lda, size_t stride, size_t batch_count, const F& f)
{
size_t size = std::max(lda * N, stride) * batch_count;
size_t block_size = 256;
size_t grid_size = (size + block_size - 1) / block_size;
fill_kernel<<<dim3(grid_size), dim3(block_size), 0, hipStreamDefault>>>(A, size, f);
}

__device__ uint32_t pseudo_random_device(size_t idx)
{
// Numerical Recipes ranqd1, Chapter 7.1, ?An Even Quicker Generator, Eq. 7.1.6. parameters from Knuth and H. W. Lewis
auto s = idx * 1664525 + 1013904223;
// Run a few extra iterations to make the generators diverge
// in case the seeds are still poor (consecutive ints)
for(int i = 0; i < 3; i++)
{
// Marsaglia, G. (2003). "Xorshift RNGs". Journal of Statistical Software. 8 (14). doi:10.18637/jss.v008.i14
s ^= s << 13;
s ^= s >> 17;
s ^= s << 5;
}
return s;
}

/*! \brief generate a random number in range [1,2,3,4,5,6,7,8,9,10] */
template <typename T>
__device__ T random_int(size_t idx)
{
return T(pseudo_random_device(idx) % 10 + 1.f);
}

/*! \brief generate a random number in range [-2,-1,0,1,2] */
template <>
__device__ hipblasLtHalf random_int<hipblasLtHalf>(size_t idx)
{
return hipblasLtHalf(pseudo_random_device(idx) % 5 - 2.f);
}

/*! \brief generate a random number in range [-2,-1,0,1,2] */
template <>
__device__ hip_bfloat16 random_int<hip_bfloat16>(size_t idx)
{
return hip_bfloat16(pseudo_random_device(idx) % 5 - 2.f);
}

/*! \brief generate a random number in range [1,2,3] */
template <>
__device__ int8_t random_int<int8_t>(size_t idx)
{
return pseudo_random_device(idx) % 3 + 1;
}

/*! \brief generate a random number in HPL-like [-0.5,0.5] doubles */
template <typename T>
__device__ T random_hpl(size_t idx)
{
auto r = pseudo_random_device(idx);
return T(double(r) / double(std::numeric_limits<decltype(r)>::max()) - 0.5);
}

/*! \brief generate a random number in [-1.0,1.0] doubles */
template <>
__device__ int8_t random_hpl(size_t idx)
{
auto r = pseudo_random_device(idx);
auto v = nearbyint(double(r) / double(std::numeric_limits<decltype(r)>::max()) * 2. - 1.);
return int8_t(v > 127.f ? 127.f : v < -128.f ? -128.f : v);
}

template <typename T>
void hipblaslt_init_device(ABC abc,
hipblaslt_initialization init,
bool is_nan,
T* A,
size_t M,
size_t N,
size_t lda,
size_t stride,
size_t batch_count)
{
if(is_nan)
{
std::array<T, 100> rand_nans;
for(auto& r : rand_nans)
r = T(hipblaslt_nan_rng());
fill_batch(A, M, N, lda, stride, batch_count, [rand_nans](size_t idx) -> T {
return rand_nans[pseudo_random_device(idx) % rand_nans.size()];
});
}
else
{
switch(init)
{
case hipblaslt_initialization::rand_int:
if(abc == ABC::A || abc == ABC::C)
fill_batch(A, M, N, lda, stride, batch_count, [](size_t idx) -> T {
return random_int<T>(idx);
});
else if(abc == ABC::B)
{
stride = std::max(lda * N, stride);
fill_batch(A, M, N, lda, stride, batch_count, [stride, lda](size_t idx) -> T {
auto b = idx / stride;
auto j = (idx - b * stride) / lda;
auto i = (idx - b * stride) - j * lda;
auto value = random_int<T>(idx);
return (i ^ j) & 1 ? value : negate(value);
});
}
break;
case hipblaslt_initialization::trig_float:
if(abc == ABC::A || abc == ABC::C)
fill_batch(A, M, N, lda, stride, batch_count, [](size_t idx) -> T {
return T(sin(double(idx)));
});
else if(abc == ABC::B)
fill_batch(A, M, N, lda, stride, batch_count, [](size_t idx) -> T {
return T(cos(double(idx)));
});
break;
case hipblaslt_initialization::hpl:
fill_batch(A, M, N, lda, stride, batch_count, [](size_t idx) -> T {
return random_hpl<T>(idx);
});
break;
case hipblaslt_initialization::special:
if(abc == ABC::A)
fill_batch(A, M, N, lda, stride, batch_count, [](size_t idx) -> T {
return T(hipblasLtHalf(65280.0));
});
else if(abc == ABC::B)
fill_batch(A, M, N, lda, stride, batch_count, [](size_t idx) -> T {
return T(hipblasLtHalf(0.0000607967376708984375));
});
else if(abc == ABC::C)
fill_batch(A, M, N, lda, stride, batch_count, [](size_t idx) -> T {
return T(pseudo_random_device(idx) % 10 + 1.f);
});
break;
case hipblaslt_initialization::zero:
fill_batch(A, M, N, lda, stride, batch_count, [](size_t idx) -> T { return T(0); });
break;
default:
hipblaslt_cerr << "Error type in hipblaslt_init_device" << std::endl;
break;
}
}
}

void hipblaslt_init_device(ABC abc,
hipblaslt_initialization init,
bool is_nan,
void* A,
size_t M,
size_t N,
size_t lda,
hipDataType type,
size_t stride,
size_t batch_count)
{
switch(type)
{
case HIP_R_32F:
hipblaslt_init_device<float>(
abc, init, is_nan, static_cast<float*>(A), M, N, lda, stride, batch_count);
break;
case HIP_R_64F:
hipblaslt_init_device<double>(
abc, init, is_nan, static_cast<double*>(A), M, N, lda, stride, batch_count);
break;
case HIP_R_16F:
hipblaslt_init_device<hipblasLtHalf>(
abc, init, is_nan, static_cast<hipblasLtHalf*>(A), M, N, lda, stride, batch_count);
break;
case HIP_R_16BF:
hipblaslt_init_device<hip_bfloat16>(
abc, init, is_nan, static_cast<hip_bfloat16*>(A), M, N, lda, stride, batch_count);
break;
case HIP_R_8F_E4M3_FNUZ:
hipblaslt_init_device<hipblaslt_f8_fnuz>(
abc, init, is_nan, static_cast<hipblaslt_f8_fnuz*>(A), M, N, lda, stride, batch_count);
break;
case HIP_R_8F_E5M2_FNUZ:
hipblaslt_init_device<hipblaslt_bf8_fnuz>(
abc, init, is_nan, static_cast<hipblaslt_bf8_fnuz*>(A), M, N, lda, stride, batch_count);
break;
#ifdef ROCM_USE_FLOAT8
case HIP_R_8F_E4M3:
hipblaslt_init_device<hipblaslt_f8>(
abc, init, is_nan, static_cast<hipblaslt_f8*>(A), M, N, lda, stride, batch_count);
break;
case HIP_R_8F_E5M2:
hipblaslt_init_device<hipblaslt_bf8>(
abc, init, is_nan, static_cast<hipblaslt_bf8*>(A), M, N, lda, stride, batch_count);
break;
#endif
case HIP_R_32I:
hipblaslt_init_device<int32_t>(
abc, init, is_nan, static_cast<int32_t*>(A), M, N, lda, stride, batch_count);
break;
case HIP_R_8I:
hipblaslt_init_device<hipblasLtInt8>(
abc, init, is_nan, static_cast<hipblasLtInt8*>(A), M, N, lda, stride, batch_count);
break;
default:
hipblaslt_cerr << "Error type in hipblaslt_init_device" << std::endl;
break;
}
}
Loading