Linux / Drivers / Idle
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 23 units with 384 lines of code in units (27.3% of code).
    • 0 very complex units (0 lines of code)
    • 0 complex units (0 lines of code)
    • 2 medium complex units (115 lines of code)
    • 4 simple units (107 lines of code)
    • 17 very simple units (162 lines of code)
0% | 0% | 29% | 27% | 42%
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% | 29% | 27% | 42%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
ROOT0% | 0% | 29% | 27% | 42%
Most Complex Units
Top 23 most complex units
Unit# linesMcCabe index# params
48 19 1
67 19 1
27 7 1
24 6 1
35 6 1
21 6 1
12 4 1
16 4 1
11 4 1
15 4 1
12 3 1
11 3 1
10 3 1
11 2 3
8 2 1
7 2 1
11 2 1
9 2 1
8 1 3
1 1 1
7 1 1
7 1 1
6 1 1