checkpoint.c 21.1 KB
Newer Older
1
/*
2
 * linux/fs/jbd2/checkpoint.c
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
 *
 * Written by Stephen C. Tweedie <sct@redhat.com>, 1999
 *
 * Copyright 1999 Red Hat Software --- All Rights Reserved
 *
 * This file is part of the Linux kernel and is made available under
 * the terms of the GNU General Public License, version 2, or at your
 * option, any later version, incorporated herein by reference.
 *
 * Checkpoint routines for the generic filesystem journaling code.
 * Part of the ext2fs journaling system.
 *
 * Checkpointing is the process of ensuring that a section of the log is
 * committed fully to disk, so that that portion of the log can be
 * reused.
 */

#include <linux/time.h>
#include <linux/fs.h>
22
#include <linux/jbd2.h>
23 24
#include <linux/errno.h>
#include <linux/slab.h>
25
#include <linux/blkdev.h>
26
#include <trace/events/jbd2.h>
27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 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 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97

/*
 * Unlink a buffer from a transaction checkpoint list.
 *
 * Called with j_list_lock held.
 */
static inline void __buffer_unlink_first(struct journal_head *jh)
{
	transaction_t *transaction = jh->b_cp_transaction;

	jh->b_cpnext->b_cpprev = jh->b_cpprev;
	jh->b_cpprev->b_cpnext = jh->b_cpnext;
	if (transaction->t_checkpoint_list == jh) {
		transaction->t_checkpoint_list = jh->b_cpnext;
		if (transaction->t_checkpoint_list == jh)
			transaction->t_checkpoint_list = NULL;
	}
}

/*
 * Unlink a buffer from a transaction checkpoint(io) list.
 *
 * Called with j_list_lock held.
 */
static inline void __buffer_unlink(struct journal_head *jh)
{
	transaction_t *transaction = jh->b_cp_transaction;

	__buffer_unlink_first(jh);
	if (transaction->t_checkpoint_io_list == jh) {
		transaction->t_checkpoint_io_list = jh->b_cpnext;
		if (transaction->t_checkpoint_io_list == jh)
			transaction->t_checkpoint_io_list = NULL;
	}
}

/*
 * Move a buffer from the checkpoint list to the checkpoint io list
 *
 * Called with j_list_lock held
 */
static inline void __buffer_relink_io(struct journal_head *jh)
{
	transaction_t *transaction = jh->b_cp_transaction;

	__buffer_unlink_first(jh);

	if (!transaction->t_checkpoint_io_list) {
		jh->b_cpnext = jh->b_cpprev = jh;
	} else {
		jh->b_cpnext = transaction->t_checkpoint_io_list;
		jh->b_cpprev = transaction->t_checkpoint_io_list->b_cpprev;
		jh->b_cpprev->b_cpnext = jh;
		jh->b_cpnext->b_cpprev = jh;
	}
	transaction->t_checkpoint_io_list = jh;
}

/*
 * Try to release a checkpointed buffer from its transaction.
 * Returns 1 if we released it and 2 if we also released the
 * whole transaction.
 *
 * Requires j_list_lock
 * Called under jbd_lock_bh_state(jh2bh(jh)), and drops it
 */
static int __try_to_free_cp_buf(struct journal_head *jh)
{
	int ret = 0;
	struct buffer_head *bh = jh2bh(jh);

98 99
	if (jh->b_jlist == BJ_None && !buffer_locked(bh) &&
	    !buffer_dirty(bh) && !buffer_write_io_error(bh)) {
100 101 102 103 104
		/*
		 * Get our reference so that bh cannot be freed before
		 * we unlock it
		 */
		get_bh(bh);
105
		JBUFFER_TRACE(jh, "remove from checkpoint list");
106
		ret = __jbd2_journal_remove_checkpoint(jh) + 1;
107 108 109 110 111 112 113 114 115 116
		jbd_unlock_bh_state(bh);
		BUFFER_TRACE(bh, "release");
		__brelse(bh);
	} else {
		jbd_unlock_bh_state(bh);
	}
	return ret;
}

