Thomas Gleixner | ec8f24b | 2019-05-19 13:07:45 +0100 | [diff] [blame] | 1 | # SPDX-License-Identifier: GPL-2.0-only |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2 | # |
| 3 | # Library configuration |
| 4 | # |
| 5 | |
Lai Jiangshan | 4370aa4 | 2009-03-06 17:21:46 +0100 | [diff] [blame] | 6 | config BINARY_PRINTF |
| 7 | def_bool n |
| 8 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 9 | menu "Library routines" |
| 10 | |
David Woodhouse | f5e70d0 | 2009-07-13 11:35:12 +0100 | [diff] [blame] | 11 | config RAID6_PQ |
| 12 | tristate |
| 13 | |
Daniel Verkamp | be85f93 | 2018-11-12 15:26:52 -0800 | [diff] [blame] | 14 | config RAID6_PQ_BENCHMARK |
| 15 | bool "Automatically choose fastest RAID6 PQ functions" |
| 16 | depends on RAID6_PQ |
| 17 | default y |
| 18 | help |
| 19 | Benchmark all available RAID6 PQ functions on init and choose the |
| 20 | fastest one. |
| 21 | |
Vladimir Oltean | 554aae3 | 2019-05-02 23:23:29 +0300 | [diff] [blame] | 22 | config PACKING |
| 23 | bool "Generic bitfield packing and unpacking" |
| 24 | default n |
| 25 | help |
| 26 | This option provides the packing() helper function, which permits |
| 27 | converting bitfields between a CPU-usable representation and a |
| 28 | memory representation that can have any combination of these quirks: |
| 29 | - Is little endian (bytes are reversed within a 32-bit group) |
| 30 | - The least-significant 32-bit word comes first (within a 64-bit |
| 31 | group) |
| 32 | - The most significant bit of a byte is at its right (bit 0 of a |
| 33 | register description is numerically 2^7). |
| 34 | Drivers may use these helpers to match the bit indices as described |
| 35 | in the data sheets of the peripherals they are in control of. |
| 36 | |
| 37 | When in doubt, say N. |
| 38 | |
Akinobu Mita | a5cfc1ec58 | 2006-12-08 02:36:25 -0800 | [diff] [blame] | 39 | config BITREVERSE |
| 40 | tristate |
| 41 | |
Yalin Wang | 556d2f0 | 2014-11-03 03:01:03 +0100 | [diff] [blame] | 42 | config HAVE_ARCH_BITREVERSE |
Christoph Jaeger | 841c009 | 2015-02-16 16:00:20 -0800 | [diff] [blame] | 43 | bool |
Yalin Wang | 556d2f0 | 2014-11-03 03:01:03 +0100 | [diff] [blame] | 44 | default n |
| 45 | depends on BITREVERSE |
| 46 | help |
Andrew Morton | 9e522c0 | 2015-04-16 12:49:07 -0700 | [diff] [blame] | 47 | This option enables the use of hardware bit-reversal instructions on |
| 48 | architectures which support such operations. |
Yalin Wang | 556d2f0 | 2014-11-03 03:01:03 +0100 | [diff] [blame] | 49 | |
David S. Miller | 2922585 | 2012-05-24 13:12:28 -0700 | [diff] [blame] | 50 | config GENERIC_STRNCPY_FROM_USER |
| 51 | bool |
| 52 | |
Linus Torvalds | a08c535 | 2012-05-26 11:06:38 -0700 | [diff] [blame] | 53 | config GENERIC_STRNLEN_USER |
| 54 | bool |
| 55 | |
Andy Shevchenko | 4cd5773 | 2013-06-04 19:46:26 +0300 | [diff] [blame] | 56 | config GENERIC_NET_UTILS |
| 57 | bool |
| 58 | |
Alexander van Heukelum | 19870de | 2008-04-25 13:12:53 +0200 | [diff] [blame] | 59 | config GENERIC_FIND_FIRST_BIT |
Jan Beulich | 9ba1608 | 2008-10-15 22:01:38 -0700 | [diff] [blame] | 60 | bool |
Alexander van Heukelum | 19870de | 2008-04-25 13:12:53 +0200 | [diff] [blame] | 61 | |
Andy Shevchenko | 2c64e9c | 2019-05-14 15:43:05 -0700 | [diff] [blame] | 62 | source "lib/math/Kconfig" |
| 63 | |
Michael S. Tsirkin | b923650 | 2012-01-30 00:20:48 +0200 | [diff] [blame] | 64 | config NO_GENERIC_PCI_IOPORT_MAP |
| 65 | bool |
| 66 | |
Michael S. Tsirkin | 66eab4d | 2011-11-24 20:45:20 +0200 | [diff] [blame] | 67 | config GENERIC_PCI_IOMAP |
| 68 | bool |
| 69 | |
Michael S. Tsirkin | 4673ca8 | 2011-11-24 14:54:28 +0200 | [diff] [blame] | 70 | config GENERIC_IOMAP |
| 71 | bool |
Michael S. Tsirkin | 66eab4d | 2011-11-24 20:45:20 +0200 | [diff] [blame] | 72 | select GENERIC_PCI_IOMAP |
Michael S. Tsirkin | 4673ca8 | 2011-11-24 14:54:28 +0200 | [diff] [blame] | 73 | |
Wolfram Sang | 4ccf4be | 2011-08-31 20:35:40 +0200 | [diff] [blame] | 74 | config STMP_DEVICE |
| 75 | bool |
| 76 | |
Linus Torvalds | bc08b44 | 2013-09-02 12:12:15 -0700 | [diff] [blame] | 77 | config ARCH_USE_CMPXCHG_LOCKREF |
| 78 | bool |
| 79 | |
Linus Torvalds | 72d9310 | 2014-09-13 11:14:53 -0700 | [diff] [blame] | 80 | config ARCH_HAS_FAST_MULTIPLIER |
| 81 | bool |
| 82 | |
Zhichang Yuan | 031e360 | 2018-03-15 02:15:50 +0800 | [diff] [blame] | 83 | config INDIRECT_PIO |
| 84 | bool "Access I/O in non-MMIO mode" |
| 85 | depends on ARM64 |
| 86 | help |
| 87 | On some platforms where no separate I/O space exists, there are I/O |
| 88 | hosts which can not be accessed in MMIO mode. Using the logical PIO |
| 89 | mechanism, the host-local I/O resource can be mapped into system |
| 90 | logic PIO space shared with MMIO hosts, such as PCI/PCIe, then the |
| 91 | system can access the I/O devices with the mapped-logic PIO through |
| 92 | I/O accessors. |
| 93 | |
| 94 | This way has relatively little I/O performance cost. Please make |
| 95 | sure your devices really need this configure item enabled. |
| 96 | |
| 97 | When in doubt, say N. |
| 98 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 99 | config CRC_CCITT |
| 100 | tristate "CRC-CCITT functions" |
| 101 | help |
| 102 | This option is provided for the case where no in-kernel-tree |
| 103 | modules require CRC-CCITT functions, but a module built outside |
| 104 | the kernel tree does. Such modules that use library CRC-CCITT |
| 105 | functions require M here. |
| 106 | |
Evgeniy Polyakov | 7657ec1 | 2005-08-17 15:17:26 +0400 | [diff] [blame] | 107 | config CRC16 |
| 108 | tristate "CRC16 functions" |
| 109 | help |
| 110 | This option is provided for the case where no in-kernel-tree |
| 111 | modules require CRC16 functions, but a module built outside |
| 112 | the kernel tree does. Such modules that use library CRC16 |
| 113 | functions require M here. |
| 114 | |
Martin K. Petersen | f11f594 | 2008-06-25 11:22:42 -0400 | [diff] [blame] | 115 | config CRC_T10DIF |
| 116 | tristate "CRC calculation for the T10 Data Integrity Field" |
Herbert Xu | 68411521 | 2013-09-07 12:56:26 +1000 | [diff] [blame] | 117 | select CRYPTO |
| 118 | select CRYPTO_CRCT10DIF |
Martin K. Petersen | f11f594 | 2008-06-25 11:22:42 -0400 | [diff] [blame] | 119 | help |
| 120 | This option is only needed if a module that's not in the |
| 121 | kernel tree needs to calculate CRC checks for use with the |
| 122 | SCSI data integrity subsystem. |
| 123 | |
Ivo van Doorn | 3e7cbae | 2006-06-12 16:17:04 +0200 | [diff] [blame] | 124 | config CRC_ITU_T |
| 125 | tristate "CRC ITU-T V.41 functions" |
| 126 | help |
| 127 | This option is provided for the case where no in-kernel-tree |
| 128 | modules require CRC ITU-T V.41 functions, but a module built outside |
| 129 | the kernel tree does. Such modules that use library CRC ITU-T V.41 |
| 130 | functions require M here. |
| 131 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 132 | config CRC32 |
Darrick J. Wong | 46c5801 | 2012-03-23 15:02:25 -0700 | [diff] [blame] | 133 | tristate "CRC32/CRC32c functions" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 134 | default y |
Akinobu Mita | 906d66d | 2006-12-08 02:36:25 -0800 | [diff] [blame] | 135 | select BITREVERSE |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 136 | help |
| 137 | This option is provided for the case where no in-kernel-tree |
Darrick J. Wong | 46c5801 | 2012-03-23 15:02:25 -0700 | [diff] [blame] | 138 | modules require CRC32/CRC32c functions, but a module built outside |
| 139 | the kernel tree does. Such modules that use library CRC32/CRC32c |
| 140 | functions require M here. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 141 | |
Bob Pearson | 3863ef3 | 2012-03-23 15:02:22 -0700 | [diff] [blame] | 142 | config CRC32_SELFTEST |
Geert Uytterhoeven | 5fb7f87 | 2017-02-24 15:00:49 -0800 | [diff] [blame] | 143 | tristate "CRC32 perform self test on init" |
Bob Pearson | 3863ef3 | 2012-03-23 15:02:22 -0700 | [diff] [blame] | 144 | depends on CRC32 |
| 145 | help |
| 146 | This option enables the CRC32 library functions to perform a |
| 147 | self test on initialization. The self test computes crc32_le |
| 148 | and crc32_be over byte strings with random alignment and length |
| 149 | and computes the total elapsed time and number of bytes processed. |
| 150 | |
Darrick J. Wong | 5cde765 | 2012-03-23 15:02:26 -0700 | [diff] [blame] | 151 | choice |
| 152 | prompt "CRC32 implementation" |
| 153 | depends on CRC32 |
| 154 | default CRC32_SLICEBY8 |
Darrick J. Wong | 82edb4b | 2012-03-28 14:42:56 -0700 | [diff] [blame] | 155 | help |
| 156 | This option allows a kernel builder to override the default choice |
| 157 | of CRC32 algorithm. Choose the default ("slice by 8") unless you |
| 158 | know that you need one of the others. |
Darrick J. Wong | 5cde765 | 2012-03-23 15:02:26 -0700 | [diff] [blame] | 159 | |
| 160 | config CRC32_SLICEBY8 |
| 161 | bool "Slice by 8 bytes" |
| 162 | help |
| 163 | Calculate checksum 8 bytes at a time with a clever slicing algorithm. |
| 164 | This is the fastest algorithm, but comes with a 8KiB lookup table. |
| 165 | Most modern processors have enough cache to hold this table without |
| 166 | thrashing the cache. |
| 167 | |
| 168 | This is the default implementation choice. Choose this one unless |
| 169 | you have a good reason not to. |
| 170 | |
| 171 | config CRC32_SLICEBY4 |
| 172 | bool "Slice by 4 bytes" |
| 173 | help |
| 174 | Calculate checksum 4 bytes at a time with a clever slicing algorithm. |
| 175 | This is a bit slower than slice by 8, but has a smaller 4KiB lookup |
| 176 | table. |
| 177 | |
| 178 | Only choose this option if you know what you are doing. |
| 179 | |
| 180 | config CRC32_SARWATE |
| 181 | bool "Sarwate's Algorithm (one byte at a time)" |
| 182 | help |
| 183 | Calculate checksum a byte at a time using Sarwate's algorithm. This |
| 184 | is not particularly fast, but has a small 256 byte lookup table. |
| 185 | |
| 186 | Only choose this option if you know what you are doing. |
| 187 | |
| 188 | config CRC32_BIT |
| 189 | bool "Classic Algorithm (one bit at a time)" |
| 190 | help |
| 191 | Calculate checksum one bit at a time. This is VERY slow, but has |
| 192 | no lookup table. This is provided as a debugging option. |
| 193 | |
| 194 | Only choose this option if you are debugging crc32. |
| 195 | |
| 196 | endchoice |
| 197 | |
Coly Li | feba04f | 2018-08-21 21:57:11 -0700 | [diff] [blame] | 198 | config CRC64 |
| 199 | tristate "CRC64 functions" |
| 200 | help |
| 201 | This option is provided for the case where no in-kernel-tree |
| 202 | modules require CRC64 functions, but a module built outside |
| 203 | the kernel tree does. Such modules that use library CRC64 |
| 204 | functions require M here. |
| 205 | |
Jeremy Kerr | 0cbaa44 | 2017-06-06 16:08:39 -0500 | [diff] [blame] | 206 | config CRC4 |
| 207 | tristate "CRC4 functions" |
| 208 | help |
| 209 | This option is provided for the case where no in-kernel-tree |
| 210 | modules require CRC4 functions, but a module built outside |
| 211 | the kernel tree does. Such modules that use library CRC4 |
| 212 | functions require M here. |
| 213 | |
Jan Nikitenko | ad24152 | 2007-07-17 04:04:03 -0700 | [diff] [blame] | 214 | config CRC7 |
| 215 | tristate "CRC7 functions" |
| 216 | help |
| 217 | This option is provided for the case where no in-kernel-tree |
| 218 | modules require CRC7 functions, but a module built outside |
| 219 | the kernel tree does. Such modules that use library CRC7 |
| 220 | functions require M here. |
| 221 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 222 | config LIBCRC32C |
| 223 | tristate "CRC32c (Castagnoli, et al) Cyclic Redundancy-Check" |
Herbert Xu | 9302735 | 2008-11-13 22:05:13 +0800 | [diff] [blame] | 224 | select CRYPTO |
Herbert Xu | 69c35ef | 2008-11-07 15:11:47 +0800 | [diff] [blame] | 225 | select CRYPTO_CRC32C |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 226 | help |
| 227 | This option is provided for the case where no in-kernel-tree |
| 228 | modules require CRC32c functions, but a module built outside the |
| 229 | kernel tree does. Such modules that use library CRC32c functions |
| 230 | require M here. See Castagnoli93. |
| 231 | Module will be libcrc32c. |
| 232 | |
Arend van Spriel | 7150962 | 2011-05-31 11:22:15 +0200 | [diff] [blame] | 233 | config CRC8 |
| 234 | tristate "CRC8 function" |
| 235 | help |
| 236 | This option provides CRC8 function. Drivers may select this |
| 237 | when they need to do cyclic redundancy check according CRC8 |
| 238 | algorithm. Module will be called crc8. |
| 239 | |
Nick Terrell | 5d24052 | 2017-08-04 13:19:17 -0700 | [diff] [blame] | 240 | config XXHASH |
| 241 | tristate |
| 242 | |
Al Viro | e65e1fc | 2006-09-12 03:04:40 -0400 | [diff] [blame] | 243 | config AUDIT_GENERIC |
| 244 | bool |
| 245 | depends on AUDIT && !AUDIT_ARCH |
| 246 | default y |
| 247 | |
AKASHI Takahiro | 4b58841 | 2014-03-15 14:48:00 +0900 | [diff] [blame] | 248 | config AUDIT_ARCH_COMPAT_GENERIC |
| 249 | bool |
| 250 | default n |
| 251 | |
| 252 | config AUDIT_COMPAT_GENERIC |
| 253 | bool |
| 254 | depends on AUDIT_GENERIC && AUDIT_ARCH_COMPAT_GENERIC && COMPAT |
| 255 | default y |
| 256 | |
Daniel Borkmann | a6a9c0f | 2013-11-11 12:20:37 +0100 | [diff] [blame] | 257 | config RANDOM32_SELFTEST |
| 258 | bool "PRNG perform self test on init" |
Daniel Borkmann | a6a9c0f | 2013-11-11 12:20:37 +0100 | [diff] [blame] | 259 | help |
| 260 | This option enables the 32 bit PRNG library functions to perform a |
| 261 | self test on initialization. |
| 262 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 263 | # |
| 264 | # compression support is select'ed if needed |
| 265 | # |
Dan Streetman | 2da572c | 2015-05-07 13:49:14 -0400 | [diff] [blame] | 266 | config 842_COMPRESS |
Arnd Bergmann | 5b57167 | 2016-01-13 23:24:02 +0100 | [diff] [blame] | 267 | select CRC32 |
Dan Streetman | 2da572c | 2015-05-07 13:49:14 -0400 | [diff] [blame] | 268 | tristate |
| 269 | |
| 270 | config 842_DECOMPRESS |
Arnd Bergmann | 5b57167 | 2016-01-13 23:24:02 +0100 | [diff] [blame] | 271 | select CRC32 |
Dan Streetman | 2da572c | 2015-05-07 13:49:14 -0400 | [diff] [blame] | 272 | tristate |
| 273 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 274 | config ZLIB_INFLATE |
| 275 | tristate |
| 276 | |
| 277 | config ZLIB_DEFLATE |
| 278 | tristate |
Andrew Morton | 1fd4e5c | 2015-10-15 15:28:35 -0700 | [diff] [blame] | 279 | select BITREVERSE |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 280 | |
Mikhail Zaslonko | aa5b395 | 2020-01-30 22:16:17 -0800 | [diff] [blame] | 281 | config ZLIB_DFLTCC |
| 282 | def_bool y |
| 283 | depends on S390 |
| 284 | prompt "Enable s390x DEFLATE CONVERSION CALL support for kernel zlib" |
| 285 | help |
| 286 | Enable s390x hardware support for zlib in the kernel. |
| 287 | |
Richard Purdie | 64c70b1 | 2007-07-10 17:22:24 -0700 | [diff] [blame] | 288 | config LZO_COMPRESS |
| 289 | tristate |
| 290 | |
| 291 | config LZO_DECOMPRESS |
| 292 | tristate |
| 293 | |
Chanho Min | c72ac7a | 2013-07-08 16:01:49 -0700 | [diff] [blame] | 294 | config LZ4_COMPRESS |
| 295 | tristate |
| 296 | |
| 297 | config LZ4HC_COMPRESS |
| 298 | tristate |
| 299 | |
Kyungsik Lee | e76e1fd | 2013-07-08 16:01:46 -0700 | [diff] [blame] | 300 | config LZ4_DECOMPRESS |
| 301 | tristate |
| 302 | |
Nick Terrell | 73f3d1b | 2017-08-09 19:35:53 -0700 | [diff] [blame] | 303 | config ZSTD_COMPRESS |
| 304 | select XXHASH |
| 305 | tristate |
| 306 | |
| 307 | config ZSTD_DECOMPRESS |
| 308 | select XXHASH |
| 309 | tristate |
| 310 | |
Lasse Collin | 24fa040 | 2011-01-12 17:01:22 -0800 | [diff] [blame] | 311 | source "lib/xz/Kconfig" |
| 312 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 313 | # |
H. Peter Anvin | c8531ab | 2009-01-05 13:48:31 -0800 | [diff] [blame] | 314 | # These all provide a common interface (hence the apparent duplication with |
| 315 | # ZLIB_INFLATE; DECOMPRESS_GZIP is just a wrapper.) |
| 316 | # |
| 317 | config DECOMPRESS_GZIP |
H. Peter Anvin | 7856a16e | 2009-01-07 00:01:43 -0800 | [diff] [blame] | 318 | select ZLIB_INFLATE |
H. Peter Anvin | c8531ab | 2009-01-05 13:48:31 -0800 | [diff] [blame] | 319 | tristate |
| 320 | |
| 321 | config DECOMPRESS_BZIP2 |
| 322 | tristate |
| 323 | |
| 324 | config DECOMPRESS_LZMA |
| 325 | tristate |
| 326 | |
Lasse Collin | 3ebe124 | 2011-01-12 17:01:23 -0800 | [diff] [blame] | 327 | config DECOMPRESS_XZ |
| 328 | select XZ_DEC |
| 329 | tristate |
| 330 | |
Albin Tonnerre | cacb246 | 2010-01-08 14:42:46 -0800 | [diff] [blame] | 331 | config DECOMPRESS_LZO |
| 332 | select LZO_DECOMPRESS |
| 333 | tristate |
| 334 | |
Kyungsik Lee | e76e1fd | 2013-07-08 16:01:46 -0700 | [diff] [blame] | 335 | config DECOMPRESS_LZ4 |
| 336 | select LZ4_DECOMPRESS |
| 337 | tristate |
| 338 | |
H. Peter Anvin | c8531ab | 2009-01-05 13:48:31 -0800 | [diff] [blame] | 339 | # |
Jes Sorensen | f14f75b | 2005-06-21 17:15:02 -0700 | [diff] [blame] | 340 | # Generic allocator support is selected if needed |
| 341 | # |
| 342 | config GENERIC_ALLOCATOR |
Christoph Jaeger | 6341e62 | 2014-12-20 15:41:11 -0500 | [diff] [blame] | 343 | bool |
Jes Sorensen | f14f75b | 2005-06-21 17:15:02 -0700 | [diff] [blame] | 344 | |
| 345 | # |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 346 | # reed solomon support is select'ed if needed |
| 347 | # |
| 348 | config REED_SOLOMON |
| 349 | tristate |
| 350 | |
| 351 | config REED_SOLOMON_ENC8 |
Christoph Jaeger | 6341e62 | 2014-12-20 15:41:11 -0500 | [diff] [blame] | 352 | bool |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 353 | |
| 354 | config REED_SOLOMON_DEC8 |
Christoph Jaeger | 6341e62 | 2014-12-20 15:41:11 -0500 | [diff] [blame] | 355 | bool |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 356 | |
| 357 | config REED_SOLOMON_ENC16 |
Christoph Jaeger | 6341e62 | 2014-12-20 15:41:11 -0500 | [diff] [blame] | 358 | bool |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 359 | |
| 360 | config REED_SOLOMON_DEC16 |
Christoph Jaeger | 6341e62 | 2014-12-20 15:41:11 -0500 | [diff] [blame] | 361 | bool |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 362 | |
David S. Miller | f770434 | 2005-06-24 17:39:03 -0700 | [diff] [blame] | 363 | # |
Ivan Djelic | 437aa56 | 2011-03-11 11:05:32 +0100 | [diff] [blame] | 364 | # BCH support is selected if needed |
| 365 | # |
| 366 | config BCH |
| 367 | tristate |
| 368 | |
| 369 | config BCH_CONST_PARAMS |
Christoph Jaeger | 6341e62 | 2014-12-20 15:41:11 -0500 | [diff] [blame] | 370 | bool |
Ivan Djelic | 437aa56 | 2011-03-11 11:05:32 +0100 | [diff] [blame] | 371 | help |
| 372 | Drivers may select this option to force specific constant |
| 373 | values for parameters 'm' (Galois field order) and 't' |
| 374 | (error correction capability). Those specific values must |
| 375 | be set by declaring default values for symbols BCH_CONST_M |
| 376 | and BCH_CONST_T. |
| 377 | Doing so will enable extra compiler optimizations, |
| 378 | improving encoding and decoding performance up to 2x for |
| 379 | usual (m,t) values (typically such that m*t < 200). |
| 380 | When this option is selected, the BCH library supports |
| 381 | only a single (m,t) configuration. This is mainly useful |
| 382 | for NAND flash board drivers requiring known, fixed BCH |
| 383 | parameters. |
| 384 | |
| 385 | config BCH_CONST_M |
| 386 | int |
| 387 | range 5 15 |
| 388 | help |
| 389 | Constant value for Galois field order 'm'. If 'k' is the |
| 390 | number of data bits to protect, 'm' should be chosen such |
| 391 | that (k + m*t) <= 2**m - 1. |
| 392 | Drivers should declare a default value for this symbol if |
| 393 | they select option BCH_CONST_PARAMS. |
| 394 | |
| 395 | config BCH_CONST_T |
| 396 | int |
| 397 | help |
| 398 | Constant value for error correction capability in bits 't'. |
| 399 | Drivers should declare a default value for this symbol if |
| 400 | they select option BCH_CONST_PARAMS. |
| 401 | |
| 402 | # |
David S. Miller | f770434 | 2005-06-24 17:39:03 -0700 | [diff] [blame] | 403 | # Textsearch support is select'ed if needed |
| 404 | # |
Thomas Graf | 2de4ff7 | 2005-06-23 20:49:30 -0700 | [diff] [blame] | 405 | config TEXTSEARCH |
Christoph Jaeger | 6341e62 | 2014-12-20 15:41:11 -0500 | [diff] [blame] | 406 | bool |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 407 | |
Thomas Graf | df3fb93 | 2005-06-23 20:58:37 -0700 | [diff] [blame] | 408 | config TEXTSEARCH_KMP |
David S. Miller | f770434 | 2005-06-24 17:39:03 -0700 | [diff] [blame] | 409 | tristate |
Thomas Graf | df3fb93 | 2005-06-23 20:58:37 -0700 | [diff] [blame] | 410 | |
Pablo Neira Ayuso | 8082e4e | 2005-08-25 16:12:22 -0700 | [diff] [blame] | 411 | config TEXTSEARCH_BM |
David S. Miller | 29cb9f9 | 2005-08-25 16:23:11 -0700 | [diff] [blame] | 412 | tristate |
Pablo Neira Ayuso | 8082e4e | 2005-08-25 16:12:22 -0700 | [diff] [blame] | 413 | |
Thomas Graf | 6408f79 | 2005-06-23 20:59:16 -0700 | [diff] [blame] | 414 | config TEXTSEARCH_FSM |
David S. Miller | f770434 | 2005-06-24 17:39:03 -0700 | [diff] [blame] | 415 | tristate |
Thomas Graf | 6408f79 | 2005-06-23 20:59:16 -0700 | [diff] [blame] | 416 | |
Joern Engel | 5db53f3 | 2009-11-20 20:13:39 +0100 | [diff] [blame] | 417 | config BTREE |
Christoph Jaeger | 6341e62 | 2014-12-20 15:41:11 -0500 | [diff] [blame] | 418 | bool |
Joern Engel | 5db53f3 | 2009-11-20 20:13:39 +0100 | [diff] [blame] | 419 | |
Chris Wilson | a88cc10 | 2014-03-17 12:21:54 +0000 | [diff] [blame] | 420 | config INTERVAL_TREE |
Christoph Jaeger | 6341e62 | 2014-12-20 15:41:11 -0500 | [diff] [blame] | 421 | bool |
Chris Wilson | a88cc10 | 2014-03-17 12:21:54 +0000 | [diff] [blame] | 422 | help |
| 423 | Simple, embeddable, interval-tree. Can find the start of an |
| 424 | overlapping range in log(n) time and then iterate over all |
| 425 | overlapping nodes. The algorithm is implemented as an |
| 426 | augmented rbtree. |
| 427 | |
| 428 | See: |
| 429 | |
| 430 | Documentation/rbtree.txt |
| 431 | |
| 432 | for more information. |
| 433 | |
Matthew Wilcox | 02c02bf | 2017-11-03 23:09:45 -0400 | [diff] [blame] | 434 | config XARRAY_MULTI |
Matthew Wilcox | 57578c2 | 2016-05-20 17:01:54 -0700 | [diff] [blame] | 435 | bool |
Matthew Wilcox | 02c02bf | 2017-11-03 23:09:45 -0400 | [diff] [blame] | 436 | help |
| 437 | Support entries which occupy multiple consecutive indices in the |
| 438 | XArray. |
Matthew Wilcox | 57578c2 | 2016-05-20 17:01:54 -0700 | [diff] [blame] | 439 | |
David Howells | 3cb9895 | 2013-09-24 10:35:17 +0100 | [diff] [blame] | 440 | config ASSOCIATIVE_ARRAY |
| 441 | bool |
| 442 | help |
| 443 | Generic associative array. Can be searched and iterated over whilst |
| 444 | it is being modified. It is also reasonably quick to search and |
| 445 | modify. The algorithms are non-recursive, and the trees are highly |
| 446 | capacious. |
| 447 | |
| 448 | See: |
| 449 | |
Mauro Carvalho Chehab | 5fb94e9 | 2018-05-08 15:14:57 -0300 | [diff] [blame] | 450 | Documentation/core-api/assoc_array.rst |
David Howells | 3cb9895 | 2013-09-24 10:35:17 +0100 | [diff] [blame] | 451 | |
| 452 | for more information. |
| 453 | |
Al Viro | 5ea8176 | 2007-02-11 15:41:31 +0000 | [diff] [blame] | 454 | config HAS_IOMEM |
Christoph Jaeger | 6341e62 | 2014-12-20 15:41:11 -0500 | [diff] [blame] | 455 | bool |
Al Viro | 5ea8176 | 2007-02-11 15:41:31 +0000 | [diff] [blame] | 456 | depends on !NO_IOMEM |
| 457 | default y |
| 458 | |
Uwe Kleine-König | ce816fa | 2014-04-07 15:39:19 -0700 | [diff] [blame] | 459 | config HAS_IOPORT_MAP |
Christoph Jaeger | 6341e62 | 2014-12-20 15:41:11 -0500 | [diff] [blame] | 460 | bool |
Uwe Kleine-König | ce816fa | 2014-04-07 15:39:19 -0700 | [diff] [blame] | 461 | depends on HAS_IOMEM && !NO_IOPORT_MAP |
Al Viro | ee36c2b | 2006-12-13 00:35:00 -0800 | [diff] [blame] | 462 | default y |
| 463 | |
Christoph Hellwig | cf65a0f | 2018-06-12 19:01:45 +0200 | [diff] [blame] | 464 | source "kernel/dma/Kconfig" |
Heiko Carstens | 411f0f3 | 2007-05-06 14:49:09 -0700 | [diff] [blame] | 465 | |
Bart Van Assche | e80a0af | 2018-01-05 08:26:46 -0800 | [diff] [blame] | 466 | config SGL_ALLOC |
| 467 | bool |
| 468 | default n |
| 469 | |
Christoph Hellwig | a4ce5a4 | 2018-04-03 15:47:59 +0200 | [diff] [blame] | 470 | config IOMMU_HELPER |
| 471 | bool |
| 472 | |
Geert Uytterhoeven | 928923c | 2007-08-22 14:01:36 -0700 | [diff] [blame] | 473 | config CHECK_SIGNATURE |
| 474 | bool |
| 475 | |
Rusty Russell | aab46da | 2008-12-13 21:20:27 +1030 | [diff] [blame] | 476 | config CPUMASK_OFFSTACK |
| 477 | bool "Force CPU masks off stack" if DEBUG_PER_CPU_MAPS |
| 478 | help |
| 479 | Use dynamic allocation for cpumask_var_t, instead of putting |
| 480 | them on the stack. This is a bit more expensive, but avoids |
| 481 | stack overflow. |
| 482 | |
Ben Hutchings | c39649c | 2011-01-19 11:03:25 +0000 | [diff] [blame] | 483 | config CPU_RMAP |
| 484 | bool |
| 485 | depends on SMP |
| 486 | |
Tom Herbert | 75957ba | 2011-11-28 16:32:35 +0000 | [diff] [blame] | 487 | config DQL |
| 488 | bool |
| 489 | |
George Spelvin | b012508 | 2014-08-06 16:09:23 -0700 | [diff] [blame] | 490 | config GLOB |
| 491 | bool |
| 492 | # This actually supports modular compilation, but the module overhead |
| 493 | # is ridiculous for the amount of code involved. Until an out-of-tree |
| 494 | # driver asks for it, we'll just link it directly it into the kernel |
| 495 | # when required. Since we're ignoring out-of-tree users, there's also |
| 496 | # no need bother prompting for a manual decision: |
| 497 | # prompt "glob_match() function" |
| 498 | help |
| 499 | This option provides a glob_match function for performing |
| 500 | simple text pattern matching. It originated in the ATA code |
| 501 | to blacklist particular drive models, but other device drivers |
| 502 | may need similar functionality. |
| 503 | |
| 504 | All drivers in the Linux kernel tree that require this function |
| 505 | should automatically select this option. Say N unless you |
| 506 | are compiling an out-of tree driver which tells you that it |
| 507 | depends on this. |
| 508 | |
George Spelvin | 5f9be82 | 2014-08-06 16:09:25 -0700 | [diff] [blame] | 509 | config GLOB_SELFTEST |
Geert Uytterhoeven | ba95b04 | 2017-02-24 15:00:52 -0800 | [diff] [blame] | 510 | tristate "glob self-test on init" |
George Spelvin | 5f9be82 | 2014-08-06 16:09:25 -0700 | [diff] [blame] | 511 | depends on GLOB |
| 512 | help |
| 513 | This option enables a simple self-test of the glob_match |
| 514 | function on startup. It is primarily useful for people |
| 515 | working on the code to ensure they haven't introduced any |
| 516 | regressions. |
| 517 | |
| 518 | It only adds a little bit of code and slows kernel boot (or |
| 519 | module load) by a small amount, so you're welcome to play with |
| 520 | it, but you probably don't need it. |
| 521 | |
Geert Uytterhoeven | e9cc8bd | 2009-03-04 14:53:30 +0800 | [diff] [blame] | 522 | # |
| 523 | # Netlink attribute parsing support is select'ed if needed |
| 524 | # |
| 525 | config NLATTR |
| 526 | bool |
| 527 | |
Paul Mackerras | 09d4e0e | 2009-06-12 21:10:05 +0000 | [diff] [blame] | 528 | # |
| 529 | # Generic 64-bit atomic support is selected if needed |
| 530 | # |
| 531 | config GENERIC_ATOMIC64 |
| 532 | bool |
| 533 | |
Philipp Reisner | b411b36 | 2009-09-25 16:07:19 -0700 | [diff] [blame] | 534 | config LRU_CACHE |
| 535 | tristate |
| 536 | |
David Miller | c6df4b1 | 2012-02-02 00:17:54 +0200 | [diff] [blame] | 537 | config CLZ_TAB |
| 538 | bool |
| 539 | |
Christoph Hellwig | 511cbce | 2015-11-10 14:56:14 +0100 | [diff] [blame] | 540 | config IRQ_POLL |
| 541 | bool "IRQ polling library" |
| 542 | help |
| 543 | Helper library to poll interrupt mitigation using polling. |
| 544 | |
Dmitry Kasatkin | d9c46b1 | 2011-08-31 14:05:16 +0300 | [diff] [blame] | 545 | config MPILIB |
Dmitry Kasatkin | 2e5f094 | 2012-01-17 17:12:06 +0200 | [diff] [blame] | 546 | tristate |
David Miller | c6df4b1 | 2012-02-02 00:17:54 +0200 | [diff] [blame] | 547 | select CLZ_TAB |
Dmitry Kasatkin | d9c46b1 | 2011-08-31 14:05:16 +0300 | [diff] [blame] | 548 | help |
| 549 | Multiprecision maths library from GnuPG. |
| 550 | It is used to implement RSA digital signature verification, |
| 551 | which is used by IMA/EVM digital signature extension. |
| 552 | |
Dmitry Kasatkin | 5e8898e | 2012-01-17 17:12:03 +0200 | [diff] [blame] | 553 | config SIGNATURE |
Dmitry Kasatkin | 2e5f094 | 2012-01-17 17:12:06 +0200 | [diff] [blame] | 554 | tristate |
Dmitry Kasatkin | 0d1f64f | 2014-07-11 18:59:45 +0300 | [diff] [blame] | 555 | depends on KEYS |
| 556 | select CRYPTO |
Dmitry Kasatkin | be440ec | 2012-01-17 17:12:04 +0200 | [diff] [blame] | 557 | select CRYPTO_SHA1 |
Dmitry Kasatkin | 051dbb9 | 2011-10-14 15:25:16 +0300 | [diff] [blame] | 558 | select MPILIB |
| 559 | help |
| 560 | Digital signature verification. Currently only RSA is supported. |
| 561 | Implementation is done using GnuPG MPI library |
| 562 | |
Tal Gilboa | 4f75da3 | 2019-01-10 17:33:17 +0200 | [diff] [blame] | 563 | config DIMLIB |
Uwe Kleine-König | 424adc3 | 2019-09-24 18:02:59 +0200 | [diff] [blame] | 564 | bool |
Tal Gilboa | 4f75da3 | 2019-01-10 17:33:17 +0200 | [diff] [blame] | 565 | help |
| 566 | Dynamic Interrupt Moderation library. |
Randy Dunlap | 991ad2b | 2019-09-25 17:20:42 -0700 | [diff] [blame] | 567 | Implements an algorithm for dynamically changing CQ moderation values |
Tal Gilboa | 4f75da3 | 2019-01-10 17:33:17 +0200 | [diff] [blame] | 568 | according to run time performance. |
| 569 | |
David Daney | ab25383 | 2012-07-05 18:12:38 +0200 | [diff] [blame] | 570 | # |
| 571 | # libfdt files, only selected if needed. |
| 572 | # |
| 573 | config LIBFDT |
| 574 | bool |
| 575 | |
David Howells | a77ad6e | 2012-09-21 23:30:46 +0100 | [diff] [blame] | 576 | config OID_REGISTRY |
| 577 | tristate |
| 578 | help |
| 579 | Enable fast lookup object identifier registry. |
| 580 | |
Matthew Garrett | 0635eb8 | 2013-04-15 13:09:45 -0700 | [diff] [blame] | 581 | config UCS2_STRING |
Krzysztof Kozlowski | 68d4b3d | 2019-12-06 17:04:08 -0800 | [diff] [blame] | 582 | tristate |
Matthew Garrett | 0635eb8 | 2013-04-15 13:09:45 -0700 | [diff] [blame] | 583 | |
Vincenzo Frascino | 00b2647 | 2019-06-21 10:52:29 +0100 | [diff] [blame] | 584 | # |
| 585 | # generic vdso |
| 586 | # |
| 587 | source "lib/vdso/Kconfig" |
| 588 | |
Geert Uytterhoeven | ee89bd6 | 2013-06-09 11:46:43 +0200 | [diff] [blame] | 589 | source "lib/fonts/Kconfig" |
| 590 | |
Robert Jarzmik | f8bcbe6 | 2015-08-08 10:44:10 +0200 | [diff] [blame] | 591 | config SG_SPLIT |
| 592 | def_bool n |
| 593 | help |
Geert Uytterhoeven | 7f7e92f | 2015-09-04 12:45:05 +0200 | [diff] [blame] | 594 | Provides a helper to split scatterlists into chunks, each chunk being |
| 595 | a scatterlist. This should be selected by a driver or an API which |
| 596 | whishes to split a scatterlist amongst multiple DMA channels. |
Robert Jarzmik | f8bcbe6 | 2015-08-08 10:44:10 +0200 | [diff] [blame] | 597 | |
Ming Lin | 9b1d6c8 | 2016-04-04 14:48:11 -0700 | [diff] [blame] | 598 | config SG_POOL |
| 599 | def_bool n |
| 600 | help |
| 601 | Provides a helper to allocate chained scatterlists. This should be |
| 602 | selected by a driver or an API which whishes to allocate chained |
| 603 | scatterlist. |
| 604 | |
Laura Abbott | 308c09f | 2014-08-08 14:23:25 -0700 | [diff] [blame] | 605 | # |
| 606 | # sg chaining option |
| 607 | # |
| 608 | |
Christoph Hellwig | 7c703e5 | 2018-11-09 09:51:00 +0100 | [diff] [blame] | 609 | config ARCH_NO_SG_CHAIN |
Laura Abbott | 308c09f | 2014-08-08 14:23:25 -0700 | [diff] [blame] | 610 | def_bool n |
| 611 | |
Ross Zwisler | 6103195 | 2015-06-25 03:08:39 -0400 | [diff] [blame] | 612 | config ARCH_HAS_PMEM_API |
| 613 | bool |
| 614 | |
Dan Williams | 33dd707 | 2019-11-06 17:43:31 -0800 | [diff] [blame] | 615 | config MEMREGION |
| 616 | bool |
| 617 | |
Dan Williams | 9ffc1d1 | 2020-01-30 12:06:07 -0800 | [diff] [blame^] | 618 | config ARCH_HAS_MEMREMAP_COMPAT_ALIGN |
| 619 | bool |
| 620 | |
Christoph Hellwig | bd79f94 | 2019-04-23 18:38:08 +0200 | [diff] [blame] | 621 | # use memcpy to implement user copies for nommu architectures |
| 622 | config UACCESS_MEMCPY |
| 623 | bool |
| 624 | |
Dan Williams | 0aed55a | 2017-05-29 12:22:50 -0700 | [diff] [blame] | 625 | config ARCH_HAS_UACCESS_FLUSHCACHE |
| 626 | bool |
| 627 | |
Dan Williams | 522239b | 2018-05-22 23:17:03 -0700 | [diff] [blame] | 628 | config ARCH_HAS_UACCESS_MCSAFE |
| 629 | bool |
| 630 | |
Thomas Gleixner | 214d8ca | 2019-04-25 11:45:21 +0200 | [diff] [blame] | 631 | # Temporary. Goes away when all archs are cleaned up |
| 632 | config ARCH_STACKWALK |
| 633 | bool |
| 634 | |
Alexander Potapenko | cd11016 | 2016-03-25 14:22:08 -0700 | [diff] [blame] | 635 | config STACKDEPOT |
| 636 | bool |
| 637 | select STACKTRACE |
| 638 | |
Omar Sandoval | 8845964 | 2016-09-17 08:38:44 -0600 | [diff] [blame] | 639 | config SBITMAP |
| 640 | bool |
| 641 | |
Jiri Pirko | 44091d2 | 2017-02-03 10:29:06 +0100 | [diff] [blame] | 642 | config PARMAN |
Geert Uytterhoeven | 9d25af6 | 2017-02-24 11:25:55 +0100 | [diff] [blame] | 643 | tristate "parman" if COMPILE_TEST |
Jiri Pirko | 44091d2 | 2017-02-03 10:29:06 +0100 | [diff] [blame] | 644 | |
Randy Dunlap | 3dfdecc | 2019-09-09 14:54:21 -0700 | [diff] [blame] | 645 | config OBJAGG |
| 646 | tristate "objagg" if COMPILE_TEST |
| 647 | |
Matthew Wilcox | 03270c1 | 2017-09-08 16:13:52 -0700 | [diff] [blame] | 648 | config STRING_SELFTEST |
Geert Uytterhoeven | d6b28e0 | 2017-11-17 15:27:56 -0800 | [diff] [blame] | 649 | tristate "Test string functions" |
Matthew Wilcox | 03270c1 | 2017-09-08 16:13:52 -0700 | [diff] [blame] | 650 | |
Thomas Graf | 2de4ff7 | 2005-06-23 20:49:30 -0700 | [diff] [blame] | 651 | endmenu |
Palmer Dabbelt | b35cd98 | 2017-05-23 10:28:26 -0700 | [diff] [blame] | 652 | |
Christoph Hellwig | 80b0ca9 | 2019-08-13 11:24:04 +0200 | [diff] [blame] | 653 | config GENERIC_IOREMAP |
| 654 | bool |
| 655 | |
Matt Redfearn | e3d5980 | 2018-04-11 08:50:17 +0100 | [diff] [blame] | 656 | config GENERIC_LIB_ASHLDI3 |
Palmer Dabbelt | b35cd98 | 2017-05-23 10:28:26 -0700 | [diff] [blame] | 657 | bool |
| 658 | |
Matt Redfearn | e3d5980 | 2018-04-11 08:50:17 +0100 | [diff] [blame] | 659 | config GENERIC_LIB_ASHRDI3 |
Palmer Dabbelt | b35cd98 | 2017-05-23 10:28:26 -0700 | [diff] [blame] | 660 | bool |
| 661 | |
Matt Redfearn | e3d5980 | 2018-04-11 08:50:17 +0100 | [diff] [blame] | 662 | config GENERIC_LIB_LSHRDI3 |
Palmer Dabbelt | b35cd98 | 2017-05-23 10:28:26 -0700 | [diff] [blame] | 663 | bool |
| 664 | |
Matt Redfearn | e3d5980 | 2018-04-11 08:50:17 +0100 | [diff] [blame] | 665 | config GENERIC_LIB_MULDI3 |
Palmer Dabbelt | b35cd98 | 2017-05-23 10:28:26 -0700 | [diff] [blame] | 666 | bool |
| 667 | |
Matt Redfearn | e3d5980 | 2018-04-11 08:50:17 +0100 | [diff] [blame] | 668 | config GENERIC_LIB_CMPDI2 |
Palmer Dabbelt | b35cd98 | 2017-05-23 10:28:26 -0700 | [diff] [blame] | 669 | bool |
| 670 | |
Matt Redfearn | e3d5980 | 2018-04-11 08:50:17 +0100 | [diff] [blame] | 671 | config GENERIC_LIB_UCMPDI2 |
Palmer Dabbelt | b35cd98 | 2017-05-23 10:28:26 -0700 | [diff] [blame] | 672 | bool |