xfs_buf_item.c 29.0 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"
L
Linus Torvalds 已提交
20
#include "xfs_types.h"
21
#include "xfs_bit.h"
L
Linus Torvalds 已提交
22
#include "xfs_log.h"
23
#include "xfs_inum.h"
L
Linus Torvalds 已提交
24 25
#include "xfs_trans.h"
#include "xfs_sb.h"
26
#include "xfs_ag.h"
L
Linus Torvalds 已提交
27
#include "xfs_mount.h"
28
#include "xfs_buf_item.h"
L
Linus Torvalds 已提交
29 30
#include "xfs_trans_priv.h"
#include "xfs_error.h"
C
Christoph Hellwig 已提交
31
#include "xfs_trace.h"
L
Linus Torvalds 已提交
32 33 34 35


kmem_zone_t	*xfs_buf_item_zone;

36 37 38 39 40 41
static inline struct xfs_buf_log_item *BUF_ITEM(struct xfs_log_item *lip)
{
	return container_of(lip, struct xfs_buf_log_item, bli_item);
}


L
Linus Torvalds 已提交
42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71
#ifdef XFS_TRANS_DEBUG
/*
 * This function uses an alternate strategy for tracking the bytes
 * that the user requests to be logged.  This can then be used
 * in conjunction with the bli_orig array in the buf log item to
 * catch bugs in our callers' code.
 *
 * We also double check the bits set in xfs_buf_item_log using a
 * simple algorithm to check that every byte is accounted for.
 */
STATIC void
xfs_buf_item_log_debug(
	xfs_buf_log_item_t	*bip,
	uint			first,
	uint			last)
{
	uint	x;
	uint	byte;
	uint	nbytes;
	uint	chunk_num;
	uint	word_num;
	uint	bit_num;
	uint	bit_set;
	uint	*wordp;

	ASSERT(bip->bli_logged != NULL);
	byte = first;
	nbytes = last - first + 1;
	bfset(bip->bli_logged, first, nbytes);
	for (x = 0; x < nbytes; x++) {
72
		chunk_num = byte >> XFS_BLF_SHIFT;
L
Linus Torvalds 已提交
73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92
		word_num = chunk_num >> BIT_TO_WORD_SHIFT;
		bit_num = chunk_num & (NBWORD - 1);
		wordp = &(bip->bli_format.blf_data_map[word_num]);
		bit_set = *wordp & (1 << bit_num);
		ASSERT(bit_set);
		byte++;
	}
}

/*
 * This function is called when we flush something into a buffer without
 * logging it.  This happens for things like inodes which are logged
 * separately from the buffer.
 */
void
xfs_buf_item_flush_log_debug(
	xfs_buf_t	*bp,
	uint		first,
	uint		last)
{
93
	xfs_buf_log_item_t	*bip = bp->b_fspriv;
L
Linus Torvalds 已提交
94 95
	uint			nbytes;

96
	if (bip == NULL || (bip->bli_item.li_type != XFS_LI_BUF))
L
Linus Torvalds 已提交
97 98 99 100 101 102 103 104
		return;

	ASSERT(bip->bli_logged != NULL);
	nbytes = last - first + 1;
	bfset(bip->bli_logged, first, nbytes);
}

/*
105
 * This function is called to verify that our callers have logged
L
Linus Torvalds 已提交
106 107 108 109
 * all the bytes that they changed.
 *
 * It does this by comparing the original copy of the buffer stored in
 * the buf log item's bli_orig array to the current copy of the buffer
110
 * and ensuring that all bytes which mismatch are set in the bli_logged
L
Linus Torvalds 已提交
111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130
 * array of the buf log item.
 */
STATIC void
xfs_buf_item_log_check(
	xfs_buf_log_item_t	*bip)
{
	char		*orig;
	char		*buffer;
	int		x;
	xfs_buf_t	*bp;

	ASSERT(bip->bli_orig != NULL);
	ASSERT(bip->bli_logged != NULL);

	bp = bip->bli_buf;
	ASSERT(XFS_BUF_COUNT(bp) > 0);
	ASSERT(XFS_BUF_PTR(bp) != NULL);
	orig = bip->bli_orig;
	buffer = XFS_BUF_PTR(bp);
	for (x = 0; x < XFS_BUF_COUNT(bp); x++) {
131 132 133 134 135 136
		if (orig[x] != buffer[x] && !btst(bip->bli_logged, x)) {
			xfs_emerg(bp->b_mount,
				"%s: bip %x buffer %x orig %x index %d",
				__func__, bip, bp, orig, x);
			ASSERT(0);
		}
L
Linus Torvalds 已提交
137 138 139 140 141 142 143
	}
}
#else
#define		xfs_buf_item_log_debug(x,y,z)
#define		xfs_buf_item_log_check(x)
#endif

144
STATIC void	xfs_buf_do_callbacks(struct xfs_buf *bp);
L
Linus Torvalds 已提交
145 146 147 148 149 150 151 152 153 154 155

/*
 * This returns the number of log iovecs needed to log the
 * given buf log item.
 *
 * It calculates this as 1 iovec for the buf log format structure
 * and 1 for each stretch of non-contiguous chunks to be logged.
 * Contiguous chunks are logged in a single iovec.
 *
 * If the XFS_BLI_STALE flag has been set, then log nothing.
 */
156
STATIC uint
L
Linus Torvalds 已提交
157
xfs_buf_item_size(
158
	struct xfs_log_item	*lip)