/*
117
 * __jbd2_log_wait_for_space: wait until there is space in the journal.
118 119 120 121
 *
 * Called under j-state_lock *only*.  It will be unlocked if we have to wait
 * for a checkpoint to free up some space in the log.
 */
122
void __jbd2_log_wait_for_space(journal_t *journal)
123
{
124
	int nblocks, space_left;
125
	/* assert_spin_locked(&journal->j_state_lock); */
126 127

	nblocks = jbd_space_needed(journal);
128 129
	while (__jbd2_log_space_left(journal) < nblocks) {
		if (journal->j_flags & JBD2_ABORT)
130
			return;
131
		write_unlock(&journal->j_state_lock);
132 133 134 135
		mutex_lock(&journal->j_checkpoint_mutex);

		/*
		 * Test again, another process may have checkpointed while we
136
		 * were waiting for the checkpoint lock. If there are no
137 138 139 140 141 142 143
		 * transactions ready to be checkpointed, try to recover
		 * journal space by calling cleanup_journal_tail(), and if
		 * that doesn't work, by waiting for the currently committing
		 * transaction to complete.  If there is absolutely no way
		 * to make progress, this is either a BUG or corrupted
		 * filesystem, so abort the journal and leave a stack
		 * trace for forensic evidence.
144
		 */
145
		write_lock(&journal->j_state_lock);
146
		spin_lock(&journal->j_list_lock);
147
		nblocks = jbd_space_needed(journal);
148 149
		space_left = __jbd2_log_space_left(journal);
		if (space_left < nblocks) {
150
			int chkpt = journal->j_checkpoint_transactions != NULL;
151
			tid_t tid = 0;
152

153 154
			if (journal->j_committing_transaction)
				tid = journal->j_committing_transaction->t_tid;
155
			spin_unlock(&journal->j_list_lock);
156
			write_unlock(&journal->j_state_lock);
157 158
			if (chkpt) {
				jbd2_log_do_checkpoint(journal);
159 160 161 162 163
			} else if (jbd2_cleanup_journal_tail(journal) == 0) {
				/* We were able to recover space; yay! */
				;
			} else if (tid) {
				jbd2_log_wait_commit(journal, tid);
164
			} else {
165 166 167 168 169 170 171
				printk(KERN_ERR "%s: needed %d blocks and "
				       "only had %d space available\n",
				       __func__, nblocks, space_left);
				printk(KERN_ERR "%s: no way to get more "
				       "journal space in %s\n", __func__,
				       journal->j_devname);
				WARN_ON(1);
172 173
				jbd2_journal_abort(journal, 0);
			}
174
			write_lock(&journal->j_state_lock);
175 176
		} else {
			spin_unlock(&journal->j_list_lock);
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
		}
		mutex_unlock(&journal->j_checkpoint_mutex);
	}
}

/*
 * We were unable to perform jbd_trylock_bh_state() inside j_list_lock.
 * The caller must restart a list walk.  Wait for someone else to run
 * jbd_unlock_bh_state().
 */
static void jbd_sync_bh(journal_t *journal, struct buffer_head *bh)
	__releases(journal->j_list_lock)
{
	get_bh(bh);
	spin_unlock(&journal->j_list_lock);
	jbd_lock_bh_state(bh);
	jbd_unlock_bh_state(bh);
	put_bh(bh);
}

/*
 * Clean up transaction's list of buffers submitted for io.
 * We wait for any pending IO to complete and remove any clean
 * buffers. Note that we take the buffers in the opposite ordering
 * from the one in which they were submitted for IO.
 *
203 204 205
 * Return 0 on success, and return <0 if some buffers have failed
 * to be written out.
 *
206 207
 * Called with j_list_lock held.
 */
