mdt.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565
  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. 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. blkoff = block + 1;
  172. for (i = 0; i < nr_ra_blocks; i++, blkoff++) {
  173. err = nilfs_mdt_submit_block(inode, blkoff, READA, &bh);
  174. if (likely(!err || err == -EEXIST))
  175. brelse(bh);
  176. else if (err != -EBUSY)
  177. break; /* abort readahead if bmap lookup failed */
  178. if (!buffer_locked(first_bh))
  179. goto out_no_wait;
  180. }
  181. wait_on_buffer(first_bh);
  182. out_no_wait:
  183. err = -EIO;
  184. if (!buffer_uptodate(first_bh))
  185. goto failed_bh;
  186. out:
  187. *out_bh = first_bh;
  188. return 0;
  189. failed_bh:
  190. brelse(first_bh);
  191. failed:
  192. return err;
  193. }
  194. /**
  195. * nilfs_mdt_get_block - read or create a buffer on meta data file.
  196. * @inode: inode of the meta data file
  197. * @blkoff: block offset
  198. * @create: create flag
  199. * @init_block: initializer used for newly allocated block
  200. * @out_bh: output of a pointer to the buffer_head
  201. *
  202. * nilfs_mdt_get_block() looks up the specified buffer and tries to create
  203. * a new buffer if @create is not zero. On success, the returned buffer is
  204. * assured to be either existing or formatted using a buffer lock on success.
  205. * @out_bh is substituted only when zero is returned.
  206. *
  207. * Return Value: On success, it returns 0. On error, the following negative
  208. * error code is returned.
  209. *
  210. * %-ENOMEM - Insufficient memory available.
  211. *
  212. * %-EIO - I/O error
  213. *
  214. * %-ENOENT - the specified block does not exist (hole block)
  215. *
  216. * %-EINVAL - bmap is broken. (the caller should call nilfs_error())
  217. *
  218. * %-EROFS - Read only filesystem (for create mode)
  219. */
  220. int nilfs_mdt_get_block(struct inode *inode, unsigned long blkoff, int create,
  221. void (*init_block)(struct inode *,
  222. struct buffer_head *, void *),
  223. struct buffer_head **out_bh)
  224. {
  225. int ret;
  226. /* Should be rewritten with merging nilfs_mdt_read_block() */
  227. retry:
  228. ret = nilfs_mdt_read_block(inode, blkoff, out_bh);
  229. if (!create || ret != -ENOENT)
  230. return ret;
  231. ret = nilfs_mdt_create_block(inode, blkoff, out_bh, init_block);
  232. if (unlikely(ret == -EEXIST)) {
  233. /* create = 0; */ /* limit read-create loop retries */
  234. goto retry;
  235. }
  236. return ret;
  237. }
  238. /**
  239. * nilfs_mdt_delete_block - make a hole on the meta data file.
  240. * @inode: inode of the meta data file
  241. * @block: block offset
  242. *
  243. * Return Value: On success, zero is returned.
  244. * On error, one of the following negative error code is returned.
  245. *
  246. * %-ENOMEM - Insufficient memory available.
  247. *
  248. * %-EIO - I/O error
  249. *
  250. * %-EINVAL - bmap is broken. (the caller should call nilfs_error())
  251. */
  252. int nilfs_mdt_delete_block(struct inode *inode, unsigned long block)
  253. {
  254. struct nilfs_inode_info *ii = NILFS_I(inode);
  255. int err;
  256. err = nilfs_bmap_delete(ii->i_bmap, block);
  257. if (!err || err == -ENOENT) {
  258. nilfs_mdt_mark_dirty(inode);
  259. nilfs_mdt_forget_block(inode, block);
  260. }
  261. return err;
  262. }
  263. /**
  264. * nilfs_mdt_forget_block - discard dirty state and try to remove the page
  265. * @inode: inode of the meta data file
  266. * @block: block offset
  267. *
  268. * nilfs_mdt_forget_block() clears a dirty flag of the specified buffer, and
  269. * tries to release the page including the buffer from a page cache.
  270. *
  271. * Return Value: On success, 0 is returned. On error, one of the following
  272. * negative error code is returned.
  273. *
  274. * %-EBUSY - page has an active buffer.
  275. *
  276. * %-ENOENT - page cache has no page addressed by the offset.
  277. */
  278. int nilfs_mdt_forget_block(struct inode *inode, unsigned long block)
  279. {
  280. pgoff_t index = (pgoff_t)block >>
  281. (PAGE_CACHE_SHIFT - inode->i_blkbits);
  282. struct page *page;
  283. unsigned long first_block;
  284. int ret = 0;
  285. int still_dirty;
  286. page = find_lock_page(inode->i_mapping, index);
  287. if (!page)
  288. return -ENOENT;
  289. wait_on_page_writeback(page);
  290. first_block = (unsigned long)index <<
  291. (PAGE_CACHE_SHIFT - inode->i_blkbits);
  292. if (page_has_buffers(page)) {
  293. struct buffer_head *bh;
  294. bh = nilfs_page_get_nth_block(page, block - first_block);
  295. nilfs_forget_buffer(bh);
  296. }
  297. still_dirty = PageDirty(page);
  298. unlock_page(page);
  299. page_cache_release(page);
  300. if (still_dirty ||
  301. invalidate_inode_pages2_range(inode->i_mapping, index, index) != 0)
  302. ret = -EBUSY;
  303. return ret;
  304. }
  305. /**
  306. * nilfs_mdt_mark_block_dirty - mark a block on the meta data file dirty.
  307. * @inode: inode of the meta data file
  308. * @block: block offset
  309. *
  310. * Return Value: On success, it returns 0. On error, the following negative
  311. * error code is returned.
  312. *
  313. * %-ENOMEM - Insufficient memory available.
  314. *
  315. * %-EIO - I/O error
  316. *
  317. * %-ENOENT - the specified block does not exist (hole block)
  318. *
  319. * %-EINVAL - bmap is broken. (the caller should call nilfs_error())
  320. */
  321. int nilfs_mdt_mark_block_dirty(struct inode *inode, unsigned long block)
  322. {
  323. struct buffer_head *bh;
  324. int err;
  325. err = nilfs_mdt_read_block(inode, block, &bh);
  326. if (unlikely(err))
  327. return err;
  328. nilfs_mark_buffer_dirty(bh);
  329. nilfs_mdt_mark_dirty(inode);
  330. brelse(bh);
  331. return 0;
  332. }
  333. int nilfs_mdt_fetch_dirty(struct inode *inode)
  334. {
  335. struct nilfs_inode_info *ii = NILFS_I(inode);
  336. if (nilfs_bmap_test_and_clear_dirty(ii->i_bmap)) {
  337. set_bit(NILFS_I_DIRTY, &ii->i_state);
  338. return 1;
  339. }
  340. return test_bit(NILFS_I_DIRTY, &ii->i_state);
  341. }
  342. static int
  343. nilfs_mdt_write_page(struct page *page, struct writeback_control *wbc)
  344. {
  345. struct inode *inode = container_of(page->mapping,
  346. struct inode, i_data);
  347. struct super_block *sb = inode->i_sb;
  348. struct the_nilfs *nilfs = NILFS_MDT(inode)->mi_nilfs;
  349. struct nilfs_sb_info *writer = NULL;
  350. int err = 0;
  351. redirty_page_for_writepage(wbc, page);
  352. unlock_page(page);
  353. if (page->mapping->assoc_mapping)
  354. return 0; /* Do not request flush for shadow page cache */
  355. if (!sb) {
  356. down_read(&nilfs->ns_writer_sem);
  357. writer = nilfs->ns_writer;
  358. if (!writer) {
  359. up_read(&nilfs->ns_writer_sem);
  360. return -EROFS;
  361. }
  362. sb = writer->s_super;
  363. }
  364. if (wbc->sync_mode == WB_SYNC_ALL)
  365. err = nilfs_construct_segment(sb);
  366. else if (wbc->for_reclaim)
  367. nilfs_flush_segment(sb, inode->i_ino);
  368. if (writer)
  369. up_read(&nilfs->ns_writer_sem);
  370. return err;
  371. }
  372. static const struct address_space_operations def_mdt_aops = {
  373. .writepage = nilfs_mdt_write_page,
  374. .sync_page = block_sync_page,
  375. };
  376. static const struct inode_operations def_mdt_iops;
  377. static const struct file_operations def_mdt_fops;
  378. /*
  379. * NILFS2 uses pseudo inodes for meta data files such as DAT, cpfile, sufile,
  380. * ifile, or gcinodes. This allows the B-tree code and segment constructor
  381. * to treat them like regular files, and this helps to simplify the
  382. * implementation.
  383. * On the other hand, some of the pseudo inodes have an irregular point:
  384. * They don't have valid inode->i_sb pointer because their lifetimes are
  385. * longer than those of the super block structs; they may continue for
  386. * several consecutive mounts/umounts. This would need discussions.
  387. */
  388. struct inode *
  389. nilfs_mdt_new_common(struct the_nilfs *nilfs, struct super_block *sb,
  390. ino_t ino, gfp_t gfp_mask)
  391. {
  392. struct inode *inode = nilfs_alloc_inode_common(nilfs);
  393. if (!inode)
  394. return NULL;
  395. else {
  396. struct address_space * const mapping = &inode->i_data;
  397. struct nilfs_mdt_info *mi = kzalloc(sizeof(*mi), GFP_NOFS);
  398. if (!mi) {
  399. nilfs_destroy_inode(inode);
  400. return NULL;
  401. }
  402. mi->mi_nilfs = nilfs;
  403. init_rwsem(&mi->mi_sem);
  404. inode->i_sb = sb; /* sb may be NULL for some meta data files */
  405. inode->i_blkbits = nilfs->ns_blocksize_bits;
  406. inode->i_flags = 0;
  407. atomic_set(&inode->i_count, 1);
  408. inode->i_nlink = 1;
  409. inode->i_ino = ino;
  410. inode->i_mode = S_IFREG;
  411. inode->i_private = mi;
  412. #ifdef INIT_UNUSED_INODE_FIELDS
  413. atomic_set(&inode->i_writecount, 0);
  414. inode->i_size = 0;
  415. inode->i_blocks = 0;
  416. inode->i_bytes = 0;
  417. inode->i_generation = 0;
  418. #ifdef CONFIG_QUOTA
  419. memset(&inode->i_dquot, 0, sizeof(inode->i_dquot));
  420. #endif
  421. inode->i_pipe = NULL;
  422. inode->i_bdev = NULL;
  423. inode->i_cdev = NULL;
  424. inode->i_rdev = 0;
  425. #ifdef CONFIG_SECURITY
  426. inode->i_security = NULL;
  427. #endif
  428. inode->dirtied_when = 0;
  429. INIT_LIST_HEAD(&inode->i_list);
  430. INIT_LIST_HEAD(&inode->i_sb_list);
  431. inode->i_state = 0;
  432. #endif
  433. spin_lock_init(&inode->i_lock);
  434. mutex_init(&inode->i_mutex);
  435. init_rwsem(&inode->i_alloc_sem);
  436. mapping->host = NULL; /* instead of inode */
  437. mapping->flags = 0;
  438. mapping_set_gfp_mask(mapping, gfp_mask);
  439. mapping->assoc_mapping = NULL;
  440. mapping->backing_dev_info = nilfs->ns_bdi;
  441. inode->i_mapping = mapping;
  442. }
  443. return inode;
  444. }
  445. struct inode *nilfs_mdt_new(struct the_nilfs *nilfs, struct super_block *sb,
  446. ino_t ino)
  447. {
  448. struct inode *inode = nilfs_mdt_new_common(nilfs, sb, ino,
  449. NILFS_MDT_GFP);
  450. if (!inode)
  451. return NULL;
  452. inode->i_op = &def_mdt_iops;
  453. inode->i_fop = &def_mdt_fops;
  454. inode->i_mapping->a_ops = &def_mdt_aops;
  455. return inode;
  456. }
  457. void nilfs_mdt_set_entry_size(struct inode *inode, unsigned entry_size,
  458. unsigned header_size)
  459. {
  460. struct nilfs_mdt_info *mi = NILFS_MDT(inode);
  461. mi->mi_entry_size = entry_size;
  462. mi->mi_entries_per_block = (1 << inode->i_blkbits) / entry_size;
  463. mi->mi_first_entry_offset = DIV_ROUND_UP(header_size, entry_size);
  464. }
  465. void nilfs_mdt_set_shadow(struct inode *orig, struct inode *shadow)
  466. {
  467. shadow->i_mapping->assoc_mapping = orig->i_mapping;
  468. NILFS_I(shadow)->i_btnode_cache.assoc_mapping =
  469. &NILFS_I(orig)->i_btnode_cache;
  470. }
  471. void nilfs_mdt_clear(struct inode *inode)
  472. {
  473. struct nilfs_inode_info *ii = NILFS_I(inode);
  474. invalidate_mapping_pages(inode->i_mapping, 0, -1);
  475. truncate_inode_pages(inode->i_mapping, 0);
  476. nilfs_bmap_clear(ii->i_bmap);
  477. nilfs_btnode_cache_clear(&ii->i_btnode_cache);
  478. }
  479. void nilfs_mdt_destroy(struct inode *inode)
  480. {
  481. struct nilfs_mdt_info *mdi = NILFS_MDT(inode);
  482. kfree(mdi->mi_bgl); /* kfree(NULL) is safe */
  483. kfree(mdi);
  484. nilfs_destroy_inode(inode);
  485. }