microsoft / DMF
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 4 units with 117 lines of code in units (0.1% of code).
    • 0 very complex units (0 lines of code)
    • 0 complex units (0 lines of code)
    • 0 medium complex units (0 lines of code)
    • 1 simple units (65 lines of code)
    • 3 very simple units (52 lines of code)
0% | 0% | 0% | 55% | 44%
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% | 0% | 69% | 30%
cpp0% | 0% | 0% | 0% | 100%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
Dmf/Modules.Library0% | 0% | 0% | 55% | 44%
Most Complex Units
Top 4 most complex units
Unit# linesMcCabe index# params
_Out_ __deref_bcount()
in Dmf/Modules.Library/Dmf_ResourceHub.c
65 9 1
NTSTATUS MobileCodeCalulate()
in Dmf/Modules.Library/Dmf_MobileBroadband.cpp
23 4 4
typedef DWORD()
in Dmf/Modules.Library/Dmf_Registry.c
13 1 1
typedef void()
in Dmf/Modules.Library/Dmf_RingBuffer.c
16 1 1