From 7b7dbae1df560370bd632d96a03c4cf9d31c5419 Mon Sep 17 00:00:00 2001 From: Christopher Haster Date: Wed, 16 Jul 2025 13:25:34 -0500 Subject: [PATCH] Simplified fragment coalescing bounds logic 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? --- lfs3.c | 8 +------- 1 file changed, 1 insertion(+), 7 deletions(-) diff --git a/lfs3.c b/lfs3.c index b66089cc..32a97a47 100644 --- a/lfs3.c +++ b/lfs3.c @@ -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); } }