Linux / Drivers / Fpga
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 460 units with 7,257 lines of code in units (65.3% of code).
    • 0 very complex units (0 lines of code)
    • 0 complex units (0 lines of code)
    • 10 medium complex units (623 lines of code)
    • 62 simple units (2,062 lines of code)
    • 388 very simple units (4,572 lines of code)
0% | 0% | 8% | 28% | 63%
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% | 8% | 28% | 62%
h0% | 0% | 0% | 0% | 100%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
ROOT0% | 0% | 8% | 28% | 63%
Most Complex Units
Top 50 most complex units
Unit# linesMcCabe index# params
75 16 4
48 14 1
51 13 3
91 12 4
60 12 1
32 11 3
68 11 2
58 11 2
69 11 2
71 11 1
31 10 3
57 10 1
45 10 1
38 10 2
51 10 4
56 10 2
44 9 1
74 9 2
39 9 3
49 9 1
45 9 1
44 9 1
28 8 2
16 8 2
31 8 3
38 8 1
39 8 1
35 8 3
50 8 5
28 8 3
11 8 3
30 8 1
42 8 1
33 8 2
21 7 2
38 7 4
31 7 1
34 7 1
40 7 1
48 7 4
35 7 5
29 7 3
32 7 2
20 7 4
25 7 3
13 7 2
29 7 3
16 6 3
22 6 2
28 6 3