]> git.proxmox.com Git - mirror_ubuntu-focal-kernel.git/commitdiff
btrfs: delete duplicated words + other fixes in comments
authorRandy Dunlap <rdunlap@infradead.org>
Wed, 5 Aug 2020 02:48:34 +0000 (19:48 -0700)
committerKleber Sacilotto de Souza <kleber.souza@canonical.com>
Mon, 20 Sep 2021 16:49:53 +0000 (18:49 +0200)
BugLink: https://bugs.launchpad.net/bugs/1941796
[ Upstream commit 260db43cd2f556677f6ae818ba09f997eed81004 ]

Delete repeated words in fs/btrfs/.
{to, the, a, and old}
and change "into 2 part" to "into 2 parts".

Reviewed-by: Nikolay Borisov <nborisov@suse.com>
Signed-off-by: Randy Dunlap <rdunlap@infradead.org>
Reviewed-by: David Sterba <dsterba@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
Signed-off-by: Sasha Levin <sashal@kernel.org>
Signed-off-by: Kamal Mostafa <kamal@canonical.com>
Signed-off-by: Kelsey Skunberg <kelsey.skunberg@canonical.com>
fs/btrfs/block-group.c
fs/btrfs/ctree.c
fs/btrfs/disk-io.c
fs/btrfs/extent_io.c
fs/btrfs/free-space-cache.c
fs/btrfs/qgroup.c
fs/btrfs/tree-log.c

index a352c1704042d1222461e187b38011832a120416..e98d6ea35ea802b40b0e6f4e5ab99343fa55fae5 100644 (file)
@@ -2637,7 +2637,7 @@ int btrfs_write_dirty_block_groups(struct btrfs_trans_handle *trans)
                         * finished yet (no block group item in the extent tree
                         * yet, etc). If this is the case, wait for all free
                         * space endio workers to finish and retry. This is a
-                        * very rare case so no need for a more efficient and
+                        * very rare case so no need for a more efficient and
                         * complex approach.
                         */
                        if (ret == -ENOENT) {
index af1a3f9b5bd537cebfbee9ba1b6457b28e9ac419..ef0d94ae8a6012ed6b9d88a3f6e2e7f634532a78 100644 (file)
@@ -5306,7 +5306,7 @@ again:
                        slot--;
                /*
                 * check this node pointer against the min_trans parameters.
-                * If it is too old, old, skip to the next one.
+                * If it is too old, skip to the next one.
                 */
                while (slot < nritems) {
                        u64 gen;
index e6aa94a583e925b6820828898e68d1e38d9c4d2f..1d28333bb798cdb173803574f20120eb71a6e3e3 100644 (file)
@@ -2816,7 +2816,7 @@ int open_ctree(struct super_block *sb,
        }
 
        /*
-        * Verify the type first, if that or the the checksum value are
+        * Verify the type first, if that or the checksum value are
         * corrupted, we'll find out
         */
        csum_type = btrfs_super_csum_type((struct btrfs_super_block *)bh->b_data);
index f77a18747ca1dff0e802a6e636996de9d264c3b1..b27c396a2cc9a5a19dfdc1ecc0c4b376f02749ca 100644 (file)
@@ -3152,7 +3152,7 @@ static int __do_readpage(struct extent_io_tree *tree,
 
                /*
                 * If we have a file range that points to a compressed extent
-                * and it's followed by a consecutive file range that points to
+                * and it's followed by a consecutive file range that points
                 * to the same compressed extent (possibly with a different
                 * offset and/or length, so it either points to the whole extent
                 * or only part of it), we must make sure we do not submit a
index 23f59d463e24e38bdbfd416f39afaabf2e5cbc66..d2d32fed8f2e955b1af11943487c3ee6fa14a236 100644 (file)
@@ -1339,7 +1339,7 @@ static int __btrfs_write_out_cache(struct btrfs_root *root, struct inode *inode,
 
        /*
         * at this point the pages are under IO and we're happy,
-        * The caller is responsible for waiting on them and updating the
+        * The caller is responsible for waiting on them and updating
         * the cache and the inode
         */
        io_ctl->entries = entries;
index cd8e81c02f63f445372f1c81ce512284bbc12a96..837bd5e29c8a0ad527728f7071b475567a86d110 100644 (file)
@@ -2262,7 +2262,7 @@ static int qgroup_update_refcnt(struct btrfs_fs_info *fs_info,
  * Update qgroup rfer/excl counters.
  * Rfer update is easy, codes can explain themselves.
  *
- * Excl update is tricky, the update is split into 2 part.
+ * Excl update is tricky, the update is split into 2 parts.
  * Part 1: Possible exclusive <-> sharing detect:
  *     |       A       |       !A      |
  *  -------------------------------------
index afc6731bb692c5c2b9adaf46cb89d8c18197b118..dcbdd0ebea839147812a3067839690eeb15eb721 100644 (file)
@@ -4923,7 +4923,7 @@ static int log_conflicting_inodes(struct btrfs_trans_handle *trans,
                 * Check the inode's logged_trans only instead of
                 * btrfs_inode_in_log(). This is because the last_log_commit of
                 * the inode is not updated when we only log that it exists and
-                * and it has the full sync bit set (see btrfs_log_inode()).
+                * it has the full sync bit set (see btrfs_log_inode()).
                 */
                if (BTRFS_I(inode)->logged_trans == trans->transid) {
                        spin_unlock(&BTRFS_I(inode)->lock);
@@ -6426,7 +6426,7 @@ void btrfs_record_snapshot_destroy(struct btrfs_trans_handle *trans,
  *            committed by the caller, and BTRFS_DONT_NEED_TRANS_COMMIT
  *            otherwise.
  * When false: returns BTRFS_DONT_NEED_LOG_SYNC if the caller does not need to
- *             to sync the log, BTRFS_NEED_LOG_SYNC if it needs to sync the log,
+ *             sync the log, BTRFS_NEED_LOG_SYNC if it needs to sync the log,
  *             or BTRFS_NEED_TRANS_COMMIT if the transaction needs to be
  *             committed (without attempting to sync the log).
  */