corretto / amazon-corretto-crypto-provider
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 425 units with 5,094 lines of code in units (59.4% of code).
    • 0 very complex units (0 lines of code)
    • 2 complex units (205 lines of code)
    • 12 medium complex units (843 lines of code)
    • 32 simple units (1,054 lines of code)
    • 379 very simple units (2,992 lines of code)
0% | 4% | 16% | 20% | 58%
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
cpp0% | 8% | 19% | 27% | 44%
java0% | 2% | 16% | 20% | 60%
h0% | 0% | 0% | 0% | 100%
cxx0% | 0% | 0% | 0% | 100%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
csrc0% | 7% | 15% | 21% | 55%
src/com/amazon/corretto/crypto/provider0% | 2% | 18% | 22% | 56%
template-src/com/amazon/corretto/crypto/provider0% | 0% | 0% | 0% | 100%
tst/com/amazon/corretto/crypto/provider/coverage0% | 0% | 0% | 0% | 100%
CMake/trycompile0% | 0% | 0% | 0% | 100%
Most Complex Units
Top 20 most complex units
Unit# linesMcCabe index# params
128 32 20
protected synchronized void engineInit()
in src/com/amazon/corretto/crypto/provider/AesGcmSpi.java
77 30 4
public static void testMac()
in src/com/amazon/corretto/crypto/provider/Utils.java
83 20 4
public static void testDigest()
in src/com/amazon/corretto/crypto/provider/Utils.java
82 20 3
protected synchronized int engineDoFinal()
in src/com/amazon/corretto/crypto/provider/AesGcmSpi.java
152 18 5
bool drbg_getentropy()
in csrc/aes_ctr_drbg.cpp
61 17 2
94 16 11
static
in src/com/amazon/corretto/crypto/provider/Loader.java
88 14 0
protected int engineDoFinal()
in src/com/amazon/corretto/crypto/provider/RsaCipher.java
56 14 5
bool rdseed_fallback()
in csrc/rdrand.cpp
66 13 1
protected SecretKey engineGenerateSecret()
in src/com/amazon/corretto/crypto/provider/EvpKeyAgreement.java
42 12 1
public void update()
in src/com/amazon/corretto/crypto/provider/InputBuffer.java
31 11 1
protected void engineInit()
in src/com/amazon/corretto/crypto/provider/RsaCipher.java
27 11 4
61 11 14
private synchronized static Path createTmpFile()
in src/com/amazon/corretto/crypto/provider/Loader.java
48 10 2
private void parseKey()
in src/com/amazon/corretto/crypto/provider/RsaCipher.java
53 10 0
static boolean buffersMaybeOverlap()
in src/com/amazon/corretto/crypto/provider/Utils.java
25 10 2
static int cryptFinish()
in csrc/aes_gcm.cpp
32 10 5
private static int checkMode()
in src/com/amazon/corretto/crypto/provider/RsaCipher.java
25 9 2
private static native boolean verify()
in src/com/amazon/corretto/crypto/provider/EvpSignature.java
123 9 13