bunsen 0.42.0

bunsen is a batteries included common library for burn
Documentation
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
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
//! A multi-layer key/value cache, stored as its config's policy says.

use alloc::vec::Vec;

use burn::{
    Tensor,
    config::Config,
    module::Module,
    prelude::s,
    tensor::{
        DType,
        Device,
        Int,
        TensorData,
    },
};

use crate::contracts::{
    assert_shape_contract_periodically,
    unpack_shape_contract,
};

/// Common meta trait for [`KVCache`] and [`KVCacheConfig`].
pub trait KVCacheMeta {
    /// Batch size.
    fn batch_size(&self) -> usize;

    /// Number of attention heads.
    fn num_heads(&self) -> usize;

    /// Initial target sequence length.
    fn seq_len(&self) -> usize;

    /// Dimension of each head.
    fn head_dim(&self) -> usize;

    /// Number of layers.
    fn num_layers(&self) -> usize;

    /// The positions the storage grows by when a step runs past its end.
    fn chunk_size(&self) -> usize;

    /// The most positions the cache may hold, if it is capped.
    fn max_seq_len(&self) -> Option<usize>;
}

/// A model, or its config, that decodes through a [`KVCache`], and knows the
/// cache it needs.
///
/// The model gives the cache's geometry (layers, KV heads, head width) and
/// its sizing: a default pre-size, and a cap where the model has a hard
/// positional limit. A caller asks the model for a cache rather than
/// assembling one, and overrides what it knows better on the config:
///
/// ```rust,ignore
/// let mut cache = model.new_kv_cache(batch);
/// // Or, knowing the decode's length:
/// let mut cache = model.kv_cache_config().with_batch_size(batch).with_seq_len(n).init();
/// ```
///
/// A model's config implements it too, so a cache can be sized (or its
/// memory estimated) before the model is built.
pub trait KVCacheModel {
    /// The config of a cache for this model, at batch 1: its geometry, its
    /// default pre-size, and its cap.
    fn kv_cache_config(&self) -> KVCacheConfig;

    /// A cache for `batch_size` decodes, sized as
    /// [`kv_cache_config`](Self::kv_cache_config) says.
    fn new_kv_cache(
        &self,
        batch_size: usize,
    ) -> KVCache {
        self.kv_cache_config().with_batch_size(batch_size).init()
    }
}

/// How a [`KVCache`] stores each layer's history.
///
/// A policy, not a fixed design: which storage is fastest depends on the
/// backend, on whether burn's fusion is on, and on burn's version, and will
/// change as they do. [`Auto`](Self::Auto), the default, picks the best known
/// for the device; the others pin a storage, as a benchmark does
/// (`crates/dev/kv-cache-bench`, which is how [`auto_for`](Self::auto_for)'s
/// table is kept current). Every storage behaves the same through
/// [`KVCache`]'s API.
#[derive(Clone, Copy, Debug, Default, PartialEq, Eq, serde::Serialize, serde::Deserialize)]
pub enum KVCacheStorage {
    /// The best known storage for the device the cache first writes on:
    /// [`auto_for`](Self::auto_for).
    #[default]
    Auto,

    /// Each layer's history grows by concatenation, one `Tensor::cat` per
    /// step. It copies the history every step, but a fused backend keeps the
    /// growth in its graph, where it beats an in-place write.
    Concat,

    /// Each layer's keys and values in their own preallocated buffers,
    /// written in place: the buffer is taken out of the cache to be written,
    /// so nothing else references it, and the backend can reuse it.
    PerLayer,

    /// One preallocated `[layers, 2, batch, heads, seq, head_dim]` buffer for
    /// every layer. Its writes are in place, but each layer's history is a
    /// strided view of it, which the attention after it pays to read.
    MultiLayer,
}

impl KVCacheStorage {
    /// This storage, with [`Auto`](Self::Auto) resolved for `device`.
    pub fn resolve(
        self,
        device: &Device,
    ) -> Self {
        match self {
            Self::Auto => Self::auto_for(device),
            storage => storage,
        }
    }

    /// The best known storage for `device`: a best-shot default, aware of
    /// the backend and of fusion.
    ///
    /// From `kv-cache-bench` (2026-10-23, burn 0.22: an Apple M-series on
    /// Metal and its CPU; two RTX 3090s on Vulkan and CUDA), a decode over
    /// Whisper `base` and `large-v3` geometry:
    ///
    /// | Fusion | Runtime | Storage |
    /// |---|---|---|
    /// | off | any | [`PerLayer`](Self::PerLayer): 13% to 1.9x faster than concatenation, with up to half the memory |
    /// | on | wgpu (Vulkan, Metal, WebGPU) | [`Concat`](Self::Concat): fusion makes in-place writes 24-29% slower on Vulkan |
    /// | on | CUDA | [`PerLayer`](Self::PerLayer) |
    ///
    /// Metal and WebGPU are cubecl's wgpu runtime too, so they take Vulkan's
    /// row: fused Metal's own measurements varied more between runs than the
    /// storages differed. Anything else (another runtime, the CPU) gets
    /// [`PerLayer`](Self::PerLayer), the best across everything measured.
    ///
    /// Both facts come from the device, not from bunsen's build: whether
    /// fusion is on is burn's feature, which any crate in the build may
    /// enable, so it is read, with the runtime, from the device's backend
    /// name, which spells out the stack
    /// (`dispatch<fusion<cubecl<wgpu<msl>>>>`).
    pub fn auto_for(device: &Device) -> Self {
        let stack = BackendStack::of(device);
        match (stack.fused, stack.runtime) {
            (true, Runtime::Wgpu) => Self::Concat,
            _ => Self::PerLayer,
        }
    }
}

/// What a device runs on, read from its dispatch backend's name, which
/// spells out the backend stack: `dispatch<fusion<cubecl<wgpu<msl>>>>`,
/// `dispatch<cubecl<cuda...>>`, `dispatch<flex>`.
///
/// burn has no query for whether fusion is on: it is a compile-time feature
/// of burn's, unified across the build, which bunsen's own features can't
/// see. The name is the one runtime account of it.
#[derive(Clone, Copy, Debug, PartialEq, Eq)]
struct BackendStack {
    /// burn's fusion wraps the backend.
    fused: bool,
    runtime: Runtime,
}

/// The runtime under a [`BackendStack`].
#[derive(Clone, Copy, Debug, PartialEq, Eq)]
enum Runtime {
    /// cubecl's wgpu runtime: Vulkan, Metal, WebGPU.
    Wgpu,
    /// cubecl's CUDA runtime.
    Cuda,
    /// Anything else: another cubecl runtime, the CPU.
    Other,
}

impl BackendStack {
    fn of(device: &Device) -> Self {
        use burn_backend::Backend;
        Self::parse(&burn_dispatch::Dispatch::name(device.as_dispatch()))
    }

    fn parse(name: &str) -> Self {
        let runtime = if name.contains("cubecl<wgpu") {
            Runtime::Wgpu
        } else if name.contains("cubecl<cuda") {
            Runtime::Cuda
        } else {
            Runtime::Other
        };
        Self {
            fused: name.contains("fusion<"),
            runtime,
        }
    }
}

