| Message ID | 159311835912.1065505.9943855193663354771.stgit@magnolia (mailing list archive) |
|---|---|
| State | Superseded |
| Headers | show |
| Series | xfs_repair: more fixes | expand |
On Thu, Jun 25, 2020 at 01:52:39PM -0700, Darrick J. Wong wrote: > From: Darrick J. Wong <darrick.wong@oracle.com> > > In commit 9851fd79bfb1, we added a slight amount of slack to the free > space btrees being reconstructed so that the initial fix_freelist call > (which is run against a totally empty AGFL) would never have to split > either free space btree in order to populate the free list. > > The new btree bulk loading code in xfs_repair can re-create this > situation because it can set the slack values to zero if the filesystem > is very full. However, these days repair has the infrastructure needed > to ensure that overestimations of the btree block counts end up on the > AGFL or get freed back into the filesystem at the end of phase 5. > > Fix this problem by reserving blocks to a separate AGFL block > reservation, and checking that between this new reservation and any > overages in the bnobt/cntbt fakeroots, we have enough blocks sitting > around to populate the AGFL with the minimum number of blocks it needs > to handle a split in the bno/cnt/rmap btrees. > > Note that we reserve blocks for the new bnobt/cntbt/AGFL at the very end > of the reservation steps in phase 5, so the extra allocation should not > cause repair to fail if it can't find blocks for btrees. > > Fixes: 9851fd79bfb1 ("repair: AGFL rebuild fails if btree split required") > Signed-off-by: Darrick J. Wong <darrick.wong@oracle.com> > --- > repair/agbtree.c | 78 +++++++++++++++++++++++++++++++++++++++++++++++------- > 1 file changed, 68 insertions(+), 10 deletions(-) > > > diff --git a/repair/agbtree.c b/repair/agbtree.c > index 339b1489..7a4f316c 100644 > --- a/repair/agbtree.c > +++ b/repair/agbtree.c ... > @@ -262,25 +286,59 @@ _("Unable to compute free space by block btree geometry, error %d.\n"), -error); ... > + > + /* > + * Now try to fill the bnobt/cntbt cursors with extra blocks to > + * populate the AGFL. If we don't get all the blocks we want, > + * stop trying to fill the AGFL. > + */ > + wanted = (int64_t)btr_bno->bload.nr_blocks + > + (min_agfl_len / 2) - bno_blocks; > + if (wanted > 0 && fill_agfl) { > + got = reserve_agblocks(sc->mp, agno, btr_bno, wanted); > + if (wanted > got) > + fill_agfl = false; > + btr_bno->bload.nr_blocks += got; > + } > + > + wanted = (int64_t)btr_cnt->bload.nr_blocks + > + (min_agfl_len / 2) - cnt_blocks; > + if (wanted > 0 && fill_agfl) { > + got = reserve_agblocks(sc->mp, agno, btr_cnt, wanted); > + if (wanted > got) > + fill_agfl = false; > + btr_cnt->bload.nr_blocks += got; > + } It's a little hard to follow this with the nr_blocks sampling and whatnot, but I think I get the idea. What's the reason for splitting the AGFL res requirement evenly across the two cursors? These AGFL blocks all fall into the same overflow pool, right? I was wondering why we couldn't just attach the overflow to one, or check one for the full res and then the other if more blocks are needed. In thinking about it a bit more, wouldn't the whole algorithm be more simple if we reserved the min AGFL requirement first, optionally passed 'agfl_res' to reserve_btblocks() such that subsequent reservations can steal from it (and then fail if it depletes), then stuff what's left in one (or both, if there's a reason for that) of the cursors at the end? Brian > > /* Ok, now how many free space records do we have? */ > *nr_extents = count_bno_extents_blocks(agno, &num_freeblocks); > } while (1); > - > - *extra_blocks = (bno_blocks - btr_bno->bload.nr_blocks) + > - (cnt_blocks - btr_cnt->bload.nr_blocks); > } > > /* Rebuild the free space btrees. */ >
On Mon, Jun 29, 2020 at 08:22:28AM -0400, Brian Foster wrote: > On Thu, Jun 25, 2020 at 01:52:39PM -0700, Darrick J. Wong wrote: > > From: Darrick J. Wong <darrick.wong@oracle.com> > > > > In commit 9851fd79bfb1, we added a slight amount of slack to the free > > space btrees being reconstructed so that the initial fix_freelist call > > (which is run against a totally empty AGFL) would never have to split > > either free space btree in order to populate the free list. > > > > The new btree bulk loading code in xfs_repair can re-create this > > situation because it can set the slack values to zero if the filesystem > > is very full. However, these days repair has the infrastructure needed > > to ensure that overestimations of the btree block counts end up on the > > AGFL or get freed back into the filesystem at the end of phase 5. > > > > Fix this problem by reserving blocks to a separate AGFL block > > reservation, and checking that between this new reservation and any > > overages in the bnobt/cntbt fakeroots, we have enough blocks sitting > > around to populate the AGFL with the minimum number of blocks it needs > > to handle a split in the bno/cnt/rmap btrees. > > > > Note that we reserve blocks for the new bnobt/cntbt/AGFL at the very end > > of the reservation steps in phase 5, so the extra allocation should not > > cause repair to fail if it can't find blocks for btrees. > > > > Fixes: 9851fd79bfb1 ("repair: AGFL rebuild fails if btree split required") > > Signed-off-by: Darrick J. Wong <darrick.wong@oracle.com> > > --- > > repair/agbtree.c | 78 +++++++++++++++++++++++++++++++++++++++++++++++------- > > 1 file changed, 68 insertions(+), 10 deletions(-) > > > > > > diff --git a/repair/agbtree.c b/repair/agbtree.c > > index 339b1489..7a4f316c 100644 > > --- a/repair/agbtree.c > > +++ b/repair/agbtree.c > ... > > @@ -262,25 +286,59 @@ _("Unable to compute free space by block btree geometry, error %d.\n"), -error); > ... > > + > > + /* > > + * Now try to fill the bnobt/cntbt cursors with extra blocks to > > + * populate the AGFL. If we don't get all the blocks we want, > > + * stop trying to fill the AGFL. > > + */ > > + wanted = (int64_t)btr_bno->bload.nr_blocks + > > + (min_agfl_len / 2) - bno_blocks; > > + if (wanted > 0 && fill_agfl) { > > + got = reserve_agblocks(sc->mp, agno, btr_bno, wanted); > > + if (wanted > got) > > + fill_agfl = false; > > + btr_bno->bload.nr_blocks += got; > > + } > > + > > + wanted = (int64_t)btr_cnt->bload.nr_blocks + > > + (min_agfl_len / 2) - cnt_blocks; > > + if (wanted > 0 && fill_agfl) { > > + got = reserve_agblocks(sc->mp, agno, btr_cnt, wanted); > > + if (wanted > got) > > + fill_agfl = false; > > + btr_cnt->bload.nr_blocks += got; > > + } > > It's a little hard to follow this with the nr_blocks sampling and > whatnot, but I think I get the idea. What's the reason for splitting the > AGFL res requirement evenly across the two cursors? These AGFL blocks > all fall into the same overflow pool, right? I was wondering why we > couldn't just attach the overflow to one, or check one for the full res > and then the other if more blocks are needed. I chose to stuff the excess blocks into the bnobt and cntbt bulkload cursors to avoid having to initialize a semi-phony "bulkload cursor" for the agfl, and I decided to split them evenly between the two cursors so that I wouldn't have someday to deal with a bug report about how one cursor somehow ran out of blocks but the other one had plenty more. > In thinking about it a bit more, wouldn't the whole algorithm be more > simple if we reserved the min AGFL requirement first, optionally passed > 'agfl_res' to reserve_btblocks() such that subsequent reservations can > steal from it (and then fail if it depletes), then stuff what's left in > one (or both, if there's a reason for that) of the cursors at the end? Hmm. I hadn't thought about that. In general I wanted the AGFL reservations to go last because I'd rather we set off with an underfull AGFL than totally fail because we couldn't get blocks for the bnobt/cntbt, but I suppose you're right that we could steal from it as needed to prevent repair failure. So, uh, I could rework this patch to create a phony agfl bulk load cursor, fill it before the loop, steal blocks from it to fill the bnobt/cntbt to satisfy failed allocations, and then dump any remainders into the bnobt/cntbt cursors afterwards. How does that sound? --D > Brian > > > > > /* Ok, now how many free space records do we have? */ > > *nr_extents = count_bno_extents_blocks(agno, &num_freeblocks); > > } while (1); > > - > > - *extra_blocks = (bno_blocks - btr_bno->bload.nr_blocks) + > > - (cnt_blocks - btr_cnt->bload.nr_blocks); > > } > > > > /* Rebuild the free space btrees. */ > > >
On Mon, Jun 29, 2020 at 04:21:40PM -0700, Darrick J. Wong wrote: > On Mon, Jun 29, 2020 at 08:22:28AM -0400, Brian Foster wrote: > > On Thu, Jun 25, 2020 at 01:52:39PM -0700, Darrick J. Wong wrote: > > > From: Darrick J. Wong <darrick.wong@oracle.com> > > > > > > In commit 9851fd79bfb1, we added a slight amount of slack to the free > > > space btrees being reconstructed so that the initial fix_freelist call > > > (which is run against a totally empty AGFL) would never have to split > > > either free space btree in order to populate the free list. > > > > > > The new btree bulk loading code in xfs_repair can re-create this > > > situation because it can set the slack values to zero if the filesystem > > > is very full. However, these days repair has the infrastructure needed > > > to ensure that overestimations of the btree block counts end up on the > > > AGFL or get freed back into the filesystem at the end of phase 5. > > > > > > Fix this problem by reserving blocks to a separate AGFL block > > > reservation, and checking that between this new reservation and any > > > overages in the bnobt/cntbt fakeroots, we have enough blocks sitting > > > around to populate the AGFL with the minimum number of blocks it needs > > > to handle a split in the bno/cnt/rmap btrees. > > > > > > Note that we reserve blocks for the new bnobt/cntbt/AGFL at the very end > > > of the reservation steps in phase 5, so the extra allocation should not > > > cause repair to fail if it can't find blocks for btrees. > > > > > > Fixes: 9851fd79bfb1 ("repair: AGFL rebuild fails if btree split required") > > > Signed-off-by: Darrick J. Wong <darrick.wong@oracle.com> > > > --- > > > repair/agbtree.c | 78 +++++++++++++++++++++++++++++++++++++++++++++++------- > > > 1 file changed, 68 insertions(+), 10 deletions(-) > > > > > > > > > diff --git a/repair/agbtree.c b/repair/agbtree.c > > > index 339b1489..7a4f316c 100644 > > > --- a/repair/agbtree.c > > > +++ b/repair/agbtree.c > > ... > > > @@ -262,25 +286,59 @@ _("Unable to compute free space by block btree geometry, error %d.\n"), -error); > > ... > > > + > > > + /* > > > + * Now try to fill the bnobt/cntbt cursors with extra blocks to > > > + * populate the AGFL. If we don't get all the blocks we want, > > > + * stop trying to fill the AGFL. > > > + */ > > > + wanted = (int64_t)btr_bno->bload.nr_blocks + > > > + (min_agfl_len / 2) - bno_blocks; > > > + if (wanted > 0 && fill_agfl) { > > > + got = reserve_agblocks(sc->mp, agno, btr_bno, wanted); > > > + if (wanted > got) > > > + fill_agfl = false; > > > + btr_bno->bload.nr_blocks += got; > > > + } > > > + > > > + wanted = (int64_t)btr_cnt->bload.nr_blocks + > > > + (min_agfl_len / 2) - cnt_blocks; > > > + if (wanted > 0 && fill_agfl) { > > > + got = reserve_agblocks(sc->mp, agno, btr_cnt, wanted); > > > + if (wanted > got) > > > + fill_agfl = false; > > > + btr_cnt->bload.nr_blocks += got; > > > + } > > > > It's a little hard to follow this with the nr_blocks sampling and > > whatnot, but I think I get the idea. What's the reason for splitting the > > AGFL res requirement evenly across the two cursors? These AGFL blocks > > all fall into the same overflow pool, right? I was wondering why we > > couldn't just attach the overflow to one, or check one for the full res > > and then the other if more blocks are needed. > > I chose to stuff the excess blocks into the bnobt and cntbt bulkload > cursors to avoid having to initialize a semi-phony "bulkload cursor" for > the agfl, and I decided to split them evenly between the two cursors so > that I wouldn't have someday to deal with a bug report about how one > cursor somehow ran out of blocks but the other one had plenty more. > > > In thinking about it a bit more, wouldn't the whole algorithm be more > > simple if we reserved the min AGFL requirement first, optionally passed > > 'agfl_res' to reserve_btblocks() such that subsequent reservations can > > steal from it (and then fail if it depletes), then stuff what's left in > > one (or both, if there's a reason for that) of the cursors at the end? > > Hmm. I hadn't thought about that. In general I wanted the AGFL > reservations to go last because I'd rather we set off with an underfull > AGFL than totally fail because we couldn't get blocks for the > bnobt/cntbt, but I suppose you're right that we could steal from it as > needed to prevent repair failure. > > So, uh, I could rework this patch to create a phony agfl bulk load > cursor, fill it before the loop, steal blocks from it to fill the > bnobt/cntbt to satisfy failed allocations, and then dump any remainders > into the bnobt/cntbt cursors afterwards. How does that sound? > Ok.. the whole phony cursor thing sounds a bit unfortunate. I was thinking we'd just have a reservation counter or some such, but in reality we'd need that to pass down into the block reservation code to acquire actual blocks for one, then we'd need new code to allocate said blocks from the phony agfl cursor rather than the in-core block lists, right? Perhaps it's not worth doing that if it doesn't reduce complexity as much as shuffle it around or even add a bit more... :/ I wonder if a reasonable simplification/tradeoff might be to just refactor the agfl logic in the current patch into a helper function that 1.) calculates the current overflow across both cursors and the current total agfl "wanted" requirement based on that 2.) performs a single reservation to try and accommodate on one of the cursors and 3.) adds a bit more to the comment to explain that we're just overloading the bnobt cursor (for example) for extra agfl res. Hm? Brian > --D > > > Brian > > > > > > > > /* Ok, now how many free space records do we have? */ > > > *nr_extents = count_bno_extents_blocks(agno, &num_freeblocks); > > > } while (1); > > > - > > > - *extra_blocks = (bno_blocks - btr_bno->bload.nr_blocks) + > > > - (cnt_blocks - btr_cnt->bload.nr_blocks); > > > } > > > > > > /* Rebuild the free space btrees. */ > > > > > >
On Tue, Jun 30, 2020 at 06:52:39AM -0400, Brian Foster wrote: > On Mon, Jun 29, 2020 at 04:21:40PM -0700, Darrick J. Wong wrote: > > On Mon, Jun 29, 2020 at 08:22:28AM -0400, Brian Foster wrote: > > > On Thu, Jun 25, 2020 at 01:52:39PM -0700, Darrick J. Wong wrote: > > > > From: Darrick J. Wong <darrick.wong@oracle.com> > > > > > > > > In commit 9851fd79bfb1, we added a slight amount of slack to the free > > > > space btrees being reconstructed so that the initial fix_freelist call > > > > (which is run against a totally empty AGFL) would never have to split > > > > either free space btree in order to populate the free list. > > > > > > > > The new btree bulk loading code in xfs_repair can re-create this > > > > situation because it can set the slack values to zero if the filesystem > > > > is very full. However, these days repair has the infrastructure needed > > > > to ensure that overestimations of the btree block counts end up on the > > > > AGFL or get freed back into the filesystem at the end of phase 5. > > > > > > > > Fix this problem by reserving blocks to a separate AGFL block > > > > reservation, and checking that between this new reservation and any > > > > overages in the bnobt/cntbt fakeroots, we have enough blocks sitting > > > > around to populate the AGFL with the minimum number of blocks it needs > > > > to handle a split in the bno/cnt/rmap btrees. > > > > > > > > Note that we reserve blocks for the new bnobt/cntbt/AGFL at the very end > > > > of the reservation steps in phase 5, so the extra allocation should not > > > > cause repair to fail if it can't find blocks for btrees. > > > > > > > > Fixes: 9851fd79bfb1 ("repair: AGFL rebuild fails if btree split required") > > > > Signed-off-by: Darrick J. Wong <darrick.wong@oracle.com> > > > > --- > > > > repair/agbtree.c | 78 +++++++++++++++++++++++++++++++++++++++++++++++------- > > > > 1 file changed, 68 insertions(+), 10 deletions(-) > > > > > > > > > > > > diff --git a/repair/agbtree.c b/repair/agbtree.c > > > > index 339b1489..7a4f316c 100644 > > > > --- a/repair/agbtree.c > > > > +++ b/repair/agbtree.c > > > ... > > > > @@ -262,25 +286,59 @@ _("Unable to compute free space by block btree geometry, error %d.\n"), -error); > > > ... > > > > + > > > > + /* > > > > + * Now try to fill the bnobt/cntbt cursors with extra blocks to > > > > + * populate the AGFL. If we don't get all the blocks we want, > > > > + * stop trying to fill the AGFL. > > > > + */ > > > > + wanted = (int64_t)btr_bno->bload.nr_blocks + > > > > + (min_agfl_len / 2) - bno_blocks; > > > > + if (wanted > 0 && fill_agfl) { > > > > + got = reserve_agblocks(sc->mp, agno, btr_bno, wanted); > > > > + if (wanted > got) > > > > + fill_agfl = false; > > > > + btr_bno->bload.nr_blocks += got; > > > > + } > > > > + > > > > + wanted = (int64_t)btr_cnt->bload.nr_blocks + > > > > + (min_agfl_len / 2) - cnt_blocks; > > > > + if (wanted > 0 && fill_agfl) { > > > > + got = reserve_agblocks(sc->mp, agno, btr_cnt, wanted); > > > > + if (wanted > got) > > > > + fill_agfl = false; > > > > + btr_cnt->bload.nr_blocks += got; > > > > + } > > > > > > It's a little hard to follow this with the nr_blocks sampling and > > > whatnot, but I think I get the idea. What's the reason for splitting the > > > AGFL res requirement evenly across the two cursors? These AGFL blocks > > > all fall into the same overflow pool, right? I was wondering why we > > > couldn't just attach the overflow to one, or check one for the full res > > > and then the other if more blocks are needed. > > > > I chose to stuff the excess blocks into the bnobt and cntbt bulkload > > cursors to avoid having to initialize a semi-phony "bulkload cursor" for > > the agfl, and I decided to split them evenly between the two cursors so > > that I wouldn't have someday to deal with a bug report about how one > > cursor somehow ran out of blocks but the other one had plenty more. > > > > > In thinking about it a bit more, wouldn't the whole algorithm be more > > > simple if we reserved the min AGFL requirement first, optionally passed > > > 'agfl_res' to reserve_btblocks() such that subsequent reservations can > > > steal from it (and then fail if it depletes), then stuff what's left in > > > one (or both, if there's a reason for that) of the cursors at the end? > > > > Hmm. I hadn't thought about that. In general I wanted the AGFL > > reservations to go last because I'd rather we set off with an underfull > > AGFL than totally fail because we couldn't get blocks for the > > bnobt/cntbt, but I suppose you're right that we could steal from it as > > needed to prevent repair failure. > > > > So, uh, I could rework this patch to create a phony agfl bulk load > > cursor, fill it before the loop, steal blocks from it to fill the > > bnobt/cntbt to satisfy failed allocations, and then dump any remainders > > into the bnobt/cntbt cursors afterwards. How does that sound? > > > > Ok.. the whole phony cursor thing sounds a bit unfortunate. I was > thinking we'd just have a reservation counter or some such, but in > reality we'd need that to pass down into the block reservation code to > acquire actual blocks for one, then we'd need new code to allocate said > blocks from the phony agfl cursor rather than the in-core block lists, > right? Perhaps it's not worth doing that if it doesn't reduce complexity > as much as shuffle it around or even add a bit more... :/ > > I wonder if a reasonable simplification/tradeoff might be to just > refactor the agfl logic in the current patch into a helper function that > 1.) calculates the current overflow across both cursors and the current > total agfl "wanted" requirement based on that 2.) performs a single > reservation to try and accommodate on one of the cursors and 3.) adds a > bit more to the comment to explain that we're just overloading the bnobt > cursor (for example) for extra agfl res. Hm? <shrug> The current patch more or less does this, albeit without the explicit helper function in (1), and in (3) it splits the overload between the two cursors instead of just the bnobt. I'll see what that looks like, since I came up with other cleanups for init_freespace_cursors. --D > Brian > > > --D > > > > > Brian > > > > > > > > > > > /* Ok, now how many free space records do we have? */ > > > > *nr_extents = count_bno_extents_blocks(agno, &num_freeblocks); > > > > } while (1); > > > > - > > > > - *extra_blocks = (bno_blocks - btr_bno->bload.nr_blocks) + > > > > - (cnt_blocks - btr_cnt->bload.nr_blocks); > > > > } > > > > > > > > /* Rebuild the free space btrees. */ > > > > > > > > > >
diff --git a/repair/agbtree.c b/repair/agbtree.c index 339b1489..7a4f316c 100644 --- a/repair/agbtree.c +++ b/repair/agbtree.c @@ -65,8 +65,8 @@ consume_freespace( } /* Reserve blocks for the new per-AG structures. */ -static void -reserve_btblocks( +static uint32_t +reserve_agblocks( struct xfs_mount *mp, xfs_agnumber_t agno, struct bt_rebuild *btr, @@ -86,8 +86,7 @@ reserve_btblocks( */ ext_ptr = findfirst_bcnt_extent(agno); if (!ext_ptr) - do_error( -_("error - not enough free space in filesystem\n")); + break; /* Use up the extent we've got. */ len = min(ext_ptr->ex_blockcount, nr_blocks - blocks_allocated); @@ -110,6 +109,23 @@ _("error - not enough free space in filesystem\n")); fprintf(stderr, "blocks_allocated = %d\n", blocks_allocated); #endif + return blocks_allocated; +} + +static inline void +reserve_btblocks( + struct xfs_mount *mp, + xfs_agnumber_t agno, + struct bt_rebuild *btr, + uint32_t nr_blocks) +{ + uint32_t got; + + got = reserve_agblocks(mp, agno, btr, nr_blocks); + if (got != nr_blocks) + do_error( + _("error - not enough free space in filesystem, AG %u\n"), + agno); } /* Feed one of the new btree blocks to the bulk loader. */ @@ -219,8 +235,13 @@ init_freespace_cursors( { unsigned int bno_blocks; unsigned int cnt_blocks; + unsigned int min_agfl_len; + bool fill_agfl = true; int error; + *extra_blocks = 0; + min_agfl_len = libxfs_alloc_min_freelist(sc->mp, NULL); + init_rebuild(sc, &XFS_RMAP_OINFO_AG, free_space, btr_bno); init_rebuild(sc, &XFS_RMAP_OINFO_AG, free_space, btr_cnt); @@ -244,6 +265,9 @@ init_freespace_cursors( */ do { unsigned int num_freeblocks; + unsigned int overflow = 0; + unsigned int got; + int64_t wanted; bno_blocks = btr_bno->bload.nr_blocks; cnt_blocks = btr_cnt->bload.nr_blocks; @@ -262,25 +286,59 @@ _("Unable to compute free space by block btree geometry, error %d.\n"), -error); do_error( _("Unable to compute free space by length btree geometry, error %d.\n"), -error); + if (bno_blocks > btr_bno->bload.nr_blocks) + overflow += bno_blocks - btr_bno->bload.nr_blocks; + if (cnt_blocks > btr_cnt->bload.nr_blocks) + overflow += cnt_blocks - btr_cnt->bload.nr_blocks; + if (overflow >= min_agfl_len) + fill_agfl = false; + /* We don't need any more blocks, so we're done. */ if (bno_blocks >= btr_bno->bload.nr_blocks && - cnt_blocks >= btr_cnt->bload.nr_blocks) + cnt_blocks >= btr_cnt->bload.nr_blocks && + !fill_agfl) { + *extra_blocks = overflow; break; + } /* Allocate however many more blocks we need this time. */ - if (bno_blocks < btr_bno->bload.nr_blocks) + if (bno_blocks < btr_bno->bload.nr_blocks) { reserve_btblocks(sc->mp, agno, btr_bno, btr_bno->bload.nr_blocks - bno_blocks); - if (cnt_blocks < btr_cnt->bload.nr_blocks) + bno_blocks = btr_bno->bload.nr_blocks; + } + if (cnt_blocks < btr_cnt->bload.nr_blocks) { reserve_btblocks(sc->mp, agno, btr_cnt, btr_cnt->bload.nr_blocks - cnt_blocks); + cnt_blocks = btr_cnt->bload.nr_blocks; + } + + /* + * Now try to fill the bnobt/cntbt cursors with extra blocks to + * populate the AGFL. If we don't get all the blocks we want, + * stop trying to fill the AGFL. + */ + wanted = (int64_t)btr_bno->bload.nr_blocks + + (min_agfl_len / 2) - bno_blocks; + if (wanted > 0 && fill_agfl) { + got = reserve_agblocks(sc->mp, agno, btr_bno, wanted); + if (wanted > got) + fill_agfl = false; + btr_bno->bload.nr_blocks += got; + } + + wanted = (int64_t)btr_cnt->bload.nr_blocks + + (min_agfl_len / 2) - cnt_blocks; + if (wanted > 0 && fill_agfl) { + got = reserve_agblocks(sc->mp, agno, btr_cnt, wanted); + if (wanted > got) + fill_agfl = false; + btr_cnt->bload.nr_blocks += got; + } /* Ok, now how many free space records do we have? */ *nr_extents = count_bno_extents_blocks(agno, &num_freeblocks); } while (1); - - *extra_blocks = (bno_blocks - btr_bno->bload.nr_blocks) + - (cnt_blocks - btr_cnt->bload.nr_blocks); } /* Rebuild the free space btrees. */