openssl/crypto
Matt Caswell a2f27fd750 Move the rand_nonce_lock code into drbg_lib.c
It was previously rand_lib but it makes more sense in drbg_lib.c since
all the functions that use this lock are only ever called from drbg_lib.c

We add some FIPS_MODE defines in preparation for later moving this code
into the FIPS module.

Reviewed-by: Richard Levitte <levitte@openssl.org>
(Merged from https://github.com/openssl/openssl/pull/9039)
2019-06-07 12:04:42 +01:00
..
aes Make basic AES ciphers available from within the FIPS providers 2019-06-03 12:56:53 +01:00
aria
asn1 Add d2i_KeyParams/i2d_KeyParams API's. 2019-05-27 21:55:10 +10:00
async
bf
bio Add testing of RDONLY memory BIOs 2019-04-16 10:50:30 +01:00
blake2 Change EVP_MAC method from copy to dup 2019-06-06 17:41:42 +02:00
bn Call RSA generation callback at the correct time. 2019-04-15 22:37:48 +02:00
buffer
camellia
cast
chacha s390x assembly pack: remove chacha20 dependency on non-base memnonics 2019-04-25 23:07:36 +02:00
cmac Change EVP_MAC method from copy to dup 2019-06-06 17:41:42 +02:00
cmp Certificate Management Protocol (CMP, RFC 4210) extension to OpenSSL 2019-05-30 11:18:52 +01:00
cms Add the content type attribute to additional CMS signerinfo. 2019-06-03 15:19:48 +10:00
comp
conf crypto/conf: openssl_config_int() returns unitialized value 2019-05-29 10:41:47 +10:00
crmf Certificate Management Protocol (CMP, RFC 4210) extension to OpenSSL 2019-05-30 11:18:52 +01:00
ct
des
dh Change default RSA, DSA and DH size to 2048 bit 2019-05-21 16:44:02 +02:00
dsa The SHA256 is not a mandatory digest for DSA. 2019-05-28 17:14:47 +02:00
dso Rework DSO API conditions and configuration option 2019-04-01 06:14:50 +02:00
ec Fix various mistakes in ec_GFp_nistp_recode_scalar_bits comment. 2019-05-31 18:14:50 -04:00
engine Coverity CID 1444957: Error handling issues 2019-05-08 09:52:58 +10:00
err Replace EVP_MAC_CTX_copy() by EVP_MAC_CTX_dup() 2019-06-06 17:41:41 +02:00
ess
evp Change EVP_MAC method from copy to dup 2019-06-06 17:41:42 +02:00
gmac Change EVP_MAC method from copy to dup 2019-06-06 17:41:42 +02:00
hmac Change EVP_MAC method from copy to dup 2019-06-06 17:41:42 +02:00
idea
include/internal Convert drbg_lib to use OPENSSL_CTX for its global data 2019-06-07 12:04:34 +01:00
kdf Replace EVP_MAC_CTX_copy() by EVP_MAC_CTX_dup() 2019-06-06 17:41:41 +02:00
kmac Change EVP_MAC method from copy to dup 2019-06-06 17:41:42 +02:00
lhash Make some EVP code available from within the FIPS module 2019-05-23 11:02:04 +01:00
md2
md4
md5 Move digests to providers 2019-06-04 12:09:50 +10:00
mdc2
modes Replace EVP_MAC_CTX_copy() by EVP_MAC_CTX_dup() 2019-06-06 17:41:41 +02:00
objects Fix GOST OID 2019-05-22 19:41:09 +03:00
ocsp Join the x509 and x509v3 directories 2019-05-29 09:32:50 +02:00
pem Fix the allocation size in EVP_OpenInit and PEM_SignFinal 2019-04-06 10:17:19 +02:00
perlasm s390x assembly pack: update perlasm module 2019-04-25 23:07:36 +02:00
pkcs7
pkcs12
poly1305 Change EVP_MAC method from copy to dup 2019-06-06 17:41:42 +02:00
property Remove file reference from property documentation. 2019-06-03 16:42:50 +10:00
rand Move the rand_nonce_lock code into drbg_lib.c 2019-06-07 12:04:42 +01:00
rc2
rc4
rc5
ripemd
rsa Change default RSA, DSA and DH size to 2048 bit 2019-05-21 16:44:02 +02:00
seed
sha Move digests to providers 2019-06-04 12:09:50 +10:00
siphash Change EVP_MAC method from copy to dup 2019-06-06 17:41:42 +02:00
sm2
sm3 Move digests to providers 2019-06-04 12:09:50 +10:00
sm4
srp
stack Make core code available within the FIPS module 2019-05-23 11:02:04 +01:00
store
ts
txt_db
ui
whrlpool
x509 Replace BIO_printf with ASN1_STRING_print in GENERAL_NAME_print 2019-06-07 09:09:22 +02:00
alphacpuid.pl
arm64cpuid.pl
arm_arch.h
armcap.c
armv4cpuid.pl
bsearch.c ossl_bsearch(): New generic internal binary search utility function 2019-05-08 16:17:16 +02:00
build.info Ensure we get all the right defines for AES assembler in FIPS module 2019-06-03 12:56:53 +01:00
c64xpluscpuid.pl
context.c Make core code available within the FIPS module 2019-05-23 11:02:04 +01:00
core_fetch.c Move digests to providers 2019-06-04 12:09:50 +10:00
core_namemap.c Create internal number<->name mapping API 2019-05-12 13:43:38 -07:00
cpt_err.c Instead of global data store it in an OPENSSL_CTX 2019-05-02 22:42:09 +01:00
cryptlib.c
ctype.c
cversion.c Add the possibility to display and use MODULESDIR 2019-04-23 15:50:35 +02:00
dllmain.c
ebcdic.c
ex_data.c Coverity CID 1444951: Null pointer dereferences 2019-05-08 09:52:58 +10:00
getenv.c
ia64cpuid.S
info.c Add a way for the application to get OpenSSL configuration data 2019-04-23 15:51:39 +02:00
init.c Move the rand_nonce_lock code into drbg_lib.c 2019-06-07 12:04:42 +01:00
LPdir_nyi.c
LPdir_unix.c
LPdir_vms.c
LPdir_win32.c
LPdir_win.c
LPdir_wince.c
mem_clr.c
mem_dbg.c
mem_sec.c Use vxRandLib for VxWorks7 2019-05-02 23:32:44 +02:00
mem.c Create a FIPS provider and put SHA256 in it 2019-04-04 23:09:47 +01:00
mips_arch.h Fix compiling error for mips32r6 and mips64r6 2019-03-19 07:36:21 +01:00
o_dir.c
o_fips.c
o_fopen.c
o_init.c
o_str.c
o_time.c
params.c Params conversion tests. 2019-05-21 07:42:54 +10:00
pariscid.pl
ppc_arch.h
ppccap.c Ensure we get all the right defines for AES assembler in FIPS module 2019-06-03 12:56:53 +01:00
ppccpuid.pl
provider_conf.c Rename the PROVIDER_CONF trace to CONF 2019-04-05 12:50:55 +02:00
provider_core.c Coverity fixes 2019-06-06 09:34:17 +10:00
provider_local.h Replumbing: Add a mechanism to pre-populate the provider store 2019-03-19 14:06:58 +01:00
provider_predefined.c Make core code available within the FIPS module 2019-05-23 11:02:04 +01:00
provider.c Constify OSSL_PROVIDER getter input parameters 2019-05-31 12:05:25 +02:00
README.sparse_array
s390x_arch.h
s390xcap.c fix --strict-warnings build 2019-04-07 13:48:15 +02:00
s390xcpuid.pl
sparc_arch.h
sparccpuid.S
sparcv9cap.c Ensure we get all the right defines for AES assembler in FIPS module 2019-06-03 12:56:53 +01:00
sparse_array.c
threads_none.c
threads_pthread.c Make core code available within the FIPS module 2019-05-23 11:02:04 +01:00
threads_win.c Avoid linking error for InitializeCriticalSectionAndSpinCount(). 2019-03-29 09:51:24 +00:00
trace.c Convert the ENGINE_CONF trace calls to use CONF instead 2019-04-05 12:50:55 +02:00
uid.c
vms_rms.h
x86_64cpuid.pl
x86cpuid.pl

The sparse_array.c file contains an implementation of a sparse array that
attempts to be both space and time efficient.

The sparse array is represented using a tree structure.  Each node in the
tree contains a block of pointers to either the user supplied leaf values or
to another node.

There are a number of parameters used to define the block size:

    OPENSSL_SA_BLOCK_BITS   Specifies the number of bits covered by each block
    SA_BLOCK_MAX            Specifies the number of pointers in each block
    SA_BLOCK_MASK           Specifies a bit mask to perform modulo block size
    SA_BLOCK_MAX_LEVELS     Indicates the maximum possible height of the tree

These constants are inter-related:
    SA_BLOCK_MAX        = 2 ^ OPENSSL_SA_BLOCK_BITS
    SA_BLOCK_MASK       = SA_BLOCK_MAX - 1
    SA_BLOCK_MAX_LEVELS = number of bits in size_t divided by
                          OPENSSL_SA_BLOCK_BITS rounded up to the next multiple
                          of OPENSSL_SA_BLOCK_BITS

OPENSSL_SA_BLOCK_BITS can be defined at compile time and this overrides the
built in setting.

As a space and performance optimisation, the height of the tree is usually
less than the maximum possible height.  Only sufficient height is allocated to
accommodate the largest index added to the data structure.

The largest index used to add a value to the array determines the tree height:

        +----------------------+---------------------+
        | Largest Added Index  |   Height of Tree    |
        +----------------------+---------------------+
        | SA_BLOCK_MAX     - 1 |          1          |
        | SA_BLOCK_MAX ^ 2 - 1 |          2          |
        | SA_BLOCK_MAX ^ 3 - 1 |          3          |
        | ...                  |          ...        |
        | size_t max           | SA_BLOCK_MAX_LEVELS |
        +----------------------+---------------------+

The tree height is dynamically increased as needed based on additions.

An empty tree is represented by a NULL root pointer.  Inserting a value at
index 0 results in the allocation of a top level node full of null pointers
except for the single pointer to the user's data (N = SA_BLOCK_MAX for
breviety):

        +----+
        |Root|
        |Node|
        +-+--+
          |
          |
          |
          v
        +-+-+---+---+---+---+
        | 0 | 1 | 2 |...|N-1|
        |   |nil|nil|...|nil|
        +-+-+---+---+---+---+
          |
          |
          |
          v
        +-+--+
        |User|
        |Data|
        +----+
    Index 0


