08 Jul, 2008

1 commit

• 43138833e   textsearch: ts_fsm: return error on request for case insensitive search ... Browse Code »

  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

  Joonwoo Park

  2008-07-08 17:38:27 +0800  

30 Sep, 2006

1 commit

• 1497b2749   [PATCH] lib/ts_fsm.c: constify structs ... Browse Code »

  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

  Andreas Mohr

  2006-09-30 00:18:23 +0800  

01 Jul, 2006

1 commit

• 6ab3d5624   Remove obsolete #include <linux/config.h> ... Browse Code »

  Signed-off-by: Jörn Engel
  Signed-off-by: Adrian Bunk

  Jörn Engel

  2006-07-01 01:25:36 +0800  

09 Oct, 2005

1 commit

• dd0fc66fb   [PATCH] gfp flags annotations - part 1 ... Browse Code »

  - 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

  Al Viro

  2005-10-09 06:00:57 +0800  

05 Oct, 2005

1 commit

• 3d2aef668   [TEXTSEARCH]: fix sparse gfp nocast warnings ... Browse Code »

  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

  Randy Dunlap

  2005-10-05 13:45:14 +0800  

24 Jun, 2005

1 commit

• 6408f79cc   [LIB]: Naive finite state machine based textsearch ... Browse Code »

  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

  Thomas Graf

  2005-06-24 11:59:16 +0800