log.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973
  1. /*
  2. * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
  3. * Copyright (C) 2004-2007 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/delay.h>
  17. #include <linux/kthread.h>
  18. #include <linux/freezer.h>
  19. #include <linux/bio.h>
  20. #include <linux/writeback.h>
  21. #include "gfs2.h"
  22. #include "incore.h"
  23. #include "bmap.h"
  24. #include "glock.h"
  25. #include "log.h"
  26. #include "lops.h"
  27. #include "meta_io.h"
  28. #include "util.h"
  29. #include "dir.h"
  30. #include "trace_gfs2.h"
  31. #define PULL 1
  32. /**
  33. * gfs2_struct2blk - compute stuff
  34. * @sdp: the filesystem
  35. * @nstruct: the number of structures
  36. * @ssize: the size of the structures
  37. *
  38. * Compute the number of log descriptor blocks needed to hold a certain number
  39. * of structures of a certain size.
  40. *
  41. * Returns: the number of blocks needed (minimum is always 1)
  42. */
  43. unsigned int gfs2_struct2blk(struct gfs2_sbd *sdp, unsigned int nstruct,
  44. unsigned int ssize)
  45. {
  46. unsigned int blks;
  47. unsigned int first, second;
  48. blks = 1;
  49. first = (sdp->sd_sb.sb_bsize - sizeof(struct gfs2_log_descriptor)) / ssize;
  50. if (nstruct > first) {
  51. second = (sdp->sd_sb.sb_bsize -
  52. sizeof(struct gfs2_meta_header)) / ssize;
  53. blks += DIV_ROUND_UP(nstruct - first, second);
  54. }
  55. return blks;
  56. }
  57. /**
  58. * gfs2_remove_from_ail - Remove an entry from the ail lists, updating counters
  59. * @mapping: The associated mapping (maybe NULL)
  60. * @bd: The gfs2_bufdata to remove
  61. *
  62. * The ail lock _must_ be held when calling this function
  63. *
  64. */
  65. void gfs2_remove_from_ail(struct gfs2_bufdata *bd)
  66. {
  67. bd->bd_ail = NULL;
  68. list_del_init(&bd->bd_ail_st_list);
  69. list_del_init(&bd->bd_ail_gl_list);
  70. atomic_dec(&bd->bd_gl->gl_ail_count);
  71. brelse(bd->bd_bh);
  72. }
  73. /**
  74. * gfs2_ail1_start_one - Start I/O on a part of the AIL
  75. * @sdp: the filesystem
  76. * @wbc: The writeback control structure
  77. * @ai: The ail structure
  78. *
  79. */
  80. static int gfs2_ail1_start_one(struct gfs2_sbd *sdp,
  81. struct writeback_control *wbc,
  82. struct gfs2_ail *ai)
  83. __releases(&sdp->sd_ail_lock)
  84. __acquires(&sdp->sd_ail_lock)
  85. {
  86. struct gfs2_glock *gl = NULL;
  87. struct address_space *mapping;
  88. struct gfs2_bufdata *bd, *s;
  89. struct buffer_head *bh;
  90. list_for_each_entry_safe_reverse(bd, s, &ai->ai_ail1_list, bd_ail_st_list) {
  91. bh = bd->bd_bh;
  92. gfs2_assert(sdp, bd->bd_ail == ai);
  93. if (!buffer_busy(bh)) {
  94. if (!buffer_uptodate(bh))
  95. gfs2_io_error_bh(sdp, bh);
  96. list_move(&bd->bd_ail_st_list, &ai->ai_ail2_list);
  97. continue;
  98. }
  99. if (!buffer_dirty(bh))
  100. continue;
  101. if (gl == bd->bd_gl)
  102. continue;
  103. gl = bd->bd_gl;
  104. list_move(&bd->bd_ail_st_list, &ai->ai_ail1_list);
  105. mapping = bh->b_page->mapping;
  106. if (!mapping)
  107. continue;
  108. spin_unlock(&sdp->sd_ail_lock);
  109. generic_writepages(mapping, wbc);
  110. spin_lock(&sdp->sd_ail_lock);
  111. if (wbc->nr_to_write <= 0)
  112. break;
  113. return 1;
  114. }
  115. return 0;
  116. }
  117. /**
  118. * gfs2_ail1_flush - start writeback of some ail1 entries
  119. * @sdp: The super block
  120. * @wbc: The writeback control structure
  121. *
  122. * Writes back some ail1 entries, according to the limits in the
  123. * writeback control structure
  124. */
  125. void gfs2_ail1_flush(struct gfs2_sbd *sdp, struct writeback_control *wbc)
  126. {
  127. struct list_head *head = &sdp->sd_ail1_list;
  128. struct gfs2_ail *ai;
  129. trace_gfs2_ail_flush(sdp, wbc, 1);
  130. spin_lock(&sdp->sd_ail_lock);
  131. restart:
  132. list_for_each_entry_reverse(ai, head, ai_list) {
  133. if (wbc->nr_to_write <= 0)
  134. break;
  135. if (gfs2_ail1_start_one(sdp, wbc, ai))
  136. goto restart;
  137. }
  138. spin_unlock(&sdp->sd_ail_lock);
  139. trace_gfs2_ail_flush(sdp, wbc, 0);
  140. }
  141. /**
  142. * gfs2_ail1_start - start writeback of all ail1 entries
  143. * @sdp: The superblock
  144. */
  145. static void gfs2_ail1_start(struct gfs2_sbd *sdp)
  146. {
  147. struct writeback_control wbc = {
  148. .sync_mode = WB_SYNC_NONE,
  149. .nr_to_write = LONG_MAX,
  150. .range_start = 0,
  151. .range_end = LLONG_MAX,
  152. };
  153. return gfs2_ail1_flush(sdp, &wbc);
  154. }
  155. /**
  156. * gfs2_ail1_empty_one - Check whether or not a trans in the AIL has been synced
  157. * @sdp: the filesystem
  158. * @ai: the AIL entry
  159. *
  160. */
  161. static void gfs2_ail1_empty_one(struct gfs2_sbd *sdp, struct gfs2_ail *ai)
  162. {
  163. struct gfs2_bufdata *bd, *s;
  164. struct buffer_head *bh;
  165. list_for_each_entry_safe_reverse(bd, s, &ai->ai_ail1_list,
  166. bd_ail_st_list) {
  167. bh = bd->bd_bh;
  168. gfs2_assert(sdp, bd->bd_ail == ai);
  169. if (buffer_busy(bh))
  170. continue;
  171. if (!buffer_uptodate(bh))
  172. gfs2_io_error_bh(sdp, bh);
  173. list_move(&bd->bd_ail_st_list, &ai->ai_ail2_list);
  174. }
  175. }
  176. /**
  177. * gfs2_ail1_empty - Try to empty the ail1 lists
  178. * @sdp: The superblock
  179. *
  180. * Tries to empty the ail1 lists, starting with the oldest first
  181. */
  182. static int gfs2_ail1_empty(struct gfs2_sbd *sdp)
  183. {
  184. struct gfs2_ail *ai, *s;
  185. int ret;
  186. spin_lock(&sdp->sd_ail_lock);
  187. list_for_each_entry_safe_reverse(ai, s, &sdp->sd_ail1_list, ai_list) {
  188. gfs2_ail1_empty_one(sdp, ai);
  189. if (list_empty(&ai->ai_ail1_list))
  190. list_move(&ai->ai_list, &sdp->sd_ail2_list);
  191. else
  192. break;
  193. }
  194. ret = list_empty(&sdp->sd_ail1_list);
  195. spin_unlock(&sdp->sd_ail_lock);
  196. return ret;
  197. }
  198. static void gfs2_ail1_wait(struct gfs2_sbd *sdp)
  199. {
  200. struct gfs2_ail *ai;
  201. struct gfs2_bufdata *bd;
  202. struct buffer_head *bh;
  203. spin_lock(&sdp->sd_ail_lock);
  204. list_for_each_entry_reverse(ai, &sdp->sd_ail1_list, ai_list) {
  205. list_for_each_entry(bd, &ai->ai_ail1_list, bd_ail_st_list) {
  206. bh = bd->bd_bh;
  207. if (!buffer_locked(bh))
  208. continue;
  209. get_bh(bh);
  210. spin_unlock(&sdp->sd_ail_lock);
  211. wait_on_buffer(bh);
  212. brelse(bh);
  213. return;
  214. }
  215. }
  216. spin_unlock(&sdp->sd_ail_lock);
  217. }
  218. /**
  219. * gfs2_ail2_empty_one - Check whether or not a trans in the AIL has been synced
  220. * @sdp: the filesystem
  221. * @ai: the AIL entry
  222. *
  223. */
  224. static void gfs2_ail2_empty_one(struct gfs2_sbd *sdp, struct gfs2_ail *ai)
  225. {
  226. struct list_head *head = &ai->ai_ail2_list;
  227. struct gfs2_bufdata *bd;
  228. while (!list_empty(head)) {
  229. bd = list_entry(head->prev, struct gfs2_bufdata,
  230. bd_ail_st_list);
  231. gfs2_assert(sdp, bd->bd_ail == ai);
  232. gfs2_remove_from_ail(bd);
  233. }
  234. }
  235. static void ail2_empty(struct gfs2_sbd *sdp, unsigned int new_tail)
  236. {
  237. struct gfs2_ail *ai, *safe;
  238. unsigned int old_tail = sdp->sd_log_tail;
  239. int wrap = (new_tail < old_tail);
  240. int a, b, rm;
  241. spin_lock(&sdp->sd_ail_lock);
  242. list_for_each_entry_safe(ai, safe, &sdp->sd_ail2_list, ai_list) {
  243. a = (old_tail <= ai->ai_first);
  244. b = (ai->ai_first < new_tail);
  245. rm = (wrap) ? (a || b) : (a && b);
  246. if (!rm)
  247. continue;
  248. gfs2_ail2_empty_one(sdp, ai);
  249. list_del(&ai->ai_list);
  250. gfs2_assert_warn(sdp, list_empty(&ai->ai_ail1_list));
  251. gfs2_assert_warn(sdp, list_empty(&ai->ai_ail2_list));
  252. kfree(ai);
  253. }
  254. spin_unlock(&sdp->sd_ail_lock);
  255. }
  256. /**
  257. * gfs2_log_reserve - Make a log reservation
  258. * @sdp: The GFS2 superblock
  259. * @blks: The number of blocks to reserve
  260. *
  261. * Note that we never give out the last few blocks of the journal. Thats
  262. * due to the fact that there is a small number of header blocks
  263. * associated with each log flush. The exact number can't be known until
  264. * flush time, so we ensure that we have just enough free blocks at all
  265. * times to avoid running out during a log flush.
  266. *
  267. * We no longer flush the log here, instead we wake up logd to do that
  268. * for us. To avoid the thundering herd and to ensure that we deal fairly
  269. * with queued waiters, we use an exclusive wait. This means that when we
  270. * get woken with enough journal space to get our reservation, we need to
  271. * wake the next waiter on the list.
  272. *
  273. * Returns: errno
  274. */
  275. int gfs2_log_reserve(struct gfs2_sbd *sdp, unsigned int blks)
  276. {
  277. unsigned reserved_blks = 6 * (4096 / sdp->sd_vfs->s_blocksize);
  278. unsigned wanted = blks + reserved_blks;
  279. DEFINE_WAIT(wait);
  280. int did_wait = 0;
  281. unsigned int free_blocks;
  282. if (gfs2_assert_warn(sdp, blks) ||
  283. gfs2_assert_warn(sdp, blks <= sdp->sd_jdesc->jd_blocks))
  284. return -EINVAL;
  285. retry:
  286. free_blocks = atomic_read(&sdp->sd_log_blks_free);
  287. if (unlikely(free_blocks <= wanted)) {
  288. do {
  289. prepare_to_wait_exclusive(&sdp->sd_log_waitq, &wait,
  290. TASK_UNINTERRUPTIBLE);
  291. wake_up(&sdp->sd_logd_waitq);
  292. did_wait = 1;
  293. if (atomic_read(&sdp->sd_log_blks_free) <= wanted)
  294. io_schedule();
  295. free_blocks = atomic_read(&sdp->sd_log_blks_free);
  296. } while(free_blocks <= wanted);
  297. finish_wait(&sdp->sd_log_waitq, &wait);
  298. }
  299. if (atomic_cmpxchg(&sdp->sd_log_blks_free, free_blocks,
  300. free_blocks - blks) != free_blocks)
  301. goto retry;
  302. trace_gfs2_log_blocks(sdp, -blks);
  303. /*
  304. * If we waited, then so might others, wake them up _after_ we get
  305. * our share of the log.
  306. */
  307. if (unlikely(did_wait))
  308. wake_up(&sdp->sd_log_waitq);
  309. down_read(&sdp->sd_log_flush_lock);
  310. return 0;
  311. }
  312. static u64 log_bmap(struct gfs2_sbd *sdp, unsigned int lbn)
  313. {
  314. struct gfs2_journal_extent *je;
  315. list_for_each_entry(je, &sdp->sd_jdesc->extent_list, extent_list) {
  316. if (lbn >= je->lblock && lbn < je->lblock + je->blocks)
  317. return je->dblock + lbn - je->lblock;
  318. }
  319. return -1;
  320. }
  321. /**
  322. * log_distance - Compute distance between two journal blocks
  323. * @sdp: The GFS2 superblock
  324. * @newer: The most recent journal block of the pair
  325. * @older: The older journal block of the pair
  326. *
  327. * Compute the distance (in the journal direction) between two
  328. * blocks in the journal
  329. *
  330. * Returns: the distance in blocks
  331. */
  332. static inline unsigned int log_distance(struct gfs2_sbd *sdp, unsigned int newer,
  333. unsigned int older)
  334. {
  335. int dist;
  336. dist = newer - older;
  337. if (dist < 0)
  338. dist += sdp->sd_jdesc->jd_blocks;
  339. return dist;
  340. }
  341. /**
  342. * calc_reserved - Calculate the number of blocks to reserve when
  343. * refunding a transaction's unused buffers.
  344. * @sdp: The GFS2 superblock
  345. *
  346. * This is complex. We need to reserve room for all our currently used
  347. * metadata buffers (e.g. normal file I/O rewriting file time stamps) and
  348. * all our journaled data buffers for journaled files (e.g. files in the
  349. * meta_fs like rindex, or files for which chattr +j was done.)
  350. * If we don't reserve enough space, gfs2_log_refund and gfs2_log_flush
  351. * will count it as free space (sd_log_blks_free) and corruption will follow.
  352. *
  353. * We can have metadata bufs and jdata bufs in the same journal. So each
  354. * type gets its own log header, for which we need to reserve a block.
  355. * In fact, each type has the potential for needing more than one header
  356. * in cases where we have more buffers than will fit on a journal page.
  357. * Metadata journal entries take up half the space of journaled buffer entries.
  358. * Thus, metadata entries have buf_limit (502) and journaled buffers have
  359. * databuf_limit (251) before they cause a wrap around.
  360. *
  361. * Also, we need to reserve blocks for revoke journal entries and one for an
  362. * overall header for the lot.
  363. *
  364. * Returns: the number of blocks reserved
  365. */
  366. static unsigned int calc_reserved(struct gfs2_sbd *sdp)
  367. {
  368. unsigned int reserved = 0;
  369. unsigned int mbuf_limit, metabufhdrs_needed;
  370. unsigned int dbuf_limit, databufhdrs_needed;
  371. unsigned int revokes = 0;
  372. mbuf_limit = buf_limit(sdp);
  373. metabufhdrs_needed = (sdp->sd_log_commited_buf +
  374. (mbuf_limit - 1)) / mbuf_limit;
  375. dbuf_limit = databuf_limit(sdp);
  376. databufhdrs_needed = (sdp->sd_log_commited_databuf +
  377. (dbuf_limit - 1)) / dbuf_limit;
  378. if (sdp->sd_log_commited_revoke > 0)
  379. revokes = gfs2_struct2blk(sdp, sdp->sd_log_commited_revoke,
  380. sizeof(u64));
  381. reserved = sdp->sd_log_commited_buf + metabufhdrs_needed +
  382. sdp->sd_log_commited_databuf + databufhdrs_needed +
  383. revokes;
  384. /* One for the overall header */
  385. if (reserved)
  386. reserved++;
  387. return reserved;
  388. }
  389. static unsigned int current_tail(struct gfs2_sbd *sdp)
  390. {
  391. struct gfs2_ail *ai;
  392. unsigned int tail;
  393. spin_lock(&sdp->sd_ail_lock);
  394. if (list_empty(&sdp->sd_ail1_list)) {
  395. tail = sdp->sd_log_head;
  396. } else {
  397. ai = list_entry(sdp->sd_ail1_list.prev, struct gfs2_ail, ai_list);
  398. tail = ai->ai_first;
  399. }
  400. spin_unlock(&sdp->sd_ail_lock);
  401. return tail;
  402. }
  403. void gfs2_log_incr_head(struct gfs2_sbd *sdp)
  404. {
  405. if (sdp->sd_log_flush_head == sdp->sd_log_tail)
  406. BUG_ON(sdp->sd_log_flush_head != sdp->sd_log_head);
  407. if (++sdp->sd_log_flush_head == sdp->sd_jdesc->jd_blocks) {
  408. sdp->sd_log_flush_head = 0;
  409. sdp->sd_log_flush_wrapped = 1;
  410. }
  411. }
  412. /**
  413. * gfs2_log_write_endio - End of I/O for a log buffer
  414. * @bh: The buffer head
  415. * @uptodate: I/O Status
  416. *
  417. */
  418. static void gfs2_log_write_endio(struct buffer_head *bh, int uptodate)
  419. {
  420. struct gfs2_sbd *sdp = bh->b_private;
  421. bh->b_private = NULL;
  422. end_buffer_write_sync(bh, uptodate);
  423. if (atomic_dec_and_test(&sdp->sd_log_in_flight))
  424. wake_up(&sdp->sd_log_flush_wait);
  425. }
  426. /**
  427. * gfs2_log_get_buf - Get and initialize a buffer to use for log control data
  428. * @sdp: The GFS2 superblock
  429. *
  430. * Returns: the buffer_head
  431. */
  432. struct buffer_head *gfs2_log_get_buf(struct gfs2_sbd *sdp)
  433. {
  434. u64 blkno = log_bmap(sdp, sdp->sd_log_flush_head);
  435. struct buffer_head *bh;
  436. bh = sb_getblk(sdp->sd_vfs, blkno);
  437. lock_buffer(bh);
  438. memset(bh->b_data, 0, bh->b_size);
  439. set_buffer_uptodate(bh);
  440. clear_buffer_dirty(bh);
  441. gfs2_log_incr_head(sdp);
  442. atomic_inc(&sdp->sd_log_in_flight);
  443. bh->b_private = sdp;
  444. bh->b_end_io = gfs2_log_write_endio;
  445. return bh;
  446. }
  447. /**
  448. * gfs2_fake_write_endio -
  449. * @bh: The buffer head
  450. * @uptodate: The I/O Status
  451. *
  452. */
  453. static void gfs2_fake_write_endio(struct buffer_head *bh, int uptodate)
  454. {
  455. struct buffer_head *real_bh = bh->b_private;
  456. struct gfs2_bufdata *bd = real_bh->b_private;
  457. struct gfs2_sbd *sdp = bd->bd_gl->gl_sbd;
  458. end_buffer_write_sync(bh, uptodate);
  459. free_buffer_head(bh);
  460. unlock_buffer(real_bh);
  461. brelse(real_bh);
  462. if (atomic_dec_and_test(&sdp->sd_log_in_flight))
  463. wake_up(&sdp->sd_log_flush_wait);
  464. }
  465. /**
  466. * gfs2_log_fake_buf - Build a fake buffer head to write metadata buffer to log
  467. * @sdp: the filesystem
  468. * @data: the data the buffer_head should point to
  469. *
  470. * Returns: the log buffer descriptor
  471. */
  472. struct buffer_head *gfs2_log_fake_buf(struct gfs2_sbd *sdp,
  473. struct buffer_head *real)
  474. {
  475. u64 blkno = log_bmap(sdp, sdp->sd_log_flush_head);
  476. struct buffer_head *bh;
  477. bh = alloc_buffer_head(GFP_NOFS | __GFP_NOFAIL);
  478. atomic_set(&bh->b_count, 1);
  479. bh->b_state = (1 << BH_Mapped) | (1 << BH_Uptodate) | (1 << BH_Lock);
  480. set_bh_page(bh, real->b_page, bh_offset(real));
  481. bh->b_blocknr = blkno;
  482. bh->b_size = sdp->sd_sb.sb_bsize;
  483. bh->b_bdev = sdp->sd_vfs->s_bdev;
  484. bh->b_private = real;
  485. bh->b_end_io = gfs2_fake_write_endio;
  486. gfs2_log_incr_head(sdp);
  487. atomic_inc(&sdp->sd_log_in_flight);
  488. return bh;
  489. }
  490. static void log_pull_tail(struct gfs2_sbd *sdp, unsigned int new_tail)
  491. {
  492. unsigned int dist = log_distance(sdp, new_tail, sdp->sd_log_tail);
  493. ail2_empty(sdp, new_tail);
  494. atomic_add(dist, &sdp->sd_log_blks_free);
  495. trace_gfs2_log_blocks(sdp, dist);
  496. gfs2_assert_withdraw(sdp, atomic_read(&sdp->sd_log_blks_free) <=
  497. sdp->sd_jdesc->jd_blocks);
  498. sdp->sd_log_tail = new_tail;
  499. }
  500. /**
  501. * log_write_header - Get and initialize a journal header buffer
  502. * @sdp: The GFS2 superblock
  503. *
  504. * Returns: the initialized log buffer descriptor
  505. */
  506. static void log_write_header(struct gfs2_sbd *sdp, u32 flags, int pull)
  507. {
  508. u64 blkno = log_bmap(sdp, sdp->sd_log_flush_head);
  509. struct buffer_head *bh;
  510. struct gfs2_log_header *lh;
  511. unsigned int tail;
  512. u32 hash;
  513. bh = sb_getblk(sdp->sd_vfs, blkno);
  514. lock_buffer(bh);
  515. memset(bh->b_data, 0, bh->b_size);
  516. set_buffer_uptodate(bh);
  517. clear_buffer_dirty(bh);
  518. gfs2_ail1_empty(sdp);
  519. tail = current_tail(sdp);
  520. lh = (struct gfs2_log_header *)bh->b_data;
  521. memset(lh, 0, sizeof(struct gfs2_log_header));
  522. lh->lh_header.mh_magic = cpu_to_be32(GFS2_MAGIC);
  523. lh->lh_header.mh_type = cpu_to_be32(GFS2_METATYPE_LH);
  524. lh->lh_header.__pad0 = cpu_to_be64(0);
  525. lh->lh_header.mh_format = cpu_to_be32(GFS2_FORMAT_LH);
  526. lh->lh_header.mh_jid = cpu_to_be32(sdp->sd_jdesc->jd_jid);
  527. lh->lh_sequence = cpu_to_be64(sdp->sd_log_sequence++);
  528. lh->lh_flags = cpu_to_be32(flags);
  529. lh->lh_tail = cpu_to_be32(tail);
  530. lh->lh_blkno = cpu_to_be32(sdp->sd_log_flush_head);
  531. hash = gfs2_disk_hash(bh->b_data, sizeof(struct gfs2_log_header));
  532. lh->lh_hash = cpu_to_be32(hash);
  533. bh->b_end_io = end_buffer_write_sync;
  534. get_bh(bh);
  535. if (test_bit(SDF_NOBARRIERS, &sdp->sd_flags))
  536. submit_bh(WRITE_SYNC | REQ_META, bh);
  537. else
  538. submit_bh(WRITE_FLUSH_FUA | REQ_META, bh);
  539. wait_on_buffer(bh);
  540. if (!buffer_uptodate(bh))
  541. gfs2_io_error_bh(sdp, bh);
  542. brelse(bh);
  543. if (sdp->sd_log_tail != tail)
  544. log_pull_tail(sdp, tail);
  545. else
  546. gfs2_assert_withdraw(sdp, !pull);
  547. sdp->sd_log_idle = (tail == sdp->sd_log_flush_head);
  548. gfs2_log_incr_head(sdp);
  549. }
  550. static void log_flush_commit(struct gfs2_sbd *sdp)
  551. {
  552. DEFINE_WAIT(wait);
  553. if (atomic_read(&sdp->sd_log_in_flight)) {
  554. do {
  555. prepare_to_wait(&sdp->sd_log_flush_wait, &wait,
  556. TASK_UNINTERRUPTIBLE);
  557. if (atomic_read(&sdp->sd_log_in_flight))
  558. io_schedule();
  559. } while(atomic_read(&sdp->sd_log_in_flight));
  560. finish_wait(&sdp->sd_log_flush_wait, &wait);
  561. }
  562. log_write_header(sdp, 0, 0);
  563. }
  564. static void gfs2_ordered_write(struct gfs2_sbd *sdp)
  565. {
  566. struct gfs2_bufdata *bd;
  567. struct buffer_head *bh;
  568. LIST_HEAD(written);
  569. gfs2_log_lock(sdp);
  570. while (!list_empty(&sdp->sd_log_le_ordered)) {
  571. bd = list_entry(sdp->sd_log_le_ordered.next, struct gfs2_bufdata, bd_le.le_list);
  572. list_move(&bd->bd_le.le_list, &written);
  573. bh = bd->bd_bh;
  574. if (!buffer_dirty(bh))
  575. continue;
  576. get_bh(bh);
  577. gfs2_log_unlock(sdp);
  578. lock_buffer(bh);
  579. if (buffer_mapped(bh) && test_clear_buffer_dirty(bh)) {
  580. bh->b_end_io = end_buffer_write_sync;
  581. submit_bh(WRITE_SYNC, bh);
  582. } else {
  583. unlock_buffer(bh);
  584. brelse(bh);
  585. }
  586. gfs2_log_lock(sdp);
  587. }
  588. list_splice(&written, &sdp->sd_log_le_ordered);
  589. gfs2_log_unlock(sdp);
  590. }
  591. static void gfs2_ordered_wait(struct gfs2_sbd *sdp)
  592. {
  593. struct gfs2_bufdata *bd;
  594. struct buffer_head *bh;
  595. gfs2_log_lock(sdp);
  596. while (!list_empty(&sdp->sd_log_le_ordered)) {
  597. bd = list_entry(sdp->sd_log_le_ordered.prev, struct gfs2_bufdata, bd_le.le_list);
  598. bh = bd->bd_bh;
  599. if (buffer_locked(bh)) {
  600. get_bh(bh);
  601. gfs2_log_unlock(sdp);
  602. wait_on_buffer(bh);
  603. brelse(bh);
  604. gfs2_log_lock(sdp);
  605. continue;
  606. }
  607. list_del_init(&bd->bd_le.le_list);
  608. }
  609. gfs2_log_unlock(sdp);
  610. }
  611. /**
  612. * gfs2_log_flush - flush incore transaction(s)
  613. * @sdp: the filesystem
  614. * @gl: The glock structure to flush. If NULL, flush the whole incore log
  615. *
  616. */
  617. void gfs2_log_flush(struct gfs2_sbd *sdp, struct gfs2_glock *gl)
  618. {
  619. struct gfs2_ail *ai;
  620. down_write(&sdp->sd_log_flush_lock);
  621. /* Log might have been flushed while we waited for the flush lock */
  622. if (gl && !test_bit(GLF_LFLUSH, &gl->gl_flags)) {
  623. up_write(&sdp->sd_log_flush_lock);
  624. return;
  625. }
  626. trace_gfs2_log_flush(sdp, 1);
  627. ai = kzalloc(sizeof(struct gfs2_ail), GFP_NOFS | __GFP_NOFAIL);
  628. INIT_LIST_HEAD(&ai->ai_ail1_list);
  629. INIT_LIST_HEAD(&ai->ai_ail2_list);
  630. if (sdp->sd_log_num_buf != sdp->sd_log_commited_buf) {
  631. printk(KERN_INFO "GFS2: log buf %u %u\n", sdp->sd_log_num_buf,
  632. sdp->sd_log_commited_buf);
  633. gfs2_assert_withdraw(sdp, 0);
  634. }
  635. if (sdp->sd_log_num_databuf != sdp->sd_log_commited_databuf) {
  636. printk(KERN_INFO "GFS2: log databuf %u %u\n",
  637. sdp->sd_log_num_databuf, sdp->sd_log_commited_databuf);
  638. gfs2_assert_withdraw(sdp, 0);
  639. }
  640. gfs2_assert_withdraw(sdp,
  641. sdp->sd_log_num_revoke == sdp->sd_log_commited_revoke);
  642. sdp->sd_log_flush_head = sdp->sd_log_head;
  643. sdp->sd_log_flush_wrapped = 0;
  644. ai->ai_first = sdp->sd_log_flush_head;
  645. gfs2_ordered_write(sdp);
  646. lops_before_commit(sdp);
  647. gfs2_ordered_wait(sdp);
  648. if (sdp->sd_log_head != sdp->sd_log_flush_head)
  649. log_flush_commit(sdp);
  650. else if (sdp->sd_log_tail != current_tail(sdp) && !sdp->sd_log_idle){
  651. gfs2_log_lock(sdp);
  652. atomic_dec(&sdp->sd_log_blks_free); /* Adjust for unreserved buffer */
  653. trace_gfs2_log_blocks(sdp, -1);
  654. gfs2_log_unlock(sdp);
  655. log_write_header(sdp, 0, PULL);
  656. }
  657. lops_after_commit(sdp, ai);
  658. gfs2_log_lock(sdp);
  659. sdp->sd_log_head = sdp->sd_log_flush_head;
  660. sdp->sd_log_blks_reserved = 0;
  661. sdp->sd_log_commited_buf = 0;
  662. sdp->sd_log_commited_databuf = 0;
  663. sdp->sd_log_commited_revoke = 0;
  664. spin_lock(&sdp->sd_ail_lock);
  665. if (!list_empty(&ai->ai_ail1_list)) {
  666. list_add(&ai->ai_list, &sdp->sd_ail1_list);
  667. ai = NULL;
  668. }
  669. spin_unlock(&sdp->sd_ail_lock);
  670. gfs2_log_unlock(sdp);
  671. trace_gfs2_log_flush(sdp, 0);
  672. up_write(&sdp->sd_log_flush_lock);
  673. kfree(ai);
  674. }
  675. static void log_refund(struct gfs2_sbd *sdp, struct gfs2_trans *tr)
  676. {
  677. unsigned int reserved;
  678. unsigned int unused;
  679. gfs2_log_lock(sdp);
  680. sdp->sd_log_commited_buf += tr->tr_num_buf_new - tr->tr_num_buf_rm;
  681. sdp->sd_log_commited_databuf += tr->tr_num_databuf_new -
  682. tr->tr_num_databuf_rm;
  683. gfs2_assert_withdraw(sdp, (((int)sdp->sd_log_commited_buf) >= 0) ||
  684. (((int)sdp->sd_log_commited_databuf) >= 0));
  685. sdp->sd_log_commited_revoke += tr->tr_num_revoke - tr->tr_num_revoke_rm;
  686. reserved = calc_reserved(sdp);
  687. gfs2_assert_withdraw(sdp, sdp->sd_log_blks_reserved + tr->tr_reserved >= reserved);
  688. unused = sdp->sd_log_blks_reserved - reserved + tr->tr_reserved;
  689. atomic_add(unused, &sdp->sd_log_blks_free);
  690. trace_gfs2_log_blocks(sdp, unused);
  691. gfs2_assert_withdraw(sdp, atomic_read(&sdp->sd_log_blks_free) <=
  692. sdp->sd_jdesc->jd_blocks);
  693. sdp->sd_log_blks_reserved = reserved;
  694. gfs2_log_unlock(sdp);
  695. }
  696. static void buf_lo_incore_commit(struct gfs2_sbd *sdp, struct gfs2_trans *tr)
  697. {
  698. struct list_head *head = &tr->tr_list_buf;
  699. struct gfs2_bufdata *bd;
  700. gfs2_log_lock(sdp);
  701. while (!list_empty(head)) {
  702. bd = list_entry(head->next, struct gfs2_bufdata, bd_list_tr);
  703. list_del_init(&bd->bd_list_tr);
  704. tr->tr_num_buf--;
  705. }
  706. gfs2_log_unlock(sdp);
  707. gfs2_assert_warn(sdp, !tr->tr_num_buf);
  708. }
  709. /**
  710. * gfs2_log_commit - Commit a transaction to the log
  711. * @sdp: the filesystem
  712. * @tr: the transaction
  713. *
  714. * We wake up gfs2_logd if the number of pinned blocks exceed thresh1
  715. * or the total number of used blocks (pinned blocks plus AIL blocks)
  716. * is greater than thresh2.
  717. *
  718. * At mount time thresh1 is 1/3rd of journal size, thresh2 is 2/3rd of
  719. * journal size.
  720. *
  721. * Returns: errno
  722. */
  723. void gfs2_log_commit(struct gfs2_sbd *sdp, struct gfs2_trans *tr)
  724. {
  725. log_refund(sdp, tr);
  726. buf_lo_incore_commit(sdp, tr);
  727. up_read(&sdp->sd_log_flush_lock);
  728. if (atomic_read(&sdp->sd_log_pinned) > atomic_read(&sdp->sd_log_thresh1) ||
  729. ((sdp->sd_jdesc->jd_blocks - atomic_read(&sdp->sd_log_blks_free)) >
  730. atomic_read(&sdp->sd_log_thresh2)))
  731. wake_up(&sdp->sd_logd_waitq);
  732. }
  733. /**
  734. * gfs2_log_shutdown - write a shutdown header into a journal
  735. * @sdp: the filesystem
  736. *
  737. */
  738. void gfs2_log_shutdown(struct gfs2_sbd *sdp)
  739. {
  740. down_write(&sdp->sd_log_flush_lock);
  741. gfs2_assert_withdraw(sdp, !sdp->sd_log_blks_reserved);
  742. gfs2_assert_withdraw(sdp, !sdp->sd_log_num_buf);
  743. gfs2_assert_withdraw(sdp, !sdp->sd_log_num_revoke);
  744. gfs2_assert_withdraw(sdp, !sdp->sd_log_num_rg);
  745. gfs2_assert_withdraw(sdp, !sdp->sd_log_num_databuf);
  746. gfs2_assert_withdraw(sdp, list_empty(&sdp->sd_ail1_list));
  747. sdp->sd_log_flush_head = sdp->sd_log_head;
  748. sdp->sd_log_flush_wrapped = 0;
  749. log_write_header(sdp, GFS2_LOG_HEAD_UNMOUNT,
  750. (sdp->sd_log_tail == current_tail(sdp)) ? 0 : PULL);
  751. gfs2_assert_warn(sdp, atomic_read(&sdp->sd_log_blks_free) == sdp->sd_jdesc->jd_blocks);
  752. gfs2_assert_warn(sdp, sdp->sd_log_head == sdp->sd_log_tail);
  753. gfs2_assert_warn(sdp, list_empty(&sdp->sd_ail2_list));
  754. sdp->sd_log_head = sdp->sd_log_flush_head;
  755. sdp->sd_log_tail = sdp->sd_log_head;
  756. up_write(&sdp->sd_log_flush_lock);
  757. }
  758. /**
  759. * gfs2_meta_syncfs - sync all the buffers in a filesystem
  760. * @sdp: the filesystem
  761. *
  762. */
  763. void gfs2_meta_syncfs(struct gfs2_sbd *sdp)
  764. {
  765. gfs2_log_flush(sdp, NULL);
  766. for (;;) {
  767. gfs2_ail1_start(sdp);
  768. gfs2_ail1_wait(sdp);
  769. if (gfs2_ail1_empty(sdp))
  770. break;
  771. }
  772. gfs2_log_flush(sdp, NULL);
  773. }
  774. static inline int gfs2_jrnl_flush_reqd(struct gfs2_sbd *sdp)
  775. {
  776. return (atomic_read(&sdp->sd_log_pinned) >= atomic_read(&sdp->sd_log_thresh1));
  777. }
  778. static inline int gfs2_ail_flush_reqd(struct gfs2_sbd *sdp)
  779. {
  780. unsigned int used_blocks = sdp->sd_jdesc->jd_blocks - atomic_read(&sdp->sd_log_blks_free);
  781. return used_blocks >= atomic_read(&sdp->sd_log_thresh2);
  782. }
  783. /**
  784. * gfs2_logd - Update log tail as Active Items get flushed to in-place blocks
  785. * @sdp: Pointer to GFS2 superblock
  786. *
  787. * Also, periodically check to make sure that we're using the most recent
  788. * journal index.
  789. */
  790. int gfs2_logd(void *data)
  791. {
  792. struct gfs2_sbd *sdp = data;
  793. unsigned long t = 1;
  794. DEFINE_WAIT(wait);
  795. unsigned preflush;
  796. while (!kthread_should_stop()) {
  797. preflush = atomic_read(&sdp->sd_log_pinned);
  798. if (gfs2_jrnl_flush_reqd(sdp) || t == 0) {
  799. gfs2_ail1_empty(sdp);
  800. gfs2_log_flush(sdp, NULL);
  801. }
  802. if (gfs2_ail_flush_reqd(sdp)) {
  803. gfs2_ail1_start(sdp);
  804. gfs2_ail1_wait(sdp);
  805. gfs2_ail1_empty(sdp);
  806. gfs2_log_flush(sdp, NULL);
  807. }
  808. if (!gfs2_ail_flush_reqd(sdp))
  809. wake_up(&sdp->sd_log_waitq);
  810. t = gfs2_tune_get(sdp, gt_logd_secs) * HZ;
  811. if (freezing(current))
  812. refrigerator();
  813. do {
  814. prepare_to_wait(&sdp->sd_logd_waitq, &wait,
  815. TASK_INTERRUPTIBLE);
  816. if (!gfs2_ail_flush_reqd(sdp) &&
  817. !gfs2_jrnl_flush_reqd(sdp) &&
  818. !kthread_should_stop())
  819. t = schedule_timeout(t);
  820. } while(t && !gfs2_ail_flush_reqd(sdp) &&
  821. !gfs2_jrnl_flush_reqd(sdp) &&
  822. !kthread_should_stop());
  823. finish_wait(&sdp->sd_logd_waitq, &wait);
  824. }
  825. return 0;
  826. }