[CPU] expand the interface of shared_expert without scaling factor (#22933)
merge since this is CPU only change on sgl-kernel.
This commit is contained in:
+25
-119
@@ -1,6 +1,7 @@
|
|||||||
|
#include "moe.h"
|
||||||
|
|
||||||
#include "common.h"
|
#include "common.h"
|
||||||
#include "gemm.h"
|
#include "gemm.h"
|
||||||
#include "vec.h"
|
|
||||||
|
|
||||||
namespace {
|
namespace {
|
||||||
|
|
||||||
@@ -25,112 +26,6 @@ namespace {
|
|||||||
// 3. abstract at::native::cpublas::brgemm with WoQ gemm (M = 1 & M != 1)
|
// 3. abstract at::native::cpublas::brgemm with WoQ gemm (M = 1 & M != 1)
|
||||||
//
|
//
|
||||||
|
|
||||||
template <typename scalar_t>
|
|
||||||
inline void fill_stub(scalar_t* __restrict__ out, scalar_t val, int64_t size) {
|
|
||||||
using Vec = at::vec::Vectorized<scalar_t>;
|
|
||||||
const Vec data_vec(val);
|
|
||||||
at::vec::map<scalar_t>([data_vec](Vec out) { return out = data_vec; }, out, out, size);
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename scalar_t>
|
|
||||||
inline void copy_stub(scalar_t* __restrict__ out, const scalar_t* __restrict__ input, int64_t size) {
|
|
||||||
using Vec = at::vec::Vectorized<scalar_t>;
|
|
||||||
// no remainder
|
|
||||||
#pragma GCC unroll 4
|
|
||||||
for (int64_t d = 0; d < size; d += Vec::size()) {
|
|
||||||
Vec data = Vec::loadu(input + d);
|
|
||||||
data.store(out + d);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename scalar_t>
|
|
||||||
inline void copy_mul_stub(scalar_t* __restrict__ out, const float* __restrict__ input, float weight, int64_t size) {
|
|
||||||
using bVec = at::vec::Vectorized<scalar_t>;
|
|
||||||
using fVec = at::vec::Vectorized<float>;
|
|
||||||
constexpr int kVecSize = bVec::size();
|
|
||||||
const fVec weight_vec = fVec(weight);
|
|
||||||
int64_t d;
|
|
||||||
#pragma GCC unroll 4
|
|
||||||
for (d = 0; d <= size - kVecSize; d += kVecSize) {
|
|
||||||
fVec data0 = fVec::loadu(input + d) * weight_vec;
|
|
||||||
fVec data1 = fVec::loadu(input + d + fVec::size()) * weight_vec;
|
|
||||||
bVec out_vec = convert_from_float_ext<scalar_t>(data0, data1);
|
|
||||||
out_vec.store(out + d);
|
|
||||||
}
|
|
||||||
for (; d < size; ++d) {
|
|
||||||
out[d] = static_cast<scalar_t>(input[d] * weight);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// acc from [topk, K] to [K]
|
|
||||||
template <typename scalar_t>
|
|
||||||
inline void sum_stub(scalar_t* __restrict__ out, const scalar_t* __restrict__ input, int64_t topk, int64_t K) {
|
|
||||||
using bVec = at::vec::Vectorized<scalar_t>;
|
|
||||||
using fVec = at::vec::Vectorized<float>;
|
|
||||||
constexpr int kVecSize = bVec::size();
|
|
||||||
if (topk == 1) {
|
|
||||||
// do copy for topk = 1
|
|
||||||
copy_stub(out, input, K);
|
|
||||||
} else {
|
|
||||||
// do sum for topk != 1
|
|
||||||
int64_t d;
|
|
||||||
#pragma GCC unroll 4
|
|
||||||
for (d = 0; d <= K - kVecSize; d += kVecSize) {
|
|
||||||
fVec sum_fvec0 = fVec(0.f);
|
|
||||||
fVec sum_fvec1 = fVec(0.f);
|
|
||||||
for (int t = 0; t < topk; ++t) {
|
|
||||||
bVec x_bvec = bVec::loadu(input + t * K + d);
|
|
||||||
fVec x_fvec0, x_fvec1;
|
|
||||||
std::tie(x_fvec0, x_fvec1) = at::vec::convert_to_float(x_bvec);
|
|
||||||
|
|
||||||
sum_fvec0 += x_fvec0;
|
|
||||||
sum_fvec1 += x_fvec1;
|
|
||||||
}
|
|
||||||
bVec out_bvec = convert_from_float_ext<scalar_t>(sum_fvec0, sum_fvec1);
|
|
||||||
out_bvec.store(out + d);
|
|
||||||
}
|
|
||||||
for (; d < K; ++d) {
|
|
||||||
float sum_val = 0.f;
|
|
||||||
for (int t = 0; t < topk; ++t) {
|
|
||||||
sum_val += static_cast<float>(input[t * K + d]);
|
|
||||||
}
|
|
||||||
out[d] = static_cast<scalar_t>(sum_val);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// out = input + input2 * scale
|
|
||||||
template <typename scalar_t>
|
|
||||||
inline void add_mul_stub(
|
|
||||||
scalar_t* __restrict__ out,
|
|
||||||
const float* __restrict__ input,
|
|
||||||
const scalar_t* __restrict__ input2,
|
|
||||||
float scale,
|
|
||||||
int64_t size) {
|
|
||||||
using bVec = at::vec::Vectorized<scalar_t>;
|
|
||||||
using fVec = at::vec::Vectorized<float>;
|
|
||||||
constexpr int kVecSize = bVec::size();
|
|
||||||
const fVec s_vec = fVec(scale);
|
|
||||||
int64_t d;
|
|
||||||
#pragma GCC unroll 4
|
|
||||||
for (d = 0; d <= size - kVecSize; d += kVecSize) {
|
|
||||||
fVec x0 = fVec::loadu(input + d);
|
|
||||||
fVec x1 = fVec::loadu(input + d + fVec::size());
|
|
||||||
|
|
||||||
bVec y_bvec = bVec::loadu(input2 + d);
|
|
||||||
fVec y0, y1;
|
|
||||||
std::tie(y0, y1) = at::vec::convert_to_float(y_bvec);
|
|
||||||
|
|
||||||
x0 = x0 + y0 * s_vec;
|
|
||||||
x1 = x1 + y1 * s_vec;
|
|
||||||
bVec out_vec = convert_from_float_ext<scalar_t>(x0, x1);
|
|
||||||
out_vec.store(out + d);
|
|
||||||
}
|
|
||||||
for (; d < size; ++d) {
|
|
||||||
out[d] = static_cast<scalar_t>(input[d] + float(input2[d]) * scale);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
template <int BLOCK_M>
|
template <int BLOCK_M>
|
||||||
int moe_align_block_size(
|
int moe_align_block_size(
|
||||||
int32_t* __restrict__ sorted_ids,
|
int32_t* __restrict__ sorted_ids,
|
||||||
@@ -765,6 +660,8 @@ void shared_expert_kernel_impl(
|
|||||||
|
|
||||||
const bool use_brgemm = can_use_brgemm<scalar_t>(M);
|
const bool use_brgemm = can_use_brgemm<scalar_t>(M);
|
||||||
|
|
||||||
|
const bool apply_scaling_factor = fused_experts_out != nullptr;
|
||||||
|
|
||||||
// here we only parallel on half of 2N to fuse silu_and_mul with gemm
|
// here we only parallel on half of 2N to fuse silu_and_mul with gemm
|
||||||
parallel_2d(MB, NB, [&](int64_t mb0, int64_t mb1, int64_t nb0, int64_t nb1) {
|
parallel_2d(MB, NB, [&](int64_t mb0, int64_t mb1, int64_t nb0, int64_t nb1) {
|
||||||
// get local pointers
|
// get local pointers
|
||||||
@@ -888,9 +785,11 @@ void shared_expert_kernel_impl(
|
|||||||
|
|
||||||
// 2.b copy from C to output and add fused_experts_out
|
// 2.b copy from C to output and add fused_experts_out
|
||||||
scalar_t* __restrict__ out = output + mb * BLOCK_M * K + nb * BLOCK_N;
|
scalar_t* __restrict__ out = output + mb * BLOCK_M * K + nb * BLOCK_N;
|
||||||
const scalar_t* __restrict__ fused_out = fused_experts_out + mb * BLOCK_M * K + nb * BLOCK_N;
|
const scalar_t* __restrict__ fused_out =
|
||||||
|
apply_scaling_factor ? fused_experts_out + mb * BLOCK_M * K + nb * BLOCK_N : nullptr;
|
||||||
for (int64_t m = 0; m < m_size; ++m) {
|
for (int64_t m = 0; m < m_size; ++m) {
|
||||||
add_mul_stub(out + m * K, C + m * BLOCK_N, fused_out + m * K, routed_scaling_factor, n_size);
|
const scalar_t* __restrict__ fused_out_row = apply_scaling_factor ? (fused_out + m * K) : nullptr;
|
||||||
|
add_mul_stub(out + m * K, C + m * BLOCK_N, fused_out_row, routed_scaling_factor, n_size);
|
||||||
}
|
}
|
||||||
});
|
});
|
||||||
|
|
||||||
@@ -1235,8 +1134,8 @@ at::Tensor shared_expert_cpu(
|
|||||||
at::Tensor& hidden_states,
|
at::Tensor& hidden_states,
|
||||||
at::Tensor& w1,
|
at::Tensor& w1,
|
||||||
at::Tensor& w2,
|
at::Tensor& w2,
|
||||||
at::Tensor& fused_experts_out,
|
const std::optional<at::Tensor>& fused_experts_out,
|
||||||
double routed_scaling_factor,
|
const std::optional<double> routed_scaling_factor,
|
||||||
bool inplace,
|
bool inplace,
|
||||||
bool use_int8_w8a8,
|
bool use_int8_w8a8,
|
||||||
bool use_fp8_w8a16,
|
bool use_fp8_w8a16,
|
||||||
@@ -1252,15 +1151,22 @@ at::Tensor shared_expert_cpu(
|
|||||||
constexpr int64_t BLOCK_M = block_size_m();
|
constexpr int64_t BLOCK_M = block_size_m();
|
||||||
constexpr int64_t BLOCK_N = block_size_n();
|
constexpr int64_t BLOCK_N = block_size_n();
|
||||||
|
|
||||||
|
double routed_scaling_factor_value = 0;
|
||||||
|
if (routed_scaling_factor.has_value()) {
|
||||||
|
TORCH_CHECK(fused_experts_out.has_value(), "shared_expert_cpu: expect fused_experts_out.");
|
||||||
|
const auto fused_experts_out_tensor = fused_experts_out.value();
|
||||||
|
routed_scaling_factor_value = routed_scaling_factor.value();
|
||||||
|
CHECK_INPUT(fused_experts_out_tensor);
|
||||||
|
CHECK_EQ(hidden_states.sizes(), fused_experts_out_tensor.sizes());
|
||||||
|
}
|
||||||
|
|
||||||
const auto st = hidden_states.scalar_type();
|
const auto st = hidden_states.scalar_type();
|
||||||
CHECK_INPUT(hidden_states);
|
CHECK_INPUT(hidden_states);
|
||||||
CHECK_INPUT(fused_experts_out);
|
|
||||||
CHECK_INPUT(w1);
|
CHECK_INPUT(w1);
|
||||||
CHECK_INPUT(w2);
|
CHECK_INPUT(w2);
|
||||||
CHECK_DIM(2, hidden_states);
|
CHECK_DIM(2, hidden_states);
|
||||||
CHECK_DIM(2, w1);
|
CHECK_DIM(2, w1);
|
||||||
CHECK_DIM(2, w2);
|
CHECK_DIM(2, w2);
|
||||||
CHECK_EQ(hidden_states.sizes(), fused_experts_out.sizes());
|
|
||||||
CHECK_EQ(hidden_states.scalar_type(), st);
|
CHECK_EQ(hidden_states.scalar_type(), st);
|
||||||
|
|
||||||
int64_t M = hidden_states.size(0);
|
int64_t M = hidden_states.size(0);
|
||||||
@@ -1328,8 +1234,8 @@ at::Tensor shared_expert_cpu(
|
|||||||
packed_w2.data_ptr<int8_t>(),
|
packed_w2.data_ptr<int8_t>(),
|
||||||
w1s.data_ptr<float>(),
|
w1s.data_ptr<float>(),
|
||||||
w2s.data_ptr<float>(),
|
w2s.data_ptr<float>(),
|
||||||
fused_experts_out.data_ptr<scalar_t>(),
|
conditional_data_ptr<scalar_t>(fused_experts_out),
|
||||||
routed_scaling_factor,
|
routed_scaling_factor_value,
|
||||||
M,
|
M,
|
||||||
N,
|
N,
|
||||||
K);
|
K);
|
||||||
@@ -1351,8 +1257,8 @@ at::Tensor shared_expert_cpu(
|
|||||||
w2s.data_ptr<float>(),
|
w2s.data_ptr<float>(),
|
||||||
block_size_N,
|
block_size_N,
|
||||||
block_size_K,
|
block_size_K,
|
||||||
fused_experts_out.data_ptr<scalar_t>(),
|
conditional_data_ptr<scalar_t>(fused_experts_out),
|
||||||
routed_scaling_factor,
|
routed_scaling_factor_value,
|
||||||
M,
|
M,
|
||||||
N,
|
N,
|
||||||
K);
|
K);
|
||||||
@@ -1364,8 +1270,8 @@ at::Tensor shared_expert_cpu(
|
|||||||
hidden_states.data_ptr<scalar_t>(),
|
hidden_states.data_ptr<scalar_t>(),
|
||||||
packed_w1.data_ptr<scalar_t>(),
|
packed_w1.data_ptr<scalar_t>(),
|
||||||
packed_w2.data_ptr<scalar_t>(),
|
packed_w2.data_ptr<scalar_t>(),
|
||||||
fused_experts_out.data_ptr<scalar_t>(),
|
conditional_data_ptr<scalar_t>(fused_experts_out),
|
||||||
routed_scaling_factor,
|
routed_scaling_factor_value,
|
||||||
M,
|
M,
|
||||||
N,
|
N,
|
||||||
K);
|
K);
|
||||||
|
|||||||
@@ -0,0 +1,173 @@
|
|||||||
|
#pragma once
|
||||||
|
#include "vec.h"
|
||||||
|
|
||||||
|
template <typename scalar_t>
|
||||||
|
inline void fill_stub(scalar_t* __restrict__ out, scalar_t val, int64_t size) {
|
||||||
|
using Vec = at::vec::Vectorized<scalar_t>;
|
||||||
|
const Vec data_vec(val);
|
||||||
|
at::vec::map<scalar_t>([data_vec](Vec out) { return out = data_vec; }, out, out, size);
|
||||||
|
}
|
||||||
|
|
||||||
|
template <typename scalar_t>
|
||||||
|
inline void copy_stub(scalar_t* __restrict__ out, const scalar_t* __restrict__ input, int64_t size) {
|
||||||
|
using Vec = at::vec::Vectorized<scalar_t>;
|
||||||
|
constexpr int kVecSize = Vec::size();
|
||||||
|
int64_t d;
|
||||||
|
#pragma GCC unroll 4
|
||||||
|
for (d = 0; d <= size - kVecSize; d += kVecSize) {
|
||||||
|
Vec data = Vec::loadu(input + d);
|
||||||
|
data.store(out + d);
|
||||||
|
}
|
||||||
|
for (; d < size; ++d) {
|
||||||
|
out[d] = input[d];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
template <typename scalar_t>
|
||||||
|
inline void copy_stub(scalar_t* __restrict__ out, const float* __restrict__ input, int64_t size) {
|
||||||
|
using bVec = at::vec::Vectorized<scalar_t>;
|
||||||
|
using fVec = at::vec::Vectorized<float>;
|
||||||
|
constexpr int kVecSize = bVec::size();
|
||||||
|
int64_t d;
|
||||||
|
#pragma GCC unroll 4
|
||||||
|
for (d = 0; d <= size - kVecSize; d += kVecSize) {
|
||||||
|
auto [x0, x1] = load_float_vec2(input + d);
|
||||||
|
bVec out_vec = convert_from_float_ext<scalar_t>(x0, x1);
|
||||||
|
out_vec.store(out + d);
|
||||||
|
}
|
||||||
|
for (; d < size; ++d) {
|
||||||
|
out[d] = static_cast<scalar_t>(input[d]);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
template <>
|
||||||
|
inline void copy_stub<uint8_t>(uint8_t* __restrict__ out, const uint8_t* __restrict__ input, int64_t size) {
|
||||||
|
// size might be 64x + 32
|
||||||
|
std::memcpy(out, input, size * sizeof(uint8_t));
|
||||||
|
}
|
||||||
|
|
||||||
|
template <typename scalar_t, typename input_t>
|
||||||
|
inline void copy_mul_stub(scalar_t* __restrict__ out, const input_t* __restrict__ input, float weight, int64_t size) {
|
||||||
|
static_assert(
|
||||||
|
std::is_same_v<input_t, float> || std::is_same_v<input_t, scalar_t>,
|
||||||
|
"copy_mul_stub only supports input_t == float or input_t == scalar_t");
|
||||||
|
using bVec = at::vec::Vectorized<scalar_t>;
|
||||||
|
using fVec = at::vec::Vectorized<float>;
|
||||||
|
constexpr int kVecSize = bVec::size();
|
||||||
|
const fVec weight_vec = fVec(weight);
|
||||||
|
int64_t d;
|
||||||
|
#pragma GCC unroll 4
|
||||||
|
for (d = 0; d <= size - kVecSize; d += kVecSize) {
|
||||||
|
auto [x0, x1] = load_float_vec2(input + d);
|
||||||
|
x0 = x0 * weight_vec;
|
||||||
|
x1 = x1 * weight_vec;
|
||||||
|
bVec out_vec = convert_from_float_ext<scalar_t>(x0, x1);
|
||||||
|
out_vec.store(out + d);
|
||||||
|
}
|
||||||
|
for (; d < size; ++d) {
|
||||||
|
out[d] = static_cast<scalar_t>(input[d] * weight);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// acc from [topk, K] to [K]
|
||||||
|
template <typename scalar_t>
|
||||||
|
inline void sum_stub(scalar_t* __restrict__ out, const scalar_t* __restrict__ input, int64_t topk, int64_t K) {
|
||||||
|
using bVec = at::vec::Vectorized<scalar_t>;
|
||||||
|
using fVec = at::vec::Vectorized<float>;
|
||||||
|
constexpr int kVecSize = bVec::size();
|
||||||
|
if (topk == 1) {
|
||||||
|
// do copy for topk = 1
|
||||||
|
copy_stub(out, input, K);
|
||||||
|
} else {
|
||||||
|
// do sum for topk != 1
|
||||||
|
int64_t d;
|
||||||
|
#pragma GCC unroll 4
|
||||||
|
for (d = 0; d <= K - kVecSize; d += kVecSize) {
|
||||||
|
fVec sum_fvec0 = fVec(0.f);
|
||||||
|
fVec sum_fvec1 = fVec(0.f);
|
||||||
|
for (int t = 0; t < topk; ++t) {
|
||||||
|
bVec x_bvec = bVec::loadu(input + t * K + d);
|
||||||
|
fVec x_fvec0, x_fvec1;
|
||||||
|
std::tie(x_fvec0, x_fvec1) = at::vec::convert_to_float(x_bvec);
|
||||||
|
|
||||||
|
sum_fvec0 += x_fvec0;
|
||||||
|
sum_fvec1 += x_fvec1;
|
||||||
|
}
|
||||||
|
bVec out_bvec = convert_from_float_ext<scalar_t>(sum_fvec0, sum_fvec1);
|
||||||
|
out_bvec.store(out + d);
|
||||||
|
}
|
||||||
|
for (; d < K; ++d) {
|
||||||
|
float sum_val = 0.f;
|
||||||
|
for (int t = 0; t < topk; ++t) {
|
||||||
|
sum_val += static_cast<float>(input[t * K + d]);
|
||||||
|
}
|
||||||
|
out[d] = static_cast<scalar_t>(sum_val);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// out = input + input2 * scale
|
||||||
|
template <typename scalar_t, typename input_t>
|
||||||
|
inline void add_mul_stub(
|
||||||
|
scalar_t* __restrict__ out,
|
||||||
|
const input_t* __restrict__ input,
|
||||||
|
const scalar_t* __restrict__ input2,
|
||||||
|
float scale,
|
||||||
|
int64_t size) {
|
||||||
|
static_assert(
|
||||||
|
std::is_same_v<input_t, float> || std::is_same_v<input_t, scalar_t>,
|
||||||
|
"add_mul_stub only supports input_t == float or input_t == scalar_t");
|
||||||
|
|
||||||
|
// out = input (without scale factor)
|
||||||
|
if (input2 == nullptr) {
|
||||||
|
copy_stub(out, input, size);
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
using bVec = at::vec::Vectorized<scalar_t>;
|
||||||
|
using fVec = at::vec::Vectorized<float>;
|
||||||
|
constexpr int kVecSize = bVec::size();
|
||||||
|
const fVec s_vec = fVec(scale);
|
||||||
|
int64_t d;
|
||||||
|
#pragma GCC unroll 4
|
||||||
|
for (d = 0; d <= size - kVecSize; d += kVecSize) {
|
||||||
|
auto [x0, x1] = load_float_vec2(input + d);
|
||||||
|
|
||||||
|
bVec y_bvec = bVec::loadu(input2 + d);
|
||||||
|
fVec y0, y1;
|
||||||
|
std::tie(y0, y1) = at::vec::convert_to_float(y_bvec);
|
||||||
|
|
||||||
|
x0 = x0 + y0 * s_vec;
|
||||||
|
x1 = x1 + y1 * s_vec;
|
||||||
|
bVec out_vec = convert_from_float_ext<scalar_t>(x0, x1);
|
||||||
|
out_vec.store(out + d);
|
||||||
|
}
|
||||||
|
for (; d < size; ++d) {
|
||||||
|
out[d] = static_cast<scalar_t>(input[d] + float(input2[d]) * scale);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
template <typename scalar_t>
|
||||||
|
inline void silu_and_mul_stub(
|
||||||
|
scalar_t* __restrict__ out, const scalar_t* __restrict__ input, const scalar_t* __restrict__ input2, int64_t size) {
|
||||||
|
using bVec = at::vec::Vectorized<scalar_t>;
|
||||||
|
using fVec = at::vec::Vectorized<float>;
|
||||||
|
const fVec one = fVec(1.f);
|
||||||
|
|
||||||
|
// no remainder
|
||||||
|
#pragma GCC unroll 4
|
||||||
|
for (int64_t d = 0; d < size; d += bVec::size()) {
|
||||||
|
bVec x = bVec::loadu(input + d);
|
||||||
|
fVec x0, x1;
|
||||||
|
std::tie(x0, x1) = at::vec::convert_to_float(x);
|
||||||
|
bVec y = bVec::loadu(input2 + d);
|
||||||
|
fVec y0, y1;
|
||||||
|
std::tie(y0, y1) = at::vec::convert_to_float(y);
|
||||||
|
x0 = x0 / (one + x0.neg().exp_u20());
|
||||||
|
x1 = x1 / (one + x1.neg().exp_u20());
|
||||||
|
x0 = x0 * y0;
|
||||||
|
x1 = x1 * y1;
|
||||||
|
bVec out_vec = convert_from_float_ext<scalar_t>(x0, x1);
|
||||||
|
out_vec.store(out + d);
|
||||||
|
}
|
||||||
|
}
|
||||||
@@ -1,139 +1,6 @@
|
|||||||
#include "common.h"
|
#include "common.h"
|
||||||
#include "gemm.h"
|
#include "gemm.h"
|
||||||
#include "vec.h"
|
#include "moe.h"
|
||||||
|
|
||||||
namespace {
|
|
||||||
|
|
||||||
template <typename scalar_t>
|
|
||||||
inline void copy_stub(scalar_t* __restrict__ out, const scalar_t* __restrict__ input, int64_t size) {
|
|
||||||
using Vec = at::vec::Vectorized<scalar_t>;
|
|
||||||
// no remainder
|
|
||||||
#pragma GCC unroll 4
|
|
||||||
for (int64_t d = 0; d < size; d += Vec::size()) {
|
|
||||||
Vec data = Vec::loadu(input + d);
|
|
||||||
data.store(out + d);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename scalar_t>
|
|
||||||
inline void copy_mul_stub(scalar_t* __restrict__ out, const scalar_t* __restrict__ input, float weight, int64_t size) {
|
|
||||||
using bVec = at::vec::Vectorized<scalar_t>;
|
|
||||||
using fVec = at::vec::Vectorized<float>;
|
|
||||||
constexpr int kVecSize = bVec::size();
|
|
||||||
const fVec weight_vec = fVec(weight);
|
|
||||||
int64_t d;
|
|
||||||
#pragma GCC unroll 4
|
|
||||||
for (d = 0; d <= size - kVecSize; d += kVecSize) {
|
|
||||||
bVec x = bVec::loadu(input + d);
|
|
||||||
fVec x0, x1;
|
|
||||||
std::tie(x0, x1) = at::vec::convert_to_float(x);
|
|
||||||
x0 = x0 * weight_vec;
|
|
||||||
x1 = x1 * weight_vec;
|
|
||||||
bVec out_vec = convert_from_float_ext<scalar_t>(x0, x1);
|
|
||||||
out_vec.store(out + d);
|
|
||||||
}
|
|
||||||
for (; d < size; ++d) {
|
|
||||||
out[d] = static_cast<scalar_t>(input[d] * weight);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// acc from [topk, K] to [K]
|
|
||||||
template <typename scalar_t>
|
|
||||||
inline void sum_stub(scalar_t* __restrict__ out, const scalar_t* __restrict__ input, int64_t topk, int64_t K) {
|
|
||||||
using bVec = at::vec::Vectorized<scalar_t>;
|
|
||||||
using fVec = at::vec::Vectorized<float>;
|
|
||||||
constexpr int kVecSize = bVec::size();
|
|
||||||
if (topk == 1) {
|
|
||||||
// do copy for topk = 1
|
|
||||||
copy_stub(out, input, K);
|
|
||||||
} else {
|
|
||||||
// do sum for topk != 1
|
|
||||||
int64_t d;
|
|
||||||
#pragma GCC unroll 4
|
|
||||||
for (d = 0; d <= K - kVecSize; d += kVecSize) {
|
|
||||||
fVec sum_fvec0 = fVec(0.f);
|
|
||||||
fVec sum_fvec1 = fVec(0.f);
|
|
||||||
for (int t = 0; t < topk; ++t) {
|
|
||||||
bVec x_bvec = bVec::loadu(input + t * K + d);
|
|
||||||
fVec x_fvec0, x_fvec1;
|
|
||||||
std::tie(x_fvec0, x_fvec1) = at::vec::convert_to_float(x_bvec);
|
|
||||||
|
|
||||||
sum_fvec0 += x_fvec0;
|
|
||||||
sum_fvec1 += x_fvec1;
|
|
||||||
}
|
|
||||||
bVec out_bvec = convert_from_float_ext<scalar_t>(sum_fvec0, sum_fvec1);
|
|
||||||
out_bvec.store(out + d);
|
|
||||||
}
|
|
||||||
for (; d < K; ++d) {
|
|
||||||
float sum_val = 0.f;
|
|
||||||
for (int t = 0; t < topk; ++t) {
|
|
||||||
sum_val += static_cast<float>(input[t * K + d]);
|
|
||||||
}
|
|
||||||
out[d] = static_cast<scalar_t>(sum_val);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// out = input + input2 * scale
|
|
||||||
template <typename scalar_t>
|
|
||||||
inline void add_mul_stub(
|
|
||||||
scalar_t* __restrict__ out,
|
|
||||||
const scalar_t* __restrict__ input,
|
|
||||||
const scalar_t* __restrict__ input2,
|
|
||||||
float scale,
|
|
||||||
int64_t size) {
|
|
||||||
using bVec = at::vec::Vectorized<scalar_t>;
|
|
||||||
using fVec = at::vec::Vectorized<float>;
|
|
||||||
constexpr int kVecSize = bVec::size();
|
|
||||||
const fVec s_vec = fVec(scale);
|
|
||||||
|
|
||||||
int64_t d;
|
|
||||||
#pragma GCC unroll 4
|
|
||||||
for (d = 0; d <= size - kVecSize; d += kVecSize) {
|
|
||||||
bVec x_bvec = bVec::loadu(input + d);
|
|
||||||
fVec x0, x1;
|
|
||||||
std::tie(x0, x1) = at::vec::convert_to_float(x_bvec);
|
|
||||||
|
|
||||||
bVec y_bvec = bVec::loadu(input2 + d);
|
|
||||||
fVec y0, y1;
|
|
||||||
std::tie(y0, y1) = at::vec::convert_to_float(y_bvec);
|
|
||||||
|
|
||||||
x0 = x0 + y0 * s_vec;
|
|
||||||
x1 = x1 + y1 * s_vec;
|
|
||||||
bVec out_vec = convert_from_float_ext<scalar_t>(x0, x1);
|
|
||||||
out_vec.store(out + d);
|
|
||||||
}
|
|
||||||
for (; d < size; ++d) {
|
|
||||||
out[d] = static_cast<scalar_t>(input[d] + float(input2[d]) * scale);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename scalar_t>
|
|
||||||
inline void silu_and_mul_stub(
|
|
||||||
scalar_t* __restrict__ out, const scalar_t* __restrict__ input, const scalar_t* __restrict__ input2, int64_t size) {
|
|
||||||
using bVec = at::vec::Vectorized<scalar_t>;
|
|
||||||
using fVec = at::vec::Vectorized<float>;
|
|
||||||
const fVec one = fVec(1.f);
|
|
||||||
|
|
||||||
// no remainder
|
|
||||||
#pragma GCC unroll 4
|
|
||||||
for (int64_t d = 0; d < size; d += bVec::size()) {
|
|
||||||
bVec x = bVec::loadu(input + d);
|
|
||||||
fVec x0, x1;
|
|
||||||
std::tie(x0, x1) = at::vec::convert_to_float(x);
|
|
||||||
bVec y = bVec::loadu(input2 + d);
|
|
||||||
fVec y0, y1;
|
|
||||||
std::tie(y0, y1) = at::vec::convert_to_float(y);
|
|
||||||
x0 = x0 / (one + x0.neg().exp_u20());
|
|
||||||
x1 = x1 / (one + x1.neg().exp_u20());
|
|
||||||
x0 = x0 * y0;
|
|
||||||
x1 = x1 * y1;
|
|
||||||
bVec out_vec = convert_from_float_ext<scalar_t>(x0, x1);
|
|
||||||
out_vec.store(out + d);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
} // anonymous namespace
|
|
||||||
|
|
||||||
template <typename scalar_t>
|
template <typename scalar_t>
|
||||||
void fused_experts_fp8_kernel_impl(
|
void fused_experts_fp8_kernel_impl(
|
||||||
@@ -372,6 +239,7 @@ void shared_expert_fp8_kernel_impl(
|
|||||||
int64_t blocks_n_per_group = block_size_N / BLOCK_N;
|
int64_t blocks_n_per_group = block_size_N / BLOCK_N;
|
||||||
|
|
||||||
const bool use_brgemm = can_use_brgemm<at::Float8_e4m3fn>(M);
|
const bool use_brgemm = can_use_brgemm<at::Float8_e4m3fn>(M);
|
||||||
|
const bool apply_scaling_factor = fused_experts_out != nullptr;
|
||||||
|
|
||||||
int64_t B_tmp_size_per_thread = MAX_CACHE_BLOCK_SIZE * BLOCK_N * std::max(K, N);
|
int64_t B_tmp_size_per_thread = MAX_CACHE_BLOCK_SIZE * BLOCK_N * std::max(K, N);
|
||||||
|
|
||||||
@@ -455,9 +323,11 @@ void shared_expert_fp8_kernel_impl(
|
|||||||
|
|
||||||
// 2.b copy from C to output and add fused_experts_out
|
// 2.b copy from C to output and add fused_experts_out
|
||||||
scalar_t* __restrict__ out = output + mb * BLOCK_M * K + nb * BLOCK_N;
|
scalar_t* __restrict__ out = output + mb * BLOCK_M * K + nb * BLOCK_N;
|
||||||
const scalar_t* __restrict__ fused_out = fused_experts_out + mb * BLOCK_M * K + nb * BLOCK_N;
|
const scalar_t* __restrict__ fused_out =
|
||||||
|
apply_scaling_factor ? fused_experts_out + mb * BLOCK_M * K + nb * BLOCK_N : nullptr;
|
||||||
for (int64_t m = 0; m < m_size; ++m) {
|
for (int64_t m = 0; m < m_size; ++m) {
|
||||||
add_mul_stub(out + m * K, C + m * BLOCK_N, fused_out + m * K, routed_scaling_factor, n_size);
|
const scalar_t* __restrict__ fused_out_row = apply_scaling_factor ? (fused_out + m * K) : nullptr;
|
||||||
|
add_mul_stub(out + m * K, C + m * BLOCK_N, fused_out_row, routed_scaling_factor, n_size);
|
||||||
}
|
}
|
||||||
});
|
});
|
||||||
});
|
});
|
||||||
|
|||||||
@@ -1,185 +1,19 @@
|
|||||||
#include "common.h"
|
#include "common.h"
|
||||||
#include "gemm.h"
|
#include "gemm.h"
|
||||||
#include "vec.h"
|
#include "moe.h"
|
||||||
namespace {
|
|
||||||
|
|
||||||
template <typename scalar_t>
|
|
||||||
inline void copy_stub(scalar_t* __restrict__ out, const scalar_t* __restrict__ input, int64_t size) {
|
|
||||||
using Vec = at::vec::Vectorized<scalar_t>;
|
|
||||||
// no remainder
|
|
||||||
#pragma GCC unroll 4
|
|
||||||
for (int64_t d = 0; d < size; d += Vec::size()) {
|
|
||||||
Vec data = Vec::loadu(input + d);
|
|
||||||
data.store(out + d);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename scalar_t>
|
|
||||||
inline void copy_stub(scalar_t* __restrict__ out, const float* __restrict__ input, int64_t size) {
|
|
||||||
using bVec = at::vec::Vectorized<scalar_t>;
|
|
||||||
using fVec = at::vec::Vectorized<float>;
|
|
||||||
constexpr int kVecSize = bVec::size();
|
|
||||||
int64_t d;
|
|
||||||
#pragma GCC unroll 4
|
|
||||||
for (d = 0; d <= size - kVecSize; d += kVecSize) {
|
|
||||||
bVec x = bVec::loadu(input + d);
|
|
||||||
fVec x0, x1;
|
|
||||||
std::tie(x0, x1) = at::vec::convert_to_float(x);
|
|
||||||
bVec out_vec = convert_from_float_ext<scalar_t>(x0, x1);
|
|
||||||
out_vec.store(out + d);
|
|
||||||
}
|
|
||||||
for (; d < size; ++d) {
|
|
||||||
out[d] = static_cast<scalar_t>(input[d]);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename scalar_t>
|
|
||||||
inline void copy_mul_stub(scalar_t* __restrict__ out, const float* __restrict__ input, float weight, int64_t size) {
|
|
||||||
using bVec = at::vec::Vectorized<scalar_t>;
|
|
||||||
using fVec = at::vec::Vectorized<float>;
|
|
||||||
constexpr int kVecSize = bVec::size();
|
|
||||||
const fVec weight_vec = fVec(weight);
|
|
||||||
int64_t d;
|
|
||||||
#pragma GCC unroll 4
|
|
||||||
for (d = 0; d <= size - kVecSize; d += kVecSize) {
|
|
||||||
fVec data0 = fVec::loadu(input + d) * weight_vec;
|
|
||||||
fVec data1 = fVec::loadu(input + d + fVec::size()) * weight_vec;
|
|
||||||
bVec out_vec = convert_from_float_ext<scalar_t>(data0, data1);
|
|
||||||
out_vec.store(out + d);
|
|
||||||
}
|
|
||||||
for (; d < size; ++d) {
|
|
||||||
out[d] = static_cast<scalar_t>(input[d] * weight);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// acc from [topk, K] to [K]
|
|
||||||
template <typename scalar_t>
|
|
||||||
inline void sum_stub(scalar_t* __restrict__ out, const scalar_t* __restrict__ input, int64_t topk, int64_t K) {
|
|
||||||
using bVec = at::vec::Vectorized<scalar_t>;
|
|
||||||
using fVec = at::vec::Vectorized<float>;
|
|
||||||
constexpr int kVecSize = bVec::size();
|
|
||||||
if (topk == 1) {
|
|
||||||
// do copy for topk = 1
|
|
||||||
copy_stub(out, input, K);
|
|
||||||
} else {
|
|
||||||
// do sum for topk != 1
|
|
||||||
int64_t d;
|
|
||||||
#pragma GCC unroll 4
|
|
||||||
for (d = 0; d <= K - kVecSize; d += kVecSize) {
|
|
||||||
fVec sum_fvec0 = fVec(0.f);
|
|
||||||
fVec sum_fvec1 = fVec(0.f);
|
|
||||||
for (int t = 0; t < topk; ++t) {
|
|
||||||
bVec x_bvec = bVec::loadu(input + t * K + d);
|
|
||||||
fVec x_fvec0, x_fvec1;
|
|
||||||
std::tie(x_fvec0, x_fvec1) = at::vec::convert_to_float(x_bvec);
|
|
||||||
|
|
||||||
sum_fvec0 += x_fvec0;
|
|
||||||
sum_fvec1 += x_fvec1;
|
|
||||||
}
|
|
||||||
bVec out_bvec = convert_from_float_ext<scalar_t>(sum_fvec0, sum_fvec1);
|
|
||||||
out_bvec.store(out + d);
|
|
||||||
}
|
|
||||||
for (; d < K; ++d) {
|
|
||||||
float sum_val = 0.f;
|
|
||||||
for (int t = 0; t < topk; ++t) {
|
|
||||||
sum_val += static_cast<float>(input[t * K + d]);
|
|
||||||
}
|
|
||||||
out[d] = static_cast<scalar_t>(sum_val);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// out = input + input2 * scale
|
|
||||||
template <typename scalar_t>
|
|
||||||
inline void add_mul_stub(
|
|
||||||
scalar_t* __restrict__ out,
|
|
||||||
const scalar_t* __restrict__ input,
|
|
||||||
const scalar_t* __restrict__ input2,
|
|
||||||
float scale,
|
|
||||||
int64_t size) {
|
|
||||||
using bVec = at::vec::Vectorized<scalar_t>;
|
|
||||||
using fVec = at::vec::Vectorized<float>;
|
|
||||||
constexpr int kVecSize = bVec::size();
|
|
||||||
const fVec s_vec = fVec(scale);
|
|
||||||
|
|
||||||
int64_t d;
|
|
||||||
#pragma GCC unroll 4
|
|
||||||
for (d = 0; d <= size - kVecSize; d += kVecSize) {
|
|
||||||
bVec x_bvec = bVec::loadu(input + d);
|
|
||||||
fVec x0, x1;
|
|
||||||
std::tie(x0, x1) = at::vec::convert_to_float(x_bvec);
|
|
||||||
|
|
||||||
bVec y_bvec = bVec::loadu(input2 + d);
|
|
||||||
fVec y0, y1;
|
|
||||||
std::tie(y0, y1) = at::vec::convert_to_float(y_bvec);
|
|
||||||
|
|
||||||
x0 = x0 + y0 * s_vec;
|
|
||||||
x1 = x1 + y1 * s_vec;
|
|
||||||
bVec out_vec = convert_from_float_ext<scalar_t>(x0, x1);
|
|
||||||
out_vec.store(out + d);
|
|
||||||
}
|
|
||||||
for (; d < size; ++d) {
|
|
||||||
out[d] = static_cast<scalar_t>(input[d] + float(input2[d]) * scale);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename scalar_t>
|
|
||||||
inline void silu_and_mul_stub(
|
|
||||||
scalar_t* __restrict__ out, const scalar_t* __restrict__ input, const scalar_t* __restrict__ input2, int64_t size) {
|
|
||||||
using bVec = at::vec::Vectorized<scalar_t>;
|
|
||||||
using fVec = at::vec::Vectorized<float>;
|
|
||||||
const fVec one = fVec(1.f);
|
|
||||||
|
|
||||||
// no remainder
|
|
||||||
#pragma GCC unroll 4
|
|
||||||
for (int64_t d = 0; d < size; d += bVec::size()) {
|
|
||||||
bVec x = bVec::loadu(input + d);
|
|
||||||
fVec x0, x1;
|
|
||||||
std::tie(x0, x1) = at::vec::convert_to_float(x);
|
|
||||||
bVec y = bVec::loadu(input2 + d);
|
|
||||||
fVec y0, y1;
|
|
||||||
std::tie(y0, y1) = at::vec::convert_to_float(y);
|
|
||||||
x0 = x0 / (one + x0.neg().exp_u20());
|
|
||||||
x1 = x1 / (one + x1.neg().exp_u20());
|
|
||||||
x0 = x0 * y0;
|
|
||||||
x1 = x1 * y1;
|
|
||||||
bVec out_vec = convert_from_float_ext<scalar_t>(x0, x1);
|
|
||||||
out_vec.store(out + d);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
} // anonymous namespace
|
|
||||||
|
|
||||||
// TODO: stride access
|
|
||||||
template <int64_t N>
|
template <int64_t N>
|
||||||
inline void copy_bias(const float* bias_ptr, float* y_buf, int64_t m, int64_t ldn) {
|
inline void copy_bias(const float* bias_ptr, float* y_buf, int64_t m, int64_t ldn) {
|
||||||
if (bias_ptr) {
|
using Vec = at::vec::Vectorized<float>;
|
||||||
|
constexpr int kVecSize = Vec::size();
|
||||||
|
static_assert(N % kVecSize == 0, "copy_bias requires N to be a multiple of Vectorized<float>::size()");
|
||||||
|
const bool has_bias = bias_ptr != nullptr;
|
||||||
|
const Vec zero_vec(0.f);
|
||||||
for (int i = 0; i < m; ++i) {
|
for (int i = 0; i < m; ++i) {
|
||||||
int j = 0;
|
|
||||||
#if defined(CPU_CAPABILITY_AVX512)
|
|
||||||
#pragma GCC unroll 2
|
#pragma GCC unroll 2
|
||||||
for (; j < N; j += 16) {
|
for (int j = 0; j < N; j += kVecSize) {
|
||||||
__m512 bias_vec = _mm512_loadu_ps(bias_ptr + j);
|
Vec vec = has_bias ? Vec::loadu(bias_ptr + j) : zero_vec;
|
||||||
_mm512_storeu_ps(y_buf + i * ldn + j, bias_vec);
|
vec.store(y_buf + i * ldn + j);
|
||||||
}
|
|
||||||
#endif
|
|
||||||
for (; j < N; ++j) {
|
|
||||||
y_buf[i * ldn + j] = bias_ptr[j];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
} else { // initialize to zero
|
|
||||||
for (int i = 0; i < m; ++i) {
|
|
||||||
int j = 0;
|
|
||||||
#if defined(CPU_CAPABILITY_AVX512)
|
|
||||||
#pragma GCC unroll 2
|
|
||||||
for (; j < N; j += 16) {
|
|
||||||
__m512 zero_vec = _mm512_setzero_ps();
|
|
||||||
_mm512_storeu_ps(y_buf + i * ldn + j, zero_vec);
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
for (; j < N; ++j) {
|
|
||||||
y_buf[i * ldn + j] = 0;
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -1,114 +1,9 @@
|
|||||||
#include "common.h"
|
#include "common.h"
|
||||||
#include "gemm.h"
|
#include "gemm.h"
|
||||||
#include "vec.h"
|
#include "moe.h"
|
||||||
|
|
||||||
namespace {
|
namespace {
|
||||||
|
|
||||||
template <typename scalar_t>
|
|
||||||
inline void copy_stub(scalar_t* __restrict__ out, const scalar_t* __restrict__ input, int64_t size) {
|
|
||||||
using Vec = at::vec::Vectorized<scalar_t>;
|
|
||||||
// no remainder
|
|
||||||
#pragma GCC unroll 4
|
|
||||||
for (int64_t d = 0; d < size; d += Vec::size()) {
|
|
||||||
Vec data = Vec::loadu(input + d);
|
|
||||||
data.store(out + d);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
template <>
|
|
||||||
inline void copy_stub<uint8_t>(uint8_t* __restrict__ out, const uint8_t* __restrict__ input, int64_t size) {
|
|
||||||
// size might be 64x + 32
|
|
||||||
std::memcpy(out, input, size * sizeof(uint8_t));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename scalar_t>
|
|
||||||
inline void copy_mul_stub(scalar_t* __restrict__ out, const float* __restrict__ input, float weight, int64_t size) {
|
|
||||||
using bVec = at::vec::Vectorized<scalar_t>;
|
|
||||||
using fVec = at::vec::Vectorized<float>;
|
|
||||||
constexpr int kVecSize = bVec::size();
|
|
||||||
const fVec weight_vec = fVec(weight);
|
|
||||||
int64_t d;
|
|
||||||
#pragma GCC unroll 4
|
|
||||||
for (d = 0; d <= size - kVecSize; d += kVecSize) {
|
|
||||||
fVec data0 = fVec::loadu(input + d) * weight_vec;
|
|
||||||
fVec data1 = fVec::loadu(input + d + fVec::size()) * weight_vec;
|
|
||||||
bVec out_vec = convert_from_float_ext<scalar_t>(data0, data1);
|
|
||||||
out_vec.store(out + d);
|
|
||||||
}
|
|
||||||
for (; d < size; ++d) {
|
|
||||||
out[d] = static_cast<scalar_t>(input[d] * weight);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// acc from [topk, K] to [K]
|
|
||||||
template <typename scalar_t>
|
|
||||||
inline void sum_stub(scalar_t* __restrict__ out, const scalar_t* __restrict__ input, int64_t topk, int64_t K) {
|
|
||||||
using bVec = at::vec::Vectorized<scalar_t>;
|
|
||||||
using fVec = at::vec::Vectorized<float>;
|
|
||||||
constexpr int kVecSize = bVec::size();
|
|
||||||
if (topk == 1) {
|
|
||||||
// do copy for topk = 1
|
|
||||||
copy_stub(out, input, K);
|
|
||||||
} else {
|
|
||||||
// do sum for topk != 1
|
|
||||||
int64_t d;
|
|
||||||
#pragma GCC unroll 4
|
|
||||||
for (d = 0; d <= K - kVecSize; d += kVecSize) {
|
|
||||||
fVec sum_fvec0 = fVec(0.f);
|
|
||||||
fVec sum_fvec1 = fVec(0.f);
|
|
||||||
for (int t = 0; t < topk; ++t) {
|
|
||||||
bVec x_bvec = bVec::loadu(input + t * K + d);
|
|
||||||
fVec x_fvec0, x_fvec1;
|
|
||||||
std::tie(x_fvec0, x_fvec1) = at::vec::convert_to_float(x_bvec);
|
|
||||||
|
|
||||||
sum_fvec0 += x_fvec0;
|
|
||||||
sum_fvec1 += x_fvec1;
|
|
||||||
}
|
|
||||||
bVec out_bvec = convert_from_float_ext<scalar_t>(sum_fvec0, sum_fvec1);
|
|
||||||
out_bvec.store(out + d);
|
|
||||||
}
|
|
||||||
for (; d < K; ++d) {
|
|
||||||
float sum_val = 0.f;
|
|
||||||
for (int t = 0; t < topk; ++t) {
|
|
||||||
sum_val += static_cast<float>(input[t * K + d]);
|
|
||||||
}
|
|
||||||
out[d] = static_cast<scalar_t>(sum_val);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// out = input + input2 * scale
|
|
||||||
template <typename scalar_t>
|
|
||||||
inline void add_mul_stub(
|
|
||||||
scalar_t* __restrict__ out,
|
|
||||||
const float* __restrict__ input,
|
|
||||||
const scalar_t* __restrict__ input2,
|
|
||||||
float scale,
|
|
||||||
int64_t size) {
|
|
||||||
using bVec = at::vec::Vectorized<scalar_t>;
|
|
||||||
using fVec = at::vec::Vectorized<float>;
|
|
||||||
constexpr int kVecSize = bVec::size();
|
|
||||||
const fVec s_vec = fVec(scale);
|
|
||||||
int64_t d;
|
|
||||||
#pragma GCC unroll 4
|
|
||||||
for (d = 0; d <= size - kVecSize; d += kVecSize) {
|
|
||||||
fVec x0 = fVec::loadu(input + d);
|
|
||||||
fVec x1 = fVec::loadu(input + d + fVec::size());
|
|
||||||
|
|
||||||
bVec y_bvec = bVec::loadu(input2 + d);
|
|
||||||
fVec y0, y1;
|
|
||||||
std::tie(y0, y1) = at::vec::convert_to_float(y_bvec);
|
|
||||||
|
|
||||||
x0 = x0 + y0 * s_vec;
|
|
||||||
x1 = x1 + y1 * s_vec;
|
|
||||||
bVec out_vec = convert_from_float_ext<scalar_t>(x0, x1);
|
|
||||||
out_vec.store(out + d);
|
|
||||||
}
|
|
||||||
for (; d < size; ++d) {
|
|
||||||
out[d] = static_cast<scalar_t>(input[d] + float(input2[d]) * scale);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename scalar_t, int BLOCK_N>
|
template <typename scalar_t, int BLOCK_N>
|
||||||
inline void silu_and_mul(
|
inline void silu_and_mul(
|
||||||
scalar_t* __restrict__ C,
|
scalar_t* __restrict__ C,
|
||||||
@@ -885,6 +780,7 @@ void shared_expert_int8_kernel_impl(
|
|||||||
const int64_t stride_n = packed_K;
|
const int64_t stride_n = packed_K;
|
||||||
|
|
||||||
const bool use_brgemm = can_use_brgemm<int8_t>(M);
|
const bool use_brgemm = can_use_brgemm<int8_t>(M);
|
||||||
|
const bool apply_scaling_factor = fused_experts_out != nullptr;
|
||||||
|
|
||||||
// here we only parallel on half of 2N to fuse silu_and_mul with gemm
|
// here we only parallel on half of 2N to fuse silu_and_mul with gemm
|
||||||
parallel_2d(MB, NB, [&](int64_t mb0, int64_t mb1, int64_t nb0, int64_t nb1) {
|
parallel_2d(MB, NB, [&](int64_t mb0, int64_t mb1, int64_t nb0, int64_t nb1) {
|
||||||
@@ -1034,9 +930,11 @@ void shared_expert_int8_kernel_impl(
|
|||||||
|
|
||||||
// 2.b copy from C to output and add fused_experts_out
|
// 2.b copy from C to output and add fused_experts_out
|
||||||
scalar_t* __restrict__ out = output + mb * BLOCK_M * K + nb * BLOCK_N;
|
scalar_t* __restrict__ out = output + mb * BLOCK_M * K + nb * BLOCK_N;
|
||||||
const scalar_t* __restrict__ fused_out = fused_experts_out + mb * BLOCK_M * K + nb * BLOCK_N;
|
const scalar_t* __restrict__ fused_out =
|
||||||
|
apply_scaling_factor ? fused_experts_out + mb * BLOCK_M * K + nb * BLOCK_N : nullptr;
|
||||||
for (int64_t m = 0; m < m_size; ++m) {
|
for (int64_t m = 0; m < m_size; ++m) {
|
||||||
add_mul_stub(out + m * K, C + m * BLOCK_N, fused_out + m * K, routed_scaling_factor, n_size);
|
const scalar_t* __restrict__ fused_out_row = apply_scaling_factor ? (fused_out + m * K) : nullptr;
|
||||||
|
add_mul_stub(out + m * K, C + m * BLOCK_N, fused_out_row, routed_scaling_factor, n_size);
|
||||||
}
|
}
|
||||||
});
|
});
|
||||||
|
|
||||||
|
|||||||
@@ -226,8 +226,8 @@ at::Tensor shared_expert_cpu(
|
|||||||
at::Tensor& hidden_states,
|
at::Tensor& hidden_states,
|
||||||
at::Tensor& w1,
|
at::Tensor& w1,
|
||||||
at::Tensor& w2,
|
at::Tensor& w2,
|
||||||
at::Tensor& fused_experts_out,
|
const std::optional<at::Tensor>& fused_experts_out,
|
||||||
double routed_scaling_factor,
|
const std::optional<double> routed_scaling_factor,
|
||||||
bool inplace,
|
bool inplace,
|
||||||
bool use_int8_w8a8,
|
bool use_int8_w8a8,
|
||||||
bool use_fp8_w8a16,
|
bool use_fp8_w8a16,
|
||||||
@@ -554,7 +554,7 @@ TORCH_LIBRARY_FRAGMENT(sgl_kernel, m) {
|
|||||||
|
|
||||||
// shared expert
|
// shared expert
|
||||||
m.def(
|
m.def(
|
||||||
"shared_expert_cpu(Tensor hidden_states, Tensor w1, Tensor w2, Tensor fused_experts_out, float "
|
"shared_expert_cpu(Tensor hidden_states, Tensor w1, Tensor w2, Tensor? fused_experts_out, float? "
|
||||||
"routed_scaling_factor, bool inplace, bool use_int8_w8a8, bool use_fp8_w8a16, Tensor? w1_scale, Tensor? "
|
"routed_scaling_factor, bool inplace, bool use_int8_w8a8, bool use_fp8_w8a16, Tensor? w1_scale, Tensor? "
|
||||||
"w2_scale, int[]? block_size, bool is_vnni) -> Tensor");
|
"w2_scale, int[]? block_size, bool is_vnni) -> Tensor");
|
||||||
m.impl("shared_expert_cpu", torch::kCPU, &shared_expert_cpu);
|
m.impl("shared_expert_cpu", torch::kCPU, &shared_expert_cpu);
|
||||||
|
|||||||
@@ -300,35 +300,16 @@ class TestFusedExperts(CustomTestCase):
|
|||||||
)
|
)
|
||||||
score = torch.softmax(score, dim=-1, dtype=torch.float32)
|
score = torch.softmax(score, dim=-1, dtype=torch.float32)
|
||||||
topk_weight, topk_ids = torch.topk(score, topk)
|
topk_weight, topk_ids = torch.topk(score, topk)
|
||||||
awq_w13_weight_pack = []
|
awq_w13_weight_pack, awq_w13_zero_pack, awq_w13_scales_pack = (
|
||||||
awq_w13_zero_pack = []
|
|
||||||
awq_w13_scales_pack = []
|
|
||||||
awq_w2_weight_pack = []
|
|
||||||
awq_w2_zero_pack = []
|
|
||||||
awq_w2_scales_pack = []
|
|
||||||
for i in range(E):
|
|
||||||
packed_weight_13_i, packed_zero_13_i, packed_scales_13_i = (
|
|
||||||
torch.ops.sgl_kernel.convert_weight_packed_scale_zp(
|
torch.ops.sgl_kernel.convert_weight_packed_scale_zp(
|
||||||
awq_w13_weight[i], awq_w13_zero[i], awq_w13_scales[i]
|
awq_w13_weight, awq_w13_zero, awq_w13_scales
|
||||||
)
|
)
|
||||||
)
|
)
|
||||||
awq_w13_weight_pack.append(packed_weight_13_i)
|
awq_w2_weight_pack, awq_w2_zero_pack, awq_w2_scales_pack = (
|
||||||
awq_w13_zero_pack.append(packed_zero_13_i)
|
|
||||||
awq_w13_scales_pack.append(packed_scales_13_i)
|
|
||||||
packed_weight_2_i, packed_zero_2_i, packed_scales_2_i = (
|
|
||||||
torch.ops.sgl_kernel.convert_weight_packed_scale_zp(
|
torch.ops.sgl_kernel.convert_weight_packed_scale_zp(
|
||||||
awq_w2_weight[i], awq_w2_zero[i], awq_w2_scales[i]
|
awq_w2_weight, awq_w2_zero, awq_w2_scales
|
||||||
)
|
)
|
||||||
)
|
)
|
||||||
awq_w2_weight_pack.append(packed_weight_2_i)
|
|
||||||
awq_w2_zero_pack.append(packed_zero_2_i)
|
|
||||||
awq_w2_scales_pack.append(packed_scales_2_i)
|
|
||||||
awq_w13_weight_pack = torch.stack(awq_w13_weight_pack).detach()
|
|
||||||
awq_w13_zero_pack = torch.stack(awq_w13_zero_pack).detach()
|
|
||||||
awq_w13_scales_pack = torch.stack(awq_w13_scales_pack).detach()
|
|
||||||
awq_w2_weight_pack = torch.stack(awq_w2_weight_pack).detach()
|
|
||||||
awq_w2_zero_pack = torch.stack(awq_w2_zero_pack).detach()
|
|
||||||
awq_w2_scales_pack = torch.stack(awq_w2_scales_pack).detach()
|
|
||||||
|
|
||||||
out = kernel.fused_experts_cpu(
|
out = kernel.fused_experts_cpu(
|
||||||
a,
|
a,
|
||||||
|
|||||||
@@ -2,12 +2,10 @@ import itertools
|
|||||||
import math
|
import math
|
||||||
import unittest
|
import unittest
|
||||||
|
|
||||||
# TODO: use interface in cpu.py
|
|
||||||
import torch
|
import torch
|
||||||
from utils import (
|
from utils import (
|
||||||
BLOCK_K,
|
BLOCK_K,
|
||||||
BLOCK_N,
|
BLOCK_N,
|
||||||
SiluAndMul,
|
|
||||||
factor_for_scale,
|
factor_for_scale,
|
||||||
fp8_max,
|
fp8_max,
|
||||||
fp8_min,
|
fp8_min,
|
||||||
@@ -18,7 +16,6 @@ from utils import (
|
|||||||
torch_w8a8_per_column_moe,
|
torch_w8a8_per_column_moe,
|
||||||
)
|
)
|
||||||
|
|
||||||
from sglang.srt.server_args import ServerArgs, set_global_server_args_for_scheduler
|
|
||||||
from sglang.test.test_utils import CustomTestCase
|
from sglang.test.test_utils import CustomTestCase
|
||||||
|
|
||||||
torch.manual_seed(1234)
|
torch.manual_seed(1234)
|
||||||
@@ -29,37 +26,41 @@ class TestSharedExpert(CustomTestCase):
|
|||||||
N = [32, 32 * 4]
|
N = [32, 32 * 4]
|
||||||
K = [32, 32 * 2]
|
K = [32, 32 * 2]
|
||||||
routed_scaling_factor = [16]
|
routed_scaling_factor = [16]
|
||||||
|
apply_scaling_factor = [True, False]
|
||||||
|
|
||||||
M_fp8 = [2, 12]
|
M_fp8 = [2, 12]
|
||||||
N_fp8 = [512]
|
N_fp8 = [512]
|
||||||
K_fp8 = [256]
|
K_fp8 = [256]
|
||||||
|
|
||||||
def _bf16_shared_expert(self, m, n, k, routed_scaling_factor):
|
def _bf16_shared_expert(self, m, n, k, routed_scaling_factor, apply_scaling_factor):
|
||||||
dtype = torch.bfloat16
|
dtype = torch.bfloat16
|
||||||
prepack = True
|
|
||||||
|
|
||||||
hidden_states = torch.randn(m, k, dtype=dtype) / k
|
hidden_states = torch.randn(m, k, dtype=dtype) / k
|
||||||
w1 = torch.randn(2 * n, k, dtype=dtype)
|
w1 = torch.randn(2 * n, k, dtype=dtype)
|
||||||
w2 = torch.randn(k, n, dtype=dtype)
|
w2 = torch.randn(k, n, dtype=dtype)
|
||||||
fused_output = torch.randn(m, k, dtype=dtype) / k
|
fused_output = (
|
||||||
|
torch.randn(m, k, dtype=dtype) / k if apply_scaling_factor else None
|
||||||
|
)
|
||||||
|
routed_scaling_factor = routed_scaling_factor if apply_scaling_factor else None
|
||||||
|
|
||||||
# fused moe mutates content in hs
|
# fused moe mutates content in hs
|
||||||
hidden_states2 = hidden_states.clone()
|
hidden_states2 = hidden_states.clone()
|
||||||
|
|
||||||
# bfloat16
|
# bfloat16
|
||||||
ref = torch_naive_moe(
|
ref = torch_naive_moe(
|
||||||
hidden_states.float(),
|
|
||||||
w1.float(),
|
|
||||||
w2.float(),
|
|
||||||
fused_output.float(),
|
|
||||||
routed_scaling_factor,
|
|
||||||
).to(dtype=dtype)
|
|
||||||
res = torch.ops.sgl_kernel.shared_expert_cpu(
|
|
||||||
hidden_states,
|
hidden_states,
|
||||||
w1,
|
w1,
|
||||||
w2,
|
w2,
|
||||||
fused_output,
|
fused_output,
|
||||||
routed_scaling_factor,
|
routed_scaling_factor,
|
||||||
|
output_dtype=dtype,
|
||||||
|
)
|
||||||
|
out = torch.ops.sgl_kernel.shared_expert_cpu(
|
||||||
|
hidden_states2,
|
||||||
|
w1,
|
||||||
|
w2,
|
||||||
|
fused_output,
|
||||||
|
routed_scaling_factor,
|
||||||
True,
|
True,
|
||||||
False,
|
False,
|
||||||
False,
|
False,
|
||||||
@@ -70,7 +71,7 @@ class TestSharedExpert(CustomTestCase):
|
|||||||
)
|
)
|
||||||
|
|
||||||
atol = rtol = precision[ref.dtype]
|
atol = rtol = precision[ref.dtype]
|
||||||
torch.testing.assert_close(ref, res, atol=atol, rtol=rtol)
|
torch.testing.assert_close(ref, out, atol=atol, rtol=rtol)
|
||||||
|
|
||||||
def test_bf16_shared_expert(self):
|
def test_bf16_shared_expert(self):
|
||||||
for params in itertools.product(
|
for params in itertools.product(
|
||||||
@@ -78,39 +79,43 @@ class TestSharedExpert(CustomTestCase):
|
|||||||
self.N,
|
self.N,
|
||||||
self.K,
|
self.K,
|
||||||
self.routed_scaling_factor,
|
self.routed_scaling_factor,
|
||||||
|
self.apply_scaling_factor,
|
||||||
):
|
):
|
||||||
with self.subTest(
|
with self.subTest(
|
||||||
m=params[0],
|
m=params[0],
|
||||||
n=params[1],
|
n=params[1],
|
||||||
k=params[2],
|
k=params[2],
|
||||||
routed_scaling_factor=params[3],
|
routed_scaling_factor=params[3],
|
||||||
|
apply_scaling_factor=params[4],
|
||||||
):
|
):
|
||||||
self._bf16_shared_expert(*params)
|
self._bf16_shared_expert(*params)
|
||||||
|
|
||||||
def _int8_shared_expert(self, m, n, k, routed_scaling_factor):
|
def _int8_shared_expert(self, m, n, k, routed_scaling_factor, apply_scaling_factor):
|
||||||
dtype = torch.bfloat16
|
dtype = torch.bfloat16
|
||||||
prepack = True
|
|
||||||
|
|
||||||
hidden_states = torch.randn(m, k, dtype=dtype) / k
|
hidden_states = torch.randn(m, k, dtype=dtype) / k
|
||||||
w1 = torch.randn(2 * n, k, dtype=dtype)
|
w1 = torch.randn(2 * n, k, dtype=dtype)
|
||||||
w2 = torch.randn(k, n, dtype=dtype)
|
w2 = torch.randn(k, n, dtype=dtype)
|
||||||
fused_output = torch.randn(m, k, dtype=dtype) / k
|
fused_output = (
|
||||||
|
torch.randn(m, k, dtype=dtype) / k if apply_scaling_factor else None
|
||||||
|
)
|
||||||
|
routed_scaling_factor = routed_scaling_factor if apply_scaling_factor else None
|
||||||
|
|
||||||
# fused moe mutates content in hs
|
# fused moe mutates content in hs
|
||||||
hidden_states2 = hidden_states.clone()
|
hidden_states2 = hidden_states.clone()
|
||||||
|
|
||||||
w1_q, w1_s = per_token_quant_int8(w1)
|
w1_q, w1_s = per_token_quant_int8(w1)
|
||||||
w2_q, w2_s = per_token_quant_int8(w2)
|
w2_q, w2_s = per_token_quant_int8(w2)
|
||||||
ref2 = torch_w8a8_per_column_moe(
|
ref = torch_w8a8_per_column_moe(
|
||||||
hidden_states2.float(),
|
hidden_states,
|
||||||
w1_q,
|
w1_q,
|
||||||
w2_q,
|
w2_q,
|
||||||
w1_s,
|
w1_s,
|
||||||
w2_s,
|
w2_s,
|
||||||
fused_output.float(),
|
fused_output,
|
||||||
routed_scaling_factor,
|
routed_scaling_factor,
|
||||||
).to(dtype=dtype)
|
)
|
||||||
res2 = torch.ops.sgl_kernel.shared_expert_cpu(
|
out = torch.ops.sgl_kernel.shared_expert_cpu(
|
||||||
hidden_states2,
|
hidden_states2,
|
||||||
w1_q,
|
w1_q,
|
||||||
w2_q,
|
w2_q,
|
||||||
@@ -125,8 +130,8 @@ class TestSharedExpert(CustomTestCase):
|
|||||||
False,
|
False,
|
||||||
)
|
)
|
||||||
|
|
||||||
atol = rtol = precision[ref2.dtype]
|
atol = rtol = precision[ref.dtype]
|
||||||
torch.testing.assert_close(ref2, res2, atol=atol, rtol=rtol)
|
torch.testing.assert_close(ref, out, atol=atol, rtol=rtol)
|
||||||
|
|
||||||
def test_int8_shared_expert(self):
|
def test_int8_shared_expert(self):
|
||||||
for params in itertools.product(
|
for params in itertools.product(
|
||||||
@@ -134,57 +139,64 @@ class TestSharedExpert(CustomTestCase):
|
|||||||
self.N,
|
self.N,
|
||||||
self.K,
|
self.K,
|
||||||
self.routed_scaling_factor,
|
self.routed_scaling_factor,
|
||||||
|
self.apply_scaling_factor,
|
||||||
):
|
):
|
||||||
with self.subTest(
|
with self.subTest(
|
||||||
m=params[0],
|
m=params[0],
|
||||||
n=params[1],
|
n=params[1],
|
||||||
k=params[2],
|
k=params[2],
|
||||||
routed_scaling_factor=params[3],
|
routed_scaling_factor=params[3],
|
||||||
|
apply_scaling_factor=params[4],
|
||||||
):
|
):
|
||||||
self._int8_shared_expert(*params)
|
self._int8_shared_expert(*params)
|
||||||
|
|
||||||
def _fp8_shared_expert(self, M, N, K, routed_scaling_factor):
|
def _fp8_shared_expert(self, m, n, k, routed_scaling_factor, apply_scaling_factor):
|
||||||
set_global_server_args_for_scheduler(ServerArgs(model_path="dummy"))
|
|
||||||
|
|
||||||
dtype = torch.bfloat16
|
dtype = torch.bfloat16
|
||||||
prepack = True
|
|
||||||
|
|
||||||
a = torch.randn(M, K, dtype=dtype) / math.sqrt(K)
|
hidden_states = torch.randn(m, k, dtype=dtype) / math.sqrt(k)
|
||||||
|
|
||||||
w1_fp32 = torch.randn(1, 2 * N, K)
|
w1_fp32 = torch.randn(1, 2 * n, k)
|
||||||
w1 = (w1_fp32 * fp8_max).clamp(min=fp8_min, max=fp8_max).to(torch.float8_e4m3fn)
|
w1 = (w1_fp32 * fp8_max).clamp(min=fp8_min, max=fp8_max).to(torch.float8_e4m3fn)
|
||||||
|
|
||||||
w2_fp32 = torch.randn(1, K, N)
|
w2_fp32 = torch.randn(1, k, n)
|
||||||
w2 = (w2_fp32 * fp8_max).clamp(min=fp8_min, max=fp8_max).to(torch.float8_e4m3fn)
|
w2 = (w2_fp32 * fp8_max).clamp(min=fp8_min, max=fp8_max).to(torch.float8_e4m3fn)
|
||||||
|
|
||||||
w1s = torch.randn(1, 2 * N // BLOCK_N, K // BLOCK_K) * factor_for_scale
|
w1s = torch.randn(1, 2 * n // BLOCK_N, k // BLOCK_K) * factor_for_scale
|
||||||
w2s = torch.randn(1, K // BLOCK_N, N // BLOCK_K) * factor_for_scale
|
w2s = torch.randn(1, k // BLOCK_N, n // BLOCK_K) * factor_for_scale
|
||||||
|
|
||||||
w1_scaled = scaled_weight(w1, w1s).view(2 * N, K)
|
w1_scaled = scaled_weight(w1, w1s).view(2 * n, k)
|
||||||
w2_scaled = scaled_weight(w2, w2s).view(K, N)
|
w2_scaled = scaled_weight(w2, w2s).view(k, n)
|
||||||
|
|
||||||
# change back to 2D
|
# change back to 2D
|
||||||
w1, w2 = w1.squeeze(0), w2.squeeze(0)
|
w1, w2 = w1.squeeze(0), w2.squeeze(0)
|
||||||
w1s, w2s = w1s.squeeze(0), w2s.squeeze(0)
|
w1s, w2s = w1s.squeeze(0), w2s.squeeze(0)
|
||||||
w1_scaled, w2_scaled = w1_scaled.squeeze(0), w2_scaled.squeeze(0)
|
w1_scaled, w2_scaled = w1_scaled.squeeze(0), w2_scaled.squeeze(0)
|
||||||
|
|
||||||
fused_out = torch.randn(M, K, dtype=dtype) / math.sqrt(K)
|
fused_output = (
|
||||||
a2 = a.clone()
|
torch.randn(m, k, dtype=dtype) / math.sqrt(k)
|
||||||
|
if apply_scaling_factor
|
||||||
|
else None
|
||||||
|
)
|
||||||
|
routed_scaling_factor = routed_scaling_factor if apply_scaling_factor else None
|
||||||
|
hidden_states2 = hidden_states.clone()
|
||||||
|
|
||||||
# ref
|
# ref with bfloat16
|
||||||
ic0 = torch.matmul(a.float(), w1_scaled.transpose(0, 1))
|
ref = torch_naive_moe(
|
||||||
ic1 = SiluAndMul(ic0)
|
hidden_states,
|
||||||
shared_out = torch.matmul(ic1, w2_scaled.transpose(0, 1))
|
w1_scaled,
|
||||||
ref_out = shared_out + fused_out.float() * routed_scaling_factor
|
w2_scaled,
|
||||||
ref_out = ref_out.to(dtype=dtype)
|
fused_output,
|
||||||
|
routed_scaling_factor,
|
||||||
|
output_dtype=dtype,
|
||||||
|
)
|
||||||
|
|
||||||
w1 = torch.ops.sgl_kernel.convert_weight_packed(w1) # [2N, K]
|
w1 = torch.ops.sgl_kernel.convert_weight_packed(w1) # [2N, K]
|
||||||
w2 = torch.ops.sgl_kernel.convert_weight_packed(w2) # [K, N]
|
w2 = torch.ops.sgl_kernel.convert_weight_packed(w2) # [K, N]
|
||||||
out = torch.ops.sgl_kernel.shared_expert_cpu(
|
out = torch.ops.sgl_kernel.shared_expert_cpu(
|
||||||
a2,
|
hidden_states2,
|
||||||
w1,
|
w1,
|
||||||
w2,
|
w2,
|
||||||
fused_out,
|
fused_output,
|
||||||
routed_scaling_factor,
|
routed_scaling_factor,
|
||||||
True,
|
True,
|
||||||
False,
|
False,
|
||||||
@@ -195,8 +207,8 @@ class TestSharedExpert(CustomTestCase):
|
|||||||
True,
|
True,
|
||||||
)
|
)
|
||||||
|
|
||||||
atol = rtol = precision[ref_out.dtype]
|
atol = rtol = precision[ref.dtype]
|
||||||
torch.testing.assert_close(ref_out, out, atol=atol, rtol=rtol)
|
torch.testing.assert_close(ref, out, atol=atol, rtol=rtol)
|
||||||
|
|
||||||
def test_fp8_shared_expert(self):
|
def test_fp8_shared_expert(self):
|
||||||
for params in itertools.product(
|
for params in itertools.product(
|
||||||
@@ -204,12 +216,14 @@ class TestSharedExpert(CustomTestCase):
|
|||||||
self.N_fp8,
|
self.N_fp8,
|
||||||
self.K_fp8,
|
self.K_fp8,
|
||||||
self.routed_scaling_factor,
|
self.routed_scaling_factor,
|
||||||
|
self.apply_scaling_factor,
|
||||||
):
|
):
|
||||||
with self.subTest(
|
with self.subTest(
|
||||||
M=params[0],
|
m=params[0],
|
||||||
N=params[1],
|
n=params[1],
|
||||||
K=params[2],
|
k=params[2],
|
||||||
routed_scaling_factor=params[3],
|
routed_scaling_factor=params[3],
|
||||||
|
apply_scaling_factor=params[4],
|
||||||
):
|
):
|
||||||
self._fp8_shared_expert(*params)
|
self._fp8_shared_expert(*params)
|
||||||
|
|
||||||
|
|||||||
+18
-4
@@ -126,16 +126,28 @@ def native_w8a8_per_token_matmul(A, B, As, Bs, bias, output_dtype=torch.bfloat16
|
|||||||
return C.reshape(origin_C_shape).to(output_dtype)
|
return C.reshape(origin_C_shape).to(output_dtype)
|
||||||
|
|
||||||
|
|
||||||
def torch_naive_moe(a, w1, w2, b, routed_scaling_factor):
|
def torch_naive_moe(a, w1, w2, b, routed_scaling_factor, output_dtype=torch.bfloat16):
|
||||||
|
|
||||||
|
a = a.to(torch.float32)
|
||||||
|
w1 = w1.to(torch.float32)
|
||||||
|
w2 = w2.to(torch.float32)
|
||||||
|
b = b.to(torch.float32) if b is not None else None
|
||||||
|
|
||||||
ic1 = torch.matmul(a, w1.transpose(0, 1))
|
ic1 = torch.matmul(a, w1.transpose(0, 1))
|
||||||
ic2 = SiluAndMul(ic1)
|
ic2 = SiluAndMul(ic1)
|
||||||
ic3 = torch.matmul(ic2, w2.transpose(0, 1))
|
ic3 = torch.matmul(ic2, w2.transpose(0, 1))
|
||||||
|
|
||||||
return ic3 + b * routed_scaling_factor
|
out = ic3 if b is None else ic3 + b * routed_scaling_factor
|
||||||
|
|
||||||
|
return out.to(output_dtype)
|
||||||
|
|
||||||
|
|
||||||
def torch_w8a8_per_column_moe(a, w1_q, w2_q, w1_s, w2_s, b, routed_scaling_factor):
|
def torch_w8a8_per_column_moe(
|
||||||
|
a, w1_q, w2_q, w1_s, w2_s, b, routed_scaling_factor, output_dtype=torch.bfloat16
|
||||||
|
):
|
||||||
|
|
||||||
|
a = a.to(torch.float32)
|
||||||
|
b = b.to(torch.float32) if b is not None else None
|
||||||
|
|
||||||
# Perform per-token quantization
|
# Perform per-token quantization
|
||||||
a_q, a_s = per_token_quant_int8(a)
|
a_q, a_s = per_token_quant_int8(a)
|
||||||
@@ -150,7 +162,9 @@ def torch_w8a8_per_column_moe(a, w1_q, w2_q, w1_s, w2_s, b, routed_scaling_facto
|
|||||||
a1_q, w2_q, a1_s, w2_s, bias=None, output_dtype=torch.float32
|
a1_q, w2_q, a1_s, w2_s, bias=None, output_dtype=torch.float32
|
||||||
)
|
)
|
||||||
|
|
||||||
return ic3 + b * routed_scaling_factor
|
out = ic3 if b is None else ic3 + b * routed_scaling_factor
|
||||||
|
|
||||||
|
return out.to(output_dtype)
|
||||||
|
|
||||||
|
|
||||||
def scaled_weight(weight, scales):
|
def scaled_weight(weight, scales):
|
||||||
|
|||||||
Reference in New Issue
Block a user