xfs_trans_extfree.c 6.1 KB
Newer Older
L
Linus Torvalds 已提交
1
/*
2 3
 * Copyright (c) 2000,2005 Silicon Graphics, Inc.
 * All Rights Reserved.
L
Linus Torvalds 已提交
4
 *
5 6
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License as
L
Linus Torvalds 已提交
7 8
 * published by the Free Software Foundation.
 *
9 10 11 12
 * 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.
L
Linus Torvalds 已提交
13
 *
14 15 16
 * 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
L
Linus Torvalds 已提交
17 18
 */
#include "xfs.h"
19
#include "xfs_fs.h"
20
#include "xfs_shared.h"
21
#include "xfs_format.h"
22 23
#include "xfs_log_format.h"
#include "xfs_trans_resv.h"
24
#include "xfs_bit.h"
L
Linus Torvalds 已提交
25
#include "xfs_mount.h"
26
#include "xfs_defer.h"
27
#include "xfs_trans.h"
L
Linus Torvalds 已提交
28 29
#include "xfs_trans_priv.h"
#include "xfs_extfree_item.h"
30
#include "xfs_alloc.h"
31
#include "xfs_bmap.h"
32
#include "xfs_trace.h"
L
Linus Torvalds 已提交
33 34 35 36 37 38 39

/*
 * This routine is called to allocate an "extent free done"
 * log item that will hold nextents worth of extents.  The
 * caller must use all nextents extents, because we are not
 * flexible about this at all.
 */
40 41 42 43
struct xfs_efd_log_item *
xfs_trans_get_efd(struct xfs_trans		*tp,
		  struct xfs_efi_log_item	*efip,
		  uint				nextents)
L
Linus Torvalds 已提交
44
{
45
	struct xfs_efd_log_item			*efdp;
L
Linus Torvalds 已提交
46 47 48 49 50 51 52 53 54 55

	ASSERT(tp != NULL);
	ASSERT(nextents > 0);

	efdp = xfs_efd_init(tp->t_mountp, efip, nextents);
	ASSERT(efdp != NULL);

	/*
	 * Get a log_item_desc to point at the new item.
	 */
56 57
	xfs_trans_add_item(tp, &efdp->efd_item);
	return efdp;
L
Linus Torvalds 已提交
58 59 60
}

/*
61 62 63
 * Free an extent and log it to the EFD. Note that the transaction is marked
 * dirty regardless of whether the extent free succeeds or fails to support the
 * EFI/EFD lifecycle rules.
L
Linus Torvalds 已提交
64
 */
65 66 67 68 69
int
xfs_trans_free_extent(
	struct xfs_trans	*tp,
	struct xfs_efd_log_item	*efdp,
	xfs_fsblock_t		start_block,
70 71
	xfs_extlen_t		ext_len,
	struct xfs_owner_info	*oinfo)
L
Linus Torvalds 已提交
72
{
73
	struct xfs_mount	*mp = tp->t_mountp;
L
Linus Torvalds 已提交
74
	uint			next_extent;
75 76
	xfs_agnumber_t		agno = XFS_FSB_TO_AGNO(mp, start_block);
	xfs_agblock_t		agbno = XFS_FSB_TO_AGBNO(mp, start_block);
77 78
	struct xfs_extent	*extp;
	int			error;
L
Linus Torvalds 已提交
79

80 81
	trace_xfs_bmap_free_deferred(tp->t_mountp, agno, 0, agbno, ext_len);

82
	error = xfs_free_extent(tp, start_block, ext_len, oinfo);
83 84 85 86 87 88 89 90

	/*
	 * Mark the transaction dirty, even on error. This ensures the
	 * transaction is aborted, which:
	 *
	 * 1.) releases the EFI and frees the EFD
	 * 2.) shuts down the filesystem
	 */
L
Linus Torvalds 已提交
91
	tp->t_flags |= XFS_TRANS_DIRTY;
92
	efdp->efd_item.li_desc->lid_flags |= XFS_LID_DIRTY;
L
Linus Torvalds 已提交
93 94 95 96 97 98 99

	next_extent = efdp->efd_next_extent;
	ASSERT(next_extent < efdp->efd_format.efd_nextents);
	extp = &(efdp->efd_format.efd_extents[next_extent]);
	extp->ext_start = start_block;
	extp->ext_len = ext_len;
	efdp->efd_next_extent++;
100 101

	return error;
L
Linus Torvalds 已提交
102
}
103 104 105 106 107 108 109 110 111

