Lines Matching +full:auto +full:- +full:boot
1 # SPDX-License-Identifier: GPL-2.0-only
64 bool "Debug duplicate modules with auto-loading"
66 Module autoloading allows in-kernel code to request modules through
75 requests are non-fatal virtual memory is a limited resource and each
80 module requests to help identify if module auto-loading may be the
81 culprit to your early boot virtual memory pressure. Since virtual
84 requests for the same module to a single request. You can boot with
93 non-wait request_module() call is synchronous and waits until modprobe
94 completes. Subsequent auto-loading requests for the same module do
100 boot on systems which are failing to boot or if you suspect you may be
101 straining virtual memory during boot, and you want to identify if the
102 abuse was due to module auto-loading. These issues are currently only
105 module auto-loading is not the culprit. There may very well still be
106 many duplicate module auto-loading requests which could be optimized
117 auto-loading requests using WARN_ON() instead of pr_warn(). You
129 --force). Forced module loading sets the 'F' (forced) taint flag and
146 without waiting for anyone to stop using it (using the -f option to
197 <file:Documentation/admin-guide/module-signing.rst>.
205 another LSM - otherwise unsigned modules will be loadable regardless
226 modules must be signed manually, using the scripts/sign-file tool.
228 comment "Do not forget to sign required modules with scripts/sign-file"
242 bool "SHA-1"
246 bool "SHA-256"
250 bool "SHA-384"
254 bool "SHA-512"
258 bool "SHA3-256"
262 bool "SHA3-384"
266 bool "SHA3-512"
278 default "sha3-256" if MODULE_SIG_SHA3_256
279 default "sha3-384" if MODULE_SIG_SHA3_384
280 default "sha3-512" if MODULE_SIG_SHA3_512
285 Enable module compression to reduce on-disk size of module binaries.
335 bool "Support in-kernel module decompression"
385 If unsure, or if you need to build out-of-tree modules, say N.
391 By default, all unused exported symbols will be un-exported from the
395 exported at all times, even in absence of in-tree users. The value to