On 3/17/21 12:30 PM, Bhaskar Chowdhury wrote:
>
> s/condidate/candidate/
> s/folowing/following/
>
> Signed-off-by: Bhaskar Chowdhury <unixbhas...@gmail.com>
I will add it in my for-next queue.
Thanks.
Coly Li
> ---
> drivers/md/bcache/journal.c | 4 ++--
> 1 file changed, 2 insertions(+), 2 deletions(-)
>
> diff --git a/drivers/md/bcache/journal.c b/drivers/md/bcache/journal.c
> index c6613e817333..9f2eb8dec803 100644
> --- a/drivers/md/bcache/journal.c
> +++ b/drivers/md/bcache/journal.c
> @@ -111,7 +111,7 @@ reread: left = ca->sb.bucket_size - offset;
> * Check from the oldest jset for last_seq. If
> * i->j.seq < j->last_seq, it means the oldest jset
> * in list is expired and useless, remove it from
> - * this list. Otherwise, j is a condidate jset for
> + * this list. Otherwise, j is a candidate jset for
> * further following checks.
> */
> while (!list_empty(list)) {
> @@ -498,7 +498,7 @@ static void btree_flush_write(struct cache_set *c)
> * - If there are matched nodes recorded in btree_nodes[],
> * they are clean now (this is why and how the oldest
> * journal entry can be reclaimed). These selected nodes
> - * will be ignored and skipped in the folowing for-loop.
> + * will be ignored and skipped in the following for-loop.
> */
> if (((btree_current_write(b)->journal - fifo_front_p) &
> mask) != 0) {
> --
> 2.30.2
>