/// Config for [`KVCache`].
///
/// Declares the cache geometry up front, and its sizing: `seq_len` positions
/// allocated on first use, grown by `chunk_size` positions as a decode runs
/// past them, up to `max_seq_len` when the cache is capped; and its
/// [`storage`](Self::storage) policy. Implements [`KVCacheMeta`]. A model
/// hands out its own, through [`KVCacheModel`].
#[derive(Config, Debug)]
pub struct KVCacheConfig {
    /// Configured batch size.
    pub batch_size: usize,

    /// Number of attention heads.
    pub num_heads: usize,

    /// Initial target sequence length.
    pub seq_len: usize,

    /// Dimension of each head.
    pub head_dim: usize,

    /// Number of layers.
    pub num_layers: usize,

    /// The positions the storage grows by when a step runs past its end.
    #[config(default = "1024")]
    pub chunk_size: usize,

    /// The most positions the cache may hold; uncapped when `None`.
    ///
    /// Growth stops at the cap, and a step past it panics: for a model with
    /// a hard positional limit, running past it is a bug, not a reason to
    /// reallocate.
    #[config(default = "None")]
    pub max_seq_len: Option<usize>,

    /// How the cache stores its history; [`KVCacheStorage::Auto`], the
    /// best-known storage for the device, by default.
    #[config(default = "KVCacheStorage::Auto")]
    pub storage: KVCacheStorage,

    /// Each layer's sliding attention window, if it has one: a query sees
    /// itself and the `window - 1` positions before it, so the cache keeps
    /// only that layer's last `window - 1` positions between steps (in a
    /// history of its own, whatever the storage). Empty, no layer has one.
    #[config(default = "Vec::new()")]
    pub layer_windows: Vec<Option<usize>>,
}

impl KVCacheConfig {
    /// The config of one decode's cache: batch 1, `num_heads` key/value
    /// heads of `head_dim`, `seq_len` positions up front, over `num_layers`
    /// layers. What a model's [`KVCacheModel::kv_cache_config`] starts from.
    pub fn for_decode(
        num_heads: usize,
        seq_len: usize,
        head_dim: usize,
        num_layers: usize,
    ) -> Self {
        Self::new(1, num_heads, seq_len, head_dim, num_layers)
    }

    /// Sets the `batch_size`.
    pub fn with_batch_size(
        self,
        batch_size: usize,
    ) -> Self {
        Self { batch_size, ..self }
    }

    /// Sets the `seq_len`, the positions allocated up front.
    pub fn with_seq_len(
        self,
        seq_len: usize,
    ) -> Self {
        Self { seq_len, ..self }
    }
}

impl KVCacheMeta for KVCacheConfig {
    fn batch_size(&self) -> usize {
        self.batch_size
    }

    fn num_heads(&self) -> usize {
        self.num_heads
    }

    fn seq_len(&self) -> usize {
        self.seq_len
    }

    fn head_dim(&self) -> usize {
        self.head_dim
    }

    fn num_layers(&self) -> usize {
        self.num_layers
    }

    fn chunk_size(&self) -> usize {
        self.chunk_size
    }

    fn max_seq_len(&self) -> Option<usize> {
        self.max_seq_len
    }
}

impl KVCacheConfig {
    /// Initializes a [`KVCache`].
    ///
    /// # Panics
    /// When `chunk_size` is 0, or `seq_len` exceeds `max_seq_len`.
    pub fn init(self) -> KVCache {
        assert!(
            self.chunk_size > 0,
            "a KV cache's chunk_size must be positive"
        );
        if let Some(max) = self.max_seq_len {
            assert!(
                self.seq_len <= max,
                "a KV cache's seq_len ({}) exceeds its max_seq_len ({max})",
                self.seq_len
            );
        }
        assert!(
            self.layer_windows.is_empty() || self.layer_windows.len() == self.num_layers,
            "a KV cache's layer_windows has {} entries for {} layers",
            self.layer_windows.len(),
            self.num_layers
        );
        assert!(
            self.layer_windows.iter().flatten().all(|&w| w > 0),
            "a KV cache layer's window must be positive"
        );
        let layer_windows = if self.layer_windows.is_empty() {
            vec![None; self.num_layers]
        } else {
            self.layer_windows
        };
        KVCache {
            batch_size: self.batch_size,
            num_heads: self.num_heads,
            seq_len: self.seq_len,
            head_dim: self.head_dim,
            num_layers: self.num_layers,
            pos: 0,
            cache: None,
            chunk_size: self.chunk_size,
            extra_chunks: 1,
            max_seq_len: self.max_seq_len,
            storage: self.storage,
            resolved: None,
            keys: vec![None; self.num_layers],
            values: vec![None; self.num_layers],
            cross_keys: vec![None; self.num_layers],
            cross_values: vec![None; self.num_layers],
            group: 1,
            window_start: vec![0; self.num_layers],
            layer_windows,
        }
    }
}

/// A multi-layer key/value cache for autoregressive decoding.
///
/// Each layer writes its step with [`insert_kv`](KVCache::insert_kv), which
/// returns that layer's whole `(k, v)` history. The shared position
/// ([`pos`](KVCache::pos)) advances once the last layer has written, so one
/// cache serves a whole stack of layers. [`reset`](KVCache::reset) rewinds the
/// position without freeing the storage, and [`prefill`](KVCache::prefill)
/// seeds an empty cache from another one, broadcasting a batch of 1.
/// [`reorder`](KVCache::reorder) picks the history's batch rows, as a beam
/// search does when it branches.
///
/// An encoder-decoder also keeps each layer's cross-attention keys and values
/// here: projected once from the encoder output, set by
/// [`set_cross_kv`](KVCache::set_cross_kv), and never grown. They may be
/// shared by a [`group`](KVCache::group) of decode rows per encoder row (a
/// beam search's beams, `row = encoder_row * group + member`), so the bulk of
/// the cache isn't repeated per beam. `reset` and `reorder` leave them alone.
///
/// How it stores the history is its config's [`KVCacheStorage`] policy,
/// resolved on the first write, on the device of the first keys
/// ([`storage`](KVCache::storage) reports it). The preallocated storages
/// allocate `seq_len` positions, and grow in chunks (`chunk_size` positions,
/// 1024 by default) when a step runs past their end, up to `max_seq_len`
/// when the cache is capped.
///
/// The cache is injected state: the caller builds one per decode and passes
/// it to the model's forward, so one model can run several decodes at once.
/// It is a `Module` over bare tensors, not parameters.
/// [`CausalSelfAttention`] and the `MultiHeadAttention` functions
/// ([`self_attn_w_kv_cache`](super::self_attn_w_kv_cache),
/// [`cross_attn_w_kv_cache`](super::cross_attn_w_kv_cache))
/// are its consumers.
///
/// Built by [`KVCacheConfig`], whose `init` takes no device; a model hands
/// out its own through [`KVCacheModel`].
///
/// [`CausalSelfAttention`]: crate::blocks::transformers::attention::csa::CausalSelfAttention
#[derive(Module, Debug)]
pub struct KVCache {
    batch_size: usize,
    num_heads: usize,
    seq_len: usize,
    head_dim: usize,
    num_layers: usize,

    chunk_size: usize,
    extra_chunks: usize,
    max_seq_len: Option<usize>,

    /// The configured policy.
    #[module(skip)]
    storage: KVCacheStorage,
    /// The storage in use, once the first write resolved it.
    #[module(skip)]
    resolved: Option<KVCacheStorage>,

