2005-04-17 06:20:36 +08:00
|
|
|
/*
|
2005-11-02 11:58:39 +08:00
|
|
|
* Copyright (c) 2000-2003,2005 Silicon Graphics, Inc.
|
2010-06-23 16:11:15 +08:00
|
|
|
* Copyright (C) 2010 Red Hat, Inc.
|
2005-11-02 11:58:39 +08:00
|
|
|
* All Rights Reserved.
|
2005-04-17 06:20:36 +08:00
|
|
|
*
|
2005-11-02 11:58:39 +08:00
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
|
* modify it under the terms of the GNU General Public License as
|
2005-04-17 06:20:36 +08:00
|
|
|
* published by the Free Software Foundation.
|
|
|
|
|
*
|
2005-11-02 11:58:39 +08:00
|
|
|
* This program is distributed in the hope that it would be useful,
|
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
|
* GNU General Public License for more details.
|
2005-04-17 06:20:36 +08:00
|
|
|
*
|
2005-11-02 11:58:39 +08:00
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
|
* along with this program; if not, write the Free Software Foundation,
|
|
|
|
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
|
|
|
|
#include "xfs.h"
|
2005-11-02 11:38:42 +08:00
|
|
|
#include "xfs_fs.h"
|
2013-10-23 07:36:05 +08:00
|
|
|
#include "xfs_shared.h"
|
2013-10-23 07:50:10 +08:00
|
|
|
#include "xfs_format.h"
|
|
|
|
|
#include "xfs_log_format.h"
|
|
|
|
|
#include "xfs_trans_resv.h"
|
2005-04-17 06:20:36 +08:00
|
|
|
#include "xfs_mount.h"
|
|
|
|
|
#include "xfs_inode.h"
|
2012-04-29 18:39:43 +08:00
|
|
|
#include "xfs_extent_busy.h"
|
2005-04-17 06:20:36 +08:00
|
|
|
#include "xfs_quota.h"
|
2013-10-23 07:50:10 +08:00
|
|
|
#include "xfs_trans.h"
|
2005-11-02 11:38:42 +08:00
|
|
|
#include "xfs_trans_priv.h"
|
2013-10-23 07:50:10 +08:00
|
|
|
#include "xfs_log.h"
|
xfs: Improve scalability of busy extent tracking
When we free a metadata extent, we record it in the per-AG busy
extent array so that it is not re-used before the freeing
transaction hits the disk. This array is fixed size, so when it
overflows we make further allocation transactions synchronous
because we cannot track more freed extents until those transactions
hit the disk and are completed. Under heavy mixed allocation and
freeing workloads with large log buffers, we can overflow this array
quite easily.
Further, the array is sparsely populated, which means that inserts
need to search for a free slot, and array searches often have to
search many more slots that are actually used to check all the
busy extents. Quite inefficient, really.
To enable this aspect of extent freeing to scale better, we need
a structure that can grow dynamically. While in other areas of
XFS we have used radix trees, the extents being freed are at random
locations on disk so are better suited to being indexed by an rbtree.
So, use a per-AG rbtree indexed by block number to track busy
extents. This incures a memory allocation when marking an extent
busy, but should not occur too often in low memory situations. This
should scale to an arbitrary number of extents so should not be a
limitation for features such as in-memory aggregation of
transactions.
However, there are still situations where we can't avoid allocating
busy extents (such as allocation from the AGFL). To minimise the
overhead of such occurences, we need to avoid doing a synchronous
log force while holding the AGF locked to ensure that the previous
transactions are safely on disk before we use the extent. We can do
this by marking the transaction doing the allocation as synchronous
rather issuing a log force.
Because of the locking involved and the ordering of transactions,
the synchronous transaction provides the same guarantees as a
synchronous log force because it ensures that all the prior
transactions are already on disk when the synchronous transaction
hits the disk. i.e. it preserves the free->allocate order of the
extent correctly in recovery.
By doing this, we avoid holding the AGF locked while log writes are
in progress, hence reducing the length of time the lock is held and
therefore we increase the rate at which we can allocate and free
from the allocation group, thereby increasing overall throughput.
The only problem with this approach is that when a metadata buffer is
marked stale (e.g. a directory block is removed), then buffer remains
pinned and locked until the log goes to disk. The issue here is that
if that stale buffer is reallocated in a subsequent transaction, the
attempt to lock that buffer in the transaction will hang waiting
the log to go to disk to unlock and unpin the buffer. Hence if
someone tries to lock a pinned, stale, locked buffer we need to
push on the log to get it unlocked ASAP. Effectively we are trading
off a guaranteed log force for a much less common trigger for log
force to occur.
Ideally we should not reallocate busy extents. That is a much more
complex fix to the problem as it involves direct intervention in the
allocation btree searches in many places. This is left to a future
set of modifications.
Finally, now that we track busy extents in allocated memory, we
don't need the descriptors in the transaction structure to point to
them. We can replace the complex busy chunk infrastructure with a
simple linked list of busy extents. This allows us to remove a large
chunk of code, making the overall change a net reduction in code
size.
Signed-off-by: Dave Chinner <david@fromorbit.com>
Reviewed-by: Christoph Hellwig <hch@lst.de>
Signed-off-by: Alex Elder <aelder@sgi.com>
2010-05-21 10:07:08 +08:00
|
|
|
#include "xfs_trace.h"
|
2013-10-23 07:51:50 +08:00
|
|
|
#include "xfs_error.h"
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2006-03-14 10:32:41 +08:00
|
|
|
kmem_zone_t *xfs_trans_zone;
|
2010-06-23 16:11:15 +08:00
|
|
|
kmem_zone_t *xfs_log_item_desc_zone;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Initialize the precomputed transaction reservation values
|
|
|
|
|
* in the mount structure.
|
|
|
|
|
*/
|
|
|
|
|
void
|
|
|
|
|
xfs_trans_init(
|
2010-05-04 21:53:48 +08:00
|
|
|
struct xfs_mount *mp)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2013-08-12 18:49:59 +08:00
|
|
|
xfs_trans_resv_calc(mp, M_RES(mp));
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
2010-03-23 07:11:05 +08:00
|
|
|
/*
|
|
|
|
|
* Free the transaction structure. If there is more clean up
|
|
|
|
|
* to do when the structure is freed, add it here.
|
|
|
|
|
*/
|
|
|
|
|
STATIC void
|
|
|
|
|
xfs_trans_free(
|
xfs: Improve scalability of busy extent tracking
When we free a metadata extent, we record it in the per-AG busy
extent array so that it is not re-used before the freeing
transaction hits the disk. This array is fixed size, so when it
overflows we make further allocation transactions synchronous
because we cannot track more freed extents until those transactions
hit the disk and are completed. Under heavy mixed allocation and
freeing workloads with large log buffers, we can overflow this array
quite easily.
Further, the array is sparsely populated, which means that inserts
need to search for a free slot, and array searches often have to
search many more slots that are actually used to check all the
busy extents. Quite inefficient, really.
To enable this aspect of extent freeing to scale better, we need
a structure that can grow dynamically. While in other areas of
XFS we have used radix trees, the extents being freed are at random
locations on disk so are better suited to being indexed by an rbtree.
So, use a per-AG rbtree indexed by block number to track busy
extents. This incures a memory allocation when marking an extent
busy, but should not occur too often in low memory situations. This
should scale to an arbitrary number of extents so should not be a
limitation for features such as in-memory aggregation of
transactions.
However, there are still situations where we can't avoid allocating
busy extents (such as allocation from the AGFL). To minimise the
overhead of such occurences, we need to avoid doing a synchronous
log force while holding the AGF locked to ensure that the previous
transactions are safely on disk before we use the extent. We can do
this by marking the transaction doing the allocation as synchronous
rather issuing a log force.
Because of the locking involved and the ordering of transactions,
the synchronous transaction provides the same guarantees as a
synchronous log force because it ensures that all the prior
transactions are already on disk when the synchronous transaction
hits the disk. i.e. it preserves the free->allocate order of the
extent correctly in recovery.
By doing this, we avoid holding the AGF locked while log writes are
in progress, hence reducing the length of time the lock is held and
therefore we increase the rate at which we can allocate and free
from the allocation group, thereby increasing overall throughput.
The only problem with this approach is that when a metadata buffer is
marked stale (e.g. a directory block is removed), then buffer remains
pinned and locked until the log goes to disk. The issue here is that
if that stale buffer is reallocated in a subsequent transaction, the
attempt to lock that buffer in the transaction will hang waiting
the log to go to disk to unlock and unpin the buffer. Hence if
someone tries to lock a pinned, stale, locked buffer we need to
push on the log to get it unlocked ASAP. Effectively we are trading
off a guaranteed log force for a much less common trigger for log
force to occur.
Ideally we should not reallocate busy extents. That is a much more
complex fix to the problem as it involves direct intervention in the
allocation btree searches in many places. This is left to a future
set of modifications.
Finally, now that we track busy extents in allocated memory, we
don't need the descriptors in the transaction structure to point to
them. We can replace the complex busy chunk infrastructure with a
simple linked list of busy extents. This allows us to remove a large
chunk of code, making the overall change a net reduction in code
size.
Signed-off-by: Dave Chinner <david@fromorbit.com>
Reviewed-by: Christoph Hellwig <hch@lst.de>
Signed-off-by: Alex Elder <aelder@sgi.com>
2010-05-21 10:07:08 +08:00
|
|
|
struct xfs_trans *tp)
|
2010-03-23 07:11:05 +08:00
|
|
|
{
|
2012-04-29 18:41:10 +08:00
|
|
|
xfs_extent_busy_sort(&tp->t_busy);
|
|
|
|
|
xfs_extent_busy_clear(tp->t_mountp, &tp->t_busy, false);
|
xfs: Improve scalability of busy extent tracking
When we free a metadata extent, we record it in the per-AG busy
extent array so that it is not re-used before the freeing
transaction hits the disk. This array is fixed size, so when it
overflows we make further allocation transactions synchronous
because we cannot track more freed extents until those transactions
hit the disk and are completed. Under heavy mixed allocation and
freeing workloads with large log buffers, we can overflow this array
quite easily.
Further, the array is sparsely populated, which means that inserts
need to search for a free slot, and array searches often have to
search many more slots that are actually used to check all the
busy extents. Quite inefficient, really.
To enable this aspect of extent freeing to scale better, we need
a structure that can grow dynamically. While in other areas of
XFS we have used radix trees, the extents being freed are at random
locations on disk so are better suited to being indexed by an rbtree.
So, use a per-AG rbtree indexed by block number to track busy
extents. This incures a memory allocation when marking an extent
busy, but should not occur too often in low memory situations. This
should scale to an arbitrary number of extents so should not be a
limitation for features such as in-memory aggregation of
transactions.
However, there are still situations where we can't avoid allocating
busy extents (such as allocation from the AGFL). To minimise the
overhead of such occurences, we need to avoid doing a synchronous
log force while holding the AGF locked to ensure that the previous
transactions are safely on disk before we use the extent. We can do
this by marking the transaction doing the allocation as synchronous
rather issuing a log force.
Because of the locking involved and the ordering of transactions,
the synchronous transaction provides the same guarantees as a
synchronous log force because it ensures that all the prior
transactions are already on disk when the synchronous transaction
hits the disk. i.e. it preserves the free->allocate order of the
extent correctly in recovery.
By doing this, we avoid holding the AGF locked while log writes are
in progress, hence reducing the length of time the lock is held and
therefore we increase the rate at which we can allocate and free
from the allocation group, thereby increasing overall throughput.
The only problem with this approach is that when a metadata buffer is
marked stale (e.g. a directory block is removed), then buffer remains
pinned and locked until the log goes to disk. The issue here is that
if that stale buffer is reallocated in a subsequent transaction, the
attempt to lock that buffer in the transaction will hang waiting
the log to go to disk to unlock and unpin the buffer. Hence if
someone tries to lock a pinned, stale, locked buffer we need to
push on the log to get it unlocked ASAP. Effectively we are trading
off a guaranteed log force for a much less common trigger for log
force to occur.
Ideally we should not reallocate busy extents. That is a much more
complex fix to the problem as it involves direct intervention in the
allocation btree searches in many places. This is left to a future
set of modifications.
Finally, now that we track busy extents in allocated memory, we
don't need the descriptors in the transaction structure to point to
them. We can replace the complex busy chunk infrastructure with a
simple linked list of busy extents. This allows us to remove a large
chunk of code, making the overall change a net reduction in code
size.
Signed-off-by: Dave Chinner <david@fromorbit.com>
Reviewed-by: Christoph Hellwig <hch@lst.de>
Signed-off-by: Alex Elder <aelder@sgi.com>
2010-05-21 10:07:08 +08:00
|
|
|
|
2010-03-23 07:11:05 +08:00
|
|
|
atomic_dec(&tp->t_mountp->m_active_trans);
|
2016-04-06 07:19:55 +08:00
|
|
|
if (!(tp->t_flags & XFS_TRANS_NO_WRITECOUNT))
|
2012-06-12 22:20:39 +08:00
|
|
|
sb_end_intwrite(tp->t_mountp->m_super);
|
2010-03-23 07:11:05 +08:00
|
|
|
xfs_trans_free_dqinfo(tp);
|
|
|
|
|
kmem_zone_free(xfs_trans_zone, tp);
|
|
|
|
|
}
|
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
|
* This is called to create a new transaction which will share the
|
|
|
|
|
* permanent log reservation of the given transaction. The remaining
|
|
|
|
|
* unused block and rt extent reservations are also inherited. This
|
|
|
|
|
* implies that the original transaction is no longer allowed to allocate
|
|
|
|
|
* blocks. Locks and log items, however, are no inherited. They must
|
|
|
|
|
* be added to the new transaction explicitly.
|
|
|
|
|
*/
|
2015-06-04 11:47:29 +08:00
|
|
|
STATIC xfs_trans_t *
|
2005-04-17 06:20:36 +08:00
|
|
|
xfs_trans_dup(
|
|
|
|
|
xfs_trans_t *tp)
|
|
|
|
|
{
|
|
|
|
|
xfs_trans_t *ntp;
|
|
|
|
|
|
|
|
|
|
ntp = kmem_zone_zalloc(xfs_trans_zone, KM_SLEEP);
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Initialize the new transaction structure.
|
|
|
|
|
*/
|
2013-08-12 18:49:28 +08:00
|
|
|
ntp->t_magic = XFS_TRANS_HEADER_MAGIC;
|
2005-04-17 06:20:36 +08:00
|
|
|
ntp->t_mountp = tp->t_mountp;
|
2010-06-23 16:11:15 +08:00
|
|
|
INIT_LIST_HEAD(&ntp->t_items);
|
xfs: Improve scalability of busy extent tracking
When we free a metadata extent, we record it in the per-AG busy
extent array so that it is not re-used before the freeing
transaction hits the disk. This array is fixed size, so when it
overflows we make further allocation transactions synchronous
because we cannot track more freed extents until those transactions
hit the disk and are completed. Under heavy mixed allocation and
freeing workloads with large log buffers, we can overflow this array
quite easily.
Further, the array is sparsely populated, which means that inserts
need to search for a free slot, and array searches often have to
search many more slots that are actually used to check all the
busy extents. Quite inefficient, really.
To enable this aspect of extent freeing to scale better, we need
a structure that can grow dynamically. While in other areas of
XFS we have used radix trees, the extents being freed are at random
locations on disk so are better suited to being indexed by an rbtree.
So, use a per-AG rbtree indexed by block number to track busy
extents. This incures a memory allocation when marking an extent
busy, but should not occur too often in low memory situations. This
should scale to an arbitrary number of extents so should not be a
limitation for features such as in-memory aggregation of
transactions.
However, there are still situations where we can't avoid allocating
busy extents (such as allocation from the AGFL). To minimise the
overhead of such occurences, we need to avoid doing a synchronous
log force while holding the AGF locked to ensure that the previous
transactions are safely on disk before we use the extent. We can do
this by marking the transaction doing the allocation as synchronous
rather issuing a log force.
Because of the locking involved and the ordering of transactions,
the synchronous transaction provides the same guarantees as a
synchronous log force because it ensures that all the prior
transactions are already on disk when the synchronous transaction
hits the disk. i.e. it preserves the free->allocate order of the
extent correctly in recovery.
By doing this, we avoid holding the AGF locked while log writes are
in progress, hence reducing the length of time the lock is held and
therefore we increase the rate at which we can allocate and free
from the allocation group, thereby increasing overall throughput.
The only problem with this approach is that when a metadata buffer is
marked stale (e.g. a directory block is removed), then buffer remains
pinned and locked until the log goes to disk. The issue here is that
if that stale buffer is reallocated in a subsequent transaction, the
attempt to lock that buffer in the transaction will hang waiting
the log to go to disk to unlock and unpin the buffer. Hence if
someone tries to lock a pinned, stale, locked buffer we need to
push on the log to get it unlocked ASAP. Effectively we are trading
off a guaranteed log force for a much less common trigger for log
force to occur.
Ideally we should not reallocate busy extents. That is a much more
complex fix to the problem as it involves direct intervention in the
allocation btree searches in many places. This is left to a future
set of modifications.
Finally, now that we track busy extents in allocated memory, we
don't need the descriptors in the transaction structure to point to
them. We can replace the complex busy chunk infrastructure with a
simple linked list of busy extents. This allows us to remove a large
chunk of code, making the overall change a net reduction in code
size.
Signed-off-by: Dave Chinner <david@fromorbit.com>
Reviewed-by: Christoph Hellwig <hch@lst.de>
Signed-off-by: Alex Elder <aelder@sgi.com>
2010-05-21 10:07:08 +08:00
|
|
|
INIT_LIST_HEAD(&ntp->t_busy);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
ASSERT(tp->t_flags & XFS_TRANS_PERM_LOG_RES);
|
|
|
|
|
ASSERT(tp->t_ticket != NULL);
|
2005-11-02 12:12:04 +08:00
|
|
|
|
2012-06-12 22:20:39 +08:00
|
|
|
ntp->t_flags = XFS_TRANS_PERM_LOG_RES |
|
|
|
|
|
(tp->t_flags & XFS_TRANS_RESERVE) |
|
2016-04-06 07:19:55 +08:00
|
|
|
(tp->t_flags & XFS_TRANS_NO_WRITECOUNT);
|
2012-06-12 22:20:39 +08:00
|
|
|
/* We gave our writer reference to the new transaction */
|
2016-04-06 07:19:55 +08:00
|
|
|
tp->t_flags |= XFS_TRANS_NO_WRITECOUNT;
|
2008-11-17 14:37:10 +08:00
|
|
|
ntp->t_ticket = xfs_log_ticket_get(tp->t_ticket);
|
2005-04-17 06:20:36 +08:00
|
|
|
ntp->t_blk_res = tp->t_blk_res - tp->t_blk_res_used;
|
|
|
|
|
tp->t_blk_res = tp->t_blk_res_used;
|
|
|
|
|
ntp->t_rtx_res = tp->t_rtx_res - tp->t_rtx_res_used;
|
|
|
|
|
tp->t_rtx_res = tp->t_rtx_res_used;
|
2006-06-09 12:59:13 +08:00
|
|
|
ntp->t_pflags = tp->t_pflags;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2009-06-08 21:33:32 +08:00
|
|
|
xfs_trans_dup_dqinfo(tp, ntp);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
atomic_inc(&tp->t_mountp->m_active_trans);
|
|
|
|
|
return ntp;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* This is called to reserve free disk blocks and log space for the
|
|
|
|
|
* given transaction. This must be done before allocating any resources
|
|
|
|
|
* within the transaction.
|
|
|
|
|
*
|
|
|
|
|
* This will return ENOSPC if there are not enough blocks available.
|
|
|
|
|
* It will sleep waiting for available log space.
|
|
|
|
|
* The only valid value for the flags parameter is XFS_RES_LOG_PERM, which
|
|
|
|
|
* is used by long running transactions. If any one of the reservations
|
|
|
|
|
* fails then they will all be backed out.
|
|
|
|
|
*
|
|
|
|
|
* This does not do quota reservations. That typically is done by the
|
|
|
|
|
* caller afterwards.
|
|
|
|
|
*/
|
2016-04-06 07:19:55 +08:00
|
|
|
static int
|
2005-04-17 06:20:36 +08:00
|
|
|
xfs_trans_reserve(
|
2013-08-12 18:49:59 +08:00
|
|
|
struct xfs_trans *tp,
|
|
|
|
|
struct xfs_trans_res *resp,
|
|
|
|
|
uint blocks,
|
|
|
|
|
uint rtextents)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2006-06-09 12:59:13 +08:00
|
|
|
int error = 0;
|
2015-02-23 18:22:03 +08:00
|
|
|
bool rsvd = (tp->t_flags & XFS_TRANS_RESERVE) != 0;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
/* Mark this thread as being in a transaction */
|
2006-06-09 12:59:13 +08:00
|
|
|
current_set_flags_nested(&tp->t_pflags, PF_FSTRANS);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Attempt to reserve the needed disk blocks by decrementing
|
|
|
|
|
* the number needed from the number available. This will
|
|
|
|
|
* fail if the count would go below zero.
|
|
|
|
|
*/
|
|
|
|
|
if (blocks > 0) {
|
2015-02-23 18:22:03 +08:00
|
|
|
error = xfs_mod_fdblocks(tp->t_mountp, -((int64_t)blocks), rsvd);
|
2005-04-17 06:20:36 +08:00
|
|
|
if (error != 0) {
|
2006-06-09 12:59:13 +08:00
|
|
|
current_restore_flags_nested(&tp->t_pflags, PF_FSTRANS);
|
2014-06-25 12:58:08 +08:00
|
|
|
return -ENOSPC;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
tp->t_blk_res += blocks;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Reserve the log space needed for this transaction.
|
|
|
|
|
*/
|
2013-08-12 18:49:59 +08:00
|
|
|
if (resp->tr_logres > 0) {
|
2012-02-20 10:31:31 +08:00
|
|
|
bool permanent = false;
|
|
|
|
|
|
2013-08-12 18:49:59 +08:00
|
|
|
ASSERT(tp->t_log_res == 0 ||
|
|
|
|
|
tp->t_log_res == resp->tr_logres);
|
|
|
|
|
ASSERT(tp->t_log_count == 0 ||
|
|
|
|
|
tp->t_log_count == resp->tr_logcount);
|
2012-02-20 10:31:31 +08:00
|
|
|
|
2013-08-12 18:49:59 +08:00
|
|
|
if (resp->tr_logflags & XFS_TRANS_PERM_LOG_RES) {
|
2005-04-17 06:20:36 +08:00
|
|
|
tp->t_flags |= XFS_TRANS_PERM_LOG_RES;
|
2012-02-20 10:31:31 +08:00
|
|
|
permanent = true;
|
2005-04-17 06:20:36 +08:00
|
|
|
} else {
|
|
|
|
|
ASSERT(tp->t_ticket == NULL);
|
|
|
|
|
ASSERT(!(tp->t_flags & XFS_TRANS_PERM_LOG_RES));
|
|
|
|
|
}
|
|
|
|
|
|
2012-02-20 10:31:31 +08:00
|
|
|
if (tp->t_ticket != NULL) {
|
2013-08-12 18:49:59 +08:00
|
|
|
ASSERT(resp->tr_logflags & XFS_TRANS_PERM_LOG_RES);
|
2012-02-20 10:31:31 +08:00
|
|
|
error = xfs_log_regrant(tp->t_mountp, tp->t_ticket);
|
|
|
|
|
} else {
|
2013-08-12 18:49:59 +08:00
|
|
|
error = xfs_log_reserve(tp->t_mountp,
|
|
|
|
|
resp->tr_logres,
|
|
|
|
|
resp->tr_logcount,
|
|
|
|
|
&tp->t_ticket, XFS_TRANSACTION,
|
2016-04-06 07:19:55 +08:00
|
|
|
permanent, 0);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
2012-02-20 10:31:31 +08:00
|
|
|
|
|
|
|
|
if (error)
|
|
|
|
|
goto undo_blocks;
|
|
|
|
|
|
2013-08-12 18:49:59 +08:00
|
|
|
tp->t_log_res = resp->tr_logres;
|
|
|
|
|
tp->t_log_count = resp->tr_logcount;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Attempt to reserve the needed realtime extents by decrementing
|
|
|
|
|
* the number needed from the number available. This will
|
|
|
|
|
* fail if the count would go below zero.
|
|
|
|
|
*/
|
|
|
|
|
if (rtextents > 0) {
|
2015-02-23 18:22:54 +08:00
|
|
|
error = xfs_mod_frextents(tp->t_mountp, -((int64_t)rtextents));
|
2005-04-17 06:20:36 +08:00
|
|
|
if (error) {
|
2014-06-25 12:58:08 +08:00
|
|
|
error = -ENOSPC;
|
2005-04-17 06:20:36 +08:00
|
|
|
goto undo_log;
|
|
|
|
|
}
|
|
|
|
|
tp->t_rtx_res += rtextents;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Error cases jump to one of these labels to undo any
|
|
|
|
|
* reservations which have already been performed.
|
|
|
|
|
*/
|
|
|
|
|
undo_log:
|
2013-08-12 18:49:59 +08:00
|
|
|
if (resp->tr_logres > 0) {
|
2015-06-04 11:48:20 +08:00
|
|
|
xfs_log_done(tp->t_mountp, tp->t_ticket, NULL, false);
|
2005-04-17 06:20:36 +08:00
|
|
|
tp->t_ticket = NULL;
|
|
|
|
|
tp->t_log_res = 0;
|
|
|
|
|
tp->t_flags &= ~XFS_TRANS_PERM_LOG_RES;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
undo_blocks:
|
|
|
|
|
if (blocks > 0) {
|
2015-02-23 18:22:03 +08:00
|
|
|
xfs_mod_fdblocks(tp->t_mountp, -((int64_t)blocks), rsvd);
|
2005-04-17 06:20:36 +08:00
|
|
|
tp->t_blk_res = 0;
|
|
|
|
|
}
|
|
|
|
|
|
2006-06-09 12:59:13 +08:00
|
|
|
current_restore_flags_nested(&tp->t_pflags, PF_FSTRANS);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2006-06-09 12:59:13 +08:00
|
|
|
return error;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
2016-04-06 07:19:55 +08:00
|
|
|
int
|
|
|
|
|
xfs_trans_alloc(
|
|
|
|
|
struct xfs_mount *mp,
|
|
|
|
|
struct xfs_trans_res *resp,
|
|
|
|
|
uint blocks,
|
|
|
|
|
uint rtextents,
|
|
|
|
|
uint flags,
|
|
|
|
|
struct xfs_trans **tpp)
|
|
|
|
|
{
|
|
|
|
|
struct xfs_trans *tp;
|
|
|
|
|
int error;
|
|
|
|
|
|
|
|
|
|
if (!(flags & XFS_TRANS_NO_WRITECOUNT))
|
|
|
|
|
sb_start_intwrite(mp->m_super);
|
|
|
|
|
|
|
|
|
|
WARN_ON(mp->m_super->s_writers.frozen == SB_FREEZE_COMPLETE);
|
|
|
|
|
atomic_inc(&mp->m_active_trans);
|
|
|
|
|
|
|
|
|
|
tp = kmem_zone_zalloc(xfs_trans_zone,
|
|
|
|
|
(flags & XFS_TRANS_NOFS) ? KM_NOFS : KM_SLEEP);
|
|
|
|
|
tp->t_magic = XFS_TRANS_HEADER_MAGIC;
|
|
|
|
|
tp->t_flags = flags;
|
|
|
|
|
tp->t_mountp = mp;
|
|
|
|
|
INIT_LIST_HEAD(&tp->t_items);
|
|
|
|
|
INIT_LIST_HEAD(&tp->t_busy);
|
|
|
|
|
|
|
|
|
|
error = xfs_trans_reserve(tp, resp, blocks, rtextents);
|
|
|
|
|
if (error) {
|
|
|
|
|
xfs_trans_cancel(tp);
|
|
|
|
|
return error;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
*tpp = tp;
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
|
* Record the indicated change to the given field for application
|
|
|
|
|
* to the file system's superblock when the transaction commits.
|
|
|
|
|
* For now, just store the change in the transaction structure.
|
|
|
|
|
*
|
|
|
|
|
* Mark the transaction structure to indicate that the superblock
|
|
|
|
|
* needs to be updated before committing.
|
[XFS] Lazy Superblock Counters
When we have a couple of hundred transactions on the fly at once, they all
typically modify the on disk superblock in some way.
create/unclink/mkdir/rmdir modify inode counts, allocation/freeing modify
free block counts.
When these counts are modified in a transaction, they must eventually lock
the superblock buffer and apply the mods. The buffer then remains locked
until the transaction is committed into the incore log buffer. The result
of this is that with enough transactions on the fly the incore superblock
buffer becomes a bottleneck.
The result of contention on the incore superblock buffer is that
transaction rates fall - the more pressure that is put on the superblock
buffer, the slower things go.
The key to removing the contention is to not require the superblock fields
in question to be locked. We do that by not marking the superblock dirty
in the transaction. IOWs, we modify the incore superblock but do not
modify the cached superblock buffer. In short, we do not log superblock
modifications to critical fields in the superblock on every transaction.
In fact we only do it just before we write the superblock to disk every
sync period or just before unmount.
This creates an interesting problem - if we don't log or write out the
fields in every transaction, then how do the values get recovered after a
crash? the answer is simple - we keep enough duplicate, logged information
in other structures that we can reconstruct the correct count after log
recovery has been performed.
It is the AGF and AGI structures that contain the duplicate information;
after recovery, we walk every AGI and AGF and sum their individual
counters to get the correct value, and we do a transaction into the log to
correct them. An optimisation of this is that if we have a clean unmount
record, we know the value in the superblock is correct, so we can avoid
the summation walk under normal conditions and so mount/recovery times do
not change under normal operation.
One wrinkle that was discovered during development was that the blocks
used in the freespace btrees are never accounted for in the AGF counters.
This was once a valid optimisation to make; when the filesystem is full,
the free space btrees are empty and consume no space. Hence when it
matters, the "accounting" is correct. But that means the when we do the
AGF summations, we would not have a correct count and xfs_check would
complain. Hence a new counter was added to track the number of blocks used
by the free space btrees. This is an *on-disk format change*.
As a result of this, lazy superblock counters are a mkfs option and at the
moment on linux there is no way to convert an old filesystem. This is
possible - xfs_db can be used to twiddle the right bits and then
xfs_repair will do the format conversion for you. Similarly, you can
convert backwards as well. At some point we'll add functionality to
xfs_admin to do the bit twiddling easily....
SGI-PV: 964999
SGI-Modid: xfs-linux-melb:xfs-kern:28652a
Signed-off-by: David Chinner <dgc@sgi.com>
Signed-off-by: Christoph Hellwig <hch@infradead.org>
Signed-off-by: Tim Shimmin <tes@sgi.com>
2007-05-24 13:26:31 +08:00
|
|
|
*
|
|
|
|
|
* Because we may not be keeping track of allocated/free inodes and
|
|
|
|
|
* used filesystem blocks in the superblock, we do not mark the
|
|
|
|
|
* superblock dirty in this transaction if we modify these fields.
|
|
|
|
|
* We still need to update the transaction deltas so that they get
|
|
|
|
|
* applied to the incore superblock, but we don't want them to
|
|
|
|
|
* cause the superblock to get locked and logged if these are the
|
|
|
|
|
* only fields in the superblock that the transaction modifies.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
|
|
|
|
void
|
|
|
|
|
xfs_trans_mod_sb(
|
|
|
|
|
xfs_trans_t *tp,
|
|
|
|
|
uint field,
|
2007-02-10 15:36:10 +08:00
|
|
|
int64_t delta)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
[XFS] Lazy Superblock Counters
When we have a couple of hundred transactions on the fly at once, they all
typically modify the on disk superblock in some way.
create/unclink/mkdir/rmdir modify inode counts, allocation/freeing modify
free block counts.
When these counts are modified in a transaction, they must eventually lock
the superblock buffer and apply the mods. The buffer then remains locked
until the transaction is committed into the incore log buffer. The result
of this is that with enough transactions on the fly the incore superblock
buffer becomes a bottleneck.
The result of contention on the incore superblock buffer is that
transaction rates fall - the more pressure that is put on the superblock
buffer, the slower things go.
The key to removing the contention is to not require the superblock fields
in question to be locked. We do that by not marking the superblock dirty
in the transaction. IOWs, we modify the incore superblock but do not
modify the cached superblock buffer. In short, we do not log superblock
modifications to critical fields in the superblock on every transaction.
In fact we only do it just before we write the superblock to disk every
sync period or just before unmount.
This creates an interesting problem - if we don't log or write out the
fields in every transaction, then how do the values get recovered after a
crash? the answer is simple - we keep enough duplicate, logged information
in other structures that we can reconstruct the correct count after log
recovery has been performed.
It is the AGF and AGI structures that contain the duplicate information;
after recovery, we walk every AGI and AGF and sum their individual
counters to get the correct value, and we do a transaction into the log to
correct them. An optimisation of this is that if we have a clean unmount
record, we know the value in the superblock is correct, so we can avoid
the summation walk under normal conditions and so mount/recovery times do
not change under normal operation.
One wrinkle that was discovered during development was that the blocks
used in the freespace btrees are never accounted for in the AGF counters.
This was once a valid optimisation to make; when the filesystem is full,
the free space btrees are empty and consume no space. Hence when it
matters, the "accounting" is correct. But that means the when we do the
AGF summations, we would not have a correct count and xfs_check would
complain. Hence a new counter was added to track the number of blocks used
by the free space btrees. This is an *on-disk format change*.
As a result of this, lazy superblock counters are a mkfs option and at the
moment on linux there is no way to convert an old filesystem. This is
possible - xfs_db can be used to twiddle the right bits and then
xfs_repair will do the format conversion for you. Similarly, you can
convert backwards as well. At some point we'll add functionality to
xfs_admin to do the bit twiddling easily....
SGI-PV: 964999
SGI-Modid: xfs-linux-melb:xfs-kern:28652a
Signed-off-by: David Chinner <dgc@sgi.com>
Signed-off-by: Christoph Hellwig <hch@infradead.org>
Signed-off-by: Tim Shimmin <tes@sgi.com>
2007-05-24 13:26:31 +08:00
|
|
|
uint32_t flags = (XFS_TRANS_DIRTY|XFS_TRANS_SB_DIRTY);
|
|
|
|
|
xfs_mount_t *mp = tp->t_mountp;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
switch (field) {
|
|
|
|
|
case XFS_TRANS_SB_ICOUNT:
|
|
|
|
|
tp->t_icount_delta += delta;
|
[XFS] Lazy Superblock Counters
When we have a couple of hundred transactions on the fly at once, they all
typically modify the on disk superblock in some way.
create/unclink/mkdir/rmdir modify inode counts, allocation/freeing modify
free block counts.
When these counts are modified in a transaction, they must eventually lock
the superblock buffer and apply the mods. The buffer then remains locked
until the transaction is committed into the incore log buffer. The result
of this is that with enough transactions on the fly the incore superblock
buffer becomes a bottleneck.
The result of contention on the incore superblock buffer is that
transaction rates fall - the more pressure that is put on the superblock
buffer, the slower things go.
The key to removing the contention is to not require the superblock fields
in question to be locked. We do that by not marking the superblock dirty
in the transaction. IOWs, we modify the incore superblock but do not
modify the cached superblock buffer. In short, we do not log superblock
modifications to critical fields in the superblock on every transaction.
In fact we only do it just before we write the superblock to disk every
sync period or just before unmount.
This creates an interesting problem - if we don't log or write out the
fields in every transaction, then how do the values get recovered after a
crash? the answer is simple - we keep enough duplicate, logged information
in other structures that we can reconstruct the correct count after log
recovery has been performed.
It is the AGF and AGI structures that contain the duplicate information;
after recovery, we walk every AGI and AGF and sum their individual
counters to get the correct value, and we do a transaction into the log to
correct them. An optimisation of this is that if we have a clean unmount
record, we know the value in the superblock is correct, so we can avoid
the summation walk under normal conditions and so mount/recovery times do
not change under normal operation.
One wrinkle that was discovered during development was that the blocks
used in the freespace btrees are never accounted for in the AGF counters.
This was once a valid optimisation to make; when the filesystem is full,
the free space btrees are empty and consume no space. Hence when it
matters, the "accounting" is correct. But that means the when we do the
AGF summations, we would not have a correct count and xfs_check would
complain. Hence a new counter was added to track the number of blocks used
by the free space btrees. This is an *on-disk format change*.
As a result of this, lazy superblock counters are a mkfs option and at the
moment on linux there is no way to convert an old filesystem. This is
possible - xfs_db can be used to twiddle the right bits and then
xfs_repair will do the format conversion for you. Similarly, you can
convert backwards as well. At some point we'll add functionality to
xfs_admin to do the bit twiddling easily....
SGI-PV: 964999
SGI-Modid: xfs-linux-melb:xfs-kern:28652a
Signed-off-by: David Chinner <dgc@sgi.com>
Signed-off-by: Christoph Hellwig <hch@infradead.org>
Signed-off-by: Tim Shimmin <tes@sgi.com>
2007-05-24 13:26:31 +08:00
|
|
|
if (xfs_sb_version_haslazysbcount(&mp->m_sb))
|
|
|
|
|
flags &= ~XFS_TRANS_SB_DIRTY;
|
2005-04-17 06:20:36 +08:00
|
|
|
break;
|
|
|
|
|
case XFS_TRANS_SB_IFREE:
|
|
|
|
|
tp->t_ifree_delta += delta;
|
[XFS] Lazy Superblock Counters
When we have a couple of hundred transactions on the fly at once, they all
typically modify the on disk superblock in some way.
create/unclink/mkdir/rmdir modify inode counts, allocation/freeing modify
free block counts.
When these counts are modified in a transaction, they must eventually lock
the superblock buffer and apply the mods. The buffer then remains locked
until the transaction is committed into the incore log buffer. The result
of this is that with enough transactions on the fly the incore superblock
buffer becomes a bottleneck.
The result of contention on the incore superblock buffer is that
transaction rates fall - the more pressure that is put on the superblock
buffer, the slower things go.
The key to removing the contention is to not require the superblock fields
in question to be locked. We do that by not marking the superblock dirty
in the transaction. IOWs, we modify the incore superblock but do not
modify the cached superblock buffer. In short, we do not log superblock
modifications to critical fields in the superblock on every transaction.
In fact we only do it just before we write the superblock to disk every
sync period or just before unmount.
This creates an interesting problem - if we don't log or write out the
fields in every transaction, then how do the values get recovered after a
crash? the answer is simple - we keep enough duplicate, logged information
in other structures that we can reconstruct the correct count after log
recovery has been performed.
It is the AGF and AGI structures that contain the duplicate information;
after recovery, we walk every AGI and AGF and sum their individual
counters to get the correct value, and we do a transaction into the log to
correct them. An optimisation of this is that if we have a clean unmount
record, we know the value in the superblock is correct, so we can avoid
the summation walk under normal conditions and so mount/recovery times do
not change under normal operation.
One wrinkle that was discovered during development was that the blocks
used in the freespace btrees are never accounted for in the AGF counters.
This was once a valid optimisation to make; when the filesystem is full,
the free space btrees are empty and consume no space. Hence when it
matters, the "accounting" is correct. But that means the when we do the
AGF summations, we would not have a correct count and xfs_check would
complain. Hence a new counter was added to track the number of blocks used
by the free space btrees. This is an *on-disk format change*.
As a result of this, lazy superblock counters are a mkfs option and at the
moment on linux there is no way to convert an old filesystem. This is
possible - xfs_db can be used to twiddle the right bits and then
xfs_repair will do the format conversion for you. Similarly, you can
convert backwards as well. At some point we'll add functionality to
xfs_admin to do the bit twiddling easily....
SGI-PV: 964999
SGI-Modid: xfs-linux-melb:xfs-kern:28652a
Signed-off-by: David Chinner <dgc@sgi.com>
Signed-off-by: Christoph Hellwig <hch@infradead.org>
Signed-off-by: Tim Shimmin <tes@sgi.com>
2007-05-24 13:26:31 +08:00
|
|
|
if (xfs_sb_version_haslazysbcount(&mp->m_sb))
|
|
|
|
|
flags &= ~XFS_TRANS_SB_DIRTY;
|
2005-04-17 06:20:36 +08:00
|
|
|
break;
|
|
|
|
|
case XFS_TRANS_SB_FDBLOCKS:
|
|
|
|
|
/*
|
|
|
|
|
* Track the number of blocks allocated in the
|
|
|
|
|
* transaction. Make sure it does not exceed the
|
|
|
|
|
* number reserved.
|
|
|
|
|
*/
|
|
|
|
|
if (delta < 0) {
|
|
|
|
|
tp->t_blk_res_used += (uint)-delta;
|
|
|
|
|
ASSERT(tp->t_blk_res_used <= tp->t_blk_res);
|
|
|
|
|
}
|
|
|
|
|
tp->t_fdblocks_delta += delta;
|
[XFS] Lazy Superblock Counters
When we have a couple of hundred transactions on the fly at once, they all
typically modify the on disk superblock in some way.
create/unclink/mkdir/rmdir modify inode counts, allocation/freeing modify
free block counts.
When these counts are modified in a transaction, they must eventually lock
the superblock buffer and apply the mods. The buffer then remains locked
until the transaction is committed into the incore log buffer. The result
of this is that with enough transactions on the fly the incore superblock
buffer becomes a bottleneck.
The result of contention on the incore superblock buffer is that
transaction rates fall - the more pressure that is put on the superblock
buffer, the slower things go.
The key to removing the contention is to not require the superblock fields
in question to be locked. We do that by not marking the superblock dirty
in the transaction. IOWs, we modify the incore superblock but do not
modify the cached superblock buffer. In short, we do not log superblock
modifications to critical fields in the superblock on every transaction.
In fact we only do it just before we write the superblock to disk every
sync period or just before unmount.
This creates an interesting problem - if we don't log or write out the
fields in every transaction, then how do the values get recovered after a
crash? the answer is simple - we keep enough duplicate, logged information
in other structures that we can reconstruct the correct count after log
recovery has been performed.
It is the AGF and AGI structures that contain the duplicate information;
after recovery, we walk every AGI and AGF and sum their individual
counters to get the correct value, and we do a transaction into the log to
correct them. An optimisation of this is that if we have a clean unmount
record, we know the value in the superblock is correct, so we can avoid
the summation walk under normal conditions and so mount/recovery times do
not change under normal operation.
One wrinkle that was discovered during development was that the blocks
used in the freespace btrees are never accounted for in the AGF counters.
This was once a valid optimisation to make; when the filesystem is full,
the free space btrees are empty and consume no space. Hence when it
matters, the "accounting" is correct. But that means the when we do the
AGF summations, we would not have a correct count and xfs_check would
complain. Hence a new counter was added to track the number of blocks used
by the free space btrees. This is an *on-disk format change*.
As a result of this, lazy superblock counters are a mkfs option and at the
moment on linux there is no way to convert an old filesystem. This is
possible - xfs_db can be used to twiddle the right bits and then
xfs_repair will do the format conversion for you. Similarly, you can
convert backwards as well. At some point we'll add functionality to
xfs_admin to do the bit twiddling easily....
SGI-PV: 964999
SGI-Modid: xfs-linux-melb:xfs-kern:28652a
Signed-off-by: David Chinner <dgc@sgi.com>
Signed-off-by: Christoph Hellwig <hch@infradead.org>
Signed-off-by: Tim Shimmin <tes@sgi.com>
2007-05-24 13:26:31 +08:00
|
|
|
if (xfs_sb_version_haslazysbcount(&mp->m_sb))
|
|
|
|
|
flags &= ~XFS_TRANS_SB_DIRTY;
|
2005-04-17 06:20:36 +08:00
|
|
|
break;
|
|
|
|
|
case XFS_TRANS_SB_RES_FDBLOCKS:
|
|
|
|
|
/*
|
|
|
|
|
* The allocation has already been applied to the
|
|
|
|
|
* in-core superblock's counter. This should only
|
|
|
|
|
* be applied to the on-disk superblock.
|
|
|
|
|
*/
|
|
|
|
|
ASSERT(delta < 0);
|
|
|
|
|
tp->t_res_fdblocks_delta += delta;
|
[XFS] Lazy Superblock Counters
When we have a couple of hundred transactions on the fly at once, they all
typically modify the on disk superblock in some way.
create/unclink/mkdir/rmdir modify inode counts, allocation/freeing modify
free block counts.
When these counts are modified in a transaction, they must eventually lock
the superblock buffer and apply the mods. The buffer then remains locked
until the transaction is committed into the incore log buffer. The result
of this is that with enough transactions on the fly the incore superblock
buffer becomes a bottleneck.
The result of contention on the incore superblock buffer is that
transaction rates fall - the more pressure that is put on the superblock
buffer, the slower things go.
The key to removing the contention is to not require the superblock fields
in question to be locked. We do that by not marking the superblock dirty
in the transaction. IOWs, we modify the incore superblock but do not
modify the cached superblock buffer. In short, we do not log superblock
modifications to critical fields in the superblock on every transaction.
In fact we only do it just before we write the superblock to disk every
sync period or just before unmount.
This creates an interesting problem - if we don't log or write out the
fields in every transaction, then how do the values get recovered after a
crash? the answer is simple - we keep enough duplicate, logged information
in other structures that we can reconstruct the correct count after log
recovery has been performed.
It is the AGF and AGI structures that contain the duplicate information;
after recovery, we walk every AGI and AGF and sum their individual
counters to get the correct value, and we do a transaction into the log to
correct them. An optimisation of this is that if we have a clean unmount
record, we know the value in the superblock is correct, so we can avoid
the summation walk under normal conditions and so mount/recovery times do
not change under normal operation.
One wrinkle that was discovered during development was that the blocks
used in the freespace btrees are never accounted for in the AGF counters.
This was once a valid optimisation to make; when the filesystem is full,
the free space btrees are empty and consume no space. Hence when it
matters, the "accounting" is correct. But that means the when we do the
AGF summations, we would not have a correct count and xfs_check would
complain. Hence a new counter was added to track the number of blocks used
by the free space btrees. This is an *on-disk format change*.
As a result of this, lazy superblock counters are a mkfs option and at the
moment on linux there is no way to convert an old filesystem. This is
possible - xfs_db can be used to twiddle the right bits and then
xfs_repair will do the format conversion for you. Similarly, you can
convert backwards as well. At some point we'll add functionality to
xfs_admin to do the bit twiddling easily....
SGI-PV: 964999
SGI-Modid: xfs-linux-melb:xfs-kern:28652a
Signed-off-by: David Chinner <dgc@sgi.com>
Signed-off-by: Christoph Hellwig <hch@infradead.org>
Signed-off-by: Tim Shimmin <tes@sgi.com>
2007-05-24 13:26:31 +08:00
|
|
|
if (xfs_sb_version_haslazysbcount(&mp->m_sb))
|
|
|
|
|
flags &= ~XFS_TRANS_SB_DIRTY;
|
2005-04-17 06:20:36 +08:00
|
|
|
break;
|
|
|
|
|
case XFS_TRANS_SB_FREXTENTS:
|
|
|
|
|
/*
|
|
|
|
|
* Track the number of blocks allocated in the
|
|
|
|
|
* transaction. Make sure it does not exceed the
|
|
|
|
|
* number reserved.
|
|
|
|
|
*/
|
|
|
|
|
if (delta < 0) {
|
|
|
|
|
tp->t_rtx_res_used += (uint)-delta;
|
|
|
|
|
ASSERT(tp->t_rtx_res_used <= tp->t_rtx_res);
|
|
|
|
|
}
|
|
|
|
|
tp->t_frextents_delta += delta;
|
|
|
|
|
break;
|
|
|
|
|
case XFS_TRANS_SB_RES_FREXTENTS:
|
|
|
|
|
/*
|
|
|
|
|
* The allocation has already been applied to the
|
2006-03-29 06:55:14 +08:00
|
|
|
* in-core superblock's counter. This should only
|
2005-04-17 06:20:36 +08:00
|
|
|
* be applied to the on-disk superblock.
|
|
|
|
|
*/
|
|
|
|
|
ASSERT(delta < 0);
|
|
|
|
|
tp->t_res_frextents_delta += delta;
|
|
|
|
|
break;
|
|
|
|
|
case XFS_TRANS_SB_DBLOCKS:
|
|
|
|
|
ASSERT(delta > 0);
|
|
|
|
|
tp->t_dblocks_delta += delta;
|
|
|
|
|
break;
|
|
|
|
|
case XFS_TRANS_SB_AGCOUNT:
|
|
|
|
|
ASSERT(delta > 0);
|
|
|
|
|
tp->t_agcount_delta += delta;
|
|
|
|
|
break;
|
|
|
|
|
case XFS_TRANS_SB_IMAXPCT:
|
|
|
|
|
tp->t_imaxpct_delta += delta;
|
|
|
|
|
break;
|
|
|
|
|
case XFS_TRANS_SB_REXTSIZE:
|
|
|
|
|
tp->t_rextsize_delta += delta;
|
|
|
|
|
break;
|
|
|
|
|
case XFS_TRANS_SB_RBMBLOCKS:
|
|
|
|
|
tp->t_rbmblocks_delta += delta;
|
|
|
|
|
break;
|
|
|
|
|
case XFS_TRANS_SB_RBLOCKS:
|
|
|
|
|
tp->t_rblocks_delta += delta;
|
|
|
|
|
break;
|
|
|
|
|
case XFS_TRANS_SB_REXTENTS:
|
|
|
|
|
tp->t_rextents_delta += delta;
|
|
|
|
|
break;
|
|
|
|
|
case XFS_TRANS_SB_REXTSLOG:
|
|
|
|
|
tp->t_rextslog_delta += delta;
|
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
ASSERT(0);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
2007-05-24 13:26:51 +08:00
|
|
|
tp->t_flags |= flags;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* xfs_trans_apply_sb_deltas() is called from the commit code
|
|
|
|
|
* to bring the superblock buffer into the current transaction
|
|
|
|
|
* and modify it as requested by earlier calls to xfs_trans_mod_sb().
|
|
|
|
|
*
|
|
|
|
|
* For now we just look at each field allowed to change and change
|
|
|
|
|
* it if necessary.
|
|
|
|
|
*/
|
|
|
|
|
STATIC void
|
|
|
|
|
xfs_trans_apply_sb_deltas(
|
|
|
|
|
xfs_trans_t *tp)
|
|
|
|
|
{
|
2007-08-28 11:58:06 +08:00
|
|
|
xfs_dsb_t *sbp;
|
2005-04-17 06:20:36 +08:00
|
|
|
xfs_buf_t *bp;
|
|
|
|
|
int whole = 0;
|
|
|
|
|
|
|
|
|
|
bp = xfs_trans_getsb(tp, tp->t_mountp, 0);
|
|
|
|
|
sbp = XFS_BUF_TO_SBP(bp);
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Check that superblock mods match the mods made to AGF counters.
|
|
|
|
|
*/
|
|
|
|
|
ASSERT((tp->t_fdblocks_delta + tp->t_res_fdblocks_delta) ==
|
|
|
|
|
(tp->t_ag_freeblks_delta + tp->t_ag_flist_delta +
|
|
|
|
|
tp->t_ag_btree_delta));
|
|
|
|
|
|
[XFS] Lazy Superblock Counters
When we have a couple of hundred transactions on the fly at once, they all
typically modify the on disk superblock in some way.
create/unclink/mkdir/rmdir modify inode counts, allocation/freeing modify
free block counts.
When these counts are modified in a transaction, they must eventually lock
the superblock buffer and apply the mods. The buffer then remains locked
until the transaction is committed into the incore log buffer. The result
of this is that with enough transactions on the fly the incore superblock
buffer becomes a bottleneck.
The result of contention on the incore superblock buffer is that
transaction rates fall - the more pressure that is put on the superblock
buffer, the slower things go.
The key to removing the contention is to not require the superblock fields
in question to be locked. We do that by not marking the superblock dirty
in the transaction. IOWs, we modify the incore superblock but do not
modify the cached superblock buffer. In short, we do not log superblock
modifications to critical fields in the superblock on every transaction.
In fact we only do it just before we write the superblock to disk every
sync period or just before unmount.
This creates an interesting problem - if we don't log or write out the
fields in every transaction, then how do the values get recovered after a
crash? the answer is simple - we keep enough duplicate, logged information
in other structures that we can reconstruct the correct count after log
recovery has been performed.
It is the AGF and AGI structures that contain the duplicate information;
after recovery, we walk every AGI and AGF and sum their individual
counters to get the correct value, and we do a transaction into the log to
correct them. An optimisation of this is that if we have a clean unmount
record, we know the value in the superblock is correct, so we can avoid
the summation walk under normal conditions and so mount/recovery times do
not change under normal operation.
One wrinkle that was discovered during development was that the blocks
used in the freespace btrees are never accounted for in the AGF counters.
This was once a valid optimisation to make; when the filesystem is full,
the free space btrees are empty and consume no space. Hence when it
matters, the "accounting" is correct. But that means the when we do the
AGF summations, we would not have a correct count and xfs_check would
complain. Hence a new counter was added to track the number of blocks used
by the free space btrees. This is an *on-disk format change*.
As a result of this, lazy superblock counters are a mkfs option and at the
moment on linux there is no way to convert an old filesystem. This is
possible - xfs_db can be used to twiddle the right bits and then
xfs_repair will do the format conversion for you. Similarly, you can
convert backwards as well. At some point we'll add functionality to
xfs_admin to do the bit twiddling easily....
SGI-PV: 964999
SGI-Modid: xfs-linux-melb:xfs-kern:28652a
Signed-off-by: David Chinner <dgc@sgi.com>
Signed-off-by: Christoph Hellwig <hch@infradead.org>
Signed-off-by: Tim Shimmin <tes@sgi.com>
2007-05-24 13:26:31 +08:00
|
|
|
/*
|
|
|
|
|
* Only update the superblock counters if we are logging them
|
|
|
|
|
*/
|
|
|
|
|
if (!xfs_sb_version_haslazysbcount(&(tp->t_mountp->m_sb))) {
|
2007-08-28 11:58:06 +08:00
|
|
|
if (tp->t_icount_delta)
|
2008-02-14 07:03:29 +08:00
|
|
|
be64_add_cpu(&sbp->sb_icount, tp->t_icount_delta);
|
2007-08-28 11:58:06 +08:00
|
|
|
if (tp->t_ifree_delta)
|
2008-02-14 07:03:29 +08:00
|
|
|
be64_add_cpu(&sbp->sb_ifree, tp->t_ifree_delta);
|
2007-08-28 11:58:06 +08:00
|
|
|
if (tp->t_fdblocks_delta)
|
2008-02-14 07:03:29 +08:00
|
|
|
be64_add_cpu(&sbp->sb_fdblocks, tp->t_fdblocks_delta);
|
2007-08-28 11:58:06 +08:00
|
|
|
if (tp->t_res_fdblocks_delta)
|
2008-02-14 07:03:29 +08:00
|
|
|
be64_add_cpu(&sbp->sb_fdblocks, tp->t_res_fdblocks_delta);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
2007-08-28 11:58:06 +08:00
|
|
|
if (tp->t_frextents_delta)
|
2008-02-14 07:03:29 +08:00
|
|
|
be64_add_cpu(&sbp->sb_frextents, tp->t_frextents_delta);
|
2007-08-28 11:58:06 +08:00
|
|
|
if (tp->t_res_frextents_delta)
|
2008-02-14 07:03:29 +08:00
|
|
|
be64_add_cpu(&sbp->sb_frextents, tp->t_res_frextents_delta);
|
2007-08-28 11:58:06 +08:00
|
|
|
|
|
|
|
|
if (tp->t_dblocks_delta) {
|
2008-02-14 07:03:29 +08:00
|
|
|
be64_add_cpu(&sbp->sb_dblocks, tp->t_dblocks_delta);
|
2005-04-17 06:20:36 +08:00
|
|
|
whole = 1;
|
|
|
|
|
}
|
2007-08-28 11:58:06 +08:00
|
|
|
if (tp->t_agcount_delta) {
|
2008-02-14 07:03:29 +08:00
|
|
|
be32_add_cpu(&sbp->sb_agcount, tp->t_agcount_delta);
|
2005-04-17 06:20:36 +08:00
|
|
|
whole = 1;
|
|
|
|
|
}
|
2007-08-28 11:58:06 +08:00
|
|
|
if (tp->t_imaxpct_delta) {
|
|
|
|
|
sbp->sb_imax_pct += tp->t_imaxpct_delta;
|
2005-04-17 06:20:36 +08:00
|
|
|
whole = 1;
|
|
|
|
|
}
|
2007-08-28 11:58:06 +08:00
|
|
|
if (tp->t_rextsize_delta) {
|
2008-02-14 07:03:29 +08:00
|
|
|
be32_add_cpu(&sbp->sb_rextsize, tp->t_rextsize_delta);
|
2005-04-17 06:20:36 +08:00
|
|
|
whole = 1;
|
|
|
|
|
}
|
2007-08-28 11:58:06 +08:00
|
|
|
if (tp->t_rbmblocks_delta) {
|
2008-02-14 07:03:29 +08:00
|
|
|
be32_add_cpu(&sbp->sb_rbmblocks, tp->t_rbmblocks_delta);
|
2005-04-17 06:20:36 +08:00
|
|
|
whole = 1;
|
|
|
|
|
}
|
2007-08-28 11:58:06 +08:00
|
|
|
if (tp->t_rblocks_delta) {
|
2008-02-14 07:03:29 +08:00
|
|
|
be64_add_cpu(&sbp->sb_rblocks, tp->t_rblocks_delta);
|
2005-04-17 06:20:36 +08:00
|
|
|
whole = 1;
|
|
|
|
|
}
|
2007-08-28 11:58:06 +08:00
|
|
|
if (tp->t_rextents_delta) {
|
2008-02-14 07:03:29 +08:00
|
|
|
be64_add_cpu(&sbp->sb_rextents, tp->t_rextents_delta);
|
2005-04-17 06:20:36 +08:00
|
|
|
whole = 1;
|
|
|
|
|
}
|
2007-08-28 11:58:06 +08:00
|
|
|
if (tp->t_rextslog_delta) {
|
|
|
|
|
sbp->sb_rextslog += tp->t_rextslog_delta;
|
2005-04-17 06:20:36 +08:00
|
|
|
whole = 1;
|
|
|
|
|
}
|
|
|
|
|
|
2015-01-22 06:30:23 +08:00
|
|
|
xfs_trans_buf_set_type(tp, bp, XFS_BLFT_SB_BUF);
|
2005-04-17 06:20:36 +08:00
|
|
|
if (whole)
|
|
|
|
|
/*
|
2006-03-29 06:55:14 +08:00
|
|
|
* Log the whole thing, the fields are noncontiguous.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
2007-08-28 11:58:06 +08:00
|
|
|
xfs_trans_log_buf(tp, bp, 0, sizeof(xfs_dsb_t) - 1);
|
2005-04-17 06:20:36 +08:00
|
|
|
else
|
|
|
|
|
/*
|
|
|
|
|
* Since all the modifiable fields are contiguous, we
|
|
|
|
|
* can get away with this.
|
|
|
|
|
*/
|
2007-08-28 11:58:06 +08:00
|
|
|
xfs_trans_log_buf(tp, bp, offsetof(xfs_dsb_t, sb_icount),
|
|
|
|
|
offsetof(xfs_dsb_t, sb_frextents) +
|
2005-04-17 06:20:36 +08:00
|
|
|
sizeof(sbp->sb_frextents) - 1);
|
|
|
|
|
}
|
|
|
|
|
|
2015-02-23 18:24:11 +08:00
|
|
|
STATIC int
|
|
|
|
|
xfs_sb_mod8(
|
|
|
|
|
uint8_t *field,
|
|
|
|
|
int8_t delta)
|
|
|
|
|
{
|
|
|
|
|
int8_t counter = *field;
|
|
|
|
|
|
|
|
|
|
counter += delta;
|
|
|
|
|
if (counter < 0) {
|
|
|
|
|
ASSERT(0);
|
|
|
|
|
return -EINVAL;
|
|
|
|
|
}
|
|
|
|
|
*field = counter;
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
STATIC int
|
|
|
|
|
xfs_sb_mod32(
|
|
|
|
|
uint32_t *field,
|
|
|
|
|
int32_t delta)
|
|
|
|
|
{
|
|
|
|
|
int32_t counter = *field;
|
|
|
|
|
|
|
|
|
|
counter += delta;
|
|
|
|
|
if (counter < 0) {
|
|
|
|
|
ASSERT(0);
|
|
|
|
|
return -EINVAL;
|
|
|
|
|
}
|
|
|
|
|
*field = counter;
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
STATIC int
|
|
|
|
|
xfs_sb_mod64(
|
|
|
|
|
uint64_t *field,
|
|
|
|
|
int64_t delta)
|
|
|
|
|
{
|
|
|
|
|
int64_t counter = *field;
|
|
|
|
|
|
|
|
|
|
counter += delta;
|
|
|
|
|
if (counter < 0) {
|
|
|
|
|
ASSERT(0);
|
|
|
|
|
return -EINVAL;
|
|
|
|
|
}
|
|
|
|
|
*field = counter;
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
2007-06-18 14:49:44 +08:00
|
|
|
* xfs_trans_unreserve_and_mod_sb() is called to release unused reservations
|
|
|
|
|
* and apply superblock counter changes to the in-core superblock. The
|
|
|
|
|
* t_res_fdblocks_delta and t_res_frextents_delta fields are explicitly NOT
|
|
|
|
|
* applied to the in-core superblock. The idea is that that has already been
|
|
|
|
|
* done.
|
2005-04-17 06:20:36 +08:00
|
|
|
*
|
2007-06-18 14:49:44 +08:00
|
|
|
* If we are not logging superblock counters, then the inode allocated/free and
|
|
|
|
|
* used block counts are not updated in the on disk superblock. In this case,
|
|
|
|
|
* XFS_TRANS_SB_DIRTY will not be set when the transaction is updated but we
|
|
|
|
|
* still need to update the incore superblock with the changes.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
xfs: Introduce delayed logging core code
The delayed logging code only changes in-memory structures and as
such can be enabled and disabled with a mount option. Add the mount
option and emit a warning that this is an experimental feature that
should not be used in production yet.
We also need infrastructure to track committed items that have not
yet been written to the log. This is what the Committed Item List
(CIL) is for.
The log item also needs to be extended to track the current log
vector, the associated memory buffer and it's location in the Commit
Item List. Extend the log item and log vector structures to enable
this tracking.
To maintain the current log format for transactions with delayed
logging, we need to introduce a checkpoint transaction and a context
for tracking each checkpoint from initiation to transaction
completion. This includes adding a log ticket for tracking space
log required/used by the context checkpoint.
To track all the changes we need an io vector array per log item,
rather than a single array for the entire transaction. Using the new
log vector structure for this requires two passes - the first to
allocate the log vector structures and chain them together, and the
second to fill them out. This log vector chain can then be passed
to the CIL for formatting, pinning and insertion into the CIL.
Formatting of the log vector chain is relatively simple - it's just
a loop over the iovecs on each log vector, but it is made slightly
more complex because we re-write the iovec after the copy to point
back at the memory buffer we just copied into.
This code also needs to pin log items. If the log item is not
already tracked in this checkpoint context, then it needs to be
pinned. Otherwise it is already pinned and we don't need to pin it
again.
The only other complexity is calculating the amount of new log space
the formatting has consumed. This needs to be accounted to the
transaction in progress, and the accounting is made more complex
becase we need also to steal space from it for log metadata in the
checkpoint transaction. Calculate all this at insert time and update
all the tickets, counters, etc correctly.
Once we've formatted all the log items in the transaction, attach
the busy extents to the checkpoint context so the busy extents live
until checkpoint completion and can be processed at that point in
time. Transactions can then be freed at this point in time.
Now we need to issue checkpoints - we are tracking the amount of log space
used by the items in the CIL, so we can trigger background checkpoints when the
space usage gets to a certain threshold. Otherwise, checkpoints need ot be
triggered when a log synchronisation point is reached - a log force event.
Because the log write code already handles chained log vectors, writing the
transaction is trivial, too. Construct a transaction header, add it
to the head of the chain and write it into the log, then issue a
commit record write. Then we can release the checkpoint log ticket
and attach the context to the log buffer so it can be called during
Io completion to complete the checkpoint.
We also need to allow for synchronising multiple in-flight
checkpoints. This is needed for two things - the first is to ensure
that checkpoint commit records appear in the log in the correct
sequence order (so they are replayed in the correct order). The
second is so that xfs_log_force_lsn() operates correctly and only
flushes and/or waits for the specific sequence it was provided with.
To do this we need a wait variable and a list tracking the
checkpoint commits in progress. We can walk this list and wait for
the checkpoints to change state or complete easily, an this provides
the necessary synchronisation for correct operation in both cases.
Signed-off-by: Dave Chinner <dchinner@redhat.com>
Reviewed-by: Christoph Hellwig <hch@lst.de>
Signed-off-by: Alex Elder <aelder@sgi.com>
2010-05-21 12:37:18 +08:00
|
|
|
void
|
2005-04-17 06:20:36 +08:00
|
|
|
xfs_trans_unreserve_and_mod_sb(
|
2015-02-23 18:24:11 +08:00
|
|
|
struct xfs_trans *tp)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2015-02-23 18:24:11 +08:00
|
|
|
struct xfs_mount *mp = tp->t_mountp;
|
|
|
|
|
bool rsvd = (tp->t_flags & XFS_TRANS_RESERVE) != 0;
|
|
|
|
|
int64_t blkdelta = 0;
|
|
|
|
|
int64_t rtxdelta = 0;
|
|
|
|
|
int64_t idelta = 0;
|
|
|
|
|
int64_t ifreedelta = 0;
|
|
|
|
|
int error;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2010-09-30 10:25:56 +08:00
|
|
|
/* calculate deltas */
|
2007-06-18 14:49:44 +08:00
|
|
|
if (tp->t_blk_res > 0)
|
|
|
|
|
blkdelta = tp->t_blk_res;
|
|
|
|
|
if ((tp->t_fdblocks_delta != 0) &&
|
|
|
|
|
(xfs_sb_version_haslazysbcount(&mp->m_sb) ||
|
|
|
|
|
(tp->t_flags & XFS_TRANS_SB_DIRTY)))
|
|
|
|
|
blkdelta += tp->t_fdblocks_delta;
|
|
|
|
|
|
|
|
|
|
if (tp->t_rtx_res > 0)
|
|
|
|
|
rtxdelta = tp->t_rtx_res;
|
|
|
|
|
if ((tp->t_frextents_delta != 0) &&
|
|
|
|
|
(tp->t_flags & XFS_TRANS_SB_DIRTY))
|
|
|
|
|
rtxdelta += tp->t_frextents_delta;
|
|
|
|
|
|
2010-09-30 10:25:56 +08:00
|
|
|
if (xfs_sb_version_haslazysbcount(&mp->m_sb) ||
|
|
|
|
|
(tp->t_flags & XFS_TRANS_SB_DIRTY)) {
|
|
|
|
|
idelta = tp->t_icount_delta;
|
|
|
|
|
ifreedelta = tp->t_ifree_delta;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* apply the per-cpu counters */
|
|
|
|
|
if (blkdelta) {
|
2015-02-23 18:22:03 +08:00
|
|
|
error = xfs_mod_fdblocks(mp, blkdelta, rsvd);
|
2010-09-30 10:25:56 +08:00
|
|
|
if (error)
|
|
|
|
|
goto out;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (idelta) {
|
2015-02-23 18:19:28 +08:00
|
|
|
error = xfs_mod_icount(mp, idelta);
|
2010-09-30 10:25:56 +08:00
|
|
|
if (error)
|
|
|
|
|
goto out_undo_fdblocks;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (ifreedelta) {
|
2015-02-23 18:19:53 +08:00
|
|
|
error = xfs_mod_ifree(mp, ifreedelta);
|
2010-09-30 10:25:56 +08:00
|
|
|
if (error)
|
|
|
|
|
goto out_undo_icount;
|
|
|
|
|
}
|
|
|
|
|
|
2015-02-23 18:24:11 +08:00
|
|
|
if (rtxdelta == 0 && !(tp->t_flags & XFS_TRANS_SB_DIRTY))
|
|
|
|
|
return;
|
|
|
|
|
|
2010-09-30 10:25:56 +08:00
|
|
|
/* apply remaining deltas */
|
2015-02-23 18:24:11 +08:00
|
|
|
spin_lock(&mp->m_sb_lock);
|
2015-02-23 18:22:54 +08:00
|
|
|
if (rtxdelta) {
|
2015-02-23 18:24:11 +08:00
|
|
|
error = xfs_sb_mod64(&mp->m_sb.sb_frextents, rtxdelta);
|
2015-02-23 18:22:54 +08:00
|
|
|
if (error)
|
|
|
|
|
goto out_undo_ifree;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
2015-02-23 18:24:11 +08:00
|
|
|
if (tp->t_dblocks_delta != 0) {
|
|
|
|
|
error = xfs_sb_mod64(&mp->m_sb.sb_dblocks, tp->t_dblocks_delta);
|
2010-09-30 10:25:56 +08:00
|
|
|
if (error)
|
2015-02-23 18:22:54 +08:00
|
|
|
goto out_undo_frextents;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
2015-02-23 18:24:11 +08:00
|
|
|
if (tp->t_agcount_delta != 0) {
|
|
|
|
|
error = xfs_sb_mod32(&mp->m_sb.sb_agcount, tp->t_agcount_delta);
|
|
|
|
|
if (error)
|
|
|
|
|
goto out_undo_dblocks;
|
|
|
|
|
}
|
|
|
|
|
if (tp->t_imaxpct_delta != 0) {
|
|
|
|
|
error = xfs_sb_mod8(&mp->m_sb.sb_imax_pct, tp->t_imaxpct_delta);
|
|
|
|
|
if (error)
|
|
|
|
|
goto out_undo_agcount;
|
|
|
|
|
}
|
|
|
|
|
if (tp->t_rextsize_delta != 0) {
|
|
|
|
|
error = xfs_sb_mod32(&mp->m_sb.sb_rextsize,
|
|
|
|
|
tp->t_rextsize_delta);
|
|
|
|
|
if (error)
|
|
|
|
|
goto out_undo_imaxpct;
|
|
|
|
|
}
|
|
|
|
|
if (tp->t_rbmblocks_delta != 0) {
|
|
|
|
|
error = xfs_sb_mod32(&mp->m_sb.sb_rbmblocks,
|
|
|
|
|
tp->t_rbmblocks_delta);
|
|
|
|
|
if (error)
|
|
|
|
|
goto out_undo_rextsize;
|
|
|
|
|
}
|
|
|
|
|
if (tp->t_rblocks_delta != 0) {
|
|
|
|
|
error = xfs_sb_mod64(&mp->m_sb.sb_rblocks, tp->t_rblocks_delta);
|
|
|
|
|
if (error)
|
|
|
|
|
goto out_undo_rbmblocks;
|
|
|
|
|
}
|
|
|
|
|
if (tp->t_rextents_delta != 0) {
|
|
|
|
|
error = xfs_sb_mod64(&mp->m_sb.sb_rextents,
|
|
|
|
|
tp->t_rextents_delta);
|
|
|
|
|
if (error)
|
|
|
|
|
goto out_undo_rblocks;
|
|
|
|
|
}
|
|
|
|
|
if (tp->t_rextslog_delta != 0) {
|
|
|
|
|
error = xfs_sb_mod8(&mp->m_sb.sb_rextslog,
|
|
|
|
|
tp->t_rextslog_delta);
|
|
|
|
|
if (error)
|
|
|
|
|
goto out_undo_rextents;
|
|
|
|
|
}
|
|
|
|
|
spin_unlock(&mp->m_sb_lock);
|
2010-09-30 10:25:56 +08:00
|
|
|
return;
|
|
|
|
|
|
2015-02-23 18:24:11 +08:00
|
|
|
out_undo_rextents:
|
|
|
|
|
if (tp->t_rextents_delta)
|
|
|
|
|
xfs_sb_mod64(&mp->m_sb.sb_rextents, -tp->t_rextents_delta);
|
|
|
|
|
out_undo_rblocks:
|
|
|
|
|
if (tp->t_rblocks_delta)
|
|
|
|
|
xfs_sb_mod64(&mp->m_sb.sb_rblocks, -tp->t_rblocks_delta);
|
|
|
|
|
out_undo_rbmblocks:
|
|
|
|
|
if (tp->t_rbmblocks_delta)
|
|
|
|
|
xfs_sb_mod32(&mp->m_sb.sb_rbmblocks, -tp->t_rbmblocks_delta);
|
|
|
|
|
out_undo_rextsize:
|
|
|
|
|
if (tp->t_rextsize_delta)
|
|
|
|
|
xfs_sb_mod32(&mp->m_sb.sb_rextsize, -tp->t_rextsize_delta);
|
|
|
|
|
out_undo_imaxpct:
|
|
|
|
|
if (tp->t_rextsize_delta)
|
|
|
|
|
xfs_sb_mod8(&mp->m_sb.sb_imax_pct, -tp->t_imaxpct_delta);
|
|
|
|
|
out_undo_agcount:
|
|
|
|
|
if (tp->t_agcount_delta)
|
|
|
|
|
xfs_sb_mod32(&mp->m_sb.sb_agcount, -tp->t_agcount_delta);
|
|
|
|
|
out_undo_dblocks:
|
|
|
|
|
if (tp->t_dblocks_delta)
|
|
|
|
|
xfs_sb_mod64(&mp->m_sb.sb_dblocks, -tp->t_dblocks_delta);
|
2015-02-23 18:22:54 +08:00
|
|
|
out_undo_frextents:
|
|
|
|
|
if (rtxdelta)
|
2015-02-23 18:24:11 +08:00
|
|
|
xfs_sb_mod64(&mp->m_sb.sb_frextents, -rtxdelta);
|
2015-02-23 18:22:54 +08:00
|
|
|
out_undo_ifree:
|
2015-02-23 18:24:11 +08:00
|
|
|
spin_unlock(&mp->m_sb_lock);
|
2010-09-30 10:25:56 +08:00
|
|
|
if (ifreedelta)
|
2015-02-23 18:19:53 +08:00
|
|
|
xfs_mod_ifree(mp, -ifreedelta);
|
2010-09-30 10:25:56 +08:00
|
|
|
out_undo_icount:
|
|
|
|
|
if (idelta)
|
2015-02-23 18:19:28 +08:00
|
|
|
xfs_mod_icount(mp, -idelta);
|
2010-09-30 10:25:56 +08:00
|
|
|
out_undo_fdblocks:
|
|
|
|
|
if (blkdelta)
|
2015-02-23 18:22:03 +08:00
|
|
|
xfs_mod_fdblocks(mp, -blkdelta, rsvd);
|
2010-09-30 10:25:56 +08:00
|
|
|
out:
|
2010-12-26 04:14:53 +08:00
|
|
|
ASSERT(error == 0);
|
2010-09-30 10:25:56 +08:00
|
|
|
return;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
2010-06-23 16:11:15 +08:00
|
|
|
/*
|
|
|
|
|
* Add the given log item to the transaction's list of log items.
|
|
|
|
|
*
|
|
|
|
|
* The log item will now point to its new descriptor with its li_desc field.
|
|
|
|
|
*/
|
|
|
|
|
void
|
|
|
|
|
xfs_trans_add_item(
|
|
|
|
|
struct xfs_trans *tp,
|
|
|
|
|
struct xfs_log_item *lip)
|
|
|
|
|
{
|
|
|
|
|
struct xfs_log_item_desc *lidp;
|
|
|
|
|
|
2012-02-14 04:51:05 +08:00
|
|
|
ASSERT(lip->li_mountp == tp->t_mountp);
|
|
|
|
|
ASSERT(lip->li_ailp == tp->t_mountp->m_ail);
|
2010-06-23 16:11:15 +08:00
|
|
|
|
2010-07-20 15:53:44 +08:00
|
|
|
lidp = kmem_zone_zalloc(xfs_log_item_desc_zone, KM_SLEEP | KM_NOFS);
|
2010-06-23 16:11:15 +08:00
|
|
|
|
|
|
|
|
lidp->lid_item = lip;
|
|
|
|
|
lidp->lid_flags = 0;
|
|
|
|
|
list_add_tail(&lidp->lid_trans, &tp->t_items);
|
|
|
|
|
|
|
|
|
|
lip->li_desc = lidp;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
STATIC void
|
|
|
|
|
xfs_trans_free_item_desc(
|
|
|
|
|
struct xfs_log_item_desc *lidp)
|
|
|
|
|
{
|
|
|
|
|
list_del_init(&lidp->lid_trans);
|
|
|
|
|
kmem_zone_free(xfs_log_item_desc_zone, lidp);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Unlink and free the given descriptor.
|
|
|
|
|
*/
|
|
|
|
|
void
|
|
|
|
|
xfs_trans_del_item(
|
|
|
|
|
struct xfs_log_item *lip)
|
|
|
|
|
{
|
|
|
|
|
xfs_trans_free_item_desc(lip->li_desc);
|
|
|
|
|
lip->li_desc = NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Unlock all of the items of a transaction and free all the descriptors
|
|
|
|
|
* of that transaction.
|
|
|
|
|
*/
|
2010-08-24 09:42:52 +08:00
|
|
|
void
|
2010-06-23 16:11:15 +08:00
|
|
|
xfs_trans_free_items(
|
|
|
|
|
struct xfs_trans *tp,
|
|
|
|
|
xfs_lsn_t commit_lsn,
|
2015-06-04 11:47:43 +08:00
|
|
|
bool abort)
|
2010-06-23 16:11:15 +08:00
|
|
|
{
|
|
|
|
|
struct xfs_log_item_desc *lidp, *next;
|
|
|
|
|
|
|
|
|
|
list_for_each_entry_safe(lidp, next, &tp->t_items, lid_trans) {
|
|
|
|
|
struct xfs_log_item *lip = lidp->lid_item;
|
|
|
|
|
|
|
|
|
|
lip->li_desc = NULL;
|
|
|
|
|
|
|
|
|
|
if (commit_lsn != NULLCOMMITLSN)
|
2013-08-28 19:12:03 +08:00
|
|
|
lip->li_ops->iop_committing(lip, commit_lsn);
|
2015-06-04 11:47:43 +08:00
|
|
|
if (abort)
|
2010-06-23 16:11:15 +08:00
|
|
|
lip->li_flags |= XFS_LI_ABORTED;
|
2013-08-28 19:12:03 +08:00
|
|
|
lip->li_ops->iop_unlock(lip);
|
2010-06-23 16:11:15 +08:00
|
|
|
|
|
|
|
|
xfs_trans_free_item_desc(lidp);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2010-12-20 09:02:19 +08:00
|
|
|
static inline void
|
|
|
|
|
xfs_log_item_batch_insert(
|
|
|
|
|
struct xfs_ail *ailp,
|
2011-07-18 11:40:16 +08:00
|
|
|
struct xfs_ail_cursor *cur,
|
2010-12-20 09:02:19 +08:00
|
|
|
struct xfs_log_item **log_items,
|
|
|
|
|
int nr_items,
|
|
|
|
|
xfs_lsn_t commit_lsn)
|
|
|
|
|
{
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
spin_lock(&ailp->xa_lock);
|
|
|
|
|
/* xfs_trans_ail_update_bulk drops ailp->xa_lock */
|
2011-07-18 11:40:16 +08:00
|
|
|
xfs_trans_ail_update_bulk(ailp, cur, log_items, nr_items, commit_lsn);
|
2010-12-20 09:02:19 +08:00
|
|
|
|
2013-08-28 19:12:03 +08:00
|
|
|
for (i = 0; i < nr_items; i++) {
|
|
|
|
|
struct xfs_log_item *lip = log_items[i];
|
|
|
|
|
|
|
|
|
|
lip->li_ops->iop_unpin(lip, 0);
|
|
|
|
|
}
|
2010-12-20 09:02:19 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Bulk operation version of xfs_trans_committed that takes a log vector of
|
|
|
|
|
* items to insert into the AIL. This uses bulk AIL insertion techniques to
|
|
|
|
|
* minimise lock traffic.
|
2011-01-27 09:13:35 +08:00
|
|
|
*
|
|
|
|
|
* If we are called with the aborted flag set, it is because a log write during
|
|
|
|
|
* a CIL checkpoint commit has failed. In this case, all the items in the
|
2013-08-28 19:12:03 +08:00
|
|
|
* checkpoint have already gone through iop_commited and iop_unlock, which
|
2011-01-27 09:13:35 +08:00
|
|
|
* means that checkpoint commit abort handling is treated exactly the same
|
|
|
|
|
* as an iclog write error even though we haven't started any IO yet. Hence in
|
2013-08-28 19:12:03 +08:00
|
|
|
* this case all we need to do is iop_committed processing, followed by an
|
|
|
|
|
* iop_unpin(aborted) call.
|
2011-07-18 11:40:16 +08:00
|
|
|
*
|
|
|
|
|
* The AIL cursor is used to optimise the insert process. If commit_lsn is not
|
|
|
|
|
* at the end of the AIL, the insert cursor avoids the need to walk
|
|
|
|
|
* the AIL to find the insertion point on every xfs_log_item_batch_insert()
|
|
|
|
|
* call. This saves a lot of needless list walking and is a net win, even
|
|
|
|
|
* though it slightly increases that amount of AIL lock traffic to set it up
|
|
|
|
|
* and tear it down.
|
2010-12-20 09:02:19 +08:00
|
|
|
*/
|
|
|
|
|
void
|
|
|
|
|
xfs_trans_committed_bulk(
|
|
|
|
|
struct xfs_ail *ailp,
|
|
|
|
|
struct xfs_log_vec *log_vector,
|
|
|
|
|
xfs_lsn_t commit_lsn,
|
|
|
|
|
int aborted)
|
|
|
|
|
{
|
|
|
|
|
#define LOG_ITEM_BATCH_SIZE 32
|
|
|
|
|
struct xfs_log_item *log_items[LOG_ITEM_BATCH_SIZE];
|
|
|
|
|
struct xfs_log_vec *lv;
|
2011-07-18 11:40:16 +08:00
|
|
|
struct xfs_ail_cursor cur;
|
2010-12-20 09:02:19 +08:00
|
|
|
int i = 0;
|
|
|
|
|
|
2011-07-18 11:40:16 +08:00
|
|
|
spin_lock(&ailp->xa_lock);
|
|
|
|
|
xfs_trans_ail_cursor_last(ailp, &cur, commit_lsn);
|
|
|
|
|
spin_unlock(&ailp->xa_lock);
|
|
|
|
|
|
2010-12-20 09:02:19 +08:00
|
|
|
/* unpin all the log items */
|
|
|
|
|
for (lv = log_vector; lv; lv = lv->lv_next ) {
|
|
|
|
|
struct xfs_log_item *lip = lv->lv_item;
|
|
|
|
|
xfs_lsn_t item_lsn;
|
|
|
|
|
|
|
|
|
|
if (aborted)
|
|
|
|
|
lip->li_flags |= XFS_LI_ABORTED;
|
2013-08-28 19:12:03 +08:00
|
|
|
item_lsn = lip->li_ops->iop_committed(lip, commit_lsn);
|
2010-12-20 09:02:19 +08:00
|
|
|
|
xfs: unpin stale inodes directly in IOP_COMMITTED
When inodes are marked stale in a transaction, they are treated
specially when the inode log item is being inserted into the AIL.
It tries to avoid moving the log item forward in the AIL due to a
race condition with the writing the underlying buffer back to disk.
The was "fixed" in commit de25c18 ("xfs: avoid moving stale inodes
in the AIL").
To avoid moving the item forward, we return a LSN smaller than the
commit_lsn of the completing transaction, thereby trying to trick
the commit code into not moving the inode forward at all. I'm not
sure this ever worked as intended - it assumes the inode is already
in the AIL, but I don't think the returned LSN would have been small
enough to prevent moving the inode. It appears that the reason it
worked is that the lower LSN of the inodes meant they were inserted
into the AIL and flushed before the inode buffer (which was moved to
the commit_lsn of the transaction).
The big problem is that with delayed logging, the returning of the
different LSN means insertion takes the slow, non-bulk path. Worse
yet is that insertion is to a position -before- the commit_lsn so it
is doing a AIL traversal on every insertion, and has to walk over
all the items that have already been inserted into the AIL. It's
expensive.
To compound the matter further, with delayed logging inodes are
likely to go from clean to stale in a single checkpoint, which means
they aren't even in the AIL at all when we come across them at AIL
insertion time. Hence these were all getting inserted into the AIL
when they simply do not need to be as inodes marked XFS_ISTALE are
never written back.
Transactional/recovery integrity is maintained in this case by the
other items in the unlink transaction that were modified (e.g. the
AGI btree blocks) and committed in the same checkpoint.
So to fix this, simply unpin the stale inodes directly in
xfs_inode_item_committed() and return -1 to indicate that the AIL
insertion code does not need to do any further processing of these
inodes.
Signed-off-by: Dave Chinner <dchinner@redhat.com>
Reviewed-by: Christoph Hellwig <hch@lst.de>
Signed-off-by: Alex Elder <aelder@sgi.com>
2011-07-04 13:27:36 +08:00
|
|
|
/* item_lsn of -1 means the item needs no further processing */
|
2010-12-20 09:02:19 +08:00
|
|
|
if (XFS_LSN_CMP(item_lsn, (xfs_lsn_t)-1) == 0)
|
|
|
|
|
continue;
|
|
|
|
|
|
2011-01-27 09:13:35 +08:00
|
|
|
/*
|
|
|
|
|
* if we are aborting the operation, no point in inserting the
|
|
|
|
|
* object into the AIL as we are in a shutdown situation.
|
|
|
|
|
*/
|
|
|
|
|
if (aborted) {
|
|
|
|
|
ASSERT(XFS_FORCED_SHUTDOWN(ailp->xa_mount));
|
2013-08-28 19:12:03 +08:00
|
|
|
lip->li_ops->iop_unpin(lip, 1);
|
2011-01-27 09:13:35 +08:00
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
2010-12-20 09:02:19 +08:00
|
|
|
if (item_lsn != commit_lsn) {
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Not a bulk update option due to unusual item_lsn.
|
|
|
|
|
* Push into AIL immediately, rechecking the lsn once
|
2011-07-18 11:40:16 +08:00
|
|
|
* we have the ail lock. Then unpin the item. This does
|
|
|
|
|
* not affect the AIL cursor the bulk insert path is
|
|
|
|
|
* using.
|
2010-12-20 09:02:19 +08:00
|
|
|
*/
|
|
|
|
|
spin_lock(&ailp->xa_lock);
|
|
|
|
|
if (XFS_LSN_CMP(item_lsn, lip->li_lsn) > 0)
|
|
|
|
|
xfs_trans_ail_update(ailp, lip, item_lsn);
|
|
|
|
|
else
|
|
|
|
|
spin_unlock(&ailp->xa_lock);
|
2013-08-28 19:12:03 +08:00
|
|
|
lip->li_ops->iop_unpin(lip, 0);
|
2010-12-20 09:02:19 +08:00
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Item is a candidate for bulk AIL insert. */
|
|
|
|
|
log_items[i++] = lv->lv_item;
|
|
|
|
|
if (i >= LOG_ITEM_BATCH_SIZE) {
|
2011-07-18 11:40:16 +08:00
|
|
|
xfs_log_item_batch_insert(ailp, &cur, log_items,
|
2010-12-20 09:02:19 +08:00
|
|
|
LOG_ITEM_BATCH_SIZE, commit_lsn);
|
|
|
|
|
i = 0;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* make sure we insert the remainder! */
|
|
|
|
|
if (i)
|
2011-07-18 11:40:16 +08:00
|
|
|
xfs_log_item_batch_insert(ailp, &cur, log_items, i, commit_lsn);
|
|
|
|
|
|
|
|
|
|
spin_lock(&ailp->xa_lock);
|
2014-04-14 17:06:05 +08:00
|
|
|
xfs_trans_ail_cursor_done(&cur);
|
2011-07-18 11:40:16 +08:00
|
|
|
spin_unlock(&ailp->xa_lock);
|
2010-12-20 09:02:19 +08:00
|
|
|
}
|
|
|
|
|
|
2010-03-08 08:28:28 +08:00
|
|
|
/*
|
2011-09-19 22:55:51 +08:00
|
|
|
* Commit the given transaction to the log.
|
2010-03-08 08:28:28 +08:00
|
|
|
*
|
|
|
|
|
* XFS disk error handling mechanism is not based on a typical
|
|
|
|
|
* transaction abort mechanism. Logically after the filesystem
|
|
|
|
|
* gets marked 'SHUTDOWN', we can't let any new transactions
|
|
|
|
|
* be durable - ie. committed to disk - because some metadata might
|
|
|
|
|
* be inconsistent. In such cases, this returns an error, and the
|
|
|
|
|
* caller may assume that all locked objects joined to the transaction
|
|
|
|
|
* have already been unlocked as if the commit had succeeded.
|
|
|
|
|
* Do not reference the transaction structure after this call.
|
|
|
|
|
*/
|
2015-06-04 11:48:08 +08:00
|
|
|
static int
|
|
|
|
|
__xfs_trans_commit(
|
2010-03-15 09:52:49 +08:00
|
|
|
struct xfs_trans *tp,
|
2015-06-04 11:48:08 +08:00
|
|
|
bool regrant)
|
2010-03-08 08:28:28 +08:00
|
|
|
{
|
2010-03-15 09:52:49 +08:00
|
|
|
struct xfs_mount *mp = tp->t_mountp;
|
2010-03-08 08:28:28 +08:00
|
|
|
xfs_lsn_t commit_lsn = -1;
|
2010-03-15 09:52:49 +08:00
|
|
|
int error = 0;
|
2010-03-08 08:28:28 +08:00
|
|
|
int sync = tp->t_flags & XFS_TRANS_SYNC;
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* If there is nothing to be logged by the transaction,
|
|
|
|
|
* then unlock all of the items associated with the
|
|
|
|
|
* transaction and free the transaction structure.
|
|
|
|
|
* Also make sure to return any reserved blocks to
|
|
|
|
|
* the free pool.
|
|
|
|
|
*/
|
2010-03-15 09:52:49 +08:00
|
|
|
if (!(tp->t_flags & XFS_TRANS_DIRTY))
|
|
|
|
|
goto out_unreserve;
|
|
|
|
|
|
|
|
|
|
if (XFS_FORCED_SHUTDOWN(mp)) {
|
2014-06-25 12:58:08 +08:00
|
|
|
error = -EIO;
|
2010-03-15 09:52:49 +08:00
|
|
|
goto out_unreserve;
|
2010-03-08 08:28:28 +08:00
|
|
|
}
|
2010-03-15 09:52:49 +08:00
|
|
|
|
2010-03-08 08:28:28 +08:00
|
|
|
ASSERT(tp->t_ticket != NULL);
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* If we need to update the superblock, then do it now.
|
|
|
|
|
*/
|
|
|
|
|
if (tp->t_flags & XFS_TRANS_SB_DIRTY)
|
|
|
|
|
xfs_trans_apply_sb_deltas(tp);
|
|
|
|
|
xfs_trans_apply_dquot_deltas(tp);
|
|
|
|
|
|
2015-06-04 11:48:08 +08:00
|
|
|
xfs_log_commit_cil(mp, tp, &commit_lsn, regrant);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2011-12-07 05:58:08 +08:00
|
|
|
current_restore_flags_nested(&tp->t_pflags, PF_FSTRANS);
|
|
|
|
|
xfs_trans_free(tp);
|
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
|
* If the transaction needs to be synchronous, then force the
|
|
|
|
|
* log out now and wait for it.
|
|
|
|
|
*/
|
|
|
|
|
if (sync) {
|
2014-02-07 12:26:07 +08:00
|
|
|
error = _xfs_log_force_lsn(mp, commit_lsn, XFS_LOG_SYNC, NULL);
|
2015-10-12 15:21:22 +08:00
|
|
|
XFS_STATS_INC(mp, xs_trans_sync);
|
2005-04-17 06:20:36 +08:00
|
|
|
} else {
|
2015-10-12 15:21:22 +08:00
|
|
|
XFS_STATS_INC(mp, xs_trans_async);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
2010-03-15 09:52:49 +08:00
|
|
|
return error;
|
|
|
|
|
|
|
|
|
|
out_unreserve:
|
|
|
|
|
xfs_trans_unreserve_and_mod_sb(tp);
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* It is indeed possible for the transaction to be not dirty but
|
|
|
|
|
* the dqinfo portion to be. All that means is that we have some
|
|
|
|
|
* (non-persistent) quota reservations that need to be unreserved.
|
|
|
|
|
*/
|
|
|
|
|
xfs_trans_unreserve_and_mod_dquots(tp);
|
|
|
|
|
if (tp->t_ticket) {
|
2015-06-04 11:48:20 +08:00
|
|
|
commit_lsn = xfs_log_done(mp, tp->t_ticket, NULL, regrant);
|
2010-03-15 09:52:49 +08:00
|
|
|
if (commit_lsn == -1 && !error)
|
2014-06-25 12:58:08 +08:00
|
|
|
error = -EIO;
|
2010-03-15 09:52:49 +08:00
|
|
|
}
|
|
|
|
|
current_restore_flags_nested(&tp->t_pflags, PF_FSTRANS);
|
2015-06-04 11:47:43 +08:00
|
|
|
xfs_trans_free_items(tp, NULLCOMMITLSN, !!error);
|
2010-03-15 09:52:49 +08:00
|
|
|
xfs_trans_free(tp);
|
|
|
|
|
|
2015-10-12 15:21:22 +08:00
|
|
|
XFS_STATS_INC(mp, xs_trans_empty);
|
2010-03-15 09:52:49 +08:00
|
|
|
return error;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
2015-06-04 11:48:08 +08:00
|
|
|
int
|
|
|
|
|
xfs_trans_commit(
|
|
|
|
|
struct xfs_trans *tp)
|
|
|
|
|
{
|
|
|
|
|
return __xfs_trans_commit(tp, false);
|
|
|
|
|
}
|
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
|
* Unlock all of the transaction's items and free the transaction.
|
|
|
|
|
* The transaction must not have modified any of its items, because
|
|
|
|
|
* there is no way to restore them to their previous state.
|
|
|
|
|
*
|
|
|
|
|
* If the transaction has made a log reservation, make sure to release
|
|
|
|
|
* it as well.
|
|
|
|
|
*/
|
|
|
|
|
void
|
|
|
|
|
xfs_trans_cancel(
|
2015-06-04 11:47:56 +08:00
|
|
|
struct xfs_trans *tp)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2015-06-04 11:47:56 +08:00
|
|
|
struct xfs_mount *mp = tp->t_mountp;
|
|
|
|
|
bool dirty = (tp->t_flags & XFS_TRANS_DIRTY);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* See if the caller is relying on us to shut down the
|
|
|
|
|
* filesystem. This happens in paths where we detect
|
|
|
|
|
* corruption and decide to give up.
|
|
|
|
|
*/
|
2015-06-04 11:47:56 +08:00
|
|
|
if (dirty && !XFS_FORCED_SHUTDOWN(mp)) {
|
2006-01-11 12:36:44 +08:00
|
|
|
XFS_ERROR_REPORT("xfs_trans_cancel", XFS_ERRLEVEL_LOW, mp);
|
2006-06-09 12:58:38 +08:00
|
|
|
xfs_force_shutdown(mp, SHUTDOWN_CORRUPT_INCORE);
|
2006-01-11 12:37:00 +08:00
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
#ifdef DEBUG
|
2015-06-04 11:47:56 +08:00
|
|
|
if (!dirty && !XFS_FORCED_SHUTDOWN(mp)) {
|
2010-06-23 16:11:15 +08:00
|
|
|
struct xfs_log_item_desc *lidp;
|
|
|
|
|
|
|
|
|
|
list_for_each_entry(lidp, &tp->t_items, lid_trans)
|
|
|
|
|
ASSERT(!(lidp->lid_item->li_type == XFS_LI_EFD));
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
xfs_trans_unreserve_and_mod_sb(tp);
|
2009-06-08 21:33:32 +08:00
|
|
|
xfs_trans_unreserve_and_mod_dquots(tp);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2015-06-04 11:48:20 +08:00
|
|
|
if (tp->t_ticket)
|
|
|
|
|
xfs_log_done(mp, tp->t_ticket, NULL, false);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
/* mark this thread as no longer being in a transaction */
|
2006-06-09 12:59:13 +08:00
|
|
|
current_restore_flags_nested(&tp->t_pflags, PF_FSTRANS);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2015-06-04 11:47:56 +08:00
|
|
|
xfs_trans_free_items(tp, NULLCOMMITLSN, dirty);
|
2005-04-17 06:20:36 +08:00
|
|
|
xfs_trans_free(tp);
|
|
|
|
|
}
|
|
|
|
|
|
2008-08-13 14:05:49 +08:00
|
|
|
/*
|
|
|
|
|
* Roll from one trans in the sequence of PERMANENT transactions to
|
|
|
|
|
* the next: permanent transactions are only flushed out when
|
2015-06-04 11:48:08 +08:00
|
|
|
* committed with xfs_trans_commit(), but we still want as soon
|
2008-08-13 14:05:49 +08:00
|
|
|
* as possible to let chunks of it go to the log. So we commit the
|
|
|
|
|
* chunk we've been working on and get a new transaction to continue.
|
|
|
|
|
*/
|
|
|
|
|
int
|
2015-08-19 07:50:13 +08:00
|
|
|
__xfs_trans_roll(
|
2008-08-13 14:05:49 +08:00
|
|
|
struct xfs_trans **tpp,
|
2015-08-19 07:50:13 +08:00
|
|
|
struct xfs_inode *dp,
|
|
|
|
|
int *committed)
|
2008-08-13 14:05:49 +08:00
|
|
|
{
|
|
|
|
|
struct xfs_trans *trans;
|
2013-08-12 18:49:59 +08:00
|
|
|
struct xfs_trans_res tres;
|
2008-08-13 14:05:49 +08:00
|
|
|
int error;
|
|
|
|
|
|
2016-03-15 08:42:47 +08:00
|
|
|
*committed = 0;
|
|
|
|
|
|
2008-08-13 14:05:49 +08:00
|
|
|
/*
|
|
|
|
|
* Ensure that the inode is always logged.
|
|
|
|
|
*/
|
|
|
|
|
trans = *tpp;
|
2015-06-04 11:47:29 +08:00
|
|
|
if (dp)
|
|
|
|
|
xfs_trans_log_inode(trans, dp, XFS_ILOG_CORE);
|
2008-08-13 14:05:49 +08:00
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Copy the critical parameters from one trans to the next.
|
|
|
|
|
*/
|
2013-08-12 18:49:59 +08:00
|
|
|
tres.tr_logres = trans->t_log_res;
|
|
|
|
|
tres.tr_logcount = trans->t_log_count;
|
2008-08-13 14:05:49 +08:00
|
|
|
*tpp = xfs_trans_dup(trans);
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Commit the current transaction.
|
|
|
|
|
* If this commit failed, then it'd just unlock those items that
|
|
|
|
|
* are not marked ihold. That also means that a filesystem shutdown
|
|
|
|
|
* is in progress. The caller takes the responsibility to cancel
|
|
|
|
|
* the duplicate transaction that gets returned.
|
|
|
|
|
*/
|
2015-06-04 11:48:08 +08:00
|
|
|
error = __xfs_trans_commit(trans, true);
|
2008-08-13 14:05:49 +08:00
|
|
|
if (error)
|
2014-06-22 13:03:54 +08:00
|
|
|
return error;
|
2008-08-13 14:05:49 +08:00
|
|
|
|
2015-08-19 07:50:13 +08:00
|
|
|
*committed = 1;
|
2008-08-13 14:05:49 +08:00
|
|
|
trans = *tpp;
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Reserve space in the log for th next transaction.
|
|
|
|
|
* This also pushes items in the "AIL", the list of logged items,
|
|
|
|
|
* out to disk if they are taking up space at the tail of the log
|
|
|
|
|
* that we want to use. This requires that either nothing be locked
|
|
|
|
|
* across this call, or that anything that is locked be logged in
|
|
|
|
|
* the prior and the next transactions.
|
|
|
|
|
*/
|
2013-08-12 18:49:59 +08:00
|
|
|
tres.tr_logflags = XFS_TRANS_PERM_LOG_RES;
|
|
|
|
|
error = xfs_trans_reserve(trans, &tres, 0, 0);
|
2008-08-13 14:05:49 +08:00
|
|
|
/*
|
|
|
|
|
* Ensure that the inode is in the new transaction and locked.
|
|
|
|
|
*/
|
|
|
|
|
if (error)
|
|
|
|
|
return error;
|
|
|
|
|
|
2015-06-04 11:47:29 +08:00
|
|
|
if (dp)
|
|
|
|
|
xfs_trans_ijoin(trans, dp, 0);
|
2008-08-13 14:05:49 +08:00
|
|
|
return 0;
|
|
|
|
|
}
|
2015-08-19 07:50:13 +08:00
|
|
|
|
|
|
|
|
int
|
|
|
|
|
xfs_trans_roll(
|
|
|
|
|
struct xfs_trans **tpp,
|
|
|
|
|
struct xfs_inode *dp)
|
|
|
|
|
{
|
2016-03-15 08:42:47 +08:00
|
|
|
int committed;
|
2015-08-19 07:50:13 +08:00
|
|
|
return __xfs_trans_roll(tpp, dp, &committed);
|
|
|
|
|
}
|