Github/littlefs
1
Fork 0
Code Actions Activity

Renamed lfs_alloc_ack -> lfs_alloc_ckpoint

Browse Source 
This name describes this operation ever so slightly better, I've already
been refering to this as "checkpointing the allocator" places.
This commit is contained in:
Christopher Haster
2023-12-06 21:11:11 -06:00
parent 43270ed50f
commit 3a6afaf1c5
5 changed files with 122 additions and 122 deletions
Download Patch File Download Diff File Expand all files Collapse all files
tests/test_alloc.toml
+3 -3
View File
@@ -23,7 +23,7 @@ code = '''
lfsr_mount(&lfs, CFG) => 0;
// start allocating
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
lfs_size_t alloced = 0;
while (true) {
lfs_block_t block;
@@ -56,7 +56,7 @@ code = '''
lfsr_mount(&lfs, CFG) => 0;
// start allocating
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
lfs_size_t alloced = 0;
while (true) {
lfs_block_t block;
@@ -78,7 +78,7 @@ code = '''
assert(alloced == BLOCK_COUNT-2);
// ack again, effectively releasing all the previously alloced blocks
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
alloced = 0;
while (true) {
lfs_block_t block;
tests/test_btree.toml
+50 -50
View File
@@ -113,7 +113,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create an empty tree
lfsr_btree_t btree;
@@ -145,7 +145,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a single-entry tree
lfsr_btree_t btree;
@@ -185,7 +185,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a two-entry tree
lfsr_btree_t btree;
@@ -232,7 +232,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a two-entry tree
lfsr_btree_t btree;
@@ -280,7 +280,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a two-entry tree
lfsr_btree_t btree;
@@ -335,7 +335,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a two-entry tree
lfsr_btree_t btree;
@@ -393,7 +393,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a tree with N elements
lfsr_btree_t btree;
@@ -446,7 +446,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a tree with N elements
lfsr_btree_t btree;
@@ -502,7 +502,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a btree
lfsr_btree_t btree;
@@ -586,7 +586,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a tree with N elements
lfsr_btree_t btree;
@@ -659,7 +659,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a btree
lfsr_btree_t btree;
@@ -798,7 +798,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a single-entry tree
lfsr_btree_t btree;
@@ -840,7 +840,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a two-entry tree
lfsr_btree_t btree;
@@ -892,7 +892,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a two-entry tree
lfsr_btree_t btree;
@@ -955,7 +955,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a tree with N elements
lfsr_btree_t btree;
@@ -1030,7 +1030,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a btree
lfsr_btree_t btree;
@@ -1125,7 +1125,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a tree with N elements
lfsr_btree_t btree;
@@ -1216,7 +1216,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a btree
lfsr_btree_t btree;
@@ -1366,7 +1366,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a single-entry tree
lfsr_btree_t btree;
@@ -1420,7 +1420,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a single-entry tree
lfsr_btree_t btree;
@@ -1488,7 +1488,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a single-entry tree
lfsr_btree_t btree;
@@ -1556,7 +1556,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a single-entry tree
lfsr_btree_t btree;
@@ -1641,7 +1641,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a tree with N elements
lfsr_btree_t btree;
@@ -1733,7 +1733,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a tree with N elements
lfsr_btree_t btree;
@@ -1827,7 +1827,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a btree
lfsr_btree_t btree;
@@ -1925,7 +1925,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a tree with N elements
lfsr_btree_t btree;
@@ -2046,7 +2046,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a btree
lfsr_btree_t btree;
@@ -2206,7 +2206,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a tree with N elements
lfsr_btree_t btree;
@@ -2266,7 +2266,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a btree
lfsr_btree_t btree;
@@ -2355,7 +2355,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a tree with N elements
lfsr_btree_t btree;
@@ -2416,7 +2416,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a btree
lfsr_btree_t btree;
@@ -2590,7 +2590,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a tree
lfsr_btree_t btree;
@@ -2653,7 +2653,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a tree
lfsr_btree_t btree;
@@ -2719,7 +2719,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a tree
lfsr_btree_t btree;
@@ -2780,7 +2780,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a tree
lfsr_btree_t btree;
@@ -2853,7 +2853,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a btree
lfsr_btree_t btree;
@@ -2971,7 +2971,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a btree
lfsr_btree_t btree;
@@ -3143,7 +3143,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a zero-entry tree
lfsr_btree_t btree;
@@ -3177,7 +3177,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a single-entry tree
lfsr_btree_t btree;
@@ -3229,7 +3229,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a two-entry tree
lfsr_btree_t btree;
@@ -3293,7 +3293,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a two-entry tree
lfsr_btree_t btree;
@@ -3369,7 +3369,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a two-entry tree
lfsr_btree_t btree;
@@ -3446,7 +3446,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a tree with N elements
lfsr_btree_t btree;
@@ -3520,7 +3520,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a btree
lfsr_btree_t btree;
@@ -3633,7 +3633,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a tree with N elements
lfsr_btree_t btree;
@@ -3708,7 +3708,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a btree
lfsr_btree_t btree;
@@ -3862,7 +3862,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a btree
lfsr_btree_t btree;
@@ -4032,7 +4032,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a btree
lfsr_btree_t btree;
@@ -4245,7 +4245,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a tree with N elements
lfsr_btree_t btree;
@@ -4371,7 +4371,7 @@ code = '''
lfs.lookahead.size = lfs_min(8*CFG->lookahead_size,
CFG->block_count);
lfs.lookahead.next = 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create a btree
lfsr_btree_t btree;
tests/test_mtree.toml
+47 -47
View File
@@ -38,7 +38,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
for (lfs_size_t i = 0; i < N; i++) {
lfsr_mdir_commit(&lfs, &lfs.mroot, LFSR_ATTRS(
@@ -77,7 +77,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
for (lfs_size_t i = 0; i < N; i++) {
// force mroot to compact
@@ -119,7 +119,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
for (lfs_size_t i = 0; i < N; i++) {
lfsr_mdir_commit(&lfs, &lfs.mroot, LFSR_ATTRS(
@@ -161,7 +161,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// prepare mroot with a large attr so the next entry can not fit
uint8_t buffer[SIZE];
@@ -232,7 +232,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create 2 large entries that needs to be uninlined and split
uint8_t buffer[SIZE];
@@ -302,7 +302,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create an uninlined mdir
uint8_t buffer[SIZE];
@@ -401,7 +401,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create entries
lfsr_mdir_t mdir;
@@ -501,7 +501,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// at least keep track of the number of entries we expect
lfs_size_t count = 0;
@@ -620,7 +620,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create an uninlined mdir
uint8_t buffer[SIZE];
@@ -686,7 +686,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create an uninlined mdir
uint8_t buffer[SIZE];
@@ -755,7 +755,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create an uninlined mdir
uint8_t buffer[SIZE];
@@ -811,7 +811,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create an uninlined mdir
uint8_t buffer[SIZE];
@@ -903,7 +903,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create an uninlined mdir
uint8_t buffer[SIZE];
@@ -994,7 +994,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create an uninlined mdir
uint8_t buffer[SIZE];
@@ -1073,7 +1073,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// at least keep track of the number of entries we expect
lfs_size_t count = 0;
@@ -1218,7 +1218,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// prepare mroot with a large attr so the next entry can not fit
uint8_t buffer[SIZE];
@@ -1310,7 +1310,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create 2 large entries that needs to be uninlined and split
uint8_t buffer[SIZE];
@@ -1401,7 +1401,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create 2 large entries that needs to be uninlined and split
uint8_t buffer[SIZE];
@@ -1492,7 +1492,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// prepare mroot with an attr
uint8_t buffer[SIZE];
@@ -1548,7 +1548,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// prepare mroot with an attr
uint8_t buffer[SIZE];
@@ -1603,7 +1603,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// prepare mroot with an attr
uint8_t buffer[SIZE];
@@ -1667,7 +1667,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// prepare mroot with a large attr so the next entry can not fit
uint8_t buffer[SIZE];
@@ -1770,7 +1770,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create an uninlined mdir
uint8_t buffer[SIZE];
@@ -1880,7 +1880,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create an uninlined mdir
uint8_t buffer[SIZE];
@@ -1959,7 +1959,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// force mroot to compact once, so the second compact below will trigger
// a relocation
@@ -2044,7 +2044,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// force mroot to compact once, so the second compact below will trigger
// a relocation
@@ -2131,7 +2131,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// at least keep track of the number of entries we expect
lfs_size_t count = 0;
@@ -2284,7 +2284,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// setup our neighbors
lfsr_mdir_commit(&lfs, &lfs.mroot, LFSR_ATTRS(
@@ -2331,7 +2331,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// setup our neighbors
lfsr_mdir_commit(&lfs, &lfs.mroot, LFSR_ATTRS(
@@ -2371,7 +2371,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// setup our neighbors
lfsr_mdir_commit(&lfs, &lfs.mroot, LFSR_ATTRS(
@@ -2413,7 +2413,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// setup our neighbors
lfsr_mdir_commit(&lfs, &lfs.mroot, LFSR_ATTRS(
@@ -2490,7 +2490,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// setup our neighbors
lfsr_mdir_commit(&lfs, &lfs.mroot, LFSR_ATTRS(
@@ -2562,7 +2562,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create an uninlined mdir
uint8_t buffer[SIZE];
@@ -2663,7 +2663,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// setup our neighbors
lfsr_mdir_commit(&lfs, &lfs.mroot, LFSR_ATTRS(
@@ -2726,7 +2726,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create an uninlined mdir
uint8_t buffer[SIZE];
@@ -2818,7 +2818,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
//// create a situation where we have 3 mdirs in our tree
@@ -2910,7 +2910,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
//// create a situation where we have 3 mdirs in our tree
@@ -2998,7 +2998,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// insert a new entry, this should update our neighbors
lfsr_mdir_commit(&lfs, &lfs.mroot, LFSR_ATTRS(
@@ -3089,7 +3089,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// prepare mroot with a large attr so the next entry can not fit
uint8_t buffer[SIZE];
@@ -3213,7 +3213,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create 2 large entries that needs to be uninlined and split
uint8_t buffer[SIZE];
@@ -3341,7 +3341,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// prepare mroot with an attr
uint8_t buffer[SIZE];
@@ -3447,7 +3447,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create entries
lfsr_mdir_t mdir;
@@ -3599,7 +3599,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// at least keep track of the number of entries we expect
lfs_size_t count = 0;
@@ -3769,7 +3769,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
uint8_t buf[LFSR_MPTR_DSIZE];
lfsr_mdir_commit(&lfs, &lfs.mroot, LFSR_ATTRS(
@@ -3843,7 +3843,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// prepare mroot with an attr
uint8_t buffer[SIZE];
@@ -3897,7 +3897,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// prepare mroot with an attr
uint8_t buffer[SIZE];
@@ -3954,7 +3954,7 @@ code = '''
lfs_t lfs;
lfsr_format(&lfs, CFG) => 0;
lfsr_mount(&lfs, CFG) => 0;
lfs_alloc_ack(&lfs);
lfs_alloc_ckpoint(&lfs);
// create entries
lfsr_mdir_t mdir;