Re: [kernel-hardening] [PATCH v8 3/4] Add Cyclomatic complexity GCC plugin

[Emese Revfy]

On Wed, 18 May 2016 18:25:00 +1000
Andrew Donnellan <andrew.donnellan@xxxxxxxxxxx> wrote:

> On 13/05/16 09:58, Emese Revfy wrote:
> > Add a very simple plugin to demonstrate the GCC plugin infrastructure. This GCC
> > plugin computes the cyclomatic complexity of each function.
> 
> ...
> 
> > +config GCC_PLUGIN_CYC_COMPLEXITY
> > +	bool "Compute the cyclomatic complexity of a function"
> > +	depends on GCC_PLUGINS
> > +	help
> > +	  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).
> > +
> 
> If this plugin is intended primarily as a demonstration it's probably 
> worth mentioning this in the Kconfig description.

Hi,

Before sancov this plugin demonstrated the gcc plugin infrastructure but otherwise this is a fully working plugin not a test plugin. Also it doesn't demonstrate all aspects of writing gcc plugins.

-- 
Emese