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/pagemap.h>
28 #include <linux/writeback.h>
29 #include <linux/uio.h>
39 * struct nilfs_iget_args - arguments used during comparison between inodes
41 * @cno: checkpoint number
42 * @root: pointer on NILFS root object (mounted checkpoint)
43 * @for_gc: inode for GC flag
45 struct nilfs_iget_args
{
48 struct nilfs_root
*root
;
52 static int nilfs_iget_test(struct inode
*inode
, void *opaque
);
54 void nilfs_inode_add_blocks(struct inode
*inode
, int n
)
56 struct nilfs_root
*root
= NILFS_I(inode
)->i_root
;
58 inode_add_bytes(inode
, (1 << inode
->i_blkbits
) * n
);
60 atomic64_add(n
, &root
->blocks_count
);
63 void nilfs_inode_sub_blocks(struct inode
*inode
, int n
)
65 struct nilfs_root
*root
= NILFS_I(inode
)->i_root
;
67 inode_sub_bytes(inode
, (1 << inode
->i_blkbits
) * n
);
69 atomic64_sub(n
, &root
->blocks_count
);
73 * nilfs_get_block() - get a file block on the filesystem (callback function)
74 * @inode - inode struct of the target file
75 * @blkoff - file block number
76 * @bh_result - buffer head to be mapped on
77 * @create - indicate whether allocating the block or not when it has not
80 * This function does not issue actual read request of the specified data
81 * block. It is done by VFS.
83 int nilfs_get_block(struct inode
*inode
, sector_t blkoff
,
84 struct buffer_head
*bh_result
, int create
)
86 struct nilfs_inode_info
*ii
= NILFS_I(inode
);
87 struct the_nilfs
*nilfs
= inode
->i_sb
->s_fs_info
;
90 unsigned maxblocks
= bh_result
->b_size
>> inode
->i_blkbits
;
92 down_read(&NILFS_MDT(nilfs
->ns_dat
)->mi_sem
);
93 ret
= nilfs_bmap_lookup_contig(ii
->i_bmap
, blkoff
, &blknum
, maxblocks
);
94 up_read(&NILFS_MDT(nilfs
->ns_dat
)->mi_sem
);
95 if (ret
>= 0) { /* found */
96 map_bh(bh_result
, inode
->i_sb
, blknum
);
98 bh_result
->b_size
= (ret
<< inode
->i_blkbits
);
101 /* data block was not found */
102 if (ret
== -ENOENT
&& create
) {
103 struct nilfs_transaction_info ti
;
105 bh_result
->b_blocknr
= 0;
106 err
= nilfs_transaction_begin(inode
->i_sb
, &ti
, 1);
109 err
= nilfs_bmap_insert(ii
->i_bmap
, blkoff
,
110 (unsigned long)bh_result
);
111 if (unlikely(err
!= 0)) {
112 if (err
== -EEXIST
) {
114 * The get_block() function could be called
115 * from multiple callers for an inode.
116 * However, the page having this block must
117 * be locked in this case.
120 "nilfs_get_block: a race condition "
121 "while inserting a data block. "
122 "(inode number=%lu, file block "
125 (unsigned long long)blkoff
);
128 nilfs_transaction_abort(inode
->i_sb
);
131 nilfs_mark_inode_dirty_sync(inode
);
132 nilfs_transaction_commit(inode
->i_sb
); /* never fails */
133 /* Error handling should be detailed */
134 set_buffer_new(bh_result
);
135 set_buffer_delay(bh_result
);
136 map_bh(bh_result
, inode
->i_sb
, 0); /* dbn must be changed
138 } else if (ret
== -ENOENT
) {
139 /* not found is not error (e.g. hole); must return without
140 the mapped state flag. */
151 * nilfs_readpage() - implement readpage() method of nilfs_aops {}
152 * address_space_operations.
153 * @file - file struct of the file to be read
154 * @page - the page to be read
156 static int nilfs_readpage(struct file
*file
, struct page
*page
)
158 return mpage_readpage(page
, nilfs_get_block
);
162 * nilfs_readpages() - implement readpages() method of nilfs_aops {}
163 * address_space_operations.
164 * @file - file struct of the file to be read
165 * @mapping - address_space struct used for reading multiple pages
166 * @pages - the pages to be read
167 * @nr_pages - number of pages to be read
169 static int nilfs_readpages(struct file
*file
, struct address_space
*mapping
,
170 struct list_head
*pages
, unsigned nr_pages
)
172 return mpage_readpages(mapping
, pages
, nr_pages
, nilfs_get_block
);
175 static int nilfs_writepages(struct address_space
*mapping
,
176 struct writeback_control
*wbc
)
178 struct inode
*inode
= mapping
->host
;
181 if (inode
->i_sb
->s_flags
& MS_RDONLY
) {
182 nilfs_clear_dirty_pages(mapping
, false);
186 if (wbc
->sync_mode
== WB_SYNC_ALL
)
187 err
= nilfs_construct_dsync_segment(inode
->i_sb
, inode
,
193 static int nilfs_writepage(struct page
*page
, struct writeback_control
*wbc
)
195 struct inode
*inode
= page
->mapping
->host
;
198 if (inode
->i_sb
->s_flags
& MS_RDONLY
) {
200 * It means that filesystem was remounted in read-only
201 * mode because of error or metadata corruption. But we
202 * have dirty pages that try to be flushed in background.
203 * So, here we simply discard this dirty page.
205 nilfs_clear_dirty_page(page
, false);
210 redirty_page_for_writepage(wbc
, page
);
213 if (wbc
->sync_mode
== WB_SYNC_ALL
) {
214 err
= nilfs_construct_segment(inode
->i_sb
);
217 } else if (wbc
->for_reclaim
)
218 nilfs_flush_segment(inode
->i_sb
, inode
->i_ino
);
223 static int nilfs_set_page_dirty(struct page
*page
)
225 struct inode
*inode
= page
->mapping
->host
;
226 int ret
= __set_page_dirty_nobuffers(page
);
228 if (page_has_buffers(page
)) {
229 unsigned nr_dirty
= 0;
230 struct buffer_head
*bh
, *head
;
233 * This page is locked by callers, and no other thread
234 * concurrently marks its buffers dirty since they are
235 * only dirtied through routines in fs/buffer.c in
236 * which call sites of mark_buffer_dirty are protected
239 bh
= head
= page_buffers(page
);
241 /* Do not mark hole blocks dirty */
242 if (buffer_dirty(bh
) || !buffer_mapped(bh
))
245 set_buffer_dirty(bh
);
247 } while (bh
= bh
->b_this_page
, bh
!= head
);
250 nilfs_set_file_dirty(inode
, nr_dirty
);
252 unsigned nr_dirty
= 1 << (PAGE_CACHE_SHIFT
- inode
->i_blkbits
);
254 nilfs_set_file_dirty(inode
, nr_dirty
);
259 void nilfs_write_failed(struct address_space
*mapping
, loff_t to
)
261 struct inode
*inode
= mapping
->host
;
263 if (to
> inode
->i_size
) {
264 truncate_pagecache(inode
, inode
->i_size
);
265 nilfs_truncate(inode
);
269 static int nilfs_write_begin(struct file
*file
, struct address_space
*mapping
,
270 loff_t pos
, unsigned len
, unsigned flags
,
271 struct page
**pagep
, void **fsdata
)
274 struct inode
*inode
= mapping
->host
;
275 int err
= nilfs_transaction_begin(inode
->i_sb
, NULL
, 1);
280 err
= block_write_begin(mapping
, pos
, len
, flags
, pagep
,
283 nilfs_write_failed(mapping
, pos
+ len
);
284 nilfs_transaction_abort(inode
->i_sb
);
289 static int nilfs_write_end(struct file
*file
, struct address_space
*mapping
,
290 loff_t pos
, unsigned len
, unsigned copied
,
291 struct page
*page
, void *fsdata
)
293 struct inode
*inode
= mapping
->host
;
294 unsigned start
= pos
& (PAGE_CACHE_SIZE
- 1);
298 nr_dirty
= nilfs_page_count_clean_buffers(page
, start
,
300 copied
= generic_write_end(file
, mapping
, pos
, len
, copied
, page
,
302 nilfs_set_file_dirty(inode
, nr_dirty
);
303 err
= nilfs_transaction_commit(inode
->i_sb
);
304 return err
? : copied
;
308 nilfs_direct_IO(struct kiocb
*iocb
, struct iov_iter
*iter
, loff_t offset
)
310 struct inode
*inode
= file_inode(iocb
->ki_filp
);
312 if (iov_iter_rw(iter
) == WRITE
)
315 /* Needs synchronization with the cleaner */
316 return blockdev_direct_IO(iocb
, inode
, iter
, offset
, nilfs_get_block
);
319 const struct address_space_operations nilfs_aops
= {
320 .writepage
= nilfs_writepage
,
321 .readpage
= nilfs_readpage
,
322 .writepages
= nilfs_writepages
,
323 .set_page_dirty
= nilfs_set_page_dirty
,
324 .readpages
= nilfs_readpages
,
325 .write_begin
= nilfs_write_begin
,
326 .write_end
= nilfs_write_end
,
327 /* .releasepage = nilfs_releasepage, */
328 .invalidatepage
= block_invalidatepage
,
329 .direct_IO
= nilfs_direct_IO
,
330 .is_partially_uptodate
= block_is_partially_uptodate
,
333 static int nilfs_insert_inode_locked(struct inode
*inode
,
334 struct nilfs_root
*root
,
337 struct nilfs_iget_args args
= {
338 .ino
= ino
, .root
= root
, .cno
= 0, .for_gc
= 0
341 return insert_inode_locked4(inode
, ino
, nilfs_iget_test
, &args
);
344 struct inode
*nilfs_new_inode(struct inode
*dir
, umode_t mode
)
346 struct super_block
*sb
= dir
->i_sb
;
347 struct the_nilfs
*nilfs
= sb
->s_fs_info
;
349 struct nilfs_inode_info
*ii
;
350 struct nilfs_root
*root
;
354 inode
= new_inode(sb
);
355 if (unlikely(!inode
))
358 mapping_set_gfp_mask(inode
->i_mapping
,
359 mapping_gfp_constraint(inode
->i_mapping
, ~__GFP_FS
));
361 root
= NILFS_I(dir
)->i_root
;
363 ii
->i_state
= 1 << NILFS_I_NEW
;
366 err
= nilfs_ifile_create_inode(root
->ifile
, &ino
, &ii
->i_bh
);
368 goto failed_ifile_create_inode
;
369 /* reference count of i_bh inherits from nilfs_mdt_read_block() */
371 atomic64_inc(&root
->inodes_count
);
372 inode_init_owner(inode
, dir
, mode
);
374 inode
->i_mtime
= inode
->i_atime
= inode
->i_ctime
= CURRENT_TIME
;
376 if (S_ISREG(mode
) || S_ISDIR(mode
) || S_ISLNK(mode
)) {
377 err
= nilfs_bmap_read(ii
->i_bmap
, NULL
);
379 goto failed_after_creation
;
381 set_bit(NILFS_I_BMAP
, &ii
->i_state
);
382 /* No lock is needed; iget() ensures it. */
385 ii
->i_flags
= nilfs_mask_flags(
386 mode
, NILFS_I(dir
)->i_flags
& NILFS_FL_INHERITED
);
388 /* ii->i_file_acl = 0; */
389 /* ii->i_dir_acl = 0; */
390 ii
->i_dir_start_lookup
= 0;
391 nilfs_set_inode_flags(inode
);
392 spin_lock(&nilfs
->ns_next_gen_lock
);
393 inode
->i_generation
= nilfs
->ns_next_generation
++;
394 spin_unlock(&nilfs
->ns_next_gen_lock
);
395 if (nilfs_insert_inode_locked(inode
, root
, ino
) < 0) {
397 goto failed_after_creation
;
400 err
= nilfs_init_acl(inode
, dir
);
402 goto failed_after_creation
; /* never occur. When supporting
403 nilfs_init_acl(), proper cancellation of
404 above jobs should be considered */
408 failed_after_creation
:
410 unlock_new_inode(inode
);
411 iput(inode
); /* raw_inode will be deleted through
412 nilfs_evict_inode() */
415 failed_ifile_create_inode
:
416 make_bad_inode(inode
);
417 iput(inode
); /* if i_nlink == 1, generic_forget_inode() will be
423 void nilfs_set_inode_flags(struct inode
*inode
)
425 unsigned int flags
= NILFS_I(inode
)->i_flags
;
426 unsigned int new_fl
= 0;
428 if (flags
& FS_SYNC_FL
)
430 if (flags
& FS_APPEND_FL
)
432 if (flags
& FS_IMMUTABLE_FL
)
433 new_fl
|= S_IMMUTABLE
;
434 if (flags
& FS_NOATIME_FL
)
436 if (flags
& FS_DIRSYNC_FL
)
438 inode_set_flags(inode
, new_fl
, S_SYNC
| S_APPEND
| S_IMMUTABLE
|
439 S_NOATIME
| S_DIRSYNC
);
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)
460 return -ESTALE
; /* 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_nohighmem(inode
);
514 inode
->i_mapping
->a_ops
= &nilfs_aops
;
516 inode
->i_op
= &nilfs_special_inode_operations
;
518 inode
, inode
->i_mode
,
519 huge_decode_dev(le64_to_cpu(raw_inode
->i_device_code
)));
521 nilfs_ifile_unmap_inode(root
->ifile
, ino
, bh
);
523 up_read(&NILFS_MDT(nilfs
->ns_dat
)->mi_sem
);
524 nilfs_set_inode_flags(inode
);
525 mapping_set_gfp_mask(inode
->i_mapping
,
526 mapping_gfp_constraint(inode
->i_mapping
, ~__GFP_FS
));
530 nilfs_ifile_unmap_inode(root
->ifile
, ino
, bh
);
534 up_read(&NILFS_MDT(nilfs
->ns_dat
)->mi_sem
);
538 static int nilfs_iget_test(struct inode
*inode
, void *opaque
)
540 struct nilfs_iget_args
*args
= opaque
;
541 struct nilfs_inode_info
*ii
;
543 if (args
->ino
!= inode
->i_ino
|| args
->root
!= NILFS_I(inode
)->i_root
)
547 if (!test_bit(NILFS_I_GCINODE
, &ii
->i_state
))
548 return !args
->for_gc
;
550 return args
->for_gc
&& args
->cno
== ii
->i_cno
;
553 static int nilfs_iget_set(struct inode
*inode
, void *opaque
)
555 struct nilfs_iget_args
*args
= opaque
;
557 inode
->i_ino
= args
->ino
;
559 NILFS_I(inode
)->i_state
= 1 << NILFS_I_GCINODE
;
560 NILFS_I(inode
)->i_cno
= args
->cno
;
561 NILFS_I(inode
)->i_root
= NULL
;
563 if (args
->root
&& args
->ino
== NILFS_ROOT_INO
)
564 nilfs_get_root(args
->root
);
565 NILFS_I(inode
)->i_root
= args
->root
;
570 struct inode
*nilfs_ilookup(struct super_block
*sb
, struct nilfs_root
*root
,
573 struct nilfs_iget_args args
= {
574 .ino
= ino
, .root
= root
, .cno
= 0, .for_gc
= 0
577 return ilookup5(sb
, ino
, nilfs_iget_test
, &args
);
580 struct inode
*nilfs_iget_locked(struct super_block
*sb
, struct nilfs_root
*root
,
583 struct nilfs_iget_args args
= {
584 .ino
= ino
, .root
= root
, .cno
= 0, .for_gc
= 0
587 return iget5_locked(sb
, ino
, nilfs_iget_test
, nilfs_iget_set
, &args
);
590 struct inode
*nilfs_iget(struct super_block
*sb
, struct nilfs_root
*root
,
596 inode
= nilfs_iget_locked(sb
, root
, ino
);
597 if (unlikely(!inode
))
598 return ERR_PTR(-ENOMEM
);
599 if (!(inode
->i_state
& I_NEW
))
602 err
= __nilfs_read_inode(sb
, root
, ino
, inode
);
607 unlock_new_inode(inode
);
611 struct inode
*nilfs_iget_for_gc(struct super_block
*sb
, unsigned long ino
,
614 struct nilfs_iget_args args
= {
615 .ino
= ino
, .root
= NULL
, .cno
= cno
, .for_gc
= 1
620 inode
= iget5_locked(sb
, ino
, nilfs_iget_test
, nilfs_iget_set
, &args
);
621 if (unlikely(!inode
))
622 return ERR_PTR(-ENOMEM
);
623 if (!(inode
->i_state
& I_NEW
))
626 err
= nilfs_init_gcinode(inode
);
631 unlock_new_inode(inode
);
635 void nilfs_write_inode_common(struct inode
*inode
,
636 struct nilfs_inode
*raw_inode
, int has_bmap
)
638 struct nilfs_inode_info
*ii
= NILFS_I(inode
);
640 raw_inode
->i_mode
= cpu_to_le16(inode
->i_mode
);
641 raw_inode
->i_uid
= cpu_to_le32(i_uid_read(inode
));
642 raw_inode
->i_gid
= cpu_to_le32(i_gid_read(inode
));
643 raw_inode
->i_links_count
= cpu_to_le16(inode
->i_nlink
);
644 raw_inode
->i_size
= cpu_to_le64(inode
->i_size
);
645 raw_inode
->i_ctime
= cpu_to_le64(inode
->i_ctime
.tv_sec
);
646 raw_inode
->i_mtime
= cpu_to_le64(inode
->i_mtime
.tv_sec
);
647 raw_inode
->i_ctime_nsec
= cpu_to_le32(inode
->i_ctime
.tv_nsec
);
648 raw_inode
->i_mtime_nsec
= cpu_to_le32(inode
->i_mtime
.tv_nsec
);
649 raw_inode
->i_blocks
= cpu_to_le64(inode
->i_blocks
);
651 raw_inode
->i_flags
= cpu_to_le32(ii
->i_flags
);
652 raw_inode
->i_generation
= cpu_to_le32(inode
->i_generation
);
654 if (NILFS_ROOT_METADATA_FILE(inode
->i_ino
)) {
655 struct the_nilfs
*nilfs
= inode
->i_sb
->s_fs_info
;
657 /* zero-fill unused portion in the case of super root block */
658 raw_inode
->i_xattr
= 0;
659 raw_inode
->i_pad
= 0;
660 memset((void *)raw_inode
+ sizeof(*raw_inode
), 0,
661 nilfs
->ns_inode_size
- sizeof(*raw_inode
));
665 nilfs_bmap_write(ii
->i_bmap
, raw_inode
);
666 else if (S_ISCHR(inode
->i_mode
) || S_ISBLK(inode
->i_mode
))
667 raw_inode
->i_device_code
=
668 cpu_to_le64(huge_encode_dev(inode
->i_rdev
));
669 /* When extending inode, nilfs->ns_inode_size should be checked
670 for substitutions of appended fields */
673 void nilfs_update_inode(struct inode
*inode
, struct buffer_head
*ibh
, int flags
)
675 ino_t ino
= inode
->i_ino
;
676 struct nilfs_inode_info
*ii
= NILFS_I(inode
);
677 struct inode
*ifile
= ii
->i_root
->ifile
;
678 struct nilfs_inode
*raw_inode
;
680 raw_inode
= nilfs_ifile_map_inode(ifile
, ino
, ibh
);
682 if (test_and_clear_bit(NILFS_I_NEW
, &ii
->i_state
))
683 memset(raw_inode
, 0, NILFS_MDT(ifile
)->mi_entry_size
);
684 if (flags
& I_DIRTY_DATASYNC
)
685 set_bit(NILFS_I_INODE_SYNC
, &ii
->i_state
);
687 nilfs_write_inode_common(inode
, raw_inode
, 0);
688 /* XXX: call with has_bmap = 0 is a workaround to avoid
689 deadlock of bmap. This delays update of i_bmap to just
691 nilfs_ifile_unmap_inode(ifile
, ino
, ibh
);
694 #define NILFS_MAX_TRUNCATE_BLOCKS 16384 /* 64MB for 4KB block */
696 static void nilfs_truncate_bmap(struct nilfs_inode_info
*ii
,
702 if (!test_bit(NILFS_I_BMAP
, &ii
->i_state
))
705 ret
= nilfs_bmap_last_key(ii
->i_bmap
, &b
);
714 b
-= min_t(__u64
, NILFS_MAX_TRUNCATE_BLOCKS
, b
- from
);
715 ret
= nilfs_bmap_truncate(ii
->i_bmap
, b
);
716 nilfs_relax_pressure_in_lock(ii
->vfs_inode
.i_sb
);
717 if (!ret
|| (ret
== -ENOMEM
&&
718 nilfs_bmap_truncate(ii
->i_bmap
, b
) == 0))
722 nilfs_warning(ii
->vfs_inode
.i_sb
, __func__
,
723 "failed to truncate bmap (ino=%lu, err=%d)",
724 ii
->vfs_inode
.i_ino
, ret
);
727 void nilfs_truncate(struct inode
*inode
)
729 unsigned long blkoff
;
730 unsigned int blocksize
;
731 struct nilfs_transaction_info ti
;
732 struct super_block
*sb
= inode
->i_sb
;
733 struct nilfs_inode_info
*ii
= NILFS_I(inode
);
735 if (!test_bit(NILFS_I_BMAP
, &ii
->i_state
))
737 if (IS_APPEND(inode
) || IS_IMMUTABLE(inode
))
740 blocksize
= sb
->s_blocksize
;
741 blkoff
= (inode
->i_size
+ blocksize
- 1) >> sb
->s_blocksize_bits
;
742 nilfs_transaction_begin(sb
, &ti
, 0); /* never fails */
744 block_truncate_page(inode
->i_mapping
, inode
->i_size
, nilfs_get_block
);
746 nilfs_truncate_bmap(ii
, blkoff
);
748 inode
->i_mtime
= inode
->i_ctime
= CURRENT_TIME
;
750 nilfs_set_transaction_flag(NILFS_TI_SYNC
);
752 nilfs_mark_inode_dirty(inode
);
753 nilfs_set_file_dirty(inode
, 0);
754 nilfs_transaction_commit(sb
);
755 /* May construct a logical segment and may fail in sync mode.
756 But truncate has no return value. */
759 static void nilfs_clear_inode(struct inode
*inode
)
761 struct nilfs_inode_info
*ii
= NILFS_I(inode
);
762 struct nilfs_mdt_info
*mdi
= NILFS_MDT(inode
);
765 * Free resources allocated in nilfs_read_inode(), here.
767 BUG_ON(!list_empty(&ii
->i_dirty
));
771 if (mdi
&& mdi
->mi_palloc_cache
)
772 nilfs_palloc_destroy_cache(inode
);
774 if (test_bit(NILFS_I_BMAP
, &ii
->i_state
))
775 nilfs_bmap_clear(ii
->i_bmap
);
777 nilfs_btnode_cache_clear(&ii
->i_btnode_cache
);
779 if (ii
->i_root
&& inode
->i_ino
== NILFS_ROOT_INO
)
780 nilfs_put_root(ii
->i_root
);
783 void nilfs_evict_inode(struct inode
*inode
)
785 struct nilfs_transaction_info ti
;
786 struct super_block
*sb
= inode
->i_sb
;
787 struct nilfs_inode_info
*ii
= NILFS_I(inode
);
790 if (inode
->i_nlink
|| !ii
->i_root
|| unlikely(is_bad_inode(inode
))) {
791 truncate_inode_pages_final(&inode
->i_data
);
793 nilfs_clear_inode(inode
);
796 nilfs_transaction_begin(sb
, &ti
, 0); /* never fails */
798 truncate_inode_pages_final(&inode
->i_data
);
800 /* TODO: some of the following operations may fail. */
801 nilfs_truncate_bmap(ii
, 0);
802 nilfs_mark_inode_dirty(inode
);
805 ret
= nilfs_ifile_delete_inode(ii
->i_root
->ifile
, inode
->i_ino
);
807 atomic64_dec(&ii
->i_root
->inodes_count
);
809 nilfs_clear_inode(inode
);
812 nilfs_set_transaction_flag(NILFS_TI_SYNC
);
813 nilfs_transaction_commit(sb
);
814 /* May construct a logical segment and may fail in sync mode.
815 But delete_inode has no return value. */
818 int nilfs_setattr(struct dentry
*dentry
, struct iattr
*iattr
)
820 struct nilfs_transaction_info ti
;
821 struct inode
*inode
= d_inode(dentry
);
822 struct super_block
*sb
= inode
->i_sb
;
825 err
= inode_change_ok(inode
, iattr
);
829 err
= nilfs_transaction_begin(sb
, &ti
, 0);
833 if ((iattr
->ia_valid
& ATTR_SIZE
) &&
834 iattr
->ia_size
!= i_size_read(inode
)) {
835 inode_dio_wait(inode
);
836 truncate_setsize(inode
, iattr
->ia_size
);
837 nilfs_truncate(inode
);
840 setattr_copy(inode
, iattr
);
841 mark_inode_dirty(inode
);
843 if (iattr
->ia_valid
& ATTR_MODE
) {
844 err
= nilfs_acl_chmod(inode
);
849 return nilfs_transaction_commit(sb
);
852 nilfs_transaction_abort(sb
);
856 int nilfs_permission(struct inode
*inode
, int mask
)
858 struct nilfs_root
*root
= NILFS_I(inode
)->i_root
;
859 if ((mask
& MAY_WRITE
) && root
&&
860 root
->cno
!= NILFS_CPTREE_CURRENT_CNO
)
861 return -EROFS
; /* snapshot is not writable */
863 return generic_permission(inode
, mask
);
866 int nilfs_load_inode_block(struct inode
*inode
, struct buffer_head
**pbh
)
868 struct the_nilfs
*nilfs
= inode
->i_sb
->s_fs_info
;
869 struct nilfs_inode_info
*ii
= NILFS_I(inode
);
872 spin_lock(&nilfs
->ns_inode_lock
);
873 if (ii
->i_bh
== NULL
) {
874 spin_unlock(&nilfs
->ns_inode_lock
);
875 err
= nilfs_ifile_get_inode_block(ii
->i_root
->ifile
,
879 spin_lock(&nilfs
->ns_inode_lock
);
880 if (ii
->i_bh
== NULL
)
890 spin_unlock(&nilfs
->ns_inode_lock
);
894 int nilfs_inode_dirty(struct inode
*inode
)
896 struct nilfs_inode_info
*ii
= NILFS_I(inode
);
897 struct the_nilfs
*nilfs
= inode
->i_sb
->s_fs_info
;
900 if (!list_empty(&ii
->i_dirty
)) {
901 spin_lock(&nilfs
->ns_inode_lock
);
902 ret
= test_bit(NILFS_I_DIRTY
, &ii
->i_state
) ||
903 test_bit(NILFS_I_BUSY
, &ii
->i_state
);
904 spin_unlock(&nilfs
->ns_inode_lock
);
909 int nilfs_set_file_dirty(struct inode
*inode
, unsigned nr_dirty
)
911 struct nilfs_inode_info
*ii
= NILFS_I(inode
);
912 struct the_nilfs
*nilfs
= inode
->i_sb
->s_fs_info
;
914 atomic_add(nr_dirty
, &nilfs
->ns_ndirtyblks
);
916 if (test_and_set_bit(NILFS_I_DIRTY
, &ii
->i_state
))
919 spin_lock(&nilfs
->ns_inode_lock
);
920 if (!test_bit(NILFS_I_QUEUED
, &ii
->i_state
) &&
921 !test_bit(NILFS_I_BUSY
, &ii
->i_state
)) {
922 /* Because this routine may race with nilfs_dispose_list(),
923 we have to check NILFS_I_QUEUED here, too. */
924 if (list_empty(&ii
->i_dirty
) && igrab(inode
) == NULL
) {
925 /* This will happen when somebody is freeing
927 nilfs_warning(inode
->i_sb
, __func__
,
928 "cannot get inode (ino=%lu)\n",
930 spin_unlock(&nilfs
->ns_inode_lock
);
931 return -EINVAL
; /* NILFS_I_DIRTY may remain for
934 list_move_tail(&ii
->i_dirty
, &nilfs
->ns_dirty_files
);
935 set_bit(NILFS_I_QUEUED
, &ii
->i_state
);
937 spin_unlock(&nilfs
->ns_inode_lock
);
941 int __nilfs_mark_inode_dirty(struct inode
*inode
, int flags
)
943 struct buffer_head
*ibh
;
946 err
= nilfs_load_inode_block(inode
, &ibh
);
948 nilfs_warning(inode
->i_sb
, __func__
,
949 "failed to reget inode block.\n");
952 nilfs_update_inode(inode
, ibh
, flags
);
953 mark_buffer_dirty(ibh
);
954 nilfs_mdt_mark_dirty(NILFS_I(inode
)->i_root
->ifile
);
960 * nilfs_dirty_inode - reflect changes on given inode to an inode block.
961 * @inode: inode of the file to be registered.
963 * nilfs_dirty_inode() loads a inode block containing the specified
964 * @inode and copies data from a nilfs_inode to a corresponding inode
965 * entry in the inode block. This operation is excluded from the segment
966 * construction. This function can be called both as a single operation
967 * and as a part of indivisible file operations.
969 void nilfs_dirty_inode(struct inode
*inode
, int flags
)
971 struct nilfs_transaction_info ti
;
972 struct nilfs_mdt_info
*mdi
= NILFS_MDT(inode
);
974 if (is_bad_inode(inode
)) {
975 nilfs_warning(inode
->i_sb
, __func__
,
976 "tried to mark bad_inode dirty. ignored.\n");
981 nilfs_mdt_mark_dirty(inode
);
984 nilfs_transaction_begin(inode
->i_sb
, &ti
, 0);
985 __nilfs_mark_inode_dirty(inode
, flags
);
986 nilfs_transaction_commit(inode
->i_sb
); /* never fails */
989 int nilfs_fiemap(struct inode
*inode
, struct fiemap_extent_info
*fieinfo
,
990 __u64 start
, __u64 len
)
992 struct the_nilfs
*nilfs
= inode
->i_sb
->s_fs_info
;
993 __u64 logical
= 0, phys
= 0, size
= 0;
996 sector_t blkoff
, end_blkoff
;
997 sector_t delalloc_blkoff
;
998 unsigned long delalloc_blklen
;
999 unsigned int blkbits
= inode
->i_blkbits
;
1002 ret
= fiemap_check_flags(fieinfo
, FIEMAP_FLAG_SYNC
);
1006 mutex_lock(&inode
->i_mutex
);
1008 isize
= i_size_read(inode
);
1010 blkoff
= start
>> blkbits
;
1011 end_blkoff
= (start
+ len
- 1) >> blkbits
;
1013 delalloc_blklen
= nilfs_find_uncommitted_extent(inode
, blkoff
,
1018 unsigned int maxblocks
;
1020 if (delalloc_blklen
&& blkoff
== delalloc_blkoff
) {
1022 /* End of the current extent */
1023 ret
= fiemap_fill_next_extent(
1024 fieinfo
, logical
, phys
, size
, flags
);
1028 if (blkoff
> end_blkoff
)
1031 flags
= FIEMAP_EXTENT_MERGED
| FIEMAP_EXTENT_DELALLOC
;
1032 logical
= blkoff
<< blkbits
;
1034 size
= delalloc_blklen
<< blkbits
;
1036 blkoff
= delalloc_blkoff
+ delalloc_blklen
;
1037 delalloc_blklen
= nilfs_find_uncommitted_extent(
1038 inode
, blkoff
, &delalloc_blkoff
);
1043 * Limit the number of blocks that we look up so as
1044 * not to get into the next delayed allocation extent.
1046 maxblocks
= INT_MAX
;
1047 if (delalloc_blklen
)
1048 maxblocks
= min_t(sector_t
, delalloc_blkoff
- blkoff
,
1052 down_read(&NILFS_MDT(nilfs
->ns_dat
)->mi_sem
);
1053 n
= nilfs_bmap_lookup_contig(
1054 NILFS_I(inode
)->i_bmap
, blkoff
, &blkphy
, maxblocks
);
1055 up_read(&NILFS_MDT(nilfs
->ns_dat
)->mi_sem
);
1060 if (unlikely(n
!= -ENOENT
))
1065 past_eof
= ((blkoff
<< blkbits
) >= isize
);
1068 /* End of the current extent */
1071 flags
|= FIEMAP_EXTENT_LAST
;
1073 ret
= fiemap_fill_next_extent(
1074 fieinfo
, logical
, phys
, size
, flags
);
1079 if (blkoff
> end_blkoff
|| past_eof
)
1083 if (phys
&& blkphy
<< blkbits
== phys
+ size
) {
1084 /* The current extent goes on */
1085 size
+= n
<< blkbits
;
1087 /* Terminate the current extent */
1088 ret
= fiemap_fill_next_extent(
1089 fieinfo
, logical
, phys
, size
,
1091 if (ret
|| blkoff
> end_blkoff
)
1094 /* Start another extent */
1095 flags
= FIEMAP_EXTENT_MERGED
;
1096 logical
= blkoff
<< blkbits
;
1097 phys
= blkphy
<< blkbits
;
1098 size
= n
<< blkbits
;
1101 /* Start a new extent */
1102 flags
= FIEMAP_EXTENT_MERGED
;
1103 logical
= blkoff
<< blkbits
;
1104 phys
= blkphy
<< blkbits
;
1105 size
= n
<< blkbits
;
1112 /* If ret is 1 then we just hit the end of the extent array */
1116 mutex_unlock(&inode
->i_mutex
);