tree a535f373e3a767bc3a3d6177640e3b088f7cdb24
parent 6b90bd4ba40b38dc13c2782469c1c77e4ed79915
author Emese Revfy <re.emese@gmail.com> 1464041435 +0200
committer Michal Marek <mmarek@suse.com> 1465333030 +0200

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>