-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathloop_cache_utils.py
More file actions
472 lines (402 loc) · 22.6 KB
/
Copy pathloop_cache_utils.py
File metadata and controls
472 lines (402 loc) · 22.6 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
import torch
from typing import Dict, List, Optional, Tuple, Any
from transformers.cache_utils import Cache
import math
class LoopCache(Cache):
"""
循环层专用的KV缓存管理类
支持两种维护机制:
1. 虚拟层映射 (m->n): 将循环层展开为固定数量的虚拟层
2. 合并策略 (m->1): 将多次循环的KV状态合并为单一缓存
"""
def __init__(self, config):
super().__init__()
self.config = config
self.loop_blocks = config.loop_layers
self.kv_cache_mode = config.kv_cache_mode
# 普通层的KV缓存
self.key_cache: List[torch.Tensor] = []
self.value_cache: List[torch.Tensor] = []
# 创建一个从层索引到其循环块信息的映射,方便快速查找
self.layer_to_block_map: Dict[int, Tuple[int, List[int]]] = {}
for block_idx, block in enumerate(self.loop_blocks):
for layer_idx in range(block[0], block[1] + 1):
self.layer_to_block_map[layer_idx] = (block_idx, block)
# 根据模式初始化循环层缓存
if self.kv_cache_mode == "virtual_layers":
self._init_virtual_layers_mode()
elif self.kv_cache_mode == "merge_strategy":
self._init_merge_strategy_mode()
else:
raise ValueError(f"不支持的KV缓存模式: {self.kv_cache_mode}")
self._seen_tokens = 0
self.current_forward_loop_step = 0 # 当前forward中的循环步数
def _init_virtual_layers_mode(self):
"""初始化虚拟层映射模式"""
self.virtual_layer_counts = self.config.virtual_layer_count
self.min_loop_counts = self.config.min_loop_count
self.virtual_attention_mode = self.config.virtual_attention_mode
# 为每个循环层创建虚拟层缓存
# 结构: {layer_idx: {virtual_idx: (key_tensor, value_tensor)}}
self.virtual_key_cache: Dict[int, Dict[int, torch.Tensor]] = {}
self.virtual_value_cache: Dict[int, Dict[int, torch.Tensor]] = {}
for start, end in self.loop_blocks:
for layer_idx in range(start, end + 1):
self.virtual_key_cache[layer_idx] = {}
self.virtual_value_cache[layer_idx] = {}
def _init_merge_strategy_mode(self):
"""初始化合并策略模式"""
self.merge_strategy = self.config.merge_strategy
self.merge_ema_alpha = self.config.merge_ema_alpha
# 循环层的合并后KV缓存
self.merged_key_cache: Dict[int, torch.Tensor] = {}
self.merged_value_cache: Dict[int, torch.Tensor] = {}
# 当前forward中的循环历史(用于合并)
self.current_forward_key_history: Dict[int, List[torch.Tensor]] = {}
self.current_forward_value_history: Dict[int, List[torch.Tensor]] = {}
for start, end in self.loop_blocks:
for layer_idx in range(start, end + 1):
self.current_forward_key_history[layer_idx] = []
self.current_forward_value_history[layer_idx] = []
def is_loop_layer(self, layer_idx: int) -> bool:
"""判断是否为循环层"""
return layer_idx in self.layer_to_block_map
def get_loop_block_info(self, layer_idx: int) -> Optional[Tuple[int, List[int]]]:
"""获取层所在的循环块信息 (block_idx, [start, end])"""
return self.layer_to_block_map.get(layer_idx)
def update(
self,
key_states: torch.Tensor, # (batch, num_heads, seq_len, head_dim)
value_states: torch.Tensor, # (batch, num_heads, seq_len, head_dim)
layer_idx: int, # 层索引
cache_kwargs: Optional[Dict[str, Any]] = None,
) -> Tuple[torch.Tensor, torch.Tensor]:
"""更新缓存"""
if layer_idx == 0:
self._seen_tokens += key_states.shape[-2]
if self.is_loop_layer(layer_idx):
if self.kv_cache_mode == "virtual_layers":
return self._update_virtual_layers_cache(key_states, value_states, layer_idx, cache_kwargs)
else: # merge_strategy
return self._update_merge_strategy_cache(key_states, value_states, layer_idx, cache_kwargs)
else:
return self._update_normal_cache(key_states, value_states, layer_idx, cache_kwargs)
def _create_empty_cache(self, key_states: torch.Tensor, value_states: torch.Tensor) -> Tuple[torch.Tensor, torch.Tensor]:
"""创建空的KV缓存"""
batch_size, num_heads, seq_len, head_dim = key_states.shape
empty_key = torch.empty(batch_size, num_heads, 0, head_dim,
dtype=key_states.dtype, device=key_states.device)
empty_value = torch.empty(batch_size, num_heads, 0, head_dim,
dtype=value_states.dtype, device=value_states.device)
return empty_key, empty_value
def _update_normal_cache(
self,
key_states: torch.Tensor,
value_states: torch.Tensor,
layer_idx: int,
cache_kwargs: Optional[Dict[str, Any]] = None,
) -> Tuple[torch.Tensor, torch.Tensor]:
"""更新普通层的缓存"""
# 确保缓存列表足够长
while len(self.key_cache) <= layer_idx:
self.key_cache.append(None)
self.value_cache.append(None)
if self.key_cache[layer_idx] is None:
self.key_cache[layer_idx] = key_states
self.value_cache[layer_idx] = value_states
else:
self.key_cache[layer_idx] = torch.cat([self.key_cache[layer_idx], key_states], dim=-2)
self.value_cache[layer_idx] = torch.cat([self.value_cache[layer_idx], value_states], dim=-2)
return self.key_cache[layer_idx], self.value_cache[layer_idx]
def _update_virtual_cache_tensor(self, cache_dict: Dict[int, torch.Tensor], new_tensor: torch.Tensor,
layer_idx: int, virtual_idx: int) -> None:
"""更新单个虚拟层缓存张量的通用方法"""
block_idx, _ = self.get_loop_block_info(layer_idx)
virtual_layer_count = self.virtual_layer_counts[block_idx]
if virtual_idx not in cache_dict[layer_idx]:
# 首次添加
cache_dict[layer_idx][virtual_idx] = new_tensor
elif self.current_forward_loop_step < virtual_layer_count:
# 第一轮循环,直接拼接
cache_dict[layer_idx][virtual_idx] = torch.cat([
cache_dict[layer_idx][virtual_idx], new_tensor
], dim=-2)
else:
# 第二轮循环及以后,替换最后一个token的KV状态
final_idx = virtual_layer_count - 1
if cache_dict[layer_idx][final_idx].shape[-2] > 0:
# 先将cache_dict[layer_idx]所有cache最后一个token向前移一个位置
for current_vitual_idx in range(0, final_idx):
current_vitual_cache = cache_dict[layer_idx][current_vitual_idx][:, :, :-1, :]
next_vitual_last_token = cache_dict[layer_idx][current_vitual_idx + 1][:, :, -1:, :]
cache_dict[layer_idx][current_vitual_idx] = torch.cat([
current_vitual_cache, next_vitual_last_token
], dim=-2)
cache_dict[layer_idx][final_idx] = torch.cat([
cache_dict[layer_idx][final_idx][:, :, :-1, :], new_tensor
], dim=-2)
else:
cache_dict[layer_idx][final_idx] = new_tensor
def _update_virtual_layers_cache(
self,
key_states: torch.Tensor,
value_states: torch.Tensor,
layer_idx: int,
cache_kwargs: Optional[Dict[str, Any]] = None,
) -> Tuple[torch.Tensor, torch.Tensor]:
"""更新虚拟层映射模式的缓存"""
# 虚拟cache循环放置
# virtual_idx = self.current_forward_loop_step % self.virtual_layer_count
# 队列方式,先进先出
virtual_idx = self.current_forward_loop_step
# 更新key和value缓存
self._update_virtual_cache_tensor(self.virtual_key_cache, key_states, layer_idx, virtual_idx)
self._update_virtual_cache_tensor(self.virtual_value_cache, value_states, layer_idx, virtual_idx)
# 根据attention模式返回相应的缓存
if self.virtual_attention_mode == "parallel":
result = self._get_concatenated_virtual_cache(layer_idx)
else: # serial
result = self._get_current_virtual_cache(layer_idx, virtual_idx)
# 处理空缓存情况
if result[0] is None:
return self._create_empty_cache(key_states, value_states)
return result
def _get_concatenated_virtual_cache(self, layer_idx: int) -> Tuple[torch.Tensor, torch.Tensor]:
"""获取指定层所有虚拟层的拼接缓存"""
key_parts = []
value_parts = []
block_idx, _ = self.get_loop_block_info(layer_idx)
virtual_layer_count = self.virtual_layer_counts[block_idx]
# 按虚拟层顺序拼接(注意:只拼接已存在的虚拟层)
for virtual_idx in range(virtual_layer_count):
if virtual_idx in self.virtual_key_cache[layer_idx]:
key_parts.append(self.virtual_key_cache[layer_idx][virtual_idx])
value_parts.append(self.virtual_value_cache[layer_idx][virtual_idx])
if not key_parts:
# 如果没有任何虚拟层缓存,返回None让调用方处理
return None, None
concatenated_key = torch.cat(key_parts, dim=-2)
concatenated_value = torch.cat(value_parts, dim=-2)
return concatenated_key, concatenated_value
def _get_current_virtual_cache(self, layer_idx: int, virtual_idx: int) -> Tuple[torch.Tensor, torch.Tensor]:
"""获取当前虚拟层的缓存(串行模式)"""
block_idx, _ = self.get_loop_block_info(layer_idx)
virtual_layer_count = self.virtual_layer_counts[block_idx]
virtual_idx = virtual_idx % virtual_layer_count
if virtual_idx in self.virtual_key_cache[layer_idx]:
current_key = self.virtual_key_cache[layer_idx][virtual_idx]
current_value = self.virtual_value_cache[layer_idx][virtual_idx]
return current_key, current_value
else:
# 如果当前虚拟层没有缓存,返回None,让调用方处理
return None, None
def _update_merge_strategy_cache(
self,
key_states: torch.Tensor,
value_states: torch.Tensor,
layer_idx: int,
cache_kwargs: Optional[Dict[str, Any]] = None,
) -> Tuple[torch.Tensor, torch.Tensor]:
"""更新合并策略模式的缓存"""
# 将当前循环步的KV状态添加到历史记录
# 注意:这里存储的是当前token在当前循环步的KV状态 List[(b, h, 1, d)]
self.current_forward_key_history[layer_idx].append(key_states.clone())
self.current_forward_value_history[layer_idx].append(value_states.clone())
# 返回历史缓存 + 当前forward的所有循环状态
if layer_idx in self.merged_key_cache:
# 有历史缓存的情况:返回 [历史缓存,当前token的当前循环状态] 的拼接
full_key = torch.cat([self.merged_key_cache[layer_idx], key_states], dim=-2)
full_value = torch.cat([self.merged_value_cache[layer_idx], value_states], dim=-2)
else:
# 没有历史缓存,只有当前token的当前循环状态
full_key = key_states
full_value = value_states
return full_key, full_value
def start_new_forward(self):
"""开始新的forward,重置当前forward的循环计数"""
self.current_forward_loop_step = 0
if self.kv_cache_mode == "merge_strategy":
# 重置当前forward的循环历史
for start, end in self.loop_blocks:
for layer_idx in range(start, end + 1):
self.current_forward_key_history[layer_idx] = []
self.current_forward_value_history[layer_idx] = []
def finish_current_forward_loops(self):
"""完成当前forward的循环,合并结果到历史缓存"""
print(f"cache usage: {self.get_memory_usage()}")
if self.kv_cache_mode == "merge_strategy":
# 使用 list() 复制键,以便在循环中安全地修改字典或其内容
for layer_idx in list(self.current_forward_key_history.keys()):
# 只有在存在循环历史时才进行合并
if self.current_forward_key_history.get(layer_idx):
merged_key, merged_value = self._merge_current_forward_history(layer_idx)
# 更新历史缓存
if layer_idx in self.merged_key_cache:
self.merged_key_cache[layer_idx] = torch.cat([
self.merged_key_cache[layer_idx], merged_key
], dim=-2)
self.merged_value_cache[layer_idx] = torch.cat([
self.merged_value_cache[layer_idx], merged_value
], dim=-2)
else:
self.merged_key_cache[layer_idx] = merged_key
self.merged_value_cache[layer_idx] = merged_value
# 合并后立即清空当前token的循环历史记录,释放内存
self.current_forward_key_history[layer_idx].clear()
self.current_forward_value_history[layer_idx].clear()
def _merge_current_forward_history(self, layer_idx: int) -> Tuple[torch.Tensor, torch.Tensor]:
"""合并当前forward的循环历史"""
key_history = self.current_forward_key_history[layer_idx]
value_history = self.current_forward_value_history[layer_idx]
if not key_history:
raise ValueError(f"层{layer_idx}没有当前forward的循环历史")
if self.merge_strategy == "last":
# 只保留最后一次循环的结果
return key_history[-1], value_history[-1]
elif self.merge_strategy == "average":
# 简单平均
merged_key = torch.stack(key_history, dim=0).mean(dim=0)
merged_value = torch.stack(value_history, dim=0).mean(dim=0)
return merged_key, merged_value
elif self.merge_strategy == "ema":
# 指数移动平均
merged_key = key_history[0]
merged_value = value_history[0]
for i in range(1, len(key_history)):
merged_key = self.merge_ema_alpha * merged_key + (1 - self.merge_ema_alpha) * key_history[i]
merged_value = self.merge_ema_alpha * merged_value + (1 - self.merge_ema_alpha) * value_history[i]
return merged_key, merged_value
else:
raise ValueError(f"不支持的合并策略: {self.merge_strategy}")
def increment_loop_step(self):
"""增加循环步数"""
self.current_forward_loop_step += 1
def get_seq_length(self, layer_idx: Optional[int] = 0) -> int:
"""
返回真实的token序列长度,用于位置编码计算
循环层的存在不应该影响token的空间位置信息
"""
# 统一返回真实的token序列长度,而不是缓存的内部长度
# 这确保了position_ids的正确性,避免干扰RoPE位置编码
return self._seen_tokens
if self.is_loop_layer(layer_idx):
if self.kv_cache_mode == "virtual_layers":
# 虚拟层模式:返回真实序列长度
# 可以通过任意一个虚拟层的长度来推断(因为都对应相同的token序列)
block_idx, _ = self.get_loop_block_info(layer_idx)
virtual_layer_count = self.virtual_layer_counts[block_idx]
for virtual_idx in range(virtual_layer_count):
if virtual_idx in self.virtual_key_cache[layer_idx]:
return self.virtual_key_cache[layer_idx][virtual_idx].shape[-2]
return 0
else: # merge_strategy
# 合并策略模式:返回真实序列长度
# 历史缓存长度 + 当前token数量(1)
length = 0
if layer_idx in self.merged_key_cache:
length += self.merged_key_cache[layer_idx].shape[-2]
# 当前forward只处理一个token,所以加1
if self.current_forward_key_history.get(layer_idx, None) is not None:
length += 1 # 当前token
return length
else:
# 普通层:直接返回缓存长度
if len(self.key_cache) <= layer_idx or self.key_cache[layer_idx] is None:
return 0
return self.key_cache[layer_idx].shape[-2]
def get_cache_length(self, layer_idx: Optional[int] = 0) -> int:
"""
返回实际的KV缓存长度,用于attention计算
这个长度可能与真实序列长度不同,因为循环层会有特殊的缓存策略
"""
if self.is_loop_layer(layer_idx):
if self.kv_cache_mode == "virtual_layers":
if self.virtual_attention_mode == "parallel":
# 并行模式:返回所有虚拟层的总长度
total_length = 0
block_idx, _ = self.get_loop_block_info(layer_idx)
virtual_layer_count = self.virtual_layer_counts[block_idx]
for virtual_idx in range(virtual_layer_count):
if virtual_idx in self.virtual_key_cache[layer_idx]:
total_length += self.virtual_key_cache[layer_idx][virtual_idx].shape[-2]
return total_length
else: # serial
# 串行模式:返回当前虚拟层的长度
current_virtual_idx = self.current_forward_loop_step % self.virtual_layer_count
if current_virtual_idx in self.virtual_key_cache[layer_idx]:
return self.virtual_key_cache[layer_idx][current_virtual_idx].shape[-2]
return 0
else: # merge_strategy
length = 0
if layer_idx in self.merged_key_cache:
length += self.merged_key_cache[layer_idx].shape[-2]
# 加上当前forward的循环历史长度
if self.current_forward_key_history.get(layer_idx, None) is not None:
length += self.current_forward_key_history[layer_idx][-1].shape[-2] # 当前token
return length
else:
if len(self.key_cache) <= layer_idx or self.key_cache[layer_idx] is None:
return 0
return self.key_cache[layer_idx].shape[-2]
def get_max_cache_shape(self) -> Optional[int]:
"""返回最大缓存容量"""
return None # 动态缓存,无固定上限
def get_memory_usage(self) -> float:
"""计算当前缓存占用的内存(MB)"""
all_bytes = 0
total_bytes = 0
# 创建或打开日志文件
with open("cache_usage_log.txt", "a") as log_file:
# 1. 计算普通层缓存
for key_tensor in self.key_cache:
if key_tensor is not None:
total_bytes += key_tensor.nelement() * key_tensor.element_size()
log_file.write(f"key_cache: {total_bytes / (1024 * 1024)} GB\n")
all_bytes += total_bytes
total_bytes = 0
for value_tensor in self.value_cache:
if value_tensor is not None:
total_bytes += value_tensor.nelement() * value_tensor.element_size()
log_file.write(f"value_cache: {total_bytes / (1024 * 1024)} GB\n")
all_bytes += total_bytes
# 2. 根据不同策略计算循环层缓存
if self.kv_cache_mode == "virtual_layers":
# 虚拟层模式
total_bytes = 0
for layer_cache in self.virtual_key_cache.values():
for key_tensor in layer_cache.values():
total_bytes += key_tensor.nelement() * key_tensor.element_size()
log_file.write(f"virtual_key_cache: {total_bytes / (1024 * 1024)} GB\n")
all_bytes += total_bytes
total_bytes = 0
for layer_cache in self.virtual_value_cache.values():
for value_tensor in layer_cache.values():
total_bytes += value_tensor.nelement() * value_tensor.element_size()
log_file.write(f"virtual_value_cache: {total_bytes / (1024 * 1024)} GB\n")
all_bytes += total_bytes
elif self.kv_cache_mode == "merge_strategy":
# 合并策略模式
total_bytes = 0
for key_tensor in self.merged_key_cache.values():
total_bytes += key_tensor.nelement() * key_tensor.element_size()
log_file.write(f"merged_key_cache: {total_bytes / (1024 * 1024)} GB\n")
all_bytes += total_bytes
total_bytes = 0
for value_tensor in self.merged_value_cache.values():
total_bytes += value_tensor.nelement() * value_tensor.element_size()
log_file.write(f"merged_value_cache: {total_bytes / (1024 * 1024)} GB\n")
all_bytes += total_bytes
total_bytes = 0
for key_history in self.current_forward_key_history.values():
for key_tensor in key_history:
total_bytes += key_tensor.nelement() * key_tensor.element_size()
log_file.write(f"current_forward_key_history: {total_bytes / (1024 * 1024)} GB\n")
all_bytes += total_bytes
total_bytes = 0
for value_history in self.current_forward_value_history.values():
for value_tensor in value_history:
total_bytes += value_tensor.nelement() * value_tensor.element_size()
log_file.write(f"current_forward_value_history: {total_bytes / (1024 * 1024)} GB\n")
all_bytes += total_bytes
log_file.write(f"总内存使用: {all_bytes / (1024 * 1024)} GB\n\n")
return all_bytes / (1024 * 1024)