|
4 | 4 |
|
5 | 5 |
|
6 | 6 | class TinyKvCache: |
7 | | - def update_and_fetch(self, key: mx.array, value: mx.array, offset: int) -> mx.array: |
| 7 | + def update_and_fetch( |
| 8 | + self, key: mx.array, value: mx.array, offset: int |
| 9 | + ) -> tuple[mx.array, mx.array]: |
8 | 10 | pass |
| 11 | + |
| 12 | + |
| 13 | +class TinyKvFullCache(TinyKvCache): |
| 14 | + def __init__(self): |
| 15 | + self.key_values = None |
| 16 | + |
| 17 | + def update_and_fetch( |
| 18 | + self, key: mx.array, value: mx.array, offset: int |
| 19 | + ) -> tuple[mx.array, mx.array]: |
| 20 | + if self.key_values is None: |
| 21 | + assert offset == 0 |
| 22 | + self.key_values = (key, value) |
| 23 | + return key, value |
| 24 | + else: |
| 25 | + B, H, _, D = key.shape |
| 26 | + assert key.shape == value.shape |
| 27 | + prev_keys, prev_values = self.key_values |
| 28 | + assert prev_keys.shape == (B, H, offset, D) |
| 29 | + assert prev_values.shape == (B, H, offset, D) |
| 30 | + new_keys = mx.concat([prev_keys, key], axis=2) |
| 31 | + new_values = mx.concat([prev_values, value], axis=2) |
| 32 | + self.key_values = (new_keys, new_values) |
| 33 | + return new_keys, new_values |
| 34 | + |
| 35 | + |
| 36 | +class TinyKvRotatingCache(TinyKvCache): |
| 37 | + def __init__(self, max_seq_len: int): |
| 38 | + self.max_seq_len = max_seq_len |
| 39 | + self.key_values = None |
| 40 | + self.head = 0 |
| 41 | + self.head_offset = 0 |
| 42 | + |
| 43 | + def update_and_fetch( |
| 44 | + self, key: mx.array, value: mx.array, offset: int |
| 45 | + ) -> tuple[mx.array, mx.array]: |
| 46 | + if self.key_values is None: |
| 47 | + assert offset == 0 |
| 48 | + B, H, L, D = key.shape |
| 49 | + assert L <= self.max_seq_len |
| 50 | + keys = mx.zeros((B, H, self.max_seq_len, D)) |
| 51 | + values = mx.zeros((B, H, self.max_seq_len, D)) |
| 52 | + keys[:, :, :L, :] = key |
| 53 | + values[:, :, :L, :] = value |
| 54 | + self.key_values = (keys, values) |
| 55 | + self.head = L |
| 56 | + self.head_offset = L |
| 57 | + return keys[:, :, :L, :], values[:, :, :L, :] |
| 58 | + else: |
| 59 | + B, H, L, D = key.shape |
| 60 | + assert key.shape == value.shape |
| 61 | + assert offset == self.head_offset |
| 62 | + assert L <= self.max_seq_len |
| 63 | + keys, values = self.key_values |
| 64 | + if self.head + L <= self.max_seq_len: |
| 65 | + keys[:, :, self.head : self.head + L, :] = key |
| 66 | + values[:, :, self.head : self.head + L, :] = value |
| 67 | + self.head += L |
| 68 | + self.head_offset += L |
| 69 | + else: |
| 70 | + fill_size = self.max_seq_len - self.head |
| 71 | + keys[:, :, self.head : self.max_seq_len, :] = key[:, :, :fill_size, :] |
| 72 | + values[:, :, self.head : self.max_seq_len, :] = value[ |
| 73 | + :, :, :fill_size, : |
| 74 | + ] |
| 75 | + remaining_size = L - fill_size |
| 76 | + keys[:, :, :remaining_size, :] = key[:, :, fill_size:, :] |
| 77 | + values[:, :, :remaining_size, :] = value[:, :, fill_size:, :] |
| 78 | + self.head = remaining_size |
| 79 | + self.head_offset += L |
| 80 | + self.key_values = (keys, values) |
| 81 | + if self.head_offset < self.max_seq_len: |
| 82 | + return keys[:, :, : self.head_offset, :], values[ |
| 83 | + :, :, : self.head_offset, : |
| 84 | + ] |
| 85 | + else: |
| 86 | + before_keys = keys[:, :, self.head_offset :, :] |
| 87 | + before_values = values[:, :, self.head_offset :, :] |
| 88 | + after_keys = keys[:, :, : self.head_offset, :] |
| 89 | + after_values = values[:, :, : self.head_offset, :] |
| 90 | + keys = mx.concat([after_keys, before_keys], axis=2) |
| 91 | + values = mx.concat([after_values, before_values], axis=2) |
| 92 | + return keys, values |
0 commit comments