summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorRandy Dunlap <rdunlap@infradead.org>2017-10-20 22:15:52 +0300
committerDavid S. Miller <davem@davemloft.net>2017-10-22 05:14:07 +0300
commit7433a8d6fa60a2f6910206fa10f3550c8f11f45f (patch)
tree3ed21670e454e2a7b11f0e221e204a9232ebe469
parent6cb3ece9685f78f9b288dd2afea58c35784e40b8 (diff)
downloadlinux-7433a8d6fa60a2f6910206fa10f3550c8f11f45f.tar.xz
textsearch: fix typos in library helpers
Fix spellos (typos) in textsearch library helpers. Signed-off-by: Randy Dunlap <rdunlap@infradead.org> Signed-off-by: David S. Miller <davem@davemloft.net>
-rw-r--r--lib/ts_fsm.c2
-rw-r--r--lib/ts_kmp.c2
2 files changed, 2 insertions, 2 deletions
diff --git a/lib/ts_fsm.c b/lib/ts_fsm.c
index 5696a35184e4..69557c74ef9f 100644
--- a/lib/ts_fsm.c
+++ b/lib/ts_fsm.c
@@ -11,7 +11,7 @@
* ==========================================================================
*
* A finite state machine consists of n states (struct ts_fsm_token)
- * representing the pattern as a finite automation. The data is read
+ * representing the pattern as a finite automaton. The data is read
* sequentially on an octet basis. Every state token specifies the number
* of recurrences and the type of value accepted which can be either a
* specific character or ctype based set of characters. The available
diff --git a/lib/ts_kmp.c b/lib/ts_kmp.c
index 632f783e65f1..ffbe66cbb0ed 100644
--- a/lib/ts_kmp.c
+++ b/lib/ts_kmp.c
@@ -27,7 +27,7 @@
*
* [1] Cormen, Leiserson, Rivest, Stein
* Introdcution to Algorithms, 2nd Edition, MIT Press
- * [2] See finite automation theory
+ * [2] See finite automaton theory
*/
#include <linux/module.h>