Linux kernel mirror (for testing) git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git
kernel os linux

textsearch: doc - fix spelling in lib/textsearch.c.

Found the following spelling errors while reading the textsearch code:
"facitilies" -> "facilities"
"continously" -> "continuously"
"arbitary" -> "arbitrary"
"patern" -> "pattern"
"occurences" -> "occurrences"

I'll try to push this patch through DaveM, given the only users
of textsearch is in the net/ tree (nf_conntrack_amanda.c, xt_string.c
and em_text.c)

Signed-off-by: Jesper Sander <sander.contrib@gmail.com>
Signed-off-by: Jesper Dangaard Brouer <hawk@comx.dk>
Signed-off-by: David S. Miller <davem@davemloft.net>

authored by

Jesper Dangaard Brouer and committed by
David S. Miller
de0368d5 986e3f6e

+5 -5
+5 -5
lib/textsearch.c
··· 13 13 * 14 14 * INTRODUCTION 15 15 * 16 - * The textsearch infrastructure provides text searching facitilies for 16 + * The textsearch infrastructure provides text searching facilities for 17 17 * both linear and non-linear data. Individual search algorithms are 18 18 * implemented in modules and chosen by the user. 19 19 * ··· 43 43 * to the algorithm to store persistent variables. 44 44 * (4) Core eventually resets the search offset and forwards the find() 45 45 * request to the algorithm. 46 - * (5) Algorithm calls get_next_block() provided by the user continously 46 + * (5) Algorithm calls get_next_block() provided by the user continuously 47 47 * to fetch the data to be searched in block by block. 48 48 * (6) Algorithm invokes finish() after the last call to get_next_block 49 49 * to clean up any leftovers from get_next_block. (Optional) ··· 58 58 * the pattern to look for and flags. As a flag, you can set TS_IGNORECASE 59 59 * to perform case insensitive matching. But it might slow down 60 60 * performance of algorithm, so you should use it at own your risk. 61 - * The returned configuration may then be used for an arbitary 61 + * The returned configuration may then be used for an arbitrary 62 62 * amount of times and even in parallel as long as a separate struct 63 63 * ts_state variable is provided to every instance. 64 64 * 65 65 * The actual search is performed by either calling textsearch_find_- 66 66 * continuous() for linear data or by providing an own get_next_block() 67 67 * implementation and calling textsearch_find(). Both functions return 68 - * the position of the first occurrence of the patern or UINT_MAX if 69 - * no match was found. Subsequent occurences can be found by calling 68 + * the position of the first occurrence of the pattern or UINT_MAX if 69 + * no match was found. Subsequent occurrences can be found by calling 70 70 * textsearch_next() regardless of the linearity of the data. 71 71 * 72 72 * Once you're done using a configuration it must be given back via