208
static int __wait_cp_io(journal_t *journal, transaction_t *transaction)
209 210 211 212 213
{
	struct journal_head *jh;
	struct buffer_head *bh;
	tid_t this_tid;
	int released = 0;
214
	int ret = 0;
215 216 217 218 219 220

	this_tid = transaction->t_tid;
restart:
	/* Did somebody clean up the transaction in the meanwhile? */
	if (journal->j_checkpoint_transactions != transaction ||
			transaction->t_tid != this_tid)
221
		return ret;
222 223 224 225 226 227 228 229
	while (!released && transaction->t_checkpoint_io_list) {
		jh = transaction->t_checkpoint_io_list;
		bh = jh2bh(jh);
		if (!jbd_trylock_bh_state(bh)) {
			jbd_sync_bh(journal, bh);
			spin_lock(&journal->j_list_lock);
			goto restart;
		}
230
		get_bh(bh);
231 232 233 234 235 236 237 238 239 240
		if (buffer_locked(bh)) {
			spin_unlock(&journal->j_list_lock);
			jbd_unlock_bh_state(bh);
			wait_on_buffer(bh);
			/* the journal_head may have gone by now */
			BUFFER_TRACE(bh, "brelse");
			__brelse(bh);
			spin_lock(&journal->j_list_lock);
			goto restart;
		}
241 242 243
		if (unlikely(buffer_write_io_error(bh)))
			ret = -EIO;

244 245 246 247
		/*
		 * Now in whatever state the buffer currently is, we know that
		 * it has been written out and so we can drop it from the list
		 */
248
		released = __jbd2_journal_remove_checkpoint(jh);
249 250 251
		jbd_unlock_bh_state(bh);
		__brelse(bh);
	}
252 253

	return ret;
254 255 256
}

static void
257
__flush_batch(journal_t *journal, int *batch_count)
258 259
{
	int i;
260
	struct blk_plug plug;
261

262
	blk_start_plug(&plug);
C
Christoph Hellwig 已提交
263
	for (i = 0; i < *batch_count; i++)
264 265
		write_dirty_buffer(journal->j_chkpt_bhs[i], WRITE_SYNC);
	blk_finish_plug(&plug);
C
Christoph Hellwig 已提交
266

267
	for (i = 0; i < *batch_count; i++) {
268
		struct buffer_head *bh = journal->j_chkpt_bhs[i];
269 270 271 272 273 274 275 276 277 278
		BUFFER_TRACE(bh, "brelse");
		__brelse(bh);
	}
	*batch_count = 0;
}

/*
 * Try to flush one buffer from the checkpoint list to disk.
 *
 * Return 1 if something happened which requires us to abort the current
279 280
 * scan of the checkpoint list.  Return <0 if the buffer has failed to
 * be written out.
281 282 283 284 285
 *
 * Called with j_list_lock held and drops it if 1 is returned
 * Called under jbd_lock_bh_state(jh2bh(jh)), and drops it
 */
static int __process_buffer(journal_t *journal, struct journal_head *jh,
286
			    int *batch_count, transaction_t *transaction)