    pos: usize,
    /// [`KVCacheStorage::MultiLayer`]'s buffer.
    cache: Option<Tensor<6>>,
    /// [`KVCacheStorage::PerLayer`]'s buffers, or
    /// [`KVCacheStorage::Concat`]'s histories, one per layer.
    keys: Vec<Option<Tensor<4>>>,
    /// As `keys`, for the values.
    values: Vec<Option<Tensor<4>>>,

    /// Each layer's cross-attention keys, set once by
    /// [`set_cross_kv`](KVCache::set_cross_kv) and never grown:
    /// `[batch / group, heads, cross_len, head_dim]`.
    cross_keys: Vec<Option<Tensor<4>>>,
    /// As `cross_keys`, for the values.
    cross_values: Vec<Option<Tensor<4>>>,
    /// Decode rows per cross-attention row.
    group: usize,

    /// Each layer's sliding window, if any.
    #[module(skip)]
    layer_windows: Vec<Option<usize>>,
    /// Each windowed layer's first retained position.
    window_start: Vec<usize>,
}

impl KVCacheMeta for KVCache {
    fn batch_size(&self) -> usize {
        self.batch_size
    }

    fn num_heads(&self) -> usize {
        self.num_heads
    }

    fn seq_len(&self) -> usize {
        self.seq_len
    }

    fn head_dim(&self) -> usize {
        self.head_dim
    }

    fn num_layers(&self) -> usize {
        self.num_layers
    }

    fn chunk_size(&self) -> usize {
        self.chunk_size
    }

    fn max_seq_len(&self) -> Option<usize> {
        self.max_seq_len
    }
}

impl KVCache {
    /// Resets the current position.
    ///
    /// Does not drop/re-allocate the cache, and keeps the cross-attention
    /// keys and values, so a second sequence decodes against the same encoder
    /// output without projecting it again.
    pub fn reset(&mut self) {
        self.pos = 0;
        self.window_start.fill(0);
    }

    /// Rewinds to position `pos`: the history keeps its first `pos`
    /// positions, and the next step writes at `pos`, as though nothing past
    /// it had been written. A decode that changes its mind about a suffix
    /// (a conversation whose next turn re-renders the end of the last one)
    /// keeps the prefix it shares instead of running it again.
    ///
    /// [`reset`](Self::reset) is `truncate(0)`. As there, nothing is
    /// reallocated, and the cross-attention keys and values are kept.
    ///
    /// A layer with a sliding window keeps only its window's last positions,
    /// so the cache can rewind no further back than
    /// [`retained_from`](Self::retained_from)
    /// ([`can_truncate`](Self::can_truncate)); a decode that must go further
    /// resets and runs its prefix again.
    ///
    /// # Panics
    /// If `pos` is past the current position, or before what a windowed
    /// layer retains.
    pub fn truncate(
        &mut self,
        pos: usize,
    ) {
        assert!(
            pos <= self.pos,
            "cannot truncate a KV cache at {} to {pos}",
            self.pos
        );
        assert!(
            pos == 0 || pos >= self.retained_from(),
            "cannot truncate a KV cache to {pos}: a sliding window keeps positions from {} on",
            self.retained_from()
        );
        if pos == 0 {
            self.window_start.fill(0);
        }
        self.pos = pos;
    }

    /// The earliest position every layer still holds: 0, but for a layer
    /// with a sliding window, which drops what its window has passed.
    pub fn retained_from(&self) -> usize {
        self.window_start.iter().copied().max().unwrap_or(0)
    }

    /// Whether [`truncate`](Self::truncate) can rewind to `pos`: at or
    /// before the current position, and either 0 (a reset) or no earlier
    /// than [`retained_from`](Self::retained_from).
    pub fn can_truncate(
        &self,
        pos: usize,
    ) -> bool {
        pos <= self.pos && (pos == 0 || pos >= self.retained_from())
    }

    /// Each layer's sliding window, if it has one.
    pub fn layer_windows(&self) -> &[Option<usize>] {
        &self.layer_windows
    }

    /// Returns the current position.
    pub fn pos(&self) -> usize {
        self.pos
    }

    /// The storage in use: the configured policy, with
    /// [`Auto`](KVCacheStorage::Auto) resolved once the first write has
    /// told it the device.
    pub fn storage(&self) -> KVCacheStorage {
        self.resolved.unwrap_or(self.storage)
    }

    /// Decode rows per cross-attention row: one, unless the cross-attention
    /// keys and values are shared by a group (as a beam search's beams share
    /// their audio's).
    pub fn group(&self) -> usize {
        self.group
    }

    /// Sets `layer`'s cross-attention keys and values, projected once from
    /// the encoder output: `[batch / group, heads, cross_len, head_dim]`,
    /// where `group` is how many decode rows share each encoder row. Every
    /// layer's must agree on it.
    ///
    /// # Panics
    /// When the heads or head width aren't the cache's, `k` and `v` differ in
    /// shape, the cache's batch isn't a whole multiple of `k`'s, or another
    /// layer was set with a different group.
    pub fn set_cross_kv(
        &mut self,
        layer: usize,
        k: Tensor<4>,
        v: Tensor<4>,
    ) {
        let [rows, heads, _, head_dim] = k.dims();
        assert_eq!(
            k.dims(),
            v.dims(),
            "cross-attention keys and values differ in shape"
        );
        assert_eq!(
            (heads, head_dim),
            (self.num_heads, self.head_dim),
            "cross-attention heads and head width are the cache's"
        );
        assert!(
            rows > 0 && self.batch_size.is_multiple_of(rows),
            "the cache's batch ({}) is not a whole multiple of the cross-attention rows ({rows})",
            self.batch_size
        );
        let group = self.batch_size / rows;
        let others_set = self
            .cross_keys
            .iter()
            .enumerate()
            .any(|(l, c)| l != layer && c.is_some());
        if others_set {
            assert_eq!(
                group, self.group,
                "every layer's cross-attention shares one group"
            );
        }
        self.group = group;
        self.cross_keys[layer] = Some(k);
        self.cross_values[layer] = Some(v);
    }

    /// `layer`'s cross-attention keys and values, if set:
    /// `[batch / group, heads, cross_len, head_dim]`.
    pub fn cross_kv(
        &self,
        layer: usize,
    ) -> Option<(Tensor<4>, Tensor<4>)> {
        Some((
            self.cross_keys[layer].clone()?,
            self.cross_values[layer].clone()?,
        ))
    }

    /// The dtype the cache holds, once anything is in it.
    pub fn dtype(&self) -> Option<DType> {
        let tensor = self
            .cross_keys
            .iter()
            .chain(&self.keys)
            .flatten()
            .next()
            .map(Tensor::dtype);
        tensor.or_else(|| self.cache.as_ref().map(Tensor::dtype))
    }

