inode.c 29 KB

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