Linux / Drivers / Parisc
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 162 units with 3,089 lines of code in units (42.7% of code).
    • 0 very complex units (0 lines of code)
    • 0 complex units (0 lines of code)
    • 11 medium complex units (647 lines of code)
    • 30 simple units (932 lines of code)
    • 121 very simple units (1,510 lines of code)
0% | 0% | 20% | 30% | 48%
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% | 20% | 30% | 48%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
ROOT0% | 0% | 20% | 30% | 48%
Most Complex Units
Top 50 most complex units
Unit# linesMcCabe index# params
100 20 1
45 18 4
68 18 1
86 18 5
26 16 2
37 14 1
90 12 1
72 12 1
18 12 2
26 12 1
79 12 1
56 10 1
29 10 5
27 10 4
47 10 1
42 9 3
27 9 5
41 9 5
27 8 3
22 8 1
25 8 1
33 8 6
21 7 1
23 7 5
24 7 5
19 7 4
55 7 2
36 6 1
37 6 1
22 6 4
31 6 1
30 6 2
30 6 3
16 6 1
17 6 2
40 6 1
25 6 1
51 6 2
20 6 5
18 6 2
41 6 1
57 5 2
24 5 2
32 5 1
40 5 1
31 5 3
30 5 3
27 5 1
20 5 3
22 5 5