@triton.heuristics({'STORE_FINAL_STATE': lambda args: args['ht'] is not
    None, 'USE_OFFSETS': lambda args: args['offsets'] is not None})
@triton.autotune(configs=[triton.Config({'BK': BK, 'BV': BV}, num_warps=
    num_warps, num_stages=num_stages) for BK in [32, 64, 128] for BV in [32,
    64, 128] for num_warps in [2, 4, 8, 16] for num_stages in [2, 3]], key=
    ['BT', 'USE_G', 'USE_GK', 'USE_GV'])
@triton.jit
def chunk_fwd_kernel_h_reduction(h, g, gk, gv, kvt, ht, offsets,
    chunk_offsets, T: tl.constexpr, H: tl.constexpr, K: tl.constexpr, V: tl
    .constexpr, BT: tl.constexpr, BK: tl.constexpr, BV: tl.constexpr, USE_G:
    tl.constexpr, USE_GK: tl.constexpr, USE_GV: tl.constexpr,
    STORE_FINAL_STATE: tl.constexpr, USE_OFFSETS: tl.constexpr, HEAD_FIRST:
    tl.constexpr):
    i_k, i_v, i_nh = tl.program_id(0), tl.program_id(1), tl.program_id(2)
    i_n, i_h = i_nh // H, i_nh % H
    if USE_OFFSETS:
        bos, eos = tl.load(offsets + i_n).to(tl.int32), tl.load(offsets +
            i_n + 1).to(tl.int32)
        T = eos - bos
        NT = tl.cdiv(T, BT)
        boh = tl.load(chunk_offsets + i_n).to(tl.int32)
    else:
        bos, eos = i_n * T, i_n * T + T
        NT = tl.cdiv(T, BT)
        boh = i_n * NT
    b_h = tl.zeros([BK, BV], dtype=tl.float32)
    for i_t in range(NT):
        if HEAD_FIRST:
            p_h = tl.make_block_ptr(h + (i_nh * NT + i_t) * K * V, (K, V),
                (V, 1), (i_k * BK, i_v * BV), (BK, BV), (1, 0))
        else:
            p_h = tl.make_block_ptr(h + ((boh + i_t) * H + i_h) * K * V, (K,
                V), (V, 1), (i_k * BK, i_v * BV), (BK, BV), (1, 0))
        b_h += tl.load(p_h, boundary_check=(0, 1)).to(tl.float32)
        if i_t > 0:
            tl.store(p_h, b_h.to(p_h.dtype.element_ty), boundary_check=(0, 1))
        last_idx = min(i_t * BT + BT, T) - 1
        if USE_G:
            if HEAD_FIRST:
                b_g_last = tl.load(g + i_nh * T + last_idx)
            else:
                b_g_last = tl.load(g + bos * H + last_idx * H + i_h)
            b_h *= tl.exp(b_g_last)
        if USE_GK:
            if HEAD_FIRST:
                p_gk_last = (gk + i_nh * T * K + last_idx * K + i_k * BK +
                    tl.arange(0, BK))
            else:
                p_gk_last = gk + (bos + last_idx
                    ) * H * K + i_h * K + i_k * BK + tl.arange(0, BK)
            p_gk_last = tl.max_contiguous(tl.multiple_of(p_gk_last, BK), BK)
            b_gk_last = tl.load(p_gk_last, mask=i_k * BK + tl.arange(0, BK) <
                K, other=0.0)
            b_h *= tl.exp(b_gk_last)[:, None]
        if USE_GV:
            if HEAD_FIRST:
                p_gv_last = (gv + i_nh * T * V + last_idx * V + i_v * BV +
                    tl.arange(0, BV))
            else:
                p_gv_last = gv + (bos + last_idx
                    ) * H * V + i_h * V + i_v * BV + tl.arange(0, BV)
            p_gv_last = tl.max_contiguous(tl.multiple_of(p_gv_last, BV), BV)
            b_gv_last = tl.load(p_gv_last, mask=i_v * BV + tl.arange(0, BV) <
                V, other=0.0)
            b_h *= tl.exp(b_gv_last)[None, :]
    if STORE_FINAL_STATE:
        p_kvt = tl.make_block_ptr(kvt + i_nh * K * V, (K, V), (V, 1), (i_k *
            BK, i_v * BV), (BK, BV), (1, 0))
        p_ht = tl.make_block_ptr(ht + i_nh * K * V, (K, V), (V, 1), (i_k *
            BK, i_v * BV), (BK, BV), (1, 0))
        b_h += tl.load(p_kvt, boundary_check=(0, 1)).to(tl.float32)
        tl.store(p_ht, b_h.to(p_ht.dtype.element_ty), boundary_check=(0, 1))
