inode.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779
  1. /*
  2. * inode.c - NILFS inode operations.
  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. */
  23. #include <linux/buffer_head.h>
  24. #include <linux/mpage.h>
  25. #include <linux/writeback.h>
  26. #include <linux/uio.h>
  27. #include "nilfs.h"
  28. #include "segment.h"
  29. #include "page.h"
  30. #include "mdt.h"
  31. #include "cpfile.h"
  32. #include "ifile.h"
  33. /**
  34. * nilfs_get_block() - get a file block on the filesystem (callback function)
  35. * @inode - inode struct of the target file
  36. * @blkoff - file block number
  37. * @bh_result - buffer head to be mapped on
  38. * @create - indicate whether allocating the block or not when it has not
  39. * been allocated yet.
  40. *
  41. * This function does not issue actual read request of the specified data
  42. * block. It is done by VFS.
  43. */
  44. int nilfs_get_block(struct inode *inode, sector_t blkoff,
  45. struct buffer_head *bh_result, int create)
  46. {
  47. struct nilfs_inode_info *ii = NILFS_I(inode);
  48. __u64 blknum = 0;
  49. int err = 0, ret;
  50. struct inode *dat = nilfs_dat_inode(NILFS_I_NILFS(inode));
  51. unsigned maxblocks = bh_result->b_size >> inode->i_blkbits;
  52. down_read(&NILFS_MDT(dat)->mi_sem);
  53. ret = nilfs_bmap_lookup_contig(ii->i_bmap, blkoff, &blknum, maxblocks);
  54. up_read(&NILFS_MDT(dat)->mi_sem);
  55. if (ret >= 0) { /* found */
  56. map_bh(bh_result, inode->i_sb, blknum);
  57. if (ret > 0)
  58. bh_result->b_size = (ret << inode->i_blkbits);
  59. goto out;
  60. }
  61. /* data block was not found */
  62. if (ret == -ENOENT && create) {
  63. struct nilfs_transaction_info ti;
  64. bh_result->b_blocknr = 0;
  65. err = nilfs_transaction_begin(inode->i_sb, &ti, 1);
  66. if (unlikely(err))
  67. goto out;
  68. err = nilfs_bmap_insert(ii->i_bmap, (unsigned long)blkoff,
  69. (unsigned long)bh_result);
  70. if (unlikely(err != 0)) {
  71. if (err == -EEXIST) {
  72. /*
  73. * The get_block() function could be called
  74. * from multiple callers for an inode.
  75. * However, the page having this block must
  76. * be locked in this case.
  77. */
  78. printk(KERN_WARNING
  79. "nilfs_get_block: a race condition "
  80. "while inserting a data block. "
  81. "(inode number=%lu, file block "
  82. "offset=%llu)\n",
  83. inode->i_ino,
  84. (unsigned long long)blkoff);
  85. err = 0;
  86. } else if (err == -EINVAL) {
  87. nilfs_error(inode->i_sb, __func__,
  88. "broken bmap (inode=%lu)\n",
  89. inode->i_ino);
  90. err = -EIO;
  91. }
  92. nilfs_transaction_abort(inode->i_sb);
  93. goto out;
  94. }
  95. nilfs_transaction_commit(inode->i_sb); /* never fails */
  96. /* Error handling should be detailed */
  97. set_buffer_new(bh_result);
  98. map_bh(bh_result, inode->i_sb, 0); /* dbn must be changed
  99. to proper value */
  100. } else if (ret == -ENOENT) {
  101. /* not found is not error (e.g. hole); must return without
  102. the mapped state flag. */
  103. ;
  104. } else {
  105. err = ret;
  106. }
  107. out:
  108. return err;
  109. }
  110. /**
  111. * nilfs_readpage() - implement readpage() method of nilfs_aops {}
  112. * address_space_operations.
  113. * @file - file struct of the file to be read
  114. * @page - the page to be read
  115. */
  116. static int nilfs_readpage(struct file *file, struct page *page)
  117. {
  118. return mpage_readpage(page, nilfs_get_block);
  119. }
  120. /**
  121. * nilfs_readpages() - implement readpages() method of nilfs_aops {}
  122. * address_space_operations.
  123. * @file - file struct of the file to be read
  124. * @mapping - address_space struct used for reading multiple pages
  125. * @pages - the pages to be read
  126. * @nr_pages - number of pages to be read
  127. */
  128. static int nilfs_readpages(struct file *file, struct address_space *mapping,
  129. struct list_head *pages, unsigned nr_pages)
  130. {
  131. return mpage_readpages(mapping, pages, nr_pages, nilfs_get_block);
  132. }
  133. static int nilfs_writepages(struct address_space *mapping,
  134. struct writeback_control *wbc)
  135. {
  136. struct inode *inode = mapping->host;
  137. int err = 0;
  138. if (wbc->sync_mode == WB_SYNC_ALL)
  139. err = nilfs_construct_dsync_segment(inode->i_sb, inode,
  140. wbc->range_start,
  141. wbc->range_end);
  142. return err;
  143. }
  144. static int nilfs_writepage(struct page *page, struct writeback_control *wbc)
  145. {
  146. struct inode *inode = page->mapping->host;
  147. int err;
  148. redirty_page_for_writepage(wbc, page);
  149. unlock_page(page);
  150. if (wbc->sync_mode == WB_SYNC_ALL) {
  151. err = nilfs_construct_segment(inode->i_sb);
  152. if (unlikely(err))
  153. return err;
  154. } else if (wbc->for_reclaim)
  155. nilfs_flush_segment(inode->i_sb, inode->i_ino);
  156. return 0;
  157. }
  158. static int nilfs_set_page_dirty(struct page *page)
  159. {
  160. int ret = __set_page_dirty_buffers(page);
  161. if (ret) {
  162. struct inode *inode = page->mapping->host;
  163. struct nilfs_sb_info *sbi = NILFS_SB(inode->i_sb);
  164. unsigned nr_dirty = 1 << (PAGE_SHIFT - inode->i_blkbits);
  165. nilfs_set_file_dirty(sbi, inode, nr_dirty);
  166. }
  167. return ret;
  168. }
  169. static int nilfs_write_begin(struct file *file, struct address_space *mapping,
  170. loff_t pos, unsigned len, unsigned flags,
  171. struct page **pagep, void **fsdata)
  172. {
  173. struct inode *inode = mapping->host;
  174. int err = nilfs_transaction_begin(inode->i_sb, NULL, 1);
  175. if (unlikely(err))
  176. return err;
  177. *pagep = NULL;
  178. err = block_write_begin(file, mapping, pos, len, flags, pagep,
  179. fsdata, nilfs_get_block);
  180. if (unlikely(err))
  181. nilfs_transaction_abort(inode->i_sb);
  182. return err;
  183. }
  184. static int nilfs_write_end(struct file *file, struct address_space *mapping,
  185. loff_t pos, unsigned len, unsigned copied,
  186. struct page *page, void *fsdata)
  187. {
  188. struct inode *inode = mapping->host;
  189. unsigned start = pos & (PAGE_CACHE_SIZE - 1);
  190. unsigned nr_dirty;
  191. int err;
  192. nr_dirty = nilfs_page_count_clean_buffers(page, start,
  193. start + copied);
  194. copied = generic_write_end(file, mapping, pos, len, copied, page,
  195. fsdata);
  196. nilfs_set_file_dirty(NILFS_SB(inode->i_sb), inode, nr_dirty);
  197. err = nilfs_transaction_commit(inode->i_sb);
  198. return err ? : copied;
  199. }
  200. static ssize_t
  201. nilfs_direct_IO(int rw, struct kiocb *iocb, const struct iovec *iov,
  202. loff_t offset, unsigned long nr_segs)
  203. {
  204. struct file *file = iocb->ki_filp;
  205. struct inode *inode = file->f_mapping->host;
  206. ssize_t size;
  207. if (rw == WRITE)
  208. return 0;
  209. /* Needs synchronization with the cleaner */
  210. size = blockdev_direct_IO(rw, iocb, inode, inode->i_sb->s_bdev, iov,
  211. offset, nr_segs, nilfs_get_block, NULL);
  212. return size;
  213. }
  214. struct address_space_operations nilfs_aops = {
  215. .writepage = nilfs_writepage,
  216. .readpage = nilfs_readpage,
  217. .sync_page = block_sync_page,
  218. .writepages = nilfs_writepages,
  219. .set_page_dirty = nilfs_set_page_dirty,
  220. .readpages = nilfs_readpages,
  221. .write_begin = nilfs_write_begin,
  222. .write_end = nilfs_write_end,
  223. /* .releasepage = nilfs_releasepage, */
  224. .invalidatepage = block_invalidatepage,
  225. .direct_IO = nilfs_direct_IO,
  226. .is_partially_uptodate = block_is_partially_uptodate,
  227. };
  228. struct inode *nilfs_new_inode(struct inode *dir, int mode)
  229. {
  230. struct super_block *sb = dir->i_sb;
  231. struct nilfs_sb_info *sbi = NILFS_SB(sb);
  232. struct inode *inode;
  233. struct nilfs_inode_info *ii;
  234. int err = -ENOMEM;
  235. ino_t ino;
  236. inode = new_inode(sb);
  237. if (unlikely(!inode))
  238. goto failed;
  239. mapping_set_gfp_mask(inode->i_mapping,
  240. mapping_gfp_mask(inode->i_mapping) & ~__GFP_FS);
  241. ii = NILFS_I(inode);
  242. ii->i_state = 1 << NILFS_I_NEW;
  243. err = nilfs_ifile_create_inode(sbi->s_ifile, &ino, &ii->i_bh);
  244. if (unlikely(err))
  245. goto failed_ifile_create_inode;
  246. /* reference count of i_bh inherits from nilfs_mdt_read_block() */
  247. atomic_inc(&sbi->s_inodes_count);
  248. inode->i_uid = current_fsuid();
  249. if (dir->i_mode & S_ISGID) {
  250. inode->i_gid = dir->i_gid;
  251. if (S_ISDIR(mode))
  252. mode |= S_ISGID;
  253. } else
  254. inode->i_gid = current_fsgid();
  255. inode->i_mode = mode;
  256. inode->i_ino = ino;
  257. inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;
  258. if (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode)) {
  259. err = nilfs_bmap_read(ii->i_bmap, NULL);
  260. if (err < 0)
  261. goto failed_bmap;
  262. set_bit(NILFS_I_BMAP, &ii->i_state);
  263. /* No lock is needed; iget() ensures it. */
  264. }
  265. ii->i_flags = NILFS_I(dir)->i_flags;
  266. if (S_ISLNK(mode))
  267. ii->i_flags &= ~(NILFS_IMMUTABLE_FL | NILFS_APPEND_FL);
  268. if (!S_ISDIR(mode))
  269. ii->i_flags &= ~NILFS_DIRSYNC_FL;
  270. /* ii->i_file_acl = 0; */
  271. /* ii->i_dir_acl = 0; */
  272. ii->i_dir_start_lookup = 0;
  273. ii->i_cno = 0;
  274. nilfs_set_inode_flags(inode);
  275. spin_lock(&sbi->s_next_gen_lock);
  276. inode->i_generation = sbi->s_next_generation++;
  277. spin_unlock(&sbi->s_next_gen_lock);
  278. insert_inode_hash(inode);
  279. err = nilfs_init_acl(inode, dir);
  280. if (unlikely(err))
  281. goto failed_acl; /* never occur. When supporting
  282. nilfs_init_acl(), proper cancellation of
  283. above jobs should be considered */
  284. mark_inode_dirty(inode);
  285. return inode;
  286. failed_acl:
  287. failed_bmap:
  288. inode->i_nlink = 0;
  289. iput(inode); /* raw_inode will be deleted through
  290. generic_delete_inode() */
  291. goto failed;
  292. failed_ifile_create_inode:
  293. make_bad_inode(inode);
  294. iput(inode); /* if i_nlink == 1, generic_forget_inode() will be
  295. called */
  296. failed:
  297. return ERR_PTR(err);
  298. }
  299. void nilfs_free_inode(struct inode *inode)
  300. {
  301. struct super_block *sb = inode->i_sb;
  302. struct nilfs_sb_info *sbi = NILFS_SB(sb);
  303. clear_inode(inode);
  304. /* XXX: check error code? Is there any thing I can do? */
  305. (void) nilfs_ifile_delete_inode(sbi->s_ifile, inode->i_ino);
  306. atomic_dec(&sbi->s_inodes_count);
  307. }
  308. void nilfs_set_inode_flags(struct inode *inode)
  309. {
  310. unsigned int flags = NILFS_I(inode)->i_flags;
  311. inode->i_flags &= ~(S_SYNC | S_APPEND | S_IMMUTABLE | S_NOATIME |
  312. S_DIRSYNC);
  313. if (flags & NILFS_SYNC_FL)
  314. inode->i_flags |= S_SYNC;
  315. if (flags & NILFS_APPEND_FL)
  316. inode->i_flags |= S_APPEND;
  317. if (flags & NILFS_IMMUTABLE_FL)
  318. inode->i_flags |= S_IMMUTABLE;
  319. #ifndef NILFS_ATIME_DISABLE
  320. if (flags & NILFS_NOATIME_FL)
  321. #endif
  322. inode->i_flags |= S_NOATIME;
  323. if (flags & NILFS_DIRSYNC_FL)
  324. inode->i_flags |= S_DIRSYNC;
  325. mapping_set_gfp_mask(inode->i_mapping,
  326. mapping_gfp_mask(inode->i_mapping) & ~__GFP_FS);
  327. }
  328. int nilfs_read_inode_common(struct inode *inode,
  329. struct nilfs_inode *raw_inode)
  330. {
  331. struct nilfs_inode_info *ii = NILFS_I(inode);
  332. int err;
  333. inode->i_mode = le16_to_cpu(raw_inode->i_mode);
  334. inode->i_uid = (uid_t)le32_to_cpu(raw_inode->i_uid);
  335. inode->i_gid = (gid_t)le32_to_cpu(raw_inode->i_gid);
  336. inode->i_nlink = le16_to_cpu(raw_inode->i_links_count);
  337. inode->i_size = le64_to_cpu(raw_inode->i_size);
  338. inode->i_atime.tv_sec = le64_to_cpu(raw_inode->i_mtime);
  339. inode->i_ctime.tv_sec = le64_to_cpu(raw_inode->i_ctime);
  340. inode->i_mtime.tv_sec = le64_to_cpu(raw_inode->i_mtime);
  341. inode->i_atime.tv_nsec = le32_to_cpu(raw_inode->i_mtime_nsec);
  342. inode->i_ctime.tv_nsec = le32_to_cpu(raw_inode->i_ctime_nsec);
  343. inode->i_mtime.tv_nsec = le32_to_cpu(raw_inode->i_mtime_nsec);
  344. if (inode->i_nlink == 0 && inode->i_mode == 0)
  345. return -EINVAL; /* this inode is deleted */
  346. inode->i_blocks = le64_to_cpu(raw_inode->i_blocks);
  347. ii->i_flags = le32_to_cpu(raw_inode->i_flags);
  348. #if 0
  349. ii->i_file_acl = le32_to_cpu(raw_inode->i_file_acl);
  350. ii->i_dir_acl = S_ISREG(inode->i_mode) ?
  351. 0 : le32_to_cpu(raw_inode->i_dir_acl);
  352. #endif
  353. ii->i_cno = 0;
  354. inode->i_generation = le32_to_cpu(raw_inode->i_generation);
  355. if (S_ISREG(inode->i_mode) || S_ISDIR(inode->i_mode) ||
  356. S_ISLNK(inode->i_mode)) {
  357. err = nilfs_bmap_read(ii->i_bmap, raw_inode);
  358. if (err < 0)
  359. return err;
  360. set_bit(NILFS_I_BMAP, &ii->i_state);
  361. /* No lock is needed; iget() ensures it. */
  362. }
  363. return 0;
  364. }
  365. static int __nilfs_read_inode(struct super_block *sb, unsigned long ino,
  366. struct inode *inode)
  367. {
  368. struct nilfs_sb_info *sbi = NILFS_SB(sb);
  369. struct inode *dat = nilfs_dat_inode(sbi->s_nilfs);
  370. struct buffer_head *bh;
  371. struct nilfs_inode *raw_inode;
  372. int err;
  373. down_read(&NILFS_MDT(dat)->mi_sem); /* XXX */
  374. err = nilfs_ifile_get_inode_block(sbi->s_ifile, ino, &bh);
  375. if (unlikely(err))
  376. goto bad_inode;
  377. raw_inode = nilfs_ifile_map_inode(sbi->s_ifile, ino, bh);
  378. if (nilfs_read_inode_common(inode, raw_inode))
  379. goto failed_unmap;
  380. if (S_ISREG(inode->i_mode)) {
  381. inode->i_op = &nilfs_file_inode_operations;
  382. inode->i_fop = &nilfs_file_operations;
  383. inode->i_mapping->a_ops = &nilfs_aops;
  384. } else if (S_ISDIR(inode->i_mode)) {
  385. inode->i_op = &nilfs_dir_inode_operations;
  386. inode->i_fop = &nilfs_dir_operations;
  387. inode->i_mapping->a_ops = &nilfs_aops;
  388. } else if (S_ISLNK(inode->i_mode)) {
  389. inode->i_op = &nilfs_symlink_inode_operations;
  390. inode->i_mapping->a_ops = &nilfs_aops;
  391. } else {
  392. inode->i_op = &nilfs_special_inode_operations;
  393. init_special_inode(
  394. inode, inode->i_mode,
  395. new_decode_dev(le64_to_cpu(raw_inode->i_device_code)));
  396. }
  397. nilfs_ifile_unmap_inode(sbi->s_ifile, ino, bh);
  398. brelse(bh);
  399. up_read(&NILFS_MDT(dat)->mi_sem); /* XXX */
  400. nilfs_set_inode_flags(inode);
  401. return 0;
  402. failed_unmap:
  403. nilfs_ifile_unmap_inode(sbi->s_ifile, ino, bh);
  404. brelse(bh);
  405. bad_inode:
  406. up_read(&NILFS_MDT(dat)->mi_sem); /* XXX */
  407. return err;
  408. }
  409. struct inode *nilfs_iget(struct super_block *sb, unsigned long ino)
  410. {
  411. struct inode *inode;
  412. int err;
  413. inode = iget_locked(sb, ino);
  414. if (unlikely(!inode))
  415. return ERR_PTR(-ENOMEM);
  416. if (!(inode->i_state & I_NEW))
  417. return inode;
  418. err = __nilfs_read_inode(sb, ino, inode);
  419. if (unlikely(err)) {
  420. iget_failed(inode);
  421. return ERR_PTR(err);
  422. }
  423. unlock_new_inode(inode);
  424. return inode;
  425. }
  426. void nilfs_write_inode_common(struct inode *inode,
  427. struct nilfs_inode *raw_inode, int has_bmap)
  428. {
  429. struct nilfs_inode_info *ii = NILFS_I(inode);
  430. raw_inode->i_mode = cpu_to_le16(inode->i_mode);
  431. raw_inode->i_uid = cpu_to_le32(inode->i_uid);
  432. raw_inode->i_gid = cpu_to_le32(inode->i_gid);
  433. raw_inode->i_links_count = cpu_to_le16(inode->i_nlink);
  434. raw_inode->i_size = cpu_to_le64(inode->i_size);
  435. raw_inode->i_ctime = cpu_to_le64(inode->i_ctime.tv_sec);
  436. raw_inode->i_mtime = cpu_to_le64(inode->i_mtime.tv_sec);
  437. raw_inode->i_ctime_nsec = cpu_to_le32(inode->i_ctime.tv_nsec);
  438. raw_inode->i_mtime_nsec = cpu_to_le32(inode->i_mtime.tv_nsec);
  439. raw_inode->i_blocks = cpu_to_le64(inode->i_blocks);
  440. raw_inode->i_flags = cpu_to_le32(ii->i_flags);
  441. raw_inode->i_generation = cpu_to_le32(inode->i_generation);
  442. if (has_bmap)
  443. nilfs_bmap_write(ii->i_bmap, raw_inode);
  444. else if (S_ISCHR(inode->i_mode) || S_ISBLK(inode->i_mode))
  445. raw_inode->i_device_code =
  446. cpu_to_le64(new_encode_dev(inode->i_rdev));
  447. /* When extending inode, nilfs->ns_inode_size should be checked
  448. for substitutions of appended fields */
  449. }
  450. void nilfs_update_inode(struct inode *inode, struct buffer_head *ibh)
  451. {
  452. ino_t ino = inode->i_ino;
  453. struct nilfs_inode_info *ii = NILFS_I(inode);
  454. struct super_block *sb = inode->i_sb;
  455. struct nilfs_sb_info *sbi = NILFS_SB(sb);
  456. struct nilfs_inode *raw_inode;
  457. raw_inode = nilfs_ifile_map_inode(sbi->s_ifile, ino, ibh);
  458. /* The buffer is guarded with lock_buffer() by the caller */
  459. if (test_and_clear_bit(NILFS_I_NEW, &ii->i_state))
  460. memset(raw_inode, 0, NILFS_MDT(sbi->s_ifile)->mi_entry_size);
  461. set_bit(NILFS_I_INODE_DIRTY, &ii->i_state);
  462. nilfs_write_inode_common(inode, raw_inode, 0);
  463. /* XXX: call with has_bmap = 0 is a workaround to avoid
  464. deadlock of bmap. This delays update of i_bmap to just
  465. before writing */
  466. nilfs_ifile_unmap_inode(sbi->s_ifile, ino, ibh);
  467. }
  468. #define NILFS_MAX_TRUNCATE_BLOCKS 16384 /* 64MB for 4KB block */
  469. static void nilfs_truncate_bmap(struct nilfs_inode_info *ii,
  470. unsigned long from)
  471. {
  472. unsigned long b;
  473. int ret;
  474. if (!test_bit(NILFS_I_BMAP, &ii->i_state))
  475. return;
  476. repeat:
  477. ret = nilfs_bmap_last_key(ii->i_bmap, &b);
  478. if (ret == -ENOENT)
  479. return;
  480. else if (ret < 0)
  481. goto failed;
  482. if (b < from)
  483. return;
  484. b -= min_t(unsigned long, NILFS_MAX_TRUNCATE_BLOCKS, b - from);
  485. ret = nilfs_bmap_truncate(ii->i_bmap, b);
  486. nilfs_relax_pressure_in_lock(ii->vfs_inode.i_sb);
  487. if (!ret || (ret == -ENOMEM &&
  488. nilfs_bmap_truncate(ii->i_bmap, b) == 0))
  489. goto repeat;
  490. failed:
  491. if (ret == -EINVAL)
  492. nilfs_error(ii->vfs_inode.i_sb, __func__,
  493. "bmap is broken (ino=%lu)", ii->vfs_inode.i_ino);
  494. else
  495. nilfs_warning(ii->vfs_inode.i_sb, __func__,
  496. "failed to truncate bmap (ino=%lu, err=%d)",
  497. ii->vfs_inode.i_ino, ret);
  498. }
  499. void nilfs_truncate(struct inode *inode)
  500. {
  501. unsigned long blkoff;
  502. unsigned int blocksize;
  503. struct nilfs_transaction_info ti;
  504. struct super_block *sb = inode->i_sb;
  505. struct nilfs_inode_info *ii = NILFS_I(inode);
  506. if (!test_bit(NILFS_I_BMAP, &ii->i_state))
  507. return;
  508. if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
  509. return;
  510. blocksize = sb->s_blocksize;
  511. blkoff = (inode->i_size + blocksize - 1) >> sb->s_blocksize_bits;
  512. nilfs_transaction_begin(sb, &ti, 0); /* never fails */
  513. block_truncate_page(inode->i_mapping, inode->i_size, nilfs_get_block);
  514. nilfs_truncate_bmap(ii, blkoff);
  515. inode->i_mtime = inode->i_ctime = CURRENT_TIME;
  516. if (IS_SYNC(inode))
  517. nilfs_set_transaction_flag(NILFS_TI_SYNC);
  518. nilfs_set_file_dirty(NILFS_SB(sb), inode, 0);
  519. nilfs_transaction_commit(sb);
  520. /* May construct a logical segment and may fail in sync mode.
  521. But truncate has no return value. */
  522. }
  523. void nilfs_delete_inode(struct inode *inode)
  524. {
  525. struct nilfs_transaction_info ti;
  526. struct super_block *sb = inode->i_sb;
  527. struct nilfs_inode_info *ii = NILFS_I(inode);
  528. if (unlikely(is_bad_inode(inode))) {
  529. if (inode->i_data.nrpages)
  530. truncate_inode_pages(&inode->i_data, 0);
  531. clear_inode(inode);
  532. return;
  533. }
  534. nilfs_transaction_begin(sb, &ti, 0); /* never fails */
  535. if (inode->i_data.nrpages)
  536. truncate_inode_pages(&inode->i_data, 0);
  537. nilfs_truncate_bmap(ii, 0);
  538. nilfs_free_inode(inode);
  539. /* nilfs_free_inode() marks inode buffer dirty */
  540. if (IS_SYNC(inode))
  541. nilfs_set_transaction_flag(NILFS_TI_SYNC);
  542. nilfs_transaction_commit(sb);
  543. /* May construct a logical segment and may fail in sync mode.
  544. But delete_inode has no return value. */
  545. }
  546. int nilfs_setattr(struct dentry *dentry, struct iattr *iattr)
  547. {
  548. struct nilfs_transaction_info ti;
  549. struct inode *inode = dentry->d_inode;
  550. struct super_block *sb = inode->i_sb;
  551. int err;
  552. err = inode_change_ok(inode, iattr);
  553. if (err)
  554. return err;
  555. err = nilfs_transaction_begin(sb, &ti, 0);
  556. if (unlikely(err))
  557. return err;
  558. err = inode_setattr(inode, iattr);
  559. if (!err && (iattr->ia_valid & ATTR_MODE))
  560. err = nilfs_acl_chmod(inode);
  561. if (likely(!err))
  562. err = nilfs_transaction_commit(sb);
  563. else
  564. nilfs_transaction_abort(sb);
  565. return err;
  566. }
  567. int nilfs_load_inode_block(struct nilfs_sb_info *sbi, struct inode *inode,
  568. struct buffer_head **pbh)
  569. {
  570. struct nilfs_inode_info *ii = NILFS_I(inode);
  571. int err;
  572. spin_lock(&sbi->s_inode_lock);
  573. /* Caller of this function MUST lock s_inode_lock */
  574. if (ii->i_bh == NULL) {
  575. spin_unlock(&sbi->s_inode_lock);
  576. err = nilfs_ifile_get_inode_block(sbi->s_ifile, inode->i_ino,
  577. pbh);
  578. if (unlikely(err))
  579. return err;
  580. spin_lock(&sbi->s_inode_lock);
  581. if (ii->i_bh == NULL)
  582. ii->i_bh = *pbh;
  583. else {
  584. brelse(*pbh);
  585. *pbh = ii->i_bh;
  586. }
  587. } else
  588. *pbh = ii->i_bh;
  589. get_bh(*pbh);
  590. spin_unlock(&sbi->s_inode_lock);
  591. return 0;
  592. }
  593. int nilfs_inode_dirty(struct inode *inode)
  594. {
  595. struct nilfs_inode_info *ii = NILFS_I(inode);
  596. struct nilfs_sb_info *sbi = NILFS_SB(inode->i_sb);
  597. int ret = 0;
  598. if (!list_empty(&ii->i_dirty)) {
  599. spin_lock(&sbi->s_inode_lock);
  600. ret = test_bit(NILFS_I_DIRTY, &ii->i_state) ||
  601. test_bit(NILFS_I_BUSY, &ii->i_state);
  602. spin_unlock(&sbi->s_inode_lock);
  603. }
  604. return ret;
  605. }
  606. int nilfs_set_file_dirty(struct nilfs_sb_info *sbi, struct inode *inode,
  607. unsigned nr_dirty)
  608. {
  609. struct nilfs_inode_info *ii = NILFS_I(inode);
  610. atomic_add(nr_dirty, &sbi->s_nilfs->ns_ndirtyblks);
  611. if (test_and_set_bit(NILFS_I_DIRTY, &ii->i_state))
  612. return 0;
  613. spin_lock(&sbi->s_inode_lock);
  614. if (!test_bit(NILFS_I_QUEUED, &ii->i_state) &&
  615. !test_bit(NILFS_I_BUSY, &ii->i_state)) {
  616. /* Because this routine may race with nilfs_dispose_list(),
  617. we have to check NILFS_I_QUEUED here, too. */
  618. if (list_empty(&ii->i_dirty) && igrab(inode) == NULL) {
  619. /* This will happen when somebody is freeing
  620. this inode. */
  621. nilfs_warning(sbi->s_super, __func__,
  622. "cannot get inode (ino=%lu)\n",
  623. inode->i_ino);
  624. spin_unlock(&sbi->s_inode_lock);
  625. return -EINVAL; /* NILFS_I_DIRTY may remain for
  626. freeing inode */
  627. }
  628. list_del(&ii->i_dirty);
  629. list_add_tail(&ii->i_dirty, &sbi->s_dirty_files);
  630. set_bit(NILFS_I_QUEUED, &ii->i_state);
  631. }
  632. spin_unlock(&sbi->s_inode_lock);
  633. return 0;
  634. }
  635. int nilfs_mark_inode_dirty(struct inode *inode)
  636. {
  637. struct nilfs_sb_info *sbi = NILFS_SB(inode->i_sb);
  638. struct buffer_head *ibh;
  639. int err;
  640. err = nilfs_load_inode_block(sbi, inode, &ibh);
  641. if (unlikely(err)) {
  642. nilfs_warning(inode->i_sb, __func__,
  643. "failed to reget inode block.\n");
  644. return err;
  645. }
  646. lock_buffer(ibh);
  647. nilfs_update_inode(inode, ibh);
  648. unlock_buffer(ibh);
  649. nilfs_mdt_mark_buffer_dirty(ibh);
  650. nilfs_mdt_mark_dirty(sbi->s_ifile);
  651. brelse(ibh);
  652. return 0;
  653. }
  654. /**
  655. * nilfs_dirty_inode - reflect changes on given inode to an inode block.
  656. * @inode: inode of the file to be registered.
  657. *
  658. * nilfs_dirty_inode() loads a inode block containing the specified
  659. * @inode and copies data from a nilfs_inode to a corresponding inode
  660. * entry in the inode block. This operation is excluded from the segment
  661. * construction. This function can be called both as a single operation
  662. * and as a part of indivisible file operations.
  663. */
  664. void nilfs_dirty_inode(struct inode *inode)
  665. {
  666. struct nilfs_transaction_info ti;
  667. if (is_bad_inode(inode)) {
  668. nilfs_warning(inode->i_sb, __func__,
  669. "tried to mark bad_inode dirty. ignored.\n");
  670. dump_stack();
  671. return;
  672. }
  673. nilfs_transaction_begin(inode->i_sb, &ti, 0);
  674. nilfs_mark_inode_dirty(inode);
  675. nilfs_transaction_commit(inode->i_sb); /* never fails */
  676. }