md: bcache: Trivial typo fixes in the file journal.c

s/condidate/candidate/
s/folowing/following/

Signed-off-by: Bhaskar Chowdhury <unixbhaskar@gmail.com>
Signed-off-by: Coly Li <colyli@suse.de>
Link: https://lore.kernel.org/r/20210411134316.80274-6-colyli@suse.de
Signed-off-by: Jens Axboe <axboe@kernel.dk>

diff --git a/drivers/md/bcache/journal.c b/drivers/md/bcache/journal.c
index de2c0d7699cf54c505e45aea98470b49b9b0ac4e..61bd79babf7ae50b41e14f0fc2ac36e5baa645d1 100644 (file)
--- 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) {