|
| 1 | +import triton |
| 2 | +import triton.language as tl |
| 3 | + |
| 4 | +from flag_gems.utils import triton_lang_extension as tle |
| 5 | + |
| 6 | + |
| 7 | +@triton.jit |
| 8 | +def bmm_kernel( |
| 9 | + A, |
| 10 | + B, |
| 11 | + O, |
| 12 | + M, |
| 13 | + N, |
| 14 | + K, |
| 15 | + TILE_M: tl.constexpr, |
| 16 | + TILE_N: tl.constexpr, |
| 17 | + TILE_K: tl.constexpr, |
| 18 | + GROUP_M: tl.constexpr, |
| 19 | + DIVISIBLE_M: tl.constexpr, |
| 20 | + DIVISIBLE_N: tl.constexpr, |
| 21 | + DIVISIBLE_K: tl.constexpr, |
| 22 | +): |
| 23 | + # batch offsets |
| 24 | + pid_b = tle.program_id(2) |
| 25 | + A += pid_b * M * K |
| 26 | + B += pid_b * K * N |
| 27 | + O += pid_b * M * N |
| 28 | + |
| 29 | + pidx = tle.program_id(0) |
| 30 | + pidy = tle.program_id(1) |
| 31 | + |
| 32 | + if GROUP_M == 1: |
| 33 | + pid_m, pid_n = pidx, pidy |
| 34 | + else: |
| 35 | + # reorder CTAs |
| 36 | + gridx = tle.num_programs(0) |
| 37 | + gridy = tle.num_programs(1) |
| 38 | + pid = pidx + pidy * gridx |
| 39 | + |
| 40 | + num_CTA_per_group = gridy * GROUP_M |
| 41 | + |
| 42 | + group_id = pid // num_CTA_per_group |
| 43 | + inner_group_id = pid % num_CTA_per_group |
| 44 | + GROUP_SIZE = tl.where( |
| 45 | + (group_id * GROUP_M + GROUP_M) > gridx, gridx % GROUP_M, GROUP_M |
| 46 | + ) |
| 47 | + pid_m = group_id * GROUP_M + inner_group_id % GROUP_SIZE |
| 48 | + pid_n = inner_group_id // GROUP_SIZE |
| 49 | + |
| 50 | + offs_m = pid_m * TILE_M + tl.arange(0, TILE_M) |
| 51 | + offs_n = pid_n * TILE_N + tl.arange(0, TILE_N) |
| 52 | + offs_k = tl.arange(0, TILE_K) |
| 53 | + |
| 54 | + if not DIVISIBLE_M: |
| 55 | + mask_m = offs_m < M |
| 56 | + if not DIVISIBLE_N: |
| 57 | + mask_n = offs_n < N |
| 58 | + |
| 59 | + a_ptrs = A + offs_m[:, None] * K + offs_k[None, :] |
| 60 | + b_ptrs = B + offs_k[:, None] * N + offs_n[None, :] |
| 61 | + o_ptrs = O + offs_m[:, None] * N + offs_n[None, :] |
| 62 | + |
| 63 | + num_iters = tl.cdiv(K, TILE_K) |
| 64 | + o = tl.zeros((TILE_M, TILE_N), dtype=tl.float32) |
| 65 | + for _ in range(num_iters): |
| 66 | + if DIVISIBLE_K: |
| 67 | + if DIVISIBLE_M: |
| 68 | + mask_a = None |
| 69 | + else: |
| 70 | + mask_a = mask_m[:, None] |
| 71 | + if DIVISIBLE_N: |
| 72 | + mask_b = None |
| 73 | + else: |
| 74 | + mask_b = mask_n[None, :] |
| 75 | + else: |
| 76 | + mask_k = offs_k < K |
| 77 | + if DIVISIBLE_M: |
| 78 | + mask_a = mask_k[None, :] |
| 79 | + else: |
| 80 | + mask_a = mask_m[:, None] & mask_k[None, :] |
| 81 | + if DIVISIBLE_N: |
| 82 | + mask_b = mask_k[:, None] |
| 83 | + else: |
| 84 | + mask_b = mask_k[:, None] & mask_n[None, :] |
| 85 | + |
| 86 | + a = tl.load(a_ptrs, mask_a) |
| 87 | + b = tl.load(b_ptrs, mask_b) |
| 88 | + |
| 89 | + offs_k += TILE_K |
| 90 | + a_ptrs += TILE_K |
| 91 | + b_ptrs += TILE_K * N |
| 92 | + |
| 93 | + o += tl.dot(a, b, allow_tf32=False) |
| 94 | + |
| 95 | + if DIVISIBLE_M and DIVISIBLE_N: |
| 96 | + mask_c = None |
| 97 | + elif DIVISIBLE_M and not DIVISIBLE_N: |
| 98 | + mask_c = mask_n[None, :] |
| 99 | + elif not DIVISIBLE_M and DIVISIBLE_N: |
| 100 | + mask_c = mask_m[:, None] |
| 101 | + else: |
| 102 | + mask_c = mask_m[:, None] & mask_n[None, :] |
| 103 | + tl.store(o_ptrs, o, mask_c) |
0 commit comments