Re: [PATCH v5 3/5] Add Cyclomatic complexity GCC plugin

2016-03-14 Thread Emese Revfy
On Fri, 11 Mar 2016 15:26:39 +0900 Masahiro Yamada wrote: > > diff --git a/scripts/Makefile.gcc-plugins b/scripts/Makefile.gcc-plugins > > index 7c85bf2..dd7b56d 100644 > > --- a/scripts/Makefile.gcc-plugins > > +++ b/scripts/Makefile.gcc-plugins > > @@ -5,7 +5,11

Re: [PATCH v5 3/5] Add Cyclomatic complexity GCC plugin

2016-03-14 Thread Emese Revfy
On Fri, 11 Mar 2016 15:26:39 +0900 Masahiro Yamada wrote: > > diff --git a/scripts/Makefile.gcc-plugins b/scripts/Makefile.gcc-plugins > > index 7c85bf2..dd7b56d 100644 > > --- a/scripts/Makefile.gcc-plugins > > +++ b/scripts/Makefile.gcc-plugins > > @@ -5,7 +5,11 @@ else > > PLUGINCC :=

Re: [PATCH v5 3/5] Add Cyclomatic complexity GCC plugin

2016-03-10 Thread Masahiro Yamada
Hi Emese, 2016-03-07 8:05 GMT+09:00 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

Re: [PATCH v5 3/5] Add Cyclomatic complexity GCC plugin

2016-03-10 Thread Masahiro Yamada
Hi Emese, 2016-03-07 8:05 GMT+09:00 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 >

[PATCH v5 3/5] Add Cyclomatic complexity GCC plugin

2016-03-06 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

[PATCH v5 3/5] Add Cyclomatic complexity GCC plugin

2016-03-06 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