    /// Picks the history's batch rows: row `r` becomes what row `sources[r]`
    /// was. A source may appear more than once, which duplicates its row;
    /// that is how a beam search branches.
    ///
    /// The cross-attention keys and values are left alone: they are shared
    /// within a group, so reordering within one is a no-op, and a reorder
    /// across groups is the caller's error.
    ///
    /// # Panics
    /// If `sources` is not one entry per batch row, or names a row past it.
    pub fn reorder(
        &mut self,
        sources: &[usize],
    ) {
        assert_eq!(
            sources.len(),
            self.batch_size,
            "one source row per batch row"
        );
        assert!(
            sources.iter().all(|&s| s < self.batch_size),
            "a source row past the batch"
        );
        if !self.is_allocated() || sources.iter().enumerate().all(|(r, &s)| r == s) {
            return;
        }
        let device = match (&self.cache, self.keys.iter().flatten().next()) {
            (Some(cache), _) => cache.device(),
            (None, Some(key)) => key.device(),
            (None, None) => return,
        };
        let indices: Tensor<1, Int> = Tensor::from_data(
            TensorData::new(
                sources.iter().map(|&s| s as i64).collect::<Vec<_>>(),
                [sources.len()],
            ),
            &device,
        );
        if let Some(cache) = self.cache.take() {
            self.cache = Some(cache.select(2, indices.clone()));
        }
        for slot in self.keys.iter_mut().chain(self.values.iter_mut()) {
            if let Some(history) = slot.take() {
                *slot = Some(history.select(0, indices.clone()));
            }
        }
    }

    /// Whether any storage is allocated.
    fn is_allocated(&self) -> bool {
        self.cache.is_some() || self.keys.iter().any(Option::is_some)
    }

    /// Prefill given another `KVCache`.
    ///
    /// Copies the other cache's history (its first [`pos`](Self::pos)
    /// positions, whatever the length of its storage) into this one's own
    /// storage, and takes its position. A preallocated storage holds this
    /// cache's `seq_len`, grown in chunks if the history is longer. The two
    /// caches' storages need not match.
    ///
    /// - This cache must be empty.
    /// - The other cache must not be.
    /// - The `num_layers`, `num_heads`, and `head_dim` must match.
    /// - The `batch_size` must match, or `other.batch_size` must be 1.
    pub fn prefill(
        &mut self,
        other: &KVCache,
    ) {
        assert!(!self.is_allocated(), "Cannot prefill a non-empty KV cache.");
        assert!(other.is_allocated(), "Cannot prefill from a None KV cache.");

        assert_eq!(self.num_layers, other.num_layers);
        assert_eq!(self.num_heads, other.num_heads);
        assert_eq!(self.head_dim, other.head_dim);

        if self.batch_size != other.batch_size && other.batch_size != 1 {
            panic!(
                "Incompatible pre-fill batch size: {} vs {}",
                self.batch_size, other.batch_size
            );
        }
        assert!(self.seq_len >= other.seq_len);

        assert_eq!(
            self.layer_windows, other.layer_windows,
            "a KV cache prefills from one with the same windows"
        );
        if other.pos > 0 {
            for layer in 0..self.num_layers {
                let (k, v) = other.history(layer);
                let start = other.window_start[layer];
                let shape = [
                    self.batch_size,
                    self.num_heads,
                    other.pos - start,
                    self.head_dim,
                ];
                self.window_start[layer] = start;
                self.write(layer, start, k.expand(shape), v.expand(shape));
            }
        }
        self.pos = other.pos;
    }

    /// `layer`'s `(k, v)` history, its first [`pos`](Self::pos) positions.
    fn history(
        &self,
        layer: usize,
    ) -> (Tensor<4>, Tensor<4>) {
        let t = self.pos;
        if self.layer_windows[layer].is_some() {
            let held = t - self.window_start[layer];
            let retained = |slot: &Option<Tensor<4>>| {
                slot.clone()
                    .expect("an allocated cache holds every layer")
                    .slice(s![.., .., ..held])
            };
            return (retained(&self.keys[layer]), retained(&self.values[layer]));
        }
        match &self.cache {
            Some(cache) => (
                cache
                    .clone()
                    .slice(s![layer, 0, .., .., ..t])
                    .squeeze_dims::<4>(&[0, 1]),
                cache
                    .clone()
                    .slice(s![layer, 1, .., .., ..t])
                    .squeeze_dims::<4>(&[0, 1]),
            ),
            None => {
                let held = |slot: &Option<Tensor<4>>| {
                    slot.clone()
                        .expect("an allocated cache holds every layer")
                        .slice(s![.., .., ..t])
                };
                (held(&self.keys[layer]), held(&self.values[layer]))
            }
        }
    }

    /// Inserts and extends a `(k, v)` pair.
    ///
    /// # Arguments
    /// - `layer_idx`: the block layer index.
    /// - `k`: the `[B, H_kv, T, D]` key tensor.
    /// - `v`: the `[B, H_kv, T, D]` value tensor.
    ///
    /// # Returns
    /// - the extended (k, v) `[B, H_kv, T, D]` pair.
    ///
    /// # Panics
    /// When the step would take the cache past its `max_seq_len`.
    pub fn insert_kv(
        &mut self,
        layer_idx: usize,
        k: Tensor<4>,
        v: Tensor<4>,
    ) -> (Tensor<4>, Tensor<4>) {
        let [t_add] = unpack_shape_contract!(
            ["B", "H_kv", "T_add", "D"],
            &k.dims(),
            &["T_add"],
            &[
                ("B", self.batch_size),
                ("H_kv", self.num_heads),
                ("D", self.head_dim)
            ]
        );
        assert_shape_contract_periodically!(
            ["B", "H_kv", "T_add", "D"],
            &v.dims(),
            &[
                ("B", self.batch_size),
                ("H_kv", self.num_heads),
                ("T_add", t_add),
                ("D", self.head_dim)
            ]
        );

        let t0 = self.pos;
        let t1 = t0 + t_add;
        if let Some(max) = self.max_seq_len {
            assert!(
                t1 <= max,
                "a KV cache step past its max_seq_len: {t0} + {t_add} > {max}"
            );
        }

        let history = self.write(layer_idx, t0, k, v);

        // Increment pos after the last layer.
        if layer_idx == self.num_layers - 1 {
            // TODO: consider reifying this as a public API, rather than layer
            // magic.
            self.pos = t1;
        }

        history
    }

    /// Writes `(k, v)` at `layer`'s positions `t0..`, in this cache's
    /// storage, and returns the layer's history through them. A write at
    /// `t0` drops anything the layer held past `t0` (after a
    /// [`reset`](Self::reset)).
    fn write(
        &mut self,
        layer: usize,
        t0: usize,
        k: Tensor<4>,
        v: Tensor<4>,
    ) -> (Tensor<4>, Tensor<4>) {
        if let Some(window) = self.layer_windows[layer] {
            return self.write_window(layer, window, t0, k, v);
        }
        let t1 = t0 + k.dims()[2];
        let configured = self.storage;
        let storage = *self
            .resolved
            .get_or_insert_with(|| configured.resolve(&k.device()));
        match storage {
            KVCacheStorage::MultiLayer => self.write_multi_layer(layer, t0, t1, k, v),
            KVCacheStorage::PerLayer => {
                let key = self.keys[layer].take();
                let value = self.values[layer].take();
                let (key, k) = self.write_buffer(key, t0, t1, k);
                let (value, v) = self.write_buffer(value, t0, t1, v);
                self.keys[layer] = Some(key);
                self.values[layer] = Some(value);
                (k, v)
            }
            KVCacheStorage::Concat => {
                let k = Self::concat(self.keys[layer].take(), t0, k);
                let v = Self::concat(self.values[layer].take(), t0, v);
                self.keys[layer] = Some(k.clone());
                self.values[layer] = Some(v.clone());
                (k, v)
            }
            KVCacheStorage::Auto => unreachable!("resolved above"),
        }
    }