L
Linus Torvalds 已提交
159
{
160 161 162 163 164
	struct xfs_buf_log_item	*bip = BUF_ITEM(lip);
	struct xfs_buf		*bp = bip->bli_buf;
	uint			nvecs;
	int			next_bit;
	int			last_bit;
L
Linus Torvalds 已提交
165 166 167 168 169 170 171 172

	ASSERT(atomic_read(&bip->bli_refcount) > 0);
	if (bip->bli_flags & XFS_BLI_STALE) {
		/*
		 * The buffer is stale, so all we need to log
		 * is the buf log format structure with the
		 * cancel flag in it.
		 */
C
Christoph Hellwig 已提交
173
		trace_xfs_buf_item_size_stale(bip);
174
		ASSERT(bip->bli_format.blf_flags & XFS_BLF_CANCEL);
L
Linus Torvalds 已提交
175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203
		return 1;
	}

	ASSERT(bip->bli_flags & XFS_BLI_LOGGED);
	nvecs = 1;
	last_bit = xfs_next_bit(bip->bli_format.blf_data_map,
					 bip->bli_format.blf_map_size, 0);
	ASSERT(last_bit != -1);
	nvecs++;
	while (last_bit != -1) {
		/*
		 * This takes the bit number to start looking from and
		 * returns the next set bit from there.  It returns -1
		 * if there are no more bits set or the start bit is
		 * beyond the end of the bitmap.
		 */
		next_bit = xfs_next_bit(bip->bli_format.blf_data_map,
						 bip->bli_format.blf_map_size,
						 last_bit + 1);
		/*
		 * If we run out of bits, leave the loop,
		 * else if we find a new set of bits bump the number of vecs,
		 * else keep scanning the current set of bits.
		 */
		if (next_bit == -1) {
			last_bit = -1;
		} else if (next_bit != last_bit + 1) {
			last_bit = next_bit;
			nvecs++;
204 205 206
		} else if (xfs_buf_offset(bp, next_bit * XFS_BLF_CHUNK) !=
			   (xfs_buf_offset(bp, last_bit * XFS_BLF_CHUNK) +
			    XFS_BLF_CHUNK)) {
L
Linus Torvalds 已提交
207 208 209 210 211 212 213
			last_bit = next_bit;
			nvecs++;
		} else {
			last_bit++;
		}
	}

C
Christoph Hellwig 已提交
214
	trace_xfs_buf_item_size(bip);
L
Linus Torvalds 已提交
215 216 217 218 219 220 221 222 223
	return nvecs;
}

/*
 * This is called to fill in the vector of log iovecs for the
 * given log buf item.  It fills the first entry with a buf log
 * format structure, and the rest point to contiguous chunks
 * within the buffer.
 */
224
STATIC void
L
Linus Torvalds 已提交
225
xfs_buf_item_format(
226 227
	struct xfs_log_item	*lip,
	struct xfs_log_iovec	*vecp)
L
Linus Torvalds 已提交
228
{
229 230
	struct xfs_buf_log_item	*bip = BUF_ITEM(lip);
	struct xfs_buf	*bp = bip->bli_buf;
L
Linus Torvalds 已提交
231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252
	uint		base_size;
	uint		nvecs;
	int		first_bit;
	int		last_bit;
	int		next_bit;
	uint		nbits;
	uint		buffer_offset;

	ASSERT(atomic_read(&bip->bli_refcount) > 0);
	ASSERT((bip->bli_flags & XFS_BLI_LOGGED) ||
	       (bip->bli_flags & XFS_BLI_STALE));

	/*
	 * The size of the base structure is the size of the
	 * declared structure plus the space for the extra words
	 * of the bitmap.  We subtract one from the map size, because
	 * the first element of the bitmap is accounted for in the
	 * size of the base structure.
	 */
	base_size =
		(uint)(sizeof(xfs_buf_log_format_t) +
		       ((bip->bli_format.blf_map_size - 1) * sizeof(uint)));
253
	vecp->i_addr = &bip->bli_format;
L
Linus Torvalds 已提交
254
	vecp->i_len = base_size;
C
Christoph Hellwig 已提交
255
	vecp->i_type = XLOG_REG_TYPE_BFORMAT;
L
Linus Torvalds 已提交
256 257 258
	vecp++;
	nvecs = 1;

259 260 261 262 263 264 265 266 267
	/*
	 * If it is an inode buffer, transfer the in-memory state to the
	 * format flags and clear the in-memory state. We do not transfer
	 * this state if the inode buffer allocation has not yet been committed
	 * to the log as setting the XFS_BLI_INODE_BUF flag will prevent
	 * correct replay of the inode allocation.
	 */
	if (bip->bli_flags & XFS_BLI_INODE_BUF) {
		if (!((bip->bli_flags & XFS_BLI_INODE_ALLOC_BUF) &&
268
		      xfs_log_item_in_current_chkpt(lip)))
269 270 271 272
			bip->bli_format.blf_flags |= XFS_BLF_INODE_BUF;
		bip->bli_flags &= ~XFS_BLI_INODE_BUF;
	}

L
Linus Torvalds 已提交
273 274 275 276 277 278
	if (bip->bli_flags & XFS_BLI_STALE) {
		/*
		 * The buffer is stale, so all we need to log
		 * is the buf log format structure with the
		 * cancel flag in it.
		 */
C
Christoph Hellwig 已提交
279
		trace_xfs_buf_item_format_stale(bip);
280
		ASSERT(bip->bli_format.blf_flags & XFS_BLF_CANCEL);
L
Linus Torvalds 已提交
281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312
		bip->bli_format.blf_size = nvecs;
		return;
	}

	/*
	 * Fill in an iovec for each set of contiguous chunks.
	 */
	first_bit = xfs_next_bit(bip->bli_format.blf_data_map,
					 bip->bli_format.blf_map_size, 0);
	ASSERT(first_bit != -1);
	last_bit = first_bit;
	nbits = 1;
	for (;;) {
		/*
		 * This takes the bit number to start looking from and
		 * returns the next set bit from there.  It returns -1
		 * if there are no more bits set or the start bit is
		 * beyond the end of the bitmap.
		 */
		next_bit = xfs_next_bit(bip->bli_format.blf_data_map,
						 bip->bli_format.blf_map_size,
						 (uint)last_bit + 1);
		/*
		 * If we run out of bits fill in the last iovec and get
		 * out of the loop.
		 * Else if we start a new set of bits then fill in the
		 * iovec for the series we were looking at and start
		 * counting the bits in the new one.
		 * Else we're still in the same set of bits so just
		 * keep counting and scanning.
		 */
		if (next_bit == -1) {
313
			buffer_offset = first_bit * XFS_BLF_CHUNK;
L
Linus Torvalds 已提交
314
			vecp->i_addr = xfs_buf_offset(bp, buffer_offset);
315
			vecp->i_len = nbits * XFS_BLF_CHUNK;
C
Christoph Hellwig 已提交
316
			vecp->i_type = XLOG_REG_TYPE_BCHUNK;
L
Linus Torvalds 已提交
317 318 319
			nvecs++;
			break;
		} else if (next_bit != last_bit + 1) {
320
			buffer_offset = first_bit * XFS_BLF_CHUNK;
L
Linus Torvalds 已提交
321
			vecp->i_addr = xfs_buf_offset(bp, buffer_offset);
322
			vecp->i_len = nbits * XFS_BLF_CHUNK;
C
Christoph Hellwig 已提交
323
			vecp->i_type = XLOG_REG_TYPE_BCHUNK;
L
Linus Torvalds 已提交
324 325 326 327 328
			nvecs++;
			vecp++;
			first_bit = next_bit;
			last_bit = next_bit;
			nbits = 1;
329 330 331 332
		} else if (xfs_buf_offset(bp, next_bit << XFS_BLF_SHIFT) !=
			   (xfs_buf_offset(bp, last_bit << XFS_BLF_SHIFT) +
			    XFS_BLF_CHUNK)) {
			buffer_offset = first_bit * XFS_BLF_CHUNK;
L
Linus Torvalds 已提交
333
			vecp->i_addr = xfs_buf_offset(bp, buffer_offset);
334
			vecp->i_len = nbits * XFS_BLF_CHUNK;
C
Christoph Hellwig 已提交
335
			vecp->i_type = XLOG_REG_TYPE_BCHUNK;
L
Linus Torvalds 已提交
336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354
/* You would think we need to bump the nvecs here too, but we do not
 * this number is used by recovery, and it gets confused by the boundary
 * split here
 *			nvecs++;
 */
			vecp++;
			first_bit = next_bit;
			last_bit = next_bit;
			nbits = 1;
		} else {
			last_bit++;
			nbits++;
		}
	}
	bip->bli_format.blf_size = nvecs;

	/*
	 * Check to make sure everything is consistent.
	 */
C
Christoph Hellwig 已提交
355
	trace_xfs_buf_item_format(bip);
L
Linus Torvalds 已提交
356 357 358 359
	xfs_buf_item_log_check(bip);
}

