Github/littlefs
1
Fork 0
Code Actions Activity

Simplified fragment coalescing bounds logic

Browse Source 
I think these were copied from the initial fragment slice calculation,
but we're already checking for <=fragment_size, so the extra lfs3_min is
unnecessary.

Saves a bit of code:

           code          stack          ctx
  before: 36952           2376          652
  after:  36944 (-0.0%)   2384 (+0.3%)  652 (+0.0%)

Not sure why this added stack, compiler noise?
This commit is contained in:
Christopher Haster
2025-07-16 13:25:34 -05:00
parent 2d10a61732
commit 7b7dbae1df
1 changed files with 1 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files
lfs3.c
+1 -7
View File
@@ -13211,9 +13211,6 @@ fragment:;
fragment_start - (bid-(weight-1)));
fragment_start = bid-(weight-1);
fragment_end = fragment_start + lfs3_min(
fragment_end - (bid-(weight-1)),
lfs3->cfg->fragment_size);
}
}
@@ -13248,10 +13245,7 @@ fragment:;
bid-(weight-1) + lfs3_bptr_size(&bptr)
- fragment_end);
fragment_end = fragment_start + lfs3_min(
bid-(weight-1) + lfs3_bptr_size(&bptr)
- fragment_start,
lfs3->cfg->fragment_size);
fragment_end = bid-(weight-1) + lfs3_bptr_size(&bptr);
}
}