287 288 289 290 291
{
	struct buffer_head *bh = jh2bh(jh);
	int ret = 0;

	if (buffer_locked(bh)) {
292
		get_bh(bh);
293 294 295 296 297 298 299 300 301 302 303
		spin_unlock(&journal->j_list_lock);
		jbd_unlock_bh_state(bh);
		wait_on_buffer(bh);
		/* the journal_head may have gone by now */
		BUFFER_TRACE(bh, "brelse");
		__brelse(bh);
		ret = 1;
	} else if (jh->b_transaction != NULL) {
		transaction_t *t = jh->b_transaction;
		tid_t tid = t->t_tid;

304
		transaction->t_chp_stats.cs_forced_to_close++;
305 306
		spin_unlock(&journal->j_list_lock);
		jbd_unlock_bh_state(bh);
307 308 309 310 311 312 313 314 315 316
		if (unlikely(journal->j_flags & JBD2_UNMOUNT))
			/*
			 * The journal thread is dead; so starting and
			 * waiting for a commit to finish will cause
			 * us to wait for a _very_ long time.
			 */
			printk(KERN_ERR "JBD2: %s: "
			       "Waiting for Godot: block %llu\n",
			       journal->j_devname,
			       (unsigned long long) bh->b_blocknr);
317 318
		jbd2_log_start_commit(journal, tid);
		jbd2_log_wait_commit(journal, tid);
319 320
		ret = 1;
	} else if (!buffer_dirty(bh)) {
321 322 323
		ret = 1;
		if (unlikely(buffer_write_io_error(bh)))
			ret = -EIO;
324
		get_bh(bh);
325 326
		J_ASSERT_JH(jh, !buffer_jbddirty(bh));
		BUFFER_TRACE(bh, "remove from checkpoint");
327
		__jbd2_journal_remove_checkpoint(jh);
328 329 330 331 332 333 334 335 336 337 338 339 340 341
		spin_unlock(&journal->j_list_lock);
		jbd_unlock_bh_state(bh);
		__brelse(bh);
	} else {
		/*
		 * Important: we are about to write the buffer, and
		 * possibly block, while still holding the journal lock.
		 * We cannot afford to let the transaction logic start
		 * messing around with this buffer before we write it to
		 * disk, as that would break recoverability.
		 */
		BUFFER_TRACE(bh, "queue");
		get_bh(bh);
		J_ASSERT_BH(bh, !buffer_jwrite(bh));
342
		journal->j_chkpt_bhs[*batch_count] = bh;
343 344
		__buffer_relink_io(jh);
		jbd_unlock_bh_state(bh);
345
		transaction->t_chp_stats.cs_written++;
346
		(*batch_count)++;
347
		if (*batch_count == JBD2_NR_BATCH) {
348
			spin_unlock(&journal->j_list_lock);
349
			__flush_batch(journal, batch_count);
350 351 352 353 354 355 356 357 358 359 360 361
			ret = 1;
		}
	}
	return ret;
}

/*
 * Perform an actual checkpoint. We take the first transaction on the
 * list of transactions to be checkpointed and send all its buffers
 * to disk. We submit larger chunks of data at once.
 *
 * The journal should be locked before calling this function.
362
 * Called with j_checkpoint_mutex held.
363
 */
364
int jbd2_log_do_checkpoint(journal_t *journal)
365 366 367 368 369 370 371 372 373 374 375 376
{
	transaction_t *transaction;
	tid_t this_tid;
	int result;

	jbd_debug(1, "Start checkpoint\n");

	/*
	 * First thing: if there are any transactions in the log which
	 * don't need checkpointing, just eliminate them from the
	 * journal straight away.
	 */
377
	result = jbd2_cleanup_journal_tail(journal);
378
	trace_jbd2_checkpoint(journal, result);
379 380 381 382 383 384 385 386
	jbd_debug(1, "cleanup_journal_tail returned %d\n", result);
	if (result <= 0)
		return result;

	/*
	 * OK, we need to start writing disk blocks.  Take one transaction
	 * and write it.
	 */
387
	result = 0;
388 389 390 391
	spin_lock(&journal->j_list_lock);
	if (!journal->j_checkpoint_transactions)
		goto out;
	transaction = journal->j_checkpoint_transactions;
392 393
	if (transaction->t_chp_stats.cs_chp_time == 0)
		transaction->t_chp_stats.cs_chp_time = jiffies;
394 395 396 397 398 399 400 401 402 403 404
	this_tid = transaction->t_tid;
restart:
	/*
	 * If someone cleaned up this transaction while we slept, we're
	 * done (maybe it's a new transaction, but it fell at the same
	 * address).
	 */
	if (journal->j_checkpoint_transactions == transaction &&
			transaction->t_tid == this_tid) {
		int batch_count = 0;
		struct journal_head *jh;
405
		int retry = 0, err;
406 407 408 409 410 411 412 413 414 415 416

		while (!retry && transaction->t_checkpoint_list) {
			struct buffer_head *bh;

			jh = transaction->t_checkpoint_list;
			bh = jh2bh(jh);
			if (!jbd_trylock_bh_state(bh)) {
				jbd_sync_bh(journal, bh);
				retry = 1;
				break;
			}
417
			retry = __process_buffer(journal, jh, &batch_count,
418
						 transaction);
419 420
			if (retry < 0 && !result)
				result = retry;
N
Nick Piggin 已提交
421 422
			if (!retry && (need_resched() ||
				spin_needbreak(&journal->j_list_lock))) {
423 424 425 426 427 428 429 430 431 432 433
				spin_unlock(&journal->j_list_lock);
				retry = 1;
				break;
			}
		}

		if (batch_count) {
			if (!retry) {
				spin_unlock(&journal->j_list_lock);
				retry = 1;
			}
434
			__flush_batch(journal, &batch_count);
435 436 437 438 439 440 441 442 443 444
		}

		if (retry) {
			spin_lock(&journal->j_list_lock);
			goto restart;
		}
		/*
		 * Now we have cleaned up the first transaction's checkpoint
		 * list. Let's clean up the second one
		 */
445 446 447
		err = __wait_cp_io(journal, transaction);
		if (!result)
			result = err;
448 449 450 451
	}
out:
	spin_unlock(&journal->j_list_lock);
	if (result < 0)
452 453 454 455 456
		jbd2_journal_abort(journal, result);
	else
		result = jbd2_cleanup_journal_tail(journal);

	return (result < 0) ? result : 0;
457 458 459 460 461 462 463 464 465 466 467 468 469 470 471
}

