Kconfig Language



+- Code maturity level options
+- General setup
|  +- Networking support
|  +- System V IPC
|  +- BSD Process Accounting
|  +- Sysctl support
+- Loadable module support
|  +- Enable loadable module support
|     +- Set version information on all module symbols
|     +- Kernel module loader
+- ...


Kconfig syntax


  • config

  • menuconfig

  • choice/endchoice

  • comment

  • menu/endmenu

  • if/endif

  • source

The first five also start the definition of a menu entry.


"config" <symbol>
<config options>



"menuconfig" <symbol>
<config options>

This is similar to the simple config entry above, but it also gives a hint to front ends, that all suboptions should be displayed as a separate list of options. To make sure all the suboptions will really show up under the menuconfig entry and not outside of it, every item from the <config options> list must depend on the menuconfig symbol. In practice, this is achieved by using one of the next two constructs:

menuconfig M
if M
    config C1
    config C2

menuconfig M
config C1
    depends on M
config C2
    depends on M

In the following examples (3) and (4), C1 and C2 still have the M dependency, but will not appear under menuconfig M anymore, because of C0, which doesn’t depend on M:

menuconfig M
    config C0
if M
    config C1
    config C2

menuconfig M
config C0
config C1
    depends on M
config C2
    depends on M


"choice" [symbol]
<choice options>
<choice block>

This defines a choice group and accepts any of the above attributes as options. A choice can only be of type bool or tristate. If no type is specified for a choice, its type will be determined by the type of the first choice element in the group or remain unknown if none of the choice elements have a type specified, as well.

While a boolean choice only allows a single config entry to be selected, a tristate choice also allows any number of config entries to be set to ‘m’. This can be used if multiple drivers for a single hardware exists and only a single driver can be compiled/loaded into the kernel, but all drivers can be compiled as modules.

A choice accepts another option “optional”, which allows to set the choice to ‘n’ and no entry needs to be selected. If no [symbol] is associated with a choice, then you can not have multiple definitions of that choice. If a [symbol] is associated to the choice, then you may define the same choice (i.e. with the same entries) in another place.


"comment" <prompt>
<comment options>



"menu" <prompt>
<menu options>
<menu block>

This defines a menu block, see “Menu structure” above for more information. The only possible options are dependencies and “visible” attributes.


"if" <expr>
<if block>



"source" <prompt>



"mainmenu" <prompt>

This sets the config program’s title bar if the config program chooses to use it. It should be placed at the top of the configuration, before any other statement.

‘#’ Kconfig source file comment:

An unquoted ‘#’ character anywhere in a source file line indicates the beginning of a source file comment. The remainder of that line is a comment.

Kconfig hints


Adding common features and make the usage configurable


We would in lib/Kconfig see:

# Generic IOMAP is used to ...

      depends on HAVE_GENERIC_IOMAP && FOO

And in lib/Makefile we would see:

obj-$(CONFIG_GENERIC_IOMAP) += iomap.o

For each architecture using the generic IOMAP functionality we would see:

config X86
      select ...
      select ...

Note: we use the existing config option and avoid creating a new config variable to select HAVE_GENERIC_IOMAP.

Note: the use of the internal config variable HAVE_GENERIC_IOMAP, it is introduced to overcome the limitation of select which will force a config option to ‘y’ no matter the dependencies. The dependencies are moved to the symbol GENERIC_IOMAP and we avoid the situation where select forces a symbol equals to ‘y’.

Adding features that need compiler support

There are several features that need compiler support. The recommended way to describe the dependency on the compiler feature is to use “depends on” followed by a test macro:

      bool "Stack Protector buffer overflow detection"
      depends on $(cc-option,-fstack-protector)

If you need to expose a compiler capability to makefiles and/or C source files, CC_HAS_ is the recommended prefix for the config option:

      def_bool $(cc-option,-fno-stack-protector)

Build as module only

To restrict a component build to module-only, qualify its config symbol with “depends on m”. E.g.:

config FOO
      depends on BAR && m


Kconfig recursive dependency limitations

If you’ve hit the Kconfig error: “recursive dependency detected” you’ve run into a recursive dependency issue with Kconfig, a recursive dependency can be summarized as a circular dependency. The kconfig tools need to ensure that Kconfig files comply with specified configuration requirements. In order to do that kconfig must determine the values that are possible for all Kconfig symbols, this is currently not possible if there is a circular relation between two or more Kconfig symbols. For more details refer to the “Simple Kconfig recursive issue” subsection below. Kconfig does not do recursive dependency resolution; this has a few implications for Kconfig file writers. We’ll first explain why this issues exists and then provide an example technical limitation which this brings upon Kconfig developers. Eager developers wishing to try to address this limitation should read the next subsections.

