lops.c 21 KB

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