transaction.c 71 KB

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