]> git.baikalelectronics.ru Git - kernel.git/commitdiff
btrfs: remove uptodate parameter from btrfs_dec_test_first_ordered_pending
authorDavid Sterba <dsterba@suse.com>
Mon, 26 Jul 2021 12:15:10 +0000 (14:15 +0200)
committerDavid Sterba <dsterba@suse.com>
Mon, 23 Aug 2021 11:19:02 +0000 (13:19 +0200)
In commit 7b29bb91d830 ("btrfs: refactor how we finish ordered extent io
for endio functions") there was last caller not using 1 for the uptodate
parameter. Now there's only one, passing 1, so we can remove it and
simplify the code.

Reviewed-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
fs/btrfs/inode.c
fs/btrfs/ordered-data.c
fs/btrfs/ordered-data.h

index d41aa8e5d0cc0f734013217dbb3ef13641486aa0..83caf69295f77096bd394a333d6646c2943c8d55 100644 (file)
@@ -8554,7 +8554,7 @@ static void btrfs_invalidatepage(struct page *page, unsigned int offset,
                spin_unlock_irq(&inode->ordered_tree.lock);
 
                if (btrfs_dec_test_ordered_pending(inode, &ordered,
-                                       cur, range_end + 1 - cur, 1)) {
+                                                  cur, range_end + 1 - cur)) {
                        btrfs_finish_ordered_io(ordered);
                        /*
                         * The ordered extent has finished, now we're again
index 5c0f8481e25e0671469a5814eede82f11d96792e..edb65abf0393a98d17bb79c374c0c597589da61c 100644 (file)
@@ -446,7 +446,6 @@ void btrfs_mark_ordered_io_finished(struct btrfs_inode *inode,
  *              Will be also used to store the finished ordered extent.
  * @file_offset: File offset for the finished IO
  * @io_size:    Length of the finish IO range
- * @uptodate:   If the IO finishes without problem
  *
  * Return true if the ordered extent is finished in the range, and update
  * @cached.
@@ -457,7 +456,7 @@ void btrfs_mark_ordered_io_finished(struct btrfs_inode *inode,
  */
 bool btrfs_dec_test_ordered_pending(struct btrfs_inode *inode,
                                    struct btrfs_ordered_extent **cached,
-                                   u64 file_offset, u64 io_size, int uptodate)
+                                   u64 file_offset, u64 io_size)
 {
        struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree;
        struct rb_node *node;
@@ -486,8 +485,6 @@ have_entry:
                       entry->bytes_left, io_size);
 
        entry->bytes_left -= io_size;
-       if (!uptodate)
-               set_bit(BTRFS_ORDERED_IOERR, &entry->flags);
 
        if (entry->bytes_left == 0) {
                /*
index b2d88aba8420ccc835f30f2f650e760bacb016b7..4194e960ff6177a6b1053d519b411d9bdabcbeae 100644 (file)
@@ -177,7 +177,7 @@ void btrfs_mark_ordered_io_finished(struct btrfs_inode *inode,
                                bool uptodate);
 bool btrfs_dec_test_ordered_pending(struct btrfs_inode *inode,
                                    struct btrfs_ordered_extent **cached,
-                                   u64 file_offset, u64 io_size, int uptodate);
+                                   u64 file_offset, u64 io_size);
 int btrfs_add_ordered_extent(struct btrfs_inode *inode, u64 file_offset,
                             u64 disk_bytenr, u64 num_bytes, u64 disk_num_bytes,
                             int type);