Commit de0368d5 authored by Jesper Dangaard Brouer's avatar Jesper Dangaard Brouer Committed by David S. Miller
Browse files

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: default avatarJesper Sander <sander.contrib@gmail.com>
Signed-off-by: default avatarJesper Dangaard Brouer <hawk@comx.dk>
Signed-off-by: default avatarDavid S. Miller <davem@davemloft.net>
parent 986e3f6e

lib/textsearch.c

+5 −5
Original line number Diff line number Diff line
@@ -13,7 +13,7 @@ 
 *

 * INTRODUCTION

 *

 *   The textsearch infrastructure provides text searching facitilies for

 *   The textsearch infrastructure provides text searching facilities for

 *   both linear and non-linear data. Individual search algorithms are

 *   implemented in modules and chosen by the user.

 *
@@ -43,7 +43,7 @@ 
 *       to the algorithm to store persistent variables.

 *   (4) Core eventually resets the search offset and forwards the find()

 *       request to the algorithm.

 *   (5) Algorithm calls get_next_block() provided by the user continously

 *   (5) Algorithm calls get_next_block() provided by the user continuously

 *       to fetch the data to be searched in block by block.

 *   (6) Algorithm invokes finish() after the last call to get_next_block

 *       to clean up any leftovers from get_next_block. (Optional)
@@ -58,15 +58,15 @@ 
 *   the pattern to look for and flags. As a flag, you can set TS_IGNORECASE

 *   to perform case insensitive matching. But it might slow down

 *   performance of algorithm, so you should use it at own your risk.

 *   The returned configuration may then be used for an arbitary

 *   The returned configuration may then be used for an arbitrary

 *   amount of times and even in parallel as long as a separate struct

 *   ts_state variable is provided to every instance.

 *

 *   The actual search is performed by either calling textsearch_find_-

 *   continuous() for linear data or by providing an own get_next_block()

 *   implementation and calling textsearch_find(). Both functions return

 *   the position of the first occurrence of the patern or UINT_MAX if

 *   no match was found. Subsequent occurences can be found by calling

 *   the position of the first occurrence of the pattern or UINT_MAX if

 *   no match was found. Subsequent occurrences can be found by calling

 *   textsearch_next() regardless of the linearity of the data.

 *

 *   Once you're done using a configuration it must be given back via

CRA Git | Maintained and supported by SUSTech CRA and CCSE