Github/littlefs
1
Fork 0
Code Actions Activity

tests: Consistently align LOOKAHEAD_SIZE in tests

Browse Source
This commit is contained in:
Christopher Haster
2025-05-15 13:44:07 -05:00
parent e12c621fad
commit a3710d1d96
3 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files
tests/test_badblocks.toml
+3 -3
View File
@@ -31,7 +31,7 @@ defines.BADBLOCK_BEHAVIOR = [
defines.CKPROGS = 'BADBLOCK_BEHAVIOR >= LFS_EMUBD_BADBLOCK_READERROR' defines.CKPROGS = 'BADBLOCK_BEHAVIOR >= LFS_EMUBD_BADBLOCK_READERROR'
defines.N = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512] defines.N = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512]
# maximize lookahead buffer to avoid alloc scans # maximize lookahead buffer to avoid alloc scans
defines.LOOKAHEAD_SIZE = 'lfs_alignup(BLOCK_COUNT / 8, 8)' defines.LOOKAHEAD_SIZE = '(BLOCK_COUNT+8-1) / 8'
defines.SEED = 42 defines.SEED = 42
fuzz = 'SEED' fuzz = 'SEED'
if = 'LFS_IFDEF_CKPROGS(true, !CKPROGS)' if = 'LFS_IFDEF_CKPROGS(true, !CKPROGS)'
@@ -1985,7 +1985,7 @@ defines.CKPROGS = 'BADBLOCK_BEHAVIOR >= LFS_EMUBD_BADBLOCK_READERROR'
defines.MIRROR = [false, true] defines.MIRROR = [false, true]
defines.N = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512] defines.N = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512]
# maximize lookahead buffer to avoid alloc scans # maximize lookahead buffer to avoid alloc scans
defines.LOOKAHEAD_SIZE = 'lfs_alignup(BLOCK_COUNT / 8, 8)' defines.LOOKAHEAD_SIZE = '(BLOCK_COUNT+8-1) / 8'
defines.SEED = 42 defines.SEED = 42
fuzz = 'SEED' fuzz = 'SEED'
if = 'LFS_IFDEF_CKPROGS(true, !CKPROGS)' if = 'LFS_IFDEF_CKPROGS(true, !CKPROGS)'
@@ -3942,7 +3942,7 @@ defines.CKPROGS = 'BADBLOCK_BEHAVIOR >= LFS_EMUBD_BADBLOCK_READERROR'
defines.MIRROR = [false, true] defines.MIRROR = [false, true]
defines.N = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512] defines.N = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512]
# maximize lookahead buffer to avoid alloc scans # maximize lookahead buffer to avoid alloc scans
defines.LOOKAHEAD_SIZE = 'lfs_alignup(BLOCK_COUNT / 8, 8)' defines.LOOKAHEAD_SIZE = '(BLOCK_COUNT+8-1) / 8'
defines.SEED = 42 defines.SEED = 42
fuzz = 'SEED' fuzz = 'SEED'
if = 'LFS_IFDEF_CKPROGS(true, !CKPROGS)' if = 'LFS_IFDEF_CKPROGS(true, !CKPROGS)'
tests/test_btree.toml
+1 -1
View File
@@ -3,7 +3,7 @@ after = 'test_rbyd'
# maximize lookahead buffer, we don't actually gc so we only get one pass # maximize lookahead buffer, we don't actually gc so we only get one pass
# of the disk for these tests # of the disk for these tests
defines.LOOKAHEAD_SIZE = 'lfs_alignup(BLOCK_COUNT / 8, 8)' defines.LOOKAHEAD_SIZE = '(BLOCK_COUNT+8-1) / 8'
# test an empty tree # test an empty tree
[cases.test_btree_zero] [cases.test_btree_zero]
tests/test_mtree.toml
+1 -1
View File
@@ -3,7 +3,7 @@ after = ['test_rbyd', 'test_btree']
# maximize lookahead buffer, we don't actually gc so we only get one pass # maximize lookahead buffer, we don't actually gc so we only get one pass
# of the disk for these tests # of the disk for these tests
defines.LOOKAHEAD_SIZE = 'BLOCK_COUNT / 8' defines.LOOKAHEAD_SIZE = '(BLOCK_COUNT+8-1) / 8'
# test with normal revision counts, debug revision counts, and noisy # test with normal revision counts, debug revision counts, and noisy
# revision counts # revision counts