mdt.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742
  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. #define INIT_UNUSED_INODE_FIELDS
  36. static int
  37. nilfs_mdt_insert_new_block(struct inode *inode, unsigned long block,
  38. struct buffer_head *bh,
  39. void (*init_block)(struct inode *,
  40. struct buffer_head *, void *))
  41. {
  42. struct nilfs_inode_info *ii = NILFS_I(inode);
  43. void *kaddr;
  44. int ret;
  45. /* Caller exclude read accesses using page lock */
  46. /* set_buffer_new(bh); */
  47. bh->b_blocknr = 0;
  48. ret = nilfs_bmap_insert(ii->i_bmap, block, (unsigned long)bh);
  49. if (unlikely(ret))
  50. return ret;
  51. set_buffer_mapped(bh);
  52. kaddr = kmap_atomic(bh->b_page, KM_USER0);
  53. memset(kaddr + bh_offset(bh), 0, 1 << inode->i_blkbits);
  54. if (init_block)
  55. init_block(inode, bh, kaddr);
  56. flush_dcache_page(bh->b_page);
  57. kunmap_atomic(kaddr, KM_USER0);
  58. set_buffer_uptodate(bh);
  59. nilfs_mark_buffer_dirty(bh);
  60. nilfs_mdt_mark_dirty(inode);
  61. return 0;
  62. }
  63. static int nilfs_mdt_create_block(struct inode *inode, unsigned long block,
  64. struct buffer_head **out_bh,
  65. void (*init_block)(struct inode *,
  66. struct buffer_head *,
  67. void *))
  68. {
  69. struct the_nilfs *nilfs = NILFS_I_NILFS(inode);
  70. struct super_block *sb = inode->i_sb;
  71. struct nilfs_transaction_info ti;
  72. struct buffer_head *bh;
  73. int err;
  74. if (!sb) {
  75. /*
  76. * Make sure this function is not called from any
  77. * read-only context.
  78. */
  79. if (!nilfs->ns_writer) {
  80. WARN_ON(1);
  81. err = -EROFS;
  82. goto out;
  83. }
  84. sb = nilfs->ns_writer->s_super;
  85. }
  86. nilfs_transaction_begin(sb, &ti, 0);
  87. err = -ENOMEM;
  88. bh = nilfs_grab_buffer(inode, inode->i_mapping, block, 0);
  89. if (unlikely(!bh))
  90. goto failed_unlock;
  91. err = -EEXIST;
  92. if (buffer_uptodate(bh))
  93. goto failed_bh;
  94. wait_on_buffer(bh);
  95. if (buffer_uptodate(bh))
  96. goto failed_bh;
  97. bh->b_bdev = nilfs->ns_bdev;
  98. err = nilfs_mdt_insert_new_block(inode, block, bh, init_block);
  99. if (likely(!err)) {
  100. get_bh(bh);
  101. *out_bh = bh;
  102. }
  103. failed_bh:
  104. unlock_page(bh->b_page);
  105. page_cache_release(bh->b_page);
  106. brelse(bh);
  107. failed_unlock:
  108. if (likely(!err))
  109. err = nilfs_transaction_commit(sb);
  110. else
  111. nilfs_transaction_abort(sb);
  112. out:
  113. return err;
  114. }
  115. static int
  116. nilfs_mdt_submit_block(struct inode *inode, unsigned long blkoff,
  117. int mode, struct buffer_head **out_bh)
  118. {
  119. struct buffer_head *bh;
  120. __u64 blknum = 0;
  121. int ret = -ENOMEM;
  122. bh = nilfs_grab_buffer(inode, inode->i_mapping, blkoff, 0);
  123. if (unlikely(!bh))
  124. goto failed;
  125. ret = -EEXIST; /* internal code */
  126. if (buffer_uptodate(bh))
  127. goto out;
  128. if (mode == READA) {
  129. if (!trylock_buffer(bh)) {
  130. ret = -EBUSY;
  131. goto failed_bh;
  132. }
  133. } else /* mode == READ */
  134. lock_buffer(bh);
  135. if (buffer_uptodate(bh)) {
  136. unlock_buffer(bh);
  137. goto out;
  138. }
  139. ret = nilfs_bmap_lookup(NILFS_I(inode)->i_bmap, blkoff, &blknum);
  140. if (unlikely(ret)) {
  141. unlock_buffer(bh);
  142. goto failed_bh;
  143. }
  144. map_bh(bh, inode->i_sb, (sector_t)blknum);
  145. bh->b_end_io = end_buffer_read_sync;
  146. get_bh(bh);
  147. submit_bh(mode, bh);
  148. ret = 0;
  149. out:
  150. get_bh(bh);
  151. *out_bh = bh;
  152. failed_bh:
  153. unlock_page(bh->b_page);
  154. page_cache_release(bh->b_page);
  155. brelse(bh);
  156. failed:
  157. return ret;
  158. }
  159. static int nilfs_mdt_read_block(struct inode *inode, unsigned long block,
  160. int readahead, struct buffer_head **out_bh)
  161. {
  162. struct buffer_head *first_bh, *bh;
  163. unsigned long blkoff;
  164. int i, nr_ra_blocks = NILFS_MDT_MAX_RA_BLOCKS;
  165. int err;
  166. err = nilfs_mdt_submit_block(inode, block, READ, &first_bh);
  167. if (err == -EEXIST) /* internal code */
  168. goto out;
  169. if (unlikely(err))
  170. goto failed;
  171. if (readahead) {
  172. blkoff = block + 1;
  173. for (i = 0; i < nr_ra_blocks; i++, blkoff++) {
  174. err = nilfs_mdt_submit_block(inode, blkoff, READA, &bh);
  175. if (likely(!err || err == -EEXIST))
  176. brelse(bh);
  177. else if (err != -EBUSY)
  178. break;
  179. /* abort readahead if bmap lookup failed */
  180. if (!buffer_locked(first_bh))
  181. goto out_no_wait;
  182. }
  183. }
  184. wait_on_buffer(first_bh);
  185. out_no_wait:
  186. err = -EIO;
  187. if (!buffer_uptodate(first_bh))
  188. goto failed_bh;
  189. out:
  190. *out_bh = first_bh;
  191. return 0;
  192. failed_bh:
  193. brelse(first_bh);
  194. failed:
  195. return err;
  196. }
  197. /**
  198. * nilfs_mdt_get_block - read or create a buffer on meta data file.
  199. * @inode: inode of the meta data file
  200. * @blkoff: block offset
  201. * @create: create flag
  202. * @init_block: initializer used for newly allocated block
  203. * @out_bh: output of a pointer to the buffer_head
  204. *
  205. * nilfs_mdt_get_block() looks up the specified buffer and tries to create
  206. * a new buffer if @create is not zero. On success, the returned buffer is
  207. * assured to be either existing or formatted using a buffer lock on success.
  208. * @out_bh is substituted only when zero is returned.
  209. *
  210. * Return Value: On success, it returns 0. On error, the following negative
  211. * error code is returned.
  212. *
  213. * %-ENOMEM - Insufficient memory available.
  214. *
  215. * %-EIO - I/O error
  216. *
  217. * %-ENOENT - the specified block does not exist (hole block)
  218. *
  219. * %-EINVAL - bmap is broken. (the caller should call nilfs_error())
  220. *
  221. * %-EROFS - Read only filesystem (for create mode)
  222. */
  223. int nilfs_mdt_get_block(struct inode *inode, unsigned long blkoff, int create,
  224. void (*init_block)(struct inode *,
  225. struct buffer_head *, void *),
  226. struct buffer_head **out_bh)
  227. {
  228. int ret;
  229. /* Should be rewritten with merging nilfs_mdt_read_block() */
  230. retry:
  231. ret = nilfs_mdt_read_block(inode, blkoff, !create, out_bh);
  232. if (!create || ret != -ENOENT)
  233. return ret;
  234. ret = nilfs_mdt_create_block(inode, blkoff, out_bh, init_block);
  235. if (unlikely(ret == -EEXIST)) {
  236. /* create = 0; */ /* limit read-create loop retries */
  237. goto retry;
  238. }
  239. return ret;
  240. }
  241. /**
  242. * nilfs_mdt_delete_block - make a hole on the meta data file.
  243. * @inode: inode of the meta data file
  244. * @block: block offset
  245. *
  246. * Return Value: On success, zero is returned.
  247. * On error, one of the following negative error code is returned.
  248. *
  249. * %-ENOMEM - Insufficient memory available.
  250. *
  251. * %-EIO - I/O error
  252. *
  253. * %-EINVAL - bmap is broken. (the caller should call nilfs_error())
  254. */
  255. int nilfs_mdt_delete_block(struct inode *inode, unsigned long block)
  256. {
  257. struct nilfs_inode_info *ii = NILFS_I(inode);
  258. int err;
  259. err = nilfs_bmap_delete(ii->i_bmap, block);
  260. if (!err || err == -ENOENT) {
  261. nilfs_mdt_mark_dirty(inode);
  262. nilfs_mdt_forget_block(inode, block);
  263. }
  264. return err;
  265. }
  266. /**
  267. * nilfs_mdt_forget_block - discard dirty state and try to remove the page
  268. * @inode: inode of the meta data file
  269. * @block: block offset
  270. *
  271. * nilfs_mdt_forget_block() clears a dirty flag of the specified buffer, and
  272. * tries to release the page including the buffer from a page cache.
  273. *
  274. * Return Value: On success, 0 is returned. On error, one of the following
  275. * negative error code is returned.
  276. *
  277. * %-EBUSY - page has an active buffer.
  278. *
  279. * %-ENOENT - page cache has no page addressed by the offset.
  280. */
  281. int nilfs_mdt_forget_block(struct inode *inode, unsigned long block)
  282. {
  283. pgoff_t index = (pgoff_t)block >>
  284. (PAGE_CACHE_SHIFT - inode->i_blkbits);
  285. struct page *page;
  286. unsigned long first_block;
  287. int ret = 0;
  288. int still_dirty;
  289. page = find_lock_page(inode->i_mapping, index);
  290. if (!page)
  291. return -ENOENT;
  292. wait_on_page_writeback(page);
  293. first_block = (unsigned long)index <<
  294. (PAGE_CACHE_SHIFT - inode->i_blkbits);
  295. if (page_has_buffers(page)) {
  296. struct buffer_head *bh;
  297. bh = nilfs_page_get_nth_block(page, block - first_block);
  298. nilfs_forget_buffer(bh);
  299. }
  300. still_dirty = PageDirty(page);
  301. unlock_page(page);
  302. page_cache_release(page);
  303. if (still_dirty ||
  304. invalidate_inode_pages2_range(inode->i_mapping, index, index) != 0)
  305. ret = -EBUSY;
  306. return ret;
  307. }
  308. /**
  309. * nilfs_mdt_mark_block_dirty - mark a block on the meta data file dirty.
  310. * @inode: inode of the meta data file
  311. * @block: block offset
  312. *
  313. * Return Value: On success, it returns 0. On error, the following negative
  314. * error code is returned.
  315. *
  316. * %-ENOMEM - Insufficient memory available.
  317. *
  318. * %-EIO - I/O error
  319. *
  320. * %-ENOENT - the specified block does not exist (hole block)
  321. *
  322. * %-EINVAL - bmap is broken. (the caller should call nilfs_error())
  323. */
  324. int nilfs_mdt_mark_block_dirty(struct inode *inode, unsigned long block)
  325. {
  326. struct buffer_head *bh;
  327. int err;
  328. err = nilfs_mdt_read_block(inode, block, 0, &bh);
  329. if (unlikely(err))
  330. return err;
  331. nilfs_mark_buffer_dirty(bh);
  332. nilfs_mdt_mark_dirty(inode);
  333. brelse(bh);
  334. return 0;
  335. }
  336. int nilfs_mdt_fetch_dirty(struct inode *inode)
  337. {
  338. struct nilfs_inode_info *ii = NILFS_I(inode);
  339. if (nilfs_bmap_test_and_clear_dirty(ii->i_bmap)) {
  340. set_bit(NILFS_I_DIRTY, &ii->i_state);
  341. return 1;
  342. }
  343. return test_bit(NILFS_I_DIRTY, &ii->i_state);
  344. }
  345. static int
  346. nilfs_mdt_write_page(struct page *page, struct writeback_control *wbc)
  347. {
  348. struct inode *inode;
  349. struct super_block *sb;
  350. struct the_nilfs *nilfs;
  351. struct nilfs_sb_info *writer = NULL;
  352. int err = 0;
  353. redirty_page_for_writepage(wbc, page);
  354. unlock_page(page);
  355. inode = page->mapping->host;
  356. if (!inode)
  357. return 0;
  358. sb = inode->i_sb;
  359. nilfs = NILFS_SB(sb)->s_nilfs;
  360. if (!sb) {
  361. down_read(&nilfs->ns_writer_sem);
  362. writer = nilfs->ns_writer;
  363. if (!writer) {
  364. up_read(&nilfs->ns_writer_sem);
  365. return -EROFS;
  366. }
  367. sb = writer->s_super;
  368. }
  369. if (wbc->sync_mode == WB_SYNC_ALL)
  370. err = nilfs_construct_segment(sb);
  371. else if (wbc->for_reclaim)
  372. nilfs_flush_segment(sb, inode->i_ino);
  373. if (writer)
  374. up_read(&nilfs->ns_writer_sem);
  375. return err;
  376. }
  377. static const struct address_space_operations def_mdt_aops = {
  378. .writepage = nilfs_mdt_write_page,
  379. .sync_page = block_sync_page,
  380. };
  381. static const struct inode_operations def_mdt_iops;
  382. static const struct file_operations def_mdt_fops;
  383. int nilfs_mdt_init(struct inode *inode, gfp_t gfp_mask, size_t objsz)
  384. {
  385. struct nilfs_mdt_info *mi;
  386. mi = kzalloc(max(sizeof(*mi), objsz), GFP_NOFS);
  387. if (!mi)
  388. return -ENOMEM;
  389. init_rwsem(&mi->mi_sem);
  390. inode->i_private = mi;
  391. inode->i_mode = S_IFREG;
  392. mapping_set_gfp_mask(inode->i_mapping, gfp_mask);
  393. inode->i_mapping->backing_dev_info = inode->i_sb->s_bdi;
  394. inode->i_op = &def_mdt_iops;
  395. inode->i_fop = &def_mdt_fops;
  396. inode->i_mapping->a_ops = &def_mdt_aops;
  397. return 0;
  398. }
  399. /*
  400. * NILFS2 uses pseudo inodes for meta data files such as DAT, cpfile, sufile,
  401. * ifile, or gcinodes. This allows the B-tree code and segment constructor
  402. * to treat them like regular files, and this helps to simplify the
  403. * implementation.
  404. * On the other hand, some of the pseudo inodes have an irregular point:
  405. * They don't have valid inode->i_sb pointer because their lifetimes are
  406. * longer than those of the super block structs; they may continue for
  407. * several consecutive mounts/umounts. This would need discussions.
  408. */
  409. /**
  410. * nilfs_mdt_new_common - allocate a pseudo inode for metadata file
  411. * @nilfs: nilfs object
  412. * @sb: super block instance the metadata file belongs to
  413. * @ino: inode number
  414. */
  415. struct inode *
  416. nilfs_mdt_new_common(struct the_nilfs *nilfs, struct super_block *sb,
  417. ino_t ino)
  418. {
  419. struct inode *inode = nilfs_alloc_inode_common(nilfs);
  420. if (!inode)
  421. return NULL;
  422. else {
  423. struct address_space * const mapping = &inode->i_data;
  424. inode->i_sb = sb; /* sb may be NULL for some meta data files */
  425. inode->i_blkbits = nilfs->ns_blocksize_bits;
  426. inode->i_flags = 0;
  427. atomic_set(&inode->i_count, 1);
  428. inode->i_nlink = 1;
  429. inode->i_ino = ino;
  430. #ifdef INIT_UNUSED_INODE_FIELDS
  431. atomic_set(&inode->i_writecount, 0);
  432. inode->i_size = 0;
  433. inode->i_blocks = 0;
  434. inode->i_bytes = 0;
  435. inode->i_generation = 0;
  436. #ifdef CONFIG_QUOTA
  437. memset(&inode->i_dquot, 0, sizeof(inode->i_dquot));
  438. #endif
  439. inode->i_pipe = NULL;
  440. inode->i_bdev = NULL;
  441. inode->i_cdev = NULL;
  442. inode->i_rdev = 0;
  443. #ifdef CONFIG_SECURITY
  444. inode->i_security = NULL;
  445. #endif
  446. inode->dirtied_when = 0;
  447. INIT_LIST_HEAD(&inode->i_list);
  448. INIT_LIST_HEAD(&inode->i_sb_list);
  449. inode->i_state = 0;
  450. #endif
  451. spin_lock_init(&inode->i_lock);
  452. mutex_init(&inode->i_mutex);
  453. init_rwsem(&inode->i_alloc_sem);
  454. mapping->host = NULL; /* instead of inode */
  455. mapping->flags = 0;
  456. mapping->assoc_mapping = NULL;
  457. inode->i_mapping = mapping;
  458. }
  459. return inode;
  460. }
  461. struct inode *nilfs_mdt_new(struct the_nilfs *nilfs, struct super_block *sb,
  462. ino_t ino, size_t objsz)
  463. {
  464. struct inode *inode;
  465. inode = nilfs_mdt_new_common(nilfs, sb, ino);
  466. if (!inode)
  467. return NULL;
  468. if (nilfs_mdt_init(inode, NILFS_MDT_GFP, objsz) < 0) {
  469. nilfs_destroy_inode(inode);
  470. return NULL;
  471. }
  472. return inode;
  473. }
  474. void nilfs_mdt_set_entry_size(struct inode *inode, unsigned entry_size,
  475. unsigned header_size)
  476. {
  477. struct nilfs_mdt_info *mi = NILFS_MDT(inode);
  478. mi->mi_entry_size = entry_size;
  479. mi->mi_entries_per_block = (1 << inode->i_blkbits) / entry_size;
  480. mi->mi_first_entry_offset = DIV_ROUND_UP(header_size, entry_size);
  481. }
  482. static const struct address_space_operations shadow_map_aops = {
  483. .sync_page = block_sync_page,
  484. };
  485. /**
  486. * nilfs_mdt_setup_shadow_map - setup shadow map and bind it to metadata file
  487. * @inode: inode of the metadata file
  488. * @shadow: shadow mapping
  489. */
  490. int nilfs_mdt_setup_shadow_map(struct inode *inode,
  491. struct nilfs_shadow_map *shadow)
  492. {
  493. struct nilfs_mdt_info *mi = NILFS_MDT(inode);
  494. struct backing_dev_info *bdi = NILFS_I_NILFS(inode)->ns_bdi;
  495. INIT_LIST_HEAD(&shadow->frozen_buffers);
  496. nilfs_mapping_init_once(&shadow->frozen_data);
  497. nilfs_mapping_init(&shadow->frozen_data, bdi, &shadow_map_aops);
  498. nilfs_mapping_init_once(&shadow->frozen_btnodes);
  499. nilfs_mapping_init(&shadow->frozen_btnodes, bdi, &shadow_map_aops);
  500. mi->mi_shadow = shadow;
  501. return 0;
  502. }
  503. /**
  504. * nilfs_mdt_save_to_shadow_map - copy bmap and dirty pages to shadow map
  505. * @inode: inode of the metadata file
  506. */
  507. int nilfs_mdt_save_to_shadow_map(struct inode *inode)
  508. {
  509. struct nilfs_mdt_info *mi = NILFS_MDT(inode);
  510. struct nilfs_inode_info *ii = NILFS_I(inode);
  511. struct nilfs_shadow_map *shadow = mi->mi_shadow;
  512. int ret;
  513. ret = nilfs_copy_dirty_pages(&shadow->frozen_data, inode->i_mapping);
  514. if (ret)
  515. goto out;
  516. ret = nilfs_copy_dirty_pages(&shadow->frozen_btnodes,
  517. &ii->i_btnode_cache);
  518. if (ret)
  519. goto out;
  520. nilfs_bmap_save(ii->i_bmap, &shadow->bmap_store);
  521. out:
  522. return ret;
  523. }
  524. int nilfs_mdt_freeze_buffer(struct inode *inode, struct buffer_head *bh)
  525. {
  526. struct nilfs_shadow_map *shadow = NILFS_MDT(inode)->mi_shadow;
  527. struct buffer_head *bh_frozen;
  528. struct page *page;
  529. int blkbits = inode->i_blkbits;
  530. int ret = -ENOMEM;
  531. page = grab_cache_page(&shadow->frozen_data, bh->b_page->index);
  532. if (!page)
  533. return ret;
  534. if (!page_has_buffers(page))
  535. create_empty_buffers(page, 1 << blkbits, 0);
  536. bh_frozen = nilfs_page_get_nth_block(page, bh_offset(bh) >> blkbits);
  537. if (bh_frozen) {
  538. if (!buffer_uptodate(bh_frozen))
  539. nilfs_copy_buffer(bh_frozen, bh);
  540. if (list_empty(&bh_frozen->b_assoc_buffers)) {
  541. list_add_tail(&bh_frozen->b_assoc_buffers,
  542. &shadow->frozen_buffers);
  543. set_buffer_nilfs_redirected(bh);
  544. } else {
  545. brelse(bh_frozen); /* already frozen */
  546. }
  547. ret = 0;
  548. }
  549. unlock_page(page);
  550. page_cache_release(page);
  551. return ret;
  552. }
  553. struct buffer_head *
  554. nilfs_mdt_get_frozen_buffer(struct inode *inode, struct buffer_head *bh)
  555. {
  556. struct nilfs_shadow_map *shadow = NILFS_MDT(inode)->mi_shadow;
  557. struct buffer_head *bh_frozen = NULL;
  558. struct page *page;
  559. int n;
  560. page = find_lock_page(&shadow->frozen_data, bh->b_page->index);
  561. if (page) {
  562. if (page_has_buffers(page)) {
  563. n = bh_offset(bh) >> inode->i_blkbits;
  564. bh_frozen = nilfs_page_get_nth_block(page, n);
  565. }
  566. unlock_page(page);
  567. page_cache_release(page);
  568. }
  569. return bh_frozen;
  570. }
  571. static void nilfs_release_frozen_buffers(struct nilfs_shadow_map *shadow)
  572. {
  573. struct list_head *head = &shadow->frozen_buffers;
  574. struct buffer_head *bh;
  575. while (!list_empty(head)) {
  576. bh = list_first_entry(head, struct buffer_head,
  577. b_assoc_buffers);
  578. list_del_init(&bh->b_assoc_buffers);
  579. brelse(bh); /* drop ref-count to make it releasable */
  580. }
  581. }
  582. /**
  583. * nilfs_mdt_restore_from_shadow_map - restore dirty pages and bmap state
  584. * @inode: inode of the metadata file
  585. */
  586. void nilfs_mdt_restore_from_shadow_map(struct inode *inode)
  587. {
  588. struct nilfs_mdt_info *mi = NILFS_MDT(inode);
  589. struct nilfs_inode_info *ii = NILFS_I(inode);
  590. struct nilfs_shadow_map *shadow = mi->mi_shadow;
  591. down_write(&mi->mi_sem);
  592. if (mi->mi_palloc_cache)
  593. nilfs_palloc_clear_cache(inode);
  594. nilfs_clear_dirty_pages(inode->i_mapping);
  595. nilfs_copy_back_pages(inode->i_mapping, &shadow->frozen_data);
  596. nilfs_clear_dirty_pages(&ii->i_btnode_cache);
  597. nilfs_copy_back_pages(&ii->i_btnode_cache, &shadow->frozen_btnodes);
  598. nilfs_bmap_restore(ii->i_bmap, &shadow->bmap_store);
  599. up_write(&mi->mi_sem);
  600. }
  601. /**
  602. * nilfs_mdt_clear_shadow_map - truncate pages in shadow map caches
  603. * @inode: inode of the metadata file
  604. */
  605. void nilfs_mdt_clear_shadow_map(struct inode *inode)
  606. {
  607. struct nilfs_mdt_info *mi = NILFS_MDT(inode);
  608. struct nilfs_shadow_map *shadow = mi->mi_shadow;
  609. down_write(&mi->mi_sem);
  610. nilfs_release_frozen_buffers(shadow);
  611. truncate_inode_pages(&shadow->frozen_data, 0);
  612. truncate_inode_pages(&shadow->frozen_btnodes, 0);
  613. up_write(&mi->mi_sem);
  614. }
  615. static void nilfs_mdt_clear(struct inode *inode)
  616. {
  617. struct nilfs_inode_info *ii = NILFS_I(inode);
  618. invalidate_mapping_pages(inode->i_mapping, 0, -1);
  619. truncate_inode_pages(inode->i_mapping, 0);
  620. if (test_bit(NILFS_I_BMAP, &ii->i_state))
  621. nilfs_bmap_clear(ii->i_bmap);
  622. nilfs_btnode_cache_clear(&ii->i_btnode_cache);
  623. }
  624. void nilfs_mdt_destroy(struct inode *inode)
  625. {
  626. struct nilfs_mdt_info *mdi = NILFS_MDT(inode);
  627. if (mdi->mi_palloc_cache)
  628. nilfs_palloc_destroy_cache(inode);
  629. nilfs_mdt_clear(inode);
  630. nilfs_destroy_inode(inode);
  631. }