author: ToastC <mrtoastcheng@gmail.com> 2021-05-06 18:03:31 -0700
committer: Linus Torvalds <torvalds@linux-foundation.org> 2021-05-06 19:24:12 -0700
commit: e89b6358052de202e53e47623f50b6d28182ccdf
parent: b8cf20277941f6954f12a8d5a54eb334c806a6a3
Commit Summary:
Diffstat:
1 file changed, 1 insertion, 1 deletion
diff --git a/lib/list_sort.c b/lib/list_sort.c
index a926d96ffd44..1e1e37762799 100644
--- a/lib/list_sort.c
+++ b/lib/list_sort.c
@@ -137,7 +137,7 @@ static void merge_final(void *priv, list_cmp_func_t cmp, struct list_head *head,
*
*
* The merging is controlled by "count", the number of elements in the
- * pending lists. This is beautiully simple code, but rather subtle.
+ * pending lists. This is beautifully simple code, but rather subtle.
*
* Each time we increment "count", we set one bit (bit k) and clear
* bits k-1 .. 0. Each time this happens (except the very first time