transaction.c 62 KB

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