diff options
| author | Thomas Graf <tgraf@suug.ch> | 2005-06-24 05:59:16 +0200 |
|---|---|---|
| committer | David S. Miller <davem@davemloft.net> | 2005-06-24 05:59:16 +0200 |
| commit | 6408f79cce401e1bfecf923e7156f84f96e021e3 (patch) | |
| tree | 203624ffacf60d364293adc47d2f59f6ba81dd35 /lib/Makefile | |
| parent | [LIB]: Knuth-Morris-Pratt textsearch algorithm (diff) | |
| download | linux-6408f79cce401e1bfecf923e7156f84f96e021e3.tar.xz linux-6408f79cce401e1bfecf923e7156f84f96e021e3.zip | |
[LIB]: Naive finite state machine based textsearch
A finite state machine consists of n states (struct ts_fsm_token)
representing the pattern as a finite automation. The data is read
sequentially on a 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
type of recurrences include 1, (0|1), [0 n], and [1 n].
The algorithm differs between strict/non-strict mode specyfing
whether the pattern has to start at the first octect. Strict mode
is enabled by default and can be disabled by inserting
TS_FSM_HEAD_IGNORE as the first token in the chain.
The runtime performance of the algorithm should be around O(n),
however while in strict mode the average runtime can be better.
Signed-off-by: Thomas Graf <tgraf@suug.ch>
Signed-off-by: David S. Miller <davem@davemloft.net>
Diffstat (limited to 'lib/Makefile')
| -rw-r--r-- | lib/Makefile | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/lib/Makefile b/lib/Makefile index 6cdb10f312df..7f6eda449102 100644 --- a/lib/Makefile +++ b/lib/Makefile @@ -38,6 +38,7 @@ obj-$(CONFIG_REED_SOLOMON) += reed_solomon/ lib-$(CONFIG_TEXTSEARCH) += textsearch.o obj-$(CONFIG_TEXTSEARCH_KMP) += ts_kmp.o +obj-$(CONFIG_TEXTSEARCH_FSM) += ts_fsm.o hostprogs-y := gen_crc32table clean-files := crc32table.h |