transaction.c 62 KB

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