Linux / Init
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 150 units with 2,147 lines of code in units (69.4% of code).
    • 0 very complex units (0 lines of code)
    • 0 complex units (0 lines of code)
    • 8 medium complex units (494 lines of code)
    • 21 simple units (587 lines of code)
    • 121 very simple units (1,066 lines of code)
0% | 0% | 23% | 27% | 49%
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% | 0% | 23% | 27% | 49%
h0% | 0% | 0% | 0% | 100%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
ROOT0% | 0% | 23% | 27% | 49%
Most Complex Units
Top 50 most complex units
Unit# linesMcCabe index# params
91 20 1
75 15 1
30 14 1
41 13 1
39 12 1
36 11 1
134 11 1
48 11 1
29 10 1
34 10 4
46 9 2
26 9 2
44 9 1
21 9 1
32 9 1
29 8 1
22 8 1
35 8 1
42 8 1
38 7 1
18 7 1
18 7 4
15 7 4
17 6 1
30 6 4
23 6 1
23 6 1
23 6 1
22 6 2
6 5 1
41 5 1
8 5 1
13 5 1
30 5 3
24 5 1
13 4 1
11 4 2
11 4 1
21 4 1
30 4 1
12 4 2
17 4 4
23 4 1
19 4 1
9 3 2
13 3 2
13 3 1
9 3 2
8 3 2
13 3 3