lops.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879
  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/mempool.h>
  15. #include <linux/gfs2_ondisk.h>
  16. #include <linux/bio.h>
  17. #include <linux/fs.h>
  18. #include <linux/list_sort.h>
  19. #include "gfs2.h"
  20. #include "incore.h"
  21. #include "inode.h"
  22. #include "glock.h"
  23. #include "log.h"
  24. #include "lops.h"
  25. #include "meta_io.h"
  26. #include "recovery.h"
  27. #include "rgrp.h"
  28. #include "trans.h"
  29. #include "util.h"
  30. #include "trace_gfs2.h"
  31. /**
  32. * gfs2_pin - Pin a buffer in memory
  33. * @sdp: The superblock
  34. * @bh: The buffer to be pinned
  35. *
  36. * The log lock must be held when calling this function
  37. */
  38. void gfs2_pin(struct gfs2_sbd *sdp, struct buffer_head *bh)
  39. {
  40. struct gfs2_bufdata *bd;
  41. BUG_ON(!current->journal_info);
  42. clear_buffer_dirty(bh);
  43. if (test_set_buffer_pinned(bh))
  44. gfs2_assert_withdraw(sdp, 0);
  45. if (!buffer_uptodate(bh))
  46. gfs2_io_error_bh(sdp, bh);
  47. bd = bh->b_private;
  48. /* If this buffer is in the AIL and it has already been written
  49. * to in-place disk block, remove it from the AIL.
  50. */
  51. spin_lock(&sdp->sd_ail_lock);
  52. if (bd->bd_tr)
  53. list_move(&bd->bd_ail_st_list, &bd->bd_tr->tr_ail2_list);
  54. spin_unlock(&sdp->sd_ail_lock);
  55. get_bh(bh);
  56. atomic_inc(&sdp->sd_log_pinned);
  57. trace_gfs2_pin(bd, 1);
  58. }
  59. static bool buffer_is_rgrp(const struct gfs2_bufdata *bd)
  60. {
  61. return bd->bd_gl->gl_name.ln_type == LM_TYPE_RGRP;
  62. }
  63. static void maybe_release_space(struct gfs2_bufdata *bd)
  64. {
  65. struct gfs2_glock *gl = bd->bd_gl;
  66. struct gfs2_sbd *sdp = gl->gl_name.ln_sbd;
  67. struct gfs2_rgrpd *rgd = gfs2_glock2rgrp(gl);
  68. unsigned int index = bd->bd_bh->b_blocknr - gl->gl_name.ln_number;
  69. struct gfs2_bitmap *bi = rgd->rd_bits + index;
  70. if (bi->bi_clone == NULL)
  71. return;
  72. if (sdp->sd_args.ar_discard)
  73. gfs2_rgrp_send_discards(sdp, rgd->rd_data0, bd->bd_bh, bi, 1, NULL);
  74. memcpy(bi->bi_clone + bi->bi_offset,
  75. bd->bd_bh->b_data + bi->bi_offset, bi->bi_len);
  76. clear_bit(GBF_FULL, &bi->bi_flags);
  77. rgd->rd_free_clone = rgd->rd_free;
  78. rgd->rd_extfail_pt = rgd->rd_free;
  79. }
  80. /**
  81. * gfs2_unpin - Unpin a buffer
  82. * @sdp: the filesystem the buffer belongs to
  83. * @bh: The buffer to unpin
  84. * @ai:
  85. * @flags: The inode dirty flags
  86. *
  87. */
  88. static void gfs2_unpin(struct gfs2_sbd *sdp, struct buffer_head *bh,
  89. struct gfs2_trans *tr)
  90. {
  91. struct gfs2_bufdata *bd = bh->b_private;
  92. BUG_ON(!buffer_uptodate(bh));
  93. BUG_ON(!buffer_pinned(bh));
  94. lock_buffer(bh);
  95. mark_buffer_dirty(bh);
  96. clear_buffer_pinned(bh);
  97. if (buffer_is_rgrp(bd))
  98. maybe_release_space(bd);
  99. spin_lock(&sdp->sd_ail_lock);
  100. if (bd->bd_tr) {
  101. list_del(&bd->bd_ail_st_list);
  102. brelse(bh);
  103. } else {
  104. struct gfs2_glock *gl = bd->bd_gl;
  105. list_add(&bd->bd_ail_gl_list, &gl->gl_ail_list);
  106. atomic_inc(&gl->gl_ail_count);
  107. }
  108. bd->bd_tr = tr;
  109. list_add(&bd->bd_ail_st_list, &tr->tr_ail1_list);
  110. spin_unlock(&sdp->sd_ail_lock);
  111. clear_bit(GLF_LFLUSH, &bd->bd_gl->gl_flags);
  112. trace_gfs2_pin(bd, 0);
  113. unlock_buffer(bh);
  114. atomic_dec(&sdp->sd_log_pinned);
  115. }
  116. static void gfs2_log_incr_head(struct gfs2_sbd *sdp)
  117. {
  118. BUG_ON((sdp->sd_log_flush_head == sdp->sd_log_tail) &&
  119. (sdp->sd_log_flush_head != sdp->sd_log_head));
  120. if (++sdp->sd_log_flush_head == sdp->sd_jdesc->jd_blocks)
  121. sdp->sd_log_flush_head = 0;
  122. }
  123. static u64 gfs2_log_bmap(struct gfs2_sbd *sdp)
  124. {
  125. unsigned int lbn = sdp->sd_log_flush_head;
  126. struct gfs2_journal_extent *je;
  127. u64 block;
  128. list_for_each_entry(je, &sdp->sd_jdesc->extent_list, list) {
  129. if ((lbn >= je->lblock) && (lbn < (je->lblock + je->blocks))) {
  130. block = je->dblock + lbn - je->lblock;
  131. gfs2_log_incr_head(sdp);
  132. return block;
  133. }
  134. }
  135. return -1;
  136. }
  137. /**
  138. * gfs2_end_log_write_bh - end log write of pagecache data with buffers
  139. * @sdp: The superblock
  140. * @bvec: The bio_vec
  141. * @error: The i/o status
  142. *
  143. * This finds the relavent buffers and unlocks then and sets the
  144. * error flag according to the status of the i/o request. This is
  145. * used when the log is writing data which has an in-place version
  146. * that is pinned in the pagecache.
  147. */
  148. static void gfs2_end_log_write_bh(struct gfs2_sbd *sdp, struct bio_vec *bvec,
  149. blk_status_t error)
  150. {
  151. struct buffer_head *bh, *next;
  152. struct page *page = bvec->bv_page;
  153. unsigned size;
  154. bh = page_buffers(page);
  155. size = bvec->bv_len;
  156. while (bh_offset(bh) < bvec->bv_offset)
  157. bh = bh->b_this_page;
  158. do {
  159. if (error)
  160. mark_buffer_write_io_error(bh);
  161. unlock_buffer(bh);
  162. next = bh->b_this_page;
  163. size -= bh->b_size;
  164. brelse(bh);
  165. bh = next;
  166. } while(bh && size);
  167. }
  168. /**
  169. * gfs2_end_log_write - end of i/o to the log
  170. * @bio: The bio
  171. * @error: Status of i/o request
  172. *
  173. * Each bio_vec contains either data from the pagecache or data
  174. * relating to the log itself. Here we iterate over the bio_vec
  175. * array, processing both kinds of data.
  176. *
  177. */
  178. static void gfs2_end_log_write(struct bio *bio)
  179. {
  180. struct gfs2_sbd *sdp = bio->bi_private;
  181. struct bio_vec *bvec;
  182. struct page *page;
  183. int i;
  184. if (bio->bi_status) {
  185. fs_err(sdp, "Error %d writing to journal, jid=%u\n",
  186. bio->bi_status, sdp->sd_jdesc->jd_jid);
  187. wake_up(&sdp->sd_logd_waitq);
  188. }
  189. bio_for_each_segment_all(bvec, bio, i) {
  190. page = bvec->bv_page;
  191. if (page_has_buffers(page))
  192. gfs2_end_log_write_bh(sdp, bvec, bio->bi_status);
  193. else
  194. mempool_free(page, gfs2_page_pool);
  195. }
  196. bio_put(bio);
  197. if (atomic_dec_and_test(&sdp->sd_log_in_flight))
  198. wake_up(&sdp->sd_log_flush_wait);
  199. }
  200. /**
  201. * gfs2_log_flush_bio - Submit any pending log bio
  202. * @sdp: The superblock
  203. * @op: REQ_OP
  204. * @op_flags: req_flag_bits
  205. *
  206. * Submit any pending part-built or full bio to the block device. If
  207. * there is no pending bio, then this is a no-op.
  208. */
  209. void gfs2_log_flush_bio(struct gfs2_sbd *sdp, int op, int op_flags)
  210. {
  211. if (sdp->sd_log_bio) {
  212. atomic_inc(&sdp->sd_log_in_flight);
  213. bio_set_op_attrs(sdp->sd_log_bio, op, op_flags);
  214. submit_bio(sdp->sd_log_bio);
  215. sdp->sd_log_bio = NULL;
  216. }
  217. }
  218. /**
  219. * gfs2_log_alloc_bio - Allocate a new bio for log writing
  220. * @sdp: The superblock
  221. * @blkno: The next device block number we want to write to
  222. *
  223. * This should never be called when there is a cached bio in the
  224. * super block. When it returns, there will be a cached bio in the
  225. * super block which will have as many bio_vecs as the device is
  226. * happy to handle.
  227. *
  228. * Returns: Newly allocated bio
  229. */
  230. static struct bio *gfs2_log_alloc_bio(struct gfs2_sbd *sdp, u64 blkno)
  231. {
  232. struct super_block *sb = sdp->sd_vfs;
  233. struct bio *bio;
  234. BUG_ON(sdp->sd_log_bio);
  235. bio = bio_alloc(GFP_NOIO, BIO_MAX_PAGES);
  236. bio->bi_iter.bi_sector = blkno * (sb->s_blocksize >> 9);
  237. bio_set_dev(bio, sb->s_bdev);
  238. bio->bi_end_io = gfs2_end_log_write;
  239. bio->bi_private = sdp;
  240. sdp->sd_log_bio = bio;
  241. return bio;
  242. }
  243. /**
  244. * gfs2_log_get_bio - Get cached log bio, or allocate a new one
  245. * @sdp: The superblock
  246. * @blkno: The device block number we want to write to
  247. *
  248. * If there is a cached bio, then if the next block number is sequential
  249. * with the previous one, return it, otherwise flush the bio to the
  250. * device. If there is not a cached bio, or we just flushed it, then
  251. * allocate a new one.
  252. *
  253. * Returns: The bio to use for log writes
  254. */
  255. static struct bio *gfs2_log_get_bio(struct gfs2_sbd *sdp, u64 blkno)
  256. {
  257. struct bio *bio = sdp->sd_log_bio;
  258. u64 nblk;
  259. if (bio) {
  260. nblk = bio_end_sector(bio);
  261. nblk >>= sdp->sd_fsb2bb_shift;
  262. if (blkno == nblk)
  263. return bio;
  264. gfs2_log_flush_bio(sdp, REQ_OP_WRITE, 0);
  265. }
  266. return gfs2_log_alloc_bio(sdp, blkno);
  267. }
  268. /**
  269. * gfs2_log_write - write to log
  270. * @sdp: the filesystem
  271. * @page: the page to write
  272. * @size: the size of the data to write
  273. * @offset: the offset within the page
  274. *
  275. * Try and add the page segment to the current bio. If that fails,
  276. * submit the current bio to the device and create a new one, and
  277. * then add the page segment to that.
  278. */
  279. static void gfs2_log_write(struct gfs2_sbd *sdp, struct page *page,
  280. unsigned size, unsigned offset)
  281. {
  282. u64 blkno = gfs2_log_bmap(sdp);
  283. struct bio *bio;
  284. int ret;
  285. bio = gfs2_log_get_bio(sdp, blkno);
  286. ret = bio_add_page(bio, page, size, offset);
  287. if (ret == 0) {
  288. gfs2_log_flush_bio(sdp, REQ_OP_WRITE, 0);
  289. bio = gfs2_log_alloc_bio(sdp, blkno);
  290. ret = bio_add_page(bio, page, size, offset);
  291. WARN_ON(ret == 0);
  292. }
  293. }
  294. /**
  295. * gfs2_log_write_bh - write a buffer's content to the log
  296. * @sdp: The super block
  297. * @bh: The buffer pointing to the in-place location
  298. *
  299. * This writes the content of the buffer to the next available location
  300. * in the log. The buffer will be unlocked once the i/o to the log has
  301. * completed.
  302. */
  303. static void gfs2_log_write_bh(struct gfs2_sbd *sdp, struct buffer_head *bh)
  304. {
  305. gfs2_log_write(sdp, bh->b_page, bh->b_size, bh_offset(bh));
  306. }
  307. /**
  308. * gfs2_log_write_page - write one block stored in a page, into the log
  309. * @sdp: The superblock
  310. * @page: The struct page
  311. *
  312. * This writes the first block-sized part of the page into the log. Note
  313. * that the page must have been allocated from the gfs2_page_pool mempool
  314. * and that after this has been called, ownership has been transferred and
  315. * the page may be freed at any time.
  316. */
  317. void gfs2_log_write_page(struct gfs2_sbd *sdp, struct page *page)
  318. {
  319. struct super_block *sb = sdp->sd_vfs;
  320. gfs2_log_write(sdp, page, sb->s_blocksize, 0);
  321. }
  322. static struct page *gfs2_get_log_desc(struct gfs2_sbd *sdp, u32 ld_type,
  323. u32 ld_length, u32 ld_data1)
  324. {
  325. struct page *page = mempool_alloc(gfs2_page_pool, GFP_NOIO);
  326. struct gfs2_log_descriptor *ld = page_address(page);
  327. clear_page(ld);
  328. ld->ld_header.mh_magic = cpu_to_be32(GFS2_MAGIC);
  329. ld->ld_header.mh_type = cpu_to_be32(GFS2_METATYPE_LD);
  330. ld->ld_header.mh_format = cpu_to_be32(GFS2_FORMAT_LD);
  331. ld->ld_type = cpu_to_be32(ld_type);
  332. ld->ld_length = cpu_to_be32(ld_length);
  333. ld->ld_data1 = cpu_to_be32(ld_data1);
  334. ld->ld_data2 = 0;
  335. return page;
  336. }
  337. static void gfs2_check_magic(struct buffer_head *bh)
  338. {
  339. void *kaddr;
  340. __be32 *ptr;
  341. clear_buffer_escaped(bh);
  342. kaddr = kmap_atomic(bh->b_page);
  343. ptr = kaddr + bh_offset(bh);
  344. if (*ptr == cpu_to_be32(GFS2_MAGIC))
  345. set_buffer_escaped(bh);
  346. kunmap_atomic(kaddr);
  347. }
  348. static int blocknr_cmp(void *priv, struct list_head *a, struct list_head *b)
  349. {
  350. struct gfs2_bufdata *bda, *bdb;
  351. bda = list_entry(a, struct gfs2_bufdata, bd_list);
  352. bdb = list_entry(b, struct gfs2_bufdata, bd_list);
  353. if (bda->bd_bh->b_blocknr < bdb->bd_bh->b_blocknr)
  354. return -1;
  355. if (bda->bd_bh->b_blocknr > bdb->bd_bh->b_blocknr)
  356. return 1;
  357. return 0;
  358. }
  359. static void gfs2_before_commit(struct gfs2_sbd *sdp, unsigned int limit,
  360. unsigned int total, struct list_head *blist,
  361. bool is_databuf)
  362. {
  363. struct gfs2_log_descriptor *ld;
  364. struct gfs2_bufdata *bd1 = NULL, *bd2;
  365. struct page *page;
  366. unsigned int num;
  367. unsigned n;
  368. __be64 *ptr;
  369. gfs2_log_lock(sdp);
  370. list_sort(NULL, blist, blocknr_cmp);
  371. bd1 = bd2 = list_prepare_entry(bd1, blist, bd_list);
  372. while(total) {
  373. num = total;
  374. if (total > limit)
  375. num = limit;
  376. gfs2_log_unlock(sdp);
  377. page = gfs2_get_log_desc(sdp,
  378. is_databuf ? GFS2_LOG_DESC_JDATA :
  379. GFS2_LOG_DESC_METADATA, num + 1, num);
  380. ld = page_address(page);
  381. gfs2_log_lock(sdp);
  382. ptr = (__be64 *)(ld + 1);
  383. n = 0;
  384. list_for_each_entry_continue(bd1, blist, bd_list) {
  385. *ptr++ = cpu_to_be64(bd1->bd_bh->b_blocknr);
  386. if (is_databuf) {
  387. gfs2_check_magic(bd1->bd_bh);
  388. *ptr++ = cpu_to_be64(buffer_escaped(bd1->bd_bh) ? 1 : 0);
  389. }
  390. if (++n >= num)
  391. break;
  392. }
  393. gfs2_log_unlock(sdp);
  394. gfs2_log_write_page(sdp, page);
  395. gfs2_log_lock(sdp);
  396. n = 0;
  397. list_for_each_entry_continue(bd2, blist, bd_list) {
  398. get_bh(bd2->bd_bh);
  399. gfs2_log_unlock(sdp);
  400. lock_buffer(bd2->bd_bh);
  401. if (buffer_escaped(bd2->bd_bh)) {
  402. void *kaddr;
  403. page = mempool_alloc(gfs2_page_pool, GFP_NOIO);
  404. ptr = page_address(page);
  405. kaddr = kmap_atomic(bd2->bd_bh->b_page);
  406. memcpy(ptr, kaddr + bh_offset(bd2->bd_bh),
  407. bd2->bd_bh->b_size);
  408. kunmap_atomic(kaddr);
  409. *(__be32 *)ptr = 0;
  410. clear_buffer_escaped(bd2->bd_bh);
  411. unlock_buffer(bd2->bd_bh);
  412. brelse(bd2->bd_bh);
  413. gfs2_log_write_page(sdp, page);
  414. } else {
  415. gfs2_log_write_bh(sdp, bd2->bd_bh);
  416. }
  417. gfs2_log_lock(sdp);
  418. if (++n >= num)
  419. break;
  420. }
  421. BUG_ON(total < num);
  422. total -= num;
  423. }
  424. gfs2_log_unlock(sdp);
  425. }
  426. static void buf_lo_before_commit(struct gfs2_sbd *sdp, struct gfs2_trans *tr)
  427. {
  428. unsigned int limit = buf_limit(sdp); /* 503 for 4k blocks */
  429. unsigned int nbuf;
  430. if (tr == NULL)
  431. return;
  432. nbuf = tr->tr_num_buf_new - tr->tr_num_buf_rm;
  433. gfs2_before_commit(sdp, limit, nbuf, &tr->tr_buf, 0);
  434. }
  435. static void buf_lo_after_commit(struct gfs2_sbd *sdp, struct gfs2_trans *tr)
  436. {
  437. struct list_head *head;
  438. struct gfs2_bufdata *bd;
  439. if (tr == NULL)
  440. return;
  441. head = &tr->tr_buf;
  442. while (!list_empty(head)) {
  443. bd = list_entry(head->next, struct gfs2_bufdata, bd_list);
  444. list_del_init(&bd->bd_list);
  445. gfs2_unpin(sdp, bd->bd_bh, tr);
  446. }
  447. }
  448. static void buf_lo_before_scan(struct gfs2_jdesc *jd,
  449. struct gfs2_log_header_host *head, int pass)
  450. {
  451. if (pass != 0)
  452. return;
  453. jd->jd_found_blocks = 0;
  454. jd->jd_replayed_blocks = 0;
  455. }
  456. static int buf_lo_scan_elements(struct gfs2_jdesc *jd, unsigned int start,
  457. struct gfs2_log_descriptor *ld, __be64 *ptr,
  458. int pass)
  459. {
  460. struct gfs2_inode *ip = GFS2_I(jd->jd_inode);
  461. struct gfs2_sbd *sdp = GFS2_SB(jd->jd_inode);
  462. struct gfs2_glock *gl = ip->i_gl;
  463. unsigned int blks = be32_to_cpu(ld->ld_data1);
  464. struct buffer_head *bh_log, *bh_ip;
  465. u64 blkno;
  466. int error = 0;
  467. if (pass != 1 || be32_to_cpu(ld->ld_type) != GFS2_LOG_DESC_METADATA)
  468. return 0;
  469. gfs2_replay_incr_blk(jd, &start);
  470. for (; blks; gfs2_replay_incr_blk(jd, &start), blks--) {
  471. blkno = be64_to_cpu(*ptr++);
  472. jd->jd_found_blocks++;
  473. if (gfs2_revoke_check(jd, blkno, start))
  474. continue;
  475. error = gfs2_replay_read_block(jd, start, &bh_log);
  476. if (error)
  477. return error;
  478. bh_ip = gfs2_meta_new(gl, blkno);
  479. memcpy(bh_ip->b_data, bh_log->b_data, bh_log->b_size);
  480. if (gfs2_meta_check(sdp, bh_ip))
  481. error = -EIO;
  482. else
  483. mark_buffer_dirty(bh_ip);
  484. brelse(bh_log);
  485. brelse(bh_ip);
  486. if (error)
  487. break;
  488. jd->jd_replayed_blocks++;
  489. }
  490. return error;
  491. }
  492. /**
  493. * gfs2_meta_sync - Sync all buffers associated with a glock
  494. * @gl: The glock
  495. *
  496. */
  497. static void gfs2_meta_sync(struct gfs2_glock *gl)
  498. {
  499. struct address_space *mapping = gfs2_glock2aspace(gl);
  500. struct gfs2_sbd *sdp = gl->gl_name.ln_sbd;
  501. int error;
  502. if (mapping == NULL)
  503. mapping = &sdp->sd_aspace;
  504. filemap_fdatawrite(mapping);
  505. error = filemap_fdatawait(mapping);
  506. if (error)
  507. gfs2_io_error(gl->gl_name.ln_sbd);
  508. }
  509. static void buf_lo_after_scan(struct gfs2_jdesc *jd, int error, int pass)
  510. {
  511. struct gfs2_inode *ip = GFS2_I(jd->jd_inode);
  512. struct gfs2_sbd *sdp = GFS2_SB(jd->jd_inode);
  513. if (error) {
  514. gfs2_meta_sync(ip->i_gl);
  515. return;
  516. }
  517. if (pass != 1)
  518. return;
  519. gfs2_meta_sync(ip->i_gl);
  520. fs_info(sdp, "jid=%u: Replayed %u of %u blocks\n",
  521. jd->jd_jid, jd->jd_replayed_blocks, jd->jd_found_blocks);
  522. }
  523. static void revoke_lo_before_commit(struct gfs2_sbd *sdp, struct gfs2_trans *tr)
  524. {
  525. struct gfs2_meta_header *mh;
  526. unsigned int offset;
  527. struct list_head *head = &sdp->sd_log_le_revoke;
  528. struct gfs2_bufdata *bd;
  529. struct page *page;
  530. unsigned int length;
  531. gfs2_write_revokes(sdp);
  532. if (!sdp->sd_log_num_revoke)
  533. return;
  534. length = gfs2_struct2blk(sdp, sdp->sd_log_num_revoke, sizeof(u64));
  535. page = gfs2_get_log_desc(sdp, GFS2_LOG_DESC_REVOKE, length, sdp->sd_log_num_revoke);
  536. offset = sizeof(struct gfs2_log_descriptor);
  537. list_for_each_entry(bd, head, bd_list) {
  538. sdp->sd_log_num_revoke--;
  539. if (offset + sizeof(u64) > sdp->sd_sb.sb_bsize) {
  540. gfs2_log_write_page(sdp, page);
  541. page = mempool_alloc(gfs2_page_pool, GFP_NOIO);
  542. mh = page_address(page);
  543. clear_page(mh);
  544. mh->mh_magic = cpu_to_be32(GFS2_MAGIC);
  545. mh->mh_type = cpu_to_be32(GFS2_METATYPE_LB);
  546. mh->mh_format = cpu_to_be32(GFS2_FORMAT_LB);
  547. offset = sizeof(struct gfs2_meta_header);
  548. }
  549. *(__be64 *)(page_address(page) + offset) = cpu_to_be64(bd->bd_blkno);
  550. offset += sizeof(u64);
  551. }
  552. gfs2_assert_withdraw(sdp, !sdp->sd_log_num_revoke);
  553. gfs2_log_write_page(sdp, page);
  554. }
  555. static void revoke_lo_after_commit(struct gfs2_sbd *sdp, struct gfs2_trans *tr)
  556. {
  557. struct list_head *head = &sdp->sd_log_le_revoke;
  558. struct gfs2_bufdata *bd;
  559. struct gfs2_glock *gl;
  560. while (!list_empty(head)) {
  561. bd = list_entry(head->next, struct gfs2_bufdata, bd_list);
  562. list_del_init(&bd->bd_list);
  563. gl = bd->bd_gl;
  564. atomic_dec(&gl->gl_revokes);
  565. clear_bit(GLF_LFLUSH, &gl->gl_flags);
  566. kmem_cache_free(gfs2_bufdata_cachep, bd);
  567. }
  568. }
  569. static void revoke_lo_before_scan(struct gfs2_jdesc *jd,
  570. struct gfs2_log_header_host *head, int pass)
  571. {
  572. if (pass != 0)
  573. return;
  574. jd->jd_found_revokes = 0;
  575. jd->jd_replay_tail = head->lh_tail;
  576. }
  577. static int revoke_lo_scan_elements(struct gfs2_jdesc *jd, unsigned int start,
  578. struct gfs2_log_descriptor *ld, __be64 *ptr,
  579. int pass)
  580. {
  581. struct gfs2_sbd *sdp = GFS2_SB(jd->jd_inode);
  582. unsigned int blks = be32_to_cpu(ld->ld_length);
  583. unsigned int revokes = be32_to_cpu(ld->ld_data1);
  584. struct buffer_head *bh;
  585. unsigned int offset;
  586. u64 blkno;
  587. int first = 1;
  588. int error;
  589. if (pass != 0 || be32_to_cpu(ld->ld_type) != GFS2_LOG_DESC_REVOKE)
  590. return 0;
  591. offset = sizeof(struct gfs2_log_descriptor);
  592. for (; blks; gfs2_replay_incr_blk(jd, &start), blks--) {
  593. error = gfs2_replay_read_block(jd, start, &bh);
  594. if (error)
  595. return error;
  596. if (!first)
  597. gfs2_metatype_check(sdp, bh, GFS2_METATYPE_LB);
  598. while (offset + sizeof(u64) <= sdp->sd_sb.sb_bsize) {
  599. blkno = be64_to_cpu(*(__be64 *)(bh->b_data + offset));
  600. error = gfs2_revoke_add(jd, blkno, start);
  601. if (error < 0) {
  602. brelse(bh);
  603. return error;
  604. }
  605. else if (error)
  606. jd->jd_found_revokes++;
  607. if (!--revokes)
  608. break;
  609. offset += sizeof(u64);
  610. }
  611. brelse(bh);
  612. offset = sizeof(struct gfs2_meta_header);
  613. first = 0;
  614. }
  615. return 0;
  616. }
  617. static void revoke_lo_after_scan(struct gfs2_jdesc *jd, int error, int pass)
  618. {
  619. struct gfs2_sbd *sdp = GFS2_SB(jd->jd_inode);
  620. if (error) {
  621. gfs2_revoke_clean(jd);
  622. return;
  623. }
  624. if (pass != 1)
  625. return;
  626. fs_info(sdp, "jid=%u: Found %u revoke tags\n",
  627. jd->jd_jid, jd->jd_found_revokes);
  628. gfs2_revoke_clean(jd);
  629. }
  630. /**
  631. * databuf_lo_before_commit - Scan the data buffers, writing as we go
  632. *
  633. */
  634. static void databuf_lo_before_commit(struct gfs2_sbd *sdp, struct gfs2_trans *tr)
  635. {
  636. unsigned int limit = databuf_limit(sdp);
  637. unsigned int nbuf;
  638. if (tr == NULL)
  639. return;
  640. nbuf = tr->tr_num_databuf_new - tr->tr_num_databuf_rm;
  641. gfs2_before_commit(sdp, limit, nbuf, &tr->tr_databuf, 1);
  642. }
  643. static int databuf_lo_scan_elements(struct gfs2_jdesc *jd, unsigned int start,
  644. struct gfs2_log_descriptor *ld,
  645. __be64 *ptr, int pass)
  646. {
  647. struct gfs2_inode *ip = GFS2_I(jd->jd_inode);
  648. struct gfs2_glock *gl = ip->i_gl;
  649. unsigned int blks = be32_to_cpu(ld->ld_data1);
  650. struct buffer_head *bh_log, *bh_ip;
  651. u64 blkno;
  652. u64 esc;
  653. int error = 0;
  654. if (pass != 1 || be32_to_cpu(ld->ld_type) != GFS2_LOG_DESC_JDATA)
  655. return 0;
  656. gfs2_replay_incr_blk(jd, &start);
  657. for (; blks; gfs2_replay_incr_blk(jd, &start), blks--) {
  658. blkno = be64_to_cpu(*ptr++);
  659. esc = be64_to_cpu(*ptr++);
  660. jd->jd_found_blocks++;
  661. if (gfs2_revoke_check(jd, blkno, start))
  662. continue;
  663. error = gfs2_replay_read_block(jd, start, &bh_log);
  664. if (error)
  665. return error;
  666. bh_ip = gfs2_meta_new(gl, blkno);
  667. memcpy(bh_ip->b_data, bh_log->b_data, bh_log->b_size);
  668. /* Unescape */
  669. if (esc) {
  670. __be32 *eptr = (__be32 *)bh_ip->b_data;
  671. *eptr = cpu_to_be32(GFS2_MAGIC);
  672. }
  673. mark_buffer_dirty(bh_ip);
  674. brelse(bh_log);
  675. brelse(bh_ip);
  676. jd->jd_replayed_blocks++;
  677. }
  678. return error;
  679. }
  680. /* FIXME: sort out accounting for log blocks etc. */
  681. static void databuf_lo_after_scan(struct gfs2_jdesc *jd, int error, int pass)
  682. {
  683. struct gfs2_inode *ip = GFS2_I(jd->jd_inode);
  684. struct gfs2_sbd *sdp = GFS2_SB(jd->jd_inode);
  685. if (error) {
  686. gfs2_meta_sync(ip->i_gl);
  687. return;
  688. }
  689. if (pass != 1)
  690. return;
  691. /* data sync? */
  692. gfs2_meta_sync(ip->i_gl);
  693. fs_info(sdp, "jid=%u: Replayed %u of %u data blocks\n",
  694. jd->jd_jid, jd->jd_replayed_blocks, jd->jd_found_blocks);
  695. }
  696. static void databuf_lo_after_commit(struct gfs2_sbd *sdp, struct gfs2_trans *tr)
  697. {
  698. struct list_head *head;
  699. struct gfs2_bufdata *bd;
  700. if (tr == NULL)
  701. return;
  702. head = &tr->tr_databuf;
  703. while (!list_empty(head)) {
  704. bd = list_entry(head->next, struct gfs2_bufdata, bd_list);
  705. list_del_init(&bd->bd_list);
  706. gfs2_unpin(sdp, bd->bd_bh, tr);
  707. }
  708. }
  709. const struct gfs2_log_operations gfs2_buf_lops = {
  710. .lo_before_commit = buf_lo_before_commit,
  711. .lo_after_commit = buf_lo_after_commit,
  712. .lo_before_scan = buf_lo_before_scan,
  713. .lo_scan_elements = buf_lo_scan_elements,
  714. .lo_after_scan = buf_lo_after_scan,
  715. .lo_name = "buf",
  716. };
  717. const struct gfs2_log_operations gfs2_revoke_lops = {
  718. .lo_before_commit = revoke_lo_before_commit,
  719. .lo_after_commit = revoke_lo_after_commit,
  720. .lo_before_scan = revoke_lo_before_scan,
  721. .lo_scan_elements = revoke_lo_scan_elements,
  722. .lo_after_scan = revoke_lo_after_scan,
  723. .lo_name = "revoke",
  724. };
  725. const struct gfs2_log_operations gfs2_databuf_lops = {
  726. .lo_before_commit = databuf_lo_before_commit,
  727. .lo_after_commit = databuf_lo_after_commit,
  728. .lo_scan_elements = databuf_lo_scan_elements,
  729. .lo_after_scan = databuf_lo_after_scan,
  730. .lo_name = "databuf",
  731. };
  732. const struct gfs2_log_operations *gfs2_log_ops[] = {
  733. &gfs2_databuf_lops,
  734. &gfs2_buf_lops,
  735. &gfs2_revoke_lops,
  736. NULL,
  737. };