Linux / Drivers / Rpmsg
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 203 units with 3,305 lines of code in units (67.6% of code).
    • 0 very complex units (0 lines of code)
    • 0 complex units (0 lines of code)
    • 8 medium complex units (550 lines of code)
    • 17 simple units (714 lines of code)
    • 178 very simple units (2,041 lines of code)
0% | 0% | 16% | 21% | 61%
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% | 16% | 21% | 61%
h0% | 0% | 0% | 0% | 100%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
ROOT0% | 0% | 16% | 21% | 61%
Most Complex Units
Top 50 most complex units
Unit# linesMcCabe index# params
76 20 4
67 18 2
90 12 2
94 11 1
41 11 1
44 11 4
77 11 3
61 11 5
45 10 1
46 10 1
56 9 6
63 9 3
50 9 1
43 9 1
32 9 2
44 7 4
50 7 4
32 7 1
45 7 1
33 7 2
34 6 5
33 6 6
12 6 2
52 6 2
44 6 1
18 5 1
18 5 1
23 5 1
20 5 5
16 5 2
33 5 2
24 4 5
29 4 2
17 4 3
28 4 4
29 4 3
11 4 2
12 4 1
25 4 2
25 4 1
16 4 4
15 4 4
20 4 4
19 4 4
23 4 5
22 4 1
23 3 3
20 3 1
16 3 1
35 3 2