Emese Revfy 0dae776c6b 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>

2016-06-07 22:57:10 +02:00

..

cyc_complexity_plugin.c

Add Cyclomatic complexity GCC plugin

2016-06-07 22:57:10 +02:00

gcc-common.h

…

gcc-generate-gimple-pass.h

…

gcc-generate-ipa-pass.h

…

gcc-generate-rtl-pass.h

…

gcc-generate-simple_ipa-pass.h

…

Makefile

Add Cyclomatic complexity GCC plugin

2016-06-07 22:57:10 +02:00