Linux / Drivers / Ipack
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 73 units with 1,239 lines of code in units (68.6% of code).
    • 0 very complex units (0 lines of code)
    • 0 complex units (0 lines of code)
    • 3 medium complex units (305 lines of code)
    • 6 simple units (276 lines of code)
    • 64 very simple units (658 lines of code)
0% | 0% | 24% | 22% | 53%
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% | 24% | 22% | 53%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
devices0% | 0% | 45% | 10% | 43%
ROOT0% | 0% | 22% | 18% | 59%
carriers0% | 0% | 0% | 39% | 60%
Most Complex Units
Top 50 most complex units
Unit# linesMcCabe index# params
110 25 2
65 21 1
130 13 3
98 9 1
20 9 1
72 8 2
34 7 2
27 7 3
25 6 1
26 5 2
36 5 2
27 5 2
21 4 1
19 4 2
13 4 1
9 3 1
11 3 1
11 3 1
16 3 1
16 3 2
20 3 3
17 3 1
17 3 1
12 3 2
8 3 2
13 3 1
8 2 1
12 2 1
15 2 1
10 2 1
14 2 3
16 2 1
8 2 1
8 2 2
7 2 1
8 2 2
10 2 3
15 2 1
17 2 1
8 1 3
8 1 3
10 1 1
7 1 2
7 1 2
5 1 1
4 1 1
10 1 1
5 1 1
9 1 1
8 1 2