checkpoint.c 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738
  1. /*
  2. * linux/fs/jbd/checkpoint.c
  3. *
  4. * Written by Stephen C. Tweedie <sct@redhat.com>, 1999
  5. *
  6. * Copyright 1999 Red Hat Software --- All Rights Reserved
  7. *
  8. * This file is part of the Linux kernel and is made available under
  9. * the terms of the GNU General Public License, version 2, or at your
  10. * option, any later version, incorporated herein by reference.
  11. *
  12. * Checkpoint routines for the generic filesystem journaling code.
  13. * Part of the ext2fs journaling system.
  14. *
  15. * Checkpointing is the process of ensuring that a section of the log is
  16. * committed fully to disk, so that that portion of the log can be
  17. * reused.
  18. */
  19. #include <linux/time.h>
  20. #include <linux/fs.h>
  21. #include <linux/jbd.h>
  22. #include <linux/errno.h>
  23. #include <linux/slab.h>
  24. /*
  25. * Unlink a buffer from a transaction checkpoint list.
  26. *
  27. * Called with j_list_lock held.
  28. */
  29. static inline void __buffer_unlink_first(struct journal_head *jh)
  30. {
  31. transaction_t *transaction = jh->b_cp_transaction;
  32. jh->b_cpnext->b_cpprev = jh->b_cpprev;
  33. jh->b_cpprev->b_cpnext = jh->b_cpnext;
  34. if (transaction->t_checkpoint_list == jh) {
  35. transaction->t_checkpoint_list = jh->b_cpnext;
  36. if (transaction->t_checkpoint_list == jh)
  37. transaction->t_checkpoint_list = NULL;
  38. }
  39. }
  40. /*
  41. * Unlink a buffer from a transaction checkpoint(io) list.
  42. *
  43. * Called with j_list_lock held.
  44. */
  45. static inline void __buffer_unlink(struct journal_head *jh)
  46. {
  47. transaction_t *transaction = jh->b_cp_transaction;
  48. __buffer_unlink_first(jh);
  49. if (transaction->t_checkpoint_io_list == jh) {
  50. transaction->t_checkpoint_io_list = jh->b_cpnext;
  51. if (transaction->t_checkpoint_io_list == jh)
  52. transaction->t_checkpoint_io_list = NULL;
  53. }
  54. }
  55. /*
  56. * Move a buffer from the checkpoint list to the checkpoint io list
  57. *
  58. * Called with j_list_lock held
  59. */
  60. static inline void __buffer_relink_io(struct journal_head *jh)
  61. {
  62. transaction_t *transaction = jh->b_cp_transaction;
  63. __buffer_unlink_first(jh);
  64. if (!transaction->t_checkpoint_io_list) {
  65. jh->b_cpnext = jh->b_cpprev = jh;
  66. } else {
  67. jh->b_cpnext = transaction->t_checkpoint_io_list;
  68. jh->b_cpprev = transaction->t_checkpoint_io_list->b_cpprev;
  69. jh->b_cpprev->b_cpnext = jh;
  70. jh->b_cpnext->b_cpprev = jh;
  71. }
  72. transaction->t_checkpoint_io_list = jh;
  73. }
  74. /*
  75. * Try to release a checkpointed buffer from its transaction.
  76. * Returns 1 if we released it and 2 if we also released the
  77. * whole transaction.
  78. *
  79. * Requires j_list_lock
  80. * Called under jbd_lock_bh_state(jh2bh(jh)), and drops it
  81. */
  82. static int __try_to_free_cp_buf(struct journal_head *jh)
  83. {
  84. int ret = 0;
  85. struct buffer_head *bh = jh2bh(jh);
  86. if (jh->b_jlist == BJ_None && !buffer_locked(bh) &&
  87. !buffer_dirty(bh) && !buffer_write_io_error(bh)) {
  88. JBUFFER_TRACE(jh, "remove from checkpoint list");
  89. ret = __journal_remove_checkpoint(jh) + 1;
  90. jbd_unlock_bh_state(bh);
  91. journal_remove_journal_head(bh);
  92. BUFFER_TRACE(bh, "release");
  93. __brelse(bh);
  94. } else {
  95. jbd_unlock_bh_state(bh);
  96. }
  97. return ret;
  98. }
  99. /*
  100. * __log_wait_for_space: wait until there is space in the journal.
  101. *
  102. * Called under j-state_lock *only*. It will be unlocked if we have to wait
  103. * for a checkpoint to free up some space in the log.
  104. */
  105. void __log_wait_for_space(journal_t *journal)
  106. {
  107. int nblocks;
  108. assert_spin_locked(&journal->j_state_lock);
  109. nblocks = jbd_space_needed(journal);
  110. while (__log_space_left(journal) < nblocks) {
  111. if (journal->j_flags & JFS_ABORT)
  112. return;
  113. spin_unlock(&journal->j_state_lock);
  114. mutex_lock(&journal->j_checkpoint_mutex);
  115. /*
  116. * Test again, another process may have checkpointed while we
  117. * were waiting for the checkpoint lock. If there are no
  118. * outstanding transactions there is nothing to checkpoint and
  119. * we can't make progress. Abort the journal in this case.
  120. */
  121. spin_lock(&journal->j_state_lock);
  122. spin_lock(&journal->j_list_lock);
  123. nblocks = jbd_space_needed(journal);
  124. if (__log_space_left(journal) < nblocks) {
  125. int chkpt = journal->j_checkpoint_transactions != NULL;
  126. spin_unlock(&journal->j_list_lock);
  127. spin_unlock(&journal->j_state_lock);
  128. if (chkpt) {
  129. log_do_checkpoint(journal);
  130. } else {
  131. printk(KERN_ERR "%s: no transactions\n",
  132. __func__);
  133. journal_abort(journal, 0);
  134. }
  135. spin_lock(&journal->j_state_lock);
  136. } else {
  137. spin_unlock(&journal->j_list_lock);
  138. }
  139. mutex_unlock(&journal->j_checkpoint_mutex);
  140. }
  141. }
  142. /*
  143. * We were unable to perform jbd_trylock_bh_state() inside j_list_lock.
  144. * The caller must restart a list walk. Wait for someone else to run
  145. * jbd_unlock_bh_state().
  146. */
  147. static void jbd_sync_bh(journal_t *journal, struct buffer_head *bh)
  148. __releases(journal->j_list_lock)
  149. {
  150. get_bh(bh);
  151. spin_unlock(&journal->j_list_lock);
  152. jbd_lock_bh_state(bh);
  153. jbd_unlock_bh_state(bh);
  154. put_bh(bh);
  155. }
  156. /*
  157. * Clean up transaction's list of buffers submitted for io.
  158. * We wait for any pending IO to complete and remove any clean
  159. * buffers. Note that we take the buffers in the opposite ordering
  160. * from the one in which they were submitted for IO.
  161. *
  162. * Return 0 on success, and return <0 if some buffers have failed
  163. * to be written out.
  164. *
  165. * Called with j_list_lock held.
  166. */
  167. static int __wait_cp_io(journal_t *journal, transaction_t *transaction)
  168. {
  169. struct journal_head *jh;
  170. struct buffer_head *bh;
  171. tid_t this_tid;
  172. int released = 0;
  173. int ret = 0;
  174. this_tid = transaction->t_tid;
  175. restart:
  176. /* Did somebody clean up the transaction in the meanwhile? */
  177. if (journal->j_checkpoint_transactions != transaction ||
  178. transaction->t_tid != this_tid)
  179. return ret;
  180. while (!released && transaction->t_checkpoint_io_list) {
  181. jh = transaction->t_checkpoint_io_list;
  182. bh = jh2bh(jh);
  183. if (!jbd_trylock_bh_state(bh)) {
  184. jbd_sync_bh(journal, bh);
  185. spin_lock(&journal->j_list_lock);
  186. goto restart;
  187. }
  188. if (buffer_locked(bh)) {
  189. atomic_inc(&bh->b_count);
  190. spin_unlock(&journal->j_list_lock);
  191. jbd_unlock_bh_state(bh);
  192. wait_on_buffer(bh);
  193. /* the journal_head may have gone by now */
  194. BUFFER_TRACE(bh, "brelse");
  195. __brelse(bh);
  196. spin_lock(&journal->j_list_lock);
  197. goto restart;
  198. }
  199. if (unlikely(buffer_write_io_error(bh)))
  200. ret = -EIO;
  201. /*
  202. * Now in whatever state the buffer currently is, we know that
  203. * it has been written out and so we can drop it from the list
  204. */
  205. released = __journal_remove_checkpoint(jh);
  206. jbd_unlock_bh_state(bh);
  207. journal_remove_journal_head(bh);
  208. __brelse(bh);
  209. }
  210. return ret;
  211. }
  212. #define NR_BATCH 64
  213. static void
  214. __flush_batch(journal_t *journal, struct buffer_head **bhs, int *batch_count)
  215. {
  216. int i;
  217. ll_rw_block(SWRITE, *batch_count, bhs);
  218. for (i = 0; i < *batch_count; i++) {
  219. struct buffer_head *bh = bhs[i];
  220. clear_buffer_jwrite(bh);
  221. BUFFER_TRACE(bh, "brelse");
  222. __brelse(bh);
  223. }
  224. *batch_count = 0;
  225. }
  226. /*
  227. * Try to flush one buffer from the checkpoint list to disk.
  228. *
  229. * Return 1 if something happened which requires us to abort the current
  230. * scan of the checkpoint list. Return <0 if the buffer has failed to
  231. * be written out.
  232. *
  233. * Called with j_list_lock held and drops it if 1 is returned
  234. * Called under jbd_lock_bh_state(jh2bh(jh)), and drops it
  235. */
  236. static int __process_buffer(journal_t *journal, struct journal_head *jh,
  237. struct buffer_head **bhs, int *batch_count)
  238. {
  239. struct buffer_head *bh = jh2bh(jh);
  240. int ret = 0;
  241. if (buffer_locked(bh)) {
  242. atomic_inc(&bh->b_count);
  243. spin_unlock(&journal->j_list_lock);
  244. jbd_unlock_bh_state(bh);
  245. wait_on_buffer(bh);
  246. /* the journal_head may have gone by now */
  247. BUFFER_TRACE(bh, "brelse");
  248. __brelse(bh);
  249. ret = 1;
  250. } else if (jh->b_transaction != NULL) {
  251. transaction_t *t = jh->b_transaction;
  252. tid_t tid = t->t_tid;
  253. spin_unlock(&journal->j_list_lock);
  254. jbd_unlock_bh_state(bh);
  255. log_start_commit(journal, tid);
  256. log_wait_commit(journal, tid);
  257. ret = 1;
  258. } else if (!buffer_dirty(bh)) {
  259. ret = 1;
  260. if (unlikely(buffer_write_io_error(bh)))
  261. ret = -EIO;
  262. J_ASSERT_JH(jh, !buffer_jbddirty(bh));
  263. BUFFER_TRACE(bh, "remove from checkpoint");
  264. __journal_remove_checkpoint(jh);
  265. spin_unlock(&journal->j_list_lock);
  266. jbd_unlock_bh_state(bh);
  267. journal_remove_journal_head(bh);
  268. __brelse(bh);
  269. } else {
  270. /*
  271. * Important: we are about to write the buffer, and
  272. * possibly block, while still holding the journal lock.
  273. * We cannot afford to let the transaction logic start
  274. * messing around with this buffer before we write it to
  275. * disk, as that would break recoverability.
  276. */
  277. BUFFER_TRACE(bh, "queue");
  278. get_bh(bh);
  279. J_ASSERT_BH(bh, !buffer_jwrite(bh));
  280. set_buffer_jwrite(bh);
  281. bhs[*batch_count] = bh;
  282. __buffer_relink_io(jh);
  283. jbd_unlock_bh_state(bh);
  284. (*batch_count)++;
  285. if (*batch_count == NR_BATCH) {
  286. spin_unlock(&journal->j_list_lock);
  287. __flush_batch(journal, bhs, batch_count);
  288. ret = 1;
  289. }
  290. }
  291. return ret;
  292. }
  293. /*
  294. * Perform an actual checkpoint. We take the first transaction on the
  295. * list of transactions to be checkpointed and send all its buffers
  296. * to disk. We submit larger chunks of data at once.
  297. *
  298. * The journal should be locked before calling this function.
  299. * Called with j_checkpoint_mutex held.
  300. */
  301. int log_do_checkpoint(journal_t *journal)
  302. {
  303. transaction_t *transaction;
  304. tid_t this_tid;
  305. int result;
  306. jbd_debug(1, "Start checkpoint\n");
  307. /*
  308. * First thing: if there are any transactions in the log which
  309. * don't need checkpointing, just eliminate them from the
  310. * journal straight away.
  311. */
  312. result = cleanup_journal_tail(journal);
  313. jbd_debug(1, "cleanup_journal_tail returned %d\n", result);
  314. if (result <= 0)
  315. return result;
  316. /*
  317. * OK, we need to start writing disk blocks. Take one transaction
  318. * and write it.
  319. */
  320. result = 0;
  321. spin_lock(&journal->j_list_lock);
  322. if (!journal->j_checkpoint_transactions)
  323. goto out;
  324. transaction = journal->j_checkpoint_transactions;
  325. this_tid = transaction->t_tid;
  326. restart:
  327. /*
  328. * If someone cleaned up this transaction while we slept, we're
  329. * done (maybe it's a new transaction, but it fell at the same
  330. * address).
  331. */
  332. if (journal->j_checkpoint_transactions == transaction &&
  333. transaction->t_tid == this_tid) {
  334. int batch_count = 0;
  335. struct buffer_head *bhs[NR_BATCH];
  336. struct journal_head *jh;
  337. int retry = 0, err;
  338. while (!retry && transaction->t_checkpoint_list) {
  339. struct buffer_head *bh;
  340. jh = transaction->t_checkpoint_list;
  341. bh = jh2bh(jh);
  342. if (!jbd_trylock_bh_state(bh)) {
  343. jbd_sync_bh(journal, bh);
  344. retry = 1;
  345. break;
  346. }
  347. retry = __process_buffer(journal, jh, bhs,&batch_count);
  348. if (retry < 0 && !result)
  349. result = retry;
  350. if (!retry && (need_resched() ||
  351. spin_needbreak(&journal->j_list_lock))) {
  352. spin_unlock(&journal->j_list_lock);
  353. retry = 1;
  354. break;
  355. }
  356. }
  357. if (batch_count) {
  358. if (!retry) {
  359. spin_unlock(&journal->j_list_lock);
  360. retry = 1;
  361. }
  362. __flush_batch(journal, bhs, &batch_count);
  363. }
  364. if (retry) {
  365. spin_lock(&journal->j_list_lock);
  366. goto restart;
  367. }
  368. /*
  369. * Now we have cleaned up the first transaction's checkpoint
  370. * list. Let's clean up the second one
  371. */
  372. err = __wait_cp_io(journal, transaction);
  373. if (!result)
  374. result = err;
  375. }
  376. out:
  377. spin_unlock(&journal->j_list_lock);
  378. if (result < 0)
  379. journal_abort(journal, result);
  380. else
  381. result = cleanup_journal_tail(journal);
  382. return (result < 0) ? result : 0;
  383. }
  384. /*
  385. * Check the list of checkpoint transactions for the journal to see if
  386. * we have already got rid of any since the last update of the log tail
  387. * in the journal superblock. If so, we can instantly roll the
  388. * superblock forward to remove those transactions from the log.
  389. *
  390. * Return <0 on error, 0 on success, 1 if there was nothing to clean up.
  391. *
  392. * Called with the journal lock held.
  393. *
  394. * This is the only part of the journaling code which really needs to be
  395. * aware of transaction aborts. Checkpointing involves writing to the
  396. * main filesystem area rather than to the journal, so it can proceed
  397. * even in abort state, but we must not update the super block if
  398. * checkpointing may have failed. Otherwise, we would lose some metadata
  399. * buffers which should be written-back to the filesystem.
  400. */
  401. int cleanup_journal_tail(journal_t *journal)
  402. {
  403. transaction_t * transaction;
  404. tid_t first_tid;
  405. unsigned long blocknr, freed;
  406. if (is_journal_aborted(journal))
  407. return 1;
  408. /* OK, work out the oldest transaction remaining in the log, and
  409. * the log block it starts at.
  410. *
  411. * If the log is now empty, we need to work out which is the
  412. * next transaction ID we will write, and where it will
  413. * start. */
  414. spin_lock(&journal->j_state_lock);
  415. spin_lock(&journal->j_list_lock);
  416. transaction = journal->j_checkpoint_transactions;
  417. if (transaction) {
  418. first_tid = transaction->t_tid;
  419. blocknr = transaction->t_log_start;
  420. } else if ((transaction = journal->j_committing_transaction) != NULL) {
  421. first_tid = transaction->t_tid;
  422. blocknr = transaction->t_log_start;
  423. } else if ((transaction = journal->j_running_transaction) != NULL) {
  424. first_tid = transaction->t_tid;
  425. blocknr = journal->j_head;
  426. } else {
  427. first_tid = journal->j_transaction_sequence;
  428. blocknr = journal->j_head;
  429. }
  430. spin_unlock(&journal->j_list_lock);
  431. J_ASSERT(blocknr != 0);
  432. /* If the oldest pinned transaction is at the tail of the log
  433. already then there's not much we can do right now. */
  434. if (journal->j_tail_sequence == first_tid) {
  435. spin_unlock(&journal->j_state_lock);
  436. return 1;
  437. }
  438. /* OK, update the superblock to recover the freed space.
  439. * Physical blocks come first: have we wrapped beyond the end of
  440. * the log? */
  441. freed = blocknr - journal->j_tail;
  442. if (blocknr < journal->j_tail)
  443. freed = freed + journal->j_last - journal->j_first;
  444. jbd_debug(1,
  445. "Cleaning journal tail from %d to %d (offset %lu), "
  446. "freeing %lu\n",
  447. journal->j_tail_sequence, first_tid, blocknr, freed);
  448. journal->j_free += freed;
  449. journal->j_tail_sequence = first_tid;
  450. journal->j_tail = blocknr;
  451. spin_unlock(&journal->j_state_lock);
  452. if (!(journal->j_flags & JFS_ABORT))
  453. journal_update_superblock(journal, 1);
  454. return 0;
  455. }
  456. /* Checkpoint list management */
  457. /*
  458. * journal_clean_one_cp_list
  459. *
  460. * Find all the written-back checkpoint buffers in the given list and release them.
  461. *
  462. * Called with the journal locked.
  463. * Called with j_list_lock held.
  464. * Returns number of bufers reaped (for debug)
  465. */
  466. static int journal_clean_one_cp_list(struct journal_head *jh, int *released)
  467. {
  468. struct journal_head *last_jh;
  469. struct journal_head *next_jh = jh;
  470. int ret, freed = 0;
  471. *released = 0;
  472. if (!jh)
  473. return 0;
  474. last_jh = jh->b_cpprev;
  475. do {
  476. jh = next_jh;
  477. next_jh = jh->b_cpnext;
  478. /* Use trylock because of the ranking */
  479. if (jbd_trylock_bh_state(jh2bh(jh))) {
  480. ret = __try_to_free_cp_buf(jh);
  481. if (ret) {
  482. freed++;
  483. if (ret == 2) {
  484. *released = 1;
  485. return freed;
  486. }
  487. }
  488. }
  489. /*
  490. * This function only frees up some memory
  491. * if possible so we dont have an obligation
  492. * to finish processing. Bail out if preemption
  493. * requested:
  494. */
  495. if (need_resched())
  496. return freed;
  497. } while (jh != last_jh);
  498. return freed;
  499. }
  500. /*
  501. * journal_clean_checkpoint_list
  502. *
  503. * Find all the written-back checkpoint buffers in the journal and release them.
  504. *
  505. * Called with the journal locked.
  506. * Called with j_list_lock held.
  507. * Returns number of buffers reaped (for debug)
  508. */
  509. int __journal_clean_checkpoint_list(journal_t *journal)
  510. {
  511. transaction_t *transaction, *last_transaction, *next_transaction;
  512. int ret = 0;
  513. int released;
  514. transaction = journal->j_checkpoint_transactions;
  515. if (!transaction)
  516. goto out;
  517. last_transaction = transaction->t_cpprev;
  518. next_transaction = transaction;
  519. do {
  520. transaction = next_transaction;
  521. next_transaction = transaction->t_cpnext;
  522. ret += journal_clean_one_cp_list(transaction->
  523. t_checkpoint_list, &released);
  524. /*
  525. * This function only frees up some memory if possible so we
  526. * dont have an obligation to finish processing. Bail out if
  527. * preemption requested:
  528. */
  529. if (need_resched())
  530. goto out;
  531. if (released)
  532. continue;
  533. /*
  534. * It is essential that we are as careful as in the case of
  535. * t_checkpoint_list with removing the buffer from the list as
  536. * we can possibly see not yet submitted buffers on io_list
  537. */
  538. ret += journal_clean_one_cp_list(transaction->
  539. t_checkpoint_io_list, &released);
  540. if (need_resched())
  541. goto out;
  542. } while (transaction != last_transaction);
  543. out:
  544. return ret;
  545. }
  546. /*
  547. * journal_remove_checkpoint: called after a buffer has been committed
  548. * to disk (either by being write-back flushed to disk, or being
  549. * committed to the log).
  550. *
  551. * We cannot safely clean a transaction out of the log until all of the
  552. * buffer updates committed in that transaction have safely been stored
  553. * elsewhere on disk. To achieve this, all of the buffers in a
  554. * transaction need to be maintained on the transaction's checkpoint
  555. * lists until they have been rewritten, at which point this function is
  556. * called to remove the buffer from the existing transaction's
  557. * checkpoint lists.
  558. *
  559. * The function returns 1 if it frees the transaction, 0 otherwise.
  560. *
  561. * This function is called with the journal locked.
  562. * This function is called with j_list_lock held.
  563. * This function is called with jbd_lock_bh_state(jh2bh(jh))
  564. */
  565. int __journal_remove_checkpoint(struct journal_head *jh)
  566. {
  567. transaction_t *transaction;
  568. journal_t *journal;
  569. int ret = 0;
  570. JBUFFER_TRACE(jh, "entry");
  571. if ((transaction = jh->b_cp_transaction) == NULL) {
  572. JBUFFER_TRACE(jh, "not on transaction");
  573. goto out;
  574. }
  575. journal = transaction->t_journal;
  576. __buffer_unlink(jh);
  577. jh->b_cp_transaction = NULL;
  578. if (transaction->t_checkpoint_list != NULL ||
  579. transaction->t_checkpoint_io_list != NULL)
  580. goto out;
  581. JBUFFER_TRACE(jh, "transaction has no more buffers");
  582. /*
  583. * There is one special case to worry about: if we have just pulled the
  584. * buffer off a running or committing transaction's checkpoing list,
  585. * then even if the checkpoint list is empty, the transaction obviously
  586. * cannot be dropped!
  587. *
  588. * The locking here around t_state is a bit sleazy.
  589. * See the comment at the end of journal_commit_transaction().
  590. */
  591. if (transaction->t_state != T_FINISHED) {
  592. JBUFFER_TRACE(jh, "belongs to running/committing transaction");
  593. goto out;
  594. }
  595. /* OK, that was the last buffer for the transaction: we can now
  596. safely remove this transaction from the log */
  597. __journal_drop_transaction(journal, transaction);
  598. /* Just in case anybody was waiting for more transactions to be
  599. checkpointed... */
  600. wake_up(&journal->j_wait_logspace);
  601. ret = 1;
  602. out:
  603. JBUFFER_TRACE(jh, "exit");
  604. return ret;
  605. }
  606. /*
  607. * journal_insert_checkpoint: put a committed buffer onto a checkpoint
  608. * list so that we know when it is safe to clean the transaction out of
  609. * the log.
  610. *
  611. * Called with the journal locked.
  612. * Called with j_list_lock held.
  613. */
  614. void __journal_insert_checkpoint(struct journal_head *jh,
  615. transaction_t *transaction)
  616. {
  617. JBUFFER_TRACE(jh, "entry");
  618. J_ASSERT_JH(jh, buffer_dirty(jh2bh(jh)) || buffer_jbddirty(jh2bh(jh)));
  619. J_ASSERT_JH(jh, jh->b_cp_transaction == NULL);
  620. jh->b_cp_transaction = transaction;
  621. if (!transaction->t_checkpoint_list) {
  622. jh->b_cpnext = jh->b_cpprev = jh;
  623. } else {
  624. jh->b_cpnext = transaction->t_checkpoint_list;
  625. jh->b_cpprev = transaction->t_checkpoint_list->b_cpprev;
  626. jh->b_cpprev->b_cpnext = jh;
  627. jh->b_cpnext->b_cpprev = jh;
  628. }
  629. transaction->t_checkpoint_list = jh;
  630. }
  631. /*
  632. * We've finished with this transaction structure: adios...
  633. *
  634. * The transaction must have no links except for the checkpoint by this
  635. * point.
  636. *
  637. * Called with the journal locked.
  638. * Called with j_list_lock held.
  639. */
  640. void __journal_drop_transaction(journal_t *journal, transaction_t *transaction)
  641. {
  642. assert_spin_locked(&journal->j_list_lock);
  643. if (transaction->t_cpnext) {
  644. transaction->t_cpnext->t_cpprev = transaction->t_cpprev;
  645. transaction->t_cpprev->t_cpnext = transaction->t_cpnext;
  646. if (journal->j_checkpoint_transactions == transaction)
  647. journal->j_checkpoint_transactions =
  648. transaction->t_cpnext;
  649. if (journal->j_checkpoint_transactions == transaction)
  650. journal->j_checkpoint_transactions = NULL;
  651. }
  652. J_ASSERT(transaction->t_state == T_FINISHED);
  653. J_ASSERT(transaction->t_buffers == NULL);
  654. J_ASSERT(transaction->t_sync_datalist == NULL);
  655. J_ASSERT(transaction->t_forget == NULL);
  656. J_ASSERT(transaction->t_iobuf_list == NULL);
  657. J_ASSERT(transaction->t_shadow_list == NULL);
  658. J_ASSERT(transaction->t_log_list == NULL);
  659. J_ASSERT(transaction->t_checkpoint_list == NULL);
  660. J_ASSERT(transaction->t_checkpoint_io_list == NULL);
  661. J_ASSERT(transaction->t_updates == 0);
  662. J_ASSERT(journal->j_committing_transaction != transaction);
  663. J_ASSERT(journal->j_running_transaction != transaction);
  664. jbd_debug(1, "Dropping transaction %d, all done\n", transaction->t_tid);
  665. kfree(transaction);
  666. }