microsoft / FourQlib
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 547 units with 10,751 lines of code in units (50.3% of code).
    • 0 very complex units (0 lines of code)
    • 0 complex units (0 lines of code)
    • 11 medium complex units (870 lines of code)
    • 42 simple units (1,916 lines of code)
    • 494 very simple units (7,965 lines of code)
0% | 0% | 8% | 17% | 74%
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% | 10% | 17% | 71%
h0% | 0% | 0% | 18% | 81%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
FourQ_ARM_NEON0% | 0% | 13% | 22% | 63%
FourQ_32bit0% | 0% | 12% | 19% | 68%
FourQ_ARM0% | 0% | 12% | 19% | 67%
FourQ_64bit_and_portable0% | 0% | 9% | 31% | 58%
FourQ_ARM_side_channel0% | 0% | 12% | 22% | 64%
random0% | 0% | 92% | 0% | 8%
sha5120% | 0% | 0% | 18% | 81%
FourQ_ARM_NEON/ARM0% | 0% | 0% | 1% | 98%
FourQ_32bit/generic0% | 0% | 0% | 9% | 90%
FourQ_64bit_and_portable/AMD640% | 0% | 0% | 11% | 88%
FourQ_64bit_and_portable/generic0% | 0% | 0% | 11% | 88%
FourQ_ARM/ARM0% | 0% | 0% | 13% | 86%
FourQ_ARM_side_channel/ARM0% | 0% | 0% | 13% | 86%
FourQ_64bit_and_portable/ARM640% | 0% | 0% | 15% | 84%
FourQ_ARM/libopencm30% | 0% | 0% | 0% | 100%
FourQ_ARM_side_channel/libopencm30% | 0% | 0% | 0% | 100%
FourQ_ARM/random0% | 0% | 0% | 0% | 100%
FourQ_ARM_side_channel/random0% | 0% | 0% | 0% | 100%
Most Complex Units
Top 20 most complex units
Unit# linesMcCabe index# params
bool ecc_mul_double()
in FourQ_32bit/eccp2.c
 124 20 4
bool ecc_mul_double()
in FourQ_64bit_and_portable/eccp2_core.c
 121 20 4
bool ecc_mul_double()
in FourQ_ARM/eccp2.c
 124 20 4
bool ecc_mul_double()
in FourQ_ARM_NEON/eccp2.c
 124 20 4
bool ecc_mul_double()
in FourQ_ARM_side_channel/eccp2.c
 116 19 4
ECCRYPTO_STATUS SchnorrQ_Verify()
in FourQ_32bit/schnorrq.c
 43 12 5
ECCRYPTO_STATUS SchnorrQ_Verify()
in FourQ_64bit_and_portable/schnorrq.c
 43 12 5
ECCRYPTO_STATUS SchnorrQ_Verify()
in FourQ_ARM/schnorrq.c
 43 12 5
ECCRYPTO_STATUS SchnorrQ_Verify()
in FourQ_ARM_NEON/schnorrq.c
 43 12 5
ECCRYPTO_STATUS SchnorrQ_Verify()
in FourQ_ARM_side_channel/schnorrq.c
 43 12 5
int random_bytes()
in random/random.c
 46 12 2
void Montgomery_inversion_mod_order()
in FourQ_64bit_and_portable/crypto_util.c
 58 10 2
ECCRYPTO_STATUS decode()
in FourQ_32bit/crypto_util.c
 77 8 2
__inline void vexp1251()
in FourQ_32bit/generic/fp.h
 34 8 2
__inline void fpexp1251()
in FourQ_64bit_and_portable/AMD64/fp_x64.h
 34 8 2
__inline void fpexp1251()
in FourQ_64bit_and_portable/ARM64/fp_arm64.h
 34 8 2
ECCRYPTO_STATUS decode()
in FourQ_64bit_and_portable/crypto_util.c
 72 8 2
__inline void fpexp1251()
in FourQ_64bit_and_portable/generic/fp.h
 34 8 2
__inline void fpexp1251()
in FourQ_ARM/ARM/fp_arm.h
 34 8 2
ECCRYPTO_STATUS decode()
in FourQ_ARM/crypto_util.c
 72 8 2