Linux / Arch / Openrisc
Conditional Complexity

The distribution of complexity of units (measured with McCabe index).

Intro
  • Conditional complexity (also called cyclomatic complexity) is a term used to measure the complexity of software. The term refers to the number of possible paths through a program function. A higher value ofter means higher maintenance and testing costs (infosecinstitute.com).
  • Conditional complexity is calculated by counting all conditions in the program that can affect the execution path (e.g. if statement, loops, switches, and/or operators, try and catch blocks...).
  • Conditional complexity is measured at the unit level (methods, functions...).
  • Units are classified in four categories based on the measured McCabe index: 1-5 (simple units), 6-10 (medium complex units), 11-25 (complex units), 26+ (very complex units).
Learn more...
Conditional Complexity Overall
  • There are 173 units with 2,075 lines of code in units (29.5% of code).
    • 0 very complex units (0 lines of code)
    • 1 complex units (137 lines of code)
    • 2 medium complex units (96 lines of code)
    • 11 simple units (433 lines of code)
    • 159 very simple units (1,409 lines of code)
0% | 6% | 4% | 20% | 67%
Legend:
51+
26-50
11-25
6-10
1-5
Alternative Visuals
Conditional Complexity per Extension
51+
26-50
11-25
6-10
1-5
c0% | 8% | 5% | 26% | 59%
h0% | 0% | 0% | 0% | 100%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
mm0% | 41% | 0% | 14% | 44%
kernel0% | 0% | 7% | 30% | 62%
include0% | 0% | 0% | 0% | 100%
lib0% | 0% | 0% | 0% | 100%
Most Complex Units
Top 50 most complex units
Unit# linesMcCabe index# params
137 36 4
44 15 2
52 12 1
43 10 2
47 9 1
65 9 3
52 7 1
21 7 1
36 7 3
56 7 2
44 6 5
26 6 1
23 6 3
20 6 1
32 5 3
15 5 1
20 5 3
33 5 3
20 5 1
23 5 3
25 4 4
13 4 4
13 4 3
19 4 3
19 4 6
10 4 1
25 4 2
28 4 1
7 4 1
9 3 3
11 3 2
8 3 1
33 3 1
10 3 3
17 3 2
18 3 2
9 3 1
13 3 2
6 2 1
19 2 3
5 2 2
6 2 1
5 2 1
6 2 1
28 2 1
8 2 1
9 2 2
10 2 1
12 2 3
7 2 1