microsoft / PQCrypto-SIDH
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 303 units with 7,394 lines of code in units (11.5% of code).
    • 1 very complex units (401 lines of code)
    • 0 complex units (0 lines of code)
    • 6 medium complex units (417 lines of code)
    • 22 simple units (744 lines of code)
    • 274 very simple units (5,832 lines of code)
5% | 0% | 5% | 10% | 78%
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
c5% | 0% | 5% | 10% | 78%
h0% | 0% | 0% | 0% | 100%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
src19% | 0% | 0% | 5% | 75%
src/compression0% | 0% | 24% | 15% | 60%
src/P7510% | 0% | 0% | 7% | 92%
src/P6100% | 0% | 0% | 9% | 90%
src/P5030% | 0% | 0% | 10% | 89%
src/P4340% | 0% | 0% | 12% | 87%
src/random0% | 0% | 0% | 87% | 12%
src/sha30% | 0% | 0% | 6% | 93%
Most Complex Units
Top 20 most complex units
Unit# linesMcCabe index# params
401 186 1
int ord2w_dloghyb()
in src/compression/dlog.c
 69 20 4
void Traverse_w_notdiv_e_fullsigned()
in src/compression/dlog.c
 78 20 14
void from_base()
in src/compression/dlog.c
 69 17 4
void Traverse_w_div_e_fullsigned()
in src/compression/dlog.c
 53 14 10
int ord2w_dlog()
in src/compression/dlog.c
 39 12 3
void Tate2_pairings()
in src/compression/pairing.c
 109 11 4
static bool FirstPoint_dual()
in src/compression/torsion_basis.c
 45 10 3
54 10 3
54 10 4
void rdc_mont()
in src/P434/generic/fp_generic.c
 47 9 2
void rdc_mont()
in src/P503/generic/fp_generic.c
 47 9 2
void rdc_mont()
in src/P610/generic/fp_generic.c
 47 9 2
void rdc_mont()
in src/P751/generic/fp_generic.c
 47 9 2
static void Elligator2()
in src/compression/torsion_basis.c
 56 8 5
int randombytes()
in src/random/random.c
 29 8 2
inline void mp_sub434_p2()
in src/P434/AMD64/fp_x64.c
 15 7 3
inline void mp_sub434_p4()
in src/P434/AMD64/fp_x64.c
 15 7 3
inline void mp_sub503_p2()
in src/P503/AMD64/fp_x64.c
 15 7 3
inline void mp_sub503_p4()
in src/P503/AMD64/fp_x64.c
 15 7 3