/*
360
 * This is called to pin the buffer associated with the buf log item in memory
C
Christoph Hellwig 已提交
361
 * so it cannot be written out.
362 363 364 365 366
 *
 * We also always take a reference to the buffer log item here so that the bli
 * is held while the item is pinned in memory. This means that we can
 * unconditionally drop the reference count a transaction holds when the
 * transaction is completed.
L
Linus Torvalds 已提交
367
 */
368
STATIC void
L
Linus Torvalds 已提交
369
xfs_buf_item_pin(
370
	struct xfs_log_item	*lip)
L
Linus Torvalds 已提交
371
{
372
	struct xfs_buf_log_item	*bip = BUF_ITEM(lip);
L
Linus Torvalds 已提交
373

374
	ASSERT(XFS_BUF_ISBUSY(bip->bli_buf));
L
Linus Torvalds 已提交
375 376 377
	ASSERT(atomic_read(&bip->bli_refcount) > 0);
	ASSERT((bip->bli_flags & XFS_BLI_LOGGED) ||
	       (bip->bli_flags & XFS_BLI_STALE));
378

C
Christoph Hellwig 已提交
379
	trace_xfs_buf_item_pin(bip);
C
Christoph Hellwig 已提交
380 381 382

	atomic_inc(&bip->bli_refcount);
	atomic_inc(&bip->bli_buf->b_pin_count);
L
Linus Torvalds 已提交
383 384 385 386 387 388 389 390 391
}

/*
 * This is called to unpin the buffer associated with the buf log
 * item which was previously pinned with a call to xfs_buf_item_pin().
 *
 * Also drop the reference to the buf item for the current transaction.
 * If the XFS_BLI_STALE flag is set and we are the last reference,
 * then free up the buf log item and unlock the buffer.
392 393 394 395 396
 *
 * If the remove flag is set we are called from uncommit in the
 * forced-shutdown path.  If that is true and the reference count on
 * the log item is going to drop to zero we need to free the item's
 * descriptor in the transaction.
L
Linus Torvalds 已提交
397
 */
398
STATIC void
L
Linus Torvalds 已提交
399
xfs_buf_item_unpin(
400
	struct xfs_log_item	*lip,
401
	int			remove)
