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_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;