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
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
//! ArenaManager - Manages multiple ByteNodeArenas for efficient node storage
//!
//! The ArenaManager provides a simple interface for allocating and reading
//! ARTrie nodes across multiple arenas. When an arena fills up, a new one is
//! automatically created.
//!
//! ## Addressing Scheme
//!
//! Each allocated node is identified by an `ArenaSlot`:
//! - `arena_id`: Which arena contains the node (u32)
//! - `slot_id`: Which slot within that arena (u32)
//!
//! This is encoded into a 64-bit value for use with SwizzledPtr.
use super::arena::ByteNodeArena;
use super::block_storage::BlockStorage;
use super::buffer_manager::BufferManager;
use super::dirty_tracker::DirtyTracker;
use super::disk_manager::{MmapDiskManager, BLOCK_SIZE};
use super::PersistentARTrieError;
use parking_lot::RwLock;
use std::sync::Arc;
type Result<T> = std::result::Result<T, PersistentARTrieError>;
// =============================================================================
// Flush Configuration
// =============================================================================
/// Configuration for flush behavior.
///
/// Controls whether slot-level dirty tracking is enabled and
/// the threshold for switching between partial and full arena writes.
#[derive(Debug, Clone)]
pub struct FlushConfig {
/// Enable slot-level dirty tracking for fine-grained incremental checkpoints.
///
/// When enabled, only modified slots are written during flush instead of
/// entire arenas. This can reduce I/O by 90%+ for localized updates.
///
/// Default: `false` (opt-in due to memory overhead)
pub slot_level_tracking: bool,
/// Threshold ratio for switching to full arena writes.
///
/// When the ratio of dirty slots to total slots exceeds this threshold,
/// the entire arena is written instead of individual slots. This balances
/// I/O savings against syscall overhead.
///
/// Default: `0.5` (50% dirty triggers full write)
pub full_arena_threshold: f64,
}
impl Default for FlushConfig {
fn default() -> Self {
Self {
slot_level_tracking: false,
full_arena_threshold: 0.5,
}
}
}
impl FlushConfig {
/// Create a config with slot-level tracking enabled.
pub fn with_slot_tracking() -> Self {
Self {
slot_level_tracking: true,
..Default::default()
}
}
/// Set the full arena write threshold.
pub fn with_threshold(mut self, threshold: f64) -> Self {
self.full_arena_threshold = threshold.clamp(0.0, 1.0);
self
}
}
/// Statistics from a flush operation.
#[derive(Debug, Clone, Default)]
pub struct FlushStats {
/// Number of arenas that were written in full.
pub full_arena_writes: usize,
/// Number of arenas that used partial/slot-level writes.
pub partial_writes: usize,
/// Total number of individual slots written.
pub slots_written: usize,
/// Total bytes written to disk.
pub bytes_written: usize,
/// Estimated bytes saved by partial writes.
pub bytes_saved: usize,
}
impl FlushStats {
/// Create stats for a full flush (no slot-level tracking).
pub fn full_flush(arena_count: usize, arena_size: usize) -> Self {
Self {
full_arena_writes: arena_count,
partial_writes: 0,
slots_written: 0,
bytes_written: arena_count * arena_size,
bytes_saved: 0,
}
}
}
/// Write only dirty slots for a single arena.
///
/// This is a free function to avoid borrow checker issues when iterating
/// over arenas while also needing to call this write helper.
///
/// Writes:
/// 1. Header (always, as it contains updated node_count etc.)
/// 2. Each dirty slot's data
/// 3. Each dirty slot's directory entry
fn write_dirty_slots_for_arena<S: BlockStorage>(
bm_guard: &impl std::ops::Deref<Target = BufferManager<S>>,
arena: &ByteNodeArena,
block_id: u32,
dirty_slots: impl Iterator<Item = u32>,
) -> Result<usize> {
let dm = bm_guard.storage();
let arena_bytes = arena.as_bytes();
let mut bytes_written = 0usize;
// Always write header
let (header_off, header_len) = arena.header_range();
dm.write_bytes(
block_id,
header_off,
&arena_bytes[header_off..header_off + header_len],
)?;
bytes_written += header_len;
// Write each dirty slot's data and directory entry
for slot_id in dirty_slots {
// Write data
let (data_off, data_len) = arena.slot_data_range(slot_id)?;
dm.write_bytes(
block_id,
data_off,
&arena_bytes[data_off..data_off + data_len],
)?;
bytes_written += data_len;
// Write directory entry
let (dir_off, dir_len) = arena.slot_directory_entry_range(slot_id)?;
dm.write_bytes(block_id, dir_off, &arena_bytes[dir_off..dir_off + dir_len])?;
bytes_written += dir_len;
}
Ok(bytes_written)
}
/// Arena slot identifier — relocated to
/// [`crate::persistent_artrie_core::arena_slot::ArenaSlot`]. Re-exported here
/// so existing callers keep working unchanged.
pub use crate::persistent_artrie_core::arena_slot::ArenaSlot;
/// Handle for a reserved range of consecutive slots.
///
/// Created by `ArenaManager::reserve_slots()`, this tracks a contiguous
/// range of slots for sequential sibling storage. Use with
/// `ArenaManager::allocate_reserved()` to fill the slots in order.
#[derive(Debug, Clone)]
pub struct ReservedSlots {
/// Arena containing the reserved slots
pub arena_id: u32,
/// First slot in the reserved range
pub first_slot: u32,
/// Total number of slots reserved
pub count: u32,
/// Next slot index to allocate (0..count)
pub next_idx: u32,
}
impl ReservedSlots {
/// Get the ArenaSlot for the first child
pub fn first_child_slot(&self) -> ArenaSlot {
ArenaSlot::new(self.arena_id, self.first_slot)
}
/// Check if all reserved slots have been used
pub fn is_complete(&self) -> bool {
self.next_idx >= self.count
}
/// Get the number of remaining slots
pub fn remaining(&self) -> u32 {
self.count.saturating_sub(self.next_idx)
}
}
/// ArenaManager - Manages allocation and reading across multiple arenas
///
/// Generic over the storage backend `S`. Defaults to `MmapDiskManager` for
/// backward compatibility.
pub struct ArenaManager<S: BlockStorage = MmapDiskManager> {
/// All arenas (may be in memory or on disk)
arenas: Vec<ByteNodeArena>,
/// Index of the current arena for new allocations
active_arena: usize,
/// Optional buffer manager for disk I/O
buffer_manager: Option<Arc<RwLock<BufferManager<S>>>>,
/// Arena size (default BLOCK_SIZE)
arena_size: usize,
/// Optional dirty tracker for slot-level incremental checkpoints
dirty_tracker: Option<DirtyTracker>,
/// Flush configuration
flush_config: FlushConfig,
}
impl<S: BlockStorage> std::fmt::Debug for ArenaManager<S> {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
f.debug_struct("ArenaManager")
.field("num_arenas", &self.arenas.len())
.field("active_arena", &self.active_arena)
.field("has_buffer_manager", &self.buffer_manager.is_some())
.field("arena_size", &self.arena_size)
.finish()
}
}
impl<S: BlockStorage> ArenaManager<S> {
/// Create a new ArenaManager without disk backing
pub fn new() -> Self {
let initial_arena = ByteNodeArena::new_default();
Self {
arenas: vec![initial_arena],
active_arena: 0,
buffer_manager: None,
arena_size: BLOCK_SIZE,
dirty_tracker: None,
flush_config: FlushConfig::default(),
}
}
/// Create a new ArenaManager with disk backing via BufferManager
pub fn with_buffer_manager(buffer_manager: Arc<RwLock<BufferManager<S>>>) -> Self {
let initial_arena = ByteNodeArena::new_default();
Self {
arenas: vec![initial_arena],
active_arena: 0,
buffer_manager: Some(buffer_manager),
arena_size: BLOCK_SIZE,
dirty_tracker: None,
flush_config: FlushConfig::default(),
}
}
/// Create a new ArenaManager with custom arena size
pub fn with_arena_size(arena_size: usize) -> Self {
let initial_arena = ByteNodeArena::new(arena_size);
Self {
arenas: vec![initial_arena],
active_arena: 0,
buffer_manager: None,
arena_size,
dirty_tracker: None,
flush_config: FlushConfig::default(),
}
}
/// Create a new ArenaManager with flush configuration.
///
/// This constructor enables slot-level dirty tracking if configured.
pub fn with_config(config: FlushConfig) -> Self {
let dirty_tracker = if config.slot_level_tracking {
Some(DirtyTracker::slot_level())
} else {
None
};
let initial_arena = ByteNodeArena::new_default();
Self {
arenas: vec![initial_arena],
active_arena: 0,
buffer_manager: None,
arena_size: BLOCK_SIZE,
dirty_tracker,
flush_config: config,
}
}
/// Create a new ArenaManager with buffer manager and flush configuration.
///
/// This is the primary constructor for disk-backed tries with slot-level tracking.
pub fn with_buffer_manager_and_config(
buffer_manager: Arc<RwLock<BufferManager<S>>>,
config: FlushConfig,
) -> Self {
let dirty_tracker = if config.slot_level_tracking {
Some(DirtyTracker::slot_level())
} else {
None
};
let initial_arena = ByteNodeArena::new_default();
Self {
arenas: vec![initial_arena],
active_arena: 0,
buffer_manager: Some(buffer_manager),
arena_size: BLOCK_SIZE,
dirty_tracker,
flush_config: config,
}
}
/// Allocate space for data and return the ArenaSlot
///
/// If the current arena is full, a new arena is created automatically.
/// When slot-level tracking is enabled, the allocation is marked dirty.
pub fn allocate(&mut self, data: &[u8]) -> Result<ArenaSlot> {
// Try to allocate in the active arena
if let Some(slot_id) = self.arenas[self.active_arena].allocate(data) {
let slot = ArenaSlot::new(self.active_arena as u32, slot_id);
// Track the dirty slot
if let Some(ref mut tracker) = self.dirty_tracker {
tracker.mark_slot_dirty(slot.arena_id, slot.slot_id);
}
return Ok(slot);
}
// Active arena is full, create a new one
let new_arena = ByteNodeArena::new(self.arena_size);
self.arenas.push(new_arena);
self.active_arena = self.arenas.len() - 1;
// Allocate in the new arena
if let Some(slot_id) = self.arenas[self.active_arena].allocate(data) {
let slot = ArenaSlot::new(self.active_arena as u32, slot_id);
// Track the dirty slot
if let Some(ref mut tracker) = self.dirty_tracker {
tracker.mark_slot_dirty(slot.arena_id, slot.slot_id);
}
Ok(slot)
} else {
Err(PersistentARTrieError::internal(&format!(
"Data too large for arena: {} bytes",
data.len()
)))
}
}
/// Read data from the specified arena slot
pub fn read(&self, slot: ArenaSlot) -> Result<&[u8]> {
let arena_id = slot.arena_id as usize;
if arena_id >= self.arenas.len() {
return Err(PersistentARTrieError::corrupted(&format!(
"Invalid arena ID {} (have {} arenas)",
arena_id,
self.arenas.len()
)));
}
self.arenas[arena_id].read(slot.slot_id)
}
/// Update data at the specified arena slot.
///
/// The replacement must be exactly the same length as the existing slot
/// payload so directory entries and persisted slot identities stay stable.
pub fn update(&mut self, slot: ArenaSlot, new_data: &[u8]) -> Result<()> {
let arena_id = slot.arena_id as usize;
if arena_id >= self.arenas.len() {
return Err(PersistentARTrieError::corrupted(&format!(
"Invalid arena ID {} (have {} arenas)",
arena_id,
self.arenas.len()
)));
}
self.arenas[arena_id].update(slot.slot_id, new_data)?;
if let Some(ref mut tracker) = self.dirty_tracker {
tracker.mark_slot_dirty(slot.arena_id, slot.slot_id);
}
Ok(())
}
/// Get the number of arenas
pub fn arena_count(&self) -> usize {
self.arenas.len()
}
/// Get total node count across all arenas
pub fn total_node_count(&self) -> u64 {
self.arenas.iter().map(|a| a.node_count() as u64).sum()
}
/// Flush all dirty arenas to disk
///
/// This persists arenas to the buffer manager. Each arena is allocated
/// a block on demand, and the actual allocated block_id is stored in
/// the arena for future reference.
///
/// # Concurrency Safety
///
/// This method uses the actual block_id returned by `new_page()` rather
/// than assuming sequential allocation. This is critical for correctness
/// under concurrent allocation where block IDs may not be sequential.
pub fn flush(&mut self) -> Result<()> {
let bm = match &self.buffer_manager {
Some(bm) => bm,
None => return Ok(()), // No disk backing, nothing to flush
};
let bm_guard = bm.write();
for arena in self.arenas.iter_mut() {
if arena.is_dirty() {
if let Some(id) = arena.block_id {
// Arena already has a block_id assigned - fetch and update
let mut page = bm_guard.fetch_page_mut(id)?;
let page_data = page.data_mut();
let arena_data = arena.as_bytes();
page_data[..arena_data.len()].copy_from_slice(arena_data);
} else {
// New arena - allocate a block and write DIRECTLY to it
// (Don't drop and re-fetch - that's the race condition!)
let mut page = bm_guard.new_page()?;
arena.set_block_id(page.block_id());
let page_data = page.data_mut();
let arena_data = arena.as_bytes();
page_data[..arena_data.len()].copy_from_slice(arena_data);
}
arena.mark_clean();
}
}
// Flush all pages to disk
bm_guard.flush_all()?;
Ok(())
}
/// Flush dirty arenas in sequential order for optimal I/O.
///
/// This method explicitly collects and sorts dirty arena IDs before flushing,
/// ensuring sequential disk access patterns. This is particularly beneficial
/// for HDD storage where sequential I/O is much faster than random I/O.
///
/// For SSD storage, the benefit is smaller but still measurable due to
/// better buffer manager cache utilization.
///
/// # Concurrency Safety
///
/// This method uses the actual block_id returned by `new_page()` rather
/// than assuming sequential allocation. This is critical for correctness
/// under concurrent allocation where block IDs may not be sequential.
///
/// # Performance
///
/// Expected improvement: 5-15% faster flush for disk-resident tries with
/// many dirty arenas, especially on rotational storage.
pub fn flush_sequential(&mut self) -> Result<()> {
let bm = match &self.buffer_manager {
Some(bm) => bm,
None => return Ok(()), // No disk backing, nothing to flush
};
// Collect dirty arena indices and sort them for sequential I/O
let mut dirty_indices: Vec<usize> = self
.arenas
.iter()
.enumerate()
.filter(|(_, arena)| arena.is_dirty())
.map(|(idx, _)| idx)
.collect();
if dirty_indices.is_empty() {
return Ok(());
}
// Sort for sequential access (already sorted by index, but explicit for clarity)
dirty_indices.sort_unstable();
let bm_guard = bm.write();
for arena_index in dirty_indices {
let arena = &mut self.arenas[arena_index];
if let Some(id) = arena.block_id {
// Arena already has a block_id assigned - fetch and update
let mut page = bm_guard.fetch_page_mut(id)?;
let page_data = page.data_mut();
let arena_data = arena.as_bytes();
page_data[..arena_data.len()].copy_from_slice(arena_data);
} else {
// New arena - allocate a block and write DIRECTLY to it
// (Don't drop and re-fetch - that's the race condition!)
let mut page = bm_guard.new_page()?;
arena.set_block_id(page.block_id());
let page_data = page.data_mut();
let arena_data = arena.as_bytes();
page_data[..arena_data.len()].copy_from_slice(arena_data);
}
arena.mark_clean();
}
// Flush all pages to disk
bm_guard.flush_all()?;
Ok(())
}
/// Sync all arenas to disk (calls flush then syncs)
pub fn sync(&mut self) -> Result<()> {
self.flush()?;
if let Some(bm) = &self.buffer_manager {
let bm_guard = bm.write();
bm_guard.storage().sync()?;
}
Ok(())
}
// =========================================================================
// Slot-Level Incremental Flush
// =========================================================================
/// Flush only dirty slots to disk for incremental checkpointing.
///
/// When slot-level tracking is enabled, this method writes only the modified
/// slots instead of entire arenas. This can reduce checkpoint I/O by 90%+
/// for localized updates.
///
/// # Algorithm
///
/// For each dirty arena:
/// 1. Calculate dirty ratio (dirty_slots / total_slots)
/// 2. If ratio >= threshold: write entire arena (full write)
/// 3. Otherwise: write header + dirty slots + their directory entries
///
/// # Returns
///
/// Statistics about the flush operation including bytes written and saved.
pub fn flush_dirty_slots(&mut self) -> Result<FlushStats> {
// If no dirty tracker, fall back to full flush
let tracker = match &self.dirty_tracker {
Some(t) => t,
None => {
self.flush()?;
return Ok(FlushStats::full_flush(self.arenas.len(), self.arena_size));
}
};
// No buffer manager means no disk backing
let bm = match &self.buffer_manager {
Some(bm) => bm,
None => return Ok(FlushStats::default()),
};
// No tracked or untracked dirty arenas, nothing to do.
if tracker.dirty_arena_count() == 0 && !self.arenas.iter().any(|arena| arena.is_dirty()) {
return Ok(FlushStats::default());
}
let bm_guard = bm.write();
let mut stats = FlushStats::default();
let threshold = self.flush_config.full_arena_threshold;
// Collect dirty arena IDs (sorted for sequential I/O)
let mut dirty_arena_ids: Vec<u32> = tracker.dirty_arena_ids().collect();
dirty_arena_ids.sort_unstable();
for arena_id in dirty_arena_ids {
let arena_idx = arena_id as usize;
if arena_idx >= self.arenas.len() {
continue; // Skip invalid arena IDs
}
let arena = &mut self.arenas[arena_idx];
if !arena.is_dirty() {
continue; // Skip clean arenas
}
// Determine if we should do full or partial write
let total_slots = arena.slot_count() as usize;
let dirty_slot_count = tracker
.dirty_slot_ids(arena_id)
.map(|iter| iter.count())
.unwrap_or(total_slots);
let dirty_ratio = if total_slots > 0 {
dirty_slot_count as f64 / total_slots as f64
} else {
1.0 // New arena with no slots yet - full write
};
if let Some(block_id) = arena.block_id {
// Arena already has a block_id assigned
if dirty_ratio >= threshold || total_slots == 0 {
// Full arena write
let mut page = bm_guard.fetch_page_mut(block_id)?;
let page_data = page.data_mut();
let arena_data = arena.as_bytes();
page_data[..arena_data.len()].copy_from_slice(arena_data);
stats.full_arena_writes += 1;
stats.bytes_written += arena_data.len();
} else {
// Partial write: header + dirty slots + directory entries
let bytes_written = write_dirty_slots_for_arena(
&bm_guard,
arena,
block_id,
tracker.dirty_slot_ids(arena_id).unwrap(),
)?;
stats.partial_writes += 1;
stats.slots_written += dirty_slot_count;
stats.bytes_written += bytes_written;
stats.bytes_saved += self.arena_size.saturating_sub(bytes_written);
}
} else {
// New arena - allocate a block and write DIRECTLY to it
// (Don't drop and re-fetch - that's the race condition!)
let mut page = bm_guard.new_page()?;
arena.set_block_id(page.block_id());
let page_data = page.data_mut();
let arena_data = arena.as_bytes();
page_data[..arena_data.len()].copy_from_slice(arena_data);
stats.full_arena_writes += 1;
stats.bytes_written += arena_data.len();
}
arena.mark_clean();
}
// Defense in depth: flush any untracked dirty arenas.
// This catches arenas that were dirty before slot tracking was enabled
// or dirtied by a future code path that forgot to mark individual slots.
for (arena_id, arena) in self.arenas.iter_mut().enumerate() {
if arena.is_dirty() {
log::warn!(
"Flushing untracked dirty arena {} (slot tracking may have been enabled late)",
arena_id
);
let mut page = if let Some(block_id) = arena.block_id {
bm_guard.fetch_page_mut(block_id)?
} else {
let page = bm_guard.new_page()?;
arena.set_block_id(page.block_id());
page
};
let page_data = page.data_mut();
let arena_data = arena.as_bytes();
let arena_data_len = arena_data.len();
page_data[..arena_data_len].copy_from_slice(arena_data);
arena.mark_clean();
stats.full_arena_writes += 1;
stats.bytes_written += arena_data_len;
}
}
// Flush all pages to disk
bm_guard.flush_all()?;
// Clear the dirty tracker after successful flush
if let Some(ref mut tracker) = self.dirty_tracker {
tracker.checkpoint_complete();
}
Ok(stats)
}
/// Get the current flush configuration.
pub fn flush_config(&self) -> &FlushConfig {
&self.flush_config
}
/// Check if slot-level tracking is enabled.
pub fn has_slot_tracking(&self) -> bool {
self.dirty_tracker.is_some()
}
/// Enable slot-level dirty tracking after construction.
///
/// This is useful when opening an existing trie and wanting to enable
/// fine-grained checkpoint I/O savings. Slot-level tracking reduces
/// checkpoint I/O by writing only modified slots instead of entire arenas.
///
/// # Note
///
/// This method is idempotent - calling it when slot tracking is already
/// enabled has no effect.
///
/// # Example
///
/// ```text
/// // Open existing trie without slot tracking
/// let mut am = ArenaManager::with_buffer_manager(bm);
///
/// // Enable slot tracking for subsequent operations
/// am.enable_slot_tracking();
///
/// // Now allocations will be tracked at slot level
/// let slot = am.allocate(&data)?;
/// ```
pub fn enable_slot_tracking(&mut self) {
if self.dirty_tracker.is_none() {
let mut tracker = DirtyTracker::slot_level();
// CRITICAL FIX: Mark all existing dirty arenas in the new tracker
// to prevent "Invalid arena ID" corruption on checkpoint.
// Without this, dirty arenas created before enabling slot tracking
// would not be tracked, causing flush_dirty_slots() to skip them
// and leaving them without block_ids while serialized nodes
// reference them.
tracker.mark_arenas_dirty(
self.arenas
.iter()
.enumerate()
.filter(|(_, arena)| arena.is_dirty())
.map(|(id, _)| id as u32),
);
self.dirty_tracker = Some(tracker);
self.flush_config.slot_level_tracking = true;
}
}
/// Get dirty tracker statistics (if tracking is enabled).
pub fn dirty_tracker_stats(&self) -> Option<super::dirty_tracker::DirtyTrackerStats> {
self.dirty_tracker.as_ref().map(|t| t.stats())
}
/// Get statistics about arena usage
pub fn stats(&self) -> ArenaStats {
let mut total_capacity = 0usize;
let mut total_used = 0usize;
let mut node_count = 0u64;
for arena in &self.arenas {
total_capacity += arena.size();
total_used += arena.size() - arena.available_space();
node_count += arena.node_count() as u64;
}
ArenaStats {
arena_count: self.arenas.len(),
total_capacity,
total_used,
node_count,
active_arena: self.active_arena,
active_arena_available: self.arenas[self.active_arena].available_space(),
}
}
/// Clear all arenas and reset to initial state
pub fn clear(&mut self) {
self.arenas.clear();
self.arenas.push(ByteNodeArena::new(self.arena_size));
self.active_arena = 0;
// Reset dirty tracker if present
if let Some(ref mut tracker) = self.dirty_tracker {
tracker.checkpoint_complete();
}
}
/// Load arenas from disk using the buffer manager
///
/// This should be called during recovery to load previously persisted arenas.
pub fn load_arena(&mut self, block_id: u32) -> Result<u32> {
let bm = self.buffer_manager.as_ref().ok_or_else(|| {
PersistentARTrieError::internal("No buffer manager for loading arena")
})?;
let bm_guard = bm.read();
let page = bm_guard.fetch_page(block_id)?;
let arena = ByteNodeArena::from_bytes(page.data(), block_id)?;
let arena_id = self.arenas.len() as u32;
self.arenas.push(arena);
Ok(arena_id)
}
/// Get a reference to an arena by ID
pub fn get_arena(&self, arena_id: u32) -> Option<&ByteNodeArena> {
self.arenas.get(arena_id as usize)
}
/// Get the active arena
pub fn active_arena(&self) -> &ByteNodeArena {
&self.arenas[self.active_arena]
}
/// Get the maximum slot value as u64 across all arenas
///
/// This is useful for determining the optimal ptr_width when using
/// compact variable-width encoding. The value is encoded as:
/// `(arena_id << 32) | slot_id`
///
/// For a single arena with N slots, this returns (0 << 32) | (N-1).
/// For multiple arenas, it returns the maximum across all.
pub fn max_slot_value(&self) -> u64 {
let mut max_value: u64 = 0;
for (arena_id, arena) in self.arenas.iter().enumerate() {
let node_count = arena.node_count();
if node_count > 0 {
// Last slot in this arena
let slot = ArenaSlot::new(arena_id as u32, node_count - 1);
let value = slot.to_u64();
if value > max_value {
max_value = value;
}
}
}
max_value
}
/// Get the maximum data offset across all arenas
///
/// This is useful for determining the optimal ptr_width when using
/// compact variable-width encoding based on actual data offsets.
pub fn max_data_offset(&self) -> u32 {
self.arenas
.iter()
.map(|a| a.max_data_offset())
.max()
.unwrap_or(0)
}
/// Get block IDs of all arenas that have been assigned blocks
///
/// Returns a vector of (arena_id, block_id) pairs for all arenas
/// that have been persisted to disk. Used for storing arena metadata
/// during checkpoint.
pub fn arena_block_ids(&self) -> Vec<(u32, u32)> {
self.arenas
.iter()
.enumerate()
.filter_map(|(id, arena)| arena.block_id.map(|bid| (id as u32, bid)))
.collect()
}
/// Clear all arenas and prepare for loading from disk
///
/// This resets the arena manager to an initial state with no arenas,
/// ready to receive arenas via load_arena(). Used during file open
/// to replace the empty initial arena with arenas loaded from disk.
pub fn clear_for_loading(&mut self) {
self.arenas.clear();
self.active_arena = 0;
}
/// Set the active arena index after loading
///
/// Should be called after loading all arenas to set the active arena
/// to the last one (for new allocations).
pub fn set_active_arena(&mut self, index: usize) {
if index < self.arenas.len() {
self.active_arena = index;
} else if !self.arenas.is_empty() {
self.active_arena = self.arenas.len() - 1;
}
}
/// Ensure the arena manager satisfies its basic non-empty/active-index
/// invariant after a failed or interrupted loading sequence.
pub fn ensure_valid(&mut self) {
if self.arenas.is_empty() {
log::warn!("ArenaManager had no arenas; creating initial arena");
self.arenas.push(ByteNodeArena::new(self.arena_size));
self.active_arena = 0;
} else if self.active_arena >= self.arenas.len() {
log::warn!(
"ArenaManager active_arena {} >= len {}; resetting to {}",
self.active_arena,
self.arenas.len(),
self.arenas.len() - 1
);
self.active_arena = self.arenas.len() - 1;
}
debug_assert!(self.is_valid());
}
/// Check the arena manager's basic non-empty/active-index invariant.
#[inline]
pub fn is_valid(&self) -> bool {
!self.arenas.is_empty() && self.active_arena < self.arenas.len()
}
/// Get the next slot that will be allocated
///
/// This returns the ArenaSlot that the next `allocate()` call will return,
/// assuming the allocation fits in the current arena.
///
/// This is useful for:
/// - Predicting a parent node's slot before serializing it
/// - Enabling relative offset encoding where children reference the parent
///
/// **Important**: If the data to be allocated exceeds the current arena's
/// available space, a new arena will be created and the slot will be in
/// the new arena (arena_id will be incremented).
///
/// Use `can_fit()` to check if the allocation will stay in the current arena.
pub fn next_slot(&self) -> ArenaSlot {
if self.arenas.is_empty() {
log::error!(
"ArenaManager::next_slot called with empty arenas. \
This violates arena_manager_valid invariant."
);
return ArenaSlot::new(0, 0);
}
if self.active_arena >= self.arenas.len() {
log::error!(
"ArenaManager::next_slot: active_arena {} >= arenas.len() {}. \
This violates arena_manager_valid invariant.",
self.active_arena,
self.arenas.len()
);
let last_arena = self.arenas.len() - 1;
let slot_id = self.arenas[last_arena].node_count();
return ArenaSlot::new(last_arena as u32, slot_id);
}
let arena_id = self.active_arena as u32;
let slot_id = self.arenas[self.active_arena].node_count();
ArenaSlot::new(arena_id, slot_id)
}
/// Check if data of the given size can fit in the current arena
///
/// This is useful in conjunction with `next_slot()` to predict whether
/// an allocation will stay in the current arena or trigger arena overflow.
///
/// When using relative encoding, children and parent should ideally be in
/// the same arena for optimal space savings. If this returns false, the
/// parent allocation will create a new arena and children will be in a
/// different arena (requiring full pointer encoding instead of relative).
pub fn can_fit(&self, size: usize) -> bool {
self.arenas[self.active_arena].can_allocate(size)
}
/// Get the active arena's ID
///
/// Useful for checking if a child slot is in the same arena as
/// where the parent will be allocated.
pub fn active_arena_id(&self) -> u32 {
self.active_arena as u32
}
// =============================================================================
// Sequential Sibling Storage Support
// =============================================================================
/// Average estimated size per node for reservation calculations
const ESTIMATED_NODE_SIZE: usize = 128;
/// Reserve N consecutive slots for sequential sibling storage.
///
/// This method ensures that the next `count` allocations will be placed
/// in consecutive slots within the same arena. If the current arena
/// cannot accommodate all slots, a new arena is created first.
///
/// # Arguments
/// * `count` - Number of consecutive slots to reserve
///
/// # Returns
/// A `ReservedSlots` handle for allocating into the reserved range.
///
/// # Usage
/// ```text
/// let mut reserved = arena_manager.reserve_slots(3)?;
/// let first_slot = reserved.first_slot;
///
/// // Allocate children in order - they get consecutive slots
/// let slot0 = arena_manager.allocate_reserved(&mut reserved, &child0_data)?;
/// let slot1 = arena_manager.allocate_reserved(&mut reserved, &child1_data)?;
/// let slot2 = arena_manager.allocate_reserved(&mut reserved, &child2_data)?;
///
/// // slot0 = first_slot, slot1 = first_slot + 1, slot2 = first_slot + 2
/// ```
///
/// # Note
/// The reservation is based on estimated size per node. If actual nodes
/// are much larger than expected, allocations may fail. In that case,
/// use `allocate()` directly and fall back to individual pointer encoding.
pub fn reserve_slots(&mut self, count: usize) -> Result<ReservedSlots> {
if count == 0 {
return Err(PersistentARTrieError::internal("Cannot reserve 0 slots"));
}
// Estimate space needed (average node size × count + overhead per slot)
let estimated_size = count * Self::ESTIMATED_NODE_SIZE;
// Check if current arena can fit all slots
if !self.arenas[self.active_arena].can_allocate(estimated_size) {
// Create a new arena to ensure contiguity
let new_arena = ByteNodeArena::new(self.arena_size);
self.arenas.push(new_arena);
self.active_arena = self.arenas.len() - 1;
}
let first_slot = self.arenas[self.active_arena].node_count();
Ok(ReservedSlots {
arena_id: self.active_arena as u32,
first_slot,
count: count as u32,
next_idx: 0,
})
}
/// Allocate data into a reserved slot range.
///
/// This ensures allocations go into the reserved consecutive slot range.
/// Panics if called more times than `count` or if data doesn't fit.
///
/// # Arguments
/// * `reserved` - The reserved slots handle from `reserve_slots()`
/// * `data` - Node data to allocate
///
/// # Returns
/// The ArenaSlot where data was allocated.
///
/// # Panics
/// Panics if called more times than reserved, or if allocation fails.
pub fn allocate_reserved(
&mut self,
reserved: &mut ReservedSlots,
data: &[u8],
) -> Result<ArenaSlot> {
if reserved.next_idx >= reserved.count {
return Err(PersistentARTrieError::internal(
"Reserved slot range exhausted",
));
}
// Verify we're still in the reserved arena
if self.active_arena as u32 != reserved.arena_id {
return Err(PersistentARTrieError::internal(
"Active arena changed during reserved allocation",
));
}
// Expected slot is first_slot + next_idx
let expected_slot = reserved.first_slot + reserved.next_idx;
let current_slot = self.arenas[self.active_arena].node_count();
if current_slot != expected_slot {
return Err(PersistentARTrieError::internal(&format!(
"Slot mismatch: expected {}, got {}",
expected_slot, current_slot
)));
}
// Allocate the data
let slot_id = self.arenas[self.active_arena]
.allocate(data)
.ok_or_else(|| {
PersistentARTrieError::internal(&format!(
"Failed to allocate reserved slot {} (data size: {} bytes)",
expected_slot,
data.len()
))
})?;
// Verify the slot ID matches expected
debug_assert_eq!(slot_id, expected_slot);
reserved.next_idx += 1;
Ok(ArenaSlot::new(reserved.arena_id, slot_id))
}
/// Check if a reserved slots range is fully used.
pub fn is_reservation_complete(&self, reserved: &ReservedSlots) -> bool {
reserved.next_idx >= reserved.count
}
}
impl<S: BlockStorage> Default for ArenaManager<S> {
fn default() -> Self {
Self::new()
}
}
/// Statistics about arena usage
#[derive(Debug, Clone)]
pub struct ArenaStats {
/// Number of arenas
pub arena_count: usize,
/// Total capacity in bytes
pub total_capacity: usize,
/// Total used bytes
pub total_used: usize,
/// Total node count
pub node_count: u64,
/// Index of active arena
pub active_arena: usize,
/// Available space in active arena
pub active_arena_available: usize,
}
impl ArenaStats {
/// Get utilization percentage
pub fn utilization(&self) -> f64 {
if self.total_capacity == 0 {
0.0
} else {
(self.total_used as f64 / self.total_capacity as f64) * 100.0
}
}
/// Get average bytes per node
pub fn bytes_per_node(&self) -> f64 {
if self.node_count == 0 {
0.0
} else {
self.total_used as f64 / self.node_count as f64
}
}
}
#[cfg(test)]
mod tests {
use super::*;
// Concrete type alias for tests (default type param doesn't always resolve in test contexts)
type TestArenaManager = ArenaManager<super::super::disk_manager::MmapDiskManager>;
#[test]
fn test_arena_manager_creation() {
let manager = TestArenaManager::new();
assert_eq!(manager.arena_count(), 1);
assert_eq!(manager.total_node_count(), 0);
}
#[test]
fn test_arena_manager_allocation() {
let mut manager = TestArenaManager::new();
// Allocate some data
let data1 = b"hello world";
let slot1 = manager.allocate(data1).expect("allocation should succeed");
assert_eq!(slot1.arena_id, 0);
assert_eq!(slot1.slot_id, 0);
// Read it back
let read1 = manager.read(slot1).expect("read should succeed");
assert_eq!(read1, data1);
// Allocate more
let data2 = b"goodbye world";
let slot2 = manager.allocate(data2).expect("allocation should succeed");
assert_eq!(slot2.arena_id, 0);
assert_eq!(slot2.slot_id, 1);
assert_eq!(manager.total_node_count(), 2);
}
#[test]
fn test_arena_manager_overflow() {
// Use small arenas to force overflow
let mut manager = TestArenaManager::with_arena_size(512);
// Fill up several arenas
for i in 0..100 {
let data = format!("test data {}", i);
manager
.allocate(data.as_bytes())
.expect("allocation should succeed");
}
assert!(manager.arena_count() > 1);
assert_eq!(manager.total_node_count(), 100);
// Verify we can read all allocations
// (Note: We'd need to track all slots to verify this fully)
}
#[test]
fn test_arena_slot_encoding() {
let slot = ArenaSlot::new(12345, 67890);
let encoded = slot.to_u64();
let decoded = ArenaSlot::from_u64(encoded);
assert_eq!(decoded.arena_id, 12345);
assert_eq!(decoded.slot_id, 67890);
}
#[test]
fn test_arena_stats() {
let mut manager = TestArenaManager::with_arena_size(1024);
for _ in 0..10 {
manager
.allocate(&[0u8; 50])
.expect("allocation should succeed");
}
let stats = manager.stats();
assert_eq!(stats.node_count, 10);
assert!(stats.utilization() > 0.0);
assert!(stats.bytes_per_node() > 50.0); // At least the data size plus overhead
}
// =============================================================================
// Sequential Sibling Storage Tests
// =============================================================================
#[test]
fn test_reserve_slots_basic() {
let mut manager = TestArenaManager::new();
// Reserve 3 slots
let mut reserved = manager.reserve_slots(3).expect("reserve should succeed");
assert_eq!(reserved.arena_id, 0);
assert_eq!(reserved.first_slot, 0);
assert_eq!(reserved.count, 3);
assert_eq!(reserved.next_idx, 0);
assert!(!reserved.is_complete());
assert_eq!(reserved.remaining(), 3);
// Allocate into reserved slots
let data1 = b"child 1";
let slot1 = manager
.allocate_reserved(&mut reserved, data1)
.expect("should succeed");
assert_eq!(slot1.arena_id, 0);
assert_eq!(slot1.slot_id, 0);
assert_eq!(reserved.next_idx, 1);
let data2 = b"child 2";
let slot2 = manager
.allocate_reserved(&mut reserved, data2)
.expect("should succeed");
assert_eq!(slot2.arena_id, 0);
assert_eq!(slot2.slot_id, 1);
let data3 = b"child 3";
let slot3 = manager
.allocate_reserved(&mut reserved, data3)
.expect("should succeed");
assert_eq!(slot3.arena_id, 0);
assert_eq!(slot3.slot_id, 2);
assert!(reserved.is_complete());
assert_eq!(reserved.remaining(), 0);
// Verify consecutive allocation
assert_eq!(slot1.slot_id + 1, slot2.slot_id);
assert_eq!(slot2.slot_id + 1, slot3.slot_id);
// Verify data readable
assert_eq!(manager.read(slot1).unwrap(), data1);
assert_eq!(manager.read(slot2).unwrap(), data2);
assert_eq!(manager.read(slot3).unwrap(), data3);
}
#[test]
fn test_reserve_slots_overflow() {
// Create a small arena that will overflow when reserving
let mut manager = TestArenaManager::with_arena_size(512);
// Fill the first arena almost completely
for _ in 0..5 {
manager
.allocate(&[0u8; 50])
.expect("allocation should succeed");
}
let initial_arena_count = manager.arena_count();
// Reserve slots - should create a new arena
let reserved = manager.reserve_slots(10).expect("reserve should succeed");
// Should be in a new arena
assert!(manager.arena_count() > initial_arena_count);
assert_eq!(reserved.arena_id, manager.active_arena_id());
assert_eq!(reserved.first_slot, 0); // First slot in new arena
}
#[test]
fn test_reserve_slots_first_child_slot() {
let mut manager = TestArenaManager::new();
// Add some allocations first
manager.allocate(b"pre-existing 1").unwrap();
manager.allocate(b"pre-existing 2").unwrap();
// Now reserve slots
let reserved = manager.reserve_slots(4).expect("reserve should succeed");
// First child slot should be after pre-existing allocations
let first_child = reserved.first_child_slot();
assert_eq!(first_child.arena_id, 0);
assert_eq!(first_child.slot_id, 2); // After the 2 pre-existing
}
#[test]
fn test_reserve_slots_error_zero() {
let mut manager = TestArenaManager::new();
// Cannot reserve 0 slots
let result = manager.reserve_slots(0);
assert!(result.is_err());
}
#[test]
fn test_reserve_slots_exhausted() {
let mut manager = TestArenaManager::new();
let mut reserved = manager.reserve_slots(2).expect("reserve should succeed");
// Use both slots
manager.allocate_reserved(&mut reserved, b"child1").unwrap();
manager.allocate_reserved(&mut reserved, b"child2").unwrap();
// Third allocation should fail
let result = manager.allocate_reserved(&mut reserved, b"child3");
assert!(result.is_err());
}
#[test]
fn test_reserved_slots_struct() {
let reserved = ReservedSlots {
arena_id: 5,
first_slot: 100,
count: 10,
next_idx: 3,
};
assert_eq!(reserved.remaining(), 7);
assert!(!reserved.is_complete());
let first = reserved.first_child_slot();
assert_eq!(first.arena_id, 5);
assert_eq!(first.slot_id, 100);
// Test complete
let complete = ReservedSlots {
arena_id: 0,
first_slot: 0,
count: 5,
next_idx: 5,
};
assert!(complete.is_complete());
assert_eq!(complete.remaining(), 0);
}
// =========================================================================
// Slot-Level Dirty Tracking Tests
// =========================================================================
#[test]
fn test_flush_config_default() {
let config = FlushConfig::default();
assert!(!config.slot_level_tracking);
assert!((config.full_arena_threshold - 0.5).abs() < f64::EPSILON);
}
#[test]
fn test_flush_config_with_slot_tracking() {
let config = FlushConfig::with_slot_tracking();
assert!(config.slot_level_tracking);
assert!((config.full_arena_threshold - 0.5).abs() < f64::EPSILON);
}
#[test]
fn test_flush_config_with_threshold() {
let config = FlushConfig::with_slot_tracking().with_threshold(0.3);
assert!(config.slot_level_tracking);
assert!((config.full_arena_threshold - 0.3).abs() < f64::EPSILON);
// Test clamping
let config_high = FlushConfig::default().with_threshold(2.0);
assert!((config_high.full_arena_threshold - 1.0).abs() < f64::EPSILON);
let config_low = FlushConfig::default().with_threshold(-0.5);
assert!((config_low.full_arena_threshold - 0.0).abs() < f64::EPSILON);
}
#[test]
fn test_arena_manager_with_config() {
let config = FlushConfig::with_slot_tracking();
let manager = TestArenaManager::with_config(config);
assert!(manager.has_slot_tracking());
assert!(manager.dirty_tracker_stats().is_some());
}
#[test]
fn test_arena_manager_without_slot_tracking() {
let manager = TestArenaManager::new();
assert!(!manager.has_slot_tracking());
assert!(manager.dirty_tracker_stats().is_none());
}
#[test]
fn test_slot_tracking_marks_dirty() {
let config = FlushConfig::with_slot_tracking();
let mut manager = TestArenaManager::with_config(config);
// Allocate some data
manager
.allocate(b"hello")
.expect("allocation should succeed");
manager
.allocate(b"world")
.expect("allocation should succeed");
// Check dirty stats
let stats = manager.dirty_tracker_stats().expect("should have stats");
assert_eq!(stats.dirty_arenas, 1);
assert_eq!(stats.dirty_slots, 2);
assert_eq!(stats.total_marks, 2);
}
#[test]
fn test_slot_tracking_across_arenas() {
let config = FlushConfig::with_slot_tracking();
// Use small arena to force overflow
let mut manager = TestArenaManager::with_config(config);
// Manually set arena_size smaller (through a different constructor)
manager.arena_size = 512;
manager.arenas.clear();
manager.arenas.push(ByteNodeArena::new(512));
manager.active_arena = 0;
// Allocate enough to cross arenas
for i in 0..20 {
let data = format!("data_{:03}", i);
manager
.allocate(data.as_bytes())
.expect("allocation should succeed");
}
// Should have multiple dirty arenas
let stats = manager.dirty_tracker_stats().expect("should have stats");
assert!(stats.dirty_arenas >= 1);
assert_eq!(stats.dirty_slots as u64, manager.total_node_count());
}
#[test]
fn test_clear_resets_dirty_tracker() {
let config = FlushConfig::with_slot_tracking();
let mut manager = TestArenaManager::with_config(config);
// Allocate some data
manager
.allocate(b"hello")
.expect("allocation should succeed");
let stats_before = manager.dirty_tracker_stats().expect("should have stats");
assert_eq!(stats_before.dirty_slots, 1);
// Clear should reset tracker
manager.clear();
let stats_after = manager.dirty_tracker_stats().expect("should have stats");
assert_eq!(stats_after.dirty_slots, 0);
assert_eq!(stats_after.epoch, 1); // Epoch incremented
}
#[test]
fn test_flush_stats_default() {
let stats = FlushStats::default();
assert_eq!(stats.full_arena_writes, 0);
assert_eq!(stats.partial_writes, 0);
assert_eq!(stats.slots_written, 0);
assert_eq!(stats.bytes_written, 0);
assert_eq!(stats.bytes_saved, 0);
}
#[test]
fn test_flush_stats_full_flush() {
let stats = FlushStats::full_flush(10, 256 * 1024);
assert_eq!(stats.full_arena_writes, 10);
assert_eq!(stats.partial_writes, 0);
assert_eq!(stats.bytes_written, 10 * 256 * 1024);
}
#[test]
fn test_flush_dirty_slots_no_buffer_manager() {
// Without buffer manager, flush_dirty_slots returns empty stats
let config = FlushConfig::with_slot_tracking();
let mut manager = TestArenaManager::with_config(config);
manager
.allocate(b"hello")
.expect("allocation should succeed");
let stats = manager.flush_dirty_slots().expect("flush should succeed");
// No buffer manager means no actual writes
assert_eq!(stats.bytes_written, 0);
}
#[test]
fn test_flush_dirty_slots_fallback_without_tracking() {
// Without slot tracking, flush_dirty_slots falls back to full flush
let mut manager = TestArenaManager::new();
manager
.allocate(b"hello")
.expect("allocation should succeed");
let stats = manager.flush_dirty_slots().expect("flush should succeed");
// Without buffer manager, still returns meaningful stats about what would be flushed
assert_eq!(stats.full_arena_writes, 1);
}
// =========================================================================
// enable_slot_tracking() Tests
// =========================================================================
#[test]
fn test_enable_slot_tracking_basic() {
let mut manager = TestArenaManager::new();
// Initially no slot tracking
assert!(!manager.has_slot_tracking());
assert!(!manager.flush_config().slot_level_tracking);
// Enable slot tracking
manager.enable_slot_tracking();
// Now slot tracking should be enabled
assert!(manager.has_slot_tracking());
assert!(manager.flush_config().slot_level_tracking);
}
#[test]
fn test_enable_slot_tracking_idempotent() {
let mut manager = TestArenaManager::new();
// Enable once
manager.enable_slot_tracking();
assert!(manager.has_slot_tracking());
// Get the tracker's initial state
let stats_before = manager.dirty_tracker_stats();
// Enable again (should be no-op)
manager.enable_slot_tracking();
// Should still be enabled with same state
assert!(manager.has_slot_tracking());
let stats_after = manager.dirty_tracker_stats();
// Stats should be identical (same tracker instance)
assert_eq!(
stats_before.unwrap().dirty_arenas,
stats_after.unwrap().dirty_arenas
);
}
#[test]
fn test_enable_slot_tracking_tracks_allocations() {
let mut manager = TestArenaManager::with_arena_size(4096);
// Enable slot tracking
manager.enable_slot_tracking();
// Allocate some data
let _slot1 = manager.allocate(b"hello").unwrap();
let _slot2 = manager.allocate(b"world").unwrap();
// Check that allocations are tracked
let stats = manager.dirty_tracker_stats().unwrap();
assert!(stats.dirty_arenas > 0, "should track dirty arenas");
assert!(stats.dirty_slots > 0, "should track dirty slots");
}
#[test]
fn test_enable_slot_tracking_after_allocations() {
let mut manager = TestArenaManager::with_arena_size(4096);
// Allocate before enabling (not tracked)
manager.allocate(b"pre-tracking").unwrap();
// Enable slot tracking
manager.enable_slot_tracking();
// Allocate after enabling (tracked)
let _slot = manager.allocate(b"post-tracking").unwrap();
// Check that the post-tracking allocation is tracked
let stats = manager.dirty_tracker_stats().unwrap();
assert!(
stats.dirty_slots >= 1,
"should track slot allocated after enable"
);
}
#[test]
fn test_enable_slot_tracking_with_buffer_manager_constructor() {
// Verify that enable_slot_tracking works with buffer manager constructor
// (simulating the open() -> enable_slot_tracking() pattern)
let mut manager = TestArenaManager::with_arena_size(4096);
// Simulate opening without slot tracking
assert!(!manager.has_slot_tracking());
// Enable slot tracking (as open_with_slot_tracking would do)
manager.enable_slot_tracking();
// Verify it's now enabled
assert!(manager.has_slot_tracking());
// Verify allocations are tracked
manager.allocate(b"test data").unwrap();
let stats = manager.dirty_tracker_stats().unwrap();
assert!(stats.dirty_slots > 0);
}
#[test]
fn test_enable_slot_tracking_marks_existing_dirty_arenas() {
let mut manager = TestArenaManager::with_arena_size(4096);
// Allocate before enabling (creates dirty arenas)
manager.allocate(b"pre-tracking-1").unwrap();
manager.allocate(b"pre-tracking-2").unwrap();
// Existing arenas should be dirty (via arena's is_dirty flag)
assert!(manager.arenas[0].is_dirty());
// Enable slot tracking - should retroactively mark existing dirty arenas
manager.enable_slot_tracking();
// Tracker should know about existing dirty arenas
let stats = manager.dirty_tracker_stats().unwrap();
assert!(
stats.dirty_arenas >= 1,
"should retroactively track existing dirty arenas, got {}",
stats.dirty_arenas
);
}
#[test]
fn test_enable_slot_tracking_marks_multiple_dirty_arenas() {
// Use small arenas to force multiple arenas to be created
let mut manager = TestArenaManager::with_arena_size(512);
// Fill up multiple arenas before enabling tracking
for i in 0..20 {
let data = format!("pre-tracking-{:04}", i);
manager.allocate(data.as_bytes()).unwrap();
}
let arena_count_before = manager.arena_count();
assert!(arena_count_before > 1, "should have multiple arenas");
// Count dirty arenas before enabling
let dirty_count_before = manager.arenas.iter().filter(|a| a.is_dirty()).count();
// Enable slot tracking - should retroactively mark all dirty arenas
manager.enable_slot_tracking();
// Tracker should know about all existing dirty arenas
let stats = manager.dirty_tracker_stats().unwrap();
assert_eq!(
stats.dirty_arenas, dirty_count_before,
"should track all {} dirty arenas, got {}",
dirty_count_before, stats.dirty_arenas
);
}
// =========================================================================
// Stress Tests for Arena Manager
//
// These tests exercise edge cases and boundary conditions including:
// - Allocation failures
// - Arena boundaries
// - Large allocations
// - Concurrent-like patterns (sequential stress)
// =========================================================================
#[test]
fn test_stress_many_small_allocations() {
let mut manager = TestArenaManager::with_arena_size(4096);
// Allocate many small items
let mut slots = Vec::new();
for i in 0..1000 {
let data = format!("item_{:04}", i);
let slot = manager
.allocate(data.as_bytes())
.expect("allocation should succeed");
slots.push((slot, data));
}
// Verify all allocations
for (slot, expected) in &slots {
let actual = manager.read(*slot).expect("read should succeed");
assert_eq!(
actual,
expected.as_bytes(),
"Data mismatch for slot {:?}",
slot
);
}
assert_eq!(manager.total_node_count(), 1000);
}
#[test]
fn test_stress_varying_sizes() {
let mut manager = TestArenaManager::with_arena_size(4096);
// Allocate items of varying sizes
let sizes = [1, 10, 50, 100, 200, 500, 1000, 16, 32, 64, 128, 256];
let mut slots = Vec::new();
for (i, &size) in sizes.iter().cycle().take(100).enumerate() {
let data: Vec<u8> = (0..size).map(|j| ((i * 7 + j) % 256) as u8).collect();
let slot = manager.allocate(&data).expect("allocation should succeed");
slots.push((slot, data));
}
// Verify all allocations
for (slot, expected) in &slots {
let actual = manager.read(*slot).expect("read should succeed");
assert_eq!(
actual,
expected.as_slice(),
"Data mismatch for slot {:?}",
slot
);
}
}
#[test]
fn test_stress_arena_boundary_crossing() {
// Use small arena to ensure many boundary crossings
let mut manager = TestArenaManager::with_arena_size(256);
let mut slots = Vec::new();
// Fill multiple arenas
for i in 0..500 {
let data = format!("boundary_test_{:04}", i);
let slot = manager
.allocate(data.as_bytes())
.expect("allocation should succeed");
slots.push((slot, data));
}
// Should have created many arenas
assert!(
manager.arena_count() > 10,
"Expected many arenas, got {}",
manager.arena_count()
);
// Verify all data is still accessible across arenas
for (slot, expected) in &slots {
let actual = manager.read(*slot).expect("read should succeed");
assert_eq!(actual, expected.as_bytes());
}
}
#[test]
fn test_arena_slot_boundary_values() {
// Test slot encoding/decoding with boundary values
let test_cases = [
(0, 0),
(0, u32::MAX),
(u32::MAX, 0),
(u32::MAX, u32::MAX),
(1, 1),
(1000000, 1000000),
];
for (arena_id, slot_id) in test_cases {
let slot = ArenaSlot::new(arena_id, slot_id);
let encoded = slot.to_u64();
let decoded = ArenaSlot::from_u64(encoded);
assert_eq!(
decoded.arena_id, arena_id,
"Arena ID mismatch for {:?}",
slot
);
assert_eq!(decoded.slot_id, slot_id, "Slot ID mismatch for {:?}", slot);
}
}
#[test]
fn test_flush_config_boundary_values() {
// Test threshold clamping
let config = FlushConfig::default().with_threshold(-0.5);
assert_eq!(config.full_arena_threshold, 0.0);
let config = FlushConfig::default().with_threshold(1.5);
assert_eq!(config.full_arena_threshold, 1.0);
let config = FlushConfig::default().with_threshold(0.75);
assert_eq!(config.full_arena_threshold, 0.75);
}
#[test]
fn test_flush_stats_calculation() {
// Test FlushStats::full_flush calculation
let stats = FlushStats::full_flush(5, 4096);
assert_eq!(stats.full_arena_writes, 5);
assert_eq!(stats.partial_writes, 0);
assert_eq!(stats.bytes_written, 5 * 4096);
assert_eq!(stats.bytes_saved, 0);
}
#[test]
fn test_arena_stats_edge_cases() {
// Empty manager
let manager = TestArenaManager::new();
let stats = manager.stats();
assert_eq!(stats.node_count, 0);
assert_eq!(stats.arena_count, 1); // Always starts with one arena
// Single allocation
let mut manager = TestArenaManager::new();
manager.allocate(&[1, 2, 3]).unwrap();
let stats = manager.stats();
assert_eq!(stats.node_count, 1);
assert!(stats.total_used > 3); // At least the data plus metadata
}
#[test]
fn test_reserve_exact_arena_capacity() {
// Create a small arena
let mut manager = TestArenaManager::with_arena_size(512);
// Try to reserve exactly as many slots as can fit
// This should succeed by creating a new arena if needed
let reserved = manager.reserve_slots(5);
assert!(reserved.is_ok());
}
#[test]
fn test_reserve_slots_one() {
let mut manager = TestArenaManager::new();
// Reserving one slot should succeed
let mut reserved = manager.reserve_slots(1).unwrap();
assert_eq!(reserved.count, 1);
assert!(!reserved.is_complete());
// Allocate into it
let slot = manager.allocate_reserved(&mut reserved, b"data").unwrap();
assert!(reserved.is_complete());
// Verify data
assert_eq!(manager.read(slot).unwrap(), b"data");
}
#[test]
fn test_reservation_tracking() {
let mut manager = TestArenaManager::with_arena_size(1024);
// Reserve some slots and track their state
let reserved = manager.reserve_slots(3).unwrap();
assert_eq!(reserved.count, 3);
assert_eq!(reserved.remaining(), 3);
assert!(!reserved.is_complete());
}
#[test]
fn test_large_data_allocation() {
let mut manager = TestArenaManager::with_arena_size(4096);
// Allocate data that fills most of a slot
let large_data = vec![0u8; 2000];
let slot = manager.allocate(&large_data).expect("should succeed");
// Verify data integrity
let read_back = manager.read(slot).expect("read should succeed");
assert_eq!(read_back, large_data.as_slice());
}
#[test]
fn test_dirty_state_after_allocation() {
let mut manager = TestArenaManager::new();
// Arena should be marked dirty after allocation
manager.allocate(b"test data").unwrap();
assert!(manager.arenas[0].is_dirty());
}
#[test]
fn test_dirty_tracker_stats_when_disabled() {
let manager = TestArenaManager::new();
// Without enabling slot tracking, stats should return None
assert!(manager.dirty_tracker_stats().is_none());
}
#[test]
fn test_dirty_tracker_stats_when_enabled() {
let mut manager = TestArenaManager::new();
manager.enable_slot_tracking();
let stats = manager.dirty_tracker_stats();
assert!(stats.is_some());
let stats = stats.unwrap();
// Check dirty_arenas instead of total_arenas
// Initially the first arena should be tracked
assert!(stats.dirty_arenas >= 0);
}
#[test]
fn test_multiple_enable_slot_tracking_calls() {
let mut manager = TestArenaManager::new();
// Enable multiple times should be idempotent
manager.enable_slot_tracking();
manager.enable_slot_tracking();
manager.enable_slot_tracking();
// Should still work correctly
let stats = manager.dirty_tracker_stats();
assert!(stats.is_some());
}
#[test]
fn test_with_large_arena_size() {
// Large arena works normally
let mut manager = TestArenaManager::with_arena_size(1024 * 1024);
let slot = manager.allocate(&[4, 5, 6]).unwrap();
assert_eq!(manager.read(slot).unwrap(), &[4, 5, 6]);
}
#[test]
fn test_sequential_reserved_allocations() {
let mut manager = TestArenaManager::with_arena_size(4096);
// Reserve slots
let mut reserved = manager.reserve_slots(3).unwrap();
// Fill reserved slots sequentially
let slot1 = manager.allocate_reserved(&mut reserved, b"data1").unwrap();
let slot2 = manager.allocate_reserved(&mut reserved, b"data2").unwrap();
let slot3 = manager.allocate_reserved(&mut reserved, b"data3").unwrap();
assert!(reserved.is_complete());
// All data should be readable
assert_eq!(manager.read(slot1).unwrap(), b"data1");
assert_eq!(manager.read(slot2).unwrap(), b"data2");
assert_eq!(manager.read(slot3).unwrap(), b"data3");
// Slots should be consecutive
assert_eq!(slot1.slot_id + 1, slot2.slot_id);
assert_eq!(slot2.slot_id + 1, slot3.slot_id);
}
}