path: root/lib/ts_fsm.c
AgeCommit message (Collapse)AuthorLines
2008-07-08textsearch: ts_fsm: return error on request for case insensitive searchJoonwoo Park-1/+5
For fsm text search, handle case insensitive parameter as -EINVAL. Signed-off-by: Joonwoo Park <> Signed-off-by: Patrick McHardy <> Signed-off-by: David S. Miller <>
2006-09-29[PATCH] lib/ts_fsm.c: constify structsAndreas Mohr-5/+5
Constify two structs. Correct some typos. Compile-tested and run-tested (module inserted) on 2.6.18-rc4-mm3. Signed-off-by: Andreas Mohr <> Signed-off-by: Andrew Morton <> Signed-off-by: Linus Torvalds <>
2006-06-30Remove obsolete #include <linux/config.h>Jörn Engel-1/+0
Signed-off-by: Jörn Engel <> Signed-off-by: Adrian Bunk <>
2005-10-08[PATCH] gfp flags annotations - part 1Al Viro-1/+1
- added typedef unsigned int __nocast gfp_t; - replaced __nocast uses for gfp flags with gfp_t - it gives exactly the same warnings as far as sparse is concerned, doesn't change generated code (from gcc point of view we replaced unsigned int with typedef) and documents what's going on far better. Signed-off-by: Al Viro <> Signed-off-by: Linus Torvalds <>
2005-10-04[TEXTSEARCH]: fix sparse gfp nocast warningsRandy Dunlap-1/+1
Fix nocast sparse warnings: include/linux/textsearch.h:165:57: warning: implicit cast to nocast type Signed-off-by: Randy Dunlap <> Signed-off-by: David S. Miller <>
2005-06-23[LIB]: Naive finite state machine based textsearchThomas Graf-0/+338
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 <> Signed-off-by: David S. Miller <>