/* Sort bmap items by AG. */
static int
xfs_extent_free_diff_items(
	void				*priv,
	struct list_head		*a,
	struct list_head		*b)
{
	struct xfs_mount		*mp = priv;
112 113
	struct xfs_extent_free_item	*ra;
	struct xfs_extent_free_item	*rb;
114

115 116 117 118
	ra = container_of(a, struct xfs_extent_free_item, xefi_list);
	rb = container_of(b, struct xfs_extent_free_item, xefi_list);
	return  XFS_FSB_TO_AGNO(mp, ra->xefi_startblock) -
		XFS_FSB_TO_AGNO(mp, rb->xefi_startblock);
119 120 121 122 123 124 125 126
}

/* Get an EFI. */
STATIC void *
xfs_extent_free_create_intent(
	struct xfs_trans		*tp,
	unsigned int			count)
{
127 128 129 130 131 132 133 134 135 136 137 138 139
	struct xfs_efi_log_item		*efip;

	ASSERT(tp != NULL);
	ASSERT(count > 0);

	efip = xfs_efi_init(tp->t_mountp, count);
	ASSERT(efip != NULL);

	/*
	 * Get a log_item_desc to point at the new item.
	 */
	xfs_trans_add_item(tp, &efip->efi_item);
	return efip;
140 141 142 143 144 145 146 147 148
}

/* Log a free extent to the intent item. */
STATIC void
xfs_extent_free_log_item(
	struct xfs_trans		*tp,
	void				*intent,
	struct list_head		*item)
{
149
	struct xfs_efi_log_item		*efip = intent;
150
	struct xfs_extent_free_item	*free;
151 152
	uint				next_extent;
	struct xfs_extent		*extp;
153

154
	free = container_of(item, struct xfs_extent_free_item, xefi_list);
155 156 157 158 159 160 161 162 163 164 165 166 167 168

	tp->t_flags |= XFS_TRANS_DIRTY;
	efip->efi_item.li_desc->lid_flags |= XFS_LID_DIRTY;

	/*
	 * atomic_inc_return gives us the value after the increment;
	 * we want to use it as an array index so we need to subtract 1 from
	 * it.
	 */
	next_extent = atomic_inc_return(&efip->efi_next_extent) - 1;
	ASSERT(next_extent < efip->efi_format.efi_nextents);
	extp = &efip->efi_format.efi_extents[next_extent];
	extp->ext_start = free->xefi_startblock;
	extp->ext_len = free->xefi_blockcount;
169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189
}

/* Get an EFD so we can process all the free extents. */
STATIC void *
xfs_extent_free_create_done(
	struct xfs_trans		*tp,
	void				*intent,
	unsigned int			count)
{
	return xfs_trans_get_efd(tp, intent, count);
}

/* Process a free extent. */
STATIC int
xfs_extent_free_finish_item(
	struct xfs_trans		*tp,
	struct xfs_defer_ops		*dop,
	struct list_head		*item,
	void				*done_item,
	void				**state)
{
190
	struct xfs_extent_free_item	*free;
191 192
	int				error;

193
	free = container_of(item, struct xfs_extent_free_item, xefi_list);
194
	error = xfs_trans_free_extent(tp, done_item,
195
			free->xefi_startblock,
196 197
			free->xefi_blockcount,
			&free->xefi_oinfo);
198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214
	kmem_free(free);
	return error;
}

/* Abort all pending EFIs. */
STATIC void
xfs_extent_free_abort_intent(
	void				*intent)
{
	xfs_efi_release(intent);
}

/* Cancel a free extent. */
STATIC void
xfs_extent_free_cancel_item(
	struct list_head		*item)
{
215
	struct xfs_extent_free_item	*free;
216

217
	free = container_of(item, struct xfs_extent_free_item, xefi_list);
218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238
	kmem_free(free);
}

static const struct xfs_defer_op_type xfs_extent_free_defer_type = {
	.type		= XFS_DEFER_OPS_TYPE_FREE,
	.max_items	= XFS_EFI_MAX_FAST_EXTENTS,
	.diff_items	= xfs_extent_free_diff_items,
	.create_intent	= xfs_extent_free_create_intent,
	.abort_intent	= xfs_extent_free_abort_intent,
	.log_item	= xfs_extent_free_log_item,
	.create_done	= xfs_extent_free_create_done,
	.finish_item	= xfs_extent_free_finish_item,
	.cancel_item	= xfs_extent_free_cancel_item,
};

/* Register the deferred op type. */
void
xfs_extent_free_init_defer_op(void)
{
	xfs_defer_init_op_type(&xfs_extent_free_defer_type);
}