/*
 * Check the list of checkpoint transactions for the journal to see if
 * we have already got rid of any since the last update of the log tail
 * in the journal superblock.  If so, we can instantly roll the
 * superblock forward to remove those transactions from the log.
 *
 * Return <0 on error, 0 on success, 1 if there was nothing to clean up.
 *
 * Called with the journal lock held.
 *
 * This is the only part of the journaling code which really needs to be
 * aware of transaction aborts.  Checkpointing involves writing to the
 * main filesystem area rather than to the journal, so it can proceed
472 473 474
 * even in abort state, but we must not update the super block if
 * checkpointing may have failed.  Otherwise, we would lose some metadata
 * buffers which should be written-back to the filesystem.
475 476
 */

477
int jbd2_cleanup_journal_tail(journal_t *journal)
478 479
{
	tid_t		first_tid;
480
	unsigned long	blocknr;
481

482 483 484
	if (is_journal_aborted(journal))
		return 1;

485
	if (!jbd2_journal_get_log_tail(journal, &first_tid, &blocknr))
486
		return 1;
487
	J_ASSERT(blocknr != 0);
488 489

	/*
490 491 492 493 494 495
	 * We need to make sure that any blocks that were recently written out
	 * --- perhaps by jbd2_log_do_checkpoint() --- are flushed out before
	 * we drop the transactions from the journal. It's unlikely this will
	 * be necessary, especially with an appropriately sized journal, but we
	 * need this to guarantee correctness.  Fortunately
	 * jbd2_cleanup_journal_tail() doesn't get called all that often.
496
	 */
497
	if (journal->j_flags & JBD2_BARRIER)
498
		blkdev_issue_flush(journal->j_fs_dev, GFP_KERNEL, NULL);
499 500

	__jbd2_update_log_tail(journal, first_tid, blocknr);
501 502 503 504 505 506 507 508 509
	return 0;
}


/* Checkpoint list management */

/*
 * journal_clean_one_cp_list
 *
510 511
 * Find all the written-back checkpoint buffers in the given list and
 * release them.
512 513 514
 *
 * Called with the journal locked.
 * Called with j_list_lock held.
515
 * Returns number of buffers reaped (for debug)
516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565
 */