    /// A windowed layer's write: its retained history (from its
    /// `window_start`, cut back to `t0`) with `(k, v)` appended, which the
    /// step attends over; then only the last `window - 1` positions kept.
    fn write_window(
        &mut self,
        layer: usize,
        window: usize,
        t0: usize,
        k: Tensor<4>,
        v: Tensor<4>,
    ) -> (Tensor<4>, Tensor<4>) {
        let start = self.window_start[layer];
        assert!(
            t0 >= start,
            "a KV cache layer's window starts at {start}, past a write at {t0}"
        );
        let held = t0 - start;
        let k = Self::concat(self.keys[layer].take(), held, k);
        let v = Self::concat(self.values[layer].take(), held, v);
        let len = k.dims()[2];
        let keep = len.min(window - 1);
        self.window_start[layer] = start + (len - keep);
        let tail = |x: &Tensor<4>| x.clone().slice(s![.., .., len - keep..]);
        self.keys[layer] = Some(tail(&k));
        self.values[layer] = Some(tail(&v));
        (k, v)
    }

    /// [`KVCacheStorage::PerLayer`]'s write: `x` into `buffer` (allocated,
    /// or grown, to hold `t1` positions) at `t0..t1`; the buffer, and its
    /// history through `t1`.
    ///
    /// The buffer is owned here, taken out of the cache, so the write sees
    /// no other reference to it and the backend can write it in place.
    fn write_buffer(
        &self,
        buffer: Option<Tensor<4>>,
        t0: usize,
        t1: usize,
        x: Tensor<4>,
    ) -> (Tensor<4>, Tensor<4>) {
        let [batch, heads, _, head_dim] = x.dims();
        let allocate = |len: usize| {
            Tensor::<4>::empty([batch, heads, len, head_dim], &x.device()).cast(x.dtype())
        };
        let buffer = match buffer {
            None if t1 <= self.seq_len => allocate(self.seq_len),
            None => allocate(self.allocation_size(t1)),
            Some(buffer) if buffer.dims()[2] >= t1 => buffer,
            Some(buffer) => {
                let held = buffer.dims()[2];
                allocate(self.allocation_size(t1)).slice_assign(s![.., .., ..held], buffer)
            }
        };
        let buffer = buffer.slice_assign(s![.., .., t0..t1], x);
        let history = buffer.clone().slice(s![.., .., ..t1]);
        (buffer, history)
    }

    /// [`KVCacheStorage::Concat`]'s write: `history`, cut back to `t0`, with
    /// `x` appended.
    fn concat(
        history: Option<Tensor<4>>,
        t0: usize,
        x: Tensor<4>,
    ) -> Tensor<4> {
        match history {
            Some(history) if t0 > 0 => {
                let history = if history.dims()[2] > t0 {
                    history.slice(s![.., .., ..t0])
                } else {
                    history
                };
                Tensor::cat(vec![history, x], 2)
            }
            None if t0 > 0 => panic!("a KV cache layer has no history to extend at {t0}"),
            _ => x,
        }
    }

    /// [`KVCacheStorage::MultiLayer`]'s write.
    fn write_multi_layer(
        &mut self,
        layer: usize,
        t0: usize,
        t1: usize,
        k: Tensor<4>,
        v: Tensor<4>,
    ) -> (Tensor<4>, Tensor<4>) {
        let dtype = k.dtype();
        let device = k.device();

        // Release or allocate the cache.
        let mut cache = match self.cache.take() {
            Some(cache) => cache,
            None if t1 <= self.seq_len => self.allocate(self.seq_len, dtype, &device),
            None => self.allocate(self.allocation_size(t1), dtype, &device),
        };

        // Grow the cache if needed.
        let cached_size = cache.dims()[4];
        if t1 > cached_size {
            let needed_t = self.allocation_size(t1);

            cache = self
                .allocate(needed_t, dtype, &device)
                .slice_assign(s![.., .., .., .., ..cached_size, ..], cache);
        }

        // Insert k, v into the cache.
        cache = cache
            .slice_assign(s![layer, 0, .., .., t0..t1], k.unsqueeze())
            .slice_assign(s![layer, 1, .., .., t0..t1], v.unsqueeze());

        // Get a full key/value slice view up to the current position.
        let k = cache
            .clone()
            .slice(s![layer, 0, .., .., ..t1])
            .squeeze_dims::<4>(&[0, 1]);
        let v = cache
            .clone()
            .slice(s![layer, 1, .., .., ..t1])
            .squeeze_dims::<4>(&[0, 1]);

        // Reattach the cache.
        self.cache = Some(cache);
        (k, v)
    }

    fn allocate(
        &self,
        seq_len: usize,
        dtype: DType,
        device: &Device,
    ) -> Tensor<6> {
        Tensor::<6>::empty(
            [
                self.num_layers,
                2,
                self.batch_size,
                self.num_heads,
                seq_len,
                self.head_dim,
            ],
            device,
        )
        .cast(dtype)
    }

    /// Computes the target allocation size for a given required size: whole
    /// chunks, with spare ones, but never past `max_seq_len`.
    pub fn allocation_size(
        &self,
        required_size: usize,
    ) -> usize {
        let size = (required_size.div_ceil(self.chunk_size) + self.extra_chunks) * self.chunk_size;
        match self.max_seq_len {
            Some(max) => size.min(max).max(required_size),
            None => size,
        }
    }

    /// The positions the storage holds (allocated, or concatenated); `None`
    /// before the first write.
    #[cfg(test)]
    fn held_len(&self) -> Option<usize> {
        match &self.cache {
            Some(cache) => Some(cache.dims()[4]),
            None => self.keys[0].as_ref().map(|k| k.dims()[2]),
        }
    }
}

#[cfg(test)]
mod tests {
    use burn::tensor::Distribution;
    use serial_test::serial;

    use super::*;
    use crate::support::testing::{
        DeviceMemoryGuard,
        cpu_device,
        performance_device,
        seeded_tensor,
    };

    /// The storages a cache can be pinned to.
    const STORAGES: [KVCacheStorage; 3] = [
        KVCacheStorage::Concat,
        KVCacheStorage::PerLayer,
        KVCacheStorage::MultiLayer,
    ];

    /// Writes `t_add` seeded positions to every layer of `cache`, and returns
    /// each layer's `(k, v)` step.
    fn fill(
        cache: &mut KVCache,
        t_add: usize,
        device: &Device,
    ) -> Vec<(Tensor<4>, Tensor<4>)> {
        let shape = [
            cache.batch_size(),
            cache.num_heads(),
            t_add,
            cache.head_dim(),
        ];
        (0..cache.num_layers())
            .map(|layer| {
                let seed = 2 * layer as u64;
                let k = seeded_tensor::<4>(seed, shape, Distribution::Default, device);
                let v = seeded_tensor::<4>(seed + 1, shape, Distribution::Default, device);
                cache.insert_kv(layer, k.clone(), v.clone());
                (k, v)
            })
            .collect()
    }

    /// Prefills a batch-3 cache from a batch-1 source holding `filled`
    /// positions, for every pair of storages, and checks that every layer
    /// reads the source's history back, broadcast over the batch.
    fn check_prefill(
        source_seq_len: usize,
        filled: usize,
    ) {
        for from in STORAGES {
            for to in STORAGES {
                check_prefill_between(source_seq_len, filled, from, to);
            }
        }
    }

