Files
linux/scripts
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
..
2016-06-07 22:57:10 +02:00
2014-08-20 16:03:45 +02:00
2014-08-20 16:03:45 +02:00
2011-08-31 16:12:17 +02:00
2014-08-20 16:03:45 +02:00
2014-08-20 16:03:45 +02:00
2016-06-07 22:57:10 +02:00
2014-08-20 16:03:45 +02:00
2012-06-27 12:44:29 -07:00
2014-12-20 00:01:12 +01:00
2016-06-07 22:57:10 +02:00
2016-06-07 22:57:10 +02:00
2016-06-07 22:57:10 +02:00
2016-06-07 22:57:10 +02:00
2016-06-07 22:57:10 +02:00
2015-10-12 17:46:36 +01:00
2014-08-20 16:03:45 +02:00
2014-08-20 16:03:45 +02:00
2015-08-28 17:04:40 +02:00
2015-08-28 17:04:40 +02:00
2016-02-07 23:01:45 -08:00
2014-08-20 16:03:45 +02:00