spotify / perf-map-agentConditional Complexity

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).

Conditional Complexity Overall

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

Conditional Complexity per Logical Component

primary logical decomposition

51+

26-50

11-25

6-10

1-5

Most Complex Units

Top 15 most complex units

Unit	# lines	McCabe index	# params
void class_name_from_sig() in src/c/perf-map-agent.c	14	7	3
void generate_unfolded_entries() in src/c/perf-map-agent.c	42	6	7
static void loadAgent() in src/java/AttachOnce.java	16	4	2
static int get_line_number() in src/c/perf-map-agent.c	6	3	3
public static void main() in src/java/AttachOnce.java	6	2	1
int perf_map_close() in src/c/perf-map-file.c	6	2	1
void perf_map_write_entry() in src/c/perf-map-file.c	4	2	4
void open_map_file() in src/c/perf-map-agent.c	4	2	0
static void sig_string() in src/c/perf-map-agent.c	18	2	4
void generate_unfolded_entry() in src/c/perf-map-agent.c	9	2	5
void close_map_file() in src/c/perf-map-agent.c	4	1	0
void generate_single_entry() in src/c/perf-map-agent.c	5	1	4
void set_notification_mode() in src/c/perf-map-agent.c	6	1	2
jvmtiError enable_capabilities() in src/c/perf-map-agent.c	12	1	1
jvmtiError set_callbacks() in src/c/perf-map-agent.c	7	1	1