Re: [PATCH v9 3/4] Add Cyclomatic complexity GCC plugin

2016-06-15 Thread Kees Cook
On Wed, Jun 15, 2016 at 1:53 PM, Emese Revfy wrote: > On Tue, 14 Jun 2016 12:29:59 -0700 > Laura Abbott wrote: > >> On 05/23/2016 03:10 PM, Emese Revfy wrote: >> 1) make mrproper >> 2) make defconfig >> 3) enable GCC_PLUGINS, GCC_PLUGIN_CYC_COMPLEXITY >> 4) enable FUNCTION_TRACER (it will select

Re: [PATCH v9 3/4] Add Cyclomatic complexity GCC plugin

2016-06-15 Thread Emese Revfy
On Tue, 14 Jun 2016 12:29:59 -0700 Laura Abbott wrote: > On 05/23/2016 03:10 PM, Emese Revfy wrote: > 1) make mrproper > 2) make defconfig > 3) enable GCC_PLUGINS, GCC_PLUGIN_CYC_COMPLEXITY > 4) enable FUNCTION_TRACER (it will select other options as well) > 5) make && make modules > > ERROR: "_

Re: [PATCH v9 3/4] Add Cyclomatic complexity GCC plugin

2016-06-14 Thread Emese Revfy
On Tue, 14 Jun 2016 12:29:59 -0700 Laura Abbott wrote: > This has some weird interaction with ftrace. On x86 > > 1) make mrproper > 2) make defconfig > 3) enable GCC_PLUGINS, GCC_PLUGIN_CYC_COMPLEXITY > 4) enable FUNCTION_TRACER (it will select other options as well) > 5) make && make modules >

Re: [PATCH v9 3/4] Add Cyclomatic complexity GCC plugin

2016-06-14 Thread Laura Abbott
On 05/23/2016 03:10 PM, Emese Revfy wrote: 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

[PATCH v9 3/4] Add Cyclomatic complexity GCC plugin

2016-05-23 Thread Emese Revfy
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 conn