linux-6.12.1/lib/Kconfig

1 # SPDX-License-Identifier: GPL-2.0-only
31 	  converting bitfields between a CPU-usable representation and a
33 	    - Is little endian (bytes are reversed within a 32-bit group)
34 	    - The least-significant 32-bit word comes first (within a 64-bit
36 	    - The most significant bit of a byte is at its right (bit 0 of a
50 	  This option enables the use of hardware bit-reversal instructions on
90 	bool "Access I/O in non-MMIO mode"
96 	  mechanism, the host-local I/O resource can be mapped into system
98 	  system can access the I/O devices with the mapped-logic PIO through
109 	  This is selected by other options/architectures to provide the
116 	  If INDIRECT_IOMEM is selected, this enables falling back to plain
130 	tristate "CRC-CCITT functions"
132 	  This option is provided for the case where no in-kernel-tree
133 	  modules require CRC-CCITT functions, but a module built outside
134 	  the kernel tree does. Such modules that use library CRC-CCITT
140 	  This option is provided for the case where no in-kernel-tree
164 	tristate "CRC ITU-T V.41 functions"
166 	  This option is provided for the case where no in-kernel-tree
167 	  modules require CRC ITU-T V.41 functions, but a module built outside
168 	  the kernel tree does. Such modules that use library CRC ITU-T V.41
176 	  This option is provided for the case where no in-kernel-tree
240 	  This option is provided for the case where no in-kernel-tree
248 	  This option is provided for the case where no in-kernel-tree
256 	  This option is provided for the case where no in-kernel-tree
262 	tristate "CRC32c (Castagnoli, et al) Cyclic Redundancy-Check"
266 	  This option is provided for the case where no in-kernel-tree
387 # Generic allocator support is selected if needed
411 # BCH support is selected if needed
428 	  When this option is selected, the BCH library supports
439 	  that (k + m*t) <= 2**m - 1.
471 	  Simple, embeddable, interval-tree. Can find the start of an
478 		Documentation/core-api/rbtree.rst
497 	  modify.  The algorithms are non-recursive, and the trees are highly
502 		Documentation/core-api/assoc_array.rst
554 #	is ridiculous for the amount of code involved.	Until an out-of-tree
556 #	when required.  Since we're ignoring out-of-tree users,	there's also
567 	  are compiling an out-of tree driver which tells you that it
571 	tristate "glob self-test on init"
574 	  This option enables a simple self-test of the glob_match
590 # Generic 64-bit atomic support is selected if needed
633 # libfdt files, only selected if needed.
657 	 a scatterlist. This should be selected by a driver or an API which
664 	 selected by a driver or an API which whishes to allocate chained
686 # use memcpy to implement user copies for nommu architectures
694 # memory-read error like x86 machine-check or ARM data-abort, and
695 # implements copy_mc_to_{user,kernel} to abort and report
696 # 'bytes-transferred' if that exception fires when accessing the source
738 	bool "Boot-time test for lwq queuing"
740           Run boot-time test of light-weight queuing.