L
Linus Torvalds 已提交
402
{
403
	struct xfs_buf_log_item	*bip = BUF_ITEM(lip);
404
	xfs_buf_t	*bp = bip->bli_buf;
405
	struct xfs_ail	*ailp = lip->li_ailp;
406
	int		stale = bip->bli_flags & XFS_BLI_STALE;
407
	int		freed;
L
Linus Torvalds 已提交
408

409
	ASSERT(bp->b_fspriv == bip);
L
Linus Torvalds 已提交
410
	ASSERT(atomic_read(&bip->bli_refcount) > 0);
411

C
Christoph Hellwig 已提交
412
	trace_xfs_buf_item_unpin(bip);
L
Linus Torvalds 已提交
413 414

	freed = atomic_dec_and_test(&bip->bli_refcount);
C
Christoph Hellwig 已提交
415 416 417

	if (atomic_dec_and_test(&bp->b_pin_count))
		wake_up_all(&bp->b_waiters);
418

L
Linus Torvalds 已提交
419 420
	if (freed && stale) {
		ASSERT(bip->bli_flags & XFS_BLI_STALE);
421
		ASSERT(xfs_buf_islocked(bp));
L
Linus Torvalds 已提交
422 423
		ASSERT(!(XFS_BUF_ISDELAYWRITE(bp)));
		ASSERT(XFS_BUF_ISSTALE(bp));
424
		ASSERT(bip->bli_format.blf_flags & XFS_BLF_CANCEL);
425

C
Christoph Hellwig 已提交
426 427
		trace_xfs_buf_item_unpin_stale(bip);

428 429
		if (remove) {
			/*
430 431 432 433 434
			 * If we are in a transaction context, we have to
			 * remove the log item from the transaction as we are
			 * about to release our reference to the buffer.  If we
			 * don't, the unlock that occurs later in
			 * xfs_trans_uncommit() will try to reference the
435 436
			 * buffer which we no longer have a hold on.
			 */
437 438
			if (lip->li_desc)
				xfs_trans_del_item(lip);
439 440 441 442 443

			/*
			 * Since the transaction no longer refers to the buffer,
			 * the buffer should no longer refer to the transaction.
			 */
444
			bp->b_transp = NULL;
445 446
		}

L
Linus Torvalds 已提交
447 448
		/*
		 * If we get called here because of an IO error, we may
449
		 * or may not have the item on the AIL. xfs_trans_ail_delete()
L
Linus Torvalds 已提交
450
		 * will take care of that situation.
451
		 * xfs_trans_ail_delete() drops the AIL lock.
L
Linus Torvalds 已提交
452 453
		 */
		if (bip->bli_flags & XFS_BLI_STALE_INODE) {
454
			xfs_buf_do_callbacks(bp);
455
			bp->b_fspriv = NULL;
456
			bp->b_iodone = NULL;
L
Linus Torvalds 已提交
457
		} else {
458 459
			spin_lock(&ailp->xa_lock);
			xfs_trans_ail_delete(ailp, (xfs_log_item_t *)bip);
L
Linus Torvalds 已提交
460
			xfs_buf_item_relse(bp);
461
			ASSERT(bp->b_fspriv == NULL);
L
Linus Torvalds 已提交
462 463 464 465 466 467 468 469
		}
		xfs_buf_relse(bp);
	}
}

/*
 * This is called to attempt to lock the buffer associated with this
 * buf log item.  Don't sleep on the buffer lock.  If we can't get
470 471 472 473
 * the lock right away, return 0.  If we can get the lock, take a
 * reference to the buffer. If this is a delayed write buffer that
 * needs AIL help to be written back, invoke the pushbuf routine
 * rather than the normal success path.
L
Linus Torvalds 已提交
474
 */
475
STATIC uint
L
Linus Torvalds 已提交
476
xfs_buf_item_trylock(
477
	struct xfs_log_item	*lip)
L
Linus Torvalds 已提交
478
{
479 480
	struct xfs_buf_log_item	*bip = BUF_ITEM(lip);
	struct xfs_buf		*bp = bip->bli_buf;
L
Linus Torvalds 已提交
481

482
	if (XFS_BUF_ISPINNED(bp))
L
Linus Torvalds 已提交
483
		return XFS_ITEM_PINNED;
484
	if (!xfs_buf_trylock(bp))
L
Linus Torvalds 已提交
485 486
		return XFS_ITEM_LOCKED;

487
	/* take a reference to the buffer.  */
L
Linus Torvalds 已提交
488 489 490
	XFS_BUF_HOLD(bp);

	ASSERT(!(bip->bli_flags & XFS_BLI_STALE));
C
Christoph Hellwig 已提交
491
	trace_xfs_buf_item_trylock(bip);
492 493
	if (XFS_BUF_ISDELAYWRITE(bp))
		return XFS_ITEM_PUSHBUF;
L
Linus Torvalds 已提交
494 495 496 497
	return XFS_ITEM_SUCCESS;
}

/*
498 499 500
 * Release the buffer associated with the buf log item.  If there is no dirty
 * logged data associated with the buffer recorded in the buf log item, then
 * free the buf log item and remove the reference to it in the buffer.
L
Linus Torvalds 已提交
501
 *
502 503
 * This call ignores the recursion count.  It is only called when the buffer
 * should REALLY be unlocked, regardless of the recursion count.
L
Linus Torvalds 已提交
504
 *
505 506 507 508 509 510 511 512 513 514
 * We unconditionally drop the transaction's reference to the log item. If the
 * item was logged, then another reference was taken when it was pinned, so we
 * can safely drop the transaction reference now.  This also allows us to avoid
 * potential races with the unpin code freeing the bli by not referencing the
 * bli after we've dropped the reference count.
 *
 * If the XFS_BLI_HOLD flag is set in the buf log item, then free the log item
 * if necessary but do not unlock the buffer.  This is for support of
 * xfs_trans_bhold(). Make sure the XFS_BLI_HOLD field is cleared if we don't
 * free the item.
L
Linus Torvalds 已提交
515
 */
516
STATIC void
L
Linus Torvalds 已提交
517
xfs_buf_item_unlock(
518
	struct xfs_log_item	*lip)
