Navigation: Linux Kernel Driver DataBase - web LKDDB: Main index - G index

CONFIG_GCC_PLUGIN_CYC_COMPLEXITY: Compute the cyclomatic complexity of a function

General informations

The Linux kernel configuration item CONFIG_GCC_PLUGIN_CYC_COMPLEXITY:

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.



Raw data from LKDDb:


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

The data is retrived from:

Automatic links from Google (and ads)

Custom Search

Popular queries:

Navigation: Linux Kernel Driver DataBase - web LKDDB: main index - G index

Automatically generated (in year 2019). See also LKDDb sources on GitLab