2 * inode.c - NILFS inode operations.
4 * Copyright (C) 2005-2008 Nippon Telegraph and Telephone Corporation.
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.
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.
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
20 * Written by Ryusuke Konishi <ryusuke@osrg.net>
24 #include <linux/buffer_head.h>
25 #include <linux/gfp.h>
26 #include <linux/mpage.h>
27 #include <linux/writeback.h>
28 #include <linux/aio.h>
38 * struct nilfs_iget_args - arguments used during comparison between inodes
40 * @cno: checkpoint number
41 * @root: pointer on NILFS root object (mounted checkpoint)
42 * @for_gc: inode for GC flag
44 struct nilfs_iget_args
{
47 struct nilfs_root
*root
;
51 void nilfs_inode_add_blocks(struct inode
*inode
, int n
)
53 struct nilfs_root
*root
= NILFS_I(inode
)->i_root
;
55 inode_add_bytes(inode
, (1 << inode
->i_blkbits
) * n
);
57 atomic64_add(n
, &root
->blocks_count
);
60 void nilfs_inode_sub_blocks(struct inode
*inode
, int n
)
62 struct nilfs_root
*root
= NILFS_I(inode
)->i_root
;
64 inode_sub_bytes(inode
, (1 << inode
->i_blkbits
) * n
);
66 atomic64_sub(n
, &root
->blocks_count
);
70 * nilfs_get_block() - get a file block on the filesystem (callback function)
71 * @inode - inode struct of the target file
72 * @blkoff - file block number
73 * @bh_result - buffer head to be mapped on
74 * @create - indicate whether allocating the block or not when it has not
77 * This function does not issue actual read request of the specified data
78 * block. It is done by VFS.
80 int nilfs_get_block(struct inode
*inode
, sector_t blkoff
,
81 struct buffer_head
*bh_result
, int create
)
83 struct nilfs_inode_info
*ii
= NILFS_I(inode
);
84 struct the_nilfs
*nilfs
= inode
->i_sb
->s_fs_info
;
87 unsigned maxblocks
= bh_result
->b_size
>> inode
->i_blkbits
;
89 down_read(&NILFS_MDT(nilfs
->ns_dat
)->mi_sem
);
90 ret
= nilfs_bmap_lookup_contig(ii
->i_bmap
, blkoff
, &blknum
, maxblocks
);
91 up_read(&NILFS_MDT(nilfs
->ns_dat
)->mi_sem
);
92 if (ret
>= 0) { /* found */
93 map_bh(bh_result
, inode
->i_sb
, blknum
);
95 bh_result
->b_size
= (ret
<< inode
->i_blkbits
);
98 /* data block was not found */
99 if (ret
== -ENOENT
&& create
) {
100 struct nilfs_transaction_info ti
;
102 bh_result
->b_blocknr
= 0;
103 err
= nilfs_transaction_begin(inode
->i_sb
, &ti
, 1);
106 err
= nilfs_bmap_insert(ii
->i_bmap
, (unsigned long)blkoff
,
107 (unsigned long)bh_result
);
108 if (unlikely(err
!= 0)) {
109 if (err
== -EEXIST
) {
111 * The get_block() function could be called
112 * from multiple callers for an inode.
113 * However, the page having this block must
114 * be locked in this case.
117 "nilfs_get_block: a race condition "
118 "while inserting a data block. "
119 "(inode number=%lu, file block "
122 (unsigned long long)blkoff
);
125 nilfs_transaction_abort(inode
->i_sb
);
128 nilfs_mark_inode_dirty(inode
);
129 nilfs_transaction_commit(inode
->i_sb
); /* never fails */
130 /* Error handling should be detailed */
131 set_buffer_new(bh_result
);
132 set_buffer_delay(bh_result
);
133 map_bh(bh_result
, inode
->i_sb
, 0); /* dbn must be changed
135 } else if (ret
== -ENOENT
) {
136 /* not found is not error (e.g. hole); must return without
137 the mapped state flag. */
148 * nilfs_readpage() - implement readpage() method of nilfs_aops {}
149 * address_space_operations.
150 * @file - file struct of the file to be read
151 * @page - the page to be read
153 static int nilfs_readpage(struct file
*file
, struct page
*page
)
155 return mpage_readpage(page
, nilfs_get_block
);
159 * nilfs_readpages() - implement readpages() method of nilfs_aops {}
160 * address_space_operations.
161 * @file - file struct of the file to be read
162 * @mapping - address_space struct used for reading multiple pages
163 * @pages - the pages to be read
164 * @nr_pages - number of pages to be read
166 static int nilfs_readpages(struct file
*file
, struct address_space
*mapping
,
167 struct list_head
*pages
, unsigned nr_pages
)
169 return mpage_readpages(mapping
, pages
, nr_pages
, nilfs_get_block
);
172 static int nilfs_writepages(struct address_space
*mapping
,
173 struct writeback_control
*wbc
)
175 struct inode
*inode
= mapping
->host
;
178 if (inode
->i_sb
->s_flags
& MS_RDONLY
) {
179 nilfs_clear_dirty_pages(mapping
, false);
183 if (wbc
->sync_mode
== WB_SYNC_ALL
)
184 err
= nilfs_construct_dsync_segment(inode
->i_sb
, inode
,
190 static int nilfs_writepage(struct page
*page
, struct writeback_control
*wbc
)
192 struct inode
*inode
= page
->mapping
->host
;
195 if (inode
->i_sb
->s_flags
& MS_RDONLY
) {
197 * It means that filesystem was remounted in read-only
198 * mode because of error or metadata corruption. But we
199 * have dirty pages that try to be flushed in background.
200 * So, here we simply discard this dirty page.
202 nilfs_clear_dirty_page(page
, false);
207 redirty_page_for_writepage(wbc
, page
);
210 if (wbc
->sync_mode
== WB_SYNC_ALL
) {
211 err
= nilfs_construct_segment(inode
->i_sb
);
214 } else if (wbc
->for_reclaim
)
215 nilfs_flush_segment(inode
->i_sb
, inode
->i_ino
);
220 static int nilfs_set_page_dirty(struct page
*page
)
222 int ret
= __set_page_dirty_nobuffers(page
);
224 if (page_has_buffers(page
)) {
225 struct inode
*inode
= page
->mapping
->host
;
226 unsigned nr_dirty
= 0;
227 struct buffer_head
*bh
, *head
;
230 * This page is locked by callers, and no other thread
231 * concurrently marks its buffers dirty since they are
232 * only dirtied through routines in fs/buffer.c in
233 * which call sites of mark_buffer_dirty are protected
236 bh
= head
= page_buffers(page
);
238 /* Do not mark hole blocks dirty */
239 if (buffer_dirty(bh
) || !buffer_mapped(bh
))
242 set_buffer_dirty(bh
);
244 } while (bh
= bh
->b_this_page
, bh
!= head
);
247 nilfs_set_file_dirty(inode
, nr_dirty
);
252 void nilfs_write_failed(struct address_space
*mapping
, loff_t to
)
254 struct inode
*inode
= mapping
->host
;
256 if (to
> inode
->i_size
) {
257 truncate_pagecache(inode
, inode
->i_size
);
258 nilfs_truncate(inode
);
262 static int nilfs_write_begin(struct file
*file
, struct address_space
*mapping
,
263 loff_t pos
, unsigned len
, unsigned flags
,
264 struct page
**pagep
, void **fsdata
)
267 struct inode
*inode
= mapping
->host
;
268 int err
= nilfs_transaction_begin(inode
->i_sb
, NULL
, 1);
273 err
= block_write_begin(mapping
, pos
, len
, flags
, pagep
,
276 nilfs_write_failed(mapping
, pos
+ len
);
277 nilfs_transaction_abort(inode
->i_sb
);
282 static int nilfs_write_end(struct file
*file
, struct address_space
*mapping
,
283 loff_t pos
, unsigned len
, unsigned copied
,
284 struct page
*page
, void *fsdata
)
286 struct inode
*inode
= mapping
->host
;
287 unsigned start
= pos
& (PAGE_CACHE_SIZE
- 1);
291 nr_dirty
= nilfs_page_count_clean_buffers(page
, start
,
293 copied
= generic_write_end(file
, mapping
, pos
, len
, copied
, page
,
295 nilfs_set_file_dirty(inode
, nr_dirty
);
296 err
= nilfs_transaction_commit(inode
->i_sb
);
297 return err
? : copied
;
301 nilfs_direct_IO(int rw
, struct kiocb
*iocb
, struct iov_iter
*iter
,
304 struct file
*file
= iocb
->ki_filp
;
305 struct address_space
*mapping
= file
->f_mapping
;
306 struct inode
*inode
= file
->f_mapping
->host
;
307 size_t count
= iov_iter_count(iter
);
313 /* Needs synchronization with the cleaner */
314 size
= blockdev_direct_IO(rw
, iocb
, inode
, iter
, offset
,
318 * In case of error extending write may have instantiated a few
319 * blocks outside i_size. Trim these off again.
321 if (unlikely((rw
& WRITE
) && size
< 0)) {
322 loff_t isize
= i_size_read(inode
);
323 loff_t end
= offset
+ count
;
326 nilfs_write_failed(mapping
, end
);
332 const struct address_space_operations nilfs_aops
= {
333 .writepage
= nilfs_writepage
,
334 .readpage
= nilfs_readpage
,
335 .writepages
= nilfs_writepages
,
336 .set_page_dirty
= nilfs_set_page_dirty
,
337 .readpages
= nilfs_readpages
,
338 .write_begin
= nilfs_write_begin
,
339 .write_end
= nilfs_write_end
,
340 /* .releasepage = nilfs_releasepage, */
341 .invalidatepage
= block_invalidatepage
,
342 .direct_IO
= nilfs_direct_IO
,
343 .is_partially_uptodate
= block_is_partially_uptodate
,
346 struct inode
*nilfs_new_inode(struct inode
*dir
, umode_t mode
)
348 struct super_block
*sb
= dir
->i_sb
;
349 struct the_nilfs
*nilfs
= sb
->s_fs_info
;
351 struct nilfs_inode_info
*ii
;
352 struct nilfs_root
*root
;
356 inode
= new_inode(sb
);
357 if (unlikely(!inode
))
360 mapping_set_gfp_mask(inode
->i_mapping
,
361 mapping_gfp_mask(inode
->i_mapping
) & ~__GFP_FS
);
363 root
= NILFS_I(dir
)->i_root
;
365 ii
->i_state
= 1 << NILFS_I_NEW
;
368 err
= nilfs_ifile_create_inode(root
->ifile
, &ino
, &ii
->i_bh
);
370 goto failed_ifile_create_inode
;
371 /* reference count of i_bh inherits from nilfs_mdt_read_block() */
373 atomic64_inc(&root
->inodes_count
);
374 inode_init_owner(inode
, dir
, mode
);
376 inode
->i_mtime
= inode
->i_atime
= inode
->i_ctime
= CURRENT_TIME
;
378 if (S_ISREG(mode
) || S_ISDIR(mode
) || S_ISLNK(mode
)) {
379 err
= nilfs_bmap_read(ii
->i_bmap
, NULL
);
383 set_bit(NILFS_I_BMAP
, &ii
->i_state
);
384 /* No lock is needed; iget() ensures it. */
387 ii
->i_flags
= nilfs_mask_flags(
388 mode
, NILFS_I(dir
)->i_flags
& NILFS_FL_INHERITED
);
390 /* ii->i_file_acl = 0; */
391 /* ii->i_dir_acl = 0; */
392 ii
->i_dir_start_lookup
= 0;
393 nilfs_set_inode_flags(inode
);
394 spin_lock(&nilfs
->ns_next_gen_lock
);
395 inode
->i_generation
= nilfs
->ns_next_generation
++;
396 spin_unlock(&nilfs
->ns_next_gen_lock
);
397 insert_inode_hash(inode
);
399 err
= nilfs_init_acl(inode
, dir
);
401 goto failed_acl
; /* never occur. When supporting
402 nilfs_init_acl(), proper cancellation of
403 above jobs should be considered */
410 iput(inode
); /* raw_inode will be deleted through
411 generic_delete_inode() */
414 failed_ifile_create_inode
:
415 make_bad_inode(inode
);
416 iput(inode
); /* if i_nlink == 1, generic_forget_inode() will be
422 void nilfs_set_inode_flags(struct inode
*inode
)
424 unsigned int flags
= NILFS_I(inode
)->i_flags
;
426 inode
->i_flags
&= ~(S_SYNC
| S_APPEND
| S_IMMUTABLE
| S_NOATIME
|
428 if (flags
& FS_SYNC_FL
)
429 inode
->i_flags
|= S_SYNC
;
430 if (flags
& FS_APPEND_FL
)
431 inode
->i_flags
|= S_APPEND
;
432 if (flags
& FS_IMMUTABLE_FL
)
433 inode
->i_flags
|= S_IMMUTABLE
;
434 if (flags
& FS_NOATIME_FL
)
435 inode
->i_flags
|= S_NOATIME
;
436 if (flags
& FS_DIRSYNC_FL
)
437 inode
->i_flags
|= S_DIRSYNC
;
438 mapping_set_gfp_mask(inode
->i_mapping
,
439 mapping_gfp_mask(inode
->i_mapping
) & ~__GFP_FS
);
442 int nilfs_read_inode_common(struct inode
*inode
,
443 struct nilfs_inode
*raw_inode
)
445 struct nilfs_inode_info
*ii
= NILFS_I(inode
);
448 inode
->i_mode
= le16_to_cpu(raw_inode
->i_mode
);
449 i_uid_write(inode
, le32_to_cpu(raw_inode
->i_uid
));
450 i_gid_write(inode
, le32_to_cpu(raw_inode
->i_gid
));
451 set_nlink(inode
, le16_to_cpu(raw_inode
->i_links_count
));
452 inode
->i_size
= le64_to_cpu(raw_inode
->i_size
);
453 inode
->i_atime
.tv_sec
= le64_to_cpu(raw_inode
->i_mtime
);
454 inode
->i_ctime
.tv_sec
= le64_to_cpu(raw_inode
->i_ctime
);
455 inode
->i_mtime
.tv_sec
= le64_to_cpu(raw_inode
->i_mtime
);
456 inode
->i_atime
.tv_nsec
= le32_to_cpu(raw_inode
->i_mtime_nsec
);
457 inode
->i_ctime
.tv_nsec
= le32_to_cpu(raw_inode
->i_ctime_nsec
);
458 inode
->i_mtime
.tv_nsec
= le32_to_cpu(raw_inode
->i_mtime_nsec
);
459 if (inode
->i_nlink
== 0 && inode
->i_mode
== 0)
460 return -EINVAL
; /* this inode is deleted */
462 inode
->i_blocks
= le64_to_cpu(raw_inode
->i_blocks
);
463 ii
->i_flags
= le32_to_cpu(raw_inode
->i_flags
);
465 ii
->i_file_acl
= le32_to_cpu(raw_inode
->i_file_acl
);
466 ii
->i_dir_acl
= S_ISREG(inode
->i_mode
) ?
467 0 : le32_to_cpu(raw_inode
->i_dir_acl
);
469 ii
->i_dir_start_lookup
= 0;
470 inode
->i_generation
= le32_to_cpu(raw_inode
->i_generation
);
472 if (S_ISREG(inode
->i_mode
) || S_ISDIR(inode
->i_mode
) ||
473 S_ISLNK(inode
->i_mode
)) {
474 err
= nilfs_bmap_read(ii
->i_bmap
, raw_inode
);
477 set_bit(NILFS_I_BMAP
, &ii
->i_state
);
478 /* No lock is needed; iget() ensures it. */
483 static int __nilfs_read_inode(struct super_block
*sb
,
484 struct nilfs_root
*root
, unsigned long ino
,
487 struct the_nilfs
*nilfs
= sb
->s_fs_info
;
488 struct buffer_head
*bh
;
489 struct nilfs_inode
*raw_inode
;
492 down_read(&NILFS_MDT(nilfs
->ns_dat
)->mi_sem
);
493 err
= nilfs_ifile_get_inode_block(root
->ifile
, ino
, &bh
);
497 raw_inode
= nilfs_ifile_map_inode(root
->ifile
, ino
, bh
);
499 err
= nilfs_read_inode_common(inode
, raw_inode
);
503 if (S_ISREG(inode
->i_mode
)) {
504 inode
->i_op
= &nilfs_file_inode_operations
;
505 inode
->i_fop
= &nilfs_file_operations
;
506 inode
->i_mapping
->a_ops
= &nilfs_aops
;
507 } else if (S_ISDIR(inode
->i_mode
)) {
508 inode
->i_op
= &nilfs_dir_inode_operations
;
509 inode
->i_fop
= &nilfs_dir_operations
;
510 inode
->i_mapping
->a_ops
= &nilfs_aops
;
511 } else if (S_ISLNK(inode
->i_mode
)) {
512 inode
->i_op
= &nilfs_symlink_inode_operations
;
513 inode
->i_mapping
->a_ops
= &nilfs_aops
;
515 inode
->i_op
= &nilfs_special_inode_operations
;
517 inode
, inode
->i_mode
,
518 huge_decode_dev(le64_to_cpu(raw_inode
->i_device_code
)));
520 nilfs_ifile_unmap_inode(root
->ifile
, ino
, bh
);
522 up_read(&NILFS_MDT(nilfs
->ns_dat
)->mi_sem
);
523 nilfs_set_inode_flags(inode
);
527 nilfs_ifile_unmap_inode(root
->ifile
, ino
, bh
);
531 up_read(&NILFS_MDT(nilfs
->ns_dat
)->mi_sem
);
535 static int nilfs_iget_test(struct inode
*inode
, void *opaque
)
537 struct nilfs_iget_args
*args
= opaque
;
538 struct nilfs_inode_info
*ii
;
540 if (args
->ino
!= inode
->i_ino
|| args
->root
!= NILFS_I(inode
)->i_root
)
544 if (!test_bit(NILFS_I_GCINODE
, &ii
->i_state
))
545 return !args
->for_gc
;
547 return args
->for_gc
&& args
->cno
== ii
->i_cno
;
550 static int nilfs_iget_set(struct inode
*inode
, void *opaque
)
552 struct nilfs_iget_args
*args
= opaque
;
554 inode
->i_ino
= args
->ino
;
556 NILFS_I(inode
)->i_state
= 1 << NILFS_I_GCINODE
;
557 NILFS_I(inode
)->i_cno
= args
->cno
;
558 NILFS_I(inode
)->i_root
= NULL
;
560 if (args
->root
&& args
->ino
== NILFS_ROOT_INO
)
561 nilfs_get_root(args
->root
);
562 NILFS_I(inode
)->i_root
= args
->root
;
567 struct inode
*nilfs_ilookup(struct super_block
*sb
, struct nilfs_root
*root
,
570 struct nilfs_iget_args args
= {
571 .ino
= ino
, .root
= root
, .cno
= 0, .for_gc
= 0
574 return ilookup5(sb
, ino
, nilfs_iget_test
, &args
);
577 struct inode
*nilfs_iget_locked(struct super_block
*sb
, struct nilfs_root
*root
,
580 struct nilfs_iget_args args
= {
581 .ino
= ino
, .root
= root
, .cno
= 0, .for_gc
= 0
584 return iget5_locked(sb
, ino
, nilfs_iget_test
, nilfs_iget_set
, &args
);
587 struct inode
*nilfs_iget(struct super_block
*sb
, struct nilfs_root
*root
,
593 inode
= nilfs_iget_locked(sb
, root
, ino
);
594 if (unlikely(!inode
))
595 return ERR_PTR(-ENOMEM
);
596 if (!(inode
->i_state
& I_NEW
))
599 err
= __nilfs_read_inode(sb
, root
, ino
, inode
);
604 unlock_new_inode(inode
);
608 struct inode
*nilfs_iget_for_gc(struct super_block
*sb
, unsigned long ino
,
611 struct nilfs_iget_args args
= {
612 .ino
= ino
, .root
= NULL
, .cno
= cno
, .for_gc
= 1
617 inode
= iget5_locked(sb
, ino
, nilfs_iget_test
, nilfs_iget_set
, &args
);
618 if (unlikely(!inode
))
619 return ERR_PTR(-ENOMEM
);
620 if (!(inode
->i_state
& I_NEW
))
623 err
= nilfs_init_gcinode(inode
);
628 unlock_new_inode(inode
);
632 void nilfs_write_inode_common(struct inode
*inode
,
633 struct nilfs_inode
*raw_inode
, int has_bmap
)
635 struct nilfs_inode_info
*ii
= NILFS_I(inode
);
637 raw_inode
->i_mode
= cpu_to_le16(inode
->i_mode
);
638 raw_inode
->i_uid
= cpu_to_le32(i_uid_read(inode
));
639 raw_inode
->i_gid
= cpu_to_le32(i_gid_read(inode
));
640 raw_inode
->i_links_count
= cpu_to_le16(inode
->i_nlink
);
641 raw_inode
->i_size
= cpu_to_le64(inode
->i_size
);
642 raw_inode
->i_ctime
= cpu_to_le64(inode
->i_ctime
.tv_sec
);
643 raw_inode
->i_mtime
= cpu_to_le64(inode
->i_mtime
.tv_sec
);
644 raw_inode
->i_ctime_nsec
= cpu_to_le32(inode
->i_ctime
.tv_nsec
);
645 raw_inode
->i_mtime_nsec
= cpu_to_le32(inode
->i_mtime
.tv_nsec
);
646 raw_inode
->i_blocks
= cpu_to_le64(inode
->i_blocks
);
648 raw_inode
->i_flags
= cpu_to_le32(ii
->i_flags
);
649 raw_inode
->i_generation
= cpu_to_le32(inode
->i_generation
);
651 if (NILFS_ROOT_METADATA_FILE(inode
->i_ino
)) {
652 struct the_nilfs
*nilfs
= inode
->i_sb
->s_fs_info
;
654 /* zero-fill unused portion in the case of super root block */
655 raw_inode
->i_xattr
= 0;
656 raw_inode
->i_pad
= 0;
657 memset((void *)raw_inode
+ sizeof(*raw_inode
), 0,
658 nilfs
->ns_inode_size
- sizeof(*raw_inode
));
662 nilfs_bmap_write(ii
->i_bmap
, raw_inode
);
663 else if (S_ISCHR(inode
->i_mode
) || S_ISBLK(inode
->i_mode
))
664 raw_inode
->i_device_code
=
665 cpu_to_le64(huge_encode_dev(inode
->i_rdev
));
666 /* When extending inode, nilfs->ns_inode_size should be checked
667 for substitutions of appended fields */
670 void nilfs_update_inode(struct inode
*inode
, struct buffer_head
*ibh
)
672 ino_t ino
= inode
->i_ino
;
673 struct nilfs_inode_info
*ii
= NILFS_I(inode
);
674 struct inode
*ifile
= ii
->i_root
->ifile
;
675 struct nilfs_inode
*raw_inode
;
677 raw_inode
= nilfs_ifile_map_inode(ifile
, ino
, ibh
);
679 if (test_and_clear_bit(NILFS_I_NEW
, &ii
->i_state
))
680 memset(raw_inode
, 0, NILFS_MDT(ifile
)->mi_entry_size
);
681 set_bit(NILFS_I_INODE_DIRTY
, &ii
->i_state
);
683 nilfs_write_inode_common(inode
, raw_inode
, 0);
684 /* XXX: call with has_bmap = 0 is a workaround to avoid
685 deadlock of bmap. This delays update of i_bmap to just
687 nilfs_ifile_unmap_inode(ifile
, ino
, ibh
);
690 #define NILFS_MAX_TRUNCATE_BLOCKS 16384 /* 64MB for 4KB block */
692 static void nilfs_truncate_bmap(struct nilfs_inode_info
*ii
,
698 if (!test_bit(NILFS_I_BMAP
, &ii
->i_state
))
701 ret
= nilfs_bmap_last_key(ii
->i_bmap
, &b
);
710 b
-= min_t(unsigned long, NILFS_MAX_TRUNCATE_BLOCKS
, b
- from
);
711 ret
= nilfs_bmap_truncate(ii
->i_bmap
, b
);
712 nilfs_relax_pressure_in_lock(ii
->vfs_inode
.i_sb
);
713 if (!ret
|| (ret
== -ENOMEM
&&
714 nilfs_bmap_truncate(ii
->i_bmap
, b
) == 0))
718 nilfs_warning(ii
->vfs_inode
.i_sb
, __func__
,
719 "failed to truncate bmap (ino=%lu, err=%d)",
720 ii
->vfs_inode
.i_ino
, ret
);
723 void nilfs_truncate(struct inode
*inode
)
725 unsigned long blkoff
;
726 unsigned int blocksize
;
727 struct nilfs_transaction_info ti
;
728 struct super_block
*sb
= inode
->i_sb
;
729 struct nilfs_inode_info
*ii
= NILFS_I(inode
);
731 if (!test_bit(NILFS_I_BMAP
, &ii
->i_state
))
733 if (IS_APPEND(inode
) || IS_IMMUTABLE(inode
))
736 blocksize
= sb
->s_blocksize
;
737 blkoff
= (inode
->i_size
+ blocksize
- 1) >> sb
->s_blocksize_bits
;
738 nilfs_transaction_begin(sb
, &ti
, 0); /* never fails */
740 block_truncate_page(inode
->i_mapping
, inode
->i_size
, nilfs_get_block
);
742 nilfs_truncate_bmap(ii
, blkoff
);
744 inode
->i_mtime
= inode
->i_ctime
= CURRENT_TIME
;
746 nilfs_set_transaction_flag(NILFS_TI_SYNC
);
748 nilfs_mark_inode_dirty(inode
);
749 nilfs_set_file_dirty(inode
, 0);
750 nilfs_transaction_commit(sb
);
751 /* May construct a logical segment and may fail in sync mode.
752 But truncate has no return value. */
755 static void nilfs_clear_inode(struct inode
*inode
)
757 struct nilfs_inode_info
*ii
= NILFS_I(inode
);
758 struct nilfs_mdt_info
*mdi
= NILFS_MDT(inode
);
761 * Free resources allocated in nilfs_read_inode(), here.
763 BUG_ON(!list_empty(&ii
->i_dirty
));
767 if (mdi
&& mdi
->mi_palloc_cache
)
768 nilfs_palloc_destroy_cache(inode
);
770 if (test_bit(NILFS_I_BMAP
, &ii
->i_state
))
771 nilfs_bmap_clear(ii
->i_bmap
);
773 nilfs_btnode_cache_clear(&ii
->i_btnode_cache
);
775 if (ii
->i_root
&& inode
->i_ino
== NILFS_ROOT_INO
)
776 nilfs_put_root(ii
->i_root
);
779 void nilfs_evict_inode(struct inode
*inode
)
781 struct nilfs_transaction_info ti
;
782 struct super_block
*sb
= inode
->i_sb
;
783 struct nilfs_inode_info
*ii
= NILFS_I(inode
);
786 if (inode
->i_nlink
|| !ii
->i_root
|| unlikely(is_bad_inode(inode
))) {
787 truncate_inode_pages_final(&inode
->i_data
);
789 nilfs_clear_inode(inode
);
792 nilfs_transaction_begin(sb
, &ti
, 0); /* never fails */
794 truncate_inode_pages_final(&inode
->i_data
);
796 /* TODO: some of the following operations may fail. */
797 nilfs_truncate_bmap(ii
, 0);
798 nilfs_mark_inode_dirty(inode
);
801 ret
= nilfs_ifile_delete_inode(ii
->i_root
->ifile
, inode
->i_ino
);
803 atomic64_dec(&ii
->i_root
->inodes_count
);
805 nilfs_clear_inode(inode
);
808 nilfs_set_transaction_flag(NILFS_TI_SYNC
);
809 nilfs_transaction_commit(sb
);
810 /* May construct a logical segment and may fail in sync mode.
811 But delete_inode has no return value. */
814 int nilfs_setattr(struct dentry
*dentry
, struct iattr
*iattr
)
816 struct nilfs_transaction_info ti
;
817 struct inode
*inode
= dentry
->d_inode
;
818 struct super_block
*sb
= inode
->i_sb
;
821 err
= inode_change_ok(inode
, iattr
);
825 err
= nilfs_transaction_begin(sb
, &ti
, 0);
829 if ((iattr
->ia_valid
& ATTR_SIZE
) &&
830 iattr
->ia_size
!= i_size_read(inode
)) {
831 inode_dio_wait(inode
);
832 truncate_setsize(inode
, iattr
->ia_size
);
833 nilfs_truncate(inode
);
836 setattr_copy(inode
, iattr
);
837 mark_inode_dirty(inode
);
839 if (iattr
->ia_valid
& ATTR_MODE
) {
840 err
= nilfs_acl_chmod(inode
);
845 return nilfs_transaction_commit(sb
);
848 nilfs_transaction_abort(sb
);
852 int nilfs_permission(struct inode
*inode
, int mask
)
854 struct nilfs_root
*root
= NILFS_I(inode
)->i_root
;
855 if ((mask
& MAY_WRITE
) && root
&&
856 root
->cno
!= NILFS_CPTREE_CURRENT_CNO
)
857 return -EROFS
; /* snapshot is not writable */
859 return generic_permission(inode
, mask
);
862 int nilfs_load_inode_block(struct inode
*inode
, struct buffer_head
**pbh
)
864 struct the_nilfs
*nilfs
= inode
->i_sb
->s_fs_info
;
865 struct nilfs_inode_info
*ii
= NILFS_I(inode
);
868 spin_lock(&nilfs
->ns_inode_lock
);
869 if (ii
->i_bh
== NULL
) {
870 spin_unlock(&nilfs
->ns_inode_lock
);
871 err
= nilfs_ifile_get_inode_block(ii
->i_root
->ifile
,
875 spin_lock(&nilfs
->ns_inode_lock
);
876 if (ii
->i_bh
== NULL
)
886 spin_unlock(&nilfs
->ns_inode_lock
);
890 int nilfs_inode_dirty(struct inode
*inode
)
892 struct nilfs_inode_info
*ii
= NILFS_I(inode
);
893 struct the_nilfs
*nilfs
= inode
->i_sb
->s_fs_info
;
896 if (!list_empty(&ii
->i_dirty
)) {
897 spin_lock(&nilfs
->ns_inode_lock
);
898 ret
= test_bit(NILFS_I_DIRTY
, &ii
->i_state
) ||
899 test_bit(NILFS_I_BUSY
, &ii
->i_state
);
900 spin_unlock(&nilfs
->ns_inode_lock
);
905 int nilfs_set_file_dirty(struct inode
*inode
, unsigned nr_dirty
)
907 struct nilfs_inode_info
*ii
= NILFS_I(inode
);
908 struct the_nilfs
*nilfs
= inode
->i_sb
->s_fs_info
;
910 atomic_add(nr_dirty
, &nilfs
->ns_ndirtyblks
);
912 if (test_and_set_bit(NILFS_I_DIRTY
, &ii
->i_state
))
915 spin_lock(&nilfs
->ns_inode_lock
);
916 if (!test_bit(NILFS_I_QUEUED
, &ii
->i_state
) &&
917 !test_bit(NILFS_I_BUSY
, &ii
->i_state
)) {
918 /* Because this routine may race with nilfs_dispose_list(),
919 we have to check NILFS_I_QUEUED here, too. */
920 if (list_empty(&ii
->i_dirty
) && igrab(inode
) == NULL
) {
921 /* This will happen when somebody is freeing
923 nilfs_warning(inode
->i_sb
, __func__
,
924 "cannot get inode (ino=%lu)\n",
926 spin_unlock(&nilfs
->ns_inode_lock
);
927 return -EINVAL
; /* NILFS_I_DIRTY may remain for
930 list_move_tail(&ii
->i_dirty
, &nilfs
->ns_dirty_files
);
931 set_bit(NILFS_I_QUEUED
, &ii
->i_state
);
933 spin_unlock(&nilfs
->ns_inode_lock
);
937 int nilfs_mark_inode_dirty(struct inode
*inode
)
939 struct buffer_head
*ibh
;
942 err
= nilfs_load_inode_block(inode
, &ibh
);
944 nilfs_warning(inode
->i_sb
, __func__
,
945 "failed to reget inode block.\n");
948 nilfs_update_inode(inode
, ibh
);
949 mark_buffer_dirty(ibh
);
950 nilfs_mdt_mark_dirty(NILFS_I(inode
)->i_root
->ifile
);
956 * nilfs_dirty_inode - reflect changes on given inode to an inode block.
957 * @inode: inode of the file to be registered.
959 * nilfs_dirty_inode() loads a inode block containing the specified
960 * @inode and copies data from a nilfs_inode to a corresponding inode
961 * entry in the inode block. This operation is excluded from the segment
962 * construction. This function can be called both as a single operation
963 * and as a part of indivisible file operations.
965 void nilfs_dirty_inode(struct inode
*inode
, int flags
)
967 struct nilfs_transaction_info ti
;
968 struct nilfs_mdt_info
*mdi
= NILFS_MDT(inode
);
970 if (is_bad_inode(inode
)) {
971 nilfs_warning(inode
->i_sb
, __func__
,
972 "tried to mark bad_inode dirty. ignored.\n");
977 nilfs_mdt_mark_dirty(inode
);
980 nilfs_transaction_begin(inode
->i_sb
, &ti
, 0);
981 nilfs_mark_inode_dirty(inode
);
982 nilfs_transaction_commit(inode
->i_sb
); /* never fails */
985 int nilfs_fiemap(struct inode
*inode
, struct fiemap_extent_info
*fieinfo
,
986 __u64 start
, __u64 len
)
988 struct the_nilfs
*nilfs
= inode
->i_sb
->s_fs_info
;
989 __u64 logical
= 0, phys
= 0, size
= 0;
992 sector_t blkoff
, end_blkoff
;
993 sector_t delalloc_blkoff
;
994 unsigned long delalloc_blklen
;
995 unsigned int blkbits
= inode
->i_blkbits
;
998 ret
= fiemap_check_flags(fieinfo
, FIEMAP_FLAG_SYNC
);
1002 mutex_lock(&inode
->i_mutex
);
1004 isize
= i_size_read(inode
);
1006 blkoff
= start
>> blkbits
;
1007 end_blkoff
= (start
+ len
- 1) >> blkbits
;
1009 delalloc_blklen
= nilfs_find_uncommitted_extent(inode
, blkoff
,
1014 unsigned int maxblocks
;
1016 if (delalloc_blklen
&& blkoff
== delalloc_blkoff
) {
1018 /* End of the current extent */
1019 ret
= fiemap_fill_next_extent(
1020 fieinfo
, logical
, phys
, size
, flags
);
1024 if (blkoff
> end_blkoff
)
1027 flags
= FIEMAP_EXTENT_MERGED
| FIEMAP_EXTENT_DELALLOC
;
1028 logical
= blkoff
<< blkbits
;
1030 size
= delalloc_blklen
<< blkbits
;
1032 blkoff
= delalloc_blkoff
+ delalloc_blklen
;
1033 delalloc_blklen
= nilfs_find_uncommitted_extent(
1034 inode
, blkoff
, &delalloc_blkoff
);
1039 * Limit the number of blocks that we look up so as
1040 * not to get into the next delayed allocation extent.
1042 maxblocks
= INT_MAX
;
1043 if (delalloc_blklen
)
1044 maxblocks
= min_t(sector_t
, delalloc_blkoff
- blkoff
,
1048 down_read(&NILFS_MDT(nilfs
->ns_dat
)->mi_sem
);
1049 n
= nilfs_bmap_lookup_contig(
1050 NILFS_I(inode
)->i_bmap
, blkoff
, &blkphy
, maxblocks
);
1051 up_read(&NILFS_MDT(nilfs
->ns_dat
)->mi_sem
);
1056 if (unlikely(n
!= -ENOENT
))
1061 past_eof
= ((blkoff
<< blkbits
) >= isize
);
1064 /* End of the current extent */
1067 flags
|= FIEMAP_EXTENT_LAST
;
1069 ret
= fiemap_fill_next_extent(
1070 fieinfo
, logical
, phys
, size
, flags
);
1075 if (blkoff
> end_blkoff
|| past_eof
)
1079 if (phys
&& blkphy
<< blkbits
== phys
+ size
) {
1080 /* The current extent goes on */
1081 size
+= n
<< blkbits
;
1083 /* Terminate the current extent */
1084 ret
= fiemap_fill_next_extent(
1085 fieinfo
, logical
, phys
, size
,
1087 if (ret
|| blkoff
> end_blkoff
)
1090 /* Start another extent */
1091 flags
= FIEMAP_EXTENT_MERGED
;
1092 logical
= blkoff
<< blkbits
;
1093 phys
= blkphy
<< blkbits
;
1094 size
= n
<< blkbits
;
1097 /* Start a new extent */
1098 flags
= FIEMAP_EXTENT_MERGED
;
1099 logical
= blkoff
<< blkbits
;
1100 phys
= blkphy
<< blkbits
;
1101 size
= n
<< blkbits
;
1108 /* If ret is 1 then we just hit the end of the extent array */
1112 mutex_unlock(&inode
->i_mutex
);