mdt.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581
  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 "nilfs.h"
  29. #include "segment.h"
  30. #include "page.h"
  31. #include "mdt.h"
  32. #define NILFS_MDT_MAX_RA_BLOCKS (16 - 1)
  33. #define INIT_UNUSED_INODE_FIELDS
  34. static int
  35. nilfs_mdt_insert_new_block(struct inode *inode, unsigned long block,
  36. struct buffer_head *bh,
  37. void (*init_block)(struct inode *,
  38. struct buffer_head *, void *))
  39. {
  40. struct nilfs_inode_info *ii = NILFS_I(inode);
  41. void *kaddr;
  42. int ret;
  43. /* Caller exclude read accesses using page lock */
  44. /* set_buffer_new(bh); */
  45. bh->b_blocknr = 0;
  46. ret = nilfs_bmap_insert(ii->i_bmap, block, (unsigned long)bh);
  47. if (unlikely(ret))
  48. return ret;
  49. set_buffer_mapped(bh);
  50. kaddr = kmap_atomic(bh->b_page, KM_USER0);
  51. memset(kaddr + bh_offset(bh), 0, 1 << inode->i_blkbits);
  52. if (init_block)
  53. init_block(inode, bh, kaddr);
  54. flush_dcache_page(bh->b_page);
  55. kunmap_atomic(kaddr, KM_USER0);
  56. set_buffer_uptodate(bh);
  57. nilfs_mark_buffer_dirty(bh);
  58. nilfs_mdt_mark_dirty(inode);
  59. return 0;
  60. }
  61. static int nilfs_mdt_create_block(struct inode *inode, unsigned long block,
  62. struct buffer_head **out_bh,
  63. void (*init_block)(struct inode *,
  64. struct buffer_head *,
  65. void *))
  66. {
  67. struct the_nilfs *nilfs = NILFS_MDT(inode)->mi_nilfs;
  68. struct super_block *sb = inode->i_sb;
  69. struct nilfs_transaction_info ti;
  70. struct buffer_head *bh;
  71. int err;
  72. if (!sb) {
  73. /*
  74. * Make sure this function is not called from any
  75. * read-only context.
  76. */
  77. if (!nilfs->ns_writer) {
  78. WARN_ON(1);
  79. err = -EROFS;
  80. goto out;
  81. }
  82. sb = nilfs->ns_writer->s_super;
  83. }
  84. nilfs_transaction_begin(sb, &ti, 0);
  85. err = -ENOMEM;
  86. bh = nilfs_grab_buffer(inode, inode->i_mapping, block, 0);
  87. if (unlikely(!bh))
  88. goto failed_unlock;
  89. err = -EEXIST;
  90. if (buffer_uptodate(bh))
  91. goto failed_bh;
  92. wait_on_buffer(bh);
  93. if (buffer_uptodate(bh))
  94. goto failed_bh;
  95. bh->b_bdev = nilfs->ns_bdev;
  96. err = nilfs_mdt_insert_new_block(inode, block, bh, init_block);
  97. if (likely(!err)) {
  98. get_bh(bh);
  99. *out_bh = bh;
  100. }
  101. failed_bh:
  102. unlock_page(bh->b_page);
  103. page_cache_release(bh->b_page);
  104. brelse(bh);
  105. failed_unlock:
  106. if (likely(!err))
  107. err = nilfs_transaction_commit(sb);
  108. else
  109. nilfs_transaction_abort(sb);
  110. out:
  111. return err;
  112. }
  113. static int
  114. nilfs_mdt_submit_block(struct inode *inode, unsigned long blkoff,
  115. int mode, struct buffer_head **out_bh)
  116. {
  117. struct buffer_head *bh;
  118. __u64 blknum = 0;
  119. int ret = -ENOMEM;
  120. bh = nilfs_grab_buffer(inode, inode->i_mapping, blkoff, 0);
  121. if (unlikely(!bh))
  122. goto failed;
  123. ret = -EEXIST; /* internal code */
  124. if (buffer_uptodate(bh))
  125. goto out;
  126. if (mode == READA) {
  127. if (!trylock_buffer(bh)) {
  128. ret = -EBUSY;
  129. goto failed_bh;
  130. }
  131. } else /* mode == READ */
  132. lock_buffer(bh);
  133. if (buffer_uptodate(bh)) {
  134. unlock_buffer(bh);
  135. goto out;
  136. }
  137. ret = nilfs_bmap_lookup(NILFS_I(inode)->i_bmap, blkoff, &blknum);
  138. if (unlikely(ret)) {
  139. unlock_buffer(bh);
  140. goto failed_bh;
  141. }
  142. bh->b_bdev = NILFS_MDT(inode)->mi_nilfs->ns_bdev;
  143. bh->b_blocknr = (sector_t)blknum;
  144. set_buffer_mapped(bh);
  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 = container_of(page->mapping,
  349. struct inode, i_data);
  350. struct super_block *sb = inode->i_sb;
  351. struct the_nilfs *nilfs = NILFS_MDT(inode)->mi_nilfs;
  352. struct nilfs_sb_info *writer = NULL;
  353. int err = 0;
  354. redirty_page_for_writepage(wbc, page);
  355. unlock_page(page);
  356. if (page->mapping->assoc_mapping)
  357. return 0; /* Do not request flush for shadow page cache */
  358. if (!sb) {
  359. down_read(&nilfs->ns_writer_sem);
  360. writer = nilfs->ns_writer;
  361. if (!writer) {
  362. up_read(&nilfs->ns_writer_sem);
  363. return -EROFS;
  364. }
  365. sb = writer->s_super;
  366. }
  367. if (wbc->sync_mode == WB_SYNC_ALL)
  368. err = nilfs_construct_segment(sb);
  369. else if (wbc->for_reclaim)
  370. nilfs_flush_segment(sb, inode->i_ino);
  371. if (writer)
  372. up_read(&nilfs->ns_writer_sem);
  373. return err;
  374. }
  375. static const struct address_space_operations def_mdt_aops = {
  376. .writepage = nilfs_mdt_write_page,
  377. .sync_page = block_sync_page,
  378. };
  379. static const struct inode_operations def_mdt_iops;
  380. static const struct file_operations def_mdt_fops;
  381. /*
  382. * NILFS2 uses pseudo inodes for meta data files such as DAT, cpfile, sufile,
  383. * ifile, or gcinodes. This allows the B-tree code and segment constructor
  384. * to treat them like regular files, and this helps to simplify the
  385. * implementation.
  386. * On the other hand, some of the pseudo inodes have an irregular point:
  387. * They don't have valid inode->i_sb pointer because their lifetimes are
  388. * longer than those of the super block structs; they may continue for
  389. * several consecutive mounts/umounts. This would need discussions.
  390. */
  391. /**
  392. * nilfs_mdt_new_common - allocate a pseudo inode for metadata file
  393. * @nilfs: nilfs object
  394. * @sb: super block instance the metadata file belongs to
  395. * @ino: inode number
  396. * @gfp_mask: gfp mask for data pages
  397. * @objsz: size of the private object attached to inode->i_private
  398. */
  399. struct inode *
  400. nilfs_mdt_new_common(struct the_nilfs *nilfs, struct super_block *sb,
  401. ino_t ino, gfp_t gfp_mask, size_t objsz)
  402. {
  403. struct inode *inode = nilfs_alloc_inode_common(nilfs);
  404. if (!inode)
  405. return NULL;
  406. else {
  407. struct address_space * const mapping = &inode->i_data;
  408. struct nilfs_mdt_info *mi;
  409. mi = kzalloc(max(sizeof(*mi), objsz), GFP_NOFS);
  410. if (!mi) {
  411. nilfs_destroy_inode(inode);
  412. return NULL;
  413. }
  414. mi->mi_nilfs = nilfs;
  415. init_rwsem(&mi->mi_sem);
  416. inode->i_sb = sb; /* sb may be NULL for some meta data files */
  417. inode->i_blkbits = nilfs->ns_blocksize_bits;
  418. inode->i_flags = 0;
  419. atomic_set(&inode->i_count, 1);
  420. inode->i_nlink = 1;
  421. inode->i_ino = ino;
  422. inode->i_mode = S_IFREG;
  423. inode->i_private = mi;
  424. #ifdef INIT_UNUSED_INODE_FIELDS
  425. atomic_set(&inode->i_writecount, 0);
  426. inode->i_size = 0;
  427. inode->i_blocks = 0;
  428. inode->i_bytes = 0;
  429. inode->i_generation = 0;
  430. #ifdef CONFIG_QUOTA
  431. memset(&inode->i_dquot, 0, sizeof(inode->i_dquot));
  432. #endif
  433. inode->i_pipe = NULL;
  434. inode->i_bdev = NULL;
  435. inode->i_cdev = NULL;
  436. inode->i_rdev = 0;
  437. #ifdef CONFIG_SECURITY
  438. inode->i_security = NULL;
  439. #endif
  440. inode->dirtied_when = 0;
  441. INIT_LIST_HEAD(&inode->i_list);
  442. INIT_LIST_HEAD(&inode->i_sb_list);
  443. inode->i_state = 0;
  444. #endif
  445. spin_lock_init(&inode->i_lock);
  446. mutex_init(&inode->i_mutex);
  447. init_rwsem(&inode->i_alloc_sem);
  448. mapping->host = NULL; /* instead of inode */
  449. mapping->flags = 0;
  450. mapping_set_gfp_mask(mapping, gfp_mask);
  451. mapping->assoc_mapping = NULL;
  452. mapping->backing_dev_info = nilfs->ns_bdi;
  453. inode->i_mapping = mapping;
  454. }
  455. return inode;
  456. }
  457. struct inode *nilfs_mdt_new(struct the_nilfs *nilfs, struct super_block *sb,
  458. ino_t ino, size_t objsz)
  459. {
  460. struct inode *inode;
  461. inode = nilfs_mdt_new_common(nilfs, sb, ino, NILFS_MDT_GFP, objsz);
  462. if (!inode)
  463. return NULL;
  464. inode->i_op = &def_mdt_iops;
  465. inode->i_fop = &def_mdt_fops;
  466. inode->i_mapping->a_ops = &def_mdt_aops;
  467. return inode;
  468. }
  469. void nilfs_mdt_set_entry_size(struct inode *inode, unsigned entry_size,
  470. unsigned header_size)
  471. {
  472. struct nilfs_mdt_info *mi = NILFS_MDT(inode);
  473. mi->mi_entry_size = entry_size;
  474. mi->mi_entries_per_block = (1 << inode->i_blkbits) / entry_size;
  475. mi->mi_first_entry_offset = DIV_ROUND_UP(header_size, entry_size);
  476. }
  477. void nilfs_mdt_set_shadow(struct inode *orig, struct inode *shadow)
  478. {
  479. shadow->i_mapping->assoc_mapping = orig->i_mapping;
  480. NILFS_I(shadow)->i_btnode_cache.assoc_mapping =
  481. &NILFS_I(orig)->i_btnode_cache;
  482. }
  483. static void nilfs_mdt_clear(struct inode *inode)
  484. {
  485. struct nilfs_inode_info *ii = NILFS_I(inode);
  486. invalidate_mapping_pages(inode->i_mapping, 0, -1);
  487. truncate_inode_pages(inode->i_mapping, 0);
  488. if (test_bit(NILFS_I_BMAP, &ii->i_state))
  489. nilfs_bmap_clear(ii->i_bmap);
  490. nilfs_btnode_cache_clear(&ii->i_btnode_cache);
  491. }
  492. void nilfs_mdt_destroy(struct inode *inode)
  493. {
  494. struct nilfs_mdt_info *mdi = NILFS_MDT(inode);
  495. if (mdi->mi_palloc_cache)
  496. nilfs_palloc_destroy_cache(inode);
  497. nilfs_mdt_clear(inode);
  498. kfree(mdi->mi_bgl); /* kfree(NULL) is safe */
  499. kfree(mdi);
  500. nilfs_destroy_inode(inode);
  501. }