meta_io.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471
  1. /*
  2. * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
  3. * Copyright (C) 2004-2008 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/mm.h>
  15. #include <linux/pagemap.h>
  16. #include <linux/writeback.h>
  17. #include <linux/swap.h>
  18. #include <linux/delay.h>
  19. #include <linux/bio.h>
  20. #include <linux/gfs2_ondisk.h>
  21. #include "gfs2.h"
  22. #include "incore.h"
  23. #include "glock.h"
  24. #include "glops.h"
  25. #include "inode.h"
  26. #include "log.h"
  27. #include "lops.h"
  28. #include "meta_io.h"
  29. #include "rgrp.h"
  30. #include "trans.h"
  31. #include "util.h"
  32. #include "trace_gfs2.h"
  33. static int gfs2_aspace_writepage(struct page *page, struct writeback_control *wbc)
  34. {
  35. struct buffer_head *bh, *head;
  36. int nr_underway = 0;
  37. int write_op = REQ_META | REQ_PRIO |
  38. (wbc->sync_mode == WB_SYNC_ALL ? WRITE_SYNC : WRITE);
  39. BUG_ON(!PageLocked(page));
  40. BUG_ON(!page_has_buffers(page));
  41. head = page_buffers(page);
  42. bh = head;
  43. do {
  44. if (!buffer_mapped(bh))
  45. continue;
  46. /*
  47. * If it's a fully non-blocking write attempt and we cannot
  48. * lock the buffer then redirty the page. Note that this can
  49. * potentially cause a busy-wait loop from flusher thread and kswapd
  50. * activity, but those code paths have their own higher-level
  51. * throttling.
  52. */
  53. if (wbc->sync_mode != WB_SYNC_NONE) {
  54. lock_buffer(bh);
  55. } else if (!trylock_buffer(bh)) {
  56. redirty_page_for_writepage(wbc, page);
  57. continue;
  58. }
  59. if (test_clear_buffer_dirty(bh)) {
  60. mark_buffer_async_write(bh);
  61. } else {
  62. unlock_buffer(bh);
  63. }
  64. } while ((bh = bh->b_this_page) != head);
  65. /*
  66. * The page and its buffers are protected by PageWriteback(), so we can
  67. * drop the bh refcounts early.
  68. */
  69. BUG_ON(PageWriteback(page));
  70. set_page_writeback(page);
  71. do {
  72. struct buffer_head *next = bh->b_this_page;
  73. if (buffer_async_write(bh)) {
  74. submit_bh(write_op, bh);
  75. nr_underway++;
  76. }
  77. bh = next;
  78. } while (bh != head);
  79. unlock_page(page);
  80. if (nr_underway == 0)
  81. end_page_writeback(page);
  82. return 0;
  83. }
  84. const struct address_space_operations gfs2_meta_aops = {
  85. .writepage = gfs2_aspace_writepage,
  86. .releasepage = gfs2_releasepage,
  87. };
  88. const struct address_space_operations gfs2_rgrp_aops = {
  89. .writepage = gfs2_aspace_writepage,
  90. .releasepage = gfs2_releasepage,
  91. };
  92. /**
  93. * gfs2_getbuf - Get a buffer with a given address space
  94. * @gl: the glock
  95. * @blkno: the block number (filesystem scope)
  96. * @create: 1 if the buffer should be created
  97. *
  98. * Returns: the buffer
  99. */
  100. struct buffer_head *gfs2_getbuf(struct gfs2_glock *gl, u64 blkno, int create)
  101. {
  102. struct address_space *mapping = gfs2_glock2aspace(gl);
  103. struct gfs2_sbd *sdp = gl->gl_name.ln_sbd;
  104. struct page *page;
  105. struct buffer_head *bh;
  106. unsigned int shift;
  107. unsigned long index;
  108. unsigned int bufnum;
  109. if (mapping == NULL)
  110. mapping = &sdp->sd_aspace;
  111. shift = PAGE_CACHE_SHIFT - sdp->sd_sb.sb_bsize_shift;
  112. index = blkno >> shift; /* convert block to page */
  113. bufnum = blkno - (index << shift); /* block buf index within page */
  114. if (create) {
  115. for (;;) {
  116. page = grab_cache_page(mapping, index);
  117. if (page)
  118. break;
  119. yield();
  120. }
  121. } else {
  122. page = find_get_page_flags(mapping, index,
  123. FGP_LOCK|FGP_ACCESSED);
  124. if (!page)
  125. return NULL;
  126. }
  127. if (!page_has_buffers(page))
  128. create_empty_buffers(page, sdp->sd_sb.sb_bsize, 0);
  129. /* Locate header for our buffer within our page */
  130. for (bh = page_buffers(page); bufnum--; bh = bh->b_this_page)
  131. /* Do nothing */;
  132. get_bh(bh);
  133. if (!buffer_mapped(bh))
  134. map_bh(bh, sdp->sd_vfs, blkno);
  135. unlock_page(page);
  136. page_cache_release(page);
  137. return bh;
  138. }
  139. static void meta_prep_new(struct buffer_head *bh)
  140. {
  141. struct gfs2_meta_header *mh = (struct gfs2_meta_header *)bh->b_data;
  142. lock_buffer(bh);
  143. clear_buffer_dirty(bh);
  144. set_buffer_uptodate(bh);
  145. unlock_buffer(bh);
  146. mh->mh_magic = cpu_to_be32(GFS2_MAGIC);
  147. }
  148. /**
  149. * gfs2_meta_new - Get a block
  150. * @gl: The glock associated with this block
  151. * @blkno: The block number
  152. *
  153. * Returns: The buffer
  154. */
  155. struct buffer_head *gfs2_meta_new(struct gfs2_glock *gl, u64 blkno)
  156. {
  157. struct buffer_head *bh;
  158. bh = gfs2_getbuf(gl, blkno, CREATE);
  159. meta_prep_new(bh);
  160. return bh;
  161. }
  162. static void gfs2_meta_read_endio(struct bio *bio)
  163. {
  164. struct bio_vec *bvec;
  165. int i;
  166. bio_for_each_segment_all(bvec, bio, i) {
  167. struct page *page = bvec->bv_page;
  168. struct buffer_head *bh = page_buffers(page);
  169. unsigned int len = bvec->bv_len;
  170. while (bh_offset(bh) < bvec->bv_offset)
  171. bh = bh->b_this_page;
  172. do {
  173. struct buffer_head *next = bh->b_this_page;
  174. len -= bh->b_size;
  175. bh->b_end_io(bh, !bio->bi_error);
  176. bh = next;
  177. } while (bh && len);
  178. }
  179. bio_put(bio);
  180. }
  181. /*
  182. * Submit several consecutive buffer head I/O requests as a single bio I/O
  183. * request. (See submit_bh_wbc.)
  184. */
  185. static void gfs2_submit_bhs(int rw, struct buffer_head *bhs[], int num)
  186. {
  187. struct buffer_head *bh = bhs[0];
  188. struct bio *bio;
  189. int i;
  190. if (!num)
  191. return;
  192. bio = bio_alloc(GFP_NOIO, num);
  193. bio->bi_iter.bi_sector = bh->b_blocknr * (bh->b_size >> 9);
  194. bio->bi_bdev = bh->b_bdev;
  195. for (i = 0; i < num; i++) {
  196. bh = bhs[i];
  197. bio_add_page(bio, bh->b_page, bh->b_size, bh_offset(bh));
  198. }
  199. bio->bi_end_io = gfs2_meta_read_endio;
  200. submit_bio(rw, bio);
  201. }
  202. /**
  203. * gfs2_meta_read - Read a block from disk
  204. * @gl: The glock covering the block
  205. * @blkno: The block number
  206. * @flags: flags
  207. * @bhp: the place where the buffer is returned (NULL on failure)
  208. *
  209. * Returns: errno
  210. */
  211. int gfs2_meta_read(struct gfs2_glock *gl, u64 blkno, int flags,
  212. int rahead, struct buffer_head **bhp)
  213. {
  214. struct gfs2_sbd *sdp = gl->gl_name.ln_sbd;
  215. struct buffer_head *bh, *bhs[2];
  216. int num = 0;
  217. if (unlikely(test_bit(SDF_SHUTDOWN, &sdp->sd_flags))) {
  218. *bhp = NULL;
  219. return -EIO;
  220. }
  221. *bhp = bh = gfs2_getbuf(gl, blkno, CREATE);
  222. lock_buffer(bh);
  223. if (buffer_uptodate(bh)) {
  224. unlock_buffer(bh);
  225. flags &= ~DIO_WAIT;
  226. } else {
  227. bh->b_end_io = end_buffer_read_sync;
  228. get_bh(bh);
  229. bhs[num++] = bh;
  230. }
  231. if (rahead) {
  232. bh = gfs2_getbuf(gl, blkno + 1, CREATE);
  233. lock_buffer(bh);
  234. if (buffer_uptodate(bh)) {
  235. unlock_buffer(bh);
  236. brelse(bh);
  237. } else {
  238. bh->b_end_io = end_buffer_read_sync;
  239. bhs[num++] = bh;
  240. }
  241. }
  242. gfs2_submit_bhs(READ_SYNC | REQ_META | REQ_PRIO, bhs, num);
  243. if (!(flags & DIO_WAIT))
  244. return 0;
  245. bh = *bhp;
  246. wait_on_buffer(bh);
  247. if (unlikely(!buffer_uptodate(bh))) {
  248. struct gfs2_trans *tr = current->journal_info;
  249. if (tr && tr->tr_touched)
  250. gfs2_io_error_bh(sdp, bh);
  251. brelse(bh);
  252. *bhp = NULL;
  253. return -EIO;
  254. }
  255. return 0;
  256. }
  257. /**
  258. * gfs2_meta_wait - Reread a block from disk
  259. * @sdp: the filesystem
  260. * @bh: The block to wait for
  261. *
  262. * Returns: errno
  263. */
  264. int gfs2_meta_wait(struct gfs2_sbd *sdp, struct buffer_head *bh)
  265. {
  266. if (unlikely(test_bit(SDF_SHUTDOWN, &sdp->sd_flags)))
  267. return -EIO;
  268. wait_on_buffer(bh);
  269. if (!buffer_uptodate(bh)) {
  270. struct gfs2_trans *tr = current->journal_info;
  271. if (tr && tr->tr_touched)
  272. gfs2_io_error_bh(sdp, bh);
  273. return -EIO;
  274. }
  275. if (unlikely(test_bit(SDF_SHUTDOWN, &sdp->sd_flags)))
  276. return -EIO;
  277. return 0;
  278. }
  279. void gfs2_remove_from_journal(struct buffer_head *bh, struct gfs2_trans *tr, int meta)
  280. {
  281. struct address_space *mapping = bh->b_page->mapping;
  282. struct gfs2_sbd *sdp = gfs2_mapping2sbd(mapping);
  283. struct gfs2_bufdata *bd = bh->b_private;
  284. int was_pinned = 0;
  285. if (test_clear_buffer_pinned(bh)) {
  286. trace_gfs2_pin(bd, 0);
  287. atomic_dec(&sdp->sd_log_pinned);
  288. list_del_init(&bd->bd_list);
  289. if (meta)
  290. tr->tr_num_buf_rm++;
  291. else
  292. tr->tr_num_databuf_rm++;
  293. tr->tr_touched = 1;
  294. was_pinned = 1;
  295. brelse(bh);
  296. }
  297. if (bd) {
  298. spin_lock(&sdp->sd_ail_lock);
  299. if (bd->bd_tr) {
  300. gfs2_trans_add_revoke(sdp, bd);
  301. } else if (was_pinned) {
  302. bh->b_private = NULL;
  303. kmem_cache_free(gfs2_bufdata_cachep, bd);
  304. }
  305. spin_unlock(&sdp->sd_ail_lock);
  306. }
  307. clear_buffer_dirty(bh);
  308. clear_buffer_uptodate(bh);
  309. }
  310. /**
  311. * gfs2_meta_wipe - make inode's buffers so they aren't dirty/pinned anymore
  312. * @ip: the inode who owns the buffers
  313. * @bstart: the first buffer in the run
  314. * @blen: the number of buffers in the run
  315. *
  316. */
  317. void gfs2_meta_wipe(struct gfs2_inode *ip, u64 bstart, u32 blen)
  318. {
  319. struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
  320. struct buffer_head *bh;
  321. while (blen) {
  322. bh = gfs2_getbuf(ip->i_gl, bstart, NO_CREATE);
  323. if (bh) {
  324. lock_buffer(bh);
  325. gfs2_log_lock(sdp);
  326. gfs2_remove_from_journal(bh, current->journal_info, 1);
  327. gfs2_log_unlock(sdp);
  328. unlock_buffer(bh);
  329. brelse(bh);
  330. }
  331. bstart++;
  332. blen--;
  333. }
  334. }
  335. /**
  336. * gfs2_meta_indirect_buffer - Get a metadata buffer
  337. * @ip: The GFS2 inode
  338. * @height: The level of this buf in the metadata (indir addr) tree (if any)
  339. * @num: The block number (device relative) of the buffer
  340. * @bhp: the buffer is returned here
  341. *
  342. * Returns: errno
  343. */
  344. int gfs2_meta_indirect_buffer(struct gfs2_inode *ip, int height, u64 num,
  345. struct buffer_head **bhp)
  346. {
  347. struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
  348. struct gfs2_glock *gl = ip->i_gl;
  349. struct buffer_head *bh;
  350. int ret = 0;
  351. u32 mtype = height ? GFS2_METATYPE_IN : GFS2_METATYPE_DI;
  352. int rahead = 0;
  353. if (num == ip->i_no_addr)
  354. rahead = ip->i_rahead;
  355. ret = gfs2_meta_read(gl, num, DIO_WAIT, rahead, &bh);
  356. if (ret == 0 && gfs2_metatype_check(sdp, bh, mtype)) {
  357. brelse(bh);
  358. ret = -EIO;
  359. }
  360. *bhp = bh;
  361. return ret;
  362. }
  363. /**
  364. * gfs2_meta_ra - start readahead on an extent of a file
  365. * @gl: the glock the blocks belong to
  366. * @dblock: the starting disk block
  367. * @extlen: the number of blocks in the extent
  368. *
  369. * returns: the first buffer in the extent
  370. */
  371. struct buffer_head *gfs2_meta_ra(struct gfs2_glock *gl, u64 dblock, u32 extlen)
  372. {
  373. struct gfs2_sbd *sdp = gl->gl_name.ln_sbd;
  374. struct buffer_head *first_bh, *bh;
  375. u32 max_ra = gfs2_tune_get(sdp, gt_max_readahead) >>
  376. sdp->sd_sb.sb_bsize_shift;
  377. BUG_ON(!extlen);
  378. if (max_ra < 1)
  379. max_ra = 1;
  380. if (extlen > max_ra)
  381. extlen = max_ra;
  382. first_bh = gfs2_getbuf(gl, dblock, CREATE);
  383. if (buffer_uptodate(first_bh))
  384. goto out;
  385. if (!buffer_locked(first_bh))
  386. ll_rw_block(READ_SYNC | REQ_META, 1, &first_bh);
  387. dblock++;
  388. extlen--;
  389. while (extlen) {
  390. bh = gfs2_getbuf(gl, dblock, CREATE);
  391. if (!buffer_uptodate(bh) && !buffer_locked(bh))
  392. ll_rw_block(READA | REQ_META, 1, &bh);
  393. brelse(bh);
  394. dblock++;
  395. extlen--;
  396. if (!buffer_locked(first_bh) && buffer_uptodate(first_bh))
  397. goto out;
  398. }
  399. wait_on_buffer(first_bh);
  400. out:
  401. return first_bh;
  402. }