CONFIG_GCC_PLUGIN_CYC_COMPLEXITY: Compute the cyclomatic complexity of a function

General informations

The Linux kernel configuration item CONFIG_GCC_PLUGIN_CYC_COMPLEXITY has multiple definitions:

Compute the cyclomatic complexity of a function found in scripts/gcc-plugins/Kconfig

The configuration item CONFIG_GCC_PLUGIN_CYC_COMPLEXITY:

• prompt: Compute the cyclomatic complexity of a function
• type: bool
• depends on: ( CONFIG_EXPERT ) && (! CONFIG_COMPILE_TEST )
• defined in scripts/gcc-plugins/Kconfig
• found in Linux kernels: 4.19–4.20, 5.0–5.15

Help text

The complexity M of a function's control flow graph is defined as: M = E - N + 2P where

E = the number of edges N = the number of nodes P = the number of connected components (exit nodes).

Enabling this plugin reports the complexity to stderr during the build. It mainly serves as a simple example of how to create a gcc plugin for the kernel.

Compute the cyclomatic complexity of a function found in arch/Kconfig

The configuration item CONFIG_GCC_PLUGIN_CYC_COMPLEXITY:

• prompt: Compute the cyclomatic complexity of a function
• type: bool
• depends on: ( CONFIG_EXPERT ) && ( CONFIG_GCC_PLUGINS ) && (! CONFIG_COMPILE_TEST )
• defined in arch/Kconfig
• found in Linux kernels: 4.8–4.18

Help text

The complexity M of a function's control flow graph is defined as: M = E - N + 2P where

E = the number of edges N = the number of nodes P = the number of connected components (exit nodes).

Enabling this plugin reports the complexity to stderr during the build. It mainly serves as a simple example of how to create a gcc plugin for the kernel.

Hardware

LKDDb

Raw data from LKDDb:

• (none)

Sources

This page is automaticly generated with free (libre, open) software lkddb(see lkddb-sources).

The data is retrived from:

• Linux kernel
• Linux Kernel Driver DataBase (LKDDb)

Automatic links from Google (and ads)

Custom Search

Popular queries: