Comments on: The Cyclomatic Horror From Outer Space

By: Arpad Beszedes

Arpad Beszedes — Mon, 29 Oct 2007 12:49:24 +0000

You could take a look at MoMo, the Mozilla Monitor:
http://www.frontendart.com/momo.php
(this one uses another tool, not pmccabe)

The most complex function in an older version had 1323 McCabe, which beats GCC
Even the tenth in the row of the top 10 has complexity of 200. So keep on evolving….

By: Zack Weinberg

Zack Weinberg — Fri, 26 Oct 2007 16:43:33 +0000

Haw, I can beat that – try GCC:
1062 fold_binary
485 find_reloads
479 expand_expr_real_1
430 simplify_binary_operation_1
426 try_combine

and these may not even be the worst instances, because it gets confused by a bunch of preprocessor abuse.

By: haypo

haypo — Fri, 26 Oct 2007 10:33:28 +0000

Try it on libc with “find -name “*c”|xargs pmccabe >> ~/report; sort -nr /home/haypo/report |head”.

Some hilarous results: 494 _IO_vfwscanf() ; 230 fnmatch() ; 222 strtod() ; 200 collate_read() ; 197 dl_main() ; 196 __isinfl_internal() (printf_fp.c) ; 175 wordexp()

By: Raphaël’s Last Minutes » Blog Archive » Cyclomatic complexity in GIMP code

Thu, 25 Oct 2007 22:53:38 +0000

[...] reading Xan’s article The Cyclomatic Horror From Outer Space analyzing the complexity of some GTK functions, I was curious and I wanted to run the same test in [...]

By: Federico Mena Quintero

Federico Mena Quintero — Thu, 25 Oct 2007 22:30:54 +0000

It will take some heavy refactoring before chunks of GTK+ can be automatically tested. For example, we’d need some standalone “layout calculator” for GtkCellRenderers that can be called by the test suite — right now that code is spread all over the place in GtkTreeView and cell renderers themselves.

By: kris

kris — Thu, 25 Oct 2007 22:09:39 +0000

Those tree view functions are not that hard once you get the hang of them Anyway, I’ve indeed been thinking about automatically testing most core GtkTreeView functionality, more on that later. I am surprised GtkTreeModelFilter didn’t show up in the table