    fn check_prefill_between(
        source_seq_len: usize,
        filled: usize,
        from: KVCacheStorage,
        to: KVCacheStorage,
    ) {
        let device = performance_device();
        let _memory = DeviceMemoryGuard::new(&device);

        let [num_heads, head_dim, num_layers] = [2, 4, 2];
        let mut source: KVCache =
            KVCacheConfig::new(1, num_heads, source_seq_len, head_dim, num_layers)
                .with_storage(from)
                .init();
        let steps = fill(&mut source, filled, &device);
        assert_eq!(source.pos(), filled);

        let batch = 3;
        let mut cache: KVCache =
            KVCacheConfig::new(batch, num_heads, source_seq_len, head_dim, num_layers)
                .with_storage(to)
                .init();
        cache.prefill(&source);
        assert_eq!(cache.storage(), to, "{from:?} into {to:?}");
        assert_eq!(cache.pos(), filled);

        // One more position on every layer returns the prefilled history.
        let step = [batch, num_heads, 1, head_dim];
        let history = [batch, num_heads, filled, head_dim];
        for (layer, (k, v)) in steps.into_iter().enumerate() {
            let (k_all, v_all) = cache.insert_kv(
                layer,
                Tensor::zeros(step, &device),
                Tensor::zeros(step, &device),
            );
            assert_eq!(k_all.dims(), [batch, num_heads, filled + 1, head_dim]);
            k_all
                .slice(s![.., .., ..filled])
                .into_data()
                .assert_eq(&k.expand(history).into_data(), true);
            v_all
                .slice(s![.., .., ..filled])
                .into_data()
                .assert_eq(&v.expand(history).into_data(), true);
        }
    }

    /// Under every storage, through growth: 6 positions written, truncated
    /// to 2, then 3 more written, read back as the first 2 and the 3, the
    /// 4 positions dropped gone.
    #[test]
    #[serial]
    fn test_truncate() {
        let device = performance_device();
        let _memory = DeviceMemoryGuard::new(&device);
        let [batch, num_heads, head_dim, num_layers] = [2, 2, 4, 2];
        for storage in STORAGES {
            let mut cache = KVCacheConfig::new(batch, num_heads, 4, head_dim, num_layers)
                .with_chunk_size(2)
                .with_storage(storage)
                .init();
            let first = fill(&mut cache, 6, &device);
            cache.truncate(2);
            assert_eq!(cache.pos(), 2, "{storage:?}");

            let step = [batch, num_heads, 3, head_dim];
            for (layer, (k, v)) in first.into_iter().enumerate() {
                let k_new = Tensor::<4>::ones(step, &device) * (layer as f32 + 7.0);
                let v_new = Tensor::<4>::ones(step, &device) * (layer as f32 + 9.0);
                let (k_all, v_all) = cache.insert_kv(layer, k_new.clone(), v_new.clone());
                let expected_k = Tensor::cat(vec![k.slice(s![.., .., ..2]), k_new], 2);
                let expected_v = Tensor::cat(vec![v.slice(s![.., .., ..2]), v_new], 2);
                k_all.into_data().assert_eq(&expected_k.into_data(), true);
                v_all.into_data().assert_eq(&expected_v.into_data(), true);
            }
            assert_eq!(cache.pos(), 5, "{storage:?}");
        }
    }

    /// A windowed layer returns its retained window with the step, and keeps
    /// only its last `window - 1` positions, under every storage; a layer
    /// without a window keeps everything.
    #[test]
    fn test_window_retention() {
        let device = cpu_device();
        let [batch, heads, head_dim] = [1, 1, 2];
        for storage in STORAGES {
            let mut cache = KVCacheConfig::new(batch, heads, 4, head_dim, 2)
                .with_storage(storage)
                .with_layer_windows(vec![Some(3), None])
                .init();
            let step = |cache: &mut KVCache, at: usize, n: usize| {
                let x = |layer: usize| {
                    Tensor::<1, Int>::arange(at as i64..(at + n) as i64, &device)
                        .float()
                        .add_scalar(100.0 * layer as f32)
                        .reshape([1, 1, n, 1])
                        .repeat_dim(3, head_dim)
                };
                let out: Vec<Vec<f32>> = (0..2)
                    .map(|layer| {
                        let (k, _) = cache.insert_kv(layer, x(layer), x(layer));
                        k.slice(s![.., .., .., 0..1])
                            .into_data()
                            .convert::<f32>()
                            .try_into_vec::<f32>()
                            .unwrap()
                    })
                    .collect();
                out
            };
            let out = step(&mut cache, 0, 4);
            assert_eq!(out[0], [0.0, 1.0, 2.0, 3.0], "{storage:?}");
            assert_eq!(cache.retained_from(), 2, "{storage:?}: keeps 2, 3");
            let out = step(&mut cache, 4, 1);
            assert_eq!(out[0], [2.0, 3.0, 4.0], "{storage:?}: the window");
            assert_eq!(out[1], [100.0, 101.0, 102.0, 103.0, 104.0], "{storage:?}");
            assert_eq!(cache.retained_from(), 3, "{storage:?}");
            let out = step(&mut cache, 5, 2);
            assert_eq!(out[0], [3.0, 4.0, 5.0, 6.0], "{storage:?}");
            assert_eq!(cache.retained_from(), 5, "{storage:?}");
        }
    }

    /// A windowed cache rewinds within what it retains, or to 0, and refuses
    /// anything between; a reorder and a prefill carry the windows along.
    #[test]
    fn test_window_truncate_reorder_prefill() {
        let device = cpu_device();
        let config = KVCacheConfig::new(2, 1, 4, 2, 1).with_layer_windows(vec![Some(3)]);
        let mut cache = config.clone().init();
        let rows = |values: [f32; 2], n: usize| {
            Tensor::<1>::from_floats(values, &device)
                .reshape([2, 1, 1, 1])
                .repeat_dim(2, n)
                .repeat_dim(3, 2)
        };
        cache.insert_kv(0, rows([1.0, 2.0], 5), rows([1.0, 2.0], 5));
        assert_eq!((cache.pos(), cache.retained_from()), (5, 3));
        assert!(cache.can_truncate(4) && cache.can_truncate(3) && cache.can_truncate(0));
        assert!(!cache.can_truncate(2) && !cache.can_truncate(6));

        cache.reorder(&[1, 1]);
        let mut copy = config.clone().with_batch_size(2).init();
        copy.prefill(&cache);
        assert_eq!((copy.pos(), copy.retained_from()), (5, 3));
        let (k, _) = copy.insert_kv(0, rows([7.0, 7.0], 1), rows([7.0, 7.0], 1));
        let firsts: Vec<f32> = k
            .slice(s![.., .., .., 0..1])
            .into_data()
            .convert::<f32>()
            .try_into_vec::<f32>()
            .unwrap();
        assert_eq!(firsts, [2.0, 2.0, 7.0, 2.0, 2.0, 7.0], "row 1 in both");

        cache.truncate(4);
        assert_eq!(cache.pos(), 4);
        cache.truncate(0);
        assert_eq!((cache.pos(), cache.retained_from()), (0, 0));
    }

