Linux / Drivers / Dma-buf
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 224 units with 3,634 lines of code in units (66.2% of code).
    • 0 very complex units (0 lines of code)
    • 1 complex units (118 lines of code)
    • 7 medium complex units (389 lines of code)
    • 26 simple units (823 lines of code)
    • 190 very simple units (2,304 lines of code)
0% | 3% | 10% | 22% | 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% | 3% | 10% | 22% | 63%
h0% | 0% | 0% | 0% | 100%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
ROOT0% | 3% | 11% | 24% | 59%
heaps0% | 0% | 0% | 0% | 100%
Most Complex Units
Top 50 most complex units
Unit# linesMcCabe index# params
118 26 3
52 14 1
61 13 2
70 12 1
66 12 2
49 12 2
46 11 3
45 11 2
46 10 1
39 10 3
36 10 4
56 9 2
18 9 3
35 9 2
38 9 2
21 8 3
31 8 3
44 8 2
24 8 1
27 7 1
43 7 3
43 7 1
36 7 1
27 7 1
42 7 2
20 7 2
28 6 1
30 6 1
26 6 1
16 6 3
18 6 2
26 6 1
16 6 2
37 6 2
17 5 1
22 5 3
26 5 1
26 5 1
30 5 1
25 5 1
17 5 3
27 5 2
19 5 2
12 5 2
40 5 2
22 4 1
22 4 1
23 4 1
21 4 1
23 4 1