L
Linus Torvalds 已提交
519
{
520 521 522 523
	struct xfs_buf_log_item	*bip = BUF_ITEM(lip);
	struct xfs_buf		*bp = bip->bli_buf;
	int			aborted;
	uint			hold;
L
Linus Torvalds 已提交
524

525
	/* Clear the buffer's association with this transaction. */
526
	bp->b_transp = NULL;
L
Linus Torvalds 已提交
527 528

	/*
529 530 531 532
	 * If this is a transaction abort, don't return early.  Instead, allow
	 * the brelse to happen.  Normally it would be done for stale
	 * (cancelled) buffers at unpin time, but we'll never go through the
	 * pin/unpin cycle if we abort inside commit.
L
Linus Torvalds 已提交
533
	 */
534
	aborted = (lip->li_flags & XFS_LI_ABORTED) != 0;
L
Linus Torvalds 已提交
535 536

	/*
537 538 539 540 541 542 543 544 545 546 547 548
	 * Before possibly freeing the buf item, determine if we should
	 * release the buffer at the end of this routine.
	 */
	hold = bip->bli_flags & XFS_BLI_HOLD;

	/* Clear the per transaction state. */
	bip->bli_flags &= ~(XFS_BLI_LOGGED | XFS_BLI_HOLD);

	/*
	 * If the buf item is marked stale, then don't do anything.  We'll
	 * unlock the buffer and free the buf item when the buffer is unpinned
	 * for the last time.
L
Linus Torvalds 已提交
549 550
	 */
	if (bip->bli_flags & XFS_BLI_STALE) {
C
Christoph Hellwig 已提交
551
		trace_xfs_buf_item_unlock_stale(bip);
552
		ASSERT(bip->bli_format.blf_flags & XFS_BLF_CANCEL);
553 554
		if (!aborted) {
			atomic_dec(&bip->bli_refcount);
L
Linus Torvalds 已提交
555
			return;
556
		}
L
Linus Torvalds 已提交
557 558
	}

C
Christoph Hellwig 已提交
559
	trace_xfs_buf_item_unlock(bip);
L
Linus Torvalds 已提交
560 561

	/*
562 563
	 * If the buf item isn't tracking any data, free it, otherwise drop the
	 * reference we hold to it.
L
Linus Torvalds 已提交
564
	 */
E
Eric Sandeen 已提交
565
	if (xfs_bitmap_empty(bip->bli_format.blf_data_map,
566
			     bip->bli_format.blf_map_size))
L
Linus Torvalds 已提交
567
		xfs_buf_item_relse(bp);
568 569
	else
		atomic_dec(&bip->bli_refcount);
L
Linus Torvalds 已提交
570

571
	if (!hold)
L
Linus Torvalds 已提交
572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592
		xfs_buf_relse(bp);
}

/*
 * This is called to find out where the oldest active copy of the
 * buf log item in the on disk log resides now that the last log
 * write of it completed at the given lsn.
 * We always re-log all the dirty data in a buffer, so usually the
 * latest copy in the on disk log is the only one that matters.  For
 * those cases we simply return the given lsn.
 *
 * The one exception to this is for buffers full of newly allocated
 * inodes.  These buffers are only relogged with the XFS_BLI_INODE_BUF
 * flag set, indicating that only the di_next_unlinked fields from the
 * inodes in the buffers will be replayed during recovery.  If the
 * original newly allocated inode images have not yet been flushed
 * when the buffer is so relogged, then we need to make sure that we
 * keep the old images in the 'active' portion of the log.  We do this
 * by returning the original lsn of that transaction here rather than
 * the current one.
 */
593
STATIC xfs_lsn_t
L
Linus Torvalds 已提交
594
xfs_buf_item_committed(
595
	struct xfs_log_item	*lip,
L
Linus Torvalds 已提交
596 597
	xfs_lsn_t		lsn)
{
598 599
	struct xfs_buf_log_item	*bip = BUF_ITEM(lip);

C
Christoph Hellwig 已提交
600 601
	trace_xfs_buf_item_committed(bip);

602 603 604
	if ((bip->bli_flags & XFS_BLI_INODE_ALLOC_BUF) && lip->li_lsn != 0)
		return lip->li_lsn;
	return lsn;
L
Linus Torvalds 已提交
605 606 607
}

/*
608 609 610
 * The buffer is locked, but is not a delayed write buffer. This happens
 * if we race with IO completion and hence we don't want to try to write it
 * again. Just release the buffer.
L
Linus Torvalds 已提交
611
 */
612
STATIC void
L
Linus Torvalds 已提交
613
xfs_buf_item_push(
614
	struct xfs_log_item	*lip)
L
Linus Torvalds 已提交
615
{
616 617
	struct xfs_buf_log_item	*bip = BUF_ITEM(lip);
	struct xfs_buf		*bp = bip->bli_buf;
L
Linus Torvalds 已提交
618 619

	ASSERT(!(bip->bli_flags & XFS_BLI_STALE));
620 621
	ASSERT(!XFS_BUF_ISDELAYWRITE(bp));

C
Christoph Hellwig 已提交
622
	trace_xfs_buf_item_push(bip);
L
Linus Torvalds 已提交
623

624 625
	xfs_buf_relse(bp);
}
L
Linus Torvalds 已提交
626

627 628 629 630 631 632 633 634
/*
 * The buffer is locked and is a delayed write buffer. Promote the buffer
 * in the delayed write queue as the caller knows that they must invoke
 * the xfsbufd to get this buffer written. We have to unlock the buffer
 * to allow the xfsbufd to write it, too.
 */
STATIC void
xfs_buf_item_pushbuf(
635
	struct xfs_log_item	*lip)
636
{
637 638
	struct xfs_buf_log_item	*bip = BUF_ITEM(lip);
	struct xfs_buf		*bp = bip->bli_buf;
639 640

	ASSERT(!(bip->bli_flags & XFS_BLI_STALE));
641 642
	ASSERT(XFS_BUF_ISDELAYWRITE(bp));

643 644 645 646
	trace_xfs_buf_item_pushbuf(bip);

	xfs_buf_delwri_promote(bp);
	xfs_buf_relse(bp);
L
Linus Torvalds 已提交
647 648
}

