Download sglang/sgl-kernel/csrc/cpu/moe_fp8.cpp from FasterDFlash/Hanrui: direct link, hf CLI and curl.
- Browser
- Download file 18.5 kB
-
https://huggingface.co/FasterDFlash/Hanrui/resolve/main/sglang/sgl-kernel/csrc/cpu/moe_fp8.cpp
- Command line
-
hf download hf://FasterDFlash/Hanrui/sglang/sgl-kernel/csrc/cpu/moe_fp8.cpp
-
curl -L -o moe_fp8.cpp https://huggingface.co/FasterDFlash/Hanrui/resolve/main/sglang/sgl-kernel/csrc/cpu/moe_fp8.cpp
18.5 kB
| 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 | |
| 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; | |
| 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; | |
| 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; | |
| 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 | |
| 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> | |
| void fused_experts_fp8_kernel_impl( | |
| scalar_t* __restrict__ output, | |
| scalar_t* __restrict__ ic0, | |
| scalar_t* __restrict__ ic1, | |
| scalar_t* __restrict__ ic2, | |
| scalar_t* __restrict__ A_tmp, | |
| scalar_t* __restrict__ B_tmp, | |
| float* __restrict__ C_tmp, | |
| const scalar_t* __restrict__ input, | |
| const at::Float8_e4m3fn* __restrict__ packed_w1, | |
| const at::Float8_e4m3fn* __restrict__ packed_w2, | |
| const float* __restrict__ w1s, | |
| const float* __restrict__ w2s, | |
| int64_t block_size_N, | |
| int64_t block_size_K, | |
| const float* __restrict__ topk_weights, | |
| const int32_t* __restrict__ sorted_ids, | |
| const int32_t* __restrict__ expert_ids, | |
| const int32_t* __restrict__ offsets, | |
| int64_t M, | |
| int64_t N, | |
| int64_t K, | |
| int64_t E, | |
| int64_t topk, | |
| int64_t num_tokens_post_pad) { | |
| constexpr int64_t BLOCK_M = block_size_m(); | |
| constexpr int64_t BLOCK_N = block_size_n(); | |
| // stage 1: intermediate_cache0 = hidden_states @ w1 | |
| const int64_t MB = div_up(num_tokens_post_pad, BLOCK_M); | |
| const int64_t NB = div_up(2 * N, BLOCK_N); | |
| int64_t scale_size_N = div_up(2 * N, block_size_N); | |
| int64_t scale_size_K = div_up(K, block_size_K); | |
| int64_t blocks_n_per_group = block_size_N / BLOCK_N; | |
| const int64_t stride_e = 2 * N * K; | |
| const int64_t stride_n = K; | |
| int64_t avg_M = std::max(int64_t(1), M * topk / E); | |
| const bool use_brgemm = can_use_brgemm<at::Float8_e4m3fn>(avg_M); | |
| int64_t B_tmp_size_per_thread = MAX_CACHE_BLOCK_SIZE * BLOCK_N * std::max(K, N); | |
| // 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) { | |
| // get local pointers | |
| int tid = get_thread_num(); | |
| scalar_t* __restrict__ A = A_tmp + tid * BLOCK_M * K; | |
| loop_2d<at::Float8_e4m3fn>(mb0, mb1, nb0, nb1, BLOCK_N * K, [&](int64_t mb, int64_t nb, int64_t nb_offset) { | |
| int64_t n_size = std::min(2 * N - nb * BLOCK_N, BLOCK_N); | |
| // B shape [K, n_size] in vnni format | |
| int32_t expert_id = expert_ids[mb]; | |
| const at::Float8_e4m3fn* __restrict__ B = packed_w1 + expert_id * stride_e + nb * BLOCK_N * stride_n; | |
| const float* __restrict__ Bs = | |
| w1s + expert_id * scale_size_N * scale_size_K + (nb / blocks_n_per_group) * scale_size_K; | |
| // do unpacking for the first row or a new expert | |
| int32_t pre_expert_id = mb == 0 ? -1 : expert_ids[mb - 1]; | |
| bool do_unpack = (mb == mb0) || (expert_id != pre_expert_id); | |
| // 1.a load A | |
| const int32_t* A_ids = sorted_ids + mb * BLOCK_M; | |
| int64_t m_size = offsets[mb + 1] - offsets[mb]; | |
| for (int64_t m = 0; m < m_size; ++m) { | |
| int32_t index = A_ids[m] / topk; | |
| copy_stub(A + m * K, input + index * K, K); | |
| } | |
| const int64_t offset = offsets[mb]; | |
| tinygemm_kernel<scalar_t>( | |
| /* A */ A, | |
| /* B */ B, | |
| /* C */ ic0 + offset * 2 * N + nb * BLOCK_N, | |
| /* Btmp */ B_tmp + tid * B_tmp_size_per_thread + nb_offset * BLOCK_N * K, | |
| /* Ctmp */ C_tmp + tid * 2 * BLOCK_M * BLOCK_N, | |
| /* scale */ Bs, | |
| /* M */ m_size, | |
| /* N */ n_size, | |
| /* K */ K, | |
| /* lda */ K, | |
| /* ldb */ n_size, | |
| /* ldc */ 2 * N, | |
| /* brg */ use_brgemm, | |
| /* block_size_K */ block_size_K, | |
| /* do_unpack */ do_unpack); | |
| }); | |
| if (use_brgemm) { | |
| at::native::cpublas::brgemm_release(); | |
| } | |
| }); | |
| // stage 1.5: intermediate_cache1 = silu(intermediate_cache0) | |
| at::parallel_for(0, M * topk, 0, [&](int64_t begin, int64_t end) { | |
| for (int64_t m = begin; m < end; ++m) { | |
| silu_and_mul_stub(ic1 + m * N, ic0 + m * 2 * N, ic0 + m * 2 * N + N, N); | |
| } | |
| }); | |
| // stage 2: intermediate_cache2 = intermediate_cache1 @ w2 | |
| // w2 : [E, K, N] as [E, OC, IC] | |
| const int64_t OC = K; // rename K as OC | |
| const int64_t IC = N; // rename N as IC | |
| const int64_t MB2 = MB; | |
| const int64_t NB2 = div_up(OC, BLOCK_N); | |
| scale_size_N = div_up(K, block_size_N); | |
| scale_size_K = div_up(N, block_size_K); | |
| const int64_t stride_e2 = OC * IC; | |
| const int64_t stride_oc = IC; | |
| // parallel on [MB2, NB2] | |
| parallel_2d(MB2, NB2, [&](int64_t mb0, int64_t mb1, int64_t nb0, int64_t nb1) { | |
| int tid = get_thread_num(); | |
| alignas(64) scalar_t C[BLOCK_M * BLOCK_K]; | |
| loop_2d<at::Float8_e4m3fn>(mb0, mb1, nb0, nb1, BLOCK_N * IC, [&](int64_t mb, int64_t nb, int64_t nb_offset) { | |
| int64_t m_size = offsets[mb + 1] - offsets[mb]; | |
| int64_t n_size = std::min(OC - nb * BLOCK_N, BLOCK_N); | |
| // A ptr from ic1 of [M * topk, N] in sorted order | |
| // so as to avoid copy A to tmp buffer again | |
| const scalar_t* __restrict__ A = ic1 + offsets[mb] * N; | |
| const int32_t* A_ids = sorted_ids + mb * BLOCK_M; | |
| // B shape [IC, n_size] in vnni format | |
| int32_t expert_id = expert_ids[mb]; | |
| const at::Float8_e4m3fn* __restrict__ B = packed_w2 + expert_id * stride_e2 + nb * BLOCK_N * stride_oc; | |
| const float* __restrict__ Bs = | |
| w2s + expert_id * scale_size_N * scale_size_K + (nb / blocks_n_per_group) * scale_size_K; | |
| // do unpacking for the first row or a new expert | |
| int32_t pre_expert_id = mb == 0 ? -1 : expert_ids[mb - 1]; | |
| bool do_unpack = (mb == mb0) || (expert_id != pre_expert_id); | |
| tinygemm_kernel<scalar_t>( | |
| /* A */ A, | |
| /* B */ B, | |
| /* C */ C, | |
| /* Btmp */ B_tmp + tid * B_tmp_size_per_thread + nb_offset * BLOCK_N * IC, | |
| /* Ctmp */ C_tmp + tid * 2 * BLOCK_M * BLOCK_N, | |
| /* scale */ Bs, | |
| /* M */ m_size, | |
| /* N */ n_size, | |
| /* K */ IC, | |
| /* lda */ IC, | |
| /* ldb */ n_size, | |
| /* ldc */ BLOCK_N, | |
| /* brg */ use_brgemm, | |
| /* block_size_K */ block_size_K, | |
| /* do_unpack */ do_unpack); | |
| // 2.b copy from C to ic2 in original order | |
| // and also mul topk_weights in float32 | |
| for (int64_t m = 0; m < m_size; ++m) { | |
| int32_t index = A_ids[m]; | |
| float weight = topk_weights[index]; | |
| copy_mul_stub(ic2 + index * K + nb * BLOCK_N, C + m * BLOCK_N, weight, n_size); | |
| } | |
| }); | |
| if (use_brgemm) { | |
| at::native::cpublas::brgemm_release(); | |
| } | |
| }); | |
| // stage 3: out = intermediate_cache2.sum(dim=1) | |
| // from [M, topk, K] to [M, K] | |
| at::parallel_for(0, M, 0, [&](int64_t begin, int64_t end) { | |
| for (int64_t m = begin; m < end; ++m) { | |
| sum_stub(output + m * K, ic2 + m * topk * K, topk, K); | |
| } | |
| }); | |
| } | |
| INSTANTIATE_MOE_FP8_TEMPLATE(at::BFloat16); | |
| INSTANTIATE_MOE_FP8_TEMPLATE(at::Half); | |
| template <typename scalar_t> | |
| void shared_expert_fp8_kernel_impl( | |
| scalar_t* __restrict__ output, | |
| scalar_t* __restrict__ ic0, | |
| scalar_t* __restrict__ ic1, | |
| scalar_t* __restrict__ B_tmp, | |
| float* __restrict__ C_tmp, | |
| const scalar_t* __restrict__ input, | |
| const at::Float8_e4m3fn* __restrict__ packed_w1, | |
| const at::Float8_e4m3fn* __restrict__ packed_w2, | |
| const float* __restrict__ w1s, | |
| const float* __restrict__ w2s, | |
| int64_t block_size_N, | |
| int64_t block_size_K, | |
| const scalar_t* __restrict__ fused_experts_out, | |
| float routed_scaling_factor, | |
| int64_t M, | |
| int64_t N, | |
| int64_t K) { | |
| constexpr int64_t BLOCK_M = block_size_m(); | |
| constexpr int64_t BLOCK_N = block_size_n(); | |
| // stage 1: intermediate_cache0 = hidden_states @ w1 | |
| const int64_t MB = div_up(M, BLOCK_M); | |
| const int64_t NB = div_up(2 * N, BLOCK_N); | |
| int64_t scale_size_K = div_up(K, block_size_K); | |
| int64_t blocks_n_per_group = block_size_N / BLOCK_N; | |
| const bool use_brgemm = can_use_brgemm<at::Float8_e4m3fn>(M); | |
| int64_t B_tmp_size_per_thread = MAX_CACHE_BLOCK_SIZE * BLOCK_N * std::max(K, N); | |
| parallel_2d(MB, NB, [&](int64_t mb0, int64_t mb1, int64_t nb0, int64_t nb1) { | |
| int tid = get_thread_num(); | |
| loop_2d<at::Float8_e4m3fn>(mb0, mb1, nb0, nb1, BLOCK_N * K, [&](int64_t mb, int64_t nb, int64_t nb_offset) { | |
| int64_t m_size = std::min(M - mb * BLOCK_M, BLOCK_M); | |
| int64_t n_size = std::min(2 * N - nb * BLOCK_N, BLOCK_N); | |
| // do unpacking for the first row | |
| bool do_unpack = (mb == mb0); | |
| tinygemm_kernel<scalar_t>( | |
| /* A */ input + mb * BLOCK_M * K, | |
| /* B */ packed_w1 + nb * BLOCK_N * K, | |
| /* C */ ic0 + mb * BLOCK_M * 2 * N + nb * BLOCK_N, | |
| /* Btmp */ B_tmp + tid * B_tmp_size_per_thread + nb_offset * BLOCK_N * K, | |
| /* Ctmp */ C_tmp + tid * 2 * BLOCK_M * BLOCK_N, | |
| /* scale */ w1s + (nb / blocks_n_per_group) * scale_size_K, | |
| /* M */ m_size, | |
| /* N */ n_size, | |
| /* K */ K, | |
| /* lda */ K, | |
| /* ldb */ n_size, | |
| /* ldc */ 2 * N, | |
| /* brg */ use_brgemm, | |
| /* block_size_K */ block_size_K, | |
| /* do_unpack */ do_unpack); | |
| }); | |
| if (use_brgemm) { | |
| at::native::cpublas::brgemm_release(); | |
| } | |
| }); | |
| // stage 1.5: intermediate_cache1 = silu(intermediate_cache0) | |
| at::parallel_for(0, M, 0, [&](int64_t begin, int64_t end) { | |
| for (int64_t m = begin; m < end; ++m) { | |
| silu_and_mul_stub(ic1 + m * N, ic0 + m * 2 * N, ic0 + m * 2 * N + N, N); | |
| } | |
| }); | |
| // stage 2: intermediate_cache2 = intermediate_cache1 @ w2 | |
| // w2 : [K, N] as [OC, IC] | |
| const int64_t OC = K; // rename K as OC | |
| const int64_t IC = N; // rename N as IC | |
| const int64_t MB2 = MB; | |
| const int64_t NB2 = div_up(K, BLOCK_N); | |
| scale_size_K = div_up(N, block_size_K); | |
| // parallel on [MB2, NB2] | |
| parallel_2d(MB2, NB2, [&](int64_t mb0, int64_t mb1, int64_t nb0, int64_t nb1) { | |
| int tid = get_thread_num(); | |
| alignas(64) scalar_t C[BLOCK_M * BLOCK_K]; | |
| loop_2d<at::Float8_e4m3fn>(mb0, mb1, nb0, nb1, BLOCK_N * IC, [&](int64_t mb, int64_t nb, int64_t nb_offset) { | |
| int64_t m_size = std::min(M - mb * BLOCK_M, BLOCK_M); | |
| int64_t n_size = std::min(OC - nb * BLOCK_N, BLOCK_N); | |
| // do unpacking for the first row | |
| bool do_unpack = (mb == mb0); | |
| // 2.a gemm: C = A @ B | |
| tinygemm_kernel<scalar_t>( | |
| /* A */ ic1 + mb * BLOCK_M * N, | |
| /* B */ packed_w2 + nb * BLOCK_N * N, | |
| /* C */ C, | |
| /* Btmp */ B_tmp + tid * B_tmp_size_per_thread + nb_offset * BLOCK_N * IC, | |
| /* Ctmp */ C_tmp + tid * 2 * BLOCK_M * BLOCK_N, | |
| /* scale */ w2s + (nb / blocks_n_per_group) * scale_size_K, | |
| /* M */ m_size, | |
| /* N */ n_size, | |
| /* K */ IC, | |
| /* lda */ IC, | |
| /* ldb */ n_size, | |
| /* ldc */ BLOCK_N, | |
| /* brg */ use_brgemm, | |
| /* block_size_K */ block_size_K, | |
| /* do_unpack */ do_unpack); | |
| // 2.b copy from C to output and add fused_experts_out | |
| 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; | |
| 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); | |
| } | |
| }); | |
| }); | |
| if (use_brgemm) { | |
| at::native::cpublas::brgemm_release(); | |
| } | |
| } | |
| INSTANTIATE_SHARED_EXPERT_FP8_TEMPLATE(at::BFloat16); | |
| INSTANTIATE_SHARED_EXPERT_FP8_TEMPLATE(at::Half); | |