    #[test]
    #[should_panic(expected = "a sliding window keeps positions from 3")]
    fn test_window_truncate_past_the_window_panics() {
        let device = cpu_device();
        let mut cache = KVCacheConfig::new(1, 1, 4, 2, 1)
            .with_layer_windows(vec![Some(3)])
            .init();
        let x = Tensor::<4>::zeros([1, 1, 5, 2], &device);
        cache.insert_kv(0, x.clone(), x);
        cache.truncate(2);
    }

    #[test]
    #[should_panic(expected = "cannot truncate")]
    fn test_truncate_past_the_position_panics() {
        let mut cache = KVCacheConfig::new(1, 1, 4, 2, 1).init();
        cache.truncate(1);
    }

    /// The source's storage is longer than its position: 3 of 8 filled.
    #[test]
    #[serial]
    fn test_prefill_from_partly_filled_cache() {
        check_prefill(8, 3);
    }

    /// The source grew past its configured length: 6 positions in a cache
    /// configured for 4, so its storage was reallocated in chunks.
    #[test]
    #[serial]
    fn test_prefill_from_grown_cache() {
        check_prefill(4, 6);
    }

    /// The source's storage is exactly its position.
    #[test]
    #[serial]
    fn test_prefill_from_full_cache() {
        check_prefill(5, 5);
    }

    /// A decode's config is batch 1, the rest as given.
    #[test]
    fn test_for_decode() {
        let config = KVCacheConfig::for_decode(2, 16, 4, 3);
        let full = KVCacheConfig::new(1, 2, 16, 4, 3);
        assert_eq!(
            (
                config.batch_size,
                config.num_heads,
                config.seq_len,
                config.head_dim,
                config.num_layers
            ),
            (
                full.batch_size,
                full.num_heads,
                full.seq_len,
                full.head_dim,
                full.num_layers
            )
        );
    }

    #[test]
    fn test_config_sizing() {
        let config = KVCacheConfig::new(1, 2, 16, 4, 3);
        assert_eq!(config.chunk_size(), 1024);
        assert_eq!(config.max_seq_len(), None);

        let config = config
            .with_batch_size(5)
            .with_seq_len(32)
            .with_chunk_size(8)
            .with_max_seq_len(Some(40));
        let cache = config.init();
        assert_eq!(cache.batch_size(), 5);
        assert_eq!(cache.seq_len(), 32);
        assert_eq!(cache.chunk_size(), 8);
        assert_eq!(cache.max_seq_len(), Some(40));

        // Whole chunks, a spare one, and never past the cap.
        assert_eq!(cache.allocation_size(33), 40);
        assert_eq!(cache.allocation_size(17), 32);
        let uncapped = KVCacheConfig::new(1, 2, 16, 4, 3).with_chunk_size(8).init();
        assert_eq!(uncapped.allocation_size(33), 48);
    }

    #[test]
    #[should_panic(expected = "exceeds its max_seq_len")]
    fn test_config_rejects_a_pre_size_past_its_cap() {
        KVCacheConfig::new(1, 2, 16, 4, 3)
            .with_max_seq_len(Some(8))
            .init();
    }

    /// A capped cache grows to its cap, and no further: a decode may fill it
    /// exactly.
    #[test]
    #[serial]
    fn test_growth_stops_at_the_cap() {
        let device = performance_device();
        let _memory = DeviceMemoryGuard::new(&device);
        for storage in STORAGES {
            let mut cache = KVCacheConfig::new(1, 2, 2, 4, 2)
                .with_chunk_size(4)
                .with_max_seq_len(Some(6))
                .with_storage(storage)
                .init();
            fill(&mut cache, 4, &device);
            fill(&mut cache, 2, &device);
            assert_eq!(cache.pos(), 6);
            assert_eq!(cache.held_len(), Some(6), "{storage:?}");
        }
    }

    #[test]
    #[serial]
    #[should_panic(expected = "past its max_seq_len")]
    fn test_a_step_past_the_cap_panics() {
        let device = performance_device();
        let mut cache = KVCacheConfig::new(1, 2, 2, 4, 2)
            .with_max_seq_len(Some(4))
            .init();
        fill(&mut cache, 3, &device);
        fill(&mut cache, 2, &device);
    }

    #[test]
    fn test_a_model_hands_out_its_cache() {
        struct Model;
        impl KVCacheModel for Model {
            fn kv_cache_config(&self) -> KVCacheConfig {
                KVCacheConfig::new(1, 2, 16, 4, 3).with_max_seq_len(Some(64))
            }
        }
        let cache = Model.new_kv_cache(7);
        assert_eq!(cache.batch_size(), 7);
        assert_eq!(cache.num_layers(), 3);
        assert_eq!(cache.seq_len(), 16);
        assert_eq!(cache.max_seq_len(), Some(64));
        assert_eq!(cache.storage(), KVCacheStorage::Auto);
    }

    /// Every storage returns the same history through the same writes: a
    /// prompt, steps past the pre-size (growth), a reset and rewrite, and a
    /// step after it.
    #[test]
    #[serial]
    fn test_the_storages_agree() {
        let device = performance_device();
        let _memory = DeviceMemoryGuard::new(&device);
        let [batch, heads, head_dim, layers] = [2, 3, 4, 2];
        let step = |seed: u64, t: usize| {
            seeded_tensor::<4>(
                seed,
                [batch, heads, t, head_dim],
                Distribution::Default,
                &device,
            )
        };
        // (positions written, then whether to reset first).
        let script = [(3, false), (1, false), (4, false), (2, true), (1, false)];
        let run = |storage: KVCacheStorage| {
            let mut cache = KVCacheConfig::new(batch, heads, 4, head_dim, layers)
                .with_chunk_size(2)
                .with_storage(storage)
                .init();
            let mut histories = Vec::new();
            for (i, &(t, reset)) in script.iter().enumerate() {
                if reset {
                    cache.reset();
                }
                for layer in 0..layers {
                    let seed = 10 * i as u64 + 2 * layer as u64;
                    let (k, v) = cache.insert_kv(layer, step(seed, t), step(seed + 1, t));
                    histories.push((k.into_data(), v.into_data()));
                }
            }
            assert_eq!(cache.storage(), storage);
            histories
        };
        let want = run(KVCacheStorage::MultiLayer);
        for storage in [KVCacheStorage::Concat, KVCacheStorage::PerLayer] {
            for ((k, v), (want_k, want_v)) in run(storage).iter().zip(&want) {
                k.assert_eq(want_k, true);
                v.assert_eq(want_v, true);
            }
        }
    }