649
STATIC void
650 651 652
xfs_buf_item_committing(
	struct xfs_log_item	*lip,
	xfs_lsn_t		commit_lsn)
L
Linus Torvalds 已提交
653 654 655 656 657 658
{
}

/*
 * This is the ops vector shared by all buf log items.
 */
659
static struct xfs_item_ops xfs_buf_item_ops = {
660 661 662 663 664 665 666 667 668 669
	.iop_size	= xfs_buf_item_size,
	.iop_format	= xfs_buf_item_format,
	.iop_pin	= xfs_buf_item_pin,
	.iop_unpin	= xfs_buf_item_unpin,
	.iop_trylock	= xfs_buf_item_trylock,
	.iop_unlock	= xfs_buf_item_unlock,
	.iop_committed	= xfs_buf_item_committed,
	.iop_push	= xfs_buf_item_push,
	.iop_pushbuf	= xfs_buf_item_pushbuf,
	.iop_committing = xfs_buf_item_committing
L
Linus Torvalds 已提交
670 671 672 673 674 675 676 677 678 679 680 681 682 683 684
};


/*
 * Allocate a new buf log item to go with the given buffer.
 * Set the buffer's b_fsprivate field to point to the new
 * buf log item.  If there are other item's attached to the
 * buffer (see xfs_buf_attach_iodone() below), then put the
 * buf log item at the front.
 */
void
xfs_buf_item_init(
	xfs_buf_t	*bp,
	xfs_mount_t	*mp)
{
685
	xfs_log_item_t		*lip = bp->b_fspriv;
L
Linus Torvalds 已提交
686 687 688 689 690 691 692 693 694 695
	xfs_buf_log_item_t	*bip;
	int			chunks;
	int			map_size;

	/*
	 * Check to see if there is already a buf log item for
	 * this buffer.  If there is, it is guaranteed to be
	 * the first.  If we do already have one, there is
	 * nothing to do here so return.
	 */
696
	ASSERT(bp->b_target->bt_mount == mp);
697 698
	if (lip != NULL && lip->li_type == XFS_LI_BUF)
		return;
L
Linus Torvalds 已提交
699 700

	/*
701
	 * chunks is the number of XFS_BLF_CHUNK size pieces
L
Linus Torvalds 已提交
702 703 704 705
	 * the buffer can be divided into. Make sure not to
	 * truncate any pieces.  map_size is the size of the
	 * bitmap needed to describe the chunks of the buffer.
	 */
706
	chunks = (int)((XFS_BUF_COUNT(bp) + (XFS_BLF_CHUNK - 1)) >> XFS_BLF_SHIFT);
L
Linus Torvalds 已提交
707 708 709 710
	map_size = (int)((chunks + NBWORD) >> BIT_TO_WORD_SHIFT);

	bip = (xfs_buf_log_item_t*)kmem_zone_zalloc(xfs_buf_item_zone,
						    KM_SLEEP);
711
	xfs_log_item_init(mp, &bip->bli_item, XFS_LI_BUF, &xfs_buf_item_ops);
L
Linus Torvalds 已提交
712
	bip->bli_buf = bp;
713
	xfs_buf_hold(bp);
L
Linus Torvalds 已提交
714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736
	bip->bli_format.blf_type = XFS_LI_BUF;
	bip->bli_format.blf_blkno = (__int64_t)XFS_BUF_ADDR(bp);
	bip->bli_format.blf_len = (ushort)BTOBB(XFS_BUF_COUNT(bp));
	bip->bli_format.blf_map_size = map_size;

#ifdef XFS_TRANS_DEBUG
	/*
	 * Allocate the arrays for tracking what needs to be logged
	 * and what our callers request to be logged.  bli_orig
	 * holds a copy of the original, clean buffer for comparison
	 * against, and bli_logged keeps a 1 bit flag per byte in
	 * the buffer to indicate which bytes the callers have asked
	 * to have logged.
	 */
	bip->bli_orig = (char *)kmem_alloc(XFS_BUF_COUNT(bp), KM_SLEEP);
	memcpy(bip->bli_orig, XFS_BUF_PTR(bp), XFS_BUF_COUNT(bp));
	bip->bli_logged = (char *)kmem_zalloc(XFS_BUF_COUNT(bp) / NBBY, KM_SLEEP);
#endif

	/*
	 * Put the buf item into the list of items attached to the
	 * buffer at the front.
	 */
737 738 739
	if (bp->b_fspriv)
		bip->bli_item.li_bio_list = bp->b_fspriv;
	bp->b_fspriv = bip;
L
Linus Torvalds 已提交
740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771
}


/*
 * Mark bytes first through last inclusive as dirty in the buf
 * item's bitmap.
 */
