Github/littlefs
1
Fork 0
Code Actions Activity

Reverted attempted per-btree leaf caches

Browse Source 
See the relevant commit for why. These just added surprisingly little
performance benefit for the code/stack cost.

Maybe in a future performance-preferring littlefs driver.
This commit is contained in:
Christopher Haster
2025-05-24 18:49:38 -05:00
parent a49e13b992
commit a1c90d2624
7 changed files with 726 additions and 782 deletions
Download Patch File Download Diff File Expand all files Collapse all files
tests/test_badblocks.toml
+12 -12
View File
@@ -98,10 +98,10 @@ code = '''
}
printf("]\n");
printf("btree: w%d 0x%x.%x\n",
lfsr_btree_weight(&btree),
lfsr_btree_block(&btree),
lfsr_btree_trunk(&btree));
assert(lfsr_btree_weight(&btree) == sim_size);
btree.weight,
btree.blocks[0],
btree.trunk);
assert(btree.weight == sim_size);
uint8_t buffer[4];
lfsr_bid_t bid_;
@@ -2053,10 +2053,10 @@ code = '''
}
printf("]\n");
printf("btree: w%d 0x%x.%x\n",
lfsr_btree_weight(&btree),
lfsr_btree_block(&btree),
lfsr_btree_trunk(&btree));
assert(lfsr_btree_weight(&btree) == sim_size);
btree.weight,
btree.blocks[0],
btree.trunk);
assert(btree.weight == sim_size);
uint8_t buffer[4];
lfsr_bid_t bid_;
@@ -4010,10 +4010,10 @@ code = '''
}
printf("]\n");
printf("btree: w%d 0x%x.%x\n",
lfsr_btree_weight(&btree),
lfsr_btree_block(&btree),
lfsr_btree_trunk(&btree));
assert(lfsr_btree_weight(&btree) == sim_size);
btree.weight,
btree.blocks[0],
btree.trunk);
assert(btree.weight == sim_size);
uint8_t buffer[4];
lfsr_bid_t bid_;