2005-04-17 00:20:36 +02:00
|
|
|
/*
|
2005-11-02 04:59:41 +01:00
|
|
|
* Copyright (c) 2000-2003 Silicon Graphics, Inc.
|
|
|
|
* All Rights Reserved.
|
2005-04-17 00:20:36 +02:00
|
|
|
*
|
2005-11-02 04:59:41 +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:59:41 +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:59:41 +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"
|
|
|
|
#include "xfs_fs.h"
|
2005-11-02 04:38:42 +01:00
|
|
|
#include "xfs_bit.h"
|
2005-04-17 00:20:36 +02:00
|
|
|
#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_sb.h"
|
|
|
|
#include "xfs_ag.h"
|
|
|
|
#include "xfs_alloc.h"
|
|
|
|
#include "xfs_quota.h"
|
|
|
|
#include "xfs_mount.h"
|
|
|
|
#include "xfs_bmap_btree.h"
|
|
|
|
#include "xfs_inode.h"
|
|
|
|
#include "xfs_bmap.h"
|
|
|
|
#include "xfs_rtalloc.h"
|
|
|
|
#include "xfs_error.h"
|
|
|
|
#include "xfs_itable.h"
|
|
|
|
#include "xfs_attr.h"
|
|
|
|
#include "xfs_buf_item.h"
|
|
|
|
#include "xfs_trans_priv.h"
|
|
|
|
#include "xfs_qm.h"
|
|
|
|
|
2010-06-23 10:11:15 +02:00
|
|
|
static inline struct xfs_dq_logitem *DQUOT_ITEM(struct xfs_log_item *lip)
|
|
|
|
{
|
|
|
|
return container_of(lip, struct xfs_dq_logitem, qli_item);
|
|
|
|
}
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* returns the number of iovecs needed to log the given dquot item.
|
|
|
|
*/
|
|
|
|
STATIC uint
|
|
|
|
xfs_qm_dquot_logitem_size(
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_log_item *lip)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
/*
|
|
|
|
* we need only two iovecs, one for the format, one for the real thing
|
|
|
|
*/
|
2010-06-23 10:11:15 +02:00
|
|
|
return 2;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* fills in the vector of log iovecs for the given dquot log item.
|
|
|
|
*/
|
|
|
|
STATIC void
|
|
|
|
xfs_qm_dquot_logitem_format(
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_log_item *lip,
|
|
|
|
struct xfs_log_iovec *logvec)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_dq_logitem *qlip = DQUOT_ITEM(lip);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-06-23 10:11:15 +02:00
|
|
|
logvec->i_addr = &qlip->qli_format;
|
2005-04-17 00:20:36 +02:00
|
|
|
logvec->i_len = sizeof(xfs_dq_logformat_t);
|
2010-01-19 10:56:45 +01:00
|
|
|
logvec->i_type = XLOG_REG_TYPE_QFORMAT;
|
2005-04-17 00:20:36 +02:00
|
|
|
logvec++;
|
2010-06-23 10:11:15 +02:00
|
|
|
logvec->i_addr = &qlip->qli_dquot->q_core;
|
2005-04-17 00:20:36 +02:00
|
|
|
logvec->i_len = sizeof(xfs_disk_dquot_t);
|
2010-01-19 10:56:45 +01:00
|
|
|
logvec->i_type = XLOG_REG_TYPE_DQUOT;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-06-23 10:11:15 +02:00
|
|
|
qlip->qli_format.qlf_size = 2;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Increment the pin count of the given dquot.
|
|
|
|
*/
|
|
|
|
STATIC void
|
|
|
|
xfs_qm_dquot_logitem_pin(
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_log_item *lip)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_dquot *dqp = DQUOT_ITEM(lip)->qli_dquot;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
ASSERT(XFS_DQ_IS_LOCKED(dqp));
|
2008-10-30 07:05:18 +01:00
|
|
|
atomic_inc(&dqp->q_pincount);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Decrement the pin count of the given dquot, and wake up
|
|
|
|
* anyone in xfs_dqwait_unpin() if the count goes to 0. The
|
2008-10-30 07:05:04 +01:00
|
|
|
* dquot must have been previously pinned with a call to
|
|
|
|
* xfs_qm_dquot_logitem_pin().
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
|
|
|
STATIC void
|
|
|
|
xfs_qm_dquot_logitem_unpin(
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_log_item *lip,
|
2010-06-23 10:11:15 +02:00
|
|
|
int remove)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_dquot *dqp = DQUOT_ITEM(lip)->qli_dquot;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-10-30 07:05:04 +01:00
|
|
|
ASSERT(atomic_read(&dqp->q_pincount) > 0);
|
|
|
|
if (atomic_dec_and_test(&dqp->q_pincount))
|
|
|
|
wake_up(&dqp->q_pinwait);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
STATIC xfs_lsn_t
|
|
|
|
xfs_qm_dquot_logitem_committed(
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_log_item *lip,
|
2005-04-17 00:20:36 +02:00
|
|
|
xfs_lsn_t lsn)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* We always re-log the entire dquot when it becomes dirty,
|
|
|
|
* so, the latest copy _is_ the only one that matters.
|
|
|
|
*/
|
2010-06-23 10:11:15 +02:00
|
|
|
return lsn;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is called to wait for the given dquot to be unpinned.
|
|
|
|
* Most of these pin/unpin routines are plagiarized from inode code.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
xfs_qm_dqunpin_wait(
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_dquot *dqp)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
ASSERT(XFS_DQ_IS_LOCKED(dqp));
|
2008-10-30 07:05:04 +01:00
|
|
|
if (atomic_read(&dqp->q_pincount) == 0)
|
2005-04-17 00:20:36 +02:00
|
|
|
return;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Give the log a push so we don't wait here too long.
|
|
|
|
*/
|
2010-01-19 10:56:46 +01:00
|
|
|
xfs_log_force(dqp->q_mount, 0);
|
2008-10-30 07:05:04 +01:00
|
|
|
wait_event(dqp->q_pinwait, (atomic_read(&dqp->q_pincount) == 0));
|
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_qm_dquot_logitem_push(
|
|
|
|
struct xfs_log_item *lip,
|
|
|
|
struct list_head *buffer_list)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_dquot *dqp = DQUOT_ITEM(lip)->qli_dquot;
|
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
|
|
|
struct xfs_buf *bp = NULL;
|
|
|
|
uint rval = XFS_ITEM_SUCCESS;
|
|
|
|
int error;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-10-30 07:05:04 +01:00
|
|
|
if (atomic_read(&dqp->q_pincount) > 0)
|
2010-02-02 00:13:42 +01:00
|
|
|
return XFS_ITEM_PINNED;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-12-06 22:58:14 +01:00
|
|
|
if (!xfs_dqlock_nowait(dqp))
|
2010-02-02 00:13:42 +01:00
|
|
|
return XFS_ITEM_LOCKED;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2012-04-23 07:58:37 +02:00
|
|
|
/*
|
|
|
|
* Re-check the pincount now that we stabilized the value by
|
|
|
|
* taking the quota lock.
|
|
|
|
*/
|
|
|
|
if (atomic_read(&dqp->q_pincount) > 0) {
|
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
|
|
|
rval = XFS_ITEM_PINNED;
|
|
|
|
goto out_unlock;
|
2012-04-23 07:58:37 +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
|
|
|
/*
|
|
|
|
* Someone else is already flushing the dquot. Nothing we can do
|
|
|
|
* here but wait for the flush to finish and remove the item from
|
|
|
|
* the AIL.
|
|
|
|
*/
|
2008-08-13 08:41:43 +02:00
|
|
|
if (!xfs_dqflock_nowait(dqp)) {
|
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
|
|
|
rval = XFS_ITEM_FLUSHING;
|
|
|
|
goto out_unlock;
|
|
|
|
}
|
|
|
|
|
|
|
|
spin_unlock(&lip->li_ailp->xa_lock);
|
|
|
|
|
|
|
|
error = xfs_qm_dqflush(dqp, &bp);
|
|
|
|
if (error) {
|
|
|
|
xfs_warn(dqp->q_mount, "%s: push error %d on dqp %p",
|
|
|
|
__func__, error, dqp);
|
|
|
|
} else {
|
|
|
|
if (!xfs_buf_delwri_queue(bp, buffer_list))
|
|
|
|
rval = XFS_ITEM_FLUSHING;
|
|
|
|
xfs_buf_relse(bp);
|
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
|
|
|
spin_lock(&lip->li_ailp->xa_lock);
|
|
|
|
out_unlock:
|
|
|
|
xfs_dqunlock(dqp);
|
|
|
|
return rval;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Unlock the dquot associated with the log item.
|
|
|
|
* Clear the fields of the dquot and dquot log item that
|
|
|
|
* are specific to the current transaction. If the
|
|
|
|
* hold flags is set, do not unlock the dquot.
|
|
|
|
*/
|
|
|
|
STATIC void
|
|
|
|
xfs_qm_dquot_logitem_unlock(
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_log_item *lip)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_dquot *dqp = DQUOT_ITEM(lip)->qli_dquot;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
ASSERT(XFS_DQ_IS_LOCKED(dqp));
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Clear the transaction pointer in the dquot
|
|
|
|
*/
|
|
|
|
dqp->q_transp = NULL;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* dquots are never 'held' from getting unlocked at the end of
|
|
|
|
* a transaction. Their locking and unlocking is hidden inside the
|
|
|
|
* transaction layer, within trans_commit. Hence, no LI_HOLD flag
|
|
|
|
* for the logitem.
|
|
|
|
*/
|
|
|
|
xfs_dqunlock(dqp);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* this needs to stamp an lsn into the dquot, I think.
|
|
|
|
* rpc's that look at user dquot's would then have to
|
|
|
|
* push on the dependency recorded in the dquot
|
|
|
|
*/
|
|
|
|
STATIC void
|
|
|
|
xfs_qm_dquot_logitem_committing(
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_log_item *lip,
|
2005-04-17 00:20:36 +02:00
|
|
|
xfs_lsn_t lsn)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is the ops vector for dquots
|
|
|
|
*/
|
2011-10-28 11:54:24 +02:00
|
|
|
static const struct xfs_item_ops xfs_dquot_item_ops = {
|
2010-06-23 10:11:15 +02:00
|
|
|
.iop_size = xfs_qm_dquot_logitem_size,
|
|
|
|
.iop_format = xfs_qm_dquot_logitem_format,
|
|
|
|
.iop_pin = xfs_qm_dquot_logitem_pin,
|
|
|
|
.iop_unpin = xfs_qm_dquot_logitem_unpin,
|
|
|
|
.iop_unlock = xfs_qm_dquot_logitem_unlock,
|
|
|
|
.iop_committed = xfs_qm_dquot_logitem_committed,
|
|
|
|
.iop_push = xfs_qm_dquot_logitem_push,
|
|
|
|
.iop_committing = xfs_qm_dquot_logitem_committing
|
2005-04-17 00:20:36 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Initialize the dquot log item for a newly allocated dquot.
|
|
|
|
* The dquot isn't locked at this point, but it isn't on any of the lists
|
|
|
|
* either, so we don't care.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
xfs_qm_dquot_logitem_init(
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_dquot *dqp)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_dq_logitem *lp = &dqp->q_logitem;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-03-23 00:10:00 +01:00
|
|
|
xfs_log_item_init(dqp->q_mount, &lp->qli_item, XFS_LI_DQUOT,
|
|
|
|
&xfs_dquot_item_ops);
|
2005-04-17 00:20:36 +02:00
|
|
|
lp->qli_dquot = dqp;
|
|
|
|
lp->qli_format.qlf_type = XFS_LI_DQUOT;
|
2005-11-02 05:01:12 +01:00
|
|
|
lp->qli_format.qlf_id = be32_to_cpu(dqp->q_core.d_id);
|
2005-04-17 00:20:36 +02:00
|
|
|
lp->qli_format.qlf_blkno = dqp->q_blkno;
|
|
|
|
lp->qli_format.qlf_len = 1;
|
|
|
|
/*
|
|
|
|
* This is just the offset of this dquot within its buffer
|
|
|
|
* (which is currently 1 FSB and probably won't change).
|
|
|
|
* Hence 32 bits for this offset should be just fine.
|
|
|
|
* Alternatively, we can store (bufoffset / sizeof(xfs_dqblk_t))
|
|
|
|
* here, and recompute it at recovery time.
|
|
|
|
*/
|
|
|
|
lp->qli_format.qlf_boffset = (__uint32_t)dqp->q_bufoffset;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*------------------ QUOTAOFF LOG ITEMS -------------------*/
|
|
|
|
|
2010-06-23 10:11:15 +02:00
|
|
|
static inline struct xfs_qoff_logitem *QOFF_ITEM(struct xfs_log_item *lip)
|
|
|
|
{
|
|
|
|
return container_of(lip, struct xfs_qoff_logitem, qql_item);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* This returns the number of iovecs needed to log the given quotaoff item.
|
|
|
|
* We only need 1 iovec for an quotaoff item. It just logs the
|
|
|
|
* quotaoff_log_format structure.
|
|
|
|
*/
|
|
|
|
STATIC uint
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_qm_qoff_logitem_size(
|
|
|
|
struct xfs_log_item *lip)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2010-06-23 10:11:15 +02:00
|
|
|
return 1;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is called to fill in the vector of log iovecs for the
|
|
|
|
* given quotaoff log item. We use only 1 iovec, and we point that
|
|
|
|
* at the quotaoff_log_format structure embedded in the quotaoff item.
|
|
|
|
* It is at this point that we assert that all of the extent
|
|
|
|
* slots in the quotaoff item have been filled.
|
|
|
|
*/
|
|
|
|
STATIC void
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_qm_qoff_logitem_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_qoff_logitem *qflip = QOFF_ITEM(lip);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-06-23 10:11:15 +02:00
|
|
|
ASSERT(qflip->qql_format.qf_type == XFS_LI_QUOTAOFF);
|
|
|
|
|
2010-06-23 10:11:15 +02:00
|
|
|
log_vector->i_addr = &qflip->qql_format;
|
2005-04-17 00:20:36 +02:00
|
|
|
log_vector->i_len = sizeof(xfs_qoff_logitem_t);
|
2010-01-19 10:56:45 +01:00
|
|
|
log_vector->i_type = XLOG_REG_TYPE_QUOTAOFF;
|
2010-06-23 10:11:15 +02:00
|
|
|
qflip->qql_format.qf_size = 1;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Pinning has no meaning for an quotaoff item, so just return.
|
|
|
|
*/
|
|
|
|
STATIC void
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_qm_qoff_logitem_pin(
|
|
|
|
struct xfs_log_item *lip)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Since pinning has no meaning for an quotaoff item, unpinning does
|
|
|
|
* not either.
|
|
|
|
*/
|
|
|
|
STATIC void
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_qm_qoff_logitem_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 a quotaoff 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_qm_qoff_logitem_push(
|
|
|
|
struct xfs_log_item *lip,
|
|
|
|
struct list_head *buffer_list)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
return XFS_ITEM_LOCKED;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Quotaoff items have no locking or pushing, so return failure
|
|
|
|
* so that the caller doesn't bother with us.
|
|
|
|
*/
|
|
|
|
STATIC void
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_qm_qoff_logitem_unlock(
|
|
|
|
struct xfs_log_item *lip)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The quotaoff-start-item is logged only once and cannot be moved in the log,
|
|
|
|
* so simply return the lsn at which it's been logged.
|
|
|
|
*/
|
|
|
|
STATIC xfs_lsn_t
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_qm_qoff_logitem_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
|
|
|
return lsn;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
STATIC xfs_lsn_t
|
|
|
|
xfs_qm_qoffend_logitem_committed(
|
2010-06-23 10:11:15 +02:00
|
|
|
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_qoff_logitem *qfe = QOFF_ITEM(lip);
|
|
|
|
struct xfs_qoff_logitem *qfs = qfe->qql_start_lip;
|
|
|
|
struct xfs_ail *ailp = qfs->qql_item.li_ailp;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Delete the qoff-start logitem from the AIL.
|
2008-10-30 07:39:58 +01:00
|
|
|
* xfs_trans_ail_delete() drops the AIL lock.
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
2010-06-23 10:11:15 +02:00
|
|
|
spin_lock(&ailp->xa_lock);
|
2008-10-30 07:39:58 +01:00
|
|
|
xfs_trans_ail_delete(ailp, (xfs_log_item_t *)qfs);
|
2010-06-23 10:11:15 +02:00
|
|
|
|
2008-05-19 08:31:57 +02:00
|
|
|
kmem_free(qfs);
|
|
|
|
kmem_free(qfe);
|
2005-04-17 00:20:36 +02:00
|
|
|
return (xfs_lsn_t)-1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* XXX rcc - don't know quite what to do with this. I think we can
|
|
|
|
* just ignore it. The only time that isn't the case is if we allow
|
|
|
|
* the client to somehow see that quotas have been turned off in which
|
|
|
|
* we can't allow that to get back until the quotaoff hits the disk.
|
|
|
|
* So how would that happen? Also, do we need different routines for
|
|
|
|
* quotaoff start and quotaoff end? I suspect the answer is yes but
|
|
|
|
* to be sure, I need to look at the recovery code and see how quota off
|
|
|
|
* recovery is handled (do we roll forward or back or do something else).
|
|
|
|
* If we roll forwards or backwards, then we need two separate routines,
|
|
|
|
* one that does nothing and one that stamps in the lsn that matters
|
|
|
|
* (truly makes the quotaoff irrevocable). If we do something else,
|
|
|
|
* then maybe we don't need two.
|
|
|
|
*/
|
|
|
|
STATIC void
|
2010-06-23 10:11:15 +02:00
|
|
|
xfs_qm_qoff_logitem_committing(
|
|
|
|
struct xfs_log_item *lip,
|
|
|
|
xfs_lsn_t commit_lsn)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2011-10-28 11:54:24 +02:00
|
|
|
static const struct xfs_item_ops xfs_qm_qoffend_logitem_ops = {
|
2010-06-23 10:11:15 +02:00
|
|
|
.iop_size = xfs_qm_qoff_logitem_size,
|
|
|
|
.iop_format = xfs_qm_qoff_logitem_format,
|
|
|
|
.iop_pin = xfs_qm_qoff_logitem_pin,
|
|
|
|
.iop_unpin = xfs_qm_qoff_logitem_unpin,
|
|
|
|
.iop_unlock = xfs_qm_qoff_logitem_unlock,
|
|
|
|
.iop_committed = xfs_qm_qoffend_logitem_committed,
|
|
|
|
.iop_push = xfs_qm_qoff_logitem_push,
|
|
|
|
.iop_committing = xfs_qm_qoff_logitem_committing
|
2005-04-17 00:20:36 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is the ops vector shared by all quotaoff-start log items.
|
|
|
|
*/
|
2011-10-28 11:54:24 +02:00
|
|
|
static const struct xfs_item_ops xfs_qm_qoff_logitem_ops = {
|
2010-06-23 10:11:15 +02:00
|
|
|
.iop_size = xfs_qm_qoff_logitem_size,
|
|
|
|
.iop_format = xfs_qm_qoff_logitem_format,
|
|
|
|
.iop_pin = xfs_qm_qoff_logitem_pin,
|
|
|
|
.iop_unpin = xfs_qm_qoff_logitem_unpin,
|
|
|
|
.iop_unlock = xfs_qm_qoff_logitem_unlock,
|
|
|
|
.iop_committed = xfs_qm_qoff_logitem_committed,
|
|
|
|
.iop_push = xfs_qm_qoff_logitem_push,
|
|
|
|
.iop_committing = xfs_qm_qoff_logitem_committing
|
2005-04-17 00:20:36 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Allocate and initialize an quotaoff item of the correct quota type(s).
|
|
|
|
*/
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_qoff_logitem *
|
2005-04-17 00:20:36 +02:00
|
|
|
xfs_qm_qoff_logitem_init(
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_mount *mp,
|
|
|
|
struct xfs_qoff_logitem *start,
|
|
|
|
uint flags)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2010-06-23 10:11:15 +02:00
|
|
|
struct xfs_qoff_logitem *qf;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-06-23 10:11:15 +02:00
|
|
|
qf = kmem_zalloc(sizeof(struct xfs_qoff_logitem), KM_SLEEP);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-03-23 00:10:00 +01:00
|
|
|
xfs_log_item_init(mp, &qf->qql_item, XFS_LI_QUOTAOFF, start ?
|
|
|
|
&xfs_qm_qoffend_logitem_ops : &xfs_qm_qoff_logitem_ops);
|
2005-04-17 00:20:36 +02:00
|
|
|
qf->qql_item.li_mountp = mp;
|
|
|
|
qf->qql_format.qf_type = XFS_LI_QUOTAOFF;
|
|
|
|
qf->qql_format.qf_flags = flags;
|
|
|
|
qf->qql_start_lip = start;
|
2010-06-23 10:11:15 +02:00
|
|
|
return qf;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|