2005-04-17 02:20:36 +04:00
#
# Library configuration
#
menu "Library routines"
2006-12-08 13:36:25 +03:00
config BITREVERSE
tristate
2008-04-25 15:12:53 +04:00
config GENERIC_FIND_FIRST_BIT
2008-10-16 09:01:38 +04:00
bool
2008-04-25 15:12:53 +04:00
config GENERIC_FIND_NEXT_BIT
2008-10-16 09:01:38 +04:00
bool
2008-04-25 15:12:53 +04:00
2009-01-01 02:42:19 +03:00
config GENERIC_FIND_LAST_BIT
bool
default y
2005-04-17 02:20:36 +04:00
config CRC_CCITT
tristate "CRC-CCITT functions"
help
This option is provided for the case where no in-kernel-tree
modules require CRC-CCITT functions, but a module built outside
the kernel tree does. Such modules that use library CRC-CCITT
functions require M here.
2005-08-17 15:17:26 +04:00
config CRC16
tristate "CRC16 functions"
help
This option is provided for the case where no in-kernel-tree
modules require CRC16 functions, but a module built outside
the kernel tree does. Such modules that use library CRC16
functions require M here.
2008-06-25 19:22:42 +04:00
config CRC_T10DIF
tristate "CRC calculation for the T10 Data Integrity Field"
help
This option is only needed if a module that's not in the
kernel tree needs to calculate CRC checks for use with the
SCSI data integrity subsystem.
2006-06-12 18:17:04 +04:00
config CRC_ITU_T
tristate "CRC ITU-T V.41 functions"
help
This option is provided for the case where no in-kernel-tree
modules require CRC ITU-T V.41 functions, but a module built outside
the kernel tree does. Such modules that use library CRC ITU-T V.41
functions require M here.
2005-04-17 02:20:36 +04:00
config CRC32
tristate "CRC32 functions"
default y
2006-12-08 13:36:25 +03:00
select BITREVERSE
2005-04-17 02:20:36 +04:00
help
This option is provided for the case where no in-kernel-tree
modules require CRC32 functions, but a module built outside the
kernel tree does. Such modules that use library CRC32 functions
require M here.
2007-07-17 15:04:03 +04:00
config CRC7
tristate "CRC7 functions"
help
This option is provided for the case where no in-kernel-tree
modules require CRC7 functions, but a module built outside
the kernel tree does. Such modules that use library CRC7
functions require M here.
2005-04-17 02:20:36 +04:00
config LIBCRC32C
tristate "CRC32c (Castagnoli, et al) Cyclic Redundancy-Check"
2008-11-13 17:05:13 +03:00
select CRYPTO
2008-11-07 10:11:47 +03:00
select CRYPTO_CRC32C
2005-04-17 02:20:36 +04:00
help
This option is provided for the case where no in-kernel-tree
modules require CRC32c functions, but a module built outside the
kernel tree does. Such modules that use library CRC32c functions
require M here. See Castagnoli93.
Module will be libcrc32c.
2006-09-12 11:04:40 +04:00
config AUDIT_GENERIC
bool
depends on AUDIT && !AUDIT_ARCH
default y
2005-04-17 02:20:36 +04:00
#
# compression support is select'ed if needed
#
config ZLIB_INFLATE
tristate
config ZLIB_DEFLATE
tristate
2007-07-11 04:22:24 +04:00
config LZO_COMPRESS
tristate
config LZO_DECOMPRESS
tristate
2005-06-22 04:15:02 +04:00
#
# Generic allocator support is selected if needed
#
config GENERIC_ALLOCATOR
boolean
2005-04-17 02:20:36 +04:00
#
# reed solomon support is select'ed if needed
#
config REED_SOLOMON
tristate
config REED_SOLOMON_ENC8
boolean
config REED_SOLOMON_DEC8
boolean
config REED_SOLOMON_ENC16
boolean
config REED_SOLOMON_DEC16
boolean
2005-06-25 04:39:03 +04:00
#
# Textsearch support is select'ed if needed
#
2005-06-24 07:49:30 +04:00
config TEXTSEARCH
2005-06-25 04:39:03 +04:00
boolean
2005-04-17 02:20:36 +04:00
[LIB]: Knuth-Morris-Pratt textsearch algorithm
Implements a linear-time string-matching algorithm due to Knuth,
Morris, and Pratt [1]. Their algorithm avoids the explicit
computation of the transition function DELTA altogether. Its
matching time is O(n), for n being length(text), using just an
auxiliary function PI[1..m], for m being length(pattern),
precomputed from the pattern in time O(m). The array PI allows
the transition function DELTA to be computed efficiently
"on the fly" as needed. Roughly speaking, for any state
"q" = 0,1,...,m and any character "a" in SIGMA, the value
PI["q"] contains the information that is independent of "a" and
is needed to compute DELTA("q", "a") [2]. Since the array PI
has only m entries, whereas DELTA has O(m|SIGMA|) entries, we
save a factor of |SIGMA| in the preprocessing time by computing
PI rather than DELTA.
[1] Cormen, Leiserson, Rivest, Stein
Introdcution to Algorithms, 2nd Edition, MIT Press
[2] See finite automation theory
Signed-off-by: Thomas Graf <tgraf@suug.ch>
Signed-off-by: David S. Miller <davem@davemloft.net>
2005-06-24 07:58:37 +04:00
config TEXTSEARCH_KMP
2005-06-25 04:39:03 +04:00
tristate
[LIB]: Knuth-Morris-Pratt textsearch algorithm
Implements a linear-time string-matching algorithm due to Knuth,
Morris, and Pratt [1]. Their algorithm avoids the explicit
computation of the transition function DELTA altogether. Its
matching time is O(n), for n being length(text), using just an
auxiliary function PI[1..m], for m being length(pattern),
precomputed from the pattern in time O(m). The array PI allows
the transition function DELTA to be computed efficiently
"on the fly" as needed. Roughly speaking, for any state
"q" = 0,1,...,m and any character "a" in SIGMA, the value
PI["q"] contains the information that is independent of "a" and
is needed to compute DELTA("q", "a") [2]. Since the array PI
has only m entries, whereas DELTA has O(m|SIGMA|) entries, we
save a factor of |SIGMA| in the preprocessing time by computing
PI rather than DELTA.
[1] Cormen, Leiserson, Rivest, Stein
Introdcution to Algorithms, 2nd Edition, MIT Press
[2] See finite automation theory
Signed-off-by: Thomas Graf <tgraf@suug.ch>
Signed-off-by: David S. Miller <davem@davemloft.net>
2005-06-24 07:58:37 +04:00
2005-08-26 03:12:22 +04:00
config TEXTSEARCH_BM
2005-08-26 03:23:11 +04:00
tristate
2005-08-26 03:12:22 +04:00
2005-06-24 07:59:16 +04:00
config TEXTSEARCH_FSM
2005-06-25 04:39:03 +04:00
tristate
2005-06-24 07:59:16 +04:00
2006-06-27 13:54:51 +04:00
#
# plist support is select#ed if needed
#
config PLIST
boolean
2007-02-11 18:41:31 +03:00
config HAS_IOMEM
2006-12-13 11:35:00 +03:00
boolean
2007-02-11 18:41:31 +03:00
depends on !NO_IOMEM
default y
config HAS_IOPORT
boolean
depends on HAS_IOMEM && !NO_IOPORT
2006-12-13 11:35:00 +03:00
default y
2007-05-07 01:49:09 +04:00
config HAS_DMA
boolean
depends on !NO_DMA
default y
2007-08-23 01:01:36 +04:00
config CHECK_SIGNATURE
bool
2008-02-14 03:56:49 +03:00
config HAVE_LMB
boolean
2008-12-13 13:50:27 +03:00
config CPUMASK_OFFSTACK
bool "Force CPU masks off stack" if DEBUG_PER_CPU_MAPS
help
Use dynamic allocation for cpumask_var_t, instead of putting
them on the stack. This is a bit more expensive, but avoids
stack overflow.
2009-01-01 02:42:30 +03:00
config DISABLE_OBSOLETE_CPUMASK_FUNCTIONS
bool "Disable obsolete cpumask functions" if DEBUG_PER_CPU_MAPS
depends on EXPERIMENTAL && BROKEN
2005-06-24 07:49:30 +04:00
endmenu