bmap: Added low-level bmap set algorithm and related tests

The neat thing about the on-disk bmap is that it's a range tree. We can
leverage order-statistic properties to compactly represent ranges of
similar blocks.

However, this does make updating the bmap slightly more complicated...
This commit is contained in:
Christopher Haster
2025-07-25 13:12:54 -05:00
parent 98f016b07e
commit 732d6079e3
3 changed files with 551 additions and 10 deletions
+1 -1
View File
@@ -7,7 +7,7 @@
# since you can usually ignore allocator issues temporarily by making the test
# device really big
#
after = ['test_mtree', 'test_dirs', 'test_files']
after = ['test_mtree', 'test_bmap', 'test_dirs', 'test_files']
# test that we can alloc
[cases.test_alloc_alloc]