inode.c 30 KB

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