// Copyright (c) Microsoft Corporation. // SPDX-License-Identifier: Apache-2.0 // DeepSpeed Team #include #include #include #include "memory_access_utils.h" template struct alignas(sizeof(T) * N) AlignedArray { using Element = T; static const int kElements = N; __device__ __host__ AlignedArray() {} __device__ __host__ AlignedArray(const T& rhs) { #pragma unroll for (int idx = 0; idx < kElements; ++idx) { this->at(idx) = rhs; } } __device__ __host__ T& operator[](int offset) { return reinterpret_cast(this->buffer[offset]); } __device__ __host__ const T& operator[](int offset) const { return reinterpret_cast(this->buffer[offset]); } __device__ __host__ T& at(int offset) { return reinterpret_cast(this->buffer[offset]); } __device__ __host__ const T& at(int offset) const { return reinterpret_cast(this->buffer[offset]); } __device__ __host__ AlignedArray operator+(const AlignedArray& rhs) const { AlignedArray ret; #pragma unroll for (int idx = 0; idx < kElements; ++idx) { ret[idx] = this->at(idx) + rhs.at(idx); } return ret; } __device__ __forceinline__ void clear() { #pragma unroll for (int idx = 0; idx < kElements; ++idx) { this->at(idx) = Element(0); } } Element buffer[N]; }; template struct reduce_max { __device__ __forceinline__ T operator()(const T& lhs, const T& rhs) { return lhs > rhs ? lhs : rhs; } }; template struct reduce_min { __device__ __forceinline__ T operator()(const T& lhs, const T& rhs) { return lhs < rhs ? lhs : rhs; } }; template struct subtract { __device__ __forceinline__ AlignedArray operator()(const AlignedArray& lhs, const T& rhs) { AlignedArray ret; #pragma unroll for (int idx = 0; idx < N; ++idx) { ret[idx] = lhs[idx] - rhs; } return ret; } }; template struct plus { __device__ __forceinline__ AlignedArray operator()(const AlignedArray& lhs, const T& rhs) { AlignedArray ret; #pragma unroll for (int idx = 0; idx < N; ++idx) { ret[idx] = lhs[idx] + rhs; } return ret; } }; template struct multiply { __device__ __forceinline__ AlignedArray operator()(const AlignedArray& lhs, const T& rhs) { AlignedArray ret; #pragma unroll for (int idx = 0; idx < N; ++idx) { ret[idx] = lhs[idx] * rhs; } return ret; } }; template struct clamp { __device__ __forceinline__ AlignedArray operator()(const AlignedArray& lhs, const T& min_val, const T& max_val) { AlignedArray ret; #pragma unroll for (int idx = 0; idx < N; ++idx) { ret[idx] = reduce_max()(reduce_min()(lhs[idx], max_val), min_val); } return ret; } }; template struct round_int; template struct round_int { __device__ __forceinline__ AlignedArray operator()(const AlignedArray& lhs) { AlignedArray ret; #pragma unroll for (int idx = 0; idx < N; ++idx) { ret[idx] = hrint(lhs[idx]); } return ret; } }; template struct divide { __device__ __forceinline__ AlignedArray operator()(const AlignedArray& lhs, const T& rhs) { AlignedArray ret; #pragma unroll for (int idx = 0; idx < N; ++idx) { ret[idx] = lhs[idx] / rhs; } return ret; } }; template __device__ __forceinline__ T to_scalar(const AlignedArray& data) { Reducer re; T res = data[0]; #pragma unroll for (int idx = 1; idx < N; ++idx) { res = re(res, data[idx]); } return res; } template __device__ __forceinline__ AlignedArray int4_to_half( const AlignedArray& data) { AlignedArray ret; #pragma unroll for (int idx = 0; idx < N * 2; idx += 2) { ret[idx] = half(int(data[idx / 2] >> 4)); ret[idx + 1] = half(int(data[idx / 2] & 0xf)); } return ret; } __global__ void dequantize_int4_to_half(uint8_t* data_in, half* data_out, half* scale_buffer, half* min_val_buffer, int num_group, int group_size) { using AccessType = AlignedArray; using AccessTypeOut = AlignedArray; for (int idx = threadIdx.x + blockIdx.x * blockDim.x; idx < num_group * group_size / 8; idx += blockDim.x * gridDim.x) { int id_group = idx / (group_size / 8); AccessType value = reinterpret_cast(data_in)[idx]; half scale = scale_buffer[id_group]; half min_value = min_val_buffer[id_group]; AccessTypeOut output = int4_to_half(value); output = divide()(output, scale); output = plus()(output, min_value); reinterpret_cast(data_out)[idx] = output; } } void launch_dequantize_int4_to_half_experimental(uint8_t* data_in, half* data_out, half* scale_buffer, half* min_val_buffer, int num_group, int group_size, cudaStream_t stream) { int num_warp = num_group / 4; int num_block = num_warp / 8; // 256 trd / block dequantize_int4_to_half<<>>( data_in, data_out, scale_buffer, min_val_buffer, num_group, group_size); } template __device__ __forceinline__ AlignedArray int8_to_half(const AlignedArray& data) { AlignedArray ret; #pragma unroll for (int idx = 0; idx < N; idx += 1) { ret[idx] = half(int(data[idx])); } return ret; } __global__ void dequantize_int8_to_half(uint8_t* data_in, half* data_out, half* scale_buffer, half* min_val_buffer, int num_group, int group_size) { using AccessType = AlignedArray; using AccessTypeOut = AlignedArray; for (int idx = threadIdx.x + blockIdx.x * blockDim.x; idx < num_group * group_size / 8; idx += blockDim.x * gridDim.x) { int id_group = idx / (group_size / 8); AccessType value = reinterpret_cast(data_in)[idx]; half scale = scale_buffer[id_group]; half min_value = min_val_buffer[id_group]; AccessTypeOut output = int8_to_half(value); output = divide()(output, scale); output = plus()(output, min_value); reinterpret_cast(data_out)[idx] = output; } } void launch_dequantize_int8_to_half_experimental(uint8_t* data_in, half* data_out, half* scale_buffer, half* min_val_buffer, int num_group, int group_size, cudaStream_t stream) { int num_warp = num_group / 4; int num_block = num_warp / 8; // 256 trd / block dequantize_int8_to_half<<>>( data_in, data_out, scale_buffer, min_val_buffer, num_group, group_size); }