Linux / Drivers / Bcma
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 243 units with 4,050 lines of code in units (86.3% of code).
    • 0 very complex units (0 lines of code)
    • 1 complex units (131 lines of code)
    • 13 medium complex units (761 lines of code)
    • 29 simple units (923 lines of code)
    • 200 very simple units (2,235 lines of code)
0% | 3% | 18% | 22% | 55%
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% | 3% | 19% | 23% | 54%
h0% | 0% | 0% | 0% | 100%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
ROOT0% | 3% | 18% | 22% | 55%
Most Complex Units
Top 50 most complex units
Unit# linesMcCabe index# params
131 49 5
154 25 2
37 23 1
56 22 1
68 18 6
69 15 1
55 14 6
50 14 1
64 13 1
56 12 1
35 12 1
15 12 2
48 11 6
54 11 2
100 10 1
34 10 1
56 10 1
58 10 2
44 10 1
20 9 1
20 9 1
28 9 1
33 9 1
23 9 2
23 8 4
27 8 2
20 8 2
21 8 2
38 7 5
39 7 5
38 7 2
33 7 1
27 7 1
26 7 2
24 7 1
30 6 1
20 6 1
25 6 1
24 6 3
19 6 1
17 6 1
37 6 1
19 6 1
13 5 2
17 5 3
25 5 1
22 5 4
38 5 1
18 5 2
17 5 1