void
xfs_buf_item_log(
	xfs_buf_log_item_t	*bip,
	uint			first,
	uint			last)
{
	uint		first_bit;
	uint		last_bit;
	uint		bits_to_set;
	uint		bits_set;
	uint		word_num;
	uint		*wordp;
	uint		bit;
	uint		end_bit;
	uint		mask;

	/*
	 * Mark the item as having some dirty data for
	 * quick reference in xfs_buf_item_dirty.
	 */
	bip->bli_flags |= XFS_BLI_DIRTY;

	/*
	 * Convert byte offsets to bit numbers.
	 */
772 773
	first_bit = first >> XFS_BLF_SHIFT;
	last_bit = last >> XFS_BLF_SHIFT;
L
Linus Torvalds 已提交
774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843

	/*
	 * Calculate the total number of bits to be set.
	 */
	bits_to_set = last_bit - first_bit + 1;

	/*
	 * Get a pointer to the first word in the bitmap
	 * to set a bit in.
	 */
	word_num = first_bit >> BIT_TO_WORD_SHIFT;
	wordp = &(bip->bli_format.blf_data_map[word_num]);

	/*
	 * Calculate the starting bit in the first word.
	 */
	bit = first_bit & (uint)(NBWORD - 1);

	/*
	 * First set any bits in the first word of our range.
	 * If it starts at bit 0 of the word, it will be
	 * set below rather than here.  That is what the variable
	 * bit tells us. The variable bits_set tracks the number
	 * of bits that have been set so far.  End_bit is the number
	 * of the last bit to be set in this word plus one.
	 */
	if (bit) {
		end_bit = MIN(bit + bits_to_set, (uint)NBWORD);
		mask = ((1 << (end_bit - bit)) - 1) << bit;
		*wordp |= mask;
		wordp++;
		bits_set = end_bit - bit;
	} else {
		bits_set = 0;
	}

	/*
	 * Now set bits a whole word at a time that are between
	 * first_bit and last_bit.
	 */
	while ((bits_to_set - bits_set) >= NBWORD) {
		*wordp |= 0xffffffff;
		bits_set += NBWORD;
		wordp++;
	}

	/*
	 * Finally, set any bits left to be set in one last partial word.
	 */
	end_bit = bits_to_set - bits_set;
	if (end_bit) {
		mask = (1 << end_bit) - 1;
		*wordp |= mask;
	}

	xfs_buf_item_log_debug(bip, first, last);
}


/*
 * Return 1 if the buffer has some data that has been logged (at any
 * point, not just the current transaction) and 0 if not.
 */
uint
xfs_buf_item_dirty(
	xfs_buf_log_item_t	*bip)
{
	return (bip->bli_flags & XFS_BLI_DIRTY);
}

844 845 846 847 848 849 850 851 852 853 854 855
STATIC void
xfs_buf_item_free(
	xfs_buf_log_item_t	*bip)
{
#ifdef XFS_TRANS_DEBUG
	kmem_free(bip->bli_orig);
	kmem_free(bip->bli_logged);
#endif /* XFS_TRANS_DEBUG */

	kmem_zone_free(xfs_buf_item_zone, bip);
}

L
Linus Torvalds 已提交
856 857 858 859 860 861 862 863 864 865 866 867 868
/*
 * This is called when the buf log item is no longer needed.  It should
 * free the buf log item associated with the given buffer and clear
 * the buffer's pointer to the buf log item.  If there are no more
 * items in the list, clear the b_iodone field of the buffer (see
 * xfs_buf_attach_iodone() below).
 */
void
xfs_buf_item_relse(
	xfs_buf_t	*bp)
{
	xfs_buf_log_item_t	*bip;

C
Christoph Hellwig 已提交
869 870
	trace_xfs_buf_item_relse(bp, _RET_IP_);

871 872
	bip = bp->b_fspriv;
	bp->b_fspriv = bip->bli_item.li_bio_list;
873 874
	if (bp->b_fspriv == NULL)
		bp->b_iodone = NULL;
875

876 877
	xfs_buf_rele(bp);
	xfs_buf_item_free(bip);
L
Linus Torvalds 已提交
878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898
}


/*
 * Add the given log item with its callback to the list of callbacks
 * to be called when the buffer's I/O completes.  If it is not set
 * already, set the buffer's b_iodone() routine to be
 * xfs_buf_iodone_callbacks() and link the log item into the list of
 * items rooted at b_fsprivate.  Items are always added as the second
 * entry in the list if there is a first, because the buf item code
 * assumes that the buf log item is first.
 */
void
xfs_buf_attach_iodone(
	xfs_buf_t	*bp,
	void		(*cb)(xfs_buf_t *, xfs_log_item_t *),
	xfs_log_item_t	*lip)
{
	xfs_log_item_t	*head_lip;

	ASSERT(XFS_BUF_ISBUSY(bp));
899
	ASSERT(xfs_buf_islocked(bp));
L
Linus Torvalds 已提交
900 901

	lip->li_cb = cb;
902 903
	head_lip = bp->b_fspriv;
	if (head_lip) {
L
Linus Torvalds 已提交
904 905 906
		lip->li_bio_list = head_lip->li_bio_list;
		head_lip->li_bio_list = lip;
	} else {
907
		bp->b_fspriv = lip;
L
Linus Torvalds 已提交
908 909
	}

910 911 912
	ASSERT(bp->b_iodone == NULL ||
	       bp->b_iodone == xfs_buf_iodone_callbacks);
	bp->b_iodone = xfs_buf_iodone_callbacks;
L
Linus Torvalds 已提交
913 914
}

915 916 917 918 919 920 921 922 923 924 925 926
/*
 * We can have many callbacks on a buffer. Running the callbacks individually
 * can cause a lot of contention on the AIL lock, so we allow for a single
 * callback to be able to scan the remaining lip->li_bio_list for other items
 * of the same type and callback to be processed in the first call.
 *
 * As a result, the loop walking the callback list below will also modify the
 * list. it removes the first item from the list and then runs the callback.
 * The loop then restarts from the new head of the list. This allows the
 * callback to scan and modify the list attached to the buffer and we don't
 * have to care about maintaining a next item pointer.
 */
L
Linus Torvalds 已提交
927 928
STATIC void
xfs_buf_do_callbacks(
929
	struct xfs_buf		*bp)
