2005-04-16 16:20:36 -06:00
|
|
|
#
|
|
|
|
|
# Library configuration
|
|
|
|
|
#
|
|
|
|
|
|
2009-03-06 09:21:46 -07:00
|
|
|
config BINARY_PRINTF
|
|
|
|
|
def_bool n
|
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
menu "Library routines"
|
|
|
|
|
|
2009-07-13 04:35:12 -06:00
|
|
|
config RAID6_PQ
|
|
|
|
|
tristate
|
|
|
|
|
|
2006-12-08 03:36:25 -07:00
|
|
|
config BITREVERSE
|
|
|
|
|
tristate
|
|
|
|
|
|
2009-06-11 07:51:15 -06:00
|
|
|
config RATIONAL
|
|
|
|
|
boolean
|
|
|
|
|
|
2008-04-25 05:12:53 -06:00
|
|
|
config GENERIC_FIND_FIRST_BIT
|
2008-10-15 23:01:38 -06:00
|
|
|
bool
|
2008-04-25 05:12:53 -06:00
|
|
|
|
|
|
|
|
config GENERIC_FIND_NEXT_BIT
|
2008-10-15 23:01:38 -06:00
|
|
|
bool
|
2008-04-25 05:12:53 -06:00
|
|
|
|
2008-12-31 16:42:19 -07:00
|
|
|
config GENERIC_FIND_LAST_BIT
|
|
|
|
|
bool
|
|
|
|
|
default y
|
|
|
|
|
|
2005-04-16 16:20:36 -06: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 05:17:26 -06: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 09:22:42 -06: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 08:17:04 -06: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-16 16:20:36 -06:00
|
|
|
config CRC32
|
|
|
|
|
tristate "CRC32 functions"
|
|
|
|
|
default y
|
2006-12-08 03:36:25 -07:00
|
|
|
select BITREVERSE
|
2005-04-16 16:20:36 -06: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 05:04:03 -06: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-16 16:20:36 -06:00
|
|
|
config LIBCRC32C
|
|
|
|
|
tristate "CRC32c (Castagnoli, et al) Cyclic Redundancy-Check"
|
2008-11-13 07:05:13 -07:00
|
|
|
select CRYPTO
|
2008-11-07 00:11:47 -07:00
|
|
|
select CRYPTO_CRC32C
|
2005-04-16 16:20:36 -06: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 01:04:40 -06:00
|
|
|
config AUDIT_GENERIC
|
|
|
|
|
bool
|
|
|
|
|
depends on AUDIT && !AUDIT_ARCH
|
|
|
|
|
default y
|
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
#
|
|
|
|
|
# compression support is select'ed if needed
|
|
|
|
|
#
|
|
|
|
|
config ZLIB_INFLATE
|
|
|
|
|
tristate
|
|
|
|
|
|
|
|
|
|
config ZLIB_DEFLATE
|
|
|
|
|
tristate
|
|
|
|
|
|
2007-07-10 18:22:24 -06:00
|
|
|
config LZO_COMPRESS
|
|
|
|
|
tristate
|
|
|
|
|
|
|
|
|
|
config LZO_DECOMPRESS
|
|
|
|
|
tristate
|
|
|
|
|
|
2011-01-12 18:01:22 -07:00
|
|
|
source "lib/xz/Kconfig"
|
|
|
|
|
|
2009-01-05 14:48:31 -07:00
|
|
|
#
|
|
|
|
|
# These all provide a common interface (hence the apparent duplication with
|
|
|
|
|
# ZLIB_INFLATE; DECOMPRESS_GZIP is just a wrapper.)
|
|
|
|
|
#
|
|
|
|
|
config DECOMPRESS_GZIP
|
2009-01-07 01:01:43 -07:00
|
|
|
select ZLIB_INFLATE
|
2009-01-05 14:48:31 -07:00
|
|
|
tristate
|
|
|
|
|
|
|
|
|
|
config DECOMPRESS_BZIP2
|
|
|
|
|
tristate
|
|
|
|
|
|
|
|
|
|
config DECOMPRESS_LZMA
|
|
|
|
|
tristate
|
|
|
|
|
|
decompressors: add boot-time XZ support
This implements the API defined in <linux/decompress/generic.h> which is
used for kernel, initramfs, and initrd decompression. This patch together
with the first patch is enough for XZ-compressed initramfs and initrd;
XZ-compressed kernel will need arch-specific changes.
The buffering requirements described in decompress_unxz.c are stricter
than with gzip, so the relevant changes should be done to the
arch-specific code when adding support for XZ-compressed kernel.
Similarly, the heap size in arch-specific pre-boot code may need to be
increased (30 KiB is enough).
The XZ decompressor needs memmove(), memeq() (memcmp() == 0), and
memzero() (memset(ptr, 0, size)), which aren't available in all
arch-specific pre-boot environments. I'm including simple versions in
decompress_unxz.c, but a cleaner solution would naturally be nicer.
Signed-off-by: Lasse Collin <lasse.collin@tukaani.org>
Cc: "H. Peter Anvin" <hpa@zytor.com>
Cc: Alain Knaff <alain@knaff.lu>
Cc: Albin Tonnerre <albin.tonnerre@free-electrons.com>
Cc: Phillip Lougher <phillip@lougher.demon.co.uk>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-01-12 18:01:23 -07:00
|
|
|
config DECOMPRESS_XZ
|
|
|
|
|
select XZ_DEC
|
|
|
|
|
tristate
|
|
|
|
|
|
2010-01-08 15:42:46 -07:00
|
|
|
config DECOMPRESS_LZO
|
|
|
|
|
select LZO_DECOMPRESS
|
|
|
|
|
tristate
|
|
|
|
|
|
2005-06-21 18:15:02 -06:00
|
|
|
#
|
|
|
|
|
# Generic allocator support is selected if needed
|
|
|
|
|
#
|
|
|
|
|
config GENERIC_ALLOCATOR
|
|
|
|
|
boolean
|
|
|
|
|
|
2005-04-16 16:20:36 -06: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-24 18:39:03 -06:00
|
|
|
#
|
|
|
|
|
# Textsearch support is select'ed if needed
|
|
|
|
|
#
|
2005-06-23 21:49:30 -06:00
|
|
|
config TEXTSEARCH
|
2005-06-24 18:39:03 -06:00
|
|
|
boolean
|
2005-04-16 16:20:36 -06: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-23 21:58:37 -06:00
|
|
|
config TEXTSEARCH_KMP
|
2005-06-24 18:39:03 -06: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-23 21:58:37 -06:00
|
|
|
|
2005-08-25 17:12:22 -06:00
|
|
|
config TEXTSEARCH_BM
|
2005-08-25 17:23:11 -06:00
|
|
|
tristate
|
2005-08-25 17:12:22 -06:00
|
|
|
|
2005-06-23 21:59:16 -06:00
|
|
|
config TEXTSEARCH_FSM
|
2005-06-24 18:39:03 -06:00
|
|
|
tristate
|
2005-06-23 21:59:16 -06:00
|
|
|
|
2009-11-20 12:13:39 -07:00
|
|
|
config BTREE
|
|
|
|
|
boolean
|
|
|
|
|
|
2007-02-11 08:41:31 -07:00
|
|
|
config HAS_IOMEM
|
2006-12-13 01:35:00 -07:00
|
|
|
boolean
|
2007-02-11 08:41:31 -07:00
|
|
|
depends on !NO_IOMEM
|
|
|
|
|
default y
|
|
|
|
|
|
|
|
|
|
config HAS_IOPORT
|
|
|
|
|
boolean
|
|
|
|
|
depends on HAS_IOMEM && !NO_IOPORT
|
2006-12-13 01:35:00 -07:00
|
|
|
default y
|
|
|
|
|
|
2007-05-06 15:49:09 -06:00
|
|
|
config HAS_DMA
|
|
|
|
|
boolean
|
|
|
|
|
depends on !NO_DMA
|
|
|
|
|
default y
|
|
|
|
|
|
2007-08-22 15:01:36 -06:00
|
|
|
config CHECK_SIGNATURE
|
|
|
|
|
bool
|
|
|
|
|
|
2008-12-13 03:50:27 -07: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.
|
|
|
|
|
|
2008-12-31 16:42:30 -07:00
|
|
|
config DISABLE_OBSOLETE_CPUMASK_FUNCTIONS
|
|
|
|
|
bool "Disable obsolete cpumask functions" if DEBUG_PER_CPU_MAPS
|
|
|
|
|
depends on EXPERIMENTAL && BROKEN
|
|
|
|
|
|
2009-03-03 23:53:30 -07:00
|
|
|
#
|
|
|
|
|
# Netlink attribute parsing support is select'ed if needed
|
|
|
|
|
#
|
|
|
|
|
config NLATTR
|
|
|
|
|
bool
|
|
|
|
|
|
2009-06-12 15:10:05 -06:00
|
|
|
#
|
|
|
|
|
# Generic 64-bit atomic support is selected if needed
|
|
|
|
|
#
|
|
|
|
|
config GENERIC_ATOMIC64
|
|
|
|
|
bool
|
|
|
|
|
|
2009-09-25 17:07:19 -06:00
|
|
|
config LRU_CACHE
|
|
|
|
|
tristate
|
|
|
|
|
|
2010-11-15 18:58:37 -07:00
|
|
|
config AVERAGE
|
|
|
|
|
bool
|
|
|
|
|
|
2005-06-23 21:49:30 -06:00
|
|
|
endmenu
|
