transaction.c 61 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073
  1. /*
  2. * linux/fs/transaction.c
  3. *
  4. * Written by Stephen C. Tweedie <sct@redhat.com>, 1998
  5. *
  6. * Copyright 1998 Red Hat corp --- 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. * Generic filesystem transaction handling code; part of the ext2fs
  13. * journaling system.
  14. *
  15. * This file manages transactions (compound commits managed by the
  16. * journaling code) and handles (individual atomic operations by the
  17. * filesystem).
  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. #include <linux/timer.h>
  25. #include <linux/smp_lock.h>
  26. #include <linux/mm.h>
  27. #include <linux/highmem.h>
  28. /*
  29. * get_transaction: obtain a new transaction_t object.
  30. *
  31. * Simply allocate and initialise a new transaction. Create it in
  32. * RUNNING state and add it to the current journal (which should not
  33. * have an existing running transaction: we only make a new transaction
  34. * once we have started to commit the old one).
  35. *
  36. * Preconditions:
  37. * The journal MUST be locked. We don't perform atomic mallocs on the
  38. * new transaction and we can't block without protecting against other
  39. * processes trying to touch the journal while it is in transition.
  40. *
  41. * Called under j_state_lock
  42. */
  43. static transaction_t *
  44. get_transaction(journal_t *journal, transaction_t *transaction)
  45. {
  46. transaction->t_journal = journal;
  47. transaction->t_state = T_RUNNING;
  48. transaction->t_tid = journal->j_transaction_sequence++;
  49. transaction->t_expires = jiffies + journal->j_commit_interval;
  50. spin_lock_init(&transaction->t_handle_lock);
  51. /* Set up the commit timer for the new transaction. */
  52. journal->j_commit_timer->expires = transaction->t_expires;
  53. add_timer(journal->j_commit_timer);
  54. J_ASSERT(journal->j_running_transaction == NULL);
  55. journal->j_running_transaction = transaction;
  56. return transaction;
  57. }
  58. /*
  59. * Handle management.
  60. *
  61. * A handle_t is an object which represents a single atomic update to a
  62. * filesystem, and which tracks all of the modifications which form part
  63. * of that one update.
  64. */
  65. /*
  66. * start_this_handle: Given a handle, deal with any locking or stalling
  67. * needed to make sure that there is enough journal space for the handle
  68. * to begin. Attach the handle to a transaction and set up the
  69. * transaction's buffer credits.
  70. */
  71. static int start_this_handle(journal_t *journal, handle_t *handle)
  72. {
  73. transaction_t *transaction;
  74. int needed;
  75. int nblocks = handle->h_buffer_credits;
  76. transaction_t *new_transaction = NULL;
  77. int ret = 0;
  78. if (nblocks > journal->j_max_transaction_buffers) {
  79. printk(KERN_ERR "JBD: %s wants too many credits (%d > %d)\n",
  80. current->comm, nblocks,
  81. journal->j_max_transaction_buffers);
  82. ret = -ENOSPC;
  83. goto out;
  84. }
  85. alloc_transaction:
  86. if (!journal->j_running_transaction) {
  87. new_transaction = jbd_kmalloc(sizeof(*new_transaction),
  88. GFP_NOFS);
  89. if (!new_transaction) {
  90. ret = -ENOMEM;
  91. goto out;
  92. }
  93. memset(new_transaction, 0, sizeof(*new_transaction));
  94. }
  95. jbd_debug(3, "New handle %p going live.\n", handle);
  96. repeat:
  97. /*
  98. * We need to hold j_state_lock until t_updates has been incremented,
  99. * for proper journal barrier handling
  100. */
  101. spin_lock(&journal->j_state_lock);
  102. repeat_locked:
  103. if (is_journal_aborted(journal) ||
  104. (journal->j_errno != 0 && !(journal->j_flags & JFS_ACK_ERR))) {
  105. spin_unlock(&journal->j_state_lock);
  106. ret = -EROFS;
  107. goto out;
  108. }
  109. /* Wait on the journal's transaction barrier if necessary */
  110. if (journal->j_barrier_count) {
  111. spin_unlock(&journal->j_state_lock);
  112. wait_event(journal->j_wait_transaction_locked,
  113. journal->j_barrier_count == 0);
  114. goto repeat;
  115. }
  116. if (!journal->j_running_transaction) {
  117. if (!new_transaction) {
  118. spin_unlock(&journal->j_state_lock);
  119. goto alloc_transaction;
  120. }
  121. get_transaction(journal, new_transaction);
  122. new_transaction = NULL;
  123. }
  124. transaction = journal->j_running_transaction;
  125. /*
  126. * If the current transaction is locked down for commit, wait for the
  127. * lock to be released.
  128. */
  129. if (transaction->t_state == T_LOCKED) {
  130. DEFINE_WAIT(wait);
  131. prepare_to_wait(&journal->j_wait_transaction_locked,
  132. &wait, TASK_UNINTERRUPTIBLE);
  133. spin_unlock(&journal->j_state_lock);
  134. schedule();
  135. finish_wait(&journal->j_wait_transaction_locked, &wait);
  136. goto repeat;
  137. }
  138. /*
  139. * If there is not enough space left in the log to write all potential
  140. * buffers requested by this operation, we need to stall pending a log
  141. * checkpoint to free some more log space.
  142. */
  143. spin_lock(&transaction->t_handle_lock);
  144. needed = transaction->t_outstanding_credits + nblocks;
  145. if (needed > journal->j_max_transaction_buffers) {
  146. /*
  147. * If the current transaction is already too large, then start
  148. * to commit it: we can then go back and attach this handle to
  149. * a new transaction.
  150. */
  151. DEFINE_WAIT(wait);
  152. jbd_debug(2, "Handle %p starting new commit...\n", handle);
  153. spin_unlock(&transaction->t_handle_lock);
  154. prepare_to_wait(&journal->j_wait_transaction_locked, &wait,
  155. TASK_UNINTERRUPTIBLE);
  156. __log_start_commit(journal, transaction->t_tid);
  157. spin_unlock(&journal->j_state_lock);
  158. schedule();
  159. finish_wait(&journal->j_wait_transaction_locked, &wait);
  160. goto repeat;
  161. }
  162. /*
  163. * The commit code assumes that it can get enough log space
  164. * without forcing a checkpoint. This is *critical* for
  165. * correctness: a checkpoint of a buffer which is also
  166. * associated with a committing transaction creates a deadlock,
  167. * so commit simply cannot force through checkpoints.
  168. *
  169. * We must therefore ensure the necessary space in the journal
  170. * *before* starting to dirty potentially checkpointed buffers
  171. * in the new transaction.
  172. *
  173. * The worst part is, any transaction currently committing can
  174. * reduce the free space arbitrarily. Be careful to account for
  175. * those buffers when checkpointing.
  176. */
  177. /*
  178. * @@@ AKPM: This seems rather over-defensive. We're giving commit
  179. * a _lot_ of headroom: 1/4 of the journal plus the size of
  180. * the committing transaction. Really, we only need to give it
  181. * committing_transaction->t_outstanding_credits plus "enough" for
  182. * the log control blocks.
  183. * Also, this test is inconsitent with the matching one in
  184. * journal_extend().
  185. */
  186. if (__log_space_left(journal) < jbd_space_needed(journal)) {
  187. jbd_debug(2, "Handle %p waiting for checkpoint...\n", handle);
  188. spin_unlock(&transaction->t_handle_lock);
  189. __log_wait_for_space(journal);
  190. goto repeat_locked;
  191. }
  192. /* OK, account for the buffers that this operation expects to
  193. * use and add the handle to the running transaction. */
  194. handle->h_transaction = transaction;
  195. transaction->t_outstanding_credits += nblocks;
  196. transaction->t_updates++;
  197. transaction->t_handle_count++;
  198. jbd_debug(4, "Handle %p given %d credits (total %d, free %d)\n",
  199. handle, nblocks, transaction->t_outstanding_credits,
  200. __log_space_left(journal));
  201. spin_unlock(&transaction->t_handle_lock);
  202. spin_unlock(&journal->j_state_lock);
  203. out:
  204. if (new_transaction)
  205. kfree(new_transaction);
  206. return ret;
  207. }
  208. /* Allocate a new handle. This should probably be in a slab... */
  209. static handle_t *new_handle(int nblocks)
  210. {
  211. handle_t *handle = jbd_alloc_handle(GFP_NOFS);
  212. if (!handle)
  213. return NULL;
  214. memset(handle, 0, sizeof(*handle));
  215. handle->h_buffer_credits = nblocks;
  216. handle->h_ref = 1;
  217. return handle;
  218. }
  219. /**
  220. * handle_t *journal_start() - Obtain a new handle.
  221. * @journal: Journal to start transaction on.
  222. * @nblocks: number of block buffer we might modify
  223. *
  224. * We make sure that the transaction can guarantee at least nblocks of
  225. * modified buffers in the log. We block until the log can guarantee
  226. * that much space.
  227. *
  228. * This function is visible to journal users (like ext3fs), so is not
  229. * called with the journal already locked.
  230. *
  231. * Return a pointer to a newly allocated handle, or NULL on failure
  232. */
  233. handle_t *journal_start(journal_t *journal, int nblocks)
  234. {
  235. handle_t *handle = journal_current_handle();
  236. int err;
  237. if (!journal)
  238. return ERR_PTR(-EROFS);
  239. if (handle) {
  240. J_ASSERT(handle->h_transaction->t_journal == journal);
  241. handle->h_ref++;
  242. return handle;
  243. }
  244. handle = new_handle(nblocks);
  245. if (!handle)
  246. return ERR_PTR(-ENOMEM);
  247. current->journal_info = handle;
  248. err = start_this_handle(journal, handle);
  249. if (err < 0) {
  250. jbd_free_handle(handle);
  251. current->journal_info = NULL;
  252. handle = ERR_PTR(err);
  253. }
  254. return handle;
  255. }
  256. /**
  257. * int journal_extend() - extend buffer credits.
  258. * @handle: handle to 'extend'
  259. * @nblocks: nr blocks to try to extend by.
  260. *
  261. * Some transactions, such as large extends and truncates, can be done
  262. * atomically all at once or in several stages. The operation requests
  263. * a credit for a number of buffer modications in advance, but can
  264. * extend its credit if it needs more.
  265. *
  266. * journal_extend tries to give the running handle more buffer credits.
  267. * It does not guarantee that allocation - this is a best-effort only.
  268. * The calling process MUST be able to deal cleanly with a failure to
  269. * extend here.
  270. *
  271. * Return 0 on success, non-zero on failure.
  272. *
  273. * return code < 0 implies an error
  274. * return code > 0 implies normal transaction-full status.
  275. */
  276. int journal_extend(handle_t *handle, int nblocks)
  277. {
  278. transaction_t *transaction = handle->h_transaction;
  279. journal_t *journal = transaction->t_journal;
  280. int result;
  281. int wanted;
  282. result = -EIO;
  283. if (is_handle_aborted(handle))
  284. goto out;
  285. result = 1;
  286. spin_lock(&journal->j_state_lock);
  287. /* Don't extend a locked-down transaction! */
  288. if (handle->h_transaction->t_state != T_RUNNING) {
  289. jbd_debug(3, "denied handle %p %d blocks: "
  290. "transaction not running\n", handle, nblocks);
  291. goto error_out;
  292. }
  293. spin_lock(&transaction->t_handle_lock);
  294. wanted = transaction->t_outstanding_credits + nblocks;
  295. if (wanted > journal->j_max_transaction_buffers) {
  296. jbd_debug(3, "denied handle %p %d blocks: "
  297. "transaction too large\n", handle, nblocks);
  298. goto unlock;
  299. }
  300. if (wanted > __log_space_left(journal)) {
  301. jbd_debug(3, "denied handle %p %d blocks: "
  302. "insufficient log space\n", handle, nblocks);
  303. goto unlock;
  304. }
  305. handle->h_buffer_credits += nblocks;
  306. transaction->t_outstanding_credits += nblocks;
  307. result = 0;
  308. jbd_debug(3, "extended handle %p by %d\n", handle, nblocks);
  309. unlock:
  310. spin_unlock(&transaction->t_handle_lock);
  311. error_out:
  312. spin_unlock(&journal->j_state_lock);
  313. out:
  314. return result;
  315. }
  316. /**
  317. * int journal_restart() - restart a handle .
  318. * @handle: handle to restart
  319. * @nblocks: nr credits requested
  320. *
  321. * Restart a handle for a multi-transaction filesystem
  322. * operation.
  323. *
  324. * If the journal_extend() call above fails to grant new buffer credits
  325. * to a running handle, a call to journal_restart will commit the
  326. * handle's transaction so far and reattach the handle to a new
  327. * transaction capabable of guaranteeing the requested number of
  328. * credits.
  329. */
  330. int journal_restart(handle_t *handle, int nblocks)
  331. {
  332. transaction_t *transaction = handle->h_transaction;
  333. journal_t *journal = transaction->t_journal;
  334. int ret;
  335. /* If we've had an abort of any type, don't even think about
  336. * actually doing the restart! */
  337. if (is_handle_aborted(handle))
  338. return 0;
  339. /*
  340. * First unlink the handle from its current transaction, and start the
  341. * commit on that.
  342. */
  343. J_ASSERT(transaction->t_updates > 0);
  344. J_ASSERT(journal_current_handle() == handle);
  345. spin_lock(&journal->j_state_lock);
  346. spin_lock(&transaction->t_handle_lock);
  347. transaction->t_outstanding_credits -= handle->h_buffer_credits;
  348. transaction->t_updates--;
  349. if (!transaction->t_updates)
  350. wake_up(&journal->j_wait_updates);
  351. spin_unlock(&transaction->t_handle_lock);
  352. jbd_debug(2, "restarting handle %p\n", handle);
  353. __log_start_commit(journal, transaction->t_tid);
  354. spin_unlock(&journal->j_state_lock);
  355. handle->h_buffer_credits = nblocks;
  356. ret = start_this_handle(journal, handle);
  357. return ret;
  358. }
  359. /**
  360. * void journal_lock_updates () - establish a transaction barrier.
  361. * @journal: Journal to establish a barrier on.
  362. *
  363. * This locks out any further updates from being started, and blocks
  364. * until all existing updates have completed, returning only once the
  365. * journal is in a quiescent state with no updates running.
  366. *
  367. * The journal lock should not be held on entry.
  368. */
  369. void journal_lock_updates(journal_t *journal)
  370. {
  371. DEFINE_WAIT(wait);
  372. spin_lock(&journal->j_state_lock);
  373. ++journal->j_barrier_count;
  374. /* Wait until there are no running updates */
  375. while (1) {
  376. transaction_t *transaction = journal->j_running_transaction;
  377. if (!transaction)
  378. break;
  379. spin_lock(&transaction->t_handle_lock);
  380. if (!transaction->t_updates) {
  381. spin_unlock(&transaction->t_handle_lock);
  382. break;
  383. }
  384. prepare_to_wait(&journal->j_wait_updates, &wait,
  385. TASK_UNINTERRUPTIBLE);
  386. spin_unlock(&transaction->t_handle_lock);
  387. spin_unlock(&journal->j_state_lock);
  388. schedule();
  389. finish_wait(&journal->j_wait_updates, &wait);
  390. spin_lock(&journal->j_state_lock);
  391. }
  392. spin_unlock(&journal->j_state_lock);
  393. /*
  394. * We have now established a barrier against other normal updates, but
  395. * we also need to barrier against other journal_lock_updates() calls
  396. * to make sure that we serialise special journal-locked operations
  397. * too.
  398. */
  399. down(&journal->j_barrier);
  400. }
  401. /**
  402. * void journal_unlock_updates (journal_t* journal) - release barrier
  403. * @journal: Journal to release the barrier on.
  404. *
  405. * Release a transaction barrier obtained with journal_lock_updates().
  406. *
  407. * Should be called without the journal lock held.
  408. */
  409. void journal_unlock_updates (journal_t *journal)
  410. {
  411. J_ASSERT(journal->j_barrier_count != 0);
  412. up(&journal->j_barrier);
  413. spin_lock(&journal->j_state_lock);
  414. --journal->j_barrier_count;
  415. spin_unlock(&journal->j_state_lock);
  416. wake_up(&journal->j_wait_transaction_locked);
  417. }
  418. /*
  419. * Report any unexpected dirty buffers which turn up. Normally those
  420. * indicate an error, but they can occur if the user is running (say)
  421. * tune2fs to modify the live filesystem, so we need the option of
  422. * continuing as gracefully as possible. #
  423. *
  424. * The caller should already hold the journal lock and
  425. * j_list_lock spinlock: most callers will need those anyway
  426. * in order to probe the buffer's journaling state safely.
  427. */
  428. static void jbd_unexpected_dirty_buffer(struct journal_head *jh)
  429. {
  430. int jlist;
  431. /* If this buffer is one which might reasonably be dirty
  432. * --- ie. data, or not part of this journal --- then
  433. * we're OK to leave it alone, but otherwise we need to
  434. * move the dirty bit to the journal's own internal
  435. * JBDDirty bit. */
  436. jlist = jh->b_jlist;
  437. if (jlist == BJ_Metadata || jlist == BJ_Reserved ||
  438. jlist == BJ_Shadow || jlist == BJ_Forget) {
  439. struct buffer_head *bh = jh2bh(jh);
  440. if (test_clear_buffer_dirty(bh))
  441. set_buffer_jbddirty(bh);
  442. }
  443. }
  444. /*
  445. * If the buffer is already part of the current transaction, then there
  446. * is nothing we need to do. If it is already part of a prior
  447. * transaction which we are still committing to disk, then we need to
  448. * make sure that we do not overwrite the old copy: we do copy-out to
  449. * preserve the copy going to disk. We also account the buffer against
  450. * the handle's metadata buffer credits (unless the buffer is already
  451. * part of the transaction, that is).
  452. *
  453. */
  454. static int
  455. do_get_write_access(handle_t *handle, struct journal_head *jh,
  456. int force_copy)
  457. {
  458. struct buffer_head *bh;
  459. transaction_t *transaction;
  460. journal_t *journal;
  461. int error;
  462. char *frozen_buffer = NULL;
  463. int need_copy = 0;
  464. if (is_handle_aborted(handle))
  465. return -EROFS;
  466. transaction = handle->h_transaction;
  467. journal = transaction->t_journal;
  468. jbd_debug(5, "buffer_head %p, force_copy %d\n", jh, force_copy);
  469. JBUFFER_TRACE(jh, "entry");
  470. repeat:
  471. bh = jh2bh(jh);
  472. /* @@@ Need to check for errors here at some point. */
  473. lock_buffer(bh);
  474. jbd_lock_bh_state(bh);
  475. /* We now hold the buffer lock so it is safe to query the buffer
  476. * state. Is the buffer dirty?
  477. *
  478. * If so, there are two possibilities. The buffer may be
  479. * non-journaled, and undergoing a quite legitimate writeback.
  480. * Otherwise, it is journaled, and we don't expect dirty buffers
  481. * in that state (the buffers should be marked JBD_Dirty
  482. * instead.) So either the IO is being done under our own
  483. * control and this is a bug, or it's a third party IO such as
  484. * dump(8) (which may leave the buffer scheduled for read ---
  485. * ie. locked but not dirty) or tune2fs (which may actually have
  486. * the buffer dirtied, ugh.) */
  487. if (buffer_dirty(bh)) {
  488. /*
  489. * First question: is this buffer already part of the current
  490. * transaction or the existing committing transaction?
  491. */
  492. if (jh->b_transaction) {
  493. J_ASSERT_JH(jh,
  494. jh->b_transaction == transaction ||
  495. jh->b_transaction ==
  496. journal->j_committing_transaction);
  497. if (jh->b_next_transaction)
  498. J_ASSERT_JH(jh, jh->b_next_transaction ==
  499. transaction);
  500. }
  501. /*
  502. * In any case we need to clean the dirty flag and we must
  503. * do it under the buffer lock to be sure we don't race
  504. * with running write-out.
  505. */
  506. JBUFFER_TRACE(jh, "Unexpected dirty buffer");
  507. jbd_unexpected_dirty_buffer(jh);
  508. }
  509. unlock_buffer(bh);
  510. error = -EROFS;
  511. if (is_handle_aborted(handle)) {
  512. jbd_unlock_bh_state(bh);
  513. goto out;
  514. }
  515. error = 0;
  516. /*
  517. * The buffer is already part of this transaction if b_transaction or
  518. * b_next_transaction points to it
  519. */
  520. if (jh->b_transaction == transaction ||
  521. jh->b_next_transaction == transaction)
  522. goto done;
  523. /*
  524. * If there is already a copy-out version of this buffer, then we don't
  525. * need to make another one
  526. */
  527. if (jh->b_frozen_data) {
  528. JBUFFER_TRACE(jh, "has frozen data");
  529. J_ASSERT_JH(jh, jh->b_next_transaction == NULL);
  530. jh->b_next_transaction = transaction;
  531. goto done;
  532. }
  533. /* Is there data here we need to preserve? */
  534. if (jh->b_transaction && jh->b_transaction != transaction) {
  535. JBUFFER_TRACE(jh, "owned by older transaction");
  536. J_ASSERT_JH(jh, jh->b_next_transaction == NULL);
  537. J_ASSERT_JH(jh, jh->b_transaction ==
  538. journal->j_committing_transaction);
  539. /* There is one case we have to be very careful about.
  540. * If the committing transaction is currently writing
  541. * this buffer out to disk and has NOT made a copy-out,
  542. * then we cannot modify the buffer contents at all
  543. * right now. The essence of copy-out is that it is the
  544. * extra copy, not the primary copy, which gets
  545. * journaled. If the primary copy is already going to
  546. * disk then we cannot do copy-out here. */
  547. if (jh->b_jlist == BJ_Shadow) {
  548. DEFINE_WAIT_BIT(wait, &bh->b_state, BH_Unshadow);
  549. wait_queue_head_t *wqh;
  550. wqh = bit_waitqueue(&bh->b_state, BH_Unshadow);
  551. JBUFFER_TRACE(jh, "on shadow: sleep");
  552. jbd_unlock_bh_state(bh);
  553. /* commit wakes up all shadow buffers after IO */
  554. for ( ; ; ) {
  555. prepare_to_wait(wqh, &wait.wait,
  556. TASK_UNINTERRUPTIBLE);
  557. if (jh->b_jlist != BJ_Shadow)
  558. break;
  559. schedule();
  560. }
  561. finish_wait(wqh, &wait.wait);
  562. goto repeat;
  563. }
  564. /* Only do the copy if the currently-owning transaction
  565. * still needs it. If it is on the Forget list, the
  566. * committing transaction is past that stage. The
  567. * buffer had better remain locked during the kmalloc,
  568. * but that should be true --- we hold the journal lock
  569. * still and the buffer is already on the BUF_JOURNAL
  570. * list so won't be flushed.
  571. *
  572. * Subtle point, though: if this is a get_undo_access,
  573. * then we will be relying on the frozen_data to contain
  574. * the new value of the committed_data record after the
  575. * transaction, so we HAVE to force the frozen_data copy
  576. * in that case. */
  577. if (jh->b_jlist != BJ_Forget || force_copy) {
  578. JBUFFER_TRACE(jh, "generate frozen data");
  579. if (!frozen_buffer) {
  580. JBUFFER_TRACE(jh, "allocate memory for buffer");
  581. jbd_unlock_bh_state(bh);
  582. frozen_buffer = jbd_kmalloc(jh2bh(jh)->b_size,
  583. GFP_NOFS);
  584. if (!frozen_buffer) {
  585. printk(KERN_EMERG
  586. "%s: OOM for frozen_buffer\n",
  587. __FUNCTION__);
  588. JBUFFER_TRACE(jh, "oom!");
  589. error = -ENOMEM;
  590. jbd_lock_bh_state(bh);
  591. goto done;
  592. }
  593. goto repeat;
  594. }
  595. jh->b_frozen_data = frozen_buffer;
  596. frozen_buffer = NULL;
  597. need_copy = 1;
  598. }
  599. jh->b_next_transaction = transaction;
  600. }
  601. /*
  602. * Finally, if the buffer is not journaled right now, we need to make
  603. * sure it doesn't get written to disk before the caller actually
  604. * commits the new data
  605. */
  606. if (!jh->b_transaction) {
  607. JBUFFER_TRACE(jh, "no transaction");
  608. J_ASSERT_JH(jh, !jh->b_next_transaction);
  609. jh->b_transaction = transaction;
  610. JBUFFER_TRACE(jh, "file as BJ_Reserved");
  611. spin_lock(&journal->j_list_lock);
  612. __journal_file_buffer(jh, transaction, BJ_Reserved);
  613. spin_unlock(&journal->j_list_lock);
  614. }
  615. done:
  616. if (need_copy) {
  617. struct page *page;
  618. int offset;
  619. char *source;
  620. J_EXPECT_JH(jh, buffer_uptodate(jh2bh(jh)),
  621. "Possible IO failure.\n");
  622. page = jh2bh(jh)->b_page;
  623. offset = ((unsigned long) jh2bh(jh)->b_data) & ~PAGE_MASK;
  624. source = kmap_atomic(page, KM_USER0);
  625. memcpy(jh->b_frozen_data, source+offset, jh2bh(jh)->b_size);
  626. kunmap_atomic(source, KM_USER0);
  627. }
  628. jbd_unlock_bh_state(bh);
  629. /*
  630. * If we are about to journal a buffer, then any revoke pending on it is
  631. * no longer valid
  632. */
  633. journal_cancel_revoke(handle, jh);
  634. out:
  635. if (frozen_buffer)
  636. kfree(frozen_buffer);
  637. JBUFFER_TRACE(jh, "exit");
  638. return error;
  639. }
  640. /**
  641. * int journal_get_write_access() - notify intent to modify a buffer for metadata (not data) update.
  642. * @handle: transaction to add buffer modifications to
  643. * @bh: bh to be used for metadata writes
  644. * @credits: variable that will receive credits for the buffer
  645. *
  646. * Returns an error code or 0 on success.
  647. *
  648. * In full data journalling mode the buffer may be of type BJ_AsyncData,
  649. * because we're write()ing a buffer which is also part of a shared mapping.
  650. */
  651. int journal_get_write_access(handle_t *handle, struct buffer_head *bh)
  652. {
  653. struct journal_head *jh = journal_add_journal_head(bh);
  654. int rc;
  655. /* We do not want to get caught playing with fields which the
  656. * log thread also manipulates. Make sure that the buffer
  657. * completes any outstanding IO before proceeding. */
  658. rc = do_get_write_access(handle, jh, 0);
  659. journal_put_journal_head(jh);
  660. return rc;
  661. }
  662. /*
  663. * When the user wants to journal a newly created buffer_head
  664. * (ie. getblk() returned a new buffer and we are going to populate it
  665. * manually rather than reading off disk), then we need to keep the
  666. * buffer_head locked until it has been completely filled with new
  667. * data. In this case, we should be able to make the assertion that
  668. * the bh is not already part of an existing transaction.
  669. *
  670. * The buffer should already be locked by the caller by this point.
  671. * There is no lock ranking violation: it was a newly created,
  672. * unlocked buffer beforehand. */
  673. /**
  674. * int journal_get_create_access () - notify intent to use newly created bh
  675. * @handle: transaction to new buffer to
  676. * @bh: new buffer.
  677. *
  678. * Call this if you create a new bh.
  679. */
  680. int journal_get_create_access(handle_t *handle, struct buffer_head *bh)
  681. {
  682. transaction_t *transaction = handle->h_transaction;
  683. journal_t *journal = transaction->t_journal;
  684. struct journal_head *jh = journal_add_journal_head(bh);
  685. int err;
  686. jbd_debug(5, "journal_head %p\n", jh);
  687. err = -EROFS;
  688. if (is_handle_aborted(handle))
  689. goto out;
  690. err = 0;
  691. JBUFFER_TRACE(jh, "entry");
  692. /*
  693. * The buffer may already belong to this transaction due to pre-zeroing
  694. * in the filesystem's new_block code. It may also be on the previous,
  695. * committing transaction's lists, but it HAS to be in Forget state in
  696. * that case: the transaction must have deleted the buffer for it to be
  697. * reused here.
  698. */
  699. jbd_lock_bh_state(bh);
  700. spin_lock(&journal->j_list_lock);
  701. J_ASSERT_JH(jh, (jh->b_transaction == transaction ||
  702. jh->b_transaction == NULL ||
  703. (jh->b_transaction == journal->j_committing_transaction &&
  704. jh->b_jlist == BJ_Forget)));
  705. J_ASSERT_JH(jh, jh->b_next_transaction == NULL);
  706. J_ASSERT_JH(jh, buffer_locked(jh2bh(jh)));
  707. if (jh->b_transaction == NULL) {
  708. jh->b_transaction = transaction;
  709. JBUFFER_TRACE(jh, "file as BJ_Reserved");
  710. __journal_file_buffer(jh, transaction, BJ_Reserved);
  711. } else if (jh->b_transaction == journal->j_committing_transaction) {
  712. JBUFFER_TRACE(jh, "set next transaction");
  713. jh->b_next_transaction = transaction;
  714. }
  715. spin_unlock(&journal->j_list_lock);
  716. jbd_unlock_bh_state(bh);
  717. /*
  718. * akpm: I added this. ext3_alloc_branch can pick up new indirect
  719. * blocks which contain freed but then revoked metadata. We need
  720. * to cancel the revoke in case we end up freeing it yet again
  721. * and the reallocating as data - this would cause a second revoke,
  722. * which hits an assertion error.
  723. */
  724. JBUFFER_TRACE(jh, "cancelling revoke");
  725. journal_cancel_revoke(handle, jh);
  726. journal_put_journal_head(jh);
  727. out:
  728. return err;
  729. }
  730. /**
  731. * int journal_get_undo_access() - Notify intent to modify metadata with
  732. * non-rewindable consequences
  733. * @handle: transaction
  734. * @bh: buffer to undo
  735. * @credits: store the number of taken credits here (if not NULL)
  736. *
  737. * Sometimes there is a need to distinguish between metadata which has
  738. * been committed to disk and that which has not. The ext3fs code uses
  739. * this for freeing and allocating space, we have to make sure that we
  740. * do not reuse freed space until the deallocation has been committed,
  741. * since if we overwrote that space we would make the delete
  742. * un-rewindable in case of a crash.
  743. *
  744. * To deal with that, journal_get_undo_access requests write access to a
  745. * buffer for parts of non-rewindable operations such as delete
  746. * operations on the bitmaps. The journaling code must keep a copy of
  747. * the buffer's contents prior to the undo_access call until such time
  748. * as we know that the buffer has definitely been committed to disk.
  749. *
  750. * We never need to know which transaction the committed data is part
  751. * of, buffers touched here are guaranteed to be dirtied later and so
  752. * will be committed to a new transaction in due course, at which point
  753. * we can discard the old committed data pointer.
  754. *
  755. * Returns error number or 0 on success.
  756. */
  757. int journal_get_undo_access(handle_t *handle, struct buffer_head *bh)
  758. {
  759. int err;
  760. struct journal_head *jh = journal_add_journal_head(bh);
  761. char *committed_data = NULL;
  762. JBUFFER_TRACE(jh, "entry");
  763. /*
  764. * Do this first --- it can drop the journal lock, so we want to
  765. * make sure that obtaining the committed_data is done
  766. * atomically wrt. completion of any outstanding commits.
  767. */
  768. err = do_get_write_access(handle, jh, 1);
  769. if (err)
  770. goto out;
  771. repeat:
  772. if (!jh->b_committed_data) {
  773. committed_data = jbd_kmalloc(jh2bh(jh)->b_size, GFP_NOFS);
  774. if (!committed_data) {
  775. printk(KERN_EMERG "%s: No memory for committed data\n",
  776. __FUNCTION__);
  777. err = -ENOMEM;
  778. goto out;
  779. }
  780. }
  781. jbd_lock_bh_state(bh);
  782. if (!jh->b_committed_data) {
  783. /* Copy out the current buffer contents into the
  784. * preserved, committed copy. */
  785. JBUFFER_TRACE(jh, "generate b_committed data");
  786. if (!committed_data) {
  787. jbd_unlock_bh_state(bh);
  788. goto repeat;
  789. }
  790. jh->b_committed_data = committed_data;
  791. committed_data = NULL;
  792. memcpy(jh->b_committed_data, bh->b_data, bh->b_size);
  793. }
  794. jbd_unlock_bh_state(bh);
  795. out:
  796. journal_put_journal_head(jh);
  797. if (committed_data)
  798. kfree(committed_data);
  799. return err;
  800. }
  801. /**
  802. * int journal_dirty_data() - mark a buffer as containing dirty data which
  803. * needs to be flushed before we can commit the
  804. * current transaction.
  805. * @handle: transaction
  806. * @bh: bufferhead to mark
  807. *
  808. * The buffer is placed on the transaction's data list and is marked as
  809. * belonging to the transaction.
  810. *
  811. * Returns error number or 0 on success.
  812. *
  813. * journal_dirty_data() can be called via page_launder->ext3_writepage
  814. * by kswapd.
  815. */
  816. int journal_dirty_data(handle_t *handle, struct buffer_head *bh)
  817. {
  818. journal_t *journal = handle->h_transaction->t_journal;
  819. int need_brelse = 0;
  820. struct journal_head *jh;
  821. if (is_handle_aborted(handle))
  822. return 0;
  823. jh = journal_add_journal_head(bh);
  824. JBUFFER_TRACE(jh, "entry");
  825. /*
  826. * The buffer could *already* be dirty. Writeout can start
  827. * at any time.
  828. */
  829. jbd_debug(4, "jh: %p, tid:%d\n", jh, handle->h_transaction->t_tid);
  830. /*
  831. * What if the buffer is already part of a running transaction?
  832. *
  833. * There are two cases:
  834. * 1) It is part of the current running transaction. Refile it,
  835. * just in case we have allocated it as metadata, deallocated
  836. * it, then reallocated it as data.
  837. * 2) It is part of the previous, still-committing transaction.
  838. * If all we want to do is to guarantee that the buffer will be
  839. * written to disk before this new transaction commits, then
  840. * being sure that the *previous* transaction has this same
  841. * property is sufficient for us! Just leave it on its old
  842. * transaction.
  843. *
  844. * In case (2), the buffer must not already exist as metadata
  845. * --- that would violate write ordering (a transaction is free
  846. * to write its data at any point, even before the previous
  847. * committing transaction has committed). The caller must
  848. * never, ever allow this to happen: there's nothing we can do
  849. * about it in this layer.
  850. */
  851. jbd_lock_bh_state(bh);
  852. spin_lock(&journal->j_list_lock);
  853. if (jh->b_transaction) {
  854. JBUFFER_TRACE(jh, "has transaction");
  855. if (jh->b_transaction != handle->h_transaction) {
  856. JBUFFER_TRACE(jh, "belongs to older transaction");
  857. J_ASSERT_JH(jh, jh->b_transaction ==
  858. journal->j_committing_transaction);
  859. /* @@@ IS THIS TRUE ? */
  860. /*
  861. * Not any more. Scenario: someone does a write()
  862. * in data=journal mode. The buffer's transaction has
  863. * moved into commit. Then someone does another
  864. * write() to the file. We do the frozen data copyout
  865. * and set b_next_transaction to point to j_running_t.
  866. * And while we're in that state, someone does a
  867. * writepage() in an attempt to pageout the same area
  868. * of the file via a shared mapping. At present that
  869. * calls journal_dirty_data(), and we get right here.
  870. * It may be too late to journal the data. Simply
  871. * falling through to the next test will suffice: the
  872. * data will be dirty and wil be checkpointed. The
  873. * ordering comments in the next comment block still
  874. * apply.
  875. */
  876. //J_ASSERT_JH(jh, jh->b_next_transaction == NULL);
  877. /*
  878. * If we're journalling data, and this buffer was
  879. * subject to a write(), it could be metadata, forget
  880. * or shadow against the committing transaction. Now,
  881. * someone has dirtied the same darn page via a mapping
  882. * and it is being writepage()'d.
  883. * We *could* just steal the page from commit, with some
  884. * fancy locking there. Instead, we just skip it -
  885. * don't tie the page's buffers to the new transaction
  886. * at all.
  887. * Implication: if we crash before the writepage() data
  888. * is written into the filesystem, recovery will replay
  889. * the write() data.
  890. */
  891. if (jh->b_jlist != BJ_None &&
  892. jh->b_jlist != BJ_SyncData &&
  893. jh->b_jlist != BJ_Locked) {
  894. JBUFFER_TRACE(jh, "Not stealing");
  895. goto no_journal;
  896. }
  897. /*
  898. * This buffer may be undergoing writeout in commit. We
  899. * can't return from here and let the caller dirty it
  900. * again because that can cause the write-out loop in
  901. * commit to never terminate.
  902. */
  903. if (buffer_dirty(bh)) {
  904. get_bh(bh);
  905. spin_unlock(&journal->j_list_lock);
  906. jbd_unlock_bh_state(bh);
  907. need_brelse = 1;
  908. sync_dirty_buffer(bh);
  909. jbd_lock_bh_state(bh);
  910. spin_lock(&journal->j_list_lock);
  911. /* The buffer may become locked again at any
  912. time if it is redirtied */
  913. }
  914. /* journal_clean_data_list() may have got there first */
  915. if (jh->b_transaction != NULL) {
  916. JBUFFER_TRACE(jh, "unfile from commit");
  917. __journal_temp_unlink_buffer(jh);
  918. /* It still points to the committing
  919. * transaction; move it to this one so
  920. * that the refile assert checks are
  921. * happy. */
  922. jh->b_transaction = handle->h_transaction;
  923. }
  924. /* The buffer will be refiled below */
  925. }
  926. /*
  927. * Special case --- the buffer might actually have been
  928. * allocated and then immediately deallocated in the previous,
  929. * committing transaction, so might still be left on that
  930. * transaction's metadata lists.
  931. */
  932. if (jh->b_jlist != BJ_SyncData && jh->b_jlist != BJ_Locked) {
  933. JBUFFER_TRACE(jh, "not on correct data list: unfile");
  934. J_ASSERT_JH(jh, jh->b_jlist != BJ_Shadow);
  935. __journal_temp_unlink_buffer(jh);
  936. jh->b_transaction = handle->h_transaction;
  937. JBUFFER_TRACE(jh, "file as data");
  938. __journal_file_buffer(jh, handle->h_transaction,
  939. BJ_SyncData);
  940. }
  941. } else {
  942. JBUFFER_TRACE(jh, "not on a transaction");
  943. __journal_file_buffer(jh, handle->h_transaction, BJ_SyncData);
  944. }
  945. no_journal:
  946. spin_unlock(&journal->j_list_lock);
  947. jbd_unlock_bh_state(bh);
  948. if (need_brelse) {
  949. BUFFER_TRACE(bh, "brelse");
  950. __brelse(bh);
  951. }
  952. JBUFFER_TRACE(jh, "exit");
  953. journal_put_journal_head(jh);
  954. return 0;
  955. }
  956. /**
  957. * int journal_dirty_metadata() - mark a buffer as containing dirty metadata
  958. * @handle: transaction to add buffer to.
  959. * @bh: buffer to mark
  960. *
  961. * mark dirty metadata which needs to be journaled as part of the current
  962. * transaction.
  963. *
  964. * The buffer is placed on the transaction's metadata list and is marked
  965. * as belonging to the transaction.
  966. *
  967. * Returns error number or 0 on success.
  968. *
  969. * Special care needs to be taken if the buffer already belongs to the
  970. * current committing transaction (in which case we should have frozen
  971. * data present for that commit). In that case, we don't relink the
  972. * buffer: that only gets done when the old transaction finally
  973. * completes its commit.
  974. */
  975. int journal_dirty_metadata(handle_t *handle, struct buffer_head *bh)
  976. {
  977. transaction_t *transaction = handle->h_transaction;
  978. journal_t *journal = transaction->t_journal;
  979. struct journal_head *jh = bh2jh(bh);
  980. jbd_debug(5, "journal_head %p\n", jh);
  981. JBUFFER_TRACE(jh, "entry");
  982. if (is_handle_aborted(handle))
  983. goto out;
  984. jbd_lock_bh_state(bh);
  985. if (jh->b_modified == 0) {
  986. /*
  987. * This buffer's got modified and becoming part
  988. * of the transaction. This needs to be done
  989. * once a transaction -bzzz
  990. */
  991. jh->b_modified = 1;
  992. J_ASSERT_JH(jh, handle->h_buffer_credits > 0);
  993. handle->h_buffer_credits--;
  994. }
  995. /*
  996. * fastpath, to avoid expensive locking. If this buffer is already
  997. * on the running transaction's metadata list there is nothing to do.
  998. * Nobody can take it off again because there is a handle open.
  999. * I _think_ we're OK here with SMP barriers - a mistaken decision will
  1000. * result in this test being false, so we go in and take the locks.
  1001. */
  1002. if (jh->b_transaction == transaction && jh->b_jlist == BJ_Metadata) {
  1003. JBUFFER_TRACE(jh, "fastpath");
  1004. J_ASSERT_JH(jh, jh->b_transaction ==
  1005. journal->j_running_transaction);
  1006. goto out_unlock_bh;
  1007. }
  1008. set_buffer_jbddirty(bh);
  1009. /*
  1010. * Metadata already on the current transaction list doesn't
  1011. * need to be filed. Metadata on another transaction's list must
  1012. * be committing, and will be refiled once the commit completes:
  1013. * leave it alone for now.
  1014. */
  1015. if (jh->b_transaction != transaction) {
  1016. JBUFFER_TRACE(jh, "already on other transaction");
  1017. J_ASSERT_JH(jh, jh->b_transaction ==
  1018. journal->j_committing_transaction);
  1019. J_ASSERT_JH(jh, jh->b_next_transaction == transaction);
  1020. /* And this case is illegal: we can't reuse another
  1021. * transaction's data buffer, ever. */
  1022. goto out_unlock_bh;
  1023. }
  1024. /* That test should have eliminated the following case: */
  1025. J_ASSERT_JH(jh, jh->b_frozen_data == 0);
  1026. JBUFFER_TRACE(jh, "file as BJ_Metadata");
  1027. spin_lock(&journal->j_list_lock);
  1028. __journal_file_buffer(jh, handle->h_transaction, BJ_Metadata);
  1029. spin_unlock(&journal->j_list_lock);
  1030. out_unlock_bh:
  1031. jbd_unlock_bh_state(bh);
  1032. out:
  1033. JBUFFER_TRACE(jh, "exit");
  1034. return 0;
  1035. }
  1036. /*
  1037. * journal_release_buffer: undo a get_write_access without any buffer
  1038. * updates, if the update decided in the end that it didn't need access.
  1039. *
  1040. */
  1041. void
  1042. journal_release_buffer(handle_t *handle, struct buffer_head *bh)
  1043. {
  1044. BUFFER_TRACE(bh, "entry");
  1045. }
  1046. /**
  1047. * void journal_forget() - bforget() for potentially-journaled buffers.
  1048. * @handle: transaction handle
  1049. * @bh: bh to 'forget'
  1050. *
  1051. * We can only do the bforget if there are no commits pending against the
  1052. * buffer. If the buffer is dirty in the current running transaction we
  1053. * can safely unlink it.
  1054. *
  1055. * bh may not be a journalled buffer at all - it may be a non-JBD
  1056. * buffer which came off the hashtable. Check for this.
  1057. *
  1058. * Decrements bh->b_count by one.
  1059. *
  1060. * Allow this call even if the handle has aborted --- it may be part of
  1061. * the caller's cleanup after an abort.
  1062. */
  1063. int journal_forget (handle_t *handle, struct buffer_head *bh)
  1064. {
  1065. transaction_t *transaction = handle->h_transaction;
  1066. journal_t *journal = transaction->t_journal;
  1067. struct journal_head *jh;
  1068. int drop_reserve = 0;
  1069. int err = 0;
  1070. BUFFER_TRACE(bh, "entry");
  1071. jbd_lock_bh_state(bh);
  1072. spin_lock(&journal->j_list_lock);
  1073. if (!buffer_jbd(bh))
  1074. goto not_jbd;
  1075. jh = bh2jh(bh);
  1076. /* Critical error: attempting to delete a bitmap buffer, maybe?
  1077. * Don't do any jbd operations, and return an error. */
  1078. if (!J_EXPECT_JH(jh, !jh->b_committed_data,
  1079. "inconsistent data on disk")) {
  1080. err = -EIO;
  1081. goto not_jbd;
  1082. }
  1083. /*
  1084. * The buffer's going from the transaction, we must drop
  1085. * all references -bzzz
  1086. */
  1087. jh->b_modified = 0;
  1088. if (jh->b_transaction == handle->h_transaction) {
  1089. J_ASSERT_JH(jh, !jh->b_frozen_data);
  1090. /* If we are forgetting a buffer which is already part
  1091. * of this transaction, then we can just drop it from
  1092. * the transaction immediately. */
  1093. clear_buffer_dirty(bh);
  1094. clear_buffer_jbddirty(bh);
  1095. JBUFFER_TRACE(jh, "belongs to current transaction: unfile");
  1096. drop_reserve = 1;
  1097. /*
  1098. * We are no longer going to journal this buffer.
  1099. * However, the commit of this transaction is still
  1100. * important to the buffer: the delete that we are now
  1101. * processing might obsolete an old log entry, so by
  1102. * committing, we can satisfy the buffer's checkpoint.
  1103. *
  1104. * So, if we have a checkpoint on the buffer, we should
  1105. * now refile the buffer on our BJ_Forget list so that
  1106. * we know to remove the checkpoint after we commit.
  1107. */
  1108. if (jh->b_cp_transaction) {
  1109. __journal_temp_unlink_buffer(jh);
  1110. __journal_file_buffer(jh, transaction, BJ_Forget);
  1111. } else {
  1112. __journal_unfile_buffer(jh);
  1113. journal_remove_journal_head(bh);
  1114. __brelse(bh);
  1115. if (!buffer_jbd(bh)) {
  1116. spin_unlock(&journal->j_list_lock);
  1117. jbd_unlock_bh_state(bh);
  1118. __bforget(bh);
  1119. goto drop;
  1120. }
  1121. }
  1122. } else if (jh->b_transaction) {
  1123. J_ASSERT_JH(jh, (jh->b_transaction ==
  1124. journal->j_committing_transaction));
  1125. /* However, if the buffer is still owned by a prior
  1126. * (committing) transaction, we can't drop it yet... */
  1127. JBUFFER_TRACE(jh, "belongs to older transaction");
  1128. /* ... but we CAN drop it from the new transaction if we
  1129. * have also modified it since the original commit. */
  1130. if (jh->b_next_transaction) {
  1131. J_ASSERT(jh->b_next_transaction == transaction);
  1132. jh->b_next_transaction = NULL;
  1133. drop_reserve = 1;
  1134. }
  1135. }
  1136. not_jbd:
  1137. spin_unlock(&journal->j_list_lock);
  1138. jbd_unlock_bh_state(bh);
  1139. __brelse(bh);
  1140. drop:
  1141. if (drop_reserve) {
  1142. /* no need to reserve log space for this block -bzzz */
  1143. handle->h_buffer_credits++;
  1144. }
  1145. return err;
  1146. }
  1147. /**
  1148. * int journal_stop() - complete a transaction
  1149. * @handle: tranaction to complete.
  1150. *
  1151. * All done for a particular handle.
  1152. *
  1153. * There is not much action needed here. We just return any remaining
  1154. * buffer credits to the transaction and remove the handle. The only
  1155. * complication is that we need to start a commit operation if the
  1156. * filesystem is marked for synchronous update.
  1157. *
  1158. * journal_stop itself will not usually return an error, but it may
  1159. * do so in unusual circumstances. In particular, expect it to
  1160. * return -EIO if a journal_abort has been executed since the
  1161. * transaction began.
  1162. */
  1163. int journal_stop(handle_t *handle)
  1164. {
  1165. transaction_t *transaction = handle->h_transaction;
  1166. journal_t *journal = transaction->t_journal;
  1167. int old_handle_count, err;
  1168. J_ASSERT(transaction->t_updates > 0);
  1169. J_ASSERT(journal_current_handle() == handle);
  1170. if (is_handle_aborted(handle))
  1171. err = -EIO;
  1172. else
  1173. err = 0;
  1174. if (--handle->h_ref > 0) {
  1175. jbd_debug(4, "h_ref %d -> %d\n", handle->h_ref + 1,
  1176. handle->h_ref);
  1177. return err;
  1178. }
  1179. jbd_debug(4, "Handle %p going down\n", handle);
  1180. /*
  1181. * Implement synchronous transaction batching. If the handle
  1182. * was synchronous, don't force a commit immediately. Let's
  1183. * yield and let another thread piggyback onto this transaction.
  1184. * Keep doing that while new threads continue to arrive.
  1185. * It doesn't cost much - we're about to run a commit and sleep
  1186. * on IO anyway. Speeds up many-threaded, many-dir operations
  1187. * by 30x or more...
  1188. */
  1189. if (handle->h_sync) {
  1190. do {
  1191. old_handle_count = transaction->t_handle_count;
  1192. schedule_timeout_uninterruptible(1);
  1193. } while (old_handle_count != transaction->t_handle_count);
  1194. }
  1195. current->journal_info = NULL;
  1196. spin_lock(&journal->j_state_lock);
  1197. spin_lock(&transaction->t_handle_lock);
  1198. transaction->t_outstanding_credits -= handle->h_buffer_credits;
  1199. transaction->t_updates--;
  1200. if (!transaction->t_updates) {
  1201. wake_up(&journal->j_wait_updates);
  1202. if (journal->j_barrier_count)
  1203. wake_up(&journal->j_wait_transaction_locked);
  1204. }
  1205. /*
  1206. * If the handle is marked SYNC, we need to set another commit
  1207. * going! We also want to force a commit if the current
  1208. * transaction is occupying too much of the log, or if the
  1209. * transaction is too old now.
  1210. */
  1211. if (handle->h_sync ||
  1212. transaction->t_outstanding_credits >
  1213. journal->j_max_transaction_buffers ||
  1214. time_after_eq(jiffies, transaction->t_expires)) {
  1215. /* Do this even for aborted journals: an abort still
  1216. * completes the commit thread, it just doesn't write
  1217. * anything to disk. */
  1218. tid_t tid = transaction->t_tid;
  1219. spin_unlock(&transaction->t_handle_lock);
  1220. jbd_debug(2, "transaction too old, requesting commit for "
  1221. "handle %p\n", handle);
  1222. /* This is non-blocking */
  1223. __log_start_commit(journal, transaction->t_tid);
  1224. spin_unlock(&journal->j_state_lock);
  1225. /*
  1226. * Special case: JFS_SYNC synchronous updates require us
  1227. * to wait for the commit to complete.
  1228. */
  1229. if (handle->h_sync && !(current->flags & PF_MEMALLOC))
  1230. err = log_wait_commit(journal, tid);
  1231. } else {
  1232. spin_unlock(&transaction->t_handle_lock);
  1233. spin_unlock(&journal->j_state_lock);
  1234. }
  1235. jbd_free_handle(handle);
  1236. return err;
  1237. }
  1238. /**int journal_force_commit() - force any uncommitted transactions
  1239. * @journal: journal to force
  1240. *
  1241. * For synchronous operations: force any uncommitted transactions
  1242. * to disk. May seem kludgy, but it reuses all the handle batching
  1243. * code in a very simple manner.
  1244. */
  1245. int journal_force_commit(journal_t *journal)
  1246. {
  1247. handle_t *handle;
  1248. int ret;
  1249. handle = journal_start(journal, 1);
  1250. if (IS_ERR(handle)) {
  1251. ret = PTR_ERR(handle);
  1252. } else {
  1253. handle->h_sync = 1;
  1254. ret = journal_stop(handle);
  1255. }
  1256. return ret;
  1257. }
  1258. /*
  1259. *
  1260. * List management code snippets: various functions for manipulating the
  1261. * transaction buffer lists.
  1262. *
  1263. */
  1264. /*
  1265. * Append a buffer to a transaction list, given the transaction's list head
  1266. * pointer.
  1267. *
  1268. * j_list_lock is held.
  1269. *
  1270. * jbd_lock_bh_state(jh2bh(jh)) is held.
  1271. */
  1272. static inline void
  1273. __blist_add_buffer(struct journal_head **list, struct journal_head *jh)
  1274. {
  1275. if (!*list) {
  1276. jh->b_tnext = jh->b_tprev = jh;
  1277. *list = jh;
  1278. } else {
  1279. /* Insert at the tail of the list to preserve order */
  1280. struct journal_head *first = *list, *last = first->b_tprev;
  1281. jh->b_tprev = last;
  1282. jh->b_tnext = first;
  1283. last->b_tnext = first->b_tprev = jh;
  1284. }
  1285. }
  1286. /*
  1287. * Remove a buffer from a transaction list, given the transaction's list
  1288. * head pointer.
  1289. *
  1290. * Called with j_list_lock held, and the journal may not be locked.
  1291. *
  1292. * jbd_lock_bh_state(jh2bh(jh)) is held.
  1293. */
  1294. static inline void
  1295. __blist_del_buffer(struct journal_head **list, struct journal_head *jh)
  1296. {
  1297. if (*list == jh) {
  1298. *list = jh->b_tnext;
  1299. if (*list == jh)
  1300. *list = NULL;
  1301. }
  1302. jh->b_tprev->b_tnext = jh->b_tnext;
  1303. jh->b_tnext->b_tprev = jh->b_tprev;
  1304. }
  1305. /*
  1306. * Remove a buffer from the appropriate transaction list.
  1307. *
  1308. * Note that this function can *change* the value of
  1309. * bh->b_transaction->t_sync_datalist, t_buffers, t_forget,
  1310. * t_iobuf_list, t_shadow_list, t_log_list or t_reserved_list. If the caller
  1311. * is holding onto a copy of one of thee pointers, it could go bad.
  1312. * Generally the caller needs to re-read the pointer from the transaction_t.
  1313. *
  1314. * Called under j_list_lock. The journal may not be locked.
  1315. */
  1316. void __journal_temp_unlink_buffer(struct journal_head *jh)
  1317. {
  1318. struct journal_head **list = NULL;
  1319. transaction_t *transaction;
  1320. struct buffer_head *bh = jh2bh(jh);
  1321. J_ASSERT_JH(jh, jbd_is_locked_bh_state(bh));
  1322. transaction = jh->b_transaction;
  1323. if (transaction)
  1324. assert_spin_locked(&transaction->t_journal->j_list_lock);
  1325. J_ASSERT_JH(jh, jh->b_jlist < BJ_Types);
  1326. if (jh->b_jlist != BJ_None)
  1327. J_ASSERT_JH(jh, transaction != 0);
  1328. switch (jh->b_jlist) {
  1329. case BJ_None:
  1330. return;
  1331. case BJ_SyncData:
  1332. list = &transaction->t_sync_datalist;
  1333. break;
  1334. case BJ_Metadata:
  1335. transaction->t_nr_buffers--;
  1336. J_ASSERT_JH(jh, transaction->t_nr_buffers >= 0);
  1337. list = &transaction->t_buffers;
  1338. break;
  1339. case BJ_Forget:
  1340. list = &transaction->t_forget;
  1341. break;
  1342. case BJ_IO:
  1343. list = &transaction->t_iobuf_list;
  1344. break;
  1345. case BJ_Shadow:
  1346. list = &transaction->t_shadow_list;
  1347. break;
  1348. case BJ_LogCtl:
  1349. list = &transaction->t_log_list;
  1350. break;
  1351. case BJ_Reserved:
  1352. list = &transaction->t_reserved_list;
  1353. break;
  1354. case BJ_Locked:
  1355. list = &transaction->t_locked_list;
  1356. break;
  1357. }
  1358. __blist_del_buffer(list, jh);
  1359. jh->b_jlist = BJ_None;
  1360. if (test_clear_buffer_jbddirty(bh))
  1361. mark_buffer_dirty(bh); /* Expose it to the VM */
  1362. }
  1363. void __journal_unfile_buffer(struct journal_head *jh)
  1364. {
  1365. __journal_temp_unlink_buffer(jh);
  1366. jh->b_transaction = NULL;
  1367. }
  1368. void journal_unfile_buffer(journal_t *journal, struct journal_head *jh)
  1369. {
  1370. jbd_lock_bh_state(jh2bh(jh));
  1371. spin_lock(&journal->j_list_lock);
  1372. __journal_unfile_buffer(jh);
  1373. spin_unlock(&journal->j_list_lock);
  1374. jbd_unlock_bh_state(jh2bh(jh));
  1375. }
  1376. /*
  1377. * Called from journal_try_to_free_buffers().
  1378. *
  1379. * Called under jbd_lock_bh_state(bh)
  1380. */
  1381. static void
  1382. __journal_try_to_free_buffer(journal_t *journal, struct buffer_head *bh)
  1383. {
  1384. struct journal_head *jh;
  1385. jh = bh2jh(bh);
  1386. if (buffer_locked(bh) || buffer_dirty(bh))
  1387. goto out;
  1388. if (jh->b_next_transaction != 0)
  1389. goto out;
  1390. spin_lock(&journal->j_list_lock);
  1391. if (jh->b_transaction != 0 && jh->b_cp_transaction == 0) {
  1392. if (jh->b_jlist == BJ_SyncData || jh->b_jlist == BJ_Locked) {
  1393. /* A written-back ordered data buffer */
  1394. JBUFFER_TRACE(jh, "release data");
  1395. __journal_unfile_buffer(jh);
  1396. journal_remove_journal_head(bh);
  1397. __brelse(bh);
  1398. }
  1399. } else if (jh->b_cp_transaction != 0 && jh->b_transaction == 0) {
  1400. /* written-back checkpointed metadata buffer */
  1401. if (jh->b_jlist == BJ_None) {
  1402. JBUFFER_TRACE(jh, "remove from checkpoint list");
  1403. __journal_remove_checkpoint(jh);
  1404. journal_remove_journal_head(bh);
  1405. __brelse(bh);
  1406. }
  1407. }
  1408. spin_unlock(&journal->j_list_lock);
  1409. out:
  1410. return;
  1411. }
  1412. /**
  1413. * int journal_try_to_free_buffers() - try to free page buffers.
  1414. * @journal: journal for operation
  1415. * @page: to try and free
  1416. * @unused_gfp_mask: unused
  1417. *
  1418. *
  1419. * For all the buffers on this page,
  1420. * if they are fully written out ordered data, move them onto BUF_CLEAN
  1421. * so try_to_free_buffers() can reap them.
  1422. *
  1423. * This function returns non-zero if we wish try_to_free_buffers()
  1424. * to be called. We do this if the page is releasable by try_to_free_buffers().
  1425. * We also do it if the page has locked or dirty buffers and the caller wants
  1426. * us to perform sync or async writeout.
  1427. *
  1428. * This complicates JBD locking somewhat. We aren't protected by the
  1429. * BKL here. We wish to remove the buffer from its committing or
  1430. * running transaction's ->t_datalist via __journal_unfile_buffer.
  1431. *
  1432. * This may *change* the value of transaction_t->t_datalist, so anyone
  1433. * who looks at t_datalist needs to lock against this function.
  1434. *
  1435. * Even worse, someone may be doing a journal_dirty_data on this
  1436. * buffer. So we need to lock against that. journal_dirty_data()
  1437. * will come out of the lock with the buffer dirty, which makes it
  1438. * ineligible for release here.
  1439. *
  1440. * Who else is affected by this? hmm... Really the only contender
  1441. * is do_get_write_access() - it could be looking at the buffer while
  1442. * journal_try_to_free_buffer() is changing its state. But that
  1443. * cannot happen because we never reallocate freed data as metadata
  1444. * while the data is part of a transaction. Yes?
  1445. */
  1446. int journal_try_to_free_buffers(journal_t *journal,
  1447. struct page *page, int unused_gfp_mask)
  1448. {
  1449. struct buffer_head *head;
  1450. struct buffer_head *bh;
  1451. int ret = 0;
  1452. J_ASSERT(PageLocked(page));
  1453. head = page_buffers(page);
  1454. bh = head;
  1455. do {
  1456. struct journal_head *jh;
  1457. /*
  1458. * We take our own ref against the journal_head here to avoid
  1459. * having to add tons of locking around each instance of
  1460. * journal_remove_journal_head() and journal_put_journal_head().
  1461. */
  1462. jh = journal_grab_journal_head(bh);
  1463. if (!jh)
  1464. continue;
  1465. jbd_lock_bh_state(bh);
  1466. __journal_try_to_free_buffer(journal, bh);
  1467. journal_put_journal_head(jh);
  1468. jbd_unlock_bh_state(bh);
  1469. if (buffer_jbd(bh))
  1470. goto busy;
  1471. } while ((bh = bh->b_this_page) != head);
  1472. ret = try_to_free_buffers(page);
  1473. busy:
  1474. return ret;
  1475. }
  1476. /*
  1477. * This buffer is no longer needed. If it is on an older transaction's
  1478. * checkpoint list we need to record it on this transaction's forget list
  1479. * to pin this buffer (and hence its checkpointing transaction) down until
  1480. * this transaction commits. If the buffer isn't on a checkpoint list, we
  1481. * release it.
  1482. * Returns non-zero if JBD no longer has an interest in the buffer.
  1483. *
  1484. * Called under j_list_lock.
  1485. *
  1486. * Called under jbd_lock_bh_state(bh).
  1487. */
  1488. static int __dispose_buffer(struct journal_head *jh, transaction_t *transaction)
  1489. {
  1490. int may_free = 1;
  1491. struct buffer_head *bh = jh2bh(jh);
  1492. __journal_unfile_buffer(jh);
  1493. if (jh->b_cp_transaction) {
  1494. JBUFFER_TRACE(jh, "on running+cp transaction");
  1495. __journal_file_buffer(jh, transaction, BJ_Forget);
  1496. clear_buffer_jbddirty(bh);
  1497. may_free = 0;
  1498. } else {
  1499. JBUFFER_TRACE(jh, "on running transaction");
  1500. journal_remove_journal_head(bh);
  1501. __brelse(bh);
  1502. }
  1503. return may_free;
  1504. }
  1505. /*
  1506. * journal_invalidatepage
  1507. *
  1508. * This code is tricky. It has a number of cases to deal with.
  1509. *
  1510. * There are two invariants which this code relies on:
  1511. *
  1512. * i_size must be updated on disk before we start calling invalidatepage on the
  1513. * data.
  1514. *
  1515. * This is done in ext3 by defining an ext3_setattr method which
  1516. * updates i_size before truncate gets going. By maintaining this
  1517. * invariant, we can be sure that it is safe to throw away any buffers
  1518. * attached to the current transaction: once the transaction commits,
  1519. * we know that the data will not be needed.
  1520. *
  1521. * Note however that we can *not* throw away data belonging to the
  1522. * previous, committing transaction!
  1523. *
  1524. * Any disk blocks which *are* part of the previous, committing
  1525. * transaction (and which therefore cannot be discarded immediately) are
  1526. * not going to be reused in the new running transaction
  1527. *
  1528. * The bitmap committed_data images guarantee this: any block which is
  1529. * allocated in one transaction and removed in the next will be marked
  1530. * as in-use in the committed_data bitmap, so cannot be reused until
  1531. * the next transaction to delete the block commits. This means that
  1532. * leaving committing buffers dirty is quite safe: the disk blocks
  1533. * cannot be reallocated to a different file and so buffer aliasing is
  1534. * not possible.
  1535. *
  1536. *
  1537. * The above applies mainly to ordered data mode. In writeback mode we
  1538. * don't make guarantees about the order in which data hits disk --- in
  1539. * particular we don't guarantee that new dirty data is flushed before
  1540. * transaction commit --- so it is always safe just to discard data
  1541. * immediately in that mode. --sct
  1542. */
  1543. /*
  1544. * The journal_unmap_buffer helper function returns zero if the buffer
  1545. * concerned remains pinned as an anonymous buffer belonging to an older
  1546. * transaction.
  1547. *
  1548. * We're outside-transaction here. Either or both of j_running_transaction
  1549. * and j_committing_transaction may be NULL.
  1550. */
  1551. static int journal_unmap_buffer(journal_t *journal, struct buffer_head *bh)
  1552. {
  1553. transaction_t *transaction;
  1554. struct journal_head *jh;
  1555. int may_free = 1;
  1556. int ret;
  1557. BUFFER_TRACE(bh, "entry");
  1558. /*
  1559. * It is safe to proceed here without the j_list_lock because the
  1560. * buffers cannot be stolen by try_to_free_buffers as long as we are
  1561. * holding the page lock. --sct
  1562. */
  1563. if (!buffer_jbd(bh))
  1564. goto zap_buffer_unlocked;
  1565. spin_lock(&journal->j_state_lock);
  1566. jbd_lock_bh_state(bh);
  1567. spin_lock(&journal->j_list_lock);
  1568. jh = journal_grab_journal_head(bh);
  1569. if (!jh)
  1570. goto zap_buffer_no_jh;
  1571. transaction = jh->b_transaction;
  1572. if (transaction == NULL) {
  1573. /* First case: not on any transaction. If it
  1574. * has no checkpoint link, then we can zap it:
  1575. * it's a writeback-mode buffer so we don't care
  1576. * if it hits disk safely. */
  1577. if (!jh->b_cp_transaction) {
  1578. JBUFFER_TRACE(jh, "not on any transaction: zap");
  1579. goto zap_buffer;
  1580. }
  1581. if (!buffer_dirty(bh)) {
  1582. /* bdflush has written it. We can drop it now */
  1583. goto zap_buffer;
  1584. }
  1585. /* OK, it must be in the journal but still not
  1586. * written fully to disk: it's metadata or
  1587. * journaled data... */
  1588. if (journal->j_running_transaction) {
  1589. /* ... and once the current transaction has
  1590. * committed, the buffer won't be needed any
  1591. * longer. */
  1592. JBUFFER_TRACE(jh, "checkpointed: add to BJ_Forget");
  1593. ret = __dispose_buffer(jh,
  1594. journal->j_running_transaction);
  1595. journal_put_journal_head(jh);
  1596. spin_unlock(&journal->j_list_lock);
  1597. jbd_unlock_bh_state(bh);
  1598. spin_unlock(&journal->j_state_lock);
  1599. return ret;
  1600. } else {
  1601. /* There is no currently-running transaction. So the
  1602. * orphan record which we wrote for this file must have
  1603. * passed into commit. We must attach this buffer to
  1604. * the committing transaction, if it exists. */
  1605. if (journal->j_committing_transaction) {
  1606. JBUFFER_TRACE(jh, "give to committing trans");
  1607. ret = __dispose_buffer(jh,
  1608. journal->j_committing_transaction);
  1609. journal_put_journal_head(jh);
  1610. spin_unlock(&journal->j_list_lock);
  1611. jbd_unlock_bh_state(bh);
  1612. spin_unlock(&journal->j_state_lock);
  1613. return ret;
  1614. } else {
  1615. /* The orphan record's transaction has
  1616. * committed. We can cleanse this buffer */
  1617. clear_buffer_jbddirty(bh);
  1618. goto zap_buffer;
  1619. }
  1620. }
  1621. } else if (transaction == journal->j_committing_transaction) {
  1622. if (jh->b_jlist == BJ_Locked) {
  1623. /*
  1624. * The buffer is on the committing transaction's locked
  1625. * list. We have the buffer locked, so I/O has
  1626. * completed. So we can nail the buffer now.
  1627. */
  1628. may_free = __dispose_buffer(jh, transaction);
  1629. goto zap_buffer;
  1630. }
  1631. /*
  1632. * If it is committing, we simply cannot touch it. We
  1633. * can remove it's next_transaction pointer from the
  1634. * running transaction if that is set, but nothing
  1635. * else. */
  1636. JBUFFER_TRACE(jh, "on committing transaction");
  1637. set_buffer_freed(bh);
  1638. if (jh->b_next_transaction) {
  1639. J_ASSERT(jh->b_next_transaction ==
  1640. journal->j_running_transaction);
  1641. jh->b_next_transaction = NULL;
  1642. }
  1643. journal_put_journal_head(jh);
  1644. spin_unlock(&journal->j_list_lock);
  1645. jbd_unlock_bh_state(bh);
  1646. spin_unlock(&journal->j_state_lock);
  1647. return 0;
  1648. } else {
  1649. /* Good, the buffer belongs to the running transaction.
  1650. * We are writing our own transaction's data, not any
  1651. * previous one's, so it is safe to throw it away
  1652. * (remember that we expect the filesystem to have set
  1653. * i_size already for this truncate so recovery will not
  1654. * expose the disk blocks we are discarding here.) */
  1655. J_ASSERT_JH(jh, transaction == journal->j_running_transaction);
  1656. may_free = __dispose_buffer(jh, transaction);
  1657. }
  1658. zap_buffer:
  1659. journal_put_journal_head(jh);
  1660. zap_buffer_no_jh:
  1661. spin_unlock(&journal->j_list_lock);
  1662. jbd_unlock_bh_state(bh);
  1663. spin_unlock(&journal->j_state_lock);
  1664. zap_buffer_unlocked:
  1665. clear_buffer_dirty(bh);
  1666. J_ASSERT_BH(bh, !buffer_jbddirty(bh));
  1667. clear_buffer_mapped(bh);
  1668. clear_buffer_req(bh);
  1669. clear_buffer_new(bh);
  1670. bh->b_bdev = NULL;
  1671. return may_free;
  1672. }
  1673. /**
  1674. * int journal_invalidatepage()
  1675. * @journal: journal to use for flush...
  1676. * @page: page to flush
  1677. * @offset: length of page to invalidate.
  1678. *
  1679. * Reap page buffers containing data after offset in page.
  1680. *
  1681. * Return non-zero if the page's buffers were successfully reaped.
  1682. */
  1683. int journal_invalidatepage(journal_t *journal,
  1684. struct page *page,
  1685. unsigned long offset)
  1686. {
  1687. struct buffer_head *head, *bh, *next;
  1688. unsigned int curr_off = 0;
  1689. int may_free = 1;
  1690. if (!PageLocked(page))
  1691. BUG();
  1692. if (!page_has_buffers(page))
  1693. return 1;
  1694. /* We will potentially be playing with lists other than just the
  1695. * data lists (especially for journaled data mode), so be
  1696. * cautious in our locking. */
  1697. head = bh = page_buffers(page);
  1698. do {
  1699. unsigned int next_off = curr_off + bh->b_size;
  1700. next = bh->b_this_page;
  1701. if (offset <= curr_off) {
  1702. /* This block is wholly outside the truncation point */
  1703. lock_buffer(bh);
  1704. may_free &= journal_unmap_buffer(journal, bh);
  1705. unlock_buffer(bh);
  1706. }
  1707. curr_off = next_off;
  1708. bh = next;
  1709. } while (bh != head);
  1710. if (!offset) {
  1711. if (!may_free || !try_to_free_buffers(page))
  1712. return 0;
  1713. J_ASSERT(!page_has_buffers(page));
  1714. }
  1715. return 1;
  1716. }
  1717. /*
  1718. * File a buffer on the given transaction list.
  1719. */
  1720. void __journal_file_buffer(struct journal_head *jh,
  1721. transaction_t *transaction, int jlist)
  1722. {
  1723. struct journal_head **list = NULL;
  1724. int was_dirty = 0;
  1725. struct buffer_head *bh = jh2bh(jh);
  1726. J_ASSERT_JH(jh, jbd_is_locked_bh_state(bh));
  1727. assert_spin_locked(&transaction->t_journal->j_list_lock);
  1728. J_ASSERT_JH(jh, jh->b_jlist < BJ_Types);
  1729. J_ASSERT_JH(jh, jh->b_transaction == transaction ||
  1730. jh->b_transaction == 0);
  1731. if (jh->b_transaction && jh->b_jlist == jlist)
  1732. return;
  1733. /* The following list of buffer states needs to be consistent
  1734. * with __jbd_unexpected_dirty_buffer()'s handling of dirty
  1735. * state. */
  1736. if (jlist == BJ_Metadata || jlist == BJ_Reserved ||
  1737. jlist == BJ_Shadow || jlist == BJ_Forget) {
  1738. if (test_clear_buffer_dirty(bh) ||
  1739. test_clear_buffer_jbddirty(bh))
  1740. was_dirty = 1;
  1741. }
  1742. if (jh->b_transaction)
  1743. __journal_temp_unlink_buffer(jh);
  1744. jh->b_transaction = transaction;
  1745. switch (jlist) {
  1746. case BJ_None:
  1747. J_ASSERT_JH(jh, !jh->b_committed_data);
  1748. J_ASSERT_JH(jh, !jh->b_frozen_data);
  1749. return;
  1750. case BJ_SyncData:
  1751. list = &transaction->t_sync_datalist;
  1752. break;
  1753. case BJ_Metadata:
  1754. transaction->t_nr_buffers++;
  1755. list = &transaction->t_buffers;
  1756. break;
  1757. case BJ_Forget:
  1758. list = &transaction->t_forget;
  1759. break;
  1760. case BJ_IO:
  1761. list = &transaction->t_iobuf_list;
  1762. break;
  1763. case BJ_Shadow:
  1764. list = &transaction->t_shadow_list;
  1765. break;
  1766. case BJ_LogCtl:
  1767. list = &transaction->t_log_list;
  1768. break;
  1769. case BJ_Reserved:
  1770. list = &transaction->t_reserved_list;
  1771. break;
  1772. case BJ_Locked:
  1773. list = &transaction->t_locked_list;
  1774. break;
  1775. }
  1776. __blist_add_buffer(list, jh);
  1777. jh->b_jlist = jlist;
  1778. if (was_dirty)
  1779. set_buffer_jbddirty(bh);
  1780. }
  1781. void journal_file_buffer(struct journal_head *jh,
  1782. transaction_t *transaction, int jlist)
  1783. {
  1784. jbd_lock_bh_state(jh2bh(jh));
  1785. spin_lock(&transaction->t_journal->j_list_lock);
  1786. __journal_file_buffer(jh, transaction, jlist);
  1787. spin_unlock(&transaction->t_journal->j_list_lock);
  1788. jbd_unlock_bh_state(jh2bh(jh));
  1789. }
  1790. /*
  1791. * Remove a buffer from its current buffer list in preparation for
  1792. * dropping it from its current transaction entirely. If the buffer has
  1793. * already started to be used by a subsequent transaction, refile the
  1794. * buffer on that transaction's metadata list.
  1795. *
  1796. * Called under journal->j_list_lock
  1797. *
  1798. * Called under jbd_lock_bh_state(jh2bh(jh))
  1799. */
  1800. void __journal_refile_buffer(struct journal_head *jh)
  1801. {
  1802. int was_dirty;
  1803. struct buffer_head *bh = jh2bh(jh);
  1804. J_ASSERT_JH(jh, jbd_is_locked_bh_state(bh));
  1805. if (jh->b_transaction)
  1806. assert_spin_locked(&jh->b_transaction->t_journal->j_list_lock);
  1807. /* If the buffer is now unused, just drop it. */
  1808. if (jh->b_next_transaction == NULL) {
  1809. __journal_unfile_buffer(jh);
  1810. return;
  1811. }
  1812. /*
  1813. * It has been modified by a later transaction: add it to the new
  1814. * transaction's metadata list.
  1815. */
  1816. was_dirty = test_clear_buffer_jbddirty(bh);
  1817. __journal_temp_unlink_buffer(jh);
  1818. jh->b_transaction = jh->b_next_transaction;
  1819. jh->b_next_transaction = NULL;
  1820. __journal_file_buffer(jh, jh->b_transaction, BJ_Metadata);
  1821. J_ASSERT_JH(jh, jh->b_transaction->t_state == T_RUNNING);
  1822. if (was_dirty)
  1823. set_buffer_jbddirty(bh);
  1824. }
  1825. /*
  1826. * For the unlocked version of this call, also make sure that any
  1827. * hanging journal_head is cleaned up if necessary.
  1828. *
  1829. * __journal_refile_buffer is usually called as part of a single locked
  1830. * operation on a buffer_head, in which the caller is probably going to
  1831. * be hooking the journal_head onto other lists. In that case it is up
  1832. * to the caller to remove the journal_head if necessary. For the
  1833. * unlocked journal_refile_buffer call, the caller isn't going to be
  1834. * doing anything else to the buffer so we need to do the cleanup
  1835. * ourselves to avoid a jh leak.
  1836. *
  1837. * *** The journal_head may be freed by this call! ***
  1838. */
  1839. void journal_refile_buffer(journal_t *journal, struct journal_head *jh)
  1840. {
  1841. struct buffer_head *bh = jh2bh(jh);
  1842. jbd_lock_bh_state(bh);
  1843. spin_lock(&journal->j_list_lock);
  1844. __journal_refile_buffer(jh);
  1845. jbd_unlock_bh_state(bh);
  1846. journal_remove_journal_head(bh);
  1847. spin_unlock(&journal->j_list_lock);
  1848. __brelse(bh);
  1849. }