Simple Kconfig recursive issue

Read: Documentation/kbuild/Kconfig.recursion-issue-01

Test with:

make KBUILD_KCONFIG=Documentation/kbuild/Kconfig.recursion-issue-01 allnoconfig

Cumulative Kconfig recursive issue

Read: Documentation/kbuild/Kconfig.recursion-issue-02

Test with:

make KBUILD_KCONFIG=Documentation/kbuild/Kconfig.recursion-issue-02 allnoconfig

Practical solutions to kconfig recursive issue

Developers who run into the recursive Kconfig issue have two options at their disposal. We document them below and also provide a list of historical issues resolved through these different solutions.

  1. Remove any superfluous “select FOO” or “depends on FOO”

  2. Match dependency semantics:

    b1) Swap all “select FOO” to “depends on FOO” or,

    b2) Swap all “depends on FOO” to “select FOO”

The resolution to a) can be tested with the sample Kconfig file Documentation/kbuild/Kconfig.recursion-issue-01 through the removal of the “select CORE” from CORE_BELL_A_ADVANCED as that is implicit already since CORE_BELL_A depends on CORE. At times it may not be possible to remove some dependency criteria, for such cases you can work with solution b).

The two different resolutions for b) can be tested in the sample Kconfig file Documentation/kbuild/Kconfig.recursion-issue-02.

Below is a list of examples of prior fixes for these types of recursive issues; all errors appear to involve one or more “select” statements and one or more “depends on”.




select A -> depends on A


depends on A -> depends on B


select A -> depends on A


select A -> select B


select A -> depends on A


depends on A -> (null)


select A -> (null) (1)


select A -> depends on A (1)


select A -> depends on A


select A -> depends on A


depends on A -> (null)


depends on A -> select A


select A -> depends on A


depends on A -> (null)


select A -> depends on A (2)


depends on A > (null) (1)


select A -> depends on A


select A -> depends on A


select A -> depends on A


depends on A -> select A (3)


select A -> depends on A (3)


select A -> (null)

  1. Partial (or no) quote of error.

  2. That seems to be the gist of that fix.

  3. Same error.

Future kconfig work

Work on kconfig is welcomed on both areas of clarifying semantics and on evaluating the use of a full SAT solver for it. A full SAT solver can be desirable to enable more complex dependency mappings and / or queries, for instance on possible use case for a SAT solver could be that of handling the current known recursive dependency issues. It is not known if this would address such issues but such evaluation is desirable. If support for a full SAT solver proves too complex or that it cannot address recursive dependency issues Kconfig should have at least clear and well defined semantics which also addresses and documents limitations or requirements such as the ones dealing with recursive dependencies.

Further work on both of these areas is welcomed on Kconfig. We elaborate on both of these in the next two subsections.

Semantics of Kconfig

The use of Kconfig is broad, Linux is now only one of Kconfig’s users: one study has completed a broad analysis of Kconfig use in 12 projects 0. Despite its widespread use, and although this document does a reasonable job in documenting basic Kconfig syntax a more precise definition of Kconfig semantics is welcomed. One project deduced Kconfig semantics through the use of the xconfig configurator 1. Work should be done to confirm if the deduced semantics matches our intended Kconfig design goals.

Having well defined semantics can be useful for tools for practical evaluation of dependencies, for instance one such case was work to express in boolean abstraction of the inferred semantics of Kconfig to translate Kconfig logic into boolean formulas and run a SAT solver on this to find dead code / features (always inactive), 114 dead features were found in Linux using this methodology 1 (Section 8: Threats to validity).

Confirming this could prove useful as Kconfig stands as one of the the leading industrial variability modeling languages 1 2. Its study would help evaluate practical uses of such languages, their use was only theoretical and real world requirements were not well understood. As it stands though only reverse engineering techniques have been used to deduce semantics from variability modeling languages such as Kconfig 3.









Full SAT solver for Kconfig

Although SAT solvers 4 haven’t yet been used by Kconfig directly, as noted in the previous subsection, work has been done however to express in boolean abstraction the inferred semantics of Kconfig to translate Kconfig logic into boolean formulas and run a SAT solver on it 5. Another known related project is CADOS 6 (former VAMOS 7) and the tools, mainly undertaker 8, which has been introduced first with 9. The basic concept of undertaker is to extract variability models from Kconfig and put them together with a propositional formula extracted from CPP #ifdefs and build-rules into a SAT solver in order to find dead code, dead files, and dead symbols. If using a SAT solver is desirable on Kconfig one approach would be to evaluate repurposing such efforts somehow on Kconfig. There is enough interest from mentors of existing projects to not only help advise how to integrate this work upstream but also help maintain it long term. Interested developers should visit: