2005-04-17 00:20:36 +02:00
|
|
|
/*
|
2005-11-02 04:58:39 +01:00
|
|
|
* Copyright (c) 2000-2001,2005 Silicon Graphics, Inc.
|
|
|
|
* All Rights Reserved.
|
2005-04-17 00:20:36 +02:00
|
|
|
*
|
2005-11-02 04:58:39 +01: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 00:20:36 +02:00
|
|
|
* published by the Free Software Foundation.
|
|
|
|
*
|
2005-11-02 04:58:39 +01: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 00:20:36 +02:00
|
|
|
*
|
2005-11-02 04:58:39 +01: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 00:20:36 +02:00
|
|
|
*/
|
|
|
|
#include "xfs.h"
|
2005-11-02 04:38:42 +01:00
|
|
|
#include "xfs_fs.h"
|
2005-04-17 00:20:36 +02:00
|
|
|
#include "xfs_types.h"
|
|
|
|
#include "xfs_log.h"
|
2005-11-02 04:38:42 +01:00
|
|
|
#include "xfs_inum.h"
|
2005-04-17 00:20:36 +02:00
|
|
|
#include "xfs_trans.h"
|
|
|
|
#include "xfs_buf_item.h"
|
|
|
|
#include "xfs_sb.h"
|
2007-08-28 06:00:13 +02:00
|
|
|
#include "xfs_ag.h"
|
2005-04-17 00:20:36 +02:00
|
|
|
#include "xfs_mount.h"
|
|
|
|
#include "xfs_trans_priv.h"
|
|
|
|
#include "xfs_extfree_item.h"
|
|
|
|
|
|
|
|
|
|
|
|
kmem_zone_t *xfs_efi_zone;
|
|
|
|
kmem_zone_t *xfs_efd_zone;
|
|
|
|
|
2010-06-23 10:11:15 +02:00
|
|
|
static inline struct xfs_efi_log_item *EFI_ITEM(struct xfs_log_item *lip)
|
|
|
|
{
|
|
|
|
return container_of(lip, struct xfs_efi_log_item, efi_item);
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2005-06-21 07:41:19 +02:00
|
|
|
void
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_efi_item_free(
|
|
|
|
struct xfs_efi_log_item *efip)
|
2005-06-21 07:41:19 +02:00
|
|
|
{
|
2010-06-23 10:11:15 +02:00
|
|
|
if (efip->efi_format.efi_nextents > XFS_EFI_MAX_FAST_EXTENTS)
|
2008-05-19 08:31:57 +02:00
|
|
|
kmem_free(efip);
|
2010-06-23 10:11:15 +02:00
|
|
|
else
|
2005-06-21 07:41:19 +02:00
|
|
|
kmem_zone_free(xfs_efi_zone, efip);
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-12-20 01:59:49 +01:00
|
|
|
/*
|
|
|
|
* Freeing the efi requires that we remove it from the AIL if it has already
|
|
|
|
* been placed there. However, the EFI may not yet have been placed in the AIL
|
|
|
|
* when called by xfs_efi_release() from EFD processing due to the ordering of
|
|
|
|
* committed vs unpin operations in bulk insert operations. Hence the
|
|
|
|
* test_and_clear_bit(XFS_EFI_COMMITTED) to ensure only the last caller frees
|
|
|
|
* the EFI.
|
|
|
|
*/
|
|
|
|
STATIC void
|
|
|
|
__xfs_efi_release(
|
|
|
|
struct xfs_efi_log_item *efip)
|
|
|
|
{
|
|
|
|
struct xfs_ail *ailp = efip->efi_item.li_ailp;
|
|
|
|
|
|
|
|
if (!test_and_clear_bit(XFS_EFI_COMMITTED, &efip->efi_flags)) {
|
|
|
|
spin_lock(&ailp->xa_lock);
|
|
|
|
/* xfs_trans_ail_delete() drops the AIL lock. */
|
|
|
|
xfs_trans_ail_delete(ailp, &efip->efi_item);
|
|
|
|
xfs_efi_item_free(efip);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* This returns the number of iovecs needed to log the given efi item.
|
|
|
|
* We only need 1 iovec for an efi item. It just logs the efi_log_format
|
|
|
|
* structure.
|
|
|
|
*/
|
|
|
|
STATIC uint
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_efi_item_size(
|
|
|
|
struct xfs_log_item *lip)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is called to fill in the vector of log iovecs for the
|
|
|
|
* given efi log item. We use only 1 iovec, and we point that
|
|
|
|
* at the efi_log_format structure embedded in the efi item.
|
|
|
|
* It is at this point that we assert that all of the extent
|
|
|
|
* slots in the efi item have been filled.
|
|
|
|
*/
|
|
|
|
STATIC void
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_efi_item_format(
|
|
|
|
struct xfs_log_item *lip,
|
|
|
|
struct xfs_log_iovec *log_vector)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_efi_log_item *efip = EFI_ITEM(lip);
|
|
|
|
uint size;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-12-20 01:59:49 +01:00
|
|
|
ASSERT(atomic_read(&efip->efi_next_extent) ==
|
|
|
|
efip->efi_format.efi_nextents);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
efip->efi_format.efi_type = XFS_LI_EFI;
|
|
|
|
|
|
|
|
size = sizeof(xfs_efi_log_format_t);
|
|
|
|
size += (efip->efi_format.efi_nextents - 1) * sizeof(xfs_extent_t);
|
|
|
|
efip->efi_format.efi_size = 1;
|
|
|
|
|
2010-06-23 10:11:15 +02:00
|
|
|
log_vector->i_addr = &efip->efi_format;
|
2005-04-17 00:20:36 +02:00
|
|
|
log_vector->i_len = size;
|
2010-01-19 10:56:45 +01:00
|
|
|
log_vector->i_type = XLOG_REG_TYPE_EFI_FORMAT;
|
2005-04-17 00:20:36 +02:00
|
|
|
ASSERT(size >= sizeof(xfs_efi_log_format_t));
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Pinning has no meaning for an efi item, so just return.
|
|
|
|
*/
|
|
|
|
STATIC void
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_efi_item_pin(
|
|
|
|
struct xfs_log_item *lip)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2010-12-20 01:57:24 +01:00
|
|
|
* While EFIs cannot really be pinned, the unpin operation is the last place at
|
|
|
|
* which the EFI is manipulated during a transaction. If we are being asked to
|
|
|
|
* remove the EFI it's because the transaction has been cancelled and by
|
|
|
|
* definition that means the EFI cannot be in the AIL so remove it from the
|
2010-12-20 01:59:49 +01:00
|
|
|
* transaction and free it. Otherwise coordinate with xfs_efi_release() (via
|
|
|
|
* XFS_EFI_COMMITTED) to determine who gets to free the EFI.
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
|
|
|
STATIC void
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_efi_item_unpin(
|
|
|
|
struct xfs_log_item *lip,
|
|
|
|
int remove)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_efi_log_item *efip = EFI_ITEM(lip);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-12-20 01:57:24 +01:00
|
|
|
if (remove) {
|
|
|
|
ASSERT(!(lip->li_flags & XFS_LI_IN_AIL));
|
2011-01-27 02:13:35 +01:00
|
|
|
if (lip->li_desc)
|
|
|
|
xfs_trans_del_item(lip);
|
2005-06-21 07:41:19 +02:00
|
|
|
xfs_efi_item_free(efip);
|
2010-12-20 01:59:49 +01:00
|
|
|
return;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2010-12-20 01:59:49 +01:00
|
|
|
__xfs_efi_release(efip);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
xfs: on-stack delayed write buffer lists
Queue delwri buffers on a local on-stack list instead of a per-buftarg one,
and write back the buffers per-process instead of by waking up xfsbufd.
This is now easily doable given that we have very few places left that write
delwri buffers:
- log recovery:
Only done at mount time, and already forcing out the buffers
synchronously using xfs_flush_buftarg
- quotacheck:
Same story.
- dquot reclaim:
Writes out dirty dquots on the LRU under memory pressure. We might
want to look into doing more of this via xfsaild, but it's already
more optimal than the synchronous inode reclaim that writes each
buffer synchronously.
- xfsaild:
This is the main beneficiary of the change. By keeping a local list
of buffers to write we reduce latency of writing out buffers, and
more importably we can remove all the delwri list promotions which
were hitting the buffer cache hard under sustained metadata loads.
The implementation is very straight forward - xfs_buf_delwri_queue now gets
a new list_head pointer that it adds the delwri buffers to, and all callers
need to eventually submit the list using xfs_buf_delwi_submit or
xfs_buf_delwi_submit_nowait. Buffers that already are on a delwri list are
skipped in xfs_buf_delwri_queue, assuming they already are on another delwri
list. The biggest change to pass down the buffer list was done to the AIL
pushing. Now that we operate on buffers the trylock, push and pushbuf log
item methods are merged into a single push routine, which tries to lock the
item, and if possible add the buffer that needs writeback to the buffer list.
This leads to much simpler code than the previous split but requires the
individual IOP_PUSH instances to unlock and reacquire the AIL around calls
to blocking routines.
Given that xfsailds now also handle writing out buffers, the conditions for
log forcing and the sleep times needed some small changes. The most
important one is that we consider an AIL busy as long we still have buffers
to push, and the other one is that we do increment the pushed LSN for
buffers that are under flushing at this moment, but still count them towards
the stuck items for restart purposes. Without this we could hammer on stuck
items without ever forcing the log and not make progress under heavy random
delete workloads on fast flash storage devices.
[ Dave Chinner:
- rebase on previous patches.
- improved comments for XBF_DELWRI_Q handling
- fix XBF_ASYNC handling in queue submission (test 106 failure)
- rename delwri submit function buffer list parameters for clarity
- xfs_efd_item_push() should return XFS_ITEM_PINNED ]
Signed-off-by: Christoph Hellwig <hch@lst.de>
Reviewed-by: Dave Chinner <dchinner@redhat.com>
Reviewed-by: Mark Tinguely <tinguely@sgi.com>
Signed-off-by: Ben Myers <bpm@sgi.com>
2012-04-23 07:58:39 +02:00
|
|
|
* Efi items have no locking or pushing. However, since EFIs are pulled from
|
|
|
|
* the AIL when their corresponding EFDs are committed to disk, their situation
|
|
|
|
* is very similar to being pinned. Return XFS_ITEM_PINNED so that the caller
|
|
|
|
* will eventually flush the log. This should help in getting the EFI out of
|
|
|
|
* the AIL.
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
|
|
|
STATIC uint
|
xfs: on-stack delayed write buffer lists
Queue delwri buffers on a local on-stack list instead of a per-buftarg one,
and write back the buffers per-process instead of by waking up xfsbufd.
This is now easily doable given that we have very few places left that write
delwri buffers:
- log recovery:
Only done at mount time, and already forcing out the buffers
synchronously using xfs_flush_buftarg
- quotacheck:
Same story.
- dquot reclaim:
Writes out dirty dquots on the LRU under memory pressure. We might
want to look into doing more of this via xfsaild, but it's already
more optimal than the synchronous inode reclaim that writes each
buffer synchronously.
- xfsaild:
This is the main beneficiary of the change. By keeping a local list
of buffers to write we reduce latency of writing out buffers, and
more importably we can remove all the delwri list promotions which
were hitting the buffer cache hard under sustained metadata loads.
The implementation is very straight forward - xfs_buf_delwri_queue now gets
a new list_head pointer that it adds the delwri buffers to, and all callers
need to eventually submit the list using xfs_buf_delwi_submit or
xfs_buf_delwi_submit_nowait. Buffers that already are on a delwri list are
skipped in xfs_buf_delwri_queue, assuming they already are on another delwri
list. The biggest change to pass down the buffer list was done to the AIL
pushing. Now that we operate on buffers the trylock, push and pushbuf log
item methods are merged into a single push routine, which tries to lock the
item, and if possible add the buffer that needs writeback to the buffer list.
This leads to much simpler code than the previous split but requires the
individual IOP_PUSH instances to unlock and reacquire the AIL around calls
to blocking routines.
Given that xfsailds now also handle writing out buffers, the conditions for
log forcing and the sleep times needed some small changes. The most
important one is that we consider an AIL busy as long we still have buffers
to push, and the other one is that we do increment the pushed LSN for
buffers that are under flushing at this moment, but still count them towards
the stuck items for restart purposes. Without this we could hammer on stuck
items without ever forcing the log and not make progress under heavy random
delete workloads on fast flash storage devices.
[ Dave Chinner:
- rebase on previous patches.
- improved comments for XBF_DELWRI_Q handling
- fix XBF_ASYNC handling in queue submission (test 106 failure)
- rename delwri submit function buffer list parameters for clarity
- xfs_efd_item_push() should return XFS_ITEM_PINNED ]
Signed-off-by: Christoph Hellwig <hch@lst.de>
Reviewed-by: Dave Chinner <dchinner@redhat.com>
Reviewed-by: Mark Tinguely <tinguely@sgi.com>
Signed-off-by: Ben Myers <bpm@sgi.com>
2012-04-23 07:58:39 +02:00
|
|
|
xfs_efi_item_push(
|
|
|
|
struct xfs_log_item *lip,
|
|
|
|
struct list_head *buffer_list)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
return XFS_ITEM_PINNED;
|
|
|
|
}
|
|
|
|
|
|
|
|
STATIC void
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_efi_item_unlock(
|
|
|
|
struct xfs_log_item *lip)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2010-06-23 10:11:15 +02:00
|
|
|
if (lip->li_flags & XFS_LI_ABORTED)
|
|
|
|
xfs_efi_item_free(EFI_ITEM(lip));
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2010-12-20 01:59:49 +01:00
|
|
|
* The EFI is logged only once and cannot be moved in the log, so simply return
|
|
|
|
* the lsn at which it's been logged. For bulk transaction committed
|
|
|
|
* processing, the EFI may be processed but not yet unpinned prior to the EFD
|
|
|
|
* being processed. Set the XFS_EFI_COMMITTED flag so this case can be detected
|
|
|
|
* when processing the EFD.
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
|
|
|
STATIC xfs_lsn_t
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_efi_item_committed(
|
|
|
|
struct xfs_log_item *lip,
|
|
|
|
xfs_lsn_t lsn)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2010-12-20 01:59:49 +01:00
|
|
|
struct xfs_efi_log_item *efip = EFI_ITEM(lip);
|
|
|
|
|
|
|
|
set_bit(XFS_EFI_COMMITTED, &efip->efi_flags);
|
2005-04-17 00:20:36 +02:00
|
|
|
return lsn;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The EFI dependency tracking op doesn't do squat. It can't because
|
|
|
|
* it doesn't know where the free extent is coming from. The dependency
|
|
|
|
* tracking has to be handled by the "enclosing" metadata object. For
|
|
|
|
* example, for inodes, the inode is locked throughout the extent freeing
|
|
|
|
* so the dependency should be recorded there.
|
|
|
|
*/
|
|
|
|
STATIC void
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_efi_item_committing(
|
|
|
|
struct xfs_log_item *lip,
|
|
|
|
xfs_lsn_t lsn)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is the ops vector shared by all efi log items.
|
|
|
|
*/
|
2011-10-28 11:54:24 +02:00
|
|
|
static const struct xfs_item_ops xfs_efi_item_ops = {
|
2010-06-23 10:11:15 +02:00
|
|
|
.iop_size = xfs_efi_item_size,
|
|
|
|
.iop_format = xfs_efi_item_format,
|
|
|
|
.iop_pin = xfs_efi_item_pin,
|
|
|
|
.iop_unpin = xfs_efi_item_unpin,
|
|
|
|
.iop_unlock = xfs_efi_item_unlock,
|
|
|
|
.iop_committed = xfs_efi_item_committed,
|
|
|
|
.iop_push = xfs_efi_item_push,
|
|
|
|
.iop_committing = xfs_efi_item_committing
|
2005-04-17 00:20:36 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Allocate and initialize an efi item with the given number of extents.
|
|
|
|
*/
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_efi_log_item *
|
|
|
|
xfs_efi_init(
|
|
|
|
struct xfs_mount *mp,
|
|
|
|
uint nextents)
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
{
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_efi_log_item *efip;
|
2005-04-17 00:20:36 +02:00
|
|
|
uint size;
|
|
|
|
|
|
|
|
ASSERT(nextents > 0);
|
|
|
|
if (nextents > XFS_EFI_MAX_FAST_EXTENTS) {
|
|
|
|
size = (uint)(sizeof(xfs_efi_log_item_t) +
|
|
|
|
((nextents - 1) * sizeof(xfs_extent_t)));
|
2010-06-23 10:11:15 +02:00
|
|
|
efip = kmem_zalloc(size, KM_SLEEP);
|
2005-04-17 00:20:36 +02:00
|
|
|
} else {
|
2010-06-23 10:11:15 +02:00
|
|
|
efip = kmem_zone_zalloc(xfs_efi_zone, KM_SLEEP);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2010-03-23 00:10:00 +01:00
|
|
|
xfs_log_item_init(mp, &efip->efi_item, XFS_LI_EFI, &xfs_efi_item_ops);
|
2005-04-17 00:20:36 +02:00
|
|
|
efip->efi_format.efi_nextents = nextents;
|
|
|
|
efip->efi_format.efi_id = (__psint_t)(void*)efip;
|
2010-12-20 01:59:49 +01:00
|
|
|
atomic_set(&efip->efi_next_extent, 0);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-06-23 10:11:15 +02:00
|
|
|
return efip;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2006-06-09 06:55:38 +02:00
|
|
|
/*
|
|
|
|
* Copy an EFI format buffer from the given buf, and into the destination
|
|
|
|
* EFI format structure.
|
|
|
|
* The given buffer can be in 32 bit or 64 bit form (which has different padding),
|
|
|
|
* one of which will be the native format for this kernel.
|
|
|
|
* It will handle the conversion of formats if necessary.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
xfs_efi_copy_format(xfs_log_iovec_t *buf, xfs_efi_log_format_t *dst_efi_fmt)
|
|
|
|
{
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_efi_log_format_t *src_efi_fmt = buf->i_addr;
|
2006-06-09 06:55:38 +02:00
|
|
|
uint i;
|
|
|
|
uint len = sizeof(xfs_efi_log_format_t) +
|
|
|
|
(src_efi_fmt->efi_nextents - 1) * sizeof(xfs_extent_t);
|
|
|
|
uint len32 = sizeof(xfs_efi_log_format_32_t) +
|
|
|
|
(src_efi_fmt->efi_nextents - 1) * sizeof(xfs_extent_32_t);
|
|
|
|
uint len64 = sizeof(xfs_efi_log_format_64_t) +
|
|
|
|
(src_efi_fmt->efi_nextents - 1) * sizeof(xfs_extent_64_t);
|
|
|
|
|
|
|
|
if (buf->i_len == len) {
|
|
|
|
memcpy((char *)dst_efi_fmt, (char*)src_efi_fmt, len);
|
|
|
|
return 0;
|
|
|
|
} else if (buf->i_len == len32) {
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_efi_log_format_32_t *src_efi_fmt_32 = buf->i_addr;
|
2006-06-09 06:55:38 +02:00
|
|
|
|
|
|
|
dst_efi_fmt->efi_type = src_efi_fmt_32->efi_type;
|
|
|
|
dst_efi_fmt->efi_size = src_efi_fmt_32->efi_size;
|
|
|
|
dst_efi_fmt->efi_nextents = src_efi_fmt_32->efi_nextents;
|
|
|
|
dst_efi_fmt->efi_id = src_efi_fmt_32->efi_id;
|
|
|
|
for (i = 0; i < dst_efi_fmt->efi_nextents; i++) {
|
|
|
|
dst_efi_fmt->efi_extents[i].ext_start =
|
|
|
|
src_efi_fmt_32->efi_extents[i].ext_start;
|
|
|
|
dst_efi_fmt->efi_extents[i].ext_len =
|
|
|
|
src_efi_fmt_32->efi_extents[i].ext_len;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
} else if (buf->i_len == len64) {
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_efi_log_format_64_t *src_efi_fmt_64 = buf->i_addr;
|
2006-06-09 06:55:38 +02:00
|
|
|
|
|
|
|
dst_efi_fmt->efi_type = src_efi_fmt_64->efi_type;
|
|
|
|
dst_efi_fmt->efi_size = src_efi_fmt_64->efi_size;
|
|
|
|
dst_efi_fmt->efi_nextents = src_efi_fmt_64->efi_nextents;
|
|
|
|
dst_efi_fmt->efi_id = src_efi_fmt_64->efi_id;
|
|
|
|
for (i = 0; i < dst_efi_fmt->efi_nextents; i++) {
|
|
|
|
dst_efi_fmt->efi_extents[i].ext_start =
|
|
|
|
src_efi_fmt_64->efi_extents[i].ext_start;
|
|
|
|
dst_efi_fmt->efi_extents[i].ext_len =
|
|
|
|
src_efi_fmt_64->efi_extents[i].ext_len;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
return EFSCORRUPTED;
|
|
|
|
}
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
2010-12-20 01:59:49 +01:00
|
|
|
* This is called by the efd item code below to release references to the given
|
|
|
|
* efi item. Each efd calls this with the number of extents that it has
|
|
|
|
* logged, and when the sum of these reaches the total number of extents logged
|
|
|
|
* by this efi item we can free the efi item.
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
|
|
|
void
|
|
|
|
xfs_efi_release(xfs_efi_log_item_t *efip,
|
|
|
|
uint nextents)
|
|
|
|
{
|
2010-12-20 01:59:49 +01:00
|
|
|
ASSERT(atomic_read(&efip->efi_next_extent) >= nextents);
|
|
|
|
if (atomic_sub_and_test(nextents, &efip->efi_next_extent))
|
|
|
|
__xfs_efi_release(efip);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2010-06-23 10:11:15 +02:00
|
|
|
static inline struct xfs_efd_log_item *EFD_ITEM(struct xfs_log_item *lip)
|
2005-06-21 07:41:19 +02:00
|
|
|
{
|
2010-06-23 10:11:15 +02:00
|
|
|
return container_of(lip, struct xfs_efd_log_item, efd_item);
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-06-23 10:11:15 +02:00
|
|
|
STATIC void
|
|
|
|
xfs_efd_item_free(struct xfs_efd_log_item *efdp)
|
|
|
|
{
|
|
|
|
if (efdp->efd_format.efd_nextents > XFS_EFD_MAX_FAST_EXTENTS)
|
2008-05-19 08:31:57 +02:00
|
|
|
kmem_free(efdp);
|
2010-06-23 10:11:15 +02:00
|
|
|
else
|
2005-06-21 07:41:19 +02:00
|
|
|
kmem_zone_free(xfs_efd_zone, efdp);
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* This returns the number of iovecs needed to log the given efd item.
|
|
|
|
* We only need 1 iovec for an efd item. It just logs the efd_log_format
|
|
|
|
* structure.
|
|
|
|
*/
|
|
|
|
STATIC uint
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_efd_item_size(
|
|
|
|
struct xfs_log_item *lip)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is called to fill in the vector of log iovecs for the
|
|
|
|
* given efd log item. We use only 1 iovec, and we point that
|
|
|
|
* at the efd_log_format structure embedded in the efd item.
|
|
|
|
* It is at this point that we assert that all of the extent
|
|
|
|
* slots in the efd item have been filled.
|
|
|
|
*/
|
|
|
|
STATIC void
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_efd_item_format(
|
|
|
|
struct xfs_log_item *lip,
|
|
|
|
struct xfs_log_iovec *log_vector)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_efd_log_item *efdp = EFD_ITEM(lip);
|
|
|
|
uint size;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
ASSERT(efdp->efd_next_extent == efdp->efd_format.efd_nextents);
|
|
|
|
|
|
|
|
efdp->efd_format.efd_type = XFS_LI_EFD;
|
|
|
|
|
|
|
|
size = sizeof(xfs_efd_log_format_t);
|
|
|
|
size += (efdp->efd_format.efd_nextents - 1) * sizeof(xfs_extent_t);
|
|
|
|
efdp->efd_format.efd_size = 1;
|
|
|
|
|
2010-06-23 10:11:15 +02:00
|
|
|
log_vector->i_addr = &efdp->efd_format;
|
2005-04-17 00:20:36 +02:00
|
|
|
log_vector->i_len = size;
|
2010-01-19 10:56:45 +01:00
|
|
|
log_vector->i_type = XLOG_REG_TYPE_EFD_FORMAT;
|
2005-04-17 00:20:36 +02:00
|
|
|
ASSERT(size >= sizeof(xfs_efd_log_format_t));
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Pinning has no meaning for an efd item, so just return.
|
|
|
|
*/
|
|
|
|
STATIC void
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_efd_item_pin(
|
|
|
|
struct xfs_log_item *lip)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Since pinning has no meaning for an efd item, unpinning does
|
|
|
|
* not either.
|
|
|
|
*/
|
|
|
|
STATIC void
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_efd_item_unpin(
|
|
|
|
struct xfs_log_item *lip,
|
|
|
|
int remove)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
xfs: on-stack delayed write buffer lists
Queue delwri buffers on a local on-stack list instead of a per-buftarg one,
and write back the buffers per-process instead of by waking up xfsbufd.
This is now easily doable given that we have very few places left that write
delwri buffers:
- log recovery:
Only done at mount time, and already forcing out the buffers
synchronously using xfs_flush_buftarg
- quotacheck:
Same story.
- dquot reclaim:
Writes out dirty dquots on the LRU under memory pressure. We might
want to look into doing more of this via xfsaild, but it's already
more optimal than the synchronous inode reclaim that writes each
buffer synchronously.
- xfsaild:
This is the main beneficiary of the change. By keeping a local list
of buffers to write we reduce latency of writing out buffers, and
more importably we can remove all the delwri list promotions which
were hitting the buffer cache hard under sustained metadata loads.
The implementation is very straight forward - xfs_buf_delwri_queue now gets
a new list_head pointer that it adds the delwri buffers to, and all callers
need to eventually submit the list using xfs_buf_delwi_submit or
xfs_buf_delwi_submit_nowait. Buffers that already are on a delwri list are
skipped in xfs_buf_delwri_queue, assuming they already are on another delwri
list. The biggest change to pass down the buffer list was done to the AIL
pushing. Now that we operate on buffers the trylock, push and pushbuf log
item methods are merged into a single push routine, which tries to lock the
item, and if possible add the buffer that needs writeback to the buffer list.
This leads to much simpler code than the previous split but requires the
individual IOP_PUSH instances to unlock and reacquire the AIL around calls
to blocking routines.
Given that xfsailds now also handle writing out buffers, the conditions for
log forcing and the sleep times needed some small changes. The most
important one is that we consider an AIL busy as long we still have buffers
to push, and the other one is that we do increment the pushed LSN for
buffers that are under flushing at this moment, but still count them towards
the stuck items for restart purposes. Without this we could hammer on stuck
items without ever forcing the log and not make progress under heavy random
delete workloads on fast flash storage devices.
[ Dave Chinner:
- rebase on previous patches.
- improved comments for XBF_DELWRI_Q handling
- fix XBF_ASYNC handling in queue submission (test 106 failure)
- rename delwri submit function buffer list parameters for clarity
- xfs_efd_item_push() should return XFS_ITEM_PINNED ]
Signed-off-by: Christoph Hellwig <hch@lst.de>
Reviewed-by: Dave Chinner <dchinner@redhat.com>
Reviewed-by: Mark Tinguely <tinguely@sgi.com>
Signed-off-by: Ben Myers <bpm@sgi.com>
2012-04-23 07:58:39 +02:00
|
|
|
* There isn't much you can do to push on an efd item. It is simply stuck
|
|
|
|
* waiting for the log to be flushed to disk.
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
|
|
|
STATIC uint
|
xfs: on-stack delayed write buffer lists
Queue delwri buffers on a local on-stack list instead of a per-buftarg one,
and write back the buffers per-process instead of by waking up xfsbufd.
This is now easily doable given that we have very few places left that write
delwri buffers:
- log recovery:
Only done at mount time, and already forcing out the buffers
synchronously using xfs_flush_buftarg
- quotacheck:
Same story.
- dquot reclaim:
Writes out dirty dquots on the LRU under memory pressure. We might
want to look into doing more of this via xfsaild, but it's already
more optimal than the synchronous inode reclaim that writes each
buffer synchronously.
- xfsaild:
This is the main beneficiary of the change. By keeping a local list
of buffers to write we reduce latency of writing out buffers, and
more importably we can remove all the delwri list promotions which
were hitting the buffer cache hard under sustained metadata loads.
The implementation is very straight forward - xfs_buf_delwri_queue now gets
a new list_head pointer that it adds the delwri buffers to, and all callers
need to eventually submit the list using xfs_buf_delwi_submit or
xfs_buf_delwi_submit_nowait. Buffers that already are on a delwri list are
skipped in xfs_buf_delwri_queue, assuming they already are on another delwri
list. The biggest change to pass down the buffer list was done to the AIL
pushing. Now that we operate on buffers the trylock, push and pushbuf log
item methods are merged into a single push routine, which tries to lock the
item, and if possible add the buffer that needs writeback to the buffer list.
This leads to much simpler code than the previous split but requires the
individual IOP_PUSH instances to unlock and reacquire the AIL around calls
to blocking routines.
Given that xfsailds now also handle writing out buffers, the conditions for
log forcing and the sleep times needed some small changes. The most
important one is that we consider an AIL busy as long we still have buffers
to push, and the other one is that we do increment the pushed LSN for
buffers that are under flushing at this moment, but still count them towards
the stuck items for restart purposes. Without this we could hammer on stuck
items without ever forcing the log and not make progress under heavy random
delete workloads on fast flash storage devices.
[ Dave Chinner:
- rebase on previous patches.
- improved comments for XBF_DELWRI_Q handling
- fix XBF_ASYNC handling in queue submission (test 106 failure)
- rename delwri submit function buffer list parameters for clarity
- xfs_efd_item_push() should return XFS_ITEM_PINNED ]
Signed-off-by: Christoph Hellwig <hch@lst.de>
Reviewed-by: Dave Chinner <dchinner@redhat.com>
Reviewed-by: Mark Tinguely <tinguely@sgi.com>
Signed-off-by: Ben Myers <bpm@sgi.com>
2012-04-23 07:58:39 +02:00
|
|
|
xfs_efd_item_push(
|
|
|
|
struct xfs_log_item *lip,
|
|
|
|
struct list_head *buffer_list)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
xfs: on-stack delayed write buffer lists
Queue delwri buffers on a local on-stack list instead of a per-buftarg one,
and write back the buffers per-process instead of by waking up xfsbufd.
This is now easily doable given that we have very few places left that write
delwri buffers:
- log recovery:
Only done at mount time, and already forcing out the buffers
synchronously using xfs_flush_buftarg
- quotacheck:
Same story.
- dquot reclaim:
Writes out dirty dquots on the LRU under memory pressure. We might
want to look into doing more of this via xfsaild, but it's already
more optimal than the synchronous inode reclaim that writes each
buffer synchronously.
- xfsaild:
This is the main beneficiary of the change. By keeping a local list
of buffers to write we reduce latency of writing out buffers, and
more importably we can remove all the delwri list promotions which
were hitting the buffer cache hard under sustained metadata loads.
The implementation is very straight forward - xfs_buf_delwri_queue now gets
a new list_head pointer that it adds the delwri buffers to, and all callers
need to eventually submit the list using xfs_buf_delwi_submit or
xfs_buf_delwi_submit_nowait. Buffers that already are on a delwri list are
skipped in xfs_buf_delwri_queue, assuming they already are on another delwri
list. The biggest change to pass down the buffer list was done to the AIL
pushing. Now that we operate on buffers the trylock, push and pushbuf log
item methods are merged into a single push routine, which tries to lock the
item, and if possible add the buffer that needs writeback to the buffer list.
This leads to much simpler code than the previous split but requires the
individual IOP_PUSH instances to unlock and reacquire the AIL around calls
to blocking routines.
Given that xfsailds now also handle writing out buffers, the conditions for
log forcing and the sleep times needed some small changes. The most
important one is that we consider an AIL busy as long we still have buffers
to push, and the other one is that we do increment the pushed LSN for
buffers that are under flushing at this moment, but still count them towards
the stuck items for restart purposes. Without this we could hammer on stuck
items without ever forcing the log and not make progress under heavy random
delete workloads on fast flash storage devices.
[ Dave Chinner:
- rebase on previous patches.
- improved comments for XBF_DELWRI_Q handling
- fix XBF_ASYNC handling in queue submission (test 106 failure)
- rename delwri submit function buffer list parameters for clarity
- xfs_efd_item_push() should return XFS_ITEM_PINNED ]
Signed-off-by: Christoph Hellwig <hch@lst.de>
Reviewed-by: Dave Chinner <dchinner@redhat.com>
Reviewed-by: Mark Tinguely <tinguely@sgi.com>
Signed-off-by: Ben Myers <bpm@sgi.com>
2012-04-23 07:58:39 +02:00
|
|
|
return XFS_ITEM_PINNED;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
STATIC void
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_efd_item_unlock(
|
|
|
|
struct xfs_log_item *lip)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2010-06-23 10:11:15 +02:00
|
|
|
if (lip->li_flags & XFS_LI_ABORTED)
|
|
|
|
xfs_efd_item_free(EFD_ITEM(lip));
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* When the efd item is committed to disk, all we need to do
|
|
|
|
* is delete our reference to our partner efi item and then
|
|
|
|
* free ourselves. Since we're freeing ourselves we must
|
|
|
|
* return -1 to keep the transaction code from further referencing
|
|
|
|
* this item.
|
|
|
|
*/
|
|
|
|
STATIC xfs_lsn_t
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_efd_item_committed(
|
|
|
|
struct xfs_log_item *lip,
|
|
|
|
xfs_lsn_t lsn)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_efd_log_item *efdp = EFD_ITEM(lip);
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* If we got a log I/O error, it's always the case that the LR with the
|
|
|
|
* EFI got unpinned and freed before the EFD got aborted.
|
|
|
|
*/
|
2010-06-23 10:11:15 +02:00
|
|
|
if (!(lip->li_flags & XFS_LI_ABORTED))
|
2005-04-17 00:20:36 +02:00
|
|
|
xfs_efi_release(efdp->efd_efip, efdp->efd_format.efd_nextents);
|
|
|
|
|
2005-06-21 07:41:19 +02:00
|
|
|
xfs_efd_item_free(efdp);
|
2005-04-17 00:20:36 +02:00
|
|
|
return (xfs_lsn_t)-1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The EFD dependency tracking op doesn't do squat. It can't because
|
|
|
|
* it doesn't know where the free extent is coming from. The dependency
|
|
|
|
* tracking has to be handled by the "enclosing" metadata object. For
|
|
|
|
* example, for inodes, the inode is locked throughout the extent freeing
|
|
|
|
* so the dependency should be recorded there.
|
|
|
|
*/
|
|
|
|
STATIC void
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_efd_item_committing(
|
|
|
|
struct xfs_log_item *lip,
|
|
|
|
xfs_lsn_t lsn)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is the ops vector shared by all efd log items.
|
|
|
|
*/
|
2011-10-28 11:54:24 +02:00
|
|
|
static const struct xfs_item_ops xfs_efd_item_ops = {
|
2010-06-23 10:11:15 +02:00
|
|
|
.iop_size = xfs_efd_item_size,
|
|
|
|
.iop_format = xfs_efd_item_format,
|
|
|
|
.iop_pin = xfs_efd_item_pin,
|
|
|
|
.iop_unpin = xfs_efd_item_unpin,
|
|
|
|
.iop_unlock = xfs_efd_item_unlock,
|
|
|
|
.iop_committed = xfs_efd_item_committed,
|
|
|
|
.iop_push = xfs_efd_item_push,
|
|
|
|
.iop_committing = xfs_efd_item_committing
|
2005-04-17 00:20:36 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Allocate and initialize an efd item with the given number of extents.
|
|
|
|
*/
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_efd_log_item *
|
|
|
|
xfs_efd_init(
|
|
|
|
struct xfs_mount *mp,
|
|
|
|
struct xfs_efi_log_item *efip,
|
|
|
|
uint nextents)
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
{
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_efd_log_item *efdp;
|
2005-04-17 00:20:36 +02:00
|
|
|
uint size;
|
|
|
|
|
|
|
|
ASSERT(nextents > 0);
|
|
|
|
if (nextents > XFS_EFD_MAX_FAST_EXTENTS) {
|
|
|
|
size = (uint)(sizeof(xfs_efd_log_item_t) +
|
|
|
|
((nextents - 1) * sizeof(xfs_extent_t)));
|
2010-06-23 10:11:15 +02:00
|
|
|
efdp = kmem_zalloc(size, KM_SLEEP);
|
2005-04-17 00:20:36 +02:00
|
|
|
} else {
|
2010-06-23 10:11:15 +02:00
|
|
|
efdp = kmem_zone_zalloc(xfs_efd_zone, KM_SLEEP);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2010-03-23 00:10:00 +01:00
|
|
|
xfs_log_item_init(mp, &efdp->efd_item, XFS_LI_EFD, &xfs_efd_item_ops);
|
2005-04-17 00:20:36 +02:00
|
|
|
efdp->efd_efip = efip;
|
|
|
|
efdp->efd_format.efd_nextents = nextents;
|
|
|
|
efdp->efd_format.efd_efi_id = efip->efi_format.efi_id;
|
|
|
|
|
2010-06-23 10:11:15 +02:00
|
|
|
return efdp;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|