Linux / Drivers / Cpuidle
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 254 units with 3,650 lines of code in units (74.0% of code).
    • 0 very complex units (0 lines of code)
    • 2 complex units (202 lines of code)
    • 9 medium complex units (481 lines of code)
    • 31 simple units (846 lines of code)
    • 212 very simple units (2,121 lines of code)
0% | 5% | 13% | 23% | 58%
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% | 5% | 13% | 23% | 57%
h0% | 0% | 0% | 0% | 100%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
governors0% | 35% | 23% | 17% | 23%
ROOT0% | 0% | 11% | 24% | 64%
Most Complex Units
Top 50 most complex units
Unit# linesMcCabe index# params
93 32 3
109 30 3
69 18 3
71 16 3
48 16 3
65 16 1
52 15 2
35 12 2
55 12 3
50 12 1
36 11 3
44 10 2
42 10 1
53 9 2
43 9 2
31 9 1
28 9 3
34 9 2
21 9 1
29 8 1
26 8 1
21 8 2
21 8 5
19 8 1
34 7 1
23 7 1
31 7 5
17 7 2
27 7 1
45 7 3
19 7 1
20 7 1
12 6 1
29 6 1
30 6 1
10 6 2
23 6 3
32 6 4
20 6 3
13 6 1
21 6 1
28 6 1
25 5 2
28 5 3
33 5 1
23 5 2
19 5 1
5 5 2
22 5 2
24 5 3