Replaced tn/bn prefixes with an actual dependency system in tests/benches

The previous system of relying on test name prefixes for ordering was
simple, but organizing tests by dependencies and topologically sorting
during compilation is 1. more flexible and 2. simplifies test names,
which get typed a lot.

Note these are not "hard" dependencies, each test suite should work fine
in isolation. These "after" dependencies just hint an ordering when all
tests are ran.

As such, it's worth noting the tests should NOT error of a dependency is
missing. This unfortunately makes it a bit hard to catch typos, but
allows faster compilation of a subset of tests.

---

To make this work the way tests are linked has changed from using custom
linker section (fun linker magic!) to a weakly linked array appended to
every source file (also fun linker magic!).

At least with this method test.py has strict control over the test
ordering, and doesn't depend on 1. the order in which the linker merges
sections, and 2. the order tests are passed to test.py. I didn't realize
the previous system was so fragile.

benches/bench_btree.toml

@@ -1,9 +1,11 @@
+# Bench our mid-level B-trees
+after = 'bench_rbyd'
 
 # maximize lookahead buffer, we don't actually gc so we only get one pass
 # of the disk for these tests
 defines.LOOKAHEAD_SIZE = 'BLOCK_COUNT / 8'
 
-[cases.b2_btree_lookup]
+[cases.bench_btree_lookup]
 defines.N = [8, 16, 32, 64, 128, 256, 1024]
 # 0 = in-order
 # 1 = reversed-order
@@ -53,7 +55,7 @@ code = '''
     BENCH_STOP();
 '''
 
-[cases.b2_btree_commit]
+[cases.bench_btree_commit]
 defines.N = [8, 16, 32, 64, 128, 256, 1024]
 # 0 = in-order
 # 1 = reversed-order

benches/bench_mtree.toml

@@ -1,9 +1,11 @@
+# Bench our high-level metadata tree in the core of littlefs
+after = ['bench_rbyd', 'bench_btree']
 
 # maximize lookahead buffer, we don't actually gc so we only get one pass
 # of the disk for these tests
 defines.LOOKAHEAD_SIZE = 'BLOCK_COUNT / 8'
 
-[cases.b3_mtree_lookup]
+[cases.bench_mtree_lookup]
 defines.N = [8, 16, 32, 64, 128, 256, 1024]
 # 0 = in-order
 # 1 = reversed-order
@@ -64,7 +66,7 @@ code = '''
     lfsr_unmount(&lfs) => 0;
 '''
 
-[cases.b3_mtree_commit]
+[cases.bench_mtree_commit]
 defines.N = [8, 16, 32, 64, 128, 256, 1024]
 # 0 = in-order
 # 1 = reversed-order
@@ -136,7 +138,7 @@ code = '''
     lfsr_unmount(&lfs) => 0;
 '''
 
-[cases.b3_mtree_traversal]
+[cases.bench_mtree_traversal]
 defines.N = [8, 16, 32, 64, 128, 256, 1024]
 # 0 = in-order
 # 1 = reversed-order

benches/bench_rbyd.toml

@@ -1,11 +1,11 @@
-
+# Bench our low-level rbyd data-structure
 
 # set block_size to the full size of disk so we can test arbitrarily
 # large rbyd trees, we don't really care about block sizes at this
 # abstraction level
 defines.BLOCK_SIZE = 'DISK_SIZE'
 
-[cases.b1_rbyd_attr_commit]
+[cases.bench_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.b1_rbyd_attr_fetch]
+[cases.bench_rbyd_attr_fetch]
 # 0 = in-order
 # 1 = reversed-order
 # 2 = random-order
@@ -119,7 +119,7 @@ code = '''
     BENCH_STOP();
 '''
 
-[cases.b1_rbyd_attr_lookup]
+[cases.bench_rbyd_attr_lookup]
 # 0 = in-order
 # 1 = reversed-order
 # 2 = random-order
@@ -183,7 +183,7 @@ code = '''
     BENCH_STOP();
 '''
 
-[cases.b1_rbyd_attr_append]
+[cases.bench_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.b1_rbyd_attr_remove]
+[cases.bench_rbyd_attr_remove]
 # 0 = in-order
 # 1 = reversed-order
 # 2 = random-order
@@ -314,7 +314,7 @@ code = '''
             => LFS_ERR_NOENT;
 '''
 
-[cases.b1_rbyd_id_commit]
+[cases.bench_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.b1_rbyd_id_fetch]
+[cases.bench_rbyd_id_fetch]
 # 0 = in-order
 # 1 = reversed-order
 # 2 = random-order
@@ -420,7 +420,7 @@ code = '''
     BENCH_STOP();
 '''
 
-[cases.b1_rbyd_id_lookup]
+[cases.bench_rbyd_id_lookup]
 # 0 = in-order
 # 1 = reversed-order
 # 2 = random-order
@@ -478,7 +478,7 @@ code = '''
     BENCH_STOP();
 '''
 
-[cases.b1_rbyd_id_create]
+[cases.bench_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.b1_rbyd_id_delete]
+[cases.bench_rbyd_id_delete]
 # 0 = in-order
 # 1 = reversed-order
 # 2 = random-order