On Mon, 8 Feb 2016 20:23:12 -0800
Kees Cook [off-list ref] wrote:

quoted

+         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).
+
+         See Documentation/gcc-plugins.txt for details.

Is this plugin documented there? I don't see a chunk for that in this patch.

No yet, please see my other response.

--
Emese