microsoft / mu_tiano_plus
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 114 units with 1,702 lines of code in units (2.2% of code).
    • 0 very complex units (0 lines of code)
    • 0 complex units (0 lines of code)
    • 7 medium complex units (345 lines of code)
    • 17 simple units (413 lines of code)
    • 90 very simple units (944 lines of code)
0% | 0% | 20% | 24% | 55%
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% | 21% | 25% | 52%
h0% | 0% | 0% | 0% | 100%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
EmbeddedPkg/Library0% | 0% | 21% | 25% | 52%
SecurityPkg/Library0% | 0% | 0% | 100% | 0%
EmbeddedPkg/Include0% | 0% | 0% | 0% | 100%
EmbeddedPkg/Universal0% | 0% | 0% | 0% | 100%
Most Complex Units
Top 20 most complex units
Unit# linesMcCabe index# params
static int overlay_symbol_update()
in EmbeddedPkg/Library/FdtLib/fdt_overlay.c
 85 22 2
int fdt_next_node()
in EmbeddedPkg/Library/FdtLib/fdt.c
 32 15 3
int fdt_get_path()
in EmbeddedPkg/Library/FdtLib/fdt_ro.c
 43 15 4
static int overlay_fixup_phandle()
in EmbeddedPkg/Library/FdtLib/fdt_overlay.c
 52 14 4
uint32_t fdt_next_tag()
in EmbeddedPkg/Library/FdtLib/fdt.c
 40 12 3
static int overlay_update_local_node_references()
in EmbeddedPkg/Library/FdtLib/fdt_overlay.c
 65 11 4
int fdt_supernode_atdepth_offset()
in EmbeddedPkg/Library/FdtLib/fdt_ro.c
 28 11 4
int fdt_open_into()
in EmbeddedPkg/Library/FdtLib/fdt_rw.c
 48 10 3
static int overlay_get_target()
in EmbeddedPkg/Library/FdtLib/fdt_overlay.c
 25 9 4
int fdt_path_offset_namelen()
in EmbeddedPkg/Library/FdtLib/fdt_ro.c
 33 9 3
static int overlay_apply_node()
in EmbeddedPkg/Library/FdtLib/fdt_overlay.c
 38 8 4
static int overlay_fixup_one_phandle()
in EmbeddedPkg/Library/FdtLib/fdt_overlay.c
 34 7 9
int fdt_check_header()
in EmbeddedPkg/Library/FdtLib/fdt.c
 15 6 1
int fdt_create_empty_tree()
in EmbeddedPkg/Library/FdtLib/fdt_empty_tree.c
 20 6 2
static int overlay_adjust_node_phandles()
in EmbeddedPkg/Library/FdtLib/fdt_overlay.c
 18 6 3
static int overlay_fixup_phandles()
in EmbeddedPkg/Library/FdtLib/fdt_overlay.c
 20 6 2
static int get_path_len()
in EmbeddedPkg/Library/FdtLib/fdt_overlay.c
 20 6 2
int fdt_overlay_apply()
in EmbeddedPkg/Library/FdtLib/fdt_overlay.c
 28 6 2
static int _fdt_nodename_eq()
in EmbeddedPkg/Library/FdtLib/fdt_ro.c
 15 6 4
uint32_t fdt_get_max_phandle()
in EmbeddedPkg/Library/FdtLib/fdt_ro.c
 19 6 1