    /// The cross-attention store: set per layer, its group taken from the
    /// batches, read back unchanged, and kept through `reset` and `reorder`.
    #[test]
    #[serial]
    fn test_cross_kv_is_set_once_and_kept() {
        let device = performance_device();
        let _memory = DeviceMemoryGuard::new(&device);
        let [heads, head_dim, layers, cross_len] = [2, 4, 2, 5];
        for storage in STORAGES {
            let mut cache = KVCacheConfig::new(6, heads, 4, head_dim, layers)
                .with_storage(storage)
                .init();
            assert_eq!(cache.group(), 1);
            assert!(cache.cross_kv(0).is_none());
            assert_eq!(cache.dtype(), None);

            let cross: Vec<(Tensor<4>, Tensor<4>)> = (0..layers)
                .map(|layer| {
                    let seed = 100 + 2 * layer as u64;
                    let shape = [2, heads, cross_len, head_dim];
                    (
                        seeded_tensor::<4>(seed, shape, Distribution::Default, &device),
                        seeded_tensor::<4>(seed + 1, shape, Distribution::Default, &device),
                    )
                })
                .collect();
            for (layer, (k, v)) in cross.iter().enumerate() {
                cache.set_cross_kv(layer, k.clone(), v.clone());
            }
            assert_eq!(cache.group(), 3, "6 decode rows over 2 encoder rows");
            assert!(cache.dtype().is_some());

            fill(&mut cache, 2, &device);
            cache.reorder(&[5, 4, 3, 2, 1, 0]);
            cache.reset();
            for (layer, (k, v)) in cross.iter().enumerate() {
                let (got_k, got_v) = cache.cross_kv(layer).expect("set");
                got_k.into_data().assert_eq(&k.clone().into_data(), true);
                got_v.into_data().assert_eq(&v.clone().into_data(), true);
            }
        }
    }

    #[test]
    #[should_panic(expected = "not a whole multiple")]
    fn test_cross_kv_rows_must_divide_the_batch() {
        let device = cpu_device();
        let mut cache = KVCacheConfig::new(5, 2, 4, 4, 1).init();
        cache.set_cross_kv(
            0,
            Tensor::zeros([2, 2, 3, 4], &device),
            Tensor::zeros([2, 2, 3, 4], &device),
        );
    }

    #[test]
    #[should_panic(expected = "shares one group")]
    fn test_cross_kv_layers_share_a_group() {
        let device = cpu_device();
        let mut cache = KVCacheConfig::new(4, 2, 4, 4, 2).init();
        cache.set_cross_kv(
            0,
            Tensor::zeros([2, 2, 3, 4], &device),
            Tensor::zeros([2, 2, 3, 4], &device),
        );
        cache.set_cross_kv(
            1,
            Tensor::zeros([1, 2, 3, 4], &device),
            Tensor::zeros([1, 2, 3, 4], &device),
        );
    }

    /// `reorder` picks the history's rows, duplicates included, in every
    /// storage, and later steps append to the reordered rows.
    #[test]
    #[serial]
    fn test_reorder_picks_history_rows() {
        let device = performance_device();
        let _memory = DeviceMemoryGuard::new(&device);
        let [batch, heads, head_dim, layers] = [3, 2, 4, 2];
        let sources = [2, 0, 2];
        let indices = Tensor::<1, Int>::from_data([2i64, 0, 2], &device);
        for storage in STORAGES {
            let mut cache = KVCacheConfig::new(batch, heads, 2, head_dim, layers)
                .with_chunk_size(2)
                .with_storage(storage)
                .init();
            // 3 positions: past the pre-size, so the buffers have grown.
            let before: Vec<(Tensor<4>, Tensor<4>)> = (0..layers)
                .map(|layer| {
                    let shape = [batch, heads, 3, head_dim];
                    let seed = 2 * layer as u64;
                    let k = seeded_tensor::<4>(seed, shape, Distribution::Default, &device);
                    let v = seeded_tensor::<4>(seed + 1, shape, Distribution::Default, &device);
                    cache.insert_kv(layer, k.clone(), v.clone());
                    (k, v)
                })
                .collect();

            cache.reorder(&sources);
            assert_eq!(cache.pos(), 3);

            for (layer, (k, v)) in before.into_iter().enumerate() {
                let step = [batch, heads, 1, head_dim];
                let (k_all, v_all) = cache.insert_kv(
                    layer,
                    Tensor::zeros(step, &device),
                    Tensor::zeros(step, &device),
                );
                assert_eq!(k_all.dims(), [batch, heads, 4, head_dim], "{storage:?}");
                k_all
                    .slice(s![.., .., ..3])
                    .into_data()
                    .assert_eq(&k.select(0, indices.clone()).into_data(), true);
                v_all
                    .slice(s![.., .., ..3])
                    .into_data()
                    .assert_eq(&v.select(0, indices.clone()).into_data(), true);
            }
        }
    }

    #[test]
    #[should_panic(expected = "one source row per batch row")]
    fn test_reorder_takes_one_source_per_row() {
        let mut cache = KVCacheConfig::new(3, 2, 4, 4, 1).init();
        cache.reorder(&[0, 1]);
    }

    /// The backend names burn 0.22's dispatch reports, as seen on the CPU,
    /// Metal, Vulkan and CUDA, with and without fusion.
    #[test]
    fn test_backend_stack_parses_backend_names() {
        let parse = BackendStack::parse;
        let stack = |fused, runtime| BackendStack { fused, runtime };
        assert_eq!(parse("dispatch<flex>"), stack(false, Runtime::Other));
        assert_eq!(
            parse("dispatch<cubecl<wgpu<spirv>>>"),
            stack(false, Runtime::Wgpu)
        );
        assert_eq!(
            parse("dispatch<fusion<cubecl<wgpu<spirv>>>>"),
            stack(true, Runtime::Wgpu)
        );
        assert_eq!(parse("dispatch<cubecl<cuda>>"), stack(false, Runtime::Cuda));
        assert_eq!(
            parse("dispatch<cubecl<wgpu<msl>>>"),
            stack(false, Runtime::Wgpu)
        );
        assert_eq!(
            parse("dispatch<fusion<cubecl<wgpu<msl>>>>"),
            stack(true, Runtime::Wgpu)
        );
        assert_eq!(
            parse("dispatch<fusion<cubecl<cuda>>>"),
            stack(true, Runtime::Cuda)
        );
        assert_eq!(
            parse("dispatch<autodiff<fusion<cubecl<wgpu<spirv>>>>>"),
            stack(true, Runtime::Wgpu)
        );
    }

    /// The device this test runs on reports a backend name the parser
    /// understands: a cubecl device's names its runtime.
    #[test]
    #[serial]
    fn test_backend_stack_reads_the_device() {
        use burn_backend::Backend;
        let device = performance_device();
        let name = burn_dispatch::Dispatch::name(device.as_dispatch());
        let stack = BackendStack::of(&device);
        println!(
            "backend {name}: {stack:?}, Auto is {:?}",
            KVCacheStorage::auto_for(&device)
        );
        assert_eq!(stack.fused, name.contains("fusion<"), "{name}");
        if name.contains("cubecl<") {
            assert!(
                name.contains("cubecl<wgpu")
                    || name.contains("cubecl<cuda")
                    || stack.runtime == Runtime::Other,
                "{name}"
            );
        }
    }

    /// `Auto` resolves on the first write, on the device of the first keys:
    /// on the CPU, to `PerLayer`.
    #[test]
    fn test_auto_resolves_on_the_first_write() {
        let device = cpu_device();
        assert_eq!(KVCacheStorage::auto_for(&device), KVCacheStorage::PerLayer);
        assert_eq!(
            KVCacheStorage::Concat.resolve(&device),
            KVCacheStorage::Concat
        );

        let mut cache = KVCacheConfig::new(1, 2, 4, 4, 1).init();
        assert_eq!(cache.storage(), KVCacheStorage::Auto);
        cache.insert_kv(
            0,
            Tensor::zeros([1, 2, 1, 4], &device),
            Tensor::zeros([1, 2, 1, 4], &device),
        );
        assert_eq!(cache.storage(), KVCacheStorage::PerLayer);
    }
}