log.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861
  1. /*
  2. * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
  3. * Copyright (C) 2004-2006 Red Hat, Inc. All rights reserved.
  4. *
  5. * This copyrighted material is made available to anyone wishing to use,
  6. * modify, copy, or redistribute it subject to the terms and conditions
  7. * of the GNU General Public License version 2.
  8. */
  9. #include <linux/sched.h>
  10. #include <linux/slab.h>
  11. #include <linux/spinlock.h>
  12. #include <linux/completion.h>
  13. #include <linux/buffer_head.h>
  14. #include <linux/gfs2_ondisk.h>
  15. #include <linux/crc32.h>
  16. #include <linux/lm_interface.h>
  17. #include <linux/delay.h>
  18. #include "gfs2.h"
  19. #include "incore.h"
  20. #include "bmap.h"
  21. #include "glock.h"
  22. #include "log.h"
  23. #include "lops.h"
  24. #include "meta_io.h"
  25. #include "util.h"
  26. #include "dir.h"
  27. #define PULL 1
  28. /**
  29. * gfs2_struct2blk - compute stuff
  30. * @sdp: the filesystem
  31. * @nstruct: the number of structures
  32. * @ssize: the size of the structures
  33. *
  34. * Compute the number of log descriptor blocks needed to hold a certain number
  35. * of structures of a certain size.
  36. *
  37. * Returns: the number of blocks needed (minimum is always 1)
  38. */
  39. unsigned int gfs2_struct2blk(struct gfs2_sbd *sdp, unsigned int nstruct,
  40. unsigned int ssize)
  41. {
  42. unsigned int blks;
  43. unsigned int first, second;
  44. blks = 1;
  45. first = (sdp->sd_sb.sb_bsize - sizeof(struct gfs2_log_descriptor)) / ssize;
  46. if (nstruct > first) {
  47. second = (sdp->sd_sb.sb_bsize -
  48. sizeof(struct gfs2_meta_header)) / ssize;
  49. blks += DIV_ROUND_UP(nstruct - first, second);
  50. }
  51. return blks;
  52. }
  53. /**
  54. * gfs2_remove_from_ail - Remove an entry from the ail lists, updating counters
  55. * @mapping: The associated mapping (maybe NULL)
  56. * @bd: The gfs2_bufdata to remove
  57. *
  58. * The log lock _must_ be held when calling this function
  59. *
  60. */
  61. void gfs2_remove_from_ail(struct gfs2_bufdata *bd)
  62. {
  63. bd->bd_ail = NULL;
  64. list_del_init(&bd->bd_ail_st_list);
  65. list_del_init(&bd->bd_ail_gl_list);
  66. atomic_dec(&bd->bd_gl->gl_ail_count);
  67. brelse(bd->bd_bh);
  68. }
  69. /**
  70. * gfs2_ail1_start_one - Start I/O on a part of the AIL
  71. * @sdp: the filesystem
  72. * @tr: the part of the AIL
  73. *
  74. */
  75. static void gfs2_ail1_start_one(struct gfs2_sbd *sdp, struct gfs2_ail *ai)
  76. {
  77. struct gfs2_bufdata *bd, *s;
  78. struct buffer_head *bh;
  79. int retry;
  80. BUG_ON(!spin_is_locked(&sdp->sd_log_lock));
  81. do {
  82. retry = 0;
  83. list_for_each_entry_safe_reverse(bd, s, &ai->ai_ail1_list,
  84. bd_ail_st_list) {
  85. bh = bd->bd_bh;
  86. gfs2_assert(sdp, bd->bd_ail == ai);
  87. if (!buffer_busy(bh)) {
  88. if (!buffer_uptodate(bh))
  89. gfs2_io_error_bh(sdp, bh);
  90. list_move(&bd->bd_ail_st_list, &ai->ai_ail2_list);
  91. continue;
  92. }
  93. if (!buffer_dirty(bh))
  94. continue;
  95. list_move(&bd->bd_ail_st_list, &ai->ai_ail1_list);
  96. get_bh(bh);
  97. gfs2_log_unlock(sdp);
  98. lock_buffer(bh);
  99. if (test_clear_buffer_dirty(bh)) {
  100. bh->b_end_io = end_buffer_write_sync;
  101. submit_bh(WRITE, bh);
  102. } else {
  103. unlock_buffer(bh);
  104. brelse(bh);
  105. }
  106. gfs2_log_lock(sdp);
  107. retry = 1;
  108. break;
  109. }
  110. } while (retry);
  111. }
  112. /**
  113. * gfs2_ail1_empty_one - Check whether or not a trans in the AIL has been synced
  114. * @sdp: the filesystem
  115. * @ai: the AIL entry
  116. *
  117. */
  118. static int gfs2_ail1_empty_one(struct gfs2_sbd *sdp, struct gfs2_ail *ai, int flags)
  119. {
  120. struct gfs2_bufdata *bd, *s;
  121. struct buffer_head *bh;
  122. list_for_each_entry_safe_reverse(bd, s, &ai->ai_ail1_list,
  123. bd_ail_st_list) {
  124. bh = bd->bd_bh;
  125. gfs2_assert(sdp, bd->bd_ail == ai);
  126. if (buffer_busy(bh)) {
  127. if (flags & DIO_ALL)
  128. continue;
  129. else
  130. break;
  131. }
  132. if (!buffer_uptodate(bh))
  133. gfs2_io_error_bh(sdp, bh);
  134. list_move(&bd->bd_ail_st_list, &ai->ai_ail2_list);
  135. }
  136. return list_empty(&ai->ai_ail1_list);
  137. }
  138. static void gfs2_ail1_start(struct gfs2_sbd *sdp, int flags)
  139. {
  140. struct list_head *head;
  141. u64 sync_gen;
  142. struct list_head *first;
  143. struct gfs2_ail *first_ai, *ai, *tmp;
  144. int done = 0;
  145. gfs2_log_lock(sdp);
  146. head = &sdp->sd_ail1_list;
  147. if (list_empty(head)) {
  148. gfs2_log_unlock(sdp);
  149. return;
  150. }
  151. sync_gen = sdp->sd_ail_sync_gen++;
  152. first = head->prev;
  153. first_ai = list_entry(first, struct gfs2_ail, ai_list);
  154. first_ai->ai_sync_gen = sync_gen;
  155. gfs2_ail1_start_one(sdp, first_ai); /* This may drop log lock */
  156. if (flags & DIO_ALL)
  157. first = NULL;
  158. while(!done) {
  159. if (first && (head->prev != first ||
  160. gfs2_ail1_empty_one(sdp, first_ai, 0)))
  161. break;
  162. done = 1;
  163. list_for_each_entry_safe_reverse(ai, tmp, head, ai_list) {
  164. if (ai->ai_sync_gen >= sync_gen)
  165. continue;
  166. ai->ai_sync_gen = sync_gen;
  167. gfs2_ail1_start_one(sdp, ai); /* This may drop log lock */
  168. done = 0;
  169. break;
  170. }
  171. }
  172. gfs2_log_unlock(sdp);
  173. }
  174. int gfs2_ail1_empty(struct gfs2_sbd *sdp, int flags)
  175. {
  176. struct gfs2_ail *ai, *s;
  177. int ret;
  178. gfs2_log_lock(sdp);
  179. list_for_each_entry_safe_reverse(ai, s, &sdp->sd_ail1_list, ai_list) {
  180. if (gfs2_ail1_empty_one(sdp, ai, flags))
  181. list_move(&ai->ai_list, &sdp->sd_ail2_list);
  182. else if (!(flags & DIO_ALL))
  183. break;
  184. }
  185. ret = list_empty(&sdp->sd_ail1_list);
  186. gfs2_log_unlock(sdp);
  187. return ret;
  188. }
  189. /**
  190. * gfs2_ail2_empty_one - Check whether or not a trans in the AIL has been synced
  191. * @sdp: the filesystem
  192. * @ai: the AIL entry
  193. *
  194. */
  195. static void gfs2_ail2_empty_one(struct gfs2_sbd *sdp, struct gfs2_ail *ai)
  196. {
  197. struct list_head *head = &ai->ai_ail2_list;
  198. struct gfs2_bufdata *bd;
  199. while (!list_empty(head)) {
  200. bd = list_entry(head->prev, struct gfs2_bufdata,
  201. bd_ail_st_list);
  202. gfs2_assert(sdp, bd->bd_ail == ai);
  203. gfs2_remove_from_ail(bd);
  204. }
  205. }
  206. static void ail2_empty(struct gfs2_sbd *sdp, unsigned int new_tail)
  207. {
  208. struct gfs2_ail *ai, *safe;
  209. unsigned int old_tail = sdp->sd_log_tail;
  210. int wrap = (new_tail < old_tail);
  211. int a, b, rm;
  212. gfs2_log_lock(sdp);
  213. list_for_each_entry_safe(ai, safe, &sdp->sd_ail2_list, ai_list) {
  214. a = (old_tail <= ai->ai_first);
  215. b = (ai->ai_first < new_tail);
  216. rm = (wrap) ? (a || b) : (a && b);
  217. if (!rm)
  218. continue;
  219. gfs2_ail2_empty_one(sdp, ai);
  220. list_del(&ai->ai_list);
  221. gfs2_assert_warn(sdp, list_empty(&ai->ai_ail1_list));
  222. gfs2_assert_warn(sdp, list_empty(&ai->ai_ail2_list));
  223. kfree(ai);
  224. }
  225. gfs2_log_unlock(sdp);
  226. }
  227. /**
  228. * gfs2_log_reserve - Make a log reservation
  229. * @sdp: The GFS2 superblock
  230. * @blks: The number of blocks to reserve
  231. *
  232. * Note that we never give out the last few blocks of the journal. Thats
  233. * due to the fact that there is a small number of header blocks
  234. * associated with each log flush. The exact number can't be known until
  235. * flush time, so we ensure that we have just enough free blocks at all
  236. * times to avoid running out during a log flush.
  237. *
  238. * Returns: errno
  239. */
  240. int gfs2_log_reserve(struct gfs2_sbd *sdp, unsigned int blks)
  241. {
  242. unsigned int try = 0;
  243. unsigned reserved_blks = 6 * (4096 / sdp->sd_vfs->s_blocksize);
  244. if (gfs2_assert_warn(sdp, blks) ||
  245. gfs2_assert_warn(sdp, blks <= sdp->sd_jdesc->jd_blocks))
  246. return -EINVAL;
  247. mutex_lock(&sdp->sd_log_reserve_mutex);
  248. gfs2_log_lock(sdp);
  249. while(sdp->sd_log_blks_free <= (blks + reserved_blks)) {
  250. gfs2_log_unlock(sdp);
  251. gfs2_ail1_empty(sdp, 0);
  252. gfs2_log_flush(sdp, NULL);
  253. if (try++)
  254. gfs2_ail1_start(sdp, 0);
  255. gfs2_log_lock(sdp);
  256. }
  257. sdp->sd_log_blks_free -= blks;
  258. gfs2_log_unlock(sdp);
  259. mutex_unlock(&sdp->sd_log_reserve_mutex);
  260. down_read(&sdp->sd_log_flush_lock);
  261. return 0;
  262. }
  263. /**
  264. * gfs2_log_release - Release a given number of log blocks
  265. * @sdp: The GFS2 superblock
  266. * @blks: The number of blocks
  267. *
  268. */
  269. void gfs2_log_release(struct gfs2_sbd *sdp, unsigned int blks)
  270. {
  271. gfs2_log_lock(sdp);
  272. sdp->sd_log_blks_free += blks;
  273. gfs2_assert_withdraw(sdp,
  274. sdp->sd_log_blks_free <= sdp->sd_jdesc->jd_blocks);
  275. gfs2_log_unlock(sdp);
  276. up_read(&sdp->sd_log_flush_lock);
  277. }
  278. static u64 log_bmap(struct gfs2_sbd *sdp, unsigned int lbn)
  279. {
  280. struct inode *inode = sdp->sd_jdesc->jd_inode;
  281. int error;
  282. struct buffer_head bh_map = { .b_state = 0, .b_blocknr = 0 };
  283. bh_map.b_size = 1 << inode->i_blkbits;
  284. error = gfs2_block_map(inode, lbn, 0, &bh_map);
  285. if (error || !bh_map.b_blocknr)
  286. printk(KERN_INFO "error=%d, dbn=%llu lbn=%u", error,
  287. (unsigned long long)bh_map.b_blocknr, lbn);
  288. gfs2_assert_withdraw(sdp, !error && bh_map.b_blocknr);
  289. return bh_map.b_blocknr;
  290. }
  291. /**
  292. * log_distance - Compute distance between two journal blocks
  293. * @sdp: The GFS2 superblock
  294. * @newer: The most recent journal block of the pair
  295. * @older: The older journal block of the pair
  296. *
  297. * Compute the distance (in the journal direction) between two
  298. * blocks in the journal
  299. *
  300. * Returns: the distance in blocks
  301. */
  302. static inline unsigned int log_distance(struct gfs2_sbd *sdp, unsigned int newer,
  303. unsigned int older)
  304. {
  305. int dist;
  306. dist = newer - older;
  307. if (dist < 0)
  308. dist += sdp->sd_jdesc->jd_blocks;
  309. return dist;
  310. }
  311. /**
  312. * calc_reserved - Calculate the number of blocks to reserve when
  313. * refunding a transaction's unused buffers.
  314. * @sdp: The GFS2 superblock
  315. *
  316. * This is complex. We need to reserve room for all our currently used
  317. * metadata buffers (e.g. normal file I/O rewriting file time stamps) and
  318. * all our journaled data buffers for journaled files (e.g. files in the
  319. * meta_fs like rindex, or files for which chattr +j was done.)
  320. * If we don't reserve enough space, gfs2_log_refund and gfs2_log_flush
  321. * will count it as free space (sd_log_blks_free) and corruption will follow.
  322. *
  323. * We can have metadata bufs and jdata bufs in the same journal. So each
  324. * type gets its own log header, for which we need to reserve a block.
  325. * In fact, each type has the potential for needing more than one header
  326. * in cases where we have more buffers than will fit on a journal page.
  327. * Metadata journal entries take up half the space of journaled buffer entries.
  328. * Thus, metadata entries have buf_limit (502) and journaled buffers have
  329. * databuf_limit (251) before they cause a wrap around.
  330. *
  331. * Also, we need to reserve blocks for revoke journal entries and one for an
  332. * overall header for the lot.
  333. *
  334. * Returns: the number of blocks reserved
  335. */
  336. static unsigned int calc_reserved(struct gfs2_sbd *sdp)
  337. {
  338. unsigned int reserved = 0;
  339. unsigned int mbuf_limit, metabufhdrs_needed;
  340. unsigned int dbuf_limit, databufhdrs_needed;
  341. unsigned int revokes = 0;
  342. mbuf_limit = buf_limit(sdp);
  343. metabufhdrs_needed = (sdp->sd_log_commited_buf +
  344. (mbuf_limit - 1)) / mbuf_limit;
  345. dbuf_limit = databuf_limit(sdp);
  346. databufhdrs_needed = (sdp->sd_log_commited_databuf +
  347. (dbuf_limit - 1)) / dbuf_limit;
  348. if (sdp->sd_log_commited_revoke)
  349. revokes = gfs2_struct2blk(sdp, sdp->sd_log_commited_revoke,
  350. sizeof(u64));
  351. reserved = sdp->sd_log_commited_buf + metabufhdrs_needed +
  352. sdp->sd_log_commited_databuf + databufhdrs_needed +
  353. revokes;
  354. /* One for the overall header */
  355. if (reserved)
  356. reserved++;
  357. return reserved;
  358. }
  359. static unsigned int current_tail(struct gfs2_sbd *sdp)
  360. {
  361. struct gfs2_ail *ai;
  362. unsigned int tail;
  363. gfs2_log_lock(sdp);
  364. if (list_empty(&sdp->sd_ail1_list)) {
  365. tail = sdp->sd_log_head;
  366. } else {
  367. ai = list_entry(sdp->sd_ail1_list.prev, struct gfs2_ail, ai_list);
  368. tail = ai->ai_first;
  369. }
  370. gfs2_log_unlock(sdp);
  371. return tail;
  372. }
  373. void gfs2_log_incr_head(struct gfs2_sbd *sdp)
  374. {
  375. if (sdp->sd_log_flush_head == sdp->sd_log_tail)
  376. BUG_ON(sdp->sd_log_flush_head != sdp->sd_log_head);
  377. if (++sdp->sd_log_flush_head == sdp->sd_jdesc->jd_blocks) {
  378. sdp->sd_log_flush_head = 0;
  379. sdp->sd_log_flush_wrapped = 1;
  380. }
  381. }
  382. /**
  383. * gfs2_log_write_endio - End of I/O for a log buffer
  384. * @bh: The buffer head
  385. * @uptodate: I/O Status
  386. *
  387. */
  388. static void gfs2_log_write_endio(struct buffer_head *bh, int uptodate)
  389. {
  390. struct gfs2_sbd *sdp = bh->b_private;
  391. bh->b_private = NULL;
  392. end_buffer_write_sync(bh, uptodate);
  393. if (atomic_dec_and_test(&sdp->sd_log_in_flight))
  394. wake_up(&sdp->sd_log_flush_wait);
  395. }
  396. /**
  397. * gfs2_log_get_buf - Get and initialize a buffer to use for log control data
  398. * @sdp: The GFS2 superblock
  399. *
  400. * Returns: the buffer_head
  401. */
  402. struct buffer_head *gfs2_log_get_buf(struct gfs2_sbd *sdp)
  403. {
  404. u64 blkno = log_bmap(sdp, sdp->sd_log_flush_head);
  405. struct buffer_head *bh;
  406. bh = sb_getblk(sdp->sd_vfs, blkno);
  407. lock_buffer(bh);
  408. memset(bh->b_data, 0, bh->b_size);
  409. set_buffer_uptodate(bh);
  410. clear_buffer_dirty(bh);
  411. gfs2_log_incr_head(sdp);
  412. atomic_inc(&sdp->sd_log_in_flight);
  413. bh->b_private = sdp;
  414. bh->b_end_io = gfs2_log_write_endio;
  415. return bh;
  416. }
  417. /**
  418. * gfs2_fake_write_endio -
  419. * @bh: The buffer head
  420. * @uptodate: The I/O Status
  421. *
  422. */
  423. static void gfs2_fake_write_endio(struct buffer_head *bh, int uptodate)
  424. {
  425. struct buffer_head *real_bh = bh->b_private;
  426. struct gfs2_bufdata *bd = real_bh->b_private;
  427. struct gfs2_sbd *sdp = bd->bd_gl->gl_sbd;
  428. end_buffer_write_sync(bh, uptodate);
  429. free_buffer_head(bh);
  430. unlock_buffer(real_bh);
  431. brelse(real_bh);
  432. if (atomic_dec_and_test(&sdp->sd_log_in_flight))
  433. wake_up(&sdp->sd_log_flush_wait);
  434. }
  435. /**
  436. * gfs2_log_fake_buf - Build a fake buffer head to write metadata buffer to log
  437. * @sdp: the filesystem
  438. * @data: the data the buffer_head should point to
  439. *
  440. * Returns: the log buffer descriptor
  441. */
  442. struct buffer_head *gfs2_log_fake_buf(struct gfs2_sbd *sdp,
  443. struct buffer_head *real)
  444. {
  445. u64 blkno = log_bmap(sdp, sdp->sd_log_flush_head);
  446. struct buffer_head *bh;
  447. bh = alloc_buffer_head(GFP_NOFS | __GFP_NOFAIL);
  448. atomic_set(&bh->b_count, 1);
  449. bh->b_state = (1 << BH_Mapped) | (1 << BH_Uptodate) | (1 << BH_Lock);
  450. set_bh_page(bh, real->b_page, bh_offset(real));
  451. bh->b_blocknr = blkno;
  452. bh->b_size = sdp->sd_sb.sb_bsize;
  453. bh->b_bdev = sdp->sd_vfs->s_bdev;
  454. bh->b_private = real;
  455. bh->b_end_io = gfs2_fake_write_endio;
  456. gfs2_log_incr_head(sdp);
  457. atomic_inc(&sdp->sd_log_in_flight);
  458. return bh;
  459. }
  460. static void log_pull_tail(struct gfs2_sbd *sdp, unsigned int new_tail)
  461. {
  462. unsigned int dist = log_distance(sdp, new_tail, sdp->sd_log_tail);
  463. ail2_empty(sdp, new_tail);
  464. gfs2_log_lock(sdp);
  465. sdp->sd_log_blks_free += dist;
  466. gfs2_assert_withdraw(sdp, sdp->sd_log_blks_free <= sdp->sd_jdesc->jd_blocks);
  467. gfs2_log_unlock(sdp);
  468. sdp->sd_log_tail = new_tail;
  469. }
  470. /**
  471. * log_write_header - Get and initialize a journal header buffer
  472. * @sdp: The GFS2 superblock
  473. *
  474. * Returns: the initialized log buffer descriptor
  475. */
  476. static void log_write_header(struct gfs2_sbd *sdp, u32 flags, int pull)
  477. {
  478. u64 blkno = log_bmap(sdp, sdp->sd_log_flush_head);
  479. struct buffer_head *bh;
  480. struct gfs2_log_header *lh;
  481. unsigned int tail;
  482. u32 hash;
  483. bh = sb_getblk(sdp->sd_vfs, blkno);
  484. lock_buffer(bh);
  485. memset(bh->b_data, 0, bh->b_size);
  486. set_buffer_uptodate(bh);
  487. clear_buffer_dirty(bh);
  488. unlock_buffer(bh);
  489. gfs2_ail1_empty(sdp, 0);
  490. tail = current_tail(sdp);
  491. lh = (struct gfs2_log_header *)bh->b_data;
  492. memset(lh, 0, sizeof(struct gfs2_log_header));
  493. lh->lh_header.mh_magic = cpu_to_be32(GFS2_MAGIC);
  494. lh->lh_header.mh_type = cpu_to_be32(GFS2_METATYPE_LH);
  495. lh->lh_header.mh_format = cpu_to_be32(GFS2_FORMAT_LH);
  496. lh->lh_sequence = cpu_to_be64(sdp->sd_log_sequence++);
  497. lh->lh_flags = cpu_to_be32(flags);
  498. lh->lh_tail = cpu_to_be32(tail);
  499. lh->lh_blkno = cpu_to_be32(sdp->sd_log_flush_head);
  500. hash = gfs2_disk_hash(bh->b_data, sizeof(struct gfs2_log_header));
  501. lh->lh_hash = cpu_to_be32(hash);
  502. set_buffer_dirty(bh);
  503. if (sync_dirty_buffer(bh))
  504. gfs2_io_error_bh(sdp, bh);
  505. brelse(bh);
  506. if (sdp->sd_log_tail != tail)
  507. log_pull_tail(sdp, tail);
  508. else
  509. gfs2_assert_withdraw(sdp, !pull);
  510. sdp->sd_log_idle = (tail == sdp->sd_log_flush_head);
  511. gfs2_log_incr_head(sdp);
  512. }
  513. static void log_flush_commit(struct gfs2_sbd *sdp)
  514. {
  515. DEFINE_WAIT(wait);
  516. if (atomic_read(&sdp->sd_log_in_flight)) {
  517. do {
  518. prepare_to_wait(&sdp->sd_log_flush_wait, &wait,
  519. TASK_UNINTERRUPTIBLE);
  520. if (atomic_read(&sdp->sd_log_in_flight))
  521. io_schedule();
  522. } while(atomic_read(&sdp->sd_log_in_flight));
  523. finish_wait(&sdp->sd_log_flush_wait, &wait);
  524. }
  525. log_write_header(sdp, 0, 0);
  526. }
  527. static void gfs2_ordered_write(struct gfs2_sbd *sdp)
  528. {
  529. struct gfs2_bufdata *bd;
  530. struct buffer_head *bh;
  531. LIST_HEAD(written);
  532. gfs2_log_lock(sdp);
  533. while (!list_empty(&sdp->sd_log_le_ordered)) {
  534. bd = list_entry(sdp->sd_log_le_ordered.next, struct gfs2_bufdata, bd_le.le_list);
  535. list_move(&bd->bd_le.le_list, &written);
  536. bh = bd->bd_bh;
  537. if (!buffer_dirty(bh))
  538. continue;
  539. get_bh(bh);
  540. gfs2_log_unlock(sdp);
  541. lock_buffer(bh);
  542. if (buffer_mapped(bh) && test_clear_buffer_dirty(bh)) {
  543. bh->b_end_io = end_buffer_write_sync;
  544. submit_bh(WRITE, bh);
  545. } else {
  546. unlock_buffer(bh);
  547. brelse(bh);
  548. }
  549. gfs2_log_lock(sdp);
  550. }
  551. list_splice(&written, &sdp->sd_log_le_ordered);
  552. gfs2_log_unlock(sdp);
  553. }
  554. static void gfs2_ordered_wait(struct gfs2_sbd *sdp)
  555. {
  556. struct gfs2_bufdata *bd;
  557. struct buffer_head *bh;
  558. gfs2_log_lock(sdp);
  559. while (!list_empty(&sdp->sd_log_le_ordered)) {
  560. bd = list_entry(sdp->sd_log_le_ordered.prev, struct gfs2_bufdata, bd_le.le_list);
  561. bh = bd->bd_bh;
  562. if (buffer_locked(bh)) {
  563. get_bh(bh);
  564. gfs2_log_unlock(sdp);
  565. wait_on_buffer(bh);
  566. brelse(bh);
  567. gfs2_log_lock(sdp);
  568. continue;
  569. }
  570. list_del_init(&bd->bd_le.le_list);
  571. }
  572. gfs2_log_unlock(sdp);
  573. }
  574. /**
  575. * gfs2_log_flush - flush incore transaction(s)
  576. * @sdp: the filesystem
  577. * @gl: The glock structure to flush. If NULL, flush the whole incore log
  578. *
  579. */
  580. void __gfs2_log_flush(struct gfs2_sbd *sdp, struct gfs2_glock *gl)
  581. {
  582. struct gfs2_ail *ai;
  583. down_write(&sdp->sd_log_flush_lock);
  584. /* Log might have been flushed while we waited for the flush lock */
  585. if (gl && !test_bit(GLF_LFLUSH, &gl->gl_flags)) {
  586. up_write(&sdp->sd_log_flush_lock);
  587. return;
  588. }
  589. ai = kzalloc(sizeof(struct gfs2_ail), GFP_NOFS | __GFP_NOFAIL);
  590. INIT_LIST_HEAD(&ai->ai_ail1_list);
  591. INIT_LIST_HEAD(&ai->ai_ail2_list);
  592. if (sdp->sd_log_num_buf != sdp->sd_log_commited_buf) {
  593. printk(KERN_INFO "GFS2: log buf %u %u\n", sdp->sd_log_num_buf,
  594. sdp->sd_log_commited_buf);
  595. gfs2_assert_withdraw(sdp, 0);
  596. }
  597. if (sdp->sd_log_num_databuf != sdp->sd_log_commited_databuf) {
  598. printk(KERN_INFO "GFS2: log databuf %u %u\n",
  599. sdp->sd_log_num_databuf, sdp->sd_log_commited_databuf);
  600. gfs2_assert_withdraw(sdp, 0);
  601. }
  602. gfs2_assert_withdraw(sdp,
  603. sdp->sd_log_num_revoke == sdp->sd_log_commited_revoke);
  604. sdp->sd_log_flush_head = sdp->sd_log_head;
  605. sdp->sd_log_flush_wrapped = 0;
  606. ai->ai_first = sdp->sd_log_flush_head;
  607. gfs2_ordered_write(sdp);
  608. lops_before_commit(sdp);
  609. gfs2_ordered_wait(sdp);
  610. if (sdp->sd_log_head != sdp->sd_log_flush_head)
  611. log_flush_commit(sdp);
  612. else if (sdp->sd_log_tail != current_tail(sdp) && !sdp->sd_log_idle){
  613. gfs2_log_lock(sdp);
  614. sdp->sd_log_blks_free--; /* Adjust for unreserved buffer */
  615. gfs2_log_unlock(sdp);
  616. log_write_header(sdp, 0, PULL);
  617. }
  618. lops_after_commit(sdp, ai);
  619. gfs2_log_lock(sdp);
  620. sdp->sd_log_head = sdp->sd_log_flush_head;
  621. sdp->sd_log_blks_reserved = 0;
  622. sdp->sd_log_commited_buf = 0;
  623. sdp->sd_log_commited_databuf = 0;
  624. sdp->sd_log_commited_revoke = 0;
  625. if (!list_empty(&ai->ai_ail1_list)) {
  626. list_add(&ai->ai_list, &sdp->sd_ail1_list);
  627. ai = NULL;
  628. }
  629. gfs2_log_unlock(sdp);
  630. sdp->sd_vfs->s_dirt = 0;
  631. up_write(&sdp->sd_log_flush_lock);
  632. kfree(ai);
  633. }
  634. static void log_refund(struct gfs2_sbd *sdp, struct gfs2_trans *tr)
  635. {
  636. unsigned int reserved;
  637. unsigned int old;
  638. gfs2_log_lock(sdp);
  639. sdp->sd_log_commited_buf += tr->tr_num_buf_new - tr->tr_num_buf_rm;
  640. sdp->sd_log_commited_databuf += tr->tr_num_databuf_new -
  641. tr->tr_num_databuf_rm;
  642. gfs2_assert_withdraw(sdp, (((int)sdp->sd_log_commited_buf) >= 0) ||
  643. (((int)sdp->sd_log_commited_databuf) >= 0));
  644. sdp->sd_log_commited_revoke += tr->tr_num_revoke - tr->tr_num_revoke_rm;
  645. gfs2_assert_withdraw(sdp, ((int)sdp->sd_log_commited_revoke) >= 0);
  646. reserved = calc_reserved(sdp);
  647. old = sdp->sd_log_blks_free;
  648. sdp->sd_log_blks_free += tr->tr_reserved -
  649. (reserved - sdp->sd_log_blks_reserved);
  650. gfs2_assert_withdraw(sdp, sdp->sd_log_blks_free >= old);
  651. gfs2_assert_withdraw(sdp, sdp->sd_log_blks_free <=
  652. sdp->sd_jdesc->jd_blocks);
  653. sdp->sd_log_blks_reserved = reserved;
  654. gfs2_log_unlock(sdp);
  655. }
  656. /**
  657. * gfs2_log_commit - Commit a transaction to the log
  658. * @sdp: the filesystem
  659. * @tr: the transaction
  660. *
  661. * Returns: errno
  662. */
  663. void gfs2_log_commit(struct gfs2_sbd *sdp, struct gfs2_trans *tr)
  664. {
  665. log_refund(sdp, tr);
  666. lops_incore_commit(sdp, tr);
  667. sdp->sd_vfs->s_dirt = 1;
  668. up_read(&sdp->sd_log_flush_lock);
  669. gfs2_log_lock(sdp);
  670. if (sdp->sd_log_num_buf > gfs2_tune_get(sdp, gt_incore_log_blocks))
  671. wake_up_process(sdp->sd_logd_process);
  672. gfs2_log_unlock(sdp);
  673. }
  674. /**
  675. * gfs2_log_shutdown - write a shutdown header into a journal
  676. * @sdp: the filesystem
  677. *
  678. */
  679. void gfs2_log_shutdown(struct gfs2_sbd *sdp)
  680. {
  681. down_write(&sdp->sd_log_flush_lock);
  682. gfs2_assert_withdraw(sdp, !sdp->sd_log_blks_reserved);
  683. gfs2_assert_withdraw(sdp, !sdp->sd_log_num_buf);
  684. gfs2_assert_withdraw(sdp, !sdp->sd_log_num_revoke);
  685. gfs2_assert_withdraw(sdp, !sdp->sd_log_num_rg);
  686. gfs2_assert_withdraw(sdp, !sdp->sd_log_num_databuf);
  687. gfs2_assert_withdraw(sdp, list_empty(&sdp->sd_ail1_list));
  688. sdp->sd_log_flush_head = sdp->sd_log_head;
  689. sdp->sd_log_flush_wrapped = 0;
  690. log_write_header(sdp, GFS2_LOG_HEAD_UNMOUNT,
  691. (sdp->sd_log_tail == current_tail(sdp)) ? 0 : PULL);
  692. gfs2_assert_warn(sdp, sdp->sd_log_blks_free == sdp->sd_jdesc->jd_blocks);
  693. gfs2_assert_warn(sdp, sdp->sd_log_head == sdp->sd_log_tail);
  694. gfs2_assert_warn(sdp, list_empty(&sdp->sd_ail2_list));
  695. sdp->sd_log_head = sdp->sd_log_flush_head;
  696. sdp->sd_log_tail = sdp->sd_log_head;
  697. up_write(&sdp->sd_log_flush_lock);
  698. }
  699. /**
  700. * gfs2_meta_syncfs - sync all the buffers in a filesystem
  701. * @sdp: the filesystem
  702. *
  703. */
  704. void gfs2_meta_syncfs(struct gfs2_sbd *sdp)
  705. {
  706. gfs2_log_flush(sdp, NULL);
  707. for (;;) {
  708. gfs2_ail1_start(sdp, DIO_ALL);
  709. if (gfs2_ail1_empty(sdp, DIO_ALL))
  710. break;
  711. msleep(10);
  712. }
  713. }