6408f79cce
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> |
||
|---|---|---|
| .. | ||
| reed_solomon | ||
| zlib_deflate | ||
| zlib_inflate | ||
| bitmap.c | ||
| bust_spinlocks.c | ||
| cmdline.c | ||
| crc32.c | ||
| crc32defs.h | ||
| crc-ccitt.c | ||
| ctype.c | ||
| dec_and_lock.c | ||
| div64.c | ||
| dump_stack.c | ||
| errno.c | ||
| extable.c | ||
| find_next_bit.c | ||
| gen_crc32table.c | ||
| genalloc.c | ||
| halfmd4.c | ||
| idr.c | ||
| inflate.c | ||
| int_sqrt.c | ||
| iomap.c | ||
| Kconfig | ||
| Kconfig.debug | ||
| kernel_lock.c | ||
| klist.c | ||
| kobject_uevent.c | ||
| kobject.c | ||
| kref.c | ||
| libcrc32c.c | ||
| Makefile | ||
| parser.c | ||
| prio_tree.c | ||
| radix-tree.c | ||
| rbtree.c | ||
| rwsem-spinlock.c | ||
| rwsem.c | ||
| sha1.c | ||
| smp_processor_id.c | ||
| sort.c | ||
| string.c | ||
| textsearch.c | ||
| ts_fsm.c | ||
| ts_kmp.c | ||
| vsprintf.c | ||