inode.c 22 KB

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