Skip to content
Compute cyclomatic complexity of functions based on the gcc internal representation.
C++ C Makefile Shell
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
Makefile
README.md
cyc_complexity_plugin.c
gcc-common.h
gcc-generate-gimple-pass.h
gcc-plugin.sh
test.c

README.md

cyclomatic_complexity

Compute cyclomatic complexity of functions based on the gcc internal representation.

http://en.wikipedia.org/wiki/Cyclomatic_complexity

The complexity M is then defined as M = E − N + 2P where

E = the number of edges of the graph
N = the number of nodes of the graph
P = the number of connected components (exit nodes).

Compiling & Usage

gcc 4.5 - 5:
$ make clean ; make
Usage
$ make run
You can’t perform that action at this time.