Add Cyclomatic complexity GCC plugin
authorEmese Revfy <re.emese@gmail.com>
Mon, 23 May 2016 22:10:35 +0000 (00:10 +0200)
committerMichal Marek <mmarek@suse.com>
Tue, 7 Jun 2016 20:57:10 +0000 (22:57 +0200)
commit0dae776c6bf31e779c172753f6e2d6426eb42523
treea535f373e3a767bc3a3d6177640e3b088f7cdb24
parent6b90bd4ba40b38dc13c2782469c1c77e4ed79915
Add Cyclomatic complexity GCC plugin

Add a very simple plugin to demonstrate the GCC plugin infrastructure. This GCC
plugin computes the cyclomatic complexity of each function.

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).

Signed-off-by: Emese Revfy <re.emese@gmail.com>
Acked-by: Kees Cook <keescook@chromium.org>
Signed-off-by: Michal Marek <mmarek@suse.com>
arch/Kconfig
scripts/Makefile.gcc-plugins
scripts/gcc-plugins/Makefile
scripts/gcc-plugins/cyc_complexity_plugin.c [new file with mode: 0644]