linux-kernel - Re: [PATCH -next] bcache: Fix spelling mistakes

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives
Hash Suite: Windows password security audit tool. GUI, reports in PDF.
[<prev] [next>] [<thread-prev] [day] [month] [year] [list]
Message-ID: <CAHykVA5k8H-=1NE+07iETD5rGZZFK0RaSXuvjgwwNPrW8ea4Jg@mail.gmail.com>
Date:   Wed, 20 Jul 2022 14:44:45 +0200
From:   Andrea Tomassetti <andrea.tomassetti-opensource@...o.com>
To:     williamsukatube@....com
Cc:     colyli@...e.de, kent.overstreet@...il.com,
        linux-bcache@...r.kernel.org, linux-kernel@...r.kernel.org,
        William Dean <williamsukatube@...il.com>,
        Hacash Robot <hacashRobot@...tino.com>
Subject: Re: [PATCH -next] bcache: Fix spelling mistakes

On Wed, Jul 20, 2022 at 2:17 PM <williamsukatube@....com> wrote:
>
> From: William Dean <williamsukatube@...il.com>
>
> Fix follow spelling misktakes:
>         automatical  ==> automatic
>         arount ==> around
>         individial  ==> around
Shouldn't be individial ==> individual instead of around ?

Andrea
>         embeddded  ==> embedded
>         addionally  ==> additionally
>         unncessary  ==> unnecessary
>         definitly  ==> definitely
>
> Reported-by: Hacash Robot <hacashRobot@...tino.com>
> Signed-off-by: William Dean <williamsukatube@...il.com>
> ---
>  drivers/md/bcache/bcache.h    | 2 +-
>  drivers/md/bcache/bset.h      | 2 +-
>  drivers/md/bcache/btree.c     | 2 +-
>  drivers/md/bcache/btree.h     | 2 +-
>  drivers/md/bcache/stats.c     | 2 +-
>  drivers/md/bcache/writeback.c | 2 +-
>  drivers/md/bcache/writeback.h | 2 +-
>  7 files changed, 7 insertions(+), 7 deletions(-)
>
> diff --git a/drivers/md/bcache/bcache.h b/drivers/md/bcache/bcache.h
> index 2acda9cea0f9..2b35c0a14d4d 100644
> --- a/drivers/md/bcache/bcache.h
> +++ b/drivers/md/bcache/bcache.h
> @@ -635,7 +635,7 @@ struct cache_set {
>         struct bkey             gc_done;
>
>         /*
> -        * For automatical garbage collection after writeback completed, this
> +        * For automatic garbage collection after writeback completed, this
>          * varialbe is used as bit fields,
>          * - 0000 0001b (BCH_ENABLE_AUTO_GC): enable gc after writeback
>          * - 0000 0010b (BCH_DO_AUTO_GC):     do gc after writeback
> diff --git a/drivers/md/bcache/bset.h b/drivers/md/bcache/bset.h
> index d795c84246b0..76f75bbcb731 100644
> --- a/drivers/md/bcache/bset.h
> +++ b/drivers/md/bcache/bset.h
> @@ -45,7 +45,7 @@
>   * 4 in memory - we lazily resort as needed.
>   *
>   * We implement code here for creating and maintaining auxiliary search trees
> - * (described below) for searching an individial bset, and on top of that we
> + * (described below) for searching an individual bset, and on top of that we
>   * implement a btree iterator.
>   *
>   * BTREE ITERATOR:
> diff --git a/drivers/md/bcache/btree.c b/drivers/md/bcache/btree.c
> index e136d6edc1ed..a26863eedc6f 100644
> --- a/drivers/md/bcache/btree.c
> +++ b/drivers/md/bcache/btree.c
> @@ -154,7 +154,7 @@ void bch_btree_node_read_done(struct btree *b)
>         /*
>          * c->fill_iter can allocate an iterator with more memory space
>          * than static MAX_BSETS.
> -        * See the comment arount cache_set->fill_iter.
> +        * See the comment around cache_set->fill_iter.
>          */
>         iter = mempool_alloc(&b->c->fill_iter, GFP_NOIO);
>         iter->size = b->c->cache->sb.bucket_size / b->c->cache->sb.block_size;
> diff --git a/drivers/md/bcache/btree.h b/drivers/md/bcache/btree.h
> index 1b5fdbc0d83e..b46bf6268aca 100644
> --- a/drivers/md/bcache/btree.h
> +++ b/drivers/md/bcache/btree.h
> @@ -54,7 +54,7 @@
>   * Btree nodes never have to be explicitly read in; bch_btree_node_get() handles
>   * this.
>   *
> - * For writing, we have two btree_write structs embeddded in struct btree - one
> + * For writing, we have two btree_write structs embedded in struct btree - one
>   * write in flight, and one being set up, and we toggle between them.
>   *
>   * Writing is done with a single function -  bch_btree_write() really serves two
> diff --git a/drivers/md/bcache/stats.c b/drivers/md/bcache/stats.c
> index 68b02216033d..dcd87eb6f85e 100644
> --- a/drivers/md/bcache/stats.c
> +++ b/drivers/md/bcache/stats.c
> @@ -11,7 +11,7 @@
>  #include "sysfs.h"
>
>  /*
> - * We keep absolute totals of various statistics, and addionally a set of three
> + * We keep absolute totals of various statistics, and additionally a set of three
>   * rolling averages.
>   *
>   * Every so often, a timer goes off and rescales the rolling averages.
> diff --git a/drivers/md/bcache/writeback.c b/drivers/md/bcache/writeback.c
> index 3f0ff3aab6f2..bd83a33b8a2f 100644
> --- a/drivers/md/bcache/writeback.c
> +++ b/drivers/md/bcache/writeback.c
> @@ -238,7 +238,7 @@ static void update_writeback_rate(struct work_struct *work)
>         /*
>          * If the whole cache set is idle, set_at_max_writeback_rate()
>          * will set writeback rate to a max number. Then it is
> -        * unncessary to update writeback rate for an idle cache set
> +        * unnecessary to update writeback rate for an idle cache set
>          * in maximum writeback rate number(s).
>          */
>         if (atomic_read(&dc->has_dirty) && dc->writeback_percent &&
> diff --git a/drivers/md/bcache/writeback.h b/drivers/md/bcache/writeback.h
> index 31df716951f6..37f66bea522f 100644
> --- a/drivers/md/bcache/writeback.h
> +++ b/drivers/md/bcache/writeback.h
> @@ -69,7 +69,7 @@ static inline int offset_to_stripe(struct bcache_device *d,
>         }
>
>         /*
> -        * Here offset is definitly smaller than INT_MAX,
> +        * Here offset is definitely smaller than INT_MAX,
>          * return it as int will never overflow.
>          */
>         return offset;
> --
> 2.25.1
>