Github/littlefs
1
Fork 0
Code Actions Activity

Renamed tests/benches such that order is logical

Browse Source 
It doesn't make sense to test more complex logic, such as t2_btree.toml,
when the logic it is built on, t1_rbyd.toml, does not past testing. The
test runner already guarantees a consistent lexicographic order, so all
we need to do is renamed these from test_* -> tn_*.

Note, if we every have more than 10 tests, we will need to bump up the
number of digits for all tests, so t1_rbyd.toml -> t01_rbyd.toml. This
is the main downside of lexicographic ordering. But we'll cross that
bridge when we get to it.
This commit is contained in:
Christopher Haster
2023-06-30 03:08:27 -05:00
parent 938cee1640
commit 2fe2078f50
8 changed files with 216 additions and 216 deletions
Download Patch File Download Diff File Expand all files Collapse all files
benches/bench_rbyd.toml → benches/b1_rbyd.toml
+10 -10
View File
@@ -5,7 +5,7 @@
# abstraction level
defines.BLOCK_SIZE = 'DISK_SIZE'
[cases.bench_rbyd_attr_commit]
[cases.b1_rbyd_attr_commit]
# 0 = in-order
# 1 = reversed-order
# 2 = random-order
@@ -62,7 +62,7 @@ code = '''
lfsr_rbyd_fetch(&lfs, &rbyd, rbyd.block, cfg->block_size) => 0;
'''
[cases.bench_rbyd_attr_fetch]
[cases.b1_rbyd_attr_fetch]
# 0 = in-order
# 1 = reversed-order
# 2 = random-order
@@ -119,7 +119,7 @@ code = '''
BENCH_STOP();
'''
[cases.bench_rbyd_attr_lookup]
[cases.b1_rbyd_attr_lookup]
# 0 = in-order
# 1 = reversed-order
# 2 = random-order
@@ -183,7 +183,7 @@ code = '''
BENCH_STOP();
'''
[cases.bench_rbyd_attr_append]
[cases.b1_rbyd_attr_append]
# 0 = in-order
# 1 = reversed-order
# 2 = random-order
@@ -249,7 +249,7 @@ code = '''
assert(memcmp(buffer, "\xbb\xbb\xbb\xbb", 4) == 0);
'''
[cases.bench_rbyd_attr_remove]
[cases.b1_rbyd_attr_remove]
# 0 = in-order
# 1 = reversed-order
# 2 = random-order
@@ -314,7 +314,7 @@ code = '''
=> LFS_ERR_NOENT;
'''
[cases.bench_rbyd_id_commit]
[cases.b1_rbyd_id_commit]
# 0 = in-order
# 1 = reversed-order
# 2 = random-order
@@ -367,7 +367,7 @@ code = '''
lfsr_rbyd_fetch(&lfs, &rbyd, rbyd.block, cfg->block_size) => 0;
'''
[cases.bench_rbyd_id_fetch]
[cases.b1_rbyd_id_fetch]
# 0 = in-order
# 1 = reversed-order
# 2 = random-order
@@ -420,7 +420,7 @@ code = '''
BENCH_STOP();
'''
[cases.bench_rbyd_id_lookup]
[cases.b1_rbyd_id_lookup]
# 0 = in-order
# 1 = reversed-order
# 2 = random-order
@@ -478,7 +478,7 @@ code = '''
BENCH_STOP();
'''
[cases.bench_rbyd_id_create]
[cases.b1_rbyd_id_create]
# 0 = in-order
# 1 = reversed-order
# 2 = random-order
@@ -539,7 +539,7 @@ code = '''
assert(memcmp(buffer, "\xbb\xbb\xbb\xbb", 4) == 0);
'''
[cases.bench_rbyd_id_delete]
[cases.b1_rbyd_id_delete]
# 0 = in-order
# 1 = reversed-order
# 2 = random-order
benches/bench_btree.toml → benches/b2_btree.toml
+2 -2
View File
@@ -3,7 +3,7 @@
# of the disk for these tests
defines.LOOKAHEAD_SIZE = 'BLOCK_COUNT / 8'
[cases.bench_btree_lookup]
[cases.b2_btree_lookup]
defines.N = [8, 16, 32, 64, 128, 256, 1024]
# 0 = in-order
# 1 = reversed-order
@@ -53,7 +53,7 @@ code = '''
BENCH_STOP();
'''
[cases.bench_btree_commit]
[cases.b2_btree_commit]
defines.N = [8, 16, 32, 64, 128, 256, 1024]
# 0 = in-order
# 1 = reversed-order
benches/bench_mtree.toml → benches/b3_mtree.toml
+3 -3
View File
@@ -3,7 +3,7 @@
# of the disk for these tests
defines.LOOKAHEAD_SIZE = 'BLOCK_COUNT / 8'
[cases.bench_mtree_lookup]
[cases.b3_mtree_lookup]
defines.N = [8, 16, 32, 64, 128, 256, 1024]
# 0 = in-order
# 1 = reversed-order
@@ -64,7 +64,7 @@ code = '''
lfsr_unmount(&lfs) => 0;
'''
[cases.bench_mtree_commit]
[cases.b3_mtree_commit]
defines.N = [8, 16, 32, 64, 128, 256, 1024]
# 0 = in-order
# 1 = reversed-order
@@ -136,7 +136,7 @@ code = '''
lfsr_unmount(&lfs) => 0;
'''
[cases.bench_mtree_traversal]
[cases.b3_mtree_traversal]
defines.N = [8, 16, 32, 64, 128, 256, 1024]
# 0 = in-order
# 1 = reversed-order