Linux / Drivers / Memstick
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 239 units with 5,776 lines of code in units (83.1% of code).
    • 0 very complex units (0 lines of code)
    • 0 complex units (0 lines of code)
    • 30 medium complex units (1,896 lines of code)
    • 43 simple units (1,608 lines of code)
    • 166 very simple units (2,272 lines of code)
0% | 0% | 32% | 27% | 39%
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% | 32% | 27% | 39%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
core0% | 0% | 31% | 24% | 43%
host0% | 0% | 34% | 31% | 34%
Most Complex Units
Top 50 most complex units
Unit# linesMcCabe index# params
99 23 2
79 22 1
74 19 1
65 19 2
77 18 2
66 18 6
78 18 3
54 17 5
122 17 1
98 16 1
77 15 2
49 15 1
55 15 6
55 14 2
49 14 2
43 14 1
84 14 1
55 13 6
43 13 1
46 13 3
57 13 1
50 13 3
41 12 5
52 12 6
50 12 6
50 11 1
46 11 1
51 11 3
75 11 5
56 11 2
61 10 2
52 10 1
65 10 1
68 10 1
60 10 5
32 10 3
74 10 3
34 10 3
62 10 1
73 10 2
48 9 1
31 9 6
41 9 2
29 9 1
25 8 4
32 8 6
40 8 1
42 8 1
16 8 2
66 8 1