inode.c 28 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060
  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 "btnode.h"
  30. #include "segment.h"
  31. #include "page.h"
  32. #include "mdt.h"
  33. #include "cpfile.h"
  34. #include "ifile.h"
  35. struct nilfs_iget_args {
  36. u64 ino;
  37. __u64 cno;
  38. struct nilfs_root *root;
  39. int for_gc;
  40. };
  41. void nilfs_inode_add_blocks(struct inode *inode, int n)
  42. {
  43. struct nilfs_root *root = NILFS_I(inode)->i_root;
  44. inode_add_bytes(inode, (1 << inode->i_blkbits) * n);
  45. if (root)
  46. atomic_add(n, &root->blocks_count);
  47. }
  48. void nilfs_inode_sub_blocks(struct inode *inode, int n)
  49. {
  50. struct nilfs_root *root = NILFS_I(inode)->i_root;
  51. inode_sub_bytes(inode, (1 << inode->i_blkbits) * n);
  52. if (root)
  53. atomic_sub(n, &root->blocks_count);
  54. }
  55. /**
  56. * nilfs_get_block() - get a file block on the filesystem (callback function)
  57. * @inode - inode struct of the target file
  58. * @blkoff - file block number
  59. * @bh_result - buffer head to be mapped on
  60. * @create - indicate whether allocating the block or not when it has not
  61. * been allocated yet.
  62. *
  63. * This function does not issue actual read request of the specified data
  64. * block. It is done by VFS.
  65. */
  66. int nilfs_get_block(struct inode *inode, sector_t blkoff,
  67. struct buffer_head *bh_result, int create)
  68. {
  69. struct nilfs_inode_info *ii = NILFS_I(inode);
  70. __u64 blknum = 0;
  71. int err = 0, ret;
  72. struct inode *dat = NILFS_I_NILFS(inode)->ns_dat;
  73. unsigned maxblocks = bh_result->b_size >> inode->i_blkbits;
  74. down_read(&NILFS_MDT(dat)->mi_sem);
  75. ret = nilfs_bmap_lookup_contig(ii->i_bmap, blkoff, &blknum, maxblocks);
  76. up_read(&NILFS_MDT(dat)->mi_sem);
  77. if (ret >= 0) { /* found */
  78. map_bh(bh_result, inode->i_sb, blknum);
  79. if (ret > 0)
  80. bh_result->b_size = (ret << inode->i_blkbits);
  81. goto out;
  82. }
  83. /* data block was not found */
  84. if (ret == -ENOENT && create) {
  85. struct nilfs_transaction_info ti;
  86. bh_result->b_blocknr = 0;
  87. err = nilfs_transaction_begin(inode->i_sb, &ti, 1);
  88. if (unlikely(err))
  89. goto out;
  90. err = nilfs_bmap_insert(ii->i_bmap, (unsigned long)blkoff,
  91. (unsigned long)bh_result);
  92. if (unlikely(err != 0)) {
  93. if (err == -EEXIST) {
  94. /*
  95. * The get_block() function could be called
  96. * from multiple callers for an inode.
  97. * However, the page having this block must
  98. * be locked in this case.
  99. */
  100. printk(KERN_WARNING
  101. "nilfs_get_block: a race condition "
  102. "while inserting a data block. "
  103. "(inode number=%lu, file block "
  104. "offset=%llu)\n",
  105. inode->i_ino,
  106. (unsigned long long)blkoff);
  107. err = 0;
  108. }
  109. nilfs_transaction_abort(inode->i_sb);
  110. goto out;
  111. }
  112. nilfs_mark_inode_dirty(inode);
  113. nilfs_transaction_commit(inode->i_sb); /* never fails */
  114. /* Error handling should be detailed */
  115. set_buffer_new(bh_result);
  116. set_buffer_delay(bh_result);
  117. map_bh(bh_result, inode->i_sb, 0); /* dbn must be changed
  118. to proper value */
  119. } else if (ret == -ENOENT) {
  120. /* not found is not error (e.g. hole); must return without
  121. the mapped state flag. */
  122. ;
  123. } else {
  124. err = ret;
  125. }
  126. out:
  127. return err;
  128. }
  129. /**
  130. * nilfs_readpage() - implement readpage() method of nilfs_aops {}
  131. * address_space_operations.
  132. * @file - file struct of the file to be read
  133. * @page - the page to be read
  134. */
  135. static int nilfs_readpage(struct file *file, struct page *page)
  136. {
  137. return mpage_readpage(page, nilfs_get_block);
  138. }
  139. /**
  140. * nilfs_readpages() - implement readpages() method of nilfs_aops {}
  141. * address_space_operations.
  142. * @file - file struct of the file to be read
  143. * @mapping - address_space struct used for reading multiple pages
  144. * @pages - the pages to be read
  145. * @nr_pages - number of pages to be read
  146. */
  147. static int nilfs_readpages(struct file *file, struct address_space *mapping,
  148. struct list_head *pages, unsigned nr_pages)
  149. {
  150. return mpage_readpages(mapping, pages, nr_pages, nilfs_get_block);
  151. }
  152. static int nilfs_writepages(struct address_space *mapping,
  153. struct writeback_control *wbc)
  154. {
  155. struct inode *inode = mapping->host;
  156. int err = 0;
  157. if (wbc->sync_mode == WB_SYNC_ALL)
  158. err = nilfs_construct_dsync_segment(inode->i_sb, inode,
  159. wbc->range_start,
  160. wbc->range_end);
  161. return err;
  162. }
  163. static int nilfs_writepage(struct page *page, struct writeback_control *wbc)
  164. {
  165. struct inode *inode = page->mapping->host;
  166. int err;
  167. redirty_page_for_writepage(wbc, page);
  168. unlock_page(page);
  169. if (wbc->sync_mode == WB_SYNC_ALL) {
  170. err = nilfs_construct_segment(inode->i_sb);
  171. if (unlikely(err))
  172. return err;
  173. } else if (wbc->for_reclaim)
  174. nilfs_flush_segment(inode->i_sb, inode->i_ino);
  175. return 0;
  176. }
  177. static int nilfs_set_page_dirty(struct page *page)
  178. {
  179. int ret = __set_page_dirty_buffers(page);
  180. if (ret) {
  181. struct inode *inode = page->mapping->host;
  182. unsigned nr_dirty = 1 << (PAGE_SHIFT - inode->i_blkbits);
  183. nilfs_set_file_dirty(inode, nr_dirty);
  184. }
  185. return ret;
  186. }
  187. static int nilfs_write_begin(struct file *file, struct address_space *mapping,
  188. loff_t pos, unsigned len, unsigned flags,
  189. struct page **pagep, void **fsdata)
  190. {
  191. struct inode *inode = mapping->host;
  192. int err = nilfs_transaction_begin(inode->i_sb, NULL, 1);
  193. if (unlikely(err))
  194. return err;
  195. err = block_write_begin(mapping, pos, len, flags, pagep,
  196. nilfs_get_block);
  197. if (unlikely(err)) {
  198. loff_t isize = mapping->host->i_size;
  199. if (pos + len > isize)
  200. vmtruncate(mapping->host, isize);
  201. nilfs_transaction_abort(inode->i_sb);
  202. }
  203. return err;
  204. }
  205. static int nilfs_write_end(struct file *file, struct address_space *mapping,
  206. loff_t pos, unsigned len, unsigned copied,
  207. struct page *page, void *fsdata)
  208. {
  209. struct inode *inode = mapping->host;
  210. unsigned start = pos & (PAGE_CACHE_SIZE - 1);
  211. unsigned nr_dirty;
  212. int err;
  213. nr_dirty = nilfs_page_count_clean_buffers(page, start,
  214. start + copied);
  215. copied = generic_write_end(file, mapping, pos, len, copied, page,
  216. fsdata);
  217. nilfs_set_file_dirty(inode, nr_dirty);
  218. err = nilfs_transaction_commit(inode->i_sb);
  219. return err ? : copied;
  220. }
  221. static ssize_t
  222. nilfs_direct_IO(int rw, struct kiocb *iocb, const struct iovec *iov,
  223. loff_t offset, unsigned long nr_segs)
  224. {
  225. struct file *file = iocb->ki_filp;
  226. struct inode *inode = file->f_mapping->host;
  227. ssize_t size;
  228. if (rw == WRITE)
  229. return 0;
  230. /* Needs synchronization with the cleaner */
  231. size = blockdev_direct_IO(rw, iocb, inode, inode->i_sb->s_bdev, iov,
  232. offset, nr_segs, nilfs_get_block, NULL);
  233. /*
  234. * In case of error extending write may have instantiated a few
  235. * blocks outside i_size. Trim these off again.
  236. */
  237. if (unlikely((rw & WRITE) && size < 0)) {
  238. loff_t isize = i_size_read(inode);
  239. loff_t end = offset + iov_length(iov, nr_segs);
  240. if (end > isize)
  241. vmtruncate(inode, isize);
  242. }
  243. return size;
  244. }
  245. const struct address_space_operations nilfs_aops = {
  246. .writepage = nilfs_writepage,
  247. .readpage = nilfs_readpage,
  248. .writepages = nilfs_writepages,
  249. .set_page_dirty = nilfs_set_page_dirty,
  250. .readpages = nilfs_readpages,
  251. .write_begin = nilfs_write_begin,
  252. .write_end = nilfs_write_end,
  253. /* .releasepage = nilfs_releasepage, */
  254. .invalidatepage = block_invalidatepage,
  255. .direct_IO = nilfs_direct_IO,
  256. .is_partially_uptodate = block_is_partially_uptodate,
  257. };
  258. struct inode *nilfs_new_inode(struct inode *dir, int mode)
  259. {
  260. struct super_block *sb = dir->i_sb;
  261. struct the_nilfs *nilfs = sb->s_fs_info;
  262. struct inode *inode;
  263. struct nilfs_inode_info *ii;
  264. struct nilfs_root *root;
  265. int err = -ENOMEM;
  266. ino_t ino;
  267. inode = new_inode(sb);
  268. if (unlikely(!inode))
  269. goto failed;
  270. mapping_set_gfp_mask(inode->i_mapping,
  271. mapping_gfp_mask(inode->i_mapping) & ~__GFP_FS);
  272. root = NILFS_I(dir)->i_root;
  273. ii = NILFS_I(inode);
  274. ii->i_state = 1 << NILFS_I_NEW;
  275. ii->i_root = root;
  276. err = nilfs_ifile_create_inode(root->ifile, &ino, &ii->i_bh);
  277. if (unlikely(err))
  278. goto failed_ifile_create_inode;
  279. /* reference count of i_bh inherits from nilfs_mdt_read_block() */
  280. atomic_inc(&root->inodes_count);
  281. inode_init_owner(inode, dir, mode);
  282. inode->i_ino = ino;
  283. inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;
  284. if (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode)) {
  285. err = nilfs_bmap_read(ii->i_bmap, NULL);
  286. if (err < 0)
  287. goto failed_bmap;
  288. set_bit(NILFS_I_BMAP, &ii->i_state);
  289. /* No lock is needed; iget() ensures it. */
  290. }
  291. ii->i_flags = nilfs_mask_flags(
  292. mode, NILFS_I(dir)->i_flags & NILFS_FL_INHERITED);
  293. /* ii->i_file_acl = 0; */
  294. /* ii->i_dir_acl = 0; */
  295. ii->i_dir_start_lookup = 0;
  296. nilfs_set_inode_flags(inode);
  297. spin_lock(&nilfs->ns_next_gen_lock);
  298. inode->i_generation = nilfs->ns_next_generation++;
  299. spin_unlock(&nilfs->ns_next_gen_lock);
  300. insert_inode_hash(inode);
  301. err = nilfs_init_acl(inode, dir);
  302. if (unlikely(err))
  303. goto failed_acl; /* never occur. When supporting
  304. nilfs_init_acl(), proper cancellation of
  305. above jobs should be considered */
  306. return inode;
  307. failed_acl:
  308. failed_bmap:
  309. inode->i_nlink = 0;
  310. iput(inode); /* raw_inode will be deleted through
  311. generic_delete_inode() */
  312. goto failed;
  313. failed_ifile_create_inode:
  314. make_bad_inode(inode);
  315. iput(inode); /* if i_nlink == 1, generic_forget_inode() will be
  316. called */
  317. failed:
  318. return ERR_PTR(err);
  319. }
  320. void nilfs_set_inode_flags(struct inode *inode)
  321. {
  322. unsigned int flags = NILFS_I(inode)->i_flags;
  323. inode->i_flags &= ~(S_SYNC | S_APPEND | S_IMMUTABLE | S_NOATIME |
  324. S_DIRSYNC);
  325. if (flags & FS_SYNC_FL)
  326. inode->i_flags |= S_SYNC;
  327. if (flags & FS_APPEND_FL)
  328. inode->i_flags |= S_APPEND;
  329. if (flags & FS_IMMUTABLE_FL)
  330. inode->i_flags |= S_IMMUTABLE;
  331. if (flags & FS_NOATIME_FL)
  332. inode->i_flags |= S_NOATIME;
  333. if (flags & FS_DIRSYNC_FL)
  334. inode->i_flags |= S_DIRSYNC;
  335. mapping_set_gfp_mask(inode->i_mapping,
  336. mapping_gfp_mask(inode->i_mapping) & ~__GFP_FS);
  337. }
  338. int nilfs_read_inode_common(struct inode *inode,
  339. struct nilfs_inode *raw_inode)
  340. {
  341. struct nilfs_inode_info *ii = NILFS_I(inode);
  342. int err;
  343. inode->i_mode = le16_to_cpu(raw_inode->i_mode);
  344. inode->i_uid = (uid_t)le32_to_cpu(raw_inode->i_uid);
  345. inode->i_gid = (gid_t)le32_to_cpu(raw_inode->i_gid);
  346. inode->i_nlink = le16_to_cpu(raw_inode->i_links_count);
  347. inode->i_size = le64_to_cpu(raw_inode->i_size);
  348. inode->i_atime.tv_sec = le64_to_cpu(raw_inode->i_mtime);
  349. inode->i_ctime.tv_sec = le64_to_cpu(raw_inode->i_ctime);
  350. inode->i_mtime.tv_sec = le64_to_cpu(raw_inode->i_mtime);
  351. inode->i_atime.tv_nsec = le32_to_cpu(raw_inode->i_mtime_nsec);
  352. inode->i_ctime.tv_nsec = le32_to_cpu(raw_inode->i_ctime_nsec);
  353. inode->i_mtime.tv_nsec = le32_to_cpu(raw_inode->i_mtime_nsec);
  354. if (inode->i_nlink == 0 && inode->i_mode == 0)
  355. return -EINVAL; /* this inode is deleted */
  356. inode->i_blocks = le64_to_cpu(raw_inode->i_blocks);
  357. ii->i_flags = le32_to_cpu(raw_inode->i_flags);
  358. #if 0
  359. ii->i_file_acl = le32_to_cpu(raw_inode->i_file_acl);
  360. ii->i_dir_acl = S_ISREG(inode->i_mode) ?
  361. 0 : le32_to_cpu(raw_inode->i_dir_acl);
  362. #endif
  363. ii->i_dir_start_lookup = 0;
  364. inode->i_generation = le32_to_cpu(raw_inode->i_generation);
  365. if (S_ISREG(inode->i_mode) || S_ISDIR(inode->i_mode) ||
  366. S_ISLNK(inode->i_mode)) {
  367. err = nilfs_bmap_read(ii->i_bmap, raw_inode);
  368. if (err < 0)
  369. return err;
  370. set_bit(NILFS_I_BMAP, &ii->i_state);
  371. /* No lock is needed; iget() ensures it. */
  372. }
  373. return 0;
  374. }
  375. static int __nilfs_read_inode(struct super_block *sb,
  376. struct nilfs_root *root, unsigned long ino,
  377. struct inode *inode)
  378. {
  379. struct the_nilfs *nilfs = sb->s_fs_info;
  380. struct buffer_head *bh;
  381. struct nilfs_inode *raw_inode;
  382. int err;
  383. down_read(&NILFS_MDT(nilfs->ns_dat)->mi_sem);
  384. err = nilfs_ifile_get_inode_block(root->ifile, ino, &bh);
  385. if (unlikely(err))
  386. goto bad_inode;
  387. raw_inode = nilfs_ifile_map_inode(root->ifile, ino, bh);
  388. err = nilfs_read_inode_common(inode, raw_inode);
  389. if (err)
  390. goto failed_unmap;
  391. if (S_ISREG(inode->i_mode)) {
  392. inode->i_op = &nilfs_file_inode_operations;
  393. inode->i_fop = &nilfs_file_operations;
  394. inode->i_mapping->a_ops = &nilfs_aops;
  395. } else if (S_ISDIR(inode->i_mode)) {
  396. inode->i_op = &nilfs_dir_inode_operations;
  397. inode->i_fop = &nilfs_dir_operations;
  398. inode->i_mapping->a_ops = &nilfs_aops;
  399. } else if (S_ISLNK(inode->i_mode)) {
  400. inode->i_op = &nilfs_symlink_inode_operations;
  401. inode->i_mapping->a_ops = &nilfs_aops;
  402. } else {
  403. inode->i_op = &nilfs_special_inode_operations;
  404. init_special_inode(
  405. inode, inode->i_mode,
  406. huge_decode_dev(le64_to_cpu(raw_inode->i_device_code)));
  407. }
  408. nilfs_ifile_unmap_inode(root->ifile, ino, bh);
  409. brelse(bh);
  410. up_read(&NILFS_MDT(nilfs->ns_dat)->mi_sem);
  411. nilfs_set_inode_flags(inode);
  412. return 0;
  413. failed_unmap:
  414. nilfs_ifile_unmap_inode(root->ifile, ino, bh);
  415. brelse(bh);
  416. bad_inode:
  417. up_read(&NILFS_MDT(nilfs->ns_dat)->mi_sem);
  418. return err;
  419. }
  420. static int nilfs_iget_test(struct inode *inode, void *opaque)
  421. {
  422. struct nilfs_iget_args *args = opaque;
  423. struct nilfs_inode_info *ii;
  424. if (args->ino != inode->i_ino || args->root != NILFS_I(inode)->i_root)
  425. return 0;
  426. ii = NILFS_I(inode);
  427. if (!test_bit(NILFS_I_GCINODE, &ii->i_state))
  428. return !args->for_gc;
  429. return args->for_gc && args->cno == ii->i_cno;
  430. }
  431. static int nilfs_iget_set(struct inode *inode, void *opaque)
  432. {
  433. struct nilfs_iget_args *args = opaque;
  434. inode->i_ino = args->ino;
  435. if (args->for_gc) {
  436. NILFS_I(inode)->i_state = 1 << NILFS_I_GCINODE;
  437. NILFS_I(inode)->i_cno = args->cno;
  438. NILFS_I(inode)->i_root = NULL;
  439. } else {
  440. if (args->root && args->ino == NILFS_ROOT_INO)
  441. nilfs_get_root(args->root);
  442. NILFS_I(inode)->i_root = args->root;
  443. }
  444. return 0;
  445. }
  446. struct inode *nilfs_ilookup(struct super_block *sb, struct nilfs_root *root,
  447. unsigned long ino)
  448. {
  449. struct nilfs_iget_args args = {
  450. .ino = ino, .root = root, .cno = 0, .for_gc = 0
  451. };
  452. return ilookup5(sb, ino, nilfs_iget_test, &args);
  453. }
  454. struct inode *nilfs_iget_locked(struct super_block *sb, struct nilfs_root *root,
  455. unsigned long ino)
  456. {
  457. struct nilfs_iget_args args = {
  458. .ino = ino, .root = root, .cno = 0, .for_gc = 0
  459. };
  460. return iget5_locked(sb, ino, nilfs_iget_test, nilfs_iget_set, &args);
  461. }
  462. struct inode *nilfs_iget(struct super_block *sb, struct nilfs_root *root,
  463. unsigned long ino)
  464. {
  465. struct inode *inode;
  466. int err;
  467. inode = nilfs_iget_locked(sb, root, ino);
  468. if (unlikely(!inode))
  469. return ERR_PTR(-ENOMEM);
  470. if (!(inode->i_state & I_NEW))
  471. return inode;
  472. err = __nilfs_read_inode(sb, root, ino, inode);
  473. if (unlikely(err)) {
  474. iget_failed(inode);
  475. return ERR_PTR(err);
  476. }
  477. unlock_new_inode(inode);
  478. return inode;
  479. }
  480. struct inode *nilfs_iget_for_gc(struct super_block *sb, unsigned long ino,
  481. __u64 cno)
  482. {
  483. struct nilfs_iget_args args = {
  484. .ino = ino, .root = NULL, .cno = cno, .for_gc = 1
  485. };
  486. struct inode *inode;
  487. int err;
  488. inode = iget5_locked(sb, ino, nilfs_iget_test, nilfs_iget_set, &args);
  489. if (unlikely(!inode))
  490. return ERR_PTR(-ENOMEM);
  491. if (!(inode->i_state & I_NEW))
  492. return inode;
  493. err = nilfs_init_gcinode(inode);
  494. if (unlikely(err)) {
  495. iget_failed(inode);
  496. return ERR_PTR(err);
  497. }
  498. unlock_new_inode(inode);
  499. return inode;
  500. }
  501. void nilfs_write_inode_common(struct inode *inode,
  502. struct nilfs_inode *raw_inode, int has_bmap)
  503. {
  504. struct nilfs_inode_info *ii = NILFS_I(inode);
  505. raw_inode->i_mode = cpu_to_le16(inode->i_mode);
  506. raw_inode->i_uid = cpu_to_le32(inode->i_uid);
  507. raw_inode->i_gid = cpu_to_le32(inode->i_gid);
  508. raw_inode->i_links_count = cpu_to_le16(inode->i_nlink);
  509. raw_inode->i_size = cpu_to_le64(inode->i_size);
  510. raw_inode->i_ctime = cpu_to_le64(inode->i_ctime.tv_sec);
  511. raw_inode->i_mtime = cpu_to_le64(inode->i_mtime.tv_sec);
  512. raw_inode->i_ctime_nsec = cpu_to_le32(inode->i_ctime.tv_nsec);
  513. raw_inode->i_mtime_nsec = cpu_to_le32(inode->i_mtime.tv_nsec);
  514. raw_inode->i_blocks = cpu_to_le64(inode->i_blocks);
  515. raw_inode->i_flags = cpu_to_le32(ii->i_flags);
  516. raw_inode->i_generation = cpu_to_le32(inode->i_generation);
  517. if (has_bmap)
  518. nilfs_bmap_write(ii->i_bmap, raw_inode);
  519. else if (S_ISCHR(inode->i_mode) || S_ISBLK(inode->i_mode))
  520. raw_inode->i_device_code =
  521. cpu_to_le64(huge_encode_dev(inode->i_rdev));
  522. /* When extending inode, nilfs->ns_inode_size should be checked
  523. for substitutions of appended fields */
  524. }
  525. void nilfs_update_inode(struct inode *inode, struct buffer_head *ibh)
  526. {
  527. ino_t ino = inode->i_ino;
  528. struct nilfs_inode_info *ii = NILFS_I(inode);
  529. struct inode *ifile = ii->i_root->ifile;
  530. struct nilfs_inode *raw_inode;
  531. raw_inode = nilfs_ifile_map_inode(ifile, ino, ibh);
  532. if (test_and_clear_bit(NILFS_I_NEW, &ii->i_state))
  533. memset(raw_inode, 0, NILFS_MDT(ifile)->mi_entry_size);
  534. set_bit(NILFS_I_INODE_DIRTY, &ii->i_state);
  535. nilfs_write_inode_common(inode, raw_inode, 0);
  536. /* XXX: call with has_bmap = 0 is a workaround to avoid
  537. deadlock of bmap. This delays update of i_bmap to just
  538. before writing */
  539. nilfs_ifile_unmap_inode(ifile, ino, ibh);
  540. }
  541. #define NILFS_MAX_TRUNCATE_BLOCKS 16384 /* 64MB for 4KB block */
  542. static void nilfs_truncate_bmap(struct nilfs_inode_info *ii,
  543. unsigned long from)
  544. {
  545. unsigned long b;
  546. int ret;
  547. if (!test_bit(NILFS_I_BMAP, &ii->i_state))
  548. return;
  549. repeat:
  550. ret = nilfs_bmap_last_key(ii->i_bmap, &b);
  551. if (ret == -ENOENT)
  552. return;
  553. else if (ret < 0)
  554. goto failed;
  555. if (b < from)
  556. return;
  557. b -= min_t(unsigned long, NILFS_MAX_TRUNCATE_BLOCKS, b - from);
  558. ret = nilfs_bmap_truncate(ii->i_bmap, b);
  559. nilfs_relax_pressure_in_lock(ii->vfs_inode.i_sb);
  560. if (!ret || (ret == -ENOMEM &&
  561. nilfs_bmap_truncate(ii->i_bmap, b) == 0))
  562. goto repeat;
  563. failed:
  564. nilfs_warning(ii->vfs_inode.i_sb, __func__,
  565. "failed to truncate bmap (ino=%lu, err=%d)",
  566. ii->vfs_inode.i_ino, ret);
  567. }
  568. void nilfs_truncate(struct inode *inode)
  569. {
  570. unsigned long blkoff;
  571. unsigned int blocksize;
  572. struct nilfs_transaction_info ti;
  573. struct super_block *sb = inode->i_sb;
  574. struct nilfs_inode_info *ii = NILFS_I(inode);
  575. if (!test_bit(NILFS_I_BMAP, &ii->i_state))
  576. return;
  577. if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
  578. return;
  579. blocksize = sb->s_blocksize;
  580. blkoff = (inode->i_size + blocksize - 1) >> sb->s_blocksize_bits;
  581. nilfs_transaction_begin(sb, &ti, 0); /* never fails */
  582. block_truncate_page(inode->i_mapping, inode->i_size, nilfs_get_block);
  583. nilfs_truncate_bmap(ii, blkoff);
  584. inode->i_mtime = inode->i_ctime = CURRENT_TIME;
  585. if (IS_SYNC(inode))
  586. nilfs_set_transaction_flag(NILFS_TI_SYNC);
  587. nilfs_mark_inode_dirty(inode);
  588. nilfs_set_file_dirty(inode, 0);
  589. nilfs_transaction_commit(sb);
  590. /* May construct a logical segment and may fail in sync mode.
  591. But truncate has no return value. */
  592. }
  593. static void nilfs_clear_inode(struct inode *inode)
  594. {
  595. struct nilfs_inode_info *ii = NILFS_I(inode);
  596. struct nilfs_mdt_info *mdi = NILFS_MDT(inode);
  597. /*
  598. * Free resources allocated in nilfs_read_inode(), here.
  599. */
  600. BUG_ON(!list_empty(&ii->i_dirty));
  601. brelse(ii->i_bh);
  602. ii->i_bh = NULL;
  603. if (mdi && mdi->mi_palloc_cache)
  604. nilfs_palloc_destroy_cache(inode);
  605. if (test_bit(NILFS_I_BMAP, &ii->i_state))
  606. nilfs_bmap_clear(ii->i_bmap);
  607. nilfs_btnode_cache_clear(&ii->i_btnode_cache);
  608. if (ii->i_root && inode->i_ino == NILFS_ROOT_INO)
  609. nilfs_put_root(ii->i_root);
  610. }
  611. void nilfs_evict_inode(struct inode *inode)
  612. {
  613. struct nilfs_transaction_info ti;
  614. struct super_block *sb = inode->i_sb;
  615. struct nilfs_inode_info *ii = NILFS_I(inode);
  616. int ret;
  617. if (inode->i_nlink || !ii->i_root || unlikely(is_bad_inode(inode))) {
  618. if (inode->i_data.nrpages)
  619. truncate_inode_pages(&inode->i_data, 0);
  620. end_writeback(inode);
  621. nilfs_clear_inode(inode);
  622. return;
  623. }
  624. nilfs_transaction_begin(sb, &ti, 0); /* never fails */
  625. if (inode->i_data.nrpages)
  626. truncate_inode_pages(&inode->i_data, 0);
  627. /* TODO: some of the following operations may fail. */
  628. nilfs_truncate_bmap(ii, 0);
  629. nilfs_mark_inode_dirty(inode);
  630. end_writeback(inode);
  631. ret = nilfs_ifile_delete_inode(ii->i_root->ifile, inode->i_ino);
  632. if (!ret)
  633. atomic_dec(&ii->i_root->inodes_count);
  634. nilfs_clear_inode(inode);
  635. if (IS_SYNC(inode))
  636. nilfs_set_transaction_flag(NILFS_TI_SYNC);
  637. nilfs_transaction_commit(sb);
  638. /* May construct a logical segment and may fail in sync mode.
  639. But delete_inode has no return value. */
  640. }
  641. int nilfs_setattr(struct dentry *dentry, struct iattr *iattr)
  642. {
  643. struct nilfs_transaction_info ti;
  644. struct inode *inode = dentry->d_inode;
  645. struct super_block *sb = inode->i_sb;
  646. int err;
  647. err = inode_change_ok(inode, iattr);
  648. if (err)
  649. return err;
  650. err = nilfs_transaction_begin(sb, &ti, 0);
  651. if (unlikely(err))
  652. return err;
  653. if ((iattr->ia_valid & ATTR_SIZE) &&
  654. iattr->ia_size != i_size_read(inode)) {
  655. err = vmtruncate(inode, iattr->ia_size);
  656. if (unlikely(err))
  657. goto out_err;
  658. }
  659. setattr_copy(inode, iattr);
  660. mark_inode_dirty(inode);
  661. if (iattr->ia_valid & ATTR_MODE) {
  662. err = nilfs_acl_chmod(inode);
  663. if (unlikely(err))
  664. goto out_err;
  665. }
  666. return nilfs_transaction_commit(sb);
  667. out_err:
  668. nilfs_transaction_abort(sb);
  669. return err;
  670. }
  671. int nilfs_permission(struct inode *inode, int mask, unsigned int flags)
  672. {
  673. struct nilfs_root *root;
  674. if (flags & IPERM_FLAG_RCU)
  675. return -ECHILD;
  676. root = NILFS_I(inode)->i_root;
  677. if ((mask & MAY_WRITE) && root &&
  678. root->cno != NILFS_CPTREE_CURRENT_CNO)
  679. return -EROFS; /* snapshot is not writable */
  680. return generic_permission(inode, mask, flags, NULL);
  681. }
  682. int nilfs_load_inode_block(struct inode *inode, struct buffer_head **pbh)
  683. {
  684. struct the_nilfs *nilfs = inode->i_sb->s_fs_info;
  685. struct nilfs_inode_info *ii = NILFS_I(inode);
  686. int err;
  687. spin_lock(&nilfs->ns_inode_lock);
  688. if (ii->i_bh == NULL) {
  689. spin_unlock(&nilfs->ns_inode_lock);
  690. err = nilfs_ifile_get_inode_block(ii->i_root->ifile,
  691. inode->i_ino, pbh);
  692. if (unlikely(err))
  693. return err;
  694. spin_lock(&nilfs->ns_inode_lock);
  695. if (ii->i_bh == NULL)
  696. ii->i_bh = *pbh;
  697. else {
  698. brelse(*pbh);
  699. *pbh = ii->i_bh;
  700. }
  701. } else
  702. *pbh = ii->i_bh;
  703. get_bh(*pbh);
  704. spin_unlock(&nilfs->ns_inode_lock);
  705. return 0;
  706. }
  707. int nilfs_inode_dirty(struct inode *inode)
  708. {
  709. struct nilfs_inode_info *ii = NILFS_I(inode);
  710. struct the_nilfs *nilfs = inode->i_sb->s_fs_info;
  711. int ret = 0;
  712. if (!list_empty(&ii->i_dirty)) {
  713. spin_lock(&nilfs->ns_inode_lock);
  714. ret = test_bit(NILFS_I_DIRTY, &ii->i_state) ||
  715. test_bit(NILFS_I_BUSY, &ii->i_state);
  716. spin_unlock(&nilfs->ns_inode_lock);
  717. }
  718. return ret;
  719. }
  720. int nilfs_set_file_dirty(struct inode *inode, unsigned nr_dirty)
  721. {
  722. struct nilfs_inode_info *ii = NILFS_I(inode);
  723. struct the_nilfs *nilfs = inode->i_sb->s_fs_info;
  724. atomic_add(nr_dirty, &nilfs->ns_ndirtyblks);
  725. if (test_and_set_bit(NILFS_I_DIRTY, &ii->i_state))
  726. return 0;
  727. spin_lock(&nilfs->ns_inode_lock);
  728. if (!test_bit(NILFS_I_QUEUED, &ii->i_state) &&
  729. !test_bit(NILFS_I_BUSY, &ii->i_state)) {
  730. /* Because this routine may race with nilfs_dispose_list(),
  731. we have to check NILFS_I_QUEUED here, too. */
  732. if (list_empty(&ii->i_dirty) && igrab(inode) == NULL) {
  733. /* This will happen when somebody is freeing
  734. this inode. */
  735. nilfs_warning(inode->i_sb, __func__,
  736. "cannot get inode (ino=%lu)\n",
  737. inode->i_ino);
  738. spin_unlock(&nilfs->ns_inode_lock);
  739. return -EINVAL; /* NILFS_I_DIRTY may remain for
  740. freeing inode */
  741. }
  742. list_del(&ii->i_dirty);
  743. list_add_tail(&ii->i_dirty, &nilfs->ns_dirty_files);
  744. set_bit(NILFS_I_QUEUED, &ii->i_state);
  745. }
  746. spin_unlock(&nilfs->ns_inode_lock);
  747. return 0;
  748. }
  749. int nilfs_mark_inode_dirty(struct inode *inode)
  750. {
  751. struct buffer_head *ibh;
  752. int err;
  753. err = nilfs_load_inode_block(inode, &ibh);
  754. if (unlikely(err)) {
  755. nilfs_warning(inode->i_sb, __func__,
  756. "failed to reget inode block.\n");
  757. return err;
  758. }
  759. nilfs_update_inode(inode, ibh);
  760. nilfs_mdt_mark_buffer_dirty(ibh);
  761. nilfs_mdt_mark_dirty(NILFS_I(inode)->i_root->ifile);
  762. brelse(ibh);
  763. return 0;
  764. }
  765. /**
  766. * nilfs_dirty_inode - reflect changes on given inode to an inode block.
  767. * @inode: inode of the file to be registered.
  768. *
  769. * nilfs_dirty_inode() loads a inode block containing the specified
  770. * @inode and copies data from a nilfs_inode to a corresponding inode
  771. * entry in the inode block. This operation is excluded from the segment
  772. * construction. This function can be called both as a single operation
  773. * and as a part of indivisible file operations.
  774. */
  775. void nilfs_dirty_inode(struct inode *inode)
  776. {
  777. struct nilfs_transaction_info ti;
  778. struct nilfs_mdt_info *mdi = NILFS_MDT(inode);
  779. if (is_bad_inode(inode)) {
  780. nilfs_warning(inode->i_sb, __func__,
  781. "tried to mark bad_inode dirty. ignored.\n");
  782. dump_stack();
  783. return;
  784. }
  785. if (mdi) {
  786. nilfs_mdt_mark_dirty(inode);
  787. return;
  788. }
  789. nilfs_transaction_begin(inode->i_sb, &ti, 0);
  790. nilfs_mark_inode_dirty(inode);
  791. nilfs_transaction_commit(inode->i_sb); /* never fails */
  792. }
  793. int nilfs_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo,
  794. __u64 start, __u64 len)
  795. {
  796. struct the_nilfs *nilfs = NILFS_I_NILFS(inode);
  797. __u64 logical = 0, phys = 0, size = 0;
  798. __u32 flags = 0;
  799. loff_t isize;
  800. sector_t blkoff, end_blkoff;
  801. sector_t delalloc_blkoff;
  802. unsigned long delalloc_blklen;
  803. unsigned int blkbits = inode->i_blkbits;
  804. int ret, n;
  805. ret = fiemap_check_flags(fieinfo, FIEMAP_FLAG_SYNC);
  806. if (ret)
  807. return ret;
  808. mutex_lock(&inode->i_mutex);
  809. isize = i_size_read(inode);
  810. blkoff = start >> blkbits;
  811. end_blkoff = (start + len - 1) >> blkbits;
  812. delalloc_blklen = nilfs_find_uncommitted_extent(inode, blkoff,
  813. &delalloc_blkoff);
  814. do {
  815. __u64 blkphy;
  816. unsigned int maxblocks;
  817. if (delalloc_blklen && blkoff == delalloc_blkoff) {
  818. if (size) {
  819. /* End of the current extent */
  820. ret = fiemap_fill_next_extent(
  821. fieinfo, logical, phys, size, flags);
  822. if (ret)
  823. break;
  824. }
  825. if (blkoff > end_blkoff)
  826. break;
  827. flags = FIEMAP_EXTENT_MERGED | FIEMAP_EXTENT_DELALLOC;
  828. logical = blkoff << blkbits;
  829. phys = 0;
  830. size = delalloc_blklen << blkbits;
  831. blkoff = delalloc_blkoff + delalloc_blklen;
  832. delalloc_blklen = nilfs_find_uncommitted_extent(
  833. inode, blkoff, &delalloc_blkoff);
  834. continue;
  835. }
  836. /*
  837. * Limit the number of blocks that we look up so as
  838. * not to get into the next delayed allocation extent.
  839. */
  840. maxblocks = INT_MAX;
  841. if (delalloc_blklen)
  842. maxblocks = min_t(sector_t, delalloc_blkoff - blkoff,
  843. maxblocks);
  844. blkphy = 0;
  845. down_read(&NILFS_MDT(nilfs->ns_dat)->mi_sem);
  846. n = nilfs_bmap_lookup_contig(
  847. NILFS_I(inode)->i_bmap, blkoff, &blkphy, maxblocks);
  848. up_read(&NILFS_MDT(nilfs->ns_dat)->mi_sem);
  849. if (n < 0) {
  850. int past_eof;
  851. if (unlikely(n != -ENOENT))
  852. break; /* error */
  853. /* HOLE */
  854. blkoff++;
  855. past_eof = ((blkoff << blkbits) >= isize);
  856. if (size) {
  857. /* End of the current extent */
  858. if (past_eof)
  859. flags |= FIEMAP_EXTENT_LAST;
  860. ret = fiemap_fill_next_extent(
  861. fieinfo, logical, phys, size, flags);
  862. if (ret)
  863. break;
  864. size = 0;
  865. }
  866. if (blkoff > end_blkoff || past_eof)
  867. break;
  868. } else {
  869. if (size) {
  870. if (phys && blkphy << blkbits == phys + size) {
  871. /* The current extent goes on */
  872. size += n << blkbits;
  873. } else {
  874. /* Terminate the current extent */
  875. ret = fiemap_fill_next_extent(
  876. fieinfo, logical, phys, size,
  877. flags);
  878. if (ret || blkoff > end_blkoff)
  879. break;
  880. /* Start another extent */
  881. flags = FIEMAP_EXTENT_MERGED;
  882. logical = blkoff << blkbits;
  883. phys = blkphy << blkbits;
  884. size = n << blkbits;
  885. }
  886. } else {
  887. /* Start a new extent */
  888. flags = FIEMAP_EXTENT_MERGED;
  889. logical = blkoff << blkbits;
  890. phys = blkphy << blkbits;
  891. size = n << blkbits;
  892. }
  893. blkoff += n;
  894. }
  895. cond_resched();
  896. } while (true);
  897. /* If ret is 1 then we just hit the end of the extent array */
  898. if (ret == 1)
  899. ret = 0;
  900. mutex_unlock(&inode->i_mutex);
  901. return ret;
  902. }