Linux / Ipc
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 240 units with 4,780 lines of code in units (70.9% of code).
    • 0 very complex units (0 lines of code)
    • 3 complex units (429 lines of code)
    • 19 medium complex units (1,244 lines of code)
    • 29 simple units (1,040 lines of code)
    • 189 very simple units (2,067 lines of code)
0% | 8% | 26% | 21% | 43%
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% | 9% | 26% | 22% | 42%
h0% | 0% | 0% | 0% | 100%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
ROOT0% | 8% | 26% | 21% | 43%
Most Complex Units
Top 50 most complex units
Unit# linesMcCabe index# params
152 38 5
146 30 5
131 27 5
64 23 6
108 23 2
79 22 6
103 21 6
48 20 5
50 19 4
50 19 4
41 19 5
84 18 5
92 16 5
39 15 4
38 15 4
79 15 5
84 14 2
61 14 3
48 14 1
72 13 1
58 12 2
46 12 2
60 10 4
59 10 4
56 10 4
21 9 3
43 9 1
55 8 5
39 8 3
49 8 4
44 8 4
35 8 3
28 7 4
17 7 3
40 7 1
45 7 2
26 7 4
31 7 3
23 7 5
27 7 4
37 7 2
19 6 3
17 6 2
32 6 2
42 6 4
15 6 4
42 6 4
38 6 1
39 6 3
37 6 4