static int journal_clean_one_cp_list(struct journal_head *jh, int *released)
{
	struct journal_head *last_jh;
	struct journal_head *next_jh = jh;
	int ret, freed = 0;

	*released = 0;
	if (!jh)
		return 0;

	last_jh = jh->b_cpprev;
	do {
		jh = next_jh;
		next_jh = jh->b_cpnext;
		/* Use trylock because of the ranking */
		if (jbd_trylock_bh_state(jh2bh(jh))) {
			ret = __try_to_free_cp_buf(jh);
			if (ret) {
				freed++;
				if (ret == 2) {
					*released = 1;
					return freed;
				}
			}
		}
		/*
		 * This function only frees up some memory
		 * if possible so we dont have an obligation
		 * to finish processing. Bail out if preemption
		 * requested:
		 */
		if (need_resched())
			return freed;
	} while (jh != last_jh);

	return freed;
}

/*
 * journal_clean_checkpoint_list
 *
 * Find all the written-back checkpoint buffers in the journal and release them.
 *
 * Called with the journal locked.
 * Called with j_list_lock held.
 * Returns number of buffers reaped (for debug)
 */

566
int __jbd2_journal_clean_checkpoint_list(journal_t *journal)
567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619
{
	transaction_t *transaction, *last_transaction, *next_transaction;
	int ret = 0;
	int released;

	transaction = journal->j_checkpoint_transactions;
	if (!transaction)
		goto out;

	last_transaction = transaction->t_cpprev;
	next_transaction = transaction;
	do {
		transaction = next_transaction;
		next_transaction = transaction->t_cpnext;
		ret += journal_clean_one_cp_list(transaction->
				t_checkpoint_list, &released);
		/*
		 * This function only frees up some memory if possible so we
		 * dont have an obligation to finish processing. Bail out if
		 * preemption requested:
		 */
		if (need_resched())
			goto out;
		if (released)
			continue;
		/*
		 * It is essential that we are as careful as in the case of
		 * t_checkpoint_list with removing the buffer from the list as
		 * we can possibly see not yet submitted buffers on io_list
		 */
		ret += journal_clean_one_cp_list(transaction->
				t_checkpoint_io_list, &released);
		if (need_resched())
			goto out;
	} while (transaction != last_transaction);
out:
	return ret;
}

/*
 * journal_remove_checkpoint: called after a buffer has been committed
 * to disk (either by being write-back flushed to disk, or being
 * committed to the log).
 *
 * We cannot safely clean a transaction out of the log until all of the
 * buffer updates committed in that transaction have safely been stored
 * elsewhere on disk.  To achieve this, all of the buffers in a
 * transaction need to be maintained on the transaction's checkpoint
 * lists until they have been rewritten, at which point this function is
 * called to remove the buffer from the existing transaction's
 * checkpoint lists.
 *
 * The function returns 1 if it frees the transaction, 0 otherwise.
620
 * The function can free jh and bh.
621 622 623 624 625
 *
 * This function is called with j_list_lock held.
 * This function is called with jbd_lock_bh_state(jh2bh(jh))
 */

626
int __jbd2_journal_remove_checkpoint(struct journal_head *jh)
627
{
628
	struct transaction_chp_stats_s *stats;
629 630 631 632 633 634 635 636 637 638 639 640
	transaction_t *transaction;
	journal_t *journal;
	int ret = 0;

	JBUFFER_TRACE(jh, "entry");

	if ((transaction = jh->b_cp_transaction) == NULL) {
		JBUFFER_TRACE(jh, "not on transaction");
		goto out;
	}
	journal = transaction->t_journal;

641
	JBUFFER_TRACE(jh, "removing from transaction");
642 643
	__buffer_unlink(jh);
	jh->b_cp_transaction = NULL;
644
	jbd2_journal_put_journal_head(jh);
645 646 647 648 649 650 651

	if (transaction->t_checkpoint_list != NULL ||
	    transaction->t_checkpoint_io_list != NULL)
		goto out;

	/*
	 * There is one special case to worry about: if we have just pulled the
652 653 654
	 * buffer off a running or committing transaction's checkpoing list,
	 * then even if the checkpoint list is empty, the transaction obviously
	 * cannot be dropped!
655
	 *
656
	 * The locking here around t_state is a bit sleazy.
657
	 * See the comment at the end of jbd2_journal_commit_transaction().
658
	 */
659
	if (transaction->t_state != T_FINISHED)
660 661 662 663
		goto out;

	/* OK, that was the last buffer for the transaction: we can now
	   safely remove this transaction from the log */
664 665 666 667 668 669
	stats = &transaction->t_chp_stats;
	if (stats->cs_chp_time)
		stats->cs_chp_time = jbd2_time_diff(stats->cs_chp_time,
						    jiffies);
	trace_jbd2_checkpoint_stats(journal->j_fs_dev->bd_dev,
				    transaction->t_tid, stats);
670

671
	__jbd2_journal_drop_transaction(journal, transaction);
672
	jbd2_journal_free_transaction(transaction);
673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689

	/* Just in case anybody was waiting for more transactions to be
           checkpointed... */
	wake_up(&journal->j_wait_logspace);
	ret = 1;
out:
	return ret;
}

