2018-06-06 05:42:14 +03:00
|
|
|
// SPDX-License-Identifier: GPL-2.0+
|
xfs: set up per-AG free space reservations
One unfortunate quirk of the reference count and reverse mapping
btrees -- they can expand in size when blocks are written to *other*
allocation groups if, say, one large extent becomes a lot of tiny
extents. Since we don't want to start throwing errors in the middle
of CoWing, we need to reserve some blocks to handle future expansion.
The transaction block reservation counters aren't sufficient here
because we have to have a reserve of blocks in every AG, not just
somewhere in the filesystem.
Therefore, create two per-AG block reservation pools. One feeds the
AGFL so that rmapbt expansion always succeeds, and the other feeds all
other metadata so that refcountbt expansion never fails.
Use the count of how many reserved blocks we need to have on hand to
create a virtual reservation in the AG. Through selective clamping of
the maximum length of allocation requests and of the length of the
longest free extent, we can make it look like there's less free space
in the AG unless the reservation owner is asking for blocks.
In other words, play some accounting tricks in-core to make sure that
we always have blocks available. On the plus side, there's nothing to
clean up if we crash, which is contrast to the strategy that the rough
draft used (actually removing extents from the freespace btrees).
Signed-off-by: Darrick J. Wong <darrick.wong@oracle.com>
Reviewed-by: Dave Chinner <dchinner@redhat.com>
Signed-off-by: Dave Chinner <david@fromorbit.com>
2016-09-19 03:30:52 +03:00
|
|
|
/*
|
|
|
|
|
* Copyright (C) 2016 Oracle. All Rights Reserved.
|
|
|
|
|
* Author: Darrick J. Wong <darrick.wong@oracle.com>
|
|
|
|
|
*/
|
|
|
|
|
#ifndef __XFS_AG_RESV_H__
|
|
|
|
|
#define __XFS_AG_RESV_H__
|
|
|
|
|
|
|
|
|
|
int xfs_ag_resv_free(struct xfs_perag *pag);
|
2018-07-30 08:37:08 +03:00
|
|
|
int xfs_ag_resv_init(struct xfs_perag *pag, struct xfs_trans *tp);
|
xfs: set up per-AG free space reservations
One unfortunate quirk of the reference count and reverse mapping
btrees -- they can expand in size when blocks are written to *other*
allocation groups if, say, one large extent becomes a lot of tiny
extents. Since we don't want to start throwing errors in the middle
of CoWing, we need to reserve some blocks to handle future expansion.
The transaction block reservation counters aren't sufficient here
because we have to have a reserve of blocks in every AG, not just
somewhere in the filesystem.
Therefore, create two per-AG block reservation pools. One feeds the
AGFL so that rmapbt expansion always succeeds, and the other feeds all
other metadata so that refcountbt expansion never fails.
Use the count of how many reserved blocks we need to have on hand to
create a virtual reservation in the AG. Through selective clamping of
the maximum length of allocation requests and of the length of the
longest free extent, we can make it look like there's less free space
in the AG unless the reservation owner is asking for blocks.
In other words, play some accounting tricks in-core to make sure that
we always have blocks available. On the plus side, there's nothing to
clean up if we crash, which is contrast to the strategy that the rough
draft used (actually removing extents from the freespace btrees).
Signed-off-by: Darrick J. Wong <darrick.wong@oracle.com>
Reviewed-by: Dave Chinner <dchinner@redhat.com>
Signed-off-by: Dave Chinner <david@fromorbit.com>
2016-09-19 03:30:52 +03:00
|
|
|
|
|
|
|
|
bool xfs_ag_resv_critical(struct xfs_perag *pag, enum xfs_ag_resv_type type);
|
|
|
|
|
xfs_extlen_t xfs_ag_resv_needed(struct xfs_perag *pag,
|
|
|
|
|
enum xfs_ag_resv_type type);
|
|
|
|
|
|
|
|
|
|
void xfs_ag_resv_alloc_extent(struct xfs_perag *pag, enum xfs_ag_resv_type type,
|
|
|
|
|
struct xfs_alloc_arg *args);
|
|
|
|
|
void xfs_ag_resv_free_extent(struct xfs_perag *pag, enum xfs_ag_resv_type type,
|
|
|
|
|
struct xfs_trans *tp, xfs_extlen_t len);
|
|
|
|
|
|
2018-03-10 01:02:32 +03:00
|
|
|
/*
|
|
|
|
|
* RMAPBT reservation accounting wrappers. Since rmapbt blocks are sourced from
|
|
|
|
|
* the AGFL, they are allocated one at a time and the reservation updates don't
|
|
|
|
|
* require a transaction.
|
|
|
|
|
*/
|
|
|
|
|
static inline void
|
|
|
|
|
xfs_ag_resv_rmapbt_alloc(
|
|
|
|
|
struct xfs_mount *mp,
|
|
|
|
|
xfs_agnumber_t agno)
|
|
|
|
|
{
|
2018-07-18 00:25:20 +03:00
|
|
|
struct xfs_alloc_arg args = { NULL };
|
2018-03-10 01:02:32 +03:00
|
|
|
struct xfs_perag *pag;
|
|
|
|
|
|
|
|
|
|
args.len = 1;
|
|
|
|
|
pag = xfs_perag_get(mp, agno);
|
|
|
|
|
xfs_ag_resv_alloc_extent(pag, XFS_AG_RESV_RMAPBT, &args);
|
|
|
|
|
xfs_perag_put(pag);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline void
|
|
|
|
|
xfs_ag_resv_rmapbt_free(
|
|
|
|
|
struct xfs_mount *mp,
|
|
|
|
|
xfs_agnumber_t agno)
|
|
|
|
|
{
|
|
|
|
|
struct xfs_perag *pag;
|
|
|
|
|
|
|
|
|
|
pag = xfs_perag_get(mp, agno);
|
|
|
|
|
xfs_ag_resv_free_extent(pag, XFS_AG_RESV_RMAPBT, NULL, 1);
|
|
|
|
|
xfs_perag_put(pag);
|
|
|
|
|
}
|
|
|
|
|
|
xfs: set up per-AG free space reservations
One unfortunate quirk of the reference count and reverse mapping
btrees -- they can expand in size when blocks are written to *other*
allocation groups if, say, one large extent becomes a lot of tiny
extents. Since we don't want to start throwing errors in the middle
of CoWing, we need to reserve some blocks to handle future expansion.
The transaction block reservation counters aren't sufficient here
because we have to have a reserve of blocks in every AG, not just
somewhere in the filesystem.
Therefore, create two per-AG block reservation pools. One feeds the
AGFL so that rmapbt expansion always succeeds, and the other feeds all
other metadata so that refcountbt expansion never fails.
Use the count of how many reserved blocks we need to have on hand to
create a virtual reservation in the AG. Through selective clamping of
the maximum length of allocation requests and of the length of the
longest free extent, we can make it look like there's less free space
in the AG unless the reservation owner is asking for blocks.
In other words, play some accounting tricks in-core to make sure that
we always have blocks available. On the plus side, there's nothing to
clean up if we crash, which is contrast to the strategy that the rough
draft used (actually removing extents from the freespace btrees).
Signed-off-by: Darrick J. Wong <darrick.wong@oracle.com>
Reviewed-by: Dave Chinner <dchinner@redhat.com>
Signed-off-by: Dave Chinner <david@fromorbit.com>
2016-09-19 03:30:52 +03:00
|
|
|
#endif /* __XFS_AG_RESV_H__ */
|
