Date: Wed, 18 May 2016 18:25:00 +1000 From: Andrew Donnellan <andrew.donnellan@....ibm.com> To: kernel-hardening@...ts.openwall.com, linux-kbuild@...r.kernel.org Cc: pageexec@...email.hu, spender@...ecurity.net, mmarek@...e.com, keescook@...omium.org, linux@...musvillemoes.dk, fengguang.wu@...el.com, dvyukov@...gle.com, linux-kernel@...r.kernel.org, david.brown@...aro.org, yamada.masahiro@...ionext.com Subject: Re: [PATCH v8 3/4] Add Cyclomatic complexity GCC plugin 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. -- Andrew Donnellan OzLabs, ADL Canberra andrew.donnellan@....ibm.com IBM Australia Limited
Powered by blists - more mailing lists
Confused about mailing lists and their use? Read about mailing lists on Wikipedia and check out these guidelines on proper formatting of your messages.