Download sglang/sgl-kernel/csrc/cpu/mamba/fla.cpp from FasterDFlash/Hanrui: direct link, hf CLI and curl.
- Browser
- Download file 60.1 kB
-
https://huggingface.co/FasterDFlash/Hanrui/resolve/main/sglang/sgl-kernel/csrc/cpu/mamba/fla.cpp
- Command line
-
hf download hf://FasterDFlash/Hanrui/sglang/sgl-kernel/csrc/cpu/mamba/fla.cpp
-
curl -L -o fla.cpp https://huggingface.co/FasterDFlash/Hanrui/resolve/main/sglang/sgl-kernel/csrc/cpu/mamba/fla.cpp
60.1 kB
| namespace { | |
| // For this cpu kernel, we have some innovations aside from the existing gpu kernels: | |
| // 1) Use less parallel loops, i.e. 4 including l2_norm. | |
| // 2) Fuse part of l2_norm with the rest of the computation. | |
| template <typename scalar_t> | |
| inline void fill_stub(scalar_t* __restrict__ out, float val, int size) { | |
| using Vec = at::vec::Vectorized<scalar_t>; | |
| constexpr int kVecSize = Vec::size(); | |
| const Vec data_vec = Vec(static_cast<scalar_t>(val)); | |
| int d = 0; | |
| for (; d <= size - kVecSize; d += kVecSize) { | |
| data_vec.store(out + d); | |
| } | |
| if (size - d > 0) { | |
| data_vec.store(out + d, size - d); | |
| } | |
| } | |
| template <typename scalar_t, int64_t chunk_size = 64> | |
| void chunk_gated_delta_rule_kernel_impl( | |
| scalar_t* __restrict__ out, // [B, T, HV, EV] | |
| float* __restrict__ final_state_data, // [N, HV, EK, EV] | |
| const scalar_t* __restrict__ q_orig, // [B, T, HK, EK] | |
| const scalar_t* __restrict__ k_orig, // [B, T, HK, EK] | |
| const scalar_t* __restrict__ v_orig, // [B, T, HV, EV] | |
| const float* __restrict__ g_orig, // [B, T, HV] FP32 | |
| const scalar_t* __restrict__ b_orig, // [B, T, HV] | |
| const int32_t* __restrict__ cu_seqlens_ptr, // [N + 1] INT32 | |
| float* __restrict__ buff, | |
| scalar_t* __restrict__ reduced_buff, | |
| scalar_t* __restrict__ thread_buff, | |
| const int32_t* __restrict__ chunk_offsets_ptr, | |
| const int32_t* __restrict__ chunk_indices_ptr, | |
| bool use_qk_l2norm_in_kernel, | |
| const int64_t& batch_size, | |
| const int64_t& global_seq_len, | |
| const int64_t& qk_num_head, | |
| const int64_t& v_num_head, | |
| const int64_t& qk_head_size, | |
| const int64_t& v_head_size, | |
| const int64_t& qStrideH, | |
| const int64_t& qStrideT, | |
| const int64_t& kStrideH, | |
| const int64_t& kStrideT, | |
| const int64_t& vStrideH, | |
| const int64_t& vStrideT, | |
| const int64_t& oStrideH, | |
| const int64_t& oStrideT, | |
| const int64_t& global_total_seq_length, | |
| const int64_t& global_num_chunk, | |
| const int64_t& buff_size_16bit_per_thread, | |
| double eps = 1e-5) { | |
| int64_t gStrideH = 1; | |
| int64_t gStrideT = v_num_head; | |
| int64_t bStrideH = 1; | |
| int64_t bStrideT = v_num_head; | |
| int64_t final_state_StrideN = v_num_head * qk_head_size * v_head_size; | |
| int64_t final_state_StrideH = qk_head_size * v_head_size; | |
| int64_t final_state_StrideE = v_head_size; | |
| int64_t head_group = v_num_head / qk_num_head; | |
| float scale = 1.0 / std::sqrt(qk_head_size); | |
| using bVec = at::vec::Vectorized<scalar_t>; | |
| using fVec = at::vec::Vectorized<float>; | |
| constexpr int64_t VecSize = bVec::size(); | |
| constexpr int64_t fVecSize = fVec::size(); | |
| // Data pointers | |
| float* g_pad = buff; | |
| float* core_attn_out = g_pad + v_num_head * global_total_seq_length; | |
| float* decay_mask = core_attn_out + batch_size * v_num_head * global_total_seq_length * v_head_size; | |
| float* v_beta_attn = decay_mask + v_num_head * global_total_seq_length * chunk_size; | |
| scalar_t* q_pad = reduced_buff; | |
| scalar_t* k_pad = q_pad + qk_num_head * global_total_seq_length * qk_head_size; | |
| scalar_t* v_pad = k_pad + qk_num_head * global_total_seq_length * qk_head_size; | |
| scalar_t* k_beta = v_pad + v_num_head * global_total_seq_length * v_head_size; | |
| scalar_t* v_beta = k_beta + v_num_head * global_total_seq_length * qk_head_size; | |
| scalar_t* k_cumdecay_reduced = v_beta + v_num_head * global_total_seq_length * v_head_size; | |
| scalar_t* q_norm_sum = k_cumdecay_reduced + v_num_head * global_total_seq_length * qk_head_size; | |
| scalar_t* k_norm_sum = q_norm_sum + qk_num_head * global_seq_len; | |
| if (use_qk_l2norm_in_kernel) { | |
| at::parallel_for(0, qk_num_head * global_seq_len, 0, [&](int64_t begin, int64_t end) { | |
| int64_t h_qk = 0, l = 0; | |
| data_index_init(begin, h_qk, qk_num_head, l, global_seq_len); | |
| for (int64_t i = begin; i < end; ++i) { | |
| auto q_norm_sum_ptr = q_norm_sum + h_qk * global_seq_len + l; | |
| auto k_norm_sum_ptr = k_norm_sum + h_qk * global_seq_len + l; | |
| float sum_q = float(0); | |
| float sum_k = float(0); | |
| fVec sum_q_fvec = fVec(float(0)); | |
| fVec sum_k_fvec = fVec(float(0)); | |
| int64_t q_offset = l * qStrideT + h_qk * qStrideH; | |
| int64_t k_offset = l * qStrideT + h_qk * qStrideH; | |
| int64_t d; | |
| for (d = 0; d <= qk_head_size - VecSize; d += VecSize) { | |
| bVec q_bvec = bVec::loadu(q_orig + q_offset + d); | |
| fVec q_fvec0, q_fvec1; | |
| std::tie(q_fvec0, q_fvec1) = at::vec::convert_to_float(q_bvec); | |
| sum_q_fvec += q_fvec0 * q_fvec0; | |
| sum_q_fvec += q_fvec1 * q_fvec1; | |
| bVec k_bvec = bVec::loadu(k_orig + k_offset + d); | |
| fVec k_fvec0, k_fvec1; | |
| std::tie(k_fvec0, k_fvec1) = at::vec::convert_to_float(k_bvec); | |
| sum_k_fvec += k_fvec0 * k_fvec0; | |
| sum_k_fvec += k_fvec1 * k_fvec1; | |
| } | |
| sum_q += vec_reduce_sum(sum_q_fvec); | |
| sum_k += vec_reduce_sum(sum_k_fvec); | |
| q_norm_sum_ptr[0] = static_cast<scalar_t>(float(1) / std::sqrt(sum_q + eps)); | |
| k_norm_sum_ptr[0] = static_cast<scalar_t>(float(1) / std::sqrt(sum_k + eps)); | |
| data_index_step(h_qk, qk_num_head, l, global_seq_len); | |
| } | |
| }); | |
| } | |
| // query = query * scale | |
| // k_beta = key * beta.unsqueeze(-1) | |
| // v_beta = value * beta.unsqueeze(-1) | |
| // Padding for q/k/v/beta | |
| at::parallel_for(0, qk_num_head * global_num_chunk, 1, [&](int64_t begin, int64_t end) { | |
| int ompIdx = at::get_thread_num(); | |
| int64_t h_qk = 0, c = 0; | |
| data_index_init(begin, h_qk, qk_num_head, c, global_num_chunk); | |
| for ([[maybe_unused]] auto z : c10::irange(begin, end)) { | |
| int64_t ib = chunk_indices_ptr[c * 2]; // idx_batch | |
| int64_t ic = chunk_indices_ptr[c * 2 + 1]; // idx_chunk | |
| int64_t l_orig = cu_seqlens_ptr[ib] + ic * chunk_size; | |
| int64_t l = c * chunk_size; | |
| bool is_tail = (c + 1 == chunk_offsets_ptr[ib + 1]); | |
| int64_t seq_len = cu_seqlens_ptr[ib + 1] - cu_seqlens_ptr[ib]; | |
| int64_t real_chunk_size = is_tail ? seq_len - ic * chunk_size : chunk_size; | |
| auto q_orig_ptr = q_orig + h_qk * qStrideH + l_orig * qStrideT; | |
| auto k_orig_ptr = k_orig + h_qk * kStrideH + l_orig * kStrideT; | |
| auto v_orig_ptr = v_orig + l_orig * vStrideT; | |
| auto b_orig_ptr = b_orig + l_orig * bStrideT; | |
| auto q_pad_ptr = q_pad + h_qk * global_total_seq_length * qk_head_size + l * qk_head_size; | |
| auto k_pad_ptr = k_pad + h_qk * global_total_seq_length * qk_head_size + l * qk_head_size; | |
| auto v_pad_ptr = v_pad + l * v_head_size; | |
| auto k_beta_ptr = k_beta + l * qk_head_size; | |
| auto v_beta_ptr = v_beta + l * v_head_size; | |
| for (int64_t j = 0; j < real_chunk_size; j++) { | |
| auto curr_q_orig = q_orig_ptr + j * qStrideT; | |
| auto curr_k_orig = k_orig_ptr + j * kStrideT; | |
| auto curr_q_pad = q_pad_ptr + j * qk_head_size; | |
| auto curr_k_pad = k_pad_ptr + j * qk_head_size; | |
| auto q_scale = | |
| use_qk_l2norm_in_kernel ? *(q_norm_sum + h_qk * global_seq_len + l_orig + j) : static_cast<scalar_t>(1); | |
| auto k_scale = | |
| use_qk_l2norm_in_kernel ? *(k_norm_sum + h_qk * global_seq_len + l_orig + j) : static_cast<scalar_t>(1); | |
| auto q_scale_vec = bVec(q_scale); | |
| auto k_scale_vec = bVec(k_scale); | |
| int64_t i = 0; | |
| scalar_t scale_reduced = static_cast<scalar_t>(scale); | |
| auto vec_scale_reduced = bVec(scale_reduced); | |
| for (; i < fVecSize * (qk_head_size / fVecSize); i += fVecSize) { | |
| auto tmp0 = bVec::loadu(curr_q_orig + i, fVecSize); | |
| auto tmp1 = tmp0 * q_scale_vec * vec_scale_reduced; | |
| tmp1.store(curr_q_pad + i, fVecSize); | |
| auto tmp3 = bVec::loadu(curr_k_orig + i, fVecSize); | |
| auto tmp4 = tmp3 * k_scale_vec; | |
| tmp4.store(curr_k_pad + i, fVecSize); | |
| } | |
| for (auto hi = 0; hi < head_group; hi++) { | |
| int64_t h = h_qk * head_group + hi; | |
| auto curr_v_orig = v_orig_ptr + h * vStrideH + j * vStrideT; | |
| auto curr_b_orig = b_orig_ptr + h * bStrideH + j * bStrideT; | |
| scalar_t b_orig_val_reduced = *(curr_b_orig); | |
| auto curr_v_pad = v_pad_ptr + h * global_total_seq_length * v_head_size + j * v_head_size; | |
| auto curr_k_beta = k_beta_ptr + h * global_total_seq_length * qk_head_size + j * qk_head_size; | |
| auto curr_v_beta = v_beta_ptr + h * global_total_seq_length * v_head_size + j * v_head_size; | |
| // query = query * scale | |
| // k_beta = key * beta.unsqueeze(-1) | |
| int64_t i = 0; | |
| auto vec_b_reduced = bVec(b_orig_val_reduced); | |
| for (; i < fVecSize * (qk_head_size / fVecSize); i += fVecSize) { | |
| auto tmp0 = bVec::loadu(curr_k_orig + i, fVecSize); | |
| auto tmp2 = tmp0 * k_scale_vec * vec_b_reduced; | |
| tmp2.store(curr_k_beta + i, fVecSize); | |
| } | |
| // v_beta = value * beta.unsqueeze(-1) | |
| i = 0; | |
| for (; i < VecSize * (v_head_size / VecSize); i += VecSize) { | |
| auto tmp3 = bVec::loadu(curr_v_orig + i); | |
| tmp3.store(curr_v_pad + i); | |
| auto tmp5 = tmp3 * vec_b_reduced; | |
| tmp5.store(curr_v_beta + i); | |
| } | |
| } | |
| } | |
| for (int64_t j = real_chunk_size; j < chunk_size; j++) { | |
| auto curr_q_pad = q_pad_ptr + j * qk_head_size; | |
| auto curr_k_pad = k_pad_ptr + j * qk_head_size; | |
| int64_t i = 0; | |
| auto vec_zero = bVec(0.0); | |
| for (; i < VecSize * (qk_head_size / VecSize); i += VecSize) { | |
| vec_zero.store(curr_q_pad + i); | |
| vec_zero.store(curr_k_pad + i); | |
| } | |
| for (auto hi = 0; hi < head_group; hi++) { | |
| int64_t h = h_qk * head_group + hi; | |
| auto curr_v_pad = v_pad_ptr + h * global_total_seq_length * v_head_size + j * v_head_size; | |
| auto curr_k_beta = k_beta_ptr + h * global_total_seq_length * qk_head_size + j * qk_head_size; | |
| auto curr_v_beta = v_beta_ptr + h * global_total_seq_length * v_head_size + j * v_head_size; | |
| int64_t i = 0; | |
| for (; i < VecSize * (qk_head_size / VecSize); i += VecSize) { | |
| vec_zero.store(curr_k_beta + i); | |
| } | |
| i = 0; | |
| for (; i < VecSize * (v_head_size / VecSize); i += VecSize) { | |
| vec_zero.store(curr_v_pad + i); | |
| vec_zero.store(curr_v_beta + i); | |
| } | |
| } | |
| } | |
| // Move to the next query | |
| data_index_step(h_qk, qk_num_head, c, global_num_chunk); | |
| } | |
| }); | |
| at::parallel_for(0, v_num_head * global_num_chunk, 1, [&](int64_t begin, int64_t end) { | |
| int64_t h = 0, c = 0; | |
| data_index_init(begin, h, v_num_head, c, global_num_chunk); | |
| int ompIdx = at::get_thread_num(); | |
| int64_t offset = 0; | |
| scalar_t* thread_buff_ptr = thread_buff + ompIdx * buff_size_16bit_per_thread; | |
| THREAD_BUFFER_ALLOC(k_transpose, thread_buff_ptr, offset, scalar_t, qk_head_size * chunk_size); | |
| THREAD_BUFFER_ALLOC(v_pack, thread_buff_ptr, offset, scalar_t, chunk_size * v_head_size); | |
| THREAD_BUFFER_ALLOC(k_beta_g, thread_buff_ptr, offset, scalar_t, chunk_size * qk_head_size); | |
| THREAD_BUFFER_ALLOC(k_beta_g_pack, thread_buff_ptr, offset, scalar_t, chunk_size * qk_head_size); | |
| THREAD_BUFFER_ALLOC(curr_attn, thread_buff_ptr, offset, float, chunk_size* chunk_size * 2); | |
| THREAD_BUFFER_ALLOC(curr_attn_reduced, thread_buff_ptr, offset, scalar_t, chunk_size * chunk_size); | |
| THREAD_BUFFER_ALLOC(k_cumdecay, thread_buff_ptr, offset, float, chunk_size* qk_head_size * 2); | |
| THREAD_BUFFER_ALLOC(row, thread_buff_ptr, offset, float, chunk_size * 2); | |
| THREAD_BUFFER_ALLOC(updated, thread_buff_ptr, offset, float, chunk_size * 2); | |
| for ([[maybe_unused]] auto z : c10::irange(begin, end)) { | |
| int64_t ib = chunk_indices_ptr[c * 2]; // idx_batch | |
| int64_t ic = chunk_indices_ptr[c * 2 + 1]; // idx_chunk | |
| int64_t l_orig = cu_seqlens_ptr[ib] + ic * chunk_size; | |
| int64_t seq_len = cu_seqlens_ptr[ib + 1] - cu_seqlens_ptr[ib]; | |
| int64_t h_qk = h / head_group; | |
| auto curr_g_orig = g_orig + h * gStrideH + l_orig * gStrideT; | |
| auto curr_g_pad = g_pad + h * global_total_seq_length + c * chunk_size; | |
| auto curr_decay_mask = decay_mask + h * global_total_seq_length * chunk_size + c * chunk_size * chunk_size; | |
| auto curr_k_pad = k_pad + h_qk * global_total_seq_length * qk_head_size + c * chunk_size * qk_head_size; | |
| auto curr_k_beta = k_beta + h * global_total_seq_length * qk_head_size + c * chunk_size * qk_head_size; | |
| auto curr_k_cumdecay_reduced = | |
| k_cumdecay_reduced + h * global_total_seq_length * qk_head_size + c * chunk_size * qk_head_size; | |
| auto curr_v_beta = v_beta + h * global_total_seq_length * v_head_size + c * chunk_size * v_head_size; | |
| auto curr_value = v_beta_attn + h * global_total_seq_length * v_head_size + c * chunk_size * v_head_size; | |
| float acc_val = 0; | |
| for (int64_t i = 0; i < chunk_size; i++) { | |
| // Padding for g | |
| // g = g.cumsum(dim=-1) | |
| // g: [B, HV, num_chunk, chunk_size] | |
| if (ic * chunk_size + i < seq_len) { | |
| acc_val += curr_g_orig[i * gStrideT]; | |
| } | |
| curr_g_pad[i] = acc_val; | |
| // decay_mask = ((g.unsqueeze(-1) - g.unsqueeze(-2)).tril().exp().float()).tril() | |
| // decay_mask: [B, HV, num_chunk, chunk_size, chunk_size] | |
| float curr_g_pad_i = static_cast<float>(curr_g_pad[i]); | |
| auto vec_curr_g_pad_i = fVec(curr_g_pad_i); | |
| int64_t j = 0; | |
| int64_t len = i + 1; | |
| for (; j < fVecSize * (len / fVecSize); j += fVecSize) { | |
| auto tmp0 = fVec::loadu(curr_g_pad + j); | |
| auto tmp1 = vec_curr_g_pad_i - tmp0; | |
| auto tmp2 = tmp1.exp_u20(); | |
| tmp2.store(curr_decay_mask + i * chunk_size + j); | |
| } | |
| if (j < len) { | |
| auto tmp0 = fVec::loadu(curr_g_pad + j, len - j); | |
| auto tmp1 = vec_curr_g_pad_i - tmp0; | |
| auto tmp2 = tmp1.exp_u20(); | |
| tmp2.store(curr_decay_mask + i * chunk_size + j, len - j); | |
| } | |
| } | |
| // attn = k_beta @ key.transpose(-1, -2) | |
| // attn: [B, HV, num_chunk, chunk_size, chunk_size] | |
| // transpose and pack for key | |
| pack_vnni<scalar_t>( | |
| /* dst */ k_transpose, | |
| /* src */ curr_k_pad, | |
| /* N */ chunk_size, | |
| /* K */ qk_head_size, | |
| /* ld_src */ qk_head_size, | |
| /* ld_dst */ chunk_size); | |
| // k_beta @ key.transpose(-1, -2) | |
| at::native::cpublas::brgemm( | |
| /* M */ chunk_size, | |
| /* N */ chunk_size, | |
| /* K */ qk_head_size, | |
| /* lda */ qk_head_size, | |
| /* ldb */ chunk_size, | |
| /* ldc */ chunk_size, | |
| /* add_C */ false, | |
| /* A */ curr_k_beta, | |
| /* B */ k_transpose, | |
| /* C */ curr_attn); | |
| // attn = attn * decay_mask | |
| for (int64_t m = 0; m < chunk_size; m++) { | |
| at::vec::map2<float>( | |
| [](fVec x, fVec y) { return fVec(0) - x * y; }, | |
| curr_attn + m * chunk_size, | |
| curr_attn + m * chunk_size, | |
| curr_decay_mask + m * chunk_size, | |
| chunk_size); | |
| } | |
| // chunk decay | |
| // attn: [B, HV, num_chunk, chunk_size, chunk_size] | |
| // mask = torch.triu(torch.ones(chunk_size, chunk_size, dtype=torch.bool, device=query.device), diagonal=0) | |
| // attn = -attn.masked_fill(mask, 0) | |
| // attn[..., i, :i] = row + (row.unsqueeze(-1) * sub).sum(-2) [B, HV, num_chunk, i] | |
| // attn = attn + torch.eye(chunk_size, dtype=attn.dtype, device=attn.device) | |
| // attn = -attn.masked_fill(mask, 0) | |
| for (int i = 0; i < chunk_size; i++) { | |
| const auto vec_zero = fVec(0); | |
| int64_t len = chunk_size - i; | |
| int64_t front = len % fVecSize; | |
| int64_t j = i; | |
| // first masked vec for alignment | |
| if (front > 0) { | |
| vec_zero.store(curr_attn + i * chunk_size + j, front); | |
| j += front; | |
| } | |
| for (; j < fVecSize * (chunk_size / fVecSize); j += fVecSize) { | |
| vec_zero.store(curr_attn + i * chunk_size + j); | |
| } | |
| } | |
| for (int i = 1; i < chunk_size; i++) { | |
| // row = attn[..., i, :i] [B, HK, num_chunk, i] | |
| int64_t j = 0; | |
| int64_t len = i; | |
| for (; j < fVecSize * (len / fVecSize); j += fVecSize) { | |
| auto tmp0 = fVec::loadu(curr_attn + i * chunk_size + j); | |
| tmp0.store(row + j); | |
| } | |
| if (j < len) { | |
| auto tmp0 = fVec::loadu(curr_attn + i * chunk_size + j, len - j); | |
| tmp0.store(row + j, len - j); | |
| } | |
| // (row.unsqueeze(-1) * sub).sum(-2) | |
| fill_stub(updated, 0, i); | |
| for (int k = 0; k < i; k++) { | |
| float row_k = row[k]; | |
| auto vec_row_k = fVec(row_k); | |
| int64_t j = 0; | |
| int64_t len = i; | |
| for (; j < fVecSize * (len / fVecSize); j += fVecSize) { | |
| auto tmp0 = fVec::loadu(curr_attn + k * chunk_size + j); | |
| auto tmp1 = vec_row_k * tmp0; | |
| auto tmp2 = fVec::loadu(updated + j); | |
| auto tmp3 = tmp1 + tmp2; | |
| tmp3.store(updated + j); | |
| } | |
| if (j < len) { | |
| auto tmp0 = fVec::loadu(curr_attn + k * chunk_size + j, len - j); | |
| auto tmp1 = vec_row_k * tmp0; | |
| auto tmp2 = fVec::loadu(updated + j); | |
| auto tmp3 = tmp1 + tmp2; | |
| tmp3.store(updated + j, len - j); | |
| } | |
| } | |
| // attn[..., i, :i] = row + sum(...) | |
| j = 0; | |
| len = i; | |
| for (; j < fVecSize * (len / fVecSize); j += fVecSize) { | |
| auto tmp0 = fVec::loadu(row + j); | |
| auto tmp1 = fVec::loadu(updated + j); | |
| auto tmp2 = tmp0 + tmp1; | |
| tmp2.store(curr_attn + i * chunk_size + j); | |
| } | |
| if (j < len) { | |
| auto tmp0 = fVec::loadu(row + j, len - j); | |
| auto tmp1 = fVec::loadu(updated + j, len - j); | |
| auto tmp2 = tmp0 + tmp1; | |
| tmp2.store(curr_attn + i * chunk_size + j, len - j); | |
| } | |
| } | |
| for (int i = 0; i < chunk_size; i++) { | |
| curr_attn[i * chunk_size + i] += 1.0f; | |
| at::vec::map<scalar_t>( | |
| [](fVec x) { return x; }, curr_attn_reduced + i * chunk_size, curr_attn + i * chunk_size, chunk_size); | |
| } | |
| // v_beta_attn = attn @ v_beta | |
| // k_cumdecay = attn @ (k_beta * g.exp().unsqueeze(-1)) | |
| // v_beta_attn: [B, HV, num_chunk, chunk_size, EV] | |
| // k_beta_g = k_beta * g: [B, HV, num_chunk, chunk_size, EK] | |
| // k_cumdecay: [B, HV, num_chunk, chunk_size, EK] | |
| // pack for value | |
| pack_vnni2<scalar_t>( | |
| /* dst */ v_pack, | |
| /* src */ curr_v_beta, | |
| /* N */ chunk_size, | |
| /* K */ v_head_size, | |
| /* ld_src */ v_head_size, | |
| /* ld_dst */ v_head_size); | |
| // value = attn @ v_beta | |
| at::native::cpublas::brgemm( | |
| /* M */ chunk_size, | |
| /* N */ v_head_size, | |
| /* K */ chunk_size, | |
| /* lda */ chunk_size, | |
| /* ldb */ v_head_size, | |
| /* ldc */ v_head_size, | |
| /* add_C */ false, | |
| /* A */ curr_attn_reduced, | |
| /* B */ v_pack, | |
| /* C */ curr_value); | |
| // k_beta_g = k_beta * g.exp().unsqueeze(-1) | |
| for (int64_t j = 0; j < chunk_size; j++) { | |
| int64_t i = 0; | |
| float g_exp = std::exp(curr_g_pad[j]); | |
| scalar_t g_exp_reduced = static_cast<scalar_t>(g_exp); | |
| auto vec_g_exp_reduced = bVec(g_exp_reduced); | |
| for (; i < VecSize * (qk_head_size / VecSize); i += VecSize) { | |
| auto tmp0 = bVec::loadu(curr_k_beta + j * qk_head_size + i); | |
| auto tmp1 = tmp0 * vec_g_exp_reduced; | |
| tmp1.store(k_beta_g + j * qk_head_size + i); | |
| } | |
| } | |
| // pack for k_beta_g | |
| pack_vnni2<scalar_t>( | |
| /* dst */ k_beta_g_pack, | |
| /* src */ k_beta_g, | |
| /* N */ chunk_size, | |
| /* K */ qk_head_size, | |
| /* ld_src */ qk_head_size, | |
| /* ld_dst */ qk_head_size); | |
| // k_cumdecay = attn @ k_beta_g | |
| at::native::cpublas::brgemm( | |
| /* M */ chunk_size, | |
| /* N */ qk_head_size, | |
| /* K */ chunk_size, | |
| /* lda */ chunk_size, | |
| /* ldb */ qk_head_size, | |
| /* ldc */ qk_head_size, | |
| /* add_C */ false, | |
| /* A */ curr_attn_reduced, | |
| /* B */ k_beta_g_pack, | |
| /* C */ k_cumdecay); | |
| for (int i = 0; i < chunk_size; i++) { | |
| at::vec::map<scalar_t>( | |
| [](fVec x) { return x; }, | |
| curr_k_cumdecay_reduced + i * qk_head_size, | |
| k_cumdecay + i * qk_head_size, | |
| qk_head_size); | |
| } | |
| // Move to the next query | |
| data_index_step(h, v_num_head, c, global_num_chunk); | |
| } | |
| }); | |
| // for each chunk | |
| at::parallel_for(0, batch_size * v_num_head, 1, [&](int64_t begin, int64_t end) { | |
| int64_t b = 0, h = 0; | |
| data_index_init(begin, b, batch_size, h, v_num_head); | |
| int ompIdx = at::get_thread_num(); | |
| int64_t offset = | |
| /* k_transpose */ qk_head_size * chunk_size + | |
| /* v_pack */ chunk_size * v_head_size + | |
| /* k_beta_g */ chunk_size * qk_head_size + | |
| /* k_beta_g_pack */ chunk_size * qk_head_size + | |
| /* attn */ chunk_size * chunk_size * 2 + | |
| /* attn_reduced */ chunk_size * chunk_size + | |
| /* k_cumdecay */ chunk_size * qk_head_size * 2 + | |
| /* row */ chunk_size * 2 + | |
| /* updated */ chunk_size * 2; | |
| scalar_t* thread_buff_ptr = thread_buff + ompIdx * buff_size_16bit_per_thread; | |
| THREAD_BUFFER_ALLOC( | |
| curr_last_recurrent_state_reduced, thread_buff_ptr, offset, scalar_t, qk_head_size * v_head_size); | |
| THREAD_BUFFER_ALLOC( | |
| curr_last_recurrent_state_pack_reduced, thread_buff_ptr, offset, scalar_t, qk_head_size * v_head_size); | |
| THREAD_BUFFER_ALLOC(k_transpose_i, thread_buff_ptr, offset, scalar_t, qk_head_size * chunk_size); | |
| THREAD_BUFFER_ALLOC(attn_i, thread_buff_ptr, offset, float, chunk_size* chunk_size * 2); | |
| THREAD_BUFFER_ALLOC(attn_i_reduced, thread_buff_ptr, offset, scalar_t, chunk_size * chunk_size); | |
| THREAD_BUFFER_ALLOC(v_prime, thread_buff_ptr, offset, float, chunk_size* v_head_size * 2); | |
| THREAD_BUFFER_ALLOC(v_prime_reduced, thread_buff_ptr, offset, scalar_t, chunk_size * v_head_size); | |
| THREAD_BUFFER_ALLOC(v_prime_pack_reduced, thread_buff_ptr, offset, scalar_t, chunk_size * v_head_size); | |
| THREAD_BUFFER_ALLOC(qg, thread_buff_ptr, offset, scalar_t, chunk_size * qk_head_size); | |
| THREAD_BUFFER_ALLOC(attn_inter, thread_buff_ptr, offset, float, chunk_size* v_head_size * 2); | |
| THREAD_BUFFER_ALLOC(kg, thread_buff_ptr, offset, scalar_t, chunk_size * qk_head_size); | |
| THREAD_BUFFER_ALLOC(kg_transpose, thread_buff_ptr, offset, scalar_t, qk_head_size * chunk_size); | |
| THREAD_BUFFER_ALLOC(kgv, thread_buff_ptr, offset, float, qk_head_size* v_head_size * 2); | |
| for ([[maybe_unused]] auto z : c10::irange(begin, end)) { | |
| int64_t start_q = cu_seqlens_ptr[b]; | |
| int64_t seq_len = cu_seqlens_ptr[b + 1] - start_q; | |
| int64_t num_chunk = chunk_offsets_ptr[b + 1] - chunk_offsets_ptr[b]; | |
| int64_t chunk_offset = chunk_offsets_ptr[b]; | |
| int64_t len_offset = chunk_offset * chunk_size; | |
| int64_t h_qk = h / head_group; | |
| auto out_ptr = out + start_q * oStrideT; | |
| auto curr_q = q_pad + len_offset * qk_head_size + | |
| h_qk * global_total_seq_length * qk_head_size; // [num_chunk, chunk_size, EK] | |
| auto curr_k = k_pad + len_offset * qk_head_size + | |
| h_qk * global_total_seq_length * qk_head_size; // [num_chunk, chunk_size, EK] | |
| auto curr_v = v_beta_attn + h * global_total_seq_length * v_head_size; // [num_chunk, chunk_size, EV] | |
| auto curr_decay_mask = | |
| decay_mask + h * global_total_seq_length * chunk_size; // [num_chunk, chunk_size, chunk_size] | |
| auto curr_k_cumdecay_reduced = | |
| k_cumdecay_reduced + h * global_total_seq_length * qk_head_size; // [num_chunk, chunk_size, EK] | |
| auto curr_last_recurrent_state = | |
| final_state_data + b * final_state_StrideN + h * final_state_StrideH; // [EK, EV] | |
| auto curr_g_pad = g_pad + len_offset + h * global_total_seq_length; // [num_chunk, chunk_size] | |
| auto curr_core_attn_out = core_attn_out + len_offset * v_head_size + | |
| h * global_total_seq_length * v_head_size; // [num_chunk, chunk_size, EV] | |
| for (int64_t c = 0; c < num_chunk; c++) { | |
| for (int i = 0; i < qk_head_size; i++) { | |
| at::vec::map<scalar_t>( | |
| [](fVec x) { return x; }, | |
| curr_last_recurrent_state_reduced + i * v_head_size, | |
| curr_last_recurrent_state + i * v_head_size, | |
| v_head_size); | |
| } | |
| auto q_i = curr_q + c * chunk_size * qk_head_size; // [chunk_size, EK] | |
| auto k_i = curr_k + c * chunk_size * qk_head_size; // [chunk_size, EK] | |
| auto v_i = curr_v + (chunk_offset + c) * chunk_size * v_head_size; // [chunk_size, EV] | |
| auto decay_mask_i = curr_decay_mask + (chunk_offset + c) * chunk_size * chunk_size; // [chunk_size, chunk_size] | |
| auto k_cumdecay_i_reduced = | |
| curr_k_cumdecay_reduced + (chunk_offset + c) * chunk_size * qk_head_size; // [chunk_size, EK] | |
| auto g_pad_i = curr_g_pad + c * chunk_size; // [chunk_size] | |
| auto core_attn_out_i = curr_core_attn_out + c * chunk_size * v_head_size; // [chunk_size, EV] | |
| // attn_i = (q_i @ k_i.transpose(-1, -2) * decay_mask[:, :, i]).masked_fill_(mask, 0) | |
| // k_transpose_i = k_i.transpose(-1, -2) | |
| pack_vnni<scalar_t>( | |
| /* dst */ k_transpose_i, | |
| /* src */ k_i, | |
| /* N */ chunk_size, | |
| /* K */ qk_head_size, | |
| /* ld_src */ qk_head_size, | |
| /* ld_dst */ chunk_size); | |
| // attn_i = q_i @ k_transpose_i | |
| at::native::cpublas::brgemm( | |
| /* M */ chunk_size, | |
| /* N */ chunk_size, | |
| /* K */ qk_head_size, | |
| /* lda */ qk_head_size, | |
| /* ldb */ chunk_size, | |
| /* ldc */ chunk_size, | |
| /* add_C */ false, | |
| /* A */ q_i, | |
| /* B */ k_transpose_i, | |
| /* C */ attn_i); | |
| // attn_i = attn_i * decay_mask_i | |
| for (int64_t m = 0; m < chunk_size; m++) { | |
| auto attn_i_m = attn_i + m * chunk_size; | |
| auto attn_i_reduced_m = attn_i_reduced + m * chunk_size; | |
| auto decay_mask_i_m = decay_mask_i + m * chunk_size; | |
| int64_t n = 0; | |
| for (; n < fVecSize * (chunk_size / fVecSize); n += fVecSize) { | |
| auto tmp0 = fVec::loadu(attn_i_m + n); | |
| auto tmp1 = fVec::loadu(decay_mask_i_m + n); | |
| auto tmp2 = tmp0 * tmp1; | |
| auto tmp3 = at::vec::convert<scalar_t>(tmp2); | |
| tmp3.store(attn_i_reduced_m + n, fVecSize); | |
| } | |
| if (n < chunk_size) { | |
| auto tmp0 = fVec::loadu(attn_i_m + n, chunk_size - n); | |
| auto tmp1 = fVec::loadu(decay_mask_i_m + n, chunk_size - n); | |
| auto tmp2 = tmp0 * tmp1; | |
| auto tmp3 = at::vec::convert<scalar_t>(tmp2); | |
| tmp3.store(attn_i_reduced_m + n, chunk_size - n); | |
| } | |
| } | |
| // mask = torch.triu(torch.ones(chunk_size, chunk_size, dtype=torch.bool, device=query.device), diagonal=1) | |
| // attn_i = attn_i.masked_fill_(mask, 0) | |
| for (int i = 0; i < chunk_size - 1; i++) { | |
| const auto vec_zero = bVec(0); | |
| int64_t len = chunk_size - i - 1; | |
| int64_t front = len % VecSize; | |
| int64_t j = i + 1; | |
| // first masked vec for alignment | |
| if (front > 0) { | |
| vec_zero.store(attn_i_reduced + i * chunk_size + j, front); | |
| j += front; | |
| } | |
| for (; j < VecSize * (chunk_size / VecSize); j += VecSize) { | |
| vec_zero.store(attn_i_reduced + i * chunk_size + j); | |
| } | |
| } | |
| // pack for curr_last_recurrent_state | |
| pack_vnni2<scalar_t>( | |
| /* dst */ curr_last_recurrent_state_pack_reduced, | |
| /* src */ curr_last_recurrent_state_reduced, | |
| /* N */ qk_head_size, | |
| /* K */ v_head_size, | |
| /* ld_src */ v_head_size, | |
| /* ld_dst */ v_head_size); | |
| // v_prime = k_cumdecay_i @ curr_last_recurrent_state: [chunk_size, EV] | |
| // k_cumdecay_i: [chunk_size, EK] | |
| // curr_last_recurrent_state: [EK, EV] | |
| at::native::cpublas::brgemm( | |
| /* M */ chunk_size, | |
| /* N */ v_head_size, | |
| /* K */ qk_head_size, | |
| /* lda */ qk_head_size, | |
| /* ldb */ v_head_size, | |
| /* ldc */ v_head_size, | |
| /* add_C */ false, | |
| /* A */ k_cumdecay_i_reduced, | |
| /* B */ curr_last_recurrent_state_pack_reduced, | |
| /* C */ v_prime); | |
| // v_new = v_prime = v_i - v_prime | |
| // v_i: [chunk_size, EV] | |
| for (int64_t m = 0; m < chunk_size; m++) { | |
| int64_t i = 0; | |
| for (; i < fVecSize * (v_head_size / fVecSize); i += fVecSize) { | |
| auto tmp0 = fVec::loadu(v_i + m * v_head_size + i); | |
| auto tmp1 = fVec::loadu(v_prime + m * v_head_size + i); | |
| auto tmp2 = tmp0 - tmp1; | |
| auto tmp3 = at::vec::convert<scalar_t>(tmp2); | |
| tmp3.store(v_prime_reduced + m * v_head_size + i, fVecSize); | |
| } | |
| } | |
| // attn_inter = (q_i * g[:, :, i, :, None].exp()) @ last_recurrent_state | |
| // qg = q_i * g[:, :, i, :, None].exp(): [chunk_size, EK] | |
| // q_i: [chunk_size, EK] | |
| // g[:, :, i, :, None]: [chunk_size, 1] | |
| for (int64_t m = 0; m < chunk_size; m++) { | |
| auto g_pad_i_m = g_pad_i + m; | |
| auto g_exp = std::exp(*g_pad_i_m); | |
| int64_t i = 0; | |
| scalar_t g_exp_reduced = static_cast<scalar_t>(g_exp); | |
| auto vec_g_exp_reduced = bVec(g_exp_reduced); | |
| for (; i < VecSize * (qk_head_size / VecSize); i += VecSize) { | |
| auto tmp0 = bVec::loadu(q_i + m * qk_head_size + i); | |
| auto tmp2 = tmp0 * vec_g_exp_reduced; | |
| tmp2.store(qg + m * qk_head_size + i); | |
| } | |
| } | |
| // attn_inter = qg @ curr_last_recurrent_state: [chunk_size, EV] | |
| // curr_last_recurrent_state: [EK, EV] | |
| at::native::cpublas::brgemm( | |
| /* M */ chunk_size, | |
| /* N */ v_head_size, | |
| /* K */ qk_head_size, | |
| /* lda */ qk_head_size, | |
| /* ldb */ v_head_size, | |
| /* ldc */ v_head_size, | |
| /* add_C */ false, | |
| /* A */ qg, | |
| /* B */ curr_last_recurrent_state_pack_reduced, | |
| /* C */ attn_inter); | |
| // core_attn_out[:, :, i] = attn_inter + attn_i @ v_new | |
| // pack for v_prime | |
| pack_vnni2<scalar_t>( | |
| /* dst */ v_prime_pack_reduced, | |
| /* src */ v_prime_reduced, | |
| /* N */ chunk_size, | |
| /* K */ v_head_size, | |
| /* ld_src */ v_head_size, | |
| /* ld_dst */ v_head_size); | |
| // attn_inter = attn_inter + attn_i @ v_new: [chunk_size, EV] | |
| // attn_i: [chunk_size, chunk_size] | |
| // v_new: [chunk_size, EV] | |
| at::native::cpublas::brgemm( | |
| /* M */ chunk_size, | |
| /* N */ v_head_size, | |
| /* K */ chunk_size, | |
| /* lda */ chunk_size, | |
| /* ldb */ v_head_size, | |
| /* ldc */ v_head_size, | |
| /* add_C */ true, | |
| /* A */ attn_i_reduced, | |
| /* B */ v_prime_pack_reduced, | |
| /* C */ attn_inter); | |
| // core_attn_out[:, :, i] = attn_inter | |
| for (int64_t m = 0; m < chunk_size; m++) { | |
| at::vec::map<float>( | |
| [](fVec x) { return x; }, core_attn_out_i + m * v_head_size, attn_inter + m * v_head_size, v_head_size); | |
| } | |
| // last_recurrent_state = ( | |
| // last_recurrent_state * g[:, :, i, -1, None, None].exp() | |
| // + (k_i * (g[:, :, i, -1, None] - g[:, :, i]).exp()[..., None]).transpose(-1, -2) @ v_new | |
| // ) | |
| // 1) last_recurrent_state * g[:, :, i, -1, None, None].exp() | |
| // curr_last_recurrent_state: [EK, EV] | |
| // g[:, :, i, -1, None, None]: [1, 1] | |
| // last_recurrent_state * g[:, :, i, -1, None, None].exp(): [EK, EV] | |
| auto g_pad_i_last = g_pad_i + chunk_size - 1; | |
| auto g_exp_last = std::exp(g_pad_i_last[0]); | |
| for (int64_t m = 0; m < qk_head_size; m++) { | |
| int64_t i = 0; | |
| auto vec_g_exp_last = fVec(g_exp_last); | |
| for (; i < fVecSize * (v_head_size / fVecSize); i += fVecSize) { | |
| auto tmp0 = bVec::loadu(curr_last_recurrent_state_reduced + m * v_head_size + i); | |
| auto tmp1 = at::vec::convert<float>(tmp0); | |
| auto tmp2 = tmp1 * vec_g_exp_last; | |
| tmp2.store(curr_last_recurrent_state + m * v_head_size + i); | |
| } | |
| if (i < v_head_size) { | |
| auto tmp0 = bVec::loadu(curr_last_recurrent_state_reduced + m * v_head_size + i, v_head_size - i); | |
| auto tmp1 = at::vec::convert<float>(tmp0); | |
| auto tmp2 = tmp1 * vec_g_exp_last; | |
| tmp2.store(curr_last_recurrent_state + m * v_head_size + i, v_head_size - i); | |
| } | |
| } | |
| // 2) (k_i * (g[:, :, i, -1, None] - g[:, :, i]).exp()[..., None]).transpose(-1, -2) @ v_new | |
| // k_i: [chunk_size, EK] | |
| // g[:, :, i, -1, None]: [1] | |
| // g[:, :, i]: [chunk_size] | |
| // (g[:, :, i, -1, None] - g[:, :, i]).exp()[..., None]: [chunk_size, 1] | |
| // kg = k_i * (g[:, :, i, -1, None] - g[:, :, i]).exp()[..., None]: [chunk_size, EK] | |
| // (k_i * (g[:, :, i, -1, None] - g[:, :, i]).exp()[..., None]).transpose(-1, -2): [EK, chunk_size] | |
| // v_new: [chunk_size, EV] | |
| // (k_i * (g[:, :, i, -1, None] - g[:, :, i]).exp()[..., None]).transpose(-1, -2) @ v_new: [EK, EV] | |
| // kg = k_i * (g[:, :, i, -1, None] - g[:, :, i]).exp()[..., None] | |
| for (int64_t m = 0; m < chunk_size; m++) { | |
| auto g_exp = std::exp((g_pad_i_last[0] - g_pad_i[m])); | |
| int64_t i = 0; | |
| scalar_t g_exp_reduced = static_cast<scalar_t>(g_exp); | |
| auto vec_g_exp_reduced = bVec(g_exp_reduced); | |
| for (; i < VecSize * (qk_head_size / VecSize); i += VecSize) { | |
| auto tmp0 = bVec::loadu(k_i + m * qk_head_size + i); | |
| auto tmp2 = tmp0 * vec_g_exp_reduced; | |
| tmp2.store(kg + m * qk_head_size + i); | |
| } | |
| } | |
| // kg.transpose(-1, -2): [EK, chunk_size] | |
| at::native::utils::transpose<scalar_t>( | |
| /* M */ chunk_size, | |
| /* N */ qk_head_size, | |
| /* src */ kg, | |
| /* ld_src */ qk_head_size, | |
| /* dst */ kg_transpose, | |
| /* ld_dst */ chunk_size); | |
| // kgv = kg.transpose(-1, -2) @ v_new | |
| // v_new: [chunk_size, EV] | |
| at::native::cpublas::brgemm( | |
| /* M */ qk_head_size, | |
| /* N */ v_head_size, | |
| /* K */ chunk_size, | |
| /* lda */ chunk_size, | |
| /* ldb */ v_head_size, | |
| /* ldc */ v_head_size, | |
| /* add_C */ false, | |
| /* A */ kg_transpose, | |
| /* B */ v_prime_pack_reduced, | |
| /* C */ kgv); | |
| // last_recurrent_state = 1) + 2) | |
| for (int64_t m = 0; m < qk_head_size; m++) { | |
| at::vec::map2<float>( | |
| [](fVec x, fVec y) { return x + y; }, | |
| curr_last_recurrent_state + m * v_head_size, | |
| curr_last_recurrent_state + m * v_head_size, | |
| kgv + m * v_head_size, | |
| v_head_size); | |
| } | |
| } | |
| // core_attn_out -> output | |
| // output: [B, T, HV, EV] | |
| // core_attn_out: [B, HV, padded_T, EV] | |
| auto curr_out = out_ptr + h * oStrideH; | |
| for (int64_t m = 0; m < seq_len; m++) { | |
| at::vec::map<scalar_t>( | |
| [](fVec x) { return x; }, curr_out + m * oStrideT, curr_core_attn_out + m * v_head_size, v_head_size); | |
| } | |
| // Move to the next query | |
| data_index_step(b, batch_size, h, v_num_head); | |
| } | |
| }); | |
| } | |
| inline float softplus(float x, double threshold = 20.0) { | |
| if (x > threshold) | |
| return x; | |
| else if (x < -threshold) | |
| return std::exp(x); | |
| else | |
| return std::log1p(std::exp(x)); | |
| } | |
| inline at::vec::Vectorized<float> softplus(const at::vec::Vectorized<float>& x, double threshold = 20.0) { | |
| using Vec = at::vec::Vectorized<float>; | |
| Vec mask_hi = x > Vec(threshold); | |
| Vec mask_lo = x < Vec(-threshold); | |
| Vec expx = x.exp_u20(); | |
| Vec log1pex = (expx + Vec(1.0f)).log(); | |
| return Vec::blendv(Vec::blendv(log1pex, expx, mask_lo), x, mask_hi); | |
| } | |
| template <typename scalar_t> | |
| void fused_sigmoid_gating_delta_rule_update_kernel_impl( | |
| const scalar_t* __restrict__ q_ptr, | |
| const scalar_t* __restrict__ k_ptr, | |
| const scalar_t* __restrict__ v_ptr, | |
| const float* __restrict__ A_log_ptr, | |
| const scalar_t* __restrict__ a_ptr, | |
| const scalar_t* __restrict__ dt_bias_ptr, | |
| const scalar_t* __restrict__ b_ptr, | |
| const int32_t* __restrict__ indices_ptr, | |
| float* __restrict__ state_ptr, | |
| scalar_t* __restrict__ o_ptr, | |
| float* __restrict__ qk_scale_buf, | |
| int64_t seq_len, | |
| int64_t batch_size, | |
| int64_t num_heads, | |
| int64_t head_dim, | |
| int64_t v_num_heads, | |
| int64_t v_head_dim, | |
| int64_t q_strideB, | |
| int64_t q_strideS, | |
| int64_t q_strideH, | |
| int64_t k_strideB, | |
| int64_t k_strideS, | |
| int64_t k_strideH, | |
| int64_t v_strideB, | |
| int64_t v_strideS, | |
| int64_t v_strideH, | |
| bool use_qk_l2norm_in_kernel, | |
| double softplus_threshold) { | |
| using bVec = at::vec::Vectorized<scalar_t>; | |
| using fVec = at::vec::Vectorized<float>; | |
| constexpr int64_t VecSize = bVec::size(); | |
| constexpr int64_t fVecSize = fVec::size(); | |
| int64_t group_size = v_num_heads / num_heads; | |
| double scale = 1 / std::sqrt(head_dim); | |
| fVec scale_vec = fVec(scale); | |
| if (use_qk_l2norm_in_kernel) { | |
| float eps = 1e-5; | |
| at::parallel_for(0, batch_size * seq_len * num_heads, 0, [&](int64_t begin, int64_t end) { | |
| int64_t bi{0}, si{0}, ni{0}; | |
| data_index_init(begin, bi, batch_size, si, seq_len, ni, num_heads); | |
| for (int64_t i = begin; i < end; ++i) { | |
| float sum_q = float(0); | |
| float sum_k = float(0); | |
| fVec sum_q_fvec = fVec(float(0)); | |
| fVec sum_k_fvec = fVec(float(0)); | |
| int64_t q_offset = bi * q_strideB + si * q_strideS + ni * q_strideH; | |
| int64_t k_offset = bi * k_strideB + si * k_strideS + ni * k_strideH; | |
| int64_t q_scale_offset = bi * seq_len * num_heads + si * num_heads + ni; | |
| int64_t k_scale_offset = q_scale_offset + batch_size * seq_len * num_heads; | |
| int64_t d; | |
| for (d = 0; d <= head_dim - VecSize; d += VecSize) { | |
| bVec q_bvec = bVec::loadu(q_ptr + q_offset + d); | |
| fVec q_fvec0, q_fvec1; | |
| std::tie(q_fvec0, q_fvec1) = at::vec::convert_to_float(q_bvec); | |
| sum_q_fvec += q_fvec0 * q_fvec0; | |
| sum_q_fvec += q_fvec1 * q_fvec1; | |
| bVec k_bvec = bVec::loadu(k_ptr + k_offset + d); | |
| fVec k_fvec0, k_fvec1; | |
| std::tie(k_fvec0, k_fvec1) = at::vec::convert_to_float(k_bvec); | |
| sum_k_fvec += k_fvec0 * k_fvec0; | |
| sum_k_fvec += k_fvec1 * k_fvec1; | |
| } | |
| for (; d < head_dim; ++d) { | |
| float q_val = static_cast<float>(q_ptr[q_offset + d]); | |
| sum_q += q_val * q_val; | |
| float k_val = static_cast<float>(k_ptr[k_offset + d]); | |
| sum_k += k_val * k_val; | |
| } | |
| sum_q += vec_reduce_sum(sum_q_fvec); | |
| sum_k += vec_reduce_sum(sum_k_fvec); | |
| qk_scale_buf[q_scale_offset] = float(1) / std::sqrt(sum_q + eps); | |
| qk_scale_buf[k_scale_offset] = float(1) / std::sqrt(sum_k + eps); | |
| data_index_step(bi, batch_size, si, seq_len, ni, num_heads); | |
| } | |
| }); | |
| } | |
| at::parallel_for(0, batch_size * seq_len * v_num_heads, 0, [&](int64_t begin, int64_t end) { | |
| int64_t bi{0}, si{0}, ni{0}; | |
| data_index_init(begin, bi, batch_size, si, seq_len, ni, v_num_heads); | |
| for (int64_t i = begin; i < end; ++i) { | |
| int64_t cache_index = indices_ptr[bi]; | |
| int64_t state_offset = (cache_index * v_num_heads + ni) * head_dim * v_head_dim; | |
| float g_val = -std::exp(A_log_ptr[ni]) * | |
| softplus(float(a_ptr[bi * v_num_heads + ni]) + float(dt_bias_ptr[ni]), softplus_threshold); | |
| float g_val_exp = std::exp(g_val); | |
| fVec g_val_exp_vec = fVec(g_val_exp); | |
| int64_t q_offset = si * q_strideS + bi * q_strideB + (ni / group_size) * q_strideH; | |
| int64_t k_offset = si * k_strideS + bi * k_strideB + (ni / group_size) * k_strideH; | |
| int64_t q_scale_offset = bi * seq_len * num_heads + si * num_heads + (ni / group_size); | |
| int64_t k_scale_offset = q_scale_offset + batch_size * seq_len * num_heads; | |
| float q_scale = use_qk_l2norm_in_kernel ? qk_scale_buf[q_scale_offset] : 1.0f; | |
| float k_scale = use_qk_l2norm_in_kernel ? qk_scale_buf[k_scale_offset] : 1.0f; | |
| int64_t v_offset = si * v_strideS + bi * v_strideB + ni * v_strideH; | |
| int64_t o_offset = ((bi * seq_len + si) * v_num_heads + ni) * v_head_dim; | |
| float beta_val = 1 / (1 + std::exp(-b_ptr[ni])); | |
| fVec beta_vec = fVec(beta_val); | |
| int64_t dvi = 0; | |
| for (; dvi <= v_head_dim - VecSize; dvi += VecSize) { | |
| fVec kv_mem_vec0 = fVec(float(0)); | |
| fVec kv_mem_vec1 = fVec(float(0)); | |
| for (int di = 0; di < head_dim; ++di) { | |
| fVec k_val_vec = fVec(k_ptr[k_offset + di] * k_scale); | |
| fVec state_vec0 = fVec::loadu(state_ptr + state_offset + di * v_head_dim + dvi); | |
| fVec state_vec1 = fVec::loadu(state_ptr + state_offset + di * v_head_dim + dvi + fVecSize); | |
| kv_mem_vec0 = kv_mem_vec0 + state_vec0 * g_val_exp_vec * k_val_vec; | |
| kv_mem_vec1 = kv_mem_vec1 + state_vec1 * g_val_exp_vec * k_val_vec; | |
| } | |
| bVec v_bvec = bVec::loadu(v_ptr + v_offset + dvi); | |
| fVec v_vec0, v_vec1; | |
| std::tie(v_vec0, v_vec1) = at::vec::convert_to_float(v_bvec); | |
| fVec dt_vec0 = (v_vec0 - kv_mem_vec0) * beta_vec; | |
| fVec dt_vec1 = (v_vec1 - kv_mem_vec1) * beta_vec; | |
| fVec o_vec0 = fVec(float(0)); | |
| fVec o_vec1 = fVec(float(0)); | |
| for (int di = 0; di < head_dim; ++di) { | |
| fVec q_vec = fVec(q_ptr[q_offset + di] * q_scale); | |
| fVec k_vec = fVec(k_ptr[k_offset + di] * k_scale); | |
| fVec state_vec0 = fVec::loadu(state_ptr + state_offset + di * v_head_dim + dvi); | |
| fVec state_vec1 = fVec::loadu(state_ptr + state_offset + di * v_head_dim + dvi + fVecSize); | |
| state_vec0 = state_vec0 * g_val_exp_vec + k_vec * dt_vec0; | |
| state_vec1 = state_vec1 * g_val_exp_vec + k_vec * dt_vec1; | |
| o_vec0 = o_vec0 + state_vec0 * q_vec * scale_vec; | |
| o_vec1 = o_vec1 + state_vec1 * q_vec * scale_vec; | |
| state_vec0.store(state_ptr + state_offset + di * v_head_dim + dvi); | |
| state_vec1.store(state_ptr + state_offset + di * v_head_dim + dvi + fVecSize); | |
| } | |
| bVec o_vec = at::vec::convert_from_float<scalar_t>(o_vec0, o_vec1); | |
| o_vec.store(o_ptr + o_offset + dvi); | |
| } | |
| for (; dvi < v_head_dim; ++dvi) { | |
| float kv_mem_val = 0; | |
| for (int di = 0; di < head_dim; ++di) { | |
| float k_val = k_ptr[k_offset + di] * k_scale; | |
| state_ptr[state_offset + di * v_head_dim + dvi] *= g_val_exp; | |
| kv_mem_val += state_ptr[state_offset + di * v_head_dim + dvi] * k_val; | |
| } | |
| float v_val = v_ptr[v_offset + dvi]; | |
| float dt_val = (v_val - kv_mem_val) * beta_val; | |
| float o_val = 0; | |
| for (int di = 0; di < head_dim; ++di) { | |
| float q_val = q_ptr[q_offset + di] * q_scale; | |
| float k_val = k_ptr[k_offset + di] * k_scale; | |
| state_ptr[state_offset + di * v_head_dim + dvi] += k_val * dt_val; | |
| o_val += state_ptr[state_offset + di * v_head_dim + dvi] * q_val * scale; | |
| } | |
| o_ptr[o_offset + dvi] = o_val; | |
| } | |
| data_index_step(bi, batch_size, si, seq_len, ni, v_num_heads); | |
| } | |
| }); | |
| } | |
| template <typename scalar_t> | |
| void fused_gdn_gating_kernel_impl( | |
| float* __restrict__ A_log, | |
| const scalar_t* __restrict__ a, | |
| const scalar_t* __restrict__ b, | |
| const scalar_t* __restrict__ dt_bias, | |
| float* __restrict__ out, | |
| scalar_t* __restrict__ beta, | |
| int64_t batch, | |
| int64_t num_heads) { | |
| using bVec = at::vec::Vectorized<scalar_t>; | |
| using fVec = at::vec::Vectorized<float>; | |
| constexpr int vec_size = bVec::size(); | |
| constexpr int fvec_size = fVec::size(); | |
| const fVec neg_one(-1.0f); | |
| const fVec one(1.0f); | |
| at::parallel_for(0, batch, 0, [&](int64_t begin, int64_t end) { | |
| for (int64_t i = begin; i < end; ++i) { | |
| int64_t j = 0; | |
| for (; j < num_heads - (num_heads % vec_size); j += vec_size) { | |
| fVec A_log_vec0 = fVec::loadu(A_log + j); | |
| fVec A_log_vec1 = fVec::loadu(A_log + j + fvec_size); | |
| bVec dt_bias_vec = bVec::loadu(dt_bias + j); | |
| bVec a_bvec = bVec::loadu(a + i * num_heads + j); | |
| bVec b_bvec = bVec::loadu(b + i * num_heads + j); | |
| fVec a0, a1, dt_bias_vec0, dt_bias_vec1, b0, b1; | |
| std::tie(a0, a1) = at::vec::convert_to_float(a_bvec); | |
| std::tie(b0, b1) = at::vec::convert_to_float(b_bvec); | |
| std::tie(dt_bias_vec0, dt_bias_vec1) = at::vec::convert_to_float(dt_bias_vec); | |
| fVec g0 = neg_one * A_log_vec0.exp_u20() * softplus(a0 + dt_bias_vec0); | |
| fVec g1 = neg_one * A_log_vec1.exp_u20() * softplus(a1 + dt_bias_vec1); | |
| fVec beta0 = one / (one + (neg_one * b0).exp_u20()); | |
| fVec beta1 = one / (one + (neg_one * b1).exp_u20()); | |
| g0.store(out + i * num_heads + j); | |
| g1.store(out + i * num_heads + j + fvec_size); | |
| bVec beta_vec = at::vec::convert_from_float<scalar_t>(beta0, beta1); | |
| beta_vec.store(beta + i * num_heads + j); | |
| } | |
| for (; j < num_heads; ++j) { | |
| out[i * num_heads + j] = -std::exp(A_log[j]) * softplus(float(a[i * num_heads + j]) + float(dt_bias[j])); | |
| beta[i * num_heads + j] = 1 / (1 + std::exp(-b[i * num_heads + j])); | |
| } | |
| } | |
| }); | |
| } | |
| } // anonymous namespace | |
| template <bool is_last_dim_contiguous> | |
| inline void | |
| CHECK_INPUT_SHAPE_DTYPE(const at::Tensor& tensor, const int64_t& dim, const at::IntArrayRef& sizes, at::ScalarType st) { | |
| TORCH_CHECK(tensor.sizes() == sizes, "Input tensor shape mismatch: expected ", sizes, ", got ", tensor.sizes()); | |
| TORCH_CHECK(tensor.dtype() == st, "Input tensor dtype mismatch"); | |
| CHECK_DIM(dim, tensor); | |
| if (is_last_dim_contiguous) { | |
| CHECK_LAST_DIM_CONTIGUOUS_INPUT(tensor); | |
| } else { | |
| CHECK_CONTIGUOUS(tensor); | |
| } | |
| } | |
| // query: [B, T, HK, EK] | |
| // key: [B, T, HK, EK] | |
| // value: [B, T, HV, EV] | |
| // g: [B, T, HV] FP32 | |
| // beta: [B, T, HV] | |
| // initial_state: [N, HV, EK, EV] FP32 | |
| // output_final_state: bool | |
| // cu_seqlens: [N + 1] INT32 | |
| // head_first: bool | |
| // use_qk_l2norm_in_kernel: bool | |
| std::tuple<at::Tensor, at::Tensor> chunk_gated_delta_rule_cpu( | |
| const at::Tensor& query, | |
| const at::Tensor& key, | |
| const at::Tensor& value, | |
| const at::Tensor& g, | |
| const at::Tensor& beta, | |
| const at::Tensor& initial_state, | |
| bool output_final_state, | |
| const at::Tensor& cu_seqlens, | |
| bool head_first, | |
| bool use_qk_l2norm_in_kernel, | |
| double eps = 1e-5) { | |
| RECORD_FUNCTION( | |
| "sgl-kernel::chunk_gated_delta_rule_cpu", std::vector<c10::IValue>({query, key, value, g, beta, initial_state})); | |
| TORCH_CHECK(head_first == false, "chunk_gated_delta_rule_cpu does not support head first"); | |
| int64_t B = query.size(0); | |
| int64_t global_seq_len = query.size(1); | |
| int64_t qk_num_head = query.size(2); | |
| int64_t qk_head_size = query.size(3); | |
| int64_t v_num_head = value.size(2); | |
| int64_t v_head_size = value.size(3); | |
| int64_t batch_size = initial_state.size(0); | |
| CHECK_EQ(B, 1); | |
| TORCH_CHECK(v_num_head % qk_num_head == 0, "expect v_num_head multiple of qk_num_head."); | |
| TORCH_CHECK(qk_head_size % 32 == 0, "expect qk_head_size to be multiples of 32."); | |
| TORCH_CHECK(v_head_size % 32 == 0, "expect v_head_size to be multiples of 32."); | |
| CHECK_INPUT_SHAPE_DTYPE<true>(query, 4, {B, global_seq_len, qk_num_head, qk_head_size}, at::kBFloat16); | |
| CHECK_INPUT_SHAPE_DTYPE<true>(key, 4, {B, global_seq_len, qk_num_head, qk_head_size}, at::kBFloat16); | |
| CHECK_INPUT_SHAPE_DTYPE<true>(value, 4, {B, global_seq_len, v_num_head, v_head_size}, at::kBFloat16); | |
| CHECK_INPUT_SHAPE_DTYPE<false>(g, 3, {B, global_seq_len, v_num_head}, at::kFloat); | |
| CHECK_INPUT_SHAPE_DTYPE<false>(beta, 3, {B, global_seq_len, v_num_head}, at::kBFloat16); | |
| CHECK_INPUT_SHAPE_DTYPE<false>(cu_seqlens, 1, {batch_size + 1}, at::kInt); | |
| CHECK_INPUT_SHAPE_DTYPE<false>(initial_state, 4, {batch_size, v_num_head, qk_head_size, v_head_size}, at::kFloat); | |
| at::Tensor output = at::empty_like(value, value.options()); // [B, T, HV, EV] | |
| at::Tensor final_state = initial_state.to(at::kFloat); // [N, HV, EK, EV] | |
| // Strides | |
| int64_t qStrideH = query.stride(2); | |
| int64_t qStrideT = query.stride(1); | |
| int64_t kStrideH = key.stride(2); | |
| int64_t kStrideT = key.stride(1); | |
| int64_t vStrideH = value.stride(2); | |
| int64_t vStrideT = value.stride(1); | |
| int64_t oStrideH = output.stride(2); | |
| int64_t oStrideT = output.stride(1); | |
| constexpr int64_t chunk_size = 64; | |
| // Deduce the global chunks | |
| // e.g. cu_seqlens: [0, 5, 13, 16], chunk_size = 4 | |
| // chunk_offsets: [0, 2, 4, 5] | |
| // chunk_indices (batch_id, local_chunk_id): [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0]] | |
| at::Tensor chunk_offsets = at::empty(batch_size + 1, cu_seqlens.options()); | |
| auto chunk_offsets_ptr = chunk_offsets.data_ptr<int32_t>(); | |
| chunk_offsets_ptr[0] = 0; | |
| int32_t* cu_seqlens_ptr = cu_seqlens.data_ptr<int32_t>(); | |
| int64_t s = 0; | |
| int64_t e = 0; | |
| int64_t s_pad = 0; | |
| int64_t e_pad = 0; | |
| for (int64_t b = 0; b < batch_size; b++) { | |
| e = cu_seqlens_ptr[b + 1]; | |
| int64_t seq_len = e - s; | |
| int64_t pad_size = (chunk_size - seq_len % chunk_size) % chunk_size; | |
| int64_t total_seq_length = seq_len + pad_size; | |
| e_pad = s_pad + total_seq_length; | |
| chunk_offsets[b + 1] = e_pad / chunk_size; | |
| s = e; | |
| s_pad = e_pad; | |
| } | |
| int64_t global_total_seq_length = e_pad; | |
| int64_t global_num_chunk = chunk_offsets_ptr[batch_size]; | |
| at::Tensor chunk_indices = at::empty(global_num_chunk * 2, cu_seqlens.options()); | |
| auto chunk_indices_ptr = chunk_indices.data_ptr<int32_t>(); | |
| int64_t curr_c = 0; | |
| for (int64_t b = 0; b < batch_size; b++) { | |
| int64_t batch_chunk_num = chunk_offsets_ptr[b + 1] - chunk_offsets_ptr[b]; | |
| for (int64_t c = 0; c < batch_chunk_num; c++) { | |
| chunk_indices_ptr[curr_c * 2] = b; | |
| chunk_indices_ptr[curr_c * 2 + 1] = c; | |
| curr_c += 1; | |
| } | |
| } | |
| // Allocate buffer | |
| int64_t buff_size = v_num_head * global_total_seq_length // g_pad_data | |
| + batch_size * v_num_head * global_total_seq_length * v_head_size // core_attn | |
| + v_num_head * global_total_seq_length * chunk_size // decay_mask | |
| + v_num_head * global_total_seq_length * v_head_size; // v_beta_attn | |
| at::Tensor buff_data = at::empty({buff_size}, query.options().dtype(at::kFloat)); | |
| int64_t reduced_buff_size = qk_num_head * global_total_seq_length * qk_head_size // q_pad_data | |
| + qk_num_head * global_total_seq_length * qk_head_size // k_pad_data | |
| + v_num_head * global_total_seq_length * v_head_size // v_pad_data | |
| + v_num_head * global_total_seq_length * qk_head_size // k_beta_data | |
| + v_num_head * global_total_seq_length * v_head_size // v_beta_data | |
| + v_num_head * global_total_seq_length * qk_head_size // k_cumdecay_reduced | |
| + qk_num_head * global_seq_len // q_norm_sum | |
| + qk_num_head * global_seq_len; // k_norm_sum | |
| at::Tensor reduced_buff_data = at::empty({reduced_buff_size}, query.options()); | |
| int64_t num_thread = at::get_num_threads(); | |
| int64_t buff_size_16bit_per_thread = | |
| /* k_transpose */ qk_head_size * chunk_size + | |
| /* v_pack */ chunk_size * v_head_size + | |
| /* k_beta_g */ chunk_size * qk_head_size + | |
| /* k_beta_g_pack */ chunk_size * qk_head_size + | |
| /* attn */ chunk_size * chunk_size * 2 + | |
| /* attn_reduced */ chunk_size * chunk_size + | |
| /* k_cumdecay */ chunk_size * qk_head_size * 2 + | |
| /* row */ chunk_size * 2 + | |
| /* updated */ chunk_size * 2 + | |
| /* curr_last_recurrent_state_reduced */ qk_head_size * v_head_size + | |
| /* curr_last_recurrent_state_pack_reduced */ qk_head_size * v_head_size + | |
| /* k_transpose_i */ qk_head_size * chunk_size + | |
| /* attn_i */ chunk_size * chunk_size * 2 + | |
| /* attn_i_reduced */ chunk_size * chunk_size + | |
| /* v_prime */ chunk_size * v_head_size * 2 + | |
| /* v_prime_reduced */ chunk_size * v_head_size + | |
| /* v_prime_pack_reduced */ chunk_size * v_head_size + | |
| /* qg */ chunk_size * qk_head_size + | |
| /* attn_inter */ chunk_size * v_head_size * 2 + | |
| /* kg */ chunk_size * qk_head_size + | |
| /* kg_transpose */ qk_head_size * chunk_size + | |
| /* kgv */ qk_head_size * v_head_size * 2; | |
| at::Tensor thread_buff_data = at::empty({num_thread, buff_size_16bit_per_thread}, query.options()); | |
| AT_DISPATCH_REDUCED_FLOATING_TYPES(query.scalar_type(), "chunk_gated_delta_rule_kernel", [&] { | |
| chunk_gated_delta_rule_kernel_impl<scalar_t, chunk_size>( | |
| output.data_ptr<scalar_t>(), | |
| final_state.data_ptr<float>(), | |
| query.data_ptr<scalar_t>(), | |
| key.data_ptr<scalar_t>(), | |
| value.data_ptr<scalar_t>(), | |
| g.data_ptr<float>(), | |
| beta.data_ptr<scalar_t>(), | |
| cu_seqlens_ptr, | |
| buff_data.data_ptr<float>(), | |
| reduced_buff_data.data_ptr<scalar_t>(), | |
| thread_buff_data.data_ptr<scalar_t>(), | |
| chunk_offsets_ptr, | |
| chunk_indices_ptr, | |
| use_qk_l2norm_in_kernel, | |
| batch_size, | |
| global_seq_len, | |
| qk_num_head, | |
| v_num_head, | |
| qk_head_size, | |
| v_head_size, | |
| qStrideH, | |
| qStrideT, | |
| kStrideH, | |
| kStrideT, | |
| vStrideH, | |
| vStrideT, | |
| oStrideH, | |
| oStrideT, | |
| global_total_seq_length, | |
| global_num_chunk, | |
| buff_size_16bit_per_thread, | |
| eps); | |
| }); | |
| return std::make_tuple(std::move(output), std::move(final_state)); | |
| } | |
| // A_log: [v_num_heads] | |
| // dt_bias: [v_num_heads] | |
| // query: [seq_len, batch_size, num_heads, head_dim] | |
| // key: [seq_len, batch_size, num_heads, head_dim] | |
| // value: [seq_len, batch_size, v_num_heads, v_head_dim] | |
| // a: [batch_size, v_num_heads] | |
| // b: [batch_size, v_num_heads] | |
| // initial_state_source:[num_tokens, v_num_heads, head_dim, v_head_dim] | |
| // initial_state_indices: [batch_size] | |
| // cu_seqlens: [batch_size + 1] | |
| at::Tensor fused_sigmoid_gating_delta_rule_update_cpu( | |
| const at::Tensor& A_log, | |
| const at::Tensor& dt_bias, | |
| const at::Tensor& q, | |
| const at::Tensor& k, | |
| const at::Tensor& v, | |
| const at::Tensor& a, | |
| const at::Tensor& b, | |
| at::Tensor& initial_state_source, | |
| const at::Tensor& initial_state_indices, | |
| const at::Tensor& cu_seqlens, | |
| bool use_qk_l2norm_in_kernel, | |
| double softplus_beta = 1.0, | |
| double softplus_threshold = 20.0) { | |
| RECORD_FUNCTION( | |
| "sgl-kernel::fused_sigmoid_gating_delta_rule_update_cpu", | |
| std::vector<c10::IValue>( | |
| {A_log, dt_bias, q, k, v, a, b, initial_state_source, initial_state_indices, cu_seqlens})); | |
| CHECK_DIM(4, q); | |
| CHECK_DIM(4, v); | |
| CHECK_LAST_DIM_CONTIGUOUS_INPUT(q); | |
| int64_t seq_len = q.size(0); | |
| int64_t batch_size = q.size(1); | |
| int64_t num_heads = q.size(2); | |
| int64_t head_dim = q.size(3); | |
| int64_t v_num_heads = v.size(2); | |
| int64_t v_head_dim = v.size(3); | |
| CHECK_INPUT_SHAPE_DTYPE<true>(k, {seq_len, batch_size, num_heads, head_dim}, q.scalar_type()); | |
| CHECK_INPUT_SHAPE_DTYPE<true>(v, {seq_len, batch_size, v_num_heads, v_head_dim}, q.scalar_type()); | |
| CHECK_INPUT_SHAPE_DTYPE<true>(A_log, {v_num_heads}, at::kFloat); | |
| CHECK_INPUT_SHAPE_DTYPE<true>(a, {batch_size, v_num_heads}, q.scalar_type()); | |
| CHECK_INPUT_SHAPE_DTYPE<true>(dt_bias, {v_num_heads}, q.scalar_type()); | |
| CHECK_INPUT_SHAPE_DTYPE<true>(b, {batch_size, v_num_heads}, q.scalar_type()); | |
| CHECK_INPUT_SHAPE_DTYPE<true>(initial_state_indices, {batch_size}, at::kInt); | |
| CHECK_INPUT_SHAPE_DTYPE<true>(cu_seqlens, {batch_size + 1}, at::kInt); | |
| CHECK_INPUT_SHAPE_DTYPE<true>( | |
| initial_state_source, {initial_state_source.size(0), v_num_heads, head_dim, v_head_dim}, at::kFloat); | |
| CHECK(initial_state_source.size(0) >= batch_size); | |
| CHECK_EQ(v_num_heads % num_heads, 0); | |
| int64_t q_strideB = q.stride(1); | |
| int64_t q_strideS = q.stride(0); | |
| int64_t q_strideH = q.stride(2); | |
| int64_t k_strideB = k.stride(1); | |
| int64_t k_strideS = k.stride(0); | |
| int64_t k_strideH = k.stride(2); | |
| int64_t v_strideB = v.stride(1); | |
| int64_t v_strideS = v.stride(0); | |
| int64_t v_strideH = v.stride(2); | |
| at::Tensor core_attn_out = at::empty({batch_size, seq_len, v_num_heads, v_head_dim}, q.options()); | |
| at::Tensor qk_scale_buf = at::empty({2 * batch_size, seq_len, num_heads}, at::kFloat); | |
| AT_DISPATCH_REDUCED_FLOATING_TYPES(q.scalar_type(), "fused_sigmoid_gating_delta_rule_update_kernel_impl", [&] { | |
| fused_sigmoid_gating_delta_rule_update_kernel_impl<scalar_t>( | |
| q.data_ptr<scalar_t>(), | |
| k.data_ptr<scalar_t>(), | |
| v.data_ptr<scalar_t>(), | |
| A_log.data_ptr<float>(), | |
| a.data_ptr<scalar_t>(), | |
| dt_bias.data_ptr<scalar_t>(), | |
| b.data_ptr<scalar_t>(), | |
| initial_state_indices.data_ptr<int32_t>(), | |
| initial_state_source.data_ptr<float>(), | |
| core_attn_out.data_ptr<scalar_t>(), | |
| qk_scale_buf.data_ptr<float>(), | |
| seq_len, | |
| batch_size, | |
| num_heads, | |
| head_dim, | |
| v_num_heads, | |
| v_head_dim, | |
| q_strideB, | |
| q_strideS, | |
| q_strideH, | |
| k_strideB, | |
| k_strideS, | |
| k_strideH, | |
| v_strideB, | |
| v_strideS, | |
| v_strideH, | |
| use_qk_l2norm_in_kernel, | |
| softplus_threshold); | |
| }); | |
| return core_attn_out; | |
| } | |
| // A_log: [num_v_heads] | |
| // a: [batch, num_v_heads] | |
| // b: [batch, num_v_heads] | |
| // dt_bias: [num_v_heads] | |
| // -A_log.float().exp() * F.softplus(a.float() + dt_bias) | |
| std::tuple<at::Tensor, at::Tensor> | |
| fused_gdn_gating_cpu(const at::Tensor& A_log, const at::Tensor& a, const at::Tensor& b, const at::Tensor& dt_bias) { | |
| RECORD_FUNCTION("sgl-kernel::fused_gdn_gating_cpu", std::vector<c10::IValue>({A_log, a, b, dt_bias})); | |
| CHECK_DIM(1, A_log); | |
| CHECK_DIM(2, a); | |
| CHECK_DIM(2, b); | |
| CHECK_DIM(1, dt_bias); | |
| CHECK_CONTIGUOUS(a); | |
| CHECK_EQ(A_log.size(0), a.size(1)); | |
| CHECK_EQ(A_log.size(0), dt_bias.size(0)); | |
| int batch = a.size(0); | |
| int num_heads = a.size(1); | |
| CHECK_EQ(b.size(0), batch); | |
| CHECK_EQ(b.size(1), num_heads); | |
| at::Tensor out = at::empty({1, batch, num_heads}, a.options().dtype(at::kFloat)); | |
| at::Tensor beta = at::empty({1, batch, num_heads}, b.options()); | |
| AT_DISPATCH_REDUCED_FLOATING_TYPES(a.scalar_type(), "fused_gdn_gating_kernel", [&] { | |
| fused_gdn_gating_kernel_impl<scalar_t>( | |
| A_log.data_ptr<float>(), | |
| a.data_ptr<scalar_t>(), | |
| b.data_ptr<scalar_t>(), | |
| dt_bias.data_ptr<scalar_t>(), | |
| out.data_ptr<float>(), | |
| beta.data_ptr<scalar_t>(), | |
| batch, | |
| num_heads); | |
| }); | |
| return std::make_tuple(out, beta); | |
| } | |