mdt.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602
  1. /*
  2. * mdt.c - meta data file for NILFS
  3. *
  4. * Copyright (C) 2005-2008 Nippon Telegraph and Telephone Corporation.
  5. *
  6. * This program is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License as published by
  8. * the Free Software Foundation; either version 2 of the License, or
  9. * (at your option) any later version.
  10. *
  11. * This program is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. * GNU General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public License
  17. * along with this program; if not, write to the Free Software
  18. * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  19. *
  20. * Written by Ryusuke Konishi <ryusuke@osrg.net>
  21. */
  22. #include <linux/buffer_head.h>
  23. #include <linux/mpage.h>
  24. #include <linux/mm.h>
  25. #include <linux/writeback.h>
  26. #include <linux/backing-dev.h>
  27. #include <linux/swap.h>
  28. #include <linux/slab.h>
  29. #include "nilfs.h"
  30. #include "btnode.h"
  31. #include "segment.h"
  32. #include "page.h"
  33. #include "mdt.h"
  34. #define NILFS_MDT_MAX_RA_BLOCKS (16 - 1)
  35. static int
  36. nilfs_mdt_insert_new_block(struct inode *inode, unsigned long block,
  37. struct buffer_head *bh,
  38. void (*init_block)(struct inode *,
  39. struct buffer_head *, void *))
  40. {
  41. struct nilfs_inode_info *ii = NILFS_I(inode);
  42. void *kaddr;
  43. int ret;
  44. /* Caller exclude read accesses using page lock */
  45. /* set_buffer_new(bh); */
  46. bh->b_blocknr = 0;
  47. ret = nilfs_bmap_insert(ii->i_bmap, block, (unsigned long)bh);
  48. if (unlikely(ret))
  49. return ret;
  50. set_buffer_mapped(bh);
  51. kaddr = kmap_atomic(bh->b_page, KM_USER0);
  52. memset(kaddr + bh_offset(bh), 0, 1 << inode->i_blkbits);
  53. if (init_block)
  54. init_block(inode, bh, kaddr);
  55. flush_dcache_page(bh->b_page);
  56. kunmap_atomic(kaddr, KM_USER0);
  57. set_buffer_uptodate(bh);
  58. nilfs_mark_buffer_dirty(bh);
  59. nilfs_mdt_mark_dirty(inode);
  60. return 0;
  61. }
  62. static int nilfs_mdt_create_block(struct inode *inode, unsigned long block,
  63. struct buffer_head **out_bh,
  64. void (*init_block)(struct inode *,
  65. struct buffer_head *,
  66. void *))
  67. {
  68. struct super_block *sb = inode->i_sb;
  69. struct nilfs_transaction_info ti;
  70. struct buffer_head *bh;
  71. int err;
  72. nilfs_transaction_begin(sb, &ti, 0);
  73. err = -ENOMEM;
  74. bh = nilfs_grab_buffer(inode, inode->i_mapping, block, 0);
  75. if (unlikely(!bh))
  76. goto failed_unlock;
  77. err = -EEXIST;
  78. if (buffer_uptodate(bh))
  79. goto failed_bh;
  80. wait_on_buffer(bh);
  81. if (buffer_uptodate(bh))
  82. goto failed_bh;
  83. bh->b_bdev = sb->s_bdev;
  84. err = nilfs_mdt_insert_new_block(inode, block, bh, init_block);
  85. if (likely(!err)) {
  86. get_bh(bh);
  87. *out_bh = bh;
  88. }
  89. failed_bh:
  90. unlock_page(bh->b_page);
  91. page_cache_release(bh->b_page);
  92. brelse(bh);
  93. failed_unlock:
  94. if (likely(!err))
  95. err = nilfs_transaction_commit(sb);
  96. else
  97. nilfs_transaction_abort(sb);
  98. return err;
  99. }
  100. static int
  101. nilfs_mdt_submit_block(struct inode *inode, unsigned long blkoff,
  102. int mode, struct buffer_head **out_bh)
  103. {
  104. struct buffer_head *bh;
  105. __u64 blknum = 0;
  106. int ret = -ENOMEM;
  107. bh = nilfs_grab_buffer(inode, inode->i_mapping, blkoff, 0);
  108. if (unlikely(!bh))
  109. goto failed;
  110. ret = -EEXIST; /* internal code */
  111. if (buffer_uptodate(bh))
  112. goto out;
  113. if (mode == READA) {
  114. if (!trylock_buffer(bh)) {
  115. ret = -EBUSY;
  116. goto failed_bh;
  117. }
  118. } else /* mode == READ */
  119. lock_buffer(bh);
  120. if (buffer_uptodate(bh)) {
  121. unlock_buffer(bh);
  122. goto out;
  123. }
  124. ret = nilfs_bmap_lookup(NILFS_I(inode)->i_bmap, blkoff, &blknum);
  125. if (unlikely(ret)) {
  126. unlock_buffer(bh);
  127. goto failed_bh;
  128. }
  129. map_bh(bh, inode->i_sb, (sector_t)blknum);
  130. bh->b_end_io = end_buffer_read_sync;
  131. get_bh(bh);
  132. submit_bh(mode, bh);
  133. ret = 0;
  134. out:
  135. get_bh(bh);
  136. *out_bh = bh;
  137. failed_bh:
  138. unlock_page(bh->b_page);
  139. page_cache_release(bh->b_page);
  140. brelse(bh);
  141. failed:
  142. return ret;
  143. }
  144. static int nilfs_mdt_read_block(struct inode *inode, unsigned long block,
  145. int readahead, struct buffer_head **out_bh)
  146. {
  147. struct buffer_head *first_bh, *bh;
  148. unsigned long blkoff;
  149. int i, nr_ra_blocks = NILFS_MDT_MAX_RA_BLOCKS;
  150. int err;
  151. err = nilfs_mdt_submit_block(inode, block, READ, &first_bh);
  152. if (err == -EEXIST) /* internal code */
  153. goto out;
  154. if (unlikely(err))
  155. goto failed;
  156. if (readahead) {
  157. blkoff = block + 1;
  158. for (i = 0; i < nr_ra_blocks; i++, blkoff++) {
  159. err = nilfs_mdt_submit_block(inode, blkoff, READA, &bh);
  160. if (likely(!err || err == -EEXIST))
  161. brelse(bh);
  162. else if (err != -EBUSY)
  163. break;
  164. /* abort readahead if bmap lookup failed */
  165. if (!buffer_locked(first_bh))
  166. goto out_no_wait;
  167. }
  168. }
  169. wait_on_buffer(first_bh);
  170. out_no_wait:
  171. err = -EIO;
  172. if (!buffer_uptodate(first_bh))
  173. goto failed_bh;
  174. out:
  175. *out_bh = first_bh;
  176. return 0;
  177. failed_bh:
  178. brelse(first_bh);
  179. failed:
  180. return err;
  181. }
  182. /**
  183. * nilfs_mdt_get_block - read or create a buffer on meta data file.
  184. * @inode: inode of the meta data file
  185. * @blkoff: block offset
  186. * @create: create flag
  187. * @init_block: initializer used for newly allocated block
  188. * @out_bh: output of a pointer to the buffer_head
  189. *
  190. * nilfs_mdt_get_block() looks up the specified buffer and tries to create
  191. * a new buffer if @create is not zero. On success, the returned buffer is
  192. * assured to be either existing or formatted using a buffer lock on success.
  193. * @out_bh is substituted only when zero is returned.
  194. *
  195. * Return Value: On success, it returns 0. On error, the following negative
  196. * error code is returned.
  197. *
  198. * %-ENOMEM - Insufficient memory available.
  199. *
  200. * %-EIO - I/O error
  201. *
  202. * %-ENOENT - the specified block does not exist (hole block)
  203. *
  204. * %-EINVAL - bmap is broken. (the caller should call nilfs_error())
  205. *
  206. * %-EROFS - Read only filesystem (for create mode)
  207. */
  208. int nilfs_mdt_get_block(struct inode *inode, unsigned long blkoff, int create,
  209. void (*init_block)(struct inode *,
  210. struct buffer_head *, void *),
  211. struct buffer_head **out_bh)
  212. {
  213. int ret;
  214. /* Should be rewritten with merging nilfs_mdt_read_block() */
  215. retry:
  216. ret = nilfs_mdt_read_block(inode, blkoff, !create, out_bh);
  217. if (!create || ret != -ENOENT)
  218. return ret;
  219. ret = nilfs_mdt_create_block(inode, blkoff, out_bh, init_block);
  220. if (unlikely(ret == -EEXIST)) {
  221. /* create = 0; */ /* limit read-create loop retries */
  222. goto retry;
  223. }
  224. return ret;
  225. }
  226. /**
  227. * nilfs_mdt_delete_block - make a hole on the meta data file.
  228. * @inode: inode of the meta data file
  229. * @block: block offset
  230. *
  231. * Return Value: On success, zero is returned.
  232. * On error, one of the following negative error code is returned.
  233. *
  234. * %-ENOMEM - Insufficient memory available.
  235. *
  236. * %-EIO - I/O error
  237. *
  238. * %-EINVAL - bmap is broken. (the caller should call nilfs_error())
  239. */
  240. int nilfs_mdt_delete_block(struct inode *inode, unsigned long block)
  241. {
  242. struct nilfs_inode_info *ii = NILFS_I(inode);
  243. int err;
  244. err = nilfs_bmap_delete(ii->i_bmap, block);
  245. if (!err || err == -ENOENT) {
  246. nilfs_mdt_mark_dirty(inode);
  247. nilfs_mdt_forget_block(inode, block);
  248. }
  249. return err;
  250. }
  251. /**
  252. * nilfs_mdt_forget_block - discard dirty state and try to remove the page
  253. * @inode: inode of the meta data file
  254. * @block: block offset
  255. *
  256. * nilfs_mdt_forget_block() clears a dirty flag of the specified buffer, and
  257. * tries to release the page including the buffer from a page cache.
  258. *
  259. * Return Value: On success, 0 is returned. On error, one of the following
  260. * negative error code is returned.
  261. *
  262. * %-EBUSY - page has an active buffer.
  263. *
  264. * %-ENOENT - page cache has no page addressed by the offset.
  265. */
  266. int nilfs_mdt_forget_block(struct inode *inode, unsigned long block)
  267. {
  268. pgoff_t index = (pgoff_t)block >>
  269. (PAGE_CACHE_SHIFT - inode->i_blkbits);
  270. struct page *page;
  271. unsigned long first_block;
  272. int ret = 0;
  273. int still_dirty;
  274. page = find_lock_page(inode->i_mapping, index);
  275. if (!page)
  276. return -ENOENT;
  277. wait_on_page_writeback(page);
  278. first_block = (unsigned long)index <<
  279. (PAGE_CACHE_SHIFT - inode->i_blkbits);
  280. if (page_has_buffers(page)) {
  281. struct buffer_head *bh;
  282. bh = nilfs_page_get_nth_block(page, block - first_block);
  283. nilfs_forget_buffer(bh);
  284. }
  285. still_dirty = PageDirty(page);
  286. unlock_page(page);
  287. page_cache_release(page);
  288. if (still_dirty ||
  289. invalidate_inode_pages2_range(inode->i_mapping, index, index) != 0)
  290. ret = -EBUSY;
  291. return ret;
  292. }
  293. /**
  294. * nilfs_mdt_mark_block_dirty - mark a block on the meta data file dirty.
  295. * @inode: inode of the meta data file
  296. * @block: block offset
  297. *
  298. * Return Value: On success, it returns 0. On error, the following negative
  299. * error code is returned.
  300. *
  301. * %-ENOMEM - Insufficient memory available.
  302. *
  303. * %-EIO - I/O error
  304. *
  305. * %-ENOENT - the specified block does not exist (hole block)
  306. *
  307. * %-EINVAL - bmap is broken. (the caller should call nilfs_error())
  308. */
  309. int nilfs_mdt_mark_block_dirty(struct inode *inode, unsigned long block)
  310. {
  311. struct buffer_head *bh;
  312. int err;
  313. err = nilfs_mdt_read_block(inode, block, 0, &bh);
  314. if (unlikely(err))
  315. return err;
  316. nilfs_mark_buffer_dirty(bh);
  317. nilfs_mdt_mark_dirty(inode);
  318. brelse(bh);
  319. return 0;
  320. }
  321. int nilfs_mdt_fetch_dirty(struct inode *inode)
  322. {
  323. struct nilfs_inode_info *ii = NILFS_I(inode);
  324. if (nilfs_bmap_test_and_clear_dirty(ii->i_bmap)) {
  325. set_bit(NILFS_I_DIRTY, &ii->i_state);
  326. return 1;
  327. }
  328. return test_bit(NILFS_I_DIRTY, &ii->i_state);
  329. }
  330. static int
  331. nilfs_mdt_write_page(struct page *page, struct writeback_control *wbc)
  332. {
  333. struct inode *inode;
  334. struct super_block *sb;
  335. int err = 0;
  336. redirty_page_for_writepage(wbc, page);
  337. unlock_page(page);
  338. inode = page->mapping->host;
  339. if (!inode)
  340. return 0;
  341. sb = inode->i_sb;
  342. if (wbc->sync_mode == WB_SYNC_ALL)
  343. err = nilfs_construct_segment(sb);
  344. else if (wbc->for_reclaim)
  345. nilfs_flush_segment(sb, inode->i_ino);
  346. return err;
  347. }
  348. static const struct address_space_operations def_mdt_aops = {
  349. .writepage = nilfs_mdt_write_page,
  350. .sync_page = block_sync_page,
  351. };
  352. static const struct inode_operations def_mdt_iops;
  353. static const struct file_operations def_mdt_fops;
  354. int nilfs_mdt_init(struct inode *inode, gfp_t gfp_mask, size_t objsz)
  355. {
  356. struct nilfs_mdt_info *mi;
  357. mi = kzalloc(max(sizeof(*mi), objsz), GFP_NOFS);
  358. if (!mi)
  359. return -ENOMEM;
  360. init_rwsem(&mi->mi_sem);
  361. inode->i_private = mi;
  362. inode->i_mode = S_IFREG;
  363. mapping_set_gfp_mask(inode->i_mapping, gfp_mask);
  364. inode->i_mapping->backing_dev_info = inode->i_sb->s_bdi;
  365. inode->i_op = &def_mdt_iops;
  366. inode->i_fop = &def_mdt_fops;
  367. inode->i_mapping->a_ops = &def_mdt_aops;
  368. return 0;
  369. }
  370. void nilfs_mdt_set_entry_size(struct inode *inode, unsigned entry_size,
  371. unsigned header_size)
  372. {
  373. struct nilfs_mdt_info *mi = NILFS_MDT(inode);
  374. mi->mi_entry_size = entry_size;
  375. mi->mi_entries_per_block = (1 << inode->i_blkbits) / entry_size;
  376. mi->mi_first_entry_offset = DIV_ROUND_UP(header_size, entry_size);
  377. }
  378. static const struct address_space_operations shadow_map_aops = {
  379. .sync_page = block_sync_page,
  380. };
  381. /**
  382. * nilfs_mdt_setup_shadow_map - setup shadow map and bind it to metadata file
  383. * @inode: inode of the metadata file
  384. * @shadow: shadow mapping
  385. */
  386. int nilfs_mdt_setup_shadow_map(struct inode *inode,
  387. struct nilfs_shadow_map *shadow)
  388. {
  389. struct nilfs_mdt_info *mi = NILFS_MDT(inode);
  390. struct backing_dev_info *bdi = inode->i_sb->s_bdi;
  391. INIT_LIST_HEAD(&shadow->frozen_buffers);
  392. nilfs_mapping_init_once(&shadow->frozen_data);
  393. nilfs_mapping_init(&shadow->frozen_data, bdi, &shadow_map_aops);
  394. nilfs_mapping_init_once(&shadow->frozen_btnodes);
  395. nilfs_mapping_init(&shadow->frozen_btnodes, bdi, &shadow_map_aops);
  396. mi->mi_shadow = shadow;
  397. return 0;
  398. }
  399. /**
  400. * nilfs_mdt_save_to_shadow_map - copy bmap and dirty pages to shadow map
  401. * @inode: inode of the metadata file
  402. */
  403. int nilfs_mdt_save_to_shadow_map(struct inode *inode)
  404. {
  405. struct nilfs_mdt_info *mi = NILFS_MDT(inode);
  406. struct nilfs_inode_info *ii = NILFS_I(inode);
  407. struct nilfs_shadow_map *shadow = mi->mi_shadow;
  408. int ret;
  409. ret = nilfs_copy_dirty_pages(&shadow->frozen_data, inode->i_mapping);
  410. if (ret)
  411. goto out;
  412. ret = nilfs_copy_dirty_pages(&shadow->frozen_btnodes,
  413. &ii->i_btnode_cache);
  414. if (ret)
  415. goto out;
  416. nilfs_bmap_save(ii->i_bmap, &shadow->bmap_store);
  417. out:
  418. return ret;
  419. }
  420. int nilfs_mdt_freeze_buffer(struct inode *inode, struct buffer_head *bh)
  421. {
  422. struct nilfs_shadow_map *shadow = NILFS_MDT(inode)->mi_shadow;
  423. struct buffer_head *bh_frozen;
  424. struct page *page;
  425. int blkbits = inode->i_blkbits;
  426. int ret = -ENOMEM;
  427. page = grab_cache_page(&shadow->frozen_data, bh->b_page->index);
  428. if (!page)
  429. return ret;
  430. if (!page_has_buffers(page))
  431. create_empty_buffers(page, 1 << blkbits, 0);
  432. bh_frozen = nilfs_page_get_nth_block(page, bh_offset(bh) >> blkbits);
  433. if (bh_frozen) {
  434. if (!buffer_uptodate(bh_frozen))
  435. nilfs_copy_buffer(bh_frozen, bh);
  436. if (list_empty(&bh_frozen->b_assoc_buffers)) {
  437. list_add_tail(&bh_frozen->b_assoc_buffers,
  438. &shadow->frozen_buffers);
  439. set_buffer_nilfs_redirected(bh);
  440. } else {
  441. brelse(bh_frozen); /* already frozen */
  442. }
  443. ret = 0;
  444. }
  445. unlock_page(page);
  446. page_cache_release(page);
  447. return ret;
  448. }
  449. struct buffer_head *
  450. nilfs_mdt_get_frozen_buffer(struct inode *inode, struct buffer_head *bh)
  451. {
  452. struct nilfs_shadow_map *shadow = NILFS_MDT(inode)->mi_shadow;
  453. struct buffer_head *bh_frozen = NULL;
  454. struct page *page;
  455. int n;
  456. page = find_lock_page(&shadow->frozen_data, bh->b_page->index);
  457. if (page) {
  458. if (page_has_buffers(page)) {
  459. n = bh_offset(bh) >> inode->i_blkbits;
  460. bh_frozen = nilfs_page_get_nth_block(page, n);
  461. }
  462. unlock_page(page);
  463. page_cache_release(page);
  464. }
  465. return bh_frozen;
  466. }
  467. static void nilfs_release_frozen_buffers(struct nilfs_shadow_map *shadow)
  468. {
  469. struct list_head *head = &shadow->frozen_buffers;
  470. struct buffer_head *bh;
  471. while (!list_empty(head)) {
  472. bh = list_first_entry(head, struct buffer_head,
  473. b_assoc_buffers);
  474. list_del_init(&bh->b_assoc_buffers);
  475. brelse(bh); /* drop ref-count to make it releasable */
  476. }
  477. }
  478. /**
  479. * nilfs_mdt_restore_from_shadow_map - restore dirty pages and bmap state
  480. * @inode: inode of the metadata file
  481. */
  482. void nilfs_mdt_restore_from_shadow_map(struct inode *inode)
  483. {
  484. struct nilfs_mdt_info *mi = NILFS_MDT(inode);
  485. struct nilfs_inode_info *ii = NILFS_I(inode);
  486. struct nilfs_shadow_map *shadow = mi->mi_shadow;
  487. down_write(&mi->mi_sem);
  488. if (mi->mi_palloc_cache)
  489. nilfs_palloc_clear_cache(inode);
  490. nilfs_clear_dirty_pages(inode->i_mapping);
  491. nilfs_copy_back_pages(inode->i_mapping, &shadow->frozen_data);
  492. nilfs_clear_dirty_pages(&ii->i_btnode_cache);
  493. nilfs_copy_back_pages(&ii->i_btnode_cache, &shadow->frozen_btnodes);
  494. nilfs_bmap_restore(ii->i_bmap, &shadow->bmap_store);
  495. up_write(&mi->mi_sem);
  496. }
  497. /**
  498. * nilfs_mdt_clear_shadow_map - truncate pages in shadow map caches
  499. * @inode: inode of the metadata file
  500. */
  501. void nilfs_mdt_clear_shadow_map(struct inode *inode)
  502. {
  503. struct nilfs_mdt_info *mi = NILFS_MDT(inode);
  504. struct nilfs_shadow_map *shadow = mi->mi_shadow;
  505. down_write(&mi->mi_sem);
  506. nilfs_release_frozen_buffers(shadow);
  507. truncate_inode_pages(&shadow->frozen_data, 0);
  508. truncate_inode_pages(&shadow->frozen_btnodes, 0);
  509. up_write(&mi->mi_sem);
  510. }