transaction.c 63 KB

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