log.c 21 KB

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