kernel/lib/Kconfig, branch linux-2.6.20.y

[PATCH] uml problems with linux/io.h

2006-12-13T17:05:52Z

Remove useless includes of linux/io.h, don't even try to build iomap_copy on uml (it doesn't have readb() et.al., so...) Signed-off-by: Al Viro Acked-by: Jeff Dike Signed-off-by: Andrew Morton Signed-off-by: Linus Torvalds

[PATCH] crc32: replace bitreverse by bitrev32

2006-12-08T16:28:39Z

This patch replaces bitreverse() by bitrev32. The only users of bitreverse() are crc32 itself and via-velocity. Cc: Jeff Garzik Cc: Matt Domsch Signed-off-by: Akinobu Mita Signed-off-by: Andrew Morton Signed-off-by: Linus Torvalds

[PATCH] bit reverse library

2006-12-08T16:28:39Z

This patch provides two bit reverse functions and bit reverse table. - reverse the order of bits in a u32 value u8 bitrev8(u8 x); - reverse the order of bits in a u32 value u32 bitrev32(u32 x); - byte reverse table const u8 byte_rev_table[256]; Signed-off-by: Akinobu Mita Signed-off-by: Andrew Morton Signed-off-by: Linus Torvalds

[PATCH] syscall class hookup for all normal targets

2006-09-12T07:04:40Z

Take default arch/*/kernel/audit.c to lib/, have those with special needs (== biarch) define AUDIT_ARCH in their Kconfig. Signed-off-by: Al Viro

[PATCH] pi-futex: add plist implementation

2006-06-28T00:32:46Z

Add the priority-sorted list (plist) implementation. Signed-off-by: Ingo Molnar Signed-off-by: Thomas Gleixner Signed-off-by: Arjan van de Ven Signed-off-by: Andrew Morton Signed-off-by: Linus Torvalds

[PATCH] lib/crc16: added crc16 algorithm.

2005-09-08T21:41:27Z

Add the crc16 routines, as used by w1 devices. Signed-off-by: Ben Gardner Signed-off-by: Evgeniy Polyakov Signed-off-by: Greg Kroah-Hartman

[LIB]: Make TEXTSEARCH_BM plain tristate like the others

2005-08-29T23:11:11Z

And select it when the relevant modules are enabled. Signed-off-by: David S. Miller

[LIB]: Boyer-Moore extension for textsearch infrastructure strike #2

2005-08-29T23:11:06Z

Attached the implementation of the Boyer-Moore string search algorithm for the new textsearch infrastructure. I've added as well a note about the limitations that this approach presents, as Thomas has remarked. Signed-off-by: Pablo Neira Ayuso Signed-off-by: David S. Miller

[PKT_SCHED]: Make TEXTSEARCH* options only selected.

2005-06-25T00:39:03Z

Do not present these confusing new options to the user unless he picked some facility that makes use of it, such as NET_EMATCH_TEXT. Signed-off-by: David S. Miller

[LIB]: Naive finite state machine based textsearch

2005-06-24T03:59:16Z

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