[cfe-dev] [RFC] Cyclomatic complexity checker

[Csaba Raduly via cfe-dev]

On Tue, Jun 21, 2016 at 9:45 AM, Stanislav Pankevich via cfe-dev
<cfe-dev at lists.llvm.org> wrote:
> Hello everyone,
>
> I skimmed through available checkers in Clang Static Analyzer [1] and didn’t find a checker for cyclomatic complexity.
>
> My assumption is that checker is not implemented because it doesn’t help to find bugs directly [2]. However I believe that this checker would help to reduce a number of bugs indirectly by decreasing a complexity of a source code.
>
> Is there a way to see this checker in the upstream? If not what would be the best way to have it?

Write it :)

If someone could mate cccc.sourceforge.net to clang, that would be nice.

Csaba
-- 
GCS a+ e++ d- C++ ULS$ L+$ !E- W++ P+++$ w++$ tv+ b++ DI D++ 5++
The Tao of math: The numbers you can count are not the real numbers.
Life is complex, with real and imaginary parts.
"Ok, it boots. Which means it must be bug-free and perfect. " -- Linus Torvalds
"People disagree with me. I just ignore them." -- Linus Torvalds