-
Notifications
You must be signed in to change notification settings - Fork 3k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Add MatMul 4bits support on GPU (#17890)
### Description <!-- Describe your changes. --> Add a contrib op MatMulNBits and related toolchain to support quantization on weight. This PR only adds support for 4bits. It: - add schema for contrib op MatMulNBits which can support 1-7 bits quantization on weight. - a naive implementation for 4bits MatMulNBits on CPU and GPU, i.e., implemented like MatMul(A, Dequantize(B)). - a special implementation for GemV for 4bits MatMulNBits and related benchmark tool - tool to quantization model with 4bits. Next: - add general and more efficient kernels for 4bits MatMulNBits on CPU and GPU
- Loading branch information
Showing
29 changed files
with
2,389 additions
and
3 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
129 changes: 129 additions & 0 deletions
129
onnxruntime/contrib_ops/cpu/quantization/blockwise_quant_block.h
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,129 @@ | ||
| // Copyright (c) Microsoft Corporation. All rights reserved. | ||
| // Licensed under the MIT License. | ||
|
|
||
| #pragma once | ||
|
|
||
| #include <cstdint> | ||
| #include <algorithm> | ||
| #include <cmath> | ||
|
|
||
| namespace onnxruntime { | ||
| namespace contrib { | ||
|
|
||
| #if defined(_MSC_VER) | ||
| #define FORCEINLINE __forceinline | ||
| #else | ||
| #define FORCEINLINE __attribute__((always_inline)) inline | ||
| #endif | ||
|
|
||
| template <typename T, int32_t block_size, int32_t bits> | ||
| struct alignas(1) BlockwiseQuantBlock { | ||
| static_assert(block_size % 8 == 0); | ||
|
|
||
| uint8_t blob_data[block_size / 8 * bits]; | ||
|
|
||
| FORCEINLINE void dequant(T* dst, T scale, int32_t k_idx, int32_t K) const; | ||
| FORCEINLINE void dequant(T* dst, T scale, uint8_t zp, int32_t k_idx, int32_t K) const; | ||
|
|
||
| FORCEINLINE void quant(const T* src, T& scale, int32_t k_idx, int32_t K, int32_t N); | ||
| FORCEINLINE void quant(const T* src, T& scale, uint8_t& zp, int32_t k_idx, int32_t K, int32_t N); | ||
| }; | ||
|
|
||
| template <typename T, int32_t block_size> | ||
| struct alignas(1) BlockwiseQuantBlock<T, block_size, 4> { | ||
| static_assert(block_size % 8 == 0); | ||
|
|
||
| uint8_t blob_data[block_size / 2]; | ||
|
|
||
| FORCEINLINE void dequant(T* dst, T scale, uint8_t zp, int32_t k_idx, int32_t K) const { | ||
| for (int i = 0; i < block_size; i += 2) { | ||
| T zp_t = static_cast<T>(float(zp)); | ||
| if (k_idx + i < K) { | ||
| T x0 = static_cast<T>(float(blob_data[i / 2] & 0xF)); | ||
| dst[i] = scale * (x0 - zp_t); | ||
| } | ||
| if (k_idx + i + 1 < K) { | ||
| T x1 = static_cast<T>(float(blob_data[i / 2] >> 4)); | ||
| dst[i + 1] = scale * (x1 - zp_t); | ||
| } | ||
| } | ||
| } | ||
|
|
||
| FORCEINLINE void dequant(T* dst, T scale, int32_t k_idx, int32_t K) const { | ||
| constexpr uint8_t zp = 8; | ||
| dequant(dst, scale, zp, k_idx, K); | ||
| } | ||
|
|
||
| FORCEINLINE void quant(const T* src, T& scale_block, uint8_t& zp, int32_t k_idx, int32_t K, int32_t N) { | ||
| float min = static_cast<float>(*src); | ||
| float max = static_cast<float>(*src); | ||
| int32_t klen = std::min(block_size, K - k_idx); | ||
| for (int32_t kk = 0; kk < klen; kk++) { | ||
| const float v = static_cast<float>(src[N * kk]); | ||
| if (v < min) min = v; | ||
| if (v > max) max = v; | ||
| } | ||
| min = std::min(min, 0.0f); | ||
| max = std::max(max, 0.0f); | ||
|
|
||
| const float scale = (max - min) / ((1 << 4) - 1); | ||
| scale_block = static_cast<T>(scale); | ||
|
|
||
| const float reciprocal_scale = scale ? 1.0f / scale : 0.0f; | ||
| float zero_point_fp = min; | ||
| if (scale != 0.0f) { | ||
| zero_point_fp = 0.f - min / scale; | ||
| } | ||
|
|
||
| // Handle any clamping | ||
| if (zero_point_fp < 0.0f) { | ||
| zp = 0; | ||
| } else if (zero_point_fp > 15.0f) { | ||
| zp = 15; | ||
| } else { | ||
| zp = (uint8_t)roundf(zero_point_fp); | ||
| } | ||
|
|
||
| for (int32_t kk = 0; kk < klen; kk += 2) { | ||
| const float v0 = static_cast<float>(src[N * kk]); | ||
| const uint8_t vi0 = (uint8_t)std::min(15.0f, std::max(0.0f, roundf(v0 * reciprocal_scale + zp))); | ||
|
|
||
| const float v1 = static_cast<float>((kk + 1 < klen) ? src[N * (kk + 1)] : 0.f); | ||
| const uint8_t vi1 = (uint8_t)std::min(15.0f, std::max(0.0f, roundf(v1 * reciprocal_scale + zp))); | ||
|
|
||
| blob_data[kk / 2] = vi0 | (vi1 << 4); | ||
| } | ||
| } | ||
|
|
||
| FORCEINLINE void quant(const T* src, T& scale_block, int32_t k_idx, int32_t K, int32_t N) { | ||
| float amax = 0.0f; // abs(max) | ||
| float max = 0.0f; | ||
|
|
||
| int32_t klen = std::min(block_size, K - k_idx); | ||
|
|
||
| for (int32_t kk = 0; kk < klen; kk++) { | ||
| const float v = static_cast<float>(src[N * kk]); | ||
| if (amax < fabsf(v)) { | ||
| amax = fabsf(v); | ||
| max = v; | ||
| } | ||
| } | ||
|
|
||
| const float scale = max / (-8.f); | ||
| scale_block = static_cast<T>(scale); | ||
| const float reciprocal_scale = scale ? 1.0f / scale : 0.0f; | ||
|
|
||
| for (int32_t kk = 0; kk < klen; kk += 2) { | ||
| const float v0 = src[N * kk] * reciprocal_scale; | ||
| const uint8_t vi0 = (uint8_t)std::min(15.0f, std::max(0.0f, roundf(v0 + 8.f))); | ||
|
|
||
| const float v1 = (kk + 1 < klen) ? src[N * (kk + 1)] * reciprocal_scale : 0; | ||
| const uint8_t vi1 = (uint8_t)std::min(15.0f, std::max(0.0f, roundf(v1 + 8.f))); | ||
|
|
||
| blob_data[kk / 2] = vi0 | (vi1 << 4); | ||
| } | ||
| } | ||
| }; | ||
|
|
||
| } // namespace contrib | ||
| } // namespace onnxruntime |
Oops, something went wrong.