Inserting at element 2N+1 creates a new root node and pushes down the old root
node.  It then creates a second second level node to hold the pointer to the
user's new data:

        +----+
        |Root|
        |Node|
        +-+--+
          |
          |
          |
          v
        +-+-+---+---+---+---+
        | 0 | 1 | 2 |...|N-1|
        |   |nil|   |...|nil|
        +-+-+---+-+-+---+---+
          |       |
          |       +------------------+
          |                          |
          v                          v
        +-+-+---+---+---+---+      +-+-+---+---+---+---+
        | 0 | 1 | 2 |...|N-1|      | 0 | 1 | 2 |...|N-1|
        |nil|   |nil|...|nil|      |nil|   |nil|...|nil|
        +-+-+---+---+---+---+      +---+-+-+---+---+---+
          |                              |
          |                              |
          |                              |
          v                              v
        +-+--+                         +-+--+
        |User|                         |User|
        |Data|                         |Data|
        +----+                         +----+
    Index 0                       Index 2N+1


The nodes themselves are allocated in a sparse manner.  Only nodes which exist
along a path from the root of the tree to an added leaf will be allocated.
The complexity is hidden and nodes are allocated on an as needed basis.
Because the data is expected to be sparse this doesn't result in a large waste
of space.

Values can be removed from the sparse array by setting their index position to
NULL.  The data structure does not attempt to reclaim nodes or reduce the
height of the tree on removal.  For example, now setting index 0 to NULL would
result in:

        +----+
        |Root|
        |Node|
        +-+--+
          |
          |
          |
          v
        +-+-+---+---+---+---+
        | 0 | 1 | 2 |...|N-1|
        |   |nil|   |...|nil|
        +-+-+---+-+-+---+---+
          |       |
          |       +------------------+
          |                          |
          v                          v
        +-+-+---+---+---+---+      +-+-+---+---+---+---+
        | 0 | 1 | 2 |...|N-1|      | 0 | 1 | 2 |...|N-1|
        |nil|nil|nil|...|nil|      |nil|   |nil|...|nil|
        +---+---+---+---+---+      +---+-+-+---+---+---+
                                         |
                                         |
                                         |
                                         v
                                       +-+--+
                                       |User|
                                       |Data|
                                       +----+
                                  Index 2N+1


Accesses to elements in the sparse array take O(log n) time where n is the
largest element.  The base of the logarithm is SA_BLOCK_MAX, so for moderately
small indices (e.g. NIDs), single level (constant time) access is achievable.
Space usage is O(minimum(m, n log(n)) where m is the number of elements in the
array.

Note: sparse arrays only include pointers to types.  Thus, SPARSE_ARRAY_OF(char)
can be used to store a string.