Linux / Drivers / Pps
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 53 units with 939 lines of code in units (74.4% of code).
    • 0 very complex units (0 lines of code)
    • 0 complex units (0 lines of code)
    • 1 medium complex units (106 lines of code)
    • 8 simple units (308 lines of code)
    • 44 very simple units (525 lines of code)
0% | 0% | 11% | 32% | 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% | 0% | 11% | 32% | 55%
h0% | 0% | 0% | 0% | 100%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
ROOT0% | 0% | 23% | 9% | 67%
clients0% | 0% | 0% | 61% | 38%
generators0% | 0% | 0% | 35% | 64%
Most Complex Units
Top 50 most complex units
Unit# linesMcCabe index# params
106 24 3
17 10 2
52 9 1
47 8 1
29 7 1
42 7 4
18 6 3
42 6 1
61 6 1
32 5 2
29 5 2
33 5 3
44 5 1
13 4 2
29 4 1
32 3 1
14 3 1
9 3 3
22 3 1
13 3 2
7 3 3
16 3 1
9 2 1
19 2 1
13 2 1
10 2 3
10 2 3
12 2 1
19 2 1
9 2 1
8 2 1
6 1 1
9 1 1
4 1 1
4 1 1
7 1 1
6 1 1
6 1 3
6 1 3
6 1 3
6 1 3
6 1 2
5 1 3
8 1 2
7 1 2
11 1 1
6 1 1
5 1 1
5 1 1
5 1 1