L
Linus Torvalds 已提交
930
{
931
	struct xfs_log_item	*lip;
L
Linus Torvalds 已提交
932

933 934
	while ((lip = bp->b_fspriv) != NULL) {
		bp->b_fspriv = lip->li_bio_list;
L
Linus Torvalds 已提交
935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955
		ASSERT(lip->li_cb != NULL);
		/*
		 * Clear the next pointer so we don't have any
		 * confusion if the item is added to another buf.
		 * Don't touch the log item after calling its
		 * callback, because it could have freed itself.
		 */
		lip->li_bio_list = NULL;
		lip->li_cb(bp, lip);
	}
}

/*
 * This is the iodone() function for buffers which have had callbacks
 * attached to them by xfs_buf_attach_iodone().  It should remove each
 * log item from the buffer's list and call the callback of each in turn.
 * When done, the buffer's fsprivate field is set to NULL and the buffer
 * is unlocked with a call to iodone().
 */
void
xfs_buf_iodone_callbacks(
956
	struct xfs_buf		*bp)
L
Linus Torvalds 已提交
957
{
958 959 960 961
	struct xfs_log_item	*lip = bp->b_fspriv;
	struct xfs_mount	*mp = lip->li_mountp;
	static ulong		lasttime;
	static xfs_buftarg_t	*lasttarg;
L
Linus Torvalds 已提交
962

963 964
	if (likely(!XFS_BUF_GETERROR(bp)))
		goto do_callbacks;
L
Linus Torvalds 已提交
965

966 967 968 969 970 971 972 973 974
	/*
	 * If we've already decided to shutdown the filesystem because of
	 * I/O errors, there's no point in giving this a retry.
	 */
	if (XFS_FORCED_SHUTDOWN(mp)) {
		XFS_BUF_SUPER_STALE(bp);
		trace_xfs_buf_item_iodone(bp, _RET_IP_);
		goto do_callbacks;
	}
L
Linus Torvalds 已提交
975

976 977 978
	if (XFS_BUF_TARGET(bp) != lasttarg ||
	    time_after(jiffies, (lasttime + 5*HZ))) {
		lasttime = jiffies;
979
		xfs_alert(mp, "Device %s: metadata write error block 0x%llx",
980
			XFS_BUFTARG_NAME(XFS_BUF_TARGET(bp)),
981
		      (__uint64_t)XFS_BUF_ADDR(bp));
982 983
	}
	lasttarg = XFS_BUF_TARGET(bp);
L
Linus Torvalds 已提交
984

985
	/*
L
Lucas De Marchi 已提交
986
	 * If the write was asynchronous then no one will be looking for the
987 988 989 990 991 992 993 994 995 996 997
	 * error.  Clear the error state and write the buffer out again.
	 *
	 * During sync or umount we'll write all pending buffers again
	 * synchronous, which will catch these errors if they keep hanging
	 * around.
	 */
	if (XFS_BUF_ISASYNC(bp)) {
		XFS_BUF_ERROR(bp, 0); /* errno of 0 unsets the flag */

		if (!XFS_BUF_ISSTALE(bp)) {
			XFS_BUF_DELAYWRITE(bp);
L
Linus Torvalds 已提交
998
			XFS_BUF_DONE(bp);
999
			XFS_BUF_SET_START(bp);
L
Linus Torvalds 已提交
1000
		}
1001
		ASSERT(bp->b_iodone != NULL);
1002 1003
		trace_xfs_buf_item_iodone_async(bp, _RET_IP_);
		xfs_buf_relse(bp);
L
Linus Torvalds 已提交
1004 1005
		return;
	}
C
Christoph Hellwig 已提交
1006

1007 1008 1009 1010
	/*
	 * If the write of the buffer was synchronous, we want to make
	 * sure to return the error to the caller of xfs_bwrite().
	 */
L
Linus Torvalds 已提交
1011 1012 1013
	XFS_BUF_STALE(bp);
	XFS_BUF_DONE(bp);
	XFS_BUF_UNDELAYWRITE(bp);
C
Christoph Hellwig 已提交
1014 1015

	trace_xfs_buf_error_relse(bp, _RET_IP_);
1016
	xfs_force_shutdown(mp, SHUTDOWN_META_IO_ERROR);
C
Christoph Hellwig 已提交
1017

1018
do_callbacks:
1019
	xfs_buf_do_callbacks(bp);
1020
	bp->b_fspriv = NULL;
1021
	bp->b_iodone = NULL;
1022
	xfs_buf_ioend(bp, 0);
L
Linus Torvalds 已提交
1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033
}

/*
 * This is the iodone() function for buffers which have been
 * logged.  It is called when they are eventually flushed out.
 * It should remove the buf item from the AIL, and free the buf item.
 * It is called by xfs_buf_iodone_callbacks() above which will take
 * care of cleaning up the buffer itself.
 */
void
xfs_buf_iodone(
1034 1035
	struct xfs_buf		*bp,
	struct xfs_log_item	*lip)
L
Linus Torvalds 已提交
1036
{
1037
	struct xfs_ail		*ailp = lip->li_ailp;
L
Linus Torvalds 已提交
1038

1039
	ASSERT(BUF_ITEM(lip)->bli_buf == bp);
L
Linus Torvalds 已提交
1040

1041
	xfs_buf_rele(bp);
L
Linus Torvalds 已提交
1042 1043 1044 1045 1046 1047

	/*
	 * If we are forcibly shutting down, this may well be
	 * off the AIL already. That's because we simulate the
	 * log-committed callbacks to unpin these buffers. Or we may never
	 * have put this item on AIL because of the transaction was
1048
	 * aborted forcibly. xfs_trans_ail_delete() takes care of these.
L
Linus Torvalds 已提交
1049 1050 1051
	 *
	 * Either way, AIL is useless if we're forcing a shutdown.
	 */
1052
	spin_lock(&ailp->xa_lock);
1053 1054
	xfs_trans_ail_delete(ailp, lip);
	xfs_buf_item_free(BUF_ITEM(lip));
L
Linus Torvalds 已提交
1055
}