meta_io.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457
  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. static int gfs2_aspace_writepage(struct page *page, struct writeback_control *wbc)
  33. {
  34. int err;
  35. struct buffer_head *bh, *head;
  36. int nr_underway = 0;
  37. int write_op = (1 << BIO_RW_META) | ((wbc->sync_mode == WB_SYNC_ALL ?
  38. WRITE_SYNC_PLUG : 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 pdflush and kswapd
  50. * activity, but those code paths have their own higher-level
  51. * throttling.
  52. */
  53. if (wbc->sync_mode != WB_SYNC_NONE || !wbc->nonblocking) {
  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. err = 0;
  81. if (nr_underway == 0)
  82. end_page_writeback(page);
  83. return err;
  84. }
  85. const struct address_space_operations gfs2_meta_aops = {
  86. .writepage = gfs2_aspace_writepage,
  87. .releasepage = gfs2_releasepage,
  88. .sync_page = block_sync_page,
  89. };
  90. /**
  91. * gfs2_meta_sync - Sync all buffers associated with a glock
  92. * @gl: The glock
  93. *
  94. */
  95. void gfs2_meta_sync(struct gfs2_glock *gl)
  96. {
  97. struct address_space *mapping = gfs2_glock2aspace(gl);
  98. int error;
  99. filemap_fdatawrite(mapping);
  100. error = filemap_fdatawait(mapping);
  101. if (error)
  102. gfs2_io_error(gl->gl_sbd);
  103. }
  104. /**
  105. * gfs2_getbuf - Get a buffer with a given address space
  106. * @gl: the glock
  107. * @blkno: the block number (filesystem scope)
  108. * @create: 1 if the buffer should be created
  109. *
  110. * Returns: the buffer
  111. */
  112. struct buffer_head *gfs2_getbuf(struct gfs2_glock *gl, u64 blkno, int create)
  113. {
  114. struct address_space *mapping = gfs2_glock2aspace(gl);
  115. struct gfs2_sbd *sdp = gl->gl_sbd;
  116. struct page *page;
  117. struct buffer_head *bh;
  118. unsigned int shift;
  119. unsigned long index;
  120. unsigned int bufnum;
  121. shift = PAGE_CACHE_SHIFT - sdp->sd_sb.sb_bsize_shift;
  122. index = blkno >> shift; /* convert block to page */
  123. bufnum = blkno - (index << shift); /* block buf index within page */
  124. if (create) {
  125. for (;;) {
  126. page = grab_cache_page(mapping, index);
  127. if (page)
  128. break;
  129. yield();
  130. }
  131. } else {
  132. page = find_lock_page(mapping, index);
  133. if (!page)
  134. return NULL;
  135. }
  136. if (!page_has_buffers(page))
  137. create_empty_buffers(page, sdp->sd_sb.sb_bsize, 0);
  138. /* Locate header for our buffer within our page */
  139. for (bh = page_buffers(page); bufnum--; bh = bh->b_this_page)
  140. /* Do nothing */;
  141. get_bh(bh);
  142. if (!buffer_mapped(bh))
  143. map_bh(bh, sdp->sd_vfs, blkno);
  144. unlock_page(page);
  145. mark_page_accessed(page);
  146. page_cache_release(page);
  147. return bh;
  148. }
  149. static void meta_prep_new(struct buffer_head *bh)
  150. {
  151. struct gfs2_meta_header *mh = (struct gfs2_meta_header *)bh->b_data;
  152. lock_buffer(bh);
  153. clear_buffer_dirty(bh);
  154. set_buffer_uptodate(bh);
  155. unlock_buffer(bh);
  156. mh->mh_magic = cpu_to_be32(GFS2_MAGIC);
  157. }
  158. /**
  159. * gfs2_meta_new - Get a block
  160. * @gl: The glock associated with this block
  161. * @blkno: The block number
  162. *
  163. * Returns: The buffer
  164. */
  165. struct buffer_head *gfs2_meta_new(struct gfs2_glock *gl, u64 blkno)
  166. {
  167. struct buffer_head *bh;
  168. bh = gfs2_getbuf(gl, blkno, CREATE);
  169. meta_prep_new(bh);
  170. return bh;
  171. }
  172. /**
  173. * gfs2_meta_read - Read a block from disk
  174. * @gl: The glock covering the block
  175. * @blkno: The block number
  176. * @flags: flags
  177. * @bhp: the place where the buffer is returned (NULL on failure)
  178. *
  179. * Returns: errno
  180. */
  181. int gfs2_meta_read(struct gfs2_glock *gl, u64 blkno, int flags,
  182. struct buffer_head **bhp)
  183. {
  184. struct gfs2_sbd *sdp = gl->gl_sbd;
  185. struct buffer_head *bh;
  186. if (unlikely(test_bit(SDF_SHUTDOWN, &sdp->sd_flags)))
  187. return -EIO;
  188. *bhp = bh = gfs2_getbuf(gl, blkno, CREATE);
  189. lock_buffer(bh);
  190. if (buffer_uptodate(bh)) {
  191. unlock_buffer(bh);
  192. return 0;
  193. }
  194. bh->b_end_io = end_buffer_read_sync;
  195. get_bh(bh);
  196. submit_bh(READ_SYNC | (1 << BIO_RW_META), bh);
  197. if (!(flags & DIO_WAIT))
  198. return 0;
  199. wait_on_buffer(bh);
  200. if (unlikely(!buffer_uptodate(bh))) {
  201. struct gfs2_trans *tr = current->journal_info;
  202. if (tr && tr->tr_touched)
  203. gfs2_io_error_bh(sdp, bh);
  204. brelse(bh);
  205. return -EIO;
  206. }
  207. return 0;
  208. }
  209. /**
  210. * gfs2_meta_wait - Reread a block from disk
  211. * @sdp: the filesystem
  212. * @bh: The block to wait for
  213. *
  214. * Returns: errno
  215. */
  216. int gfs2_meta_wait(struct gfs2_sbd *sdp, struct buffer_head *bh)
  217. {
  218. if (unlikely(test_bit(SDF_SHUTDOWN, &sdp->sd_flags)))
  219. return -EIO;
  220. wait_on_buffer(bh);
  221. if (!buffer_uptodate(bh)) {
  222. struct gfs2_trans *tr = current->journal_info;
  223. if (tr && tr->tr_touched)
  224. gfs2_io_error_bh(sdp, bh);
  225. return -EIO;
  226. }
  227. if (unlikely(test_bit(SDF_SHUTDOWN, &sdp->sd_flags)))
  228. return -EIO;
  229. return 0;
  230. }
  231. /**
  232. * gfs2_attach_bufdata - attach a struct gfs2_bufdata structure to a buffer
  233. * @gl: the glock the buffer belongs to
  234. * @bh: The buffer to be attached to
  235. * @meta: Flag to indicate whether its metadata or not
  236. */
  237. void gfs2_attach_bufdata(struct gfs2_glock *gl, struct buffer_head *bh,
  238. int meta)
  239. {
  240. struct gfs2_bufdata *bd;
  241. if (meta)
  242. lock_page(bh->b_page);
  243. if (bh->b_private) {
  244. if (meta)
  245. unlock_page(bh->b_page);
  246. return;
  247. }
  248. bd = kmem_cache_zalloc(gfs2_bufdata_cachep, GFP_NOFS | __GFP_NOFAIL);
  249. bd->bd_bh = bh;
  250. bd->bd_gl = gl;
  251. INIT_LIST_HEAD(&bd->bd_list_tr);
  252. if (meta)
  253. lops_init_le(&bd->bd_le, &gfs2_buf_lops);
  254. else
  255. lops_init_le(&bd->bd_le, &gfs2_databuf_lops);
  256. bh->b_private = bd;
  257. if (meta)
  258. unlock_page(bh->b_page);
  259. }
  260. void gfs2_remove_from_journal(struct buffer_head *bh, struct gfs2_trans *tr, int meta)
  261. {
  262. struct address_space *mapping = bh->b_page->mapping;
  263. struct gfs2_sbd *sdp = gfs2_mapping2sbd(mapping);
  264. struct gfs2_bufdata *bd = bh->b_private;
  265. if (test_clear_buffer_pinned(bh)) {
  266. list_del_init(&bd->bd_le.le_list);
  267. if (meta) {
  268. gfs2_assert_warn(sdp, sdp->sd_log_num_buf);
  269. sdp->sd_log_num_buf--;
  270. tr->tr_num_buf_rm++;
  271. } else {
  272. gfs2_assert_warn(sdp, sdp->sd_log_num_databuf);
  273. sdp->sd_log_num_databuf--;
  274. tr->tr_num_databuf_rm++;
  275. }
  276. tr->tr_touched = 1;
  277. brelse(bh);
  278. }
  279. if (bd) {
  280. if (bd->bd_ail) {
  281. gfs2_remove_from_ail(bd);
  282. bh->b_private = NULL;
  283. bd->bd_bh = NULL;
  284. bd->bd_blkno = bh->b_blocknr;
  285. gfs2_trans_add_revoke(sdp, bd);
  286. }
  287. }
  288. clear_buffer_dirty(bh);
  289. clear_buffer_uptodate(bh);
  290. }
  291. /**
  292. * gfs2_meta_wipe - make inode's buffers so they aren't dirty/pinned anymore
  293. * @ip: the inode who owns the buffers
  294. * @bstart: the first buffer in the run
  295. * @blen: the number of buffers in the run
  296. *
  297. */
  298. void gfs2_meta_wipe(struct gfs2_inode *ip, u64 bstart, u32 blen)
  299. {
  300. struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
  301. struct buffer_head *bh;
  302. while (blen) {
  303. bh = gfs2_getbuf(ip->i_gl, bstart, NO_CREATE);
  304. if (bh) {
  305. lock_buffer(bh);
  306. gfs2_log_lock(sdp);
  307. gfs2_remove_from_journal(bh, current->journal_info, 1);
  308. gfs2_log_unlock(sdp);
  309. unlock_buffer(bh);
  310. brelse(bh);
  311. }
  312. bstart++;
  313. blen--;
  314. }
  315. }
  316. /**
  317. * gfs2_meta_indirect_buffer - Get a metadata buffer
  318. * @ip: The GFS2 inode
  319. * @height: The level of this buf in the metadata (indir addr) tree (if any)
  320. * @num: The block number (device relative) of the buffer
  321. * @new: Non-zero if we may create a new buffer
  322. * @bhp: the buffer is returned here
  323. *
  324. * Returns: errno
  325. */
  326. int gfs2_meta_indirect_buffer(struct gfs2_inode *ip, int height, u64 num,
  327. int new, struct buffer_head **bhp)
  328. {
  329. struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
  330. struct gfs2_glock *gl = ip->i_gl;
  331. struct buffer_head *bh;
  332. int ret = 0;
  333. if (new) {
  334. BUG_ON(height == 0);
  335. bh = gfs2_meta_new(gl, num);
  336. gfs2_trans_add_bh(ip->i_gl, bh, 1);
  337. gfs2_metatype_set(bh, GFS2_METATYPE_IN, GFS2_FORMAT_IN);
  338. gfs2_buffer_clear_tail(bh, sizeof(struct gfs2_meta_header));
  339. } else {
  340. u32 mtype = height ? GFS2_METATYPE_IN : GFS2_METATYPE_DI;
  341. ret = gfs2_meta_read(gl, num, DIO_WAIT, &bh);
  342. if (ret == 0 && gfs2_metatype_check(sdp, bh, mtype)) {
  343. brelse(bh);
  344. ret = -EIO;
  345. }
  346. }
  347. *bhp = bh;
  348. return ret;
  349. }
  350. /**
  351. * gfs2_meta_ra - start readahead on an extent of a file
  352. * @gl: the glock the blocks belong to
  353. * @dblock: the starting disk block
  354. * @extlen: the number of blocks in the extent
  355. *
  356. * returns: the first buffer in the extent
  357. */
  358. struct buffer_head *gfs2_meta_ra(struct gfs2_glock *gl, u64 dblock, u32 extlen)
  359. {
  360. struct gfs2_sbd *sdp = gl->gl_sbd;
  361. struct buffer_head *first_bh, *bh;
  362. u32 max_ra = gfs2_tune_get(sdp, gt_max_readahead) >>
  363. sdp->sd_sb.sb_bsize_shift;
  364. BUG_ON(!extlen);
  365. if (max_ra < 1)
  366. max_ra = 1;
  367. if (extlen > max_ra)
  368. extlen = max_ra;
  369. first_bh = gfs2_getbuf(gl, dblock, CREATE);
  370. if (buffer_uptodate(first_bh))
  371. goto out;
  372. if (!buffer_locked(first_bh))
  373. ll_rw_block(READ_SYNC | (1 << BIO_RW_META), 1, &first_bh);
  374. dblock++;
  375. extlen--;
  376. while (extlen) {
  377. bh = gfs2_getbuf(gl, dblock, CREATE);
  378. if (!buffer_uptodate(bh) && !buffer_locked(bh))
  379. ll_rw_block(READA, 1, &bh);
  380. brelse(bh);
  381. dblock++;
  382. extlen--;
  383. if (!buffer_locked(first_bh) && buffer_uptodate(first_bh))
  384. goto out;
  385. }
  386. wait_on_buffer(first_bh);
  387. out:
  388. return first_bh;
  389. }