/*
 * journal_insert_checkpoint: put a committed buffer onto a checkpoint
 * list so that we know when it is safe to clean the transaction out of
 * the log.
 *
 * Called with the journal locked.
 * Called with j_list_lock held.
 */
690
void __jbd2_journal_insert_checkpoint(struct journal_head *jh,
691 692 693 694 695 696
			       transaction_t *transaction)
{
	JBUFFER_TRACE(jh, "entry");
	J_ASSERT_JH(jh, buffer_dirty(jh2bh(jh)) || buffer_jbddirty(jh2bh(jh)));
	J_ASSERT_JH(jh, jh->b_cp_transaction == NULL);

697 698
	/* Get reference for checkpointing transaction */
	jbd2_journal_grab_journal_head(jh2bh(jh));
699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721
	jh->b_cp_transaction = transaction;

	if (!transaction->t_checkpoint_list) {
		jh->b_cpnext = jh->b_cpprev = jh;
	} else {
		jh->b_cpnext = transaction->t_checkpoint_list;
		jh->b_cpprev = transaction->t_checkpoint_list->b_cpprev;
		jh->b_cpprev->b_cpnext = jh;
		jh->b_cpnext->b_cpprev = jh;
	}
	transaction->t_checkpoint_list = jh;
}

/*
 * We've finished with this transaction structure: adios...
 *
 * The transaction must have no links except for the checkpoint by this
 * point.
 *
 * Called with the journal locked.
 * Called with j_list_lock held.
 */

722
void __jbd2_journal_drop_transaction(journal_t *journal, transaction_t *transaction)
723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742
{
	assert_spin_locked(&journal->j_list_lock);
	if (transaction->t_cpnext) {
		transaction->t_cpnext->t_cpprev = transaction->t_cpprev;
		transaction->t_cpprev->t_cpnext = transaction->t_cpnext;
		if (journal->j_checkpoint_transactions == transaction)
			journal->j_checkpoint_transactions =
				transaction->t_cpnext;
		if (journal->j_checkpoint_transactions == transaction)
			journal->j_checkpoint_transactions = NULL;
	}

	J_ASSERT(transaction->t_state == T_FINISHED);
	J_ASSERT(transaction->t_buffers == NULL);
	J_ASSERT(transaction->t_forget == NULL);
	J_ASSERT(transaction->t_iobuf_list == NULL);
	J_ASSERT(transaction->t_shadow_list == NULL);
	J_ASSERT(transaction->t_log_list == NULL);
	J_ASSERT(transaction->t_checkpoint_list == NULL);
	J_ASSERT(transaction->t_checkpoint_io_list == NULL);
743
	J_ASSERT(atomic_read(&transaction->t_updates) == 0);
744 745 746
	J_ASSERT(journal->j_committing_transaction != transaction);
	J_ASSERT(journal->j_running_transaction != transaction);

747 748
	trace_jbd2_drop_transaction(journal, transaction);

749 750
	jbd_debug(1, "Dropping transaction %d, all done\n", transaction->t_tid);
}