[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-Id: <20160209195532.fb72f47c5543cc0ada11653a@gmail.com>
Date: Tue, 9 Feb 2016 19:55:32 +0100
From: Emese Revfy <re.emese@...il.com>
To: Kees Cook <keescook@...omium.org>
Cc: linux-kbuild <linux-kbuild@...r.kernel.org>, PaX Team
<pageexec@...email.hu>, Brad Spengler <spender@...ecurity.net>,
"kernel-hardening@...ts.openwall.com"
<kernel-hardening@...ts.openwall.com>, Michal Marek <mmarek@...e.com>
Subject: Re: [PATCH 2/3] Add Cyclomatic complexity GCC plugin
On Mon, 8 Feb 2016 20:23:12 -0800
Kees Cook <keescook@...omium.org> wrote:
> > + 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
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.
