openssl/crypto
Lei Maohui 7b0fceed21 Fix build error for aarch64 big endian.
Modified rev to rev64, because rev only takes integer registers.
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=90827
Otherwise, the following error will occur.

Error: operand 1 must be an integer register -- `rev v31.16b,v31.16b'

CLA: trivial

Signed-off-by: Lei Maohui <leimaohui@cn.fujitsu.com>

Reviewed-by: Shane Lontis <shane.lontis@oracle.com>
Reviewed-by: Richard Levitte <levitte@openssl.org>
(Merged from https://github.com/openssl/openssl/pull/9151)
2019-07-08 10:53:02 +02:00
..
aes Fix Typos 2019-07-02 14:22:29 +02:00
aria
asn1 Fix ASN1_TYPE_get/set with type=V_ASN1_BOOLEAN 2019-07-02 16:22:02 +02:00
async Provide an ability to deregister thread stop handlers 2019-06-19 11:54:34 +01:00
bf Move bf_asm_src file information to build.info files 2019-06-17 16:08:52 +02:00
bio Fix Typos 2019-07-02 14:22:29 +02:00
blake2 Change EVP_MAC method from copy to dup 2019-06-06 17:41:42 +02:00
bn Fix an endless loop in BN_generate_prime_ex 2019-07-07 08:05:33 +02:00
buffer
camellia Move cmll_asm_src file information to build.info files 2019-06-17 16:08:53 +02:00
cast Move cast_asm_src file information to build.info files 2019-06-17 16:08:52 +02:00
chacha Move chacha_asm_src file information to build.info files 2019-06-17 16:08:53 +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 Remove DES_check_key global 2019-07-01 19:42:12 -04:00
dh TLS1.3 FFDHE Support 2019-06-12 10:18:34 +01:00
dsa Fix Typos 2019-07-02 14:22:29 +02:00
dso Rework DSO API conditions and configuration option 2019-04-01 06:14:50 +02:00
ec Fix Typos 2019-07-02 14:22:29 +02:00
engine Coverity CID 1444957: Error handling issues 2019-05-08 09:52:58 +10:00
err Provide rand_bytes_ex and rand_priv_bytes_ex 2019-07-02 16:49:18 +01:00
ess constify *_dup() and *i2d_*() and related functions as far as possible, introducing DECLARE_ASN1_DUP_FUNCTION 2019-03-06 16:10:09 +00:00
evp ossl_provider_upref to ossl_provider_up_ref 2019-07-02 16:30:56 +02:00
gmac Change EVP_MAC method from copy to dup 2019-06-06 17:41:42 +02:00
hmac Make the RAND code available from inside the FIPS module 2019-06-28 10:22:21 +01:00
idea
include/internal Provide rand_bytes_ex and rand_priv_bytes_ex 2019-07-02 16:49:18 +01:00
kdf PBKDF2 updates to conform to SP800-132 2019-06-11 20:40:07 +10:00
kmac Change EVP_MAC method from copy to dup 2019-06-06 17:41:42 +02:00
lhash Fix Typos 2019-07-02 14:22:29 +02:00
md2
md4
md5 Move md5_asm_src file information to build.info files 2019-06-17 16:08:52 +02:00
mdc2
modes Move the public SIV mode functions from public headers to internal ones 2019-06-27 09:47:23 +01:00
objects Add OIDs for kmac128, kmac256 and blake2. 2019-07-01 17:41:31 +10: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 constify *_dup() and *i2d_*() and related functions as far as possible, introducing DECLARE_ASN1_DUP_FUNCTION 2019-03-06 16:10:09 +00:00
pkcs12 constify *_dup() and *i2d_*() and related functions as far as possible, introducing DECLARE_ASN1_DUP_FUNCTION 2019-03-06 16:10:09 +00:00
poly1305 Fix Typos 2019-07-02 14:22:29 +02:00
property Add extra error text in the property parser 2019-06-19 11:25:27 +02:00
rand Provide rand_bytes_ex and rand_priv_bytes_ex 2019-07-02 16:49:18 +01:00
rc2
rc4 Move rc4_asm_src file information to build.info files 2019-06-17 16:08:52 +02:00
rc5 Change RC5_32_set_key to return an int type 2019-07-01 10:18:37 +01:00
ripemd Move rmd160_asm_src file information to build.info files 2019-06-17 16:08:52 +02:00
rsa Fix Typos 2019-07-02 14:22:29 +02:00
seed
sha Fix build error for aarch64 big endian. 2019-07-08 10:53:02 +02:00
siphash Change EVP_MAC method from copy to dup 2019-06-06 17:41:42 +02:00
sm2 Fix Typos 2019-07-02 14:22:29 +02:00
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 Fix Typos 2019-07-02 14:22:29 +02:00
ts constify *_dup() and *i2d_*() and related functions as far as possible, introducing DECLARE_ASN1_DUP_FUNCTION 2019-03-06 16:10:09 +00:00
txt_db
ui Remove NextStep support 2019-07-01 13:32:46 -04:00
whrlpool Move wp_asm_src file information to build.info files 2019-06-17 16:08:52 +02:00
x509 Check for V_ASN1_BOOLEAN/V_ASN1_NULL in X509_ATTRIBUTE_get0_data 2019-07-02 16:22:02 +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 Tell the FIPS provider about thread stop events 2019-06-17 16:19:44 +01:00
c64xpluscpuid.pl
context.c Tell the FIPS provider about thread stop events 2019-06-17 16:19:44 +01:00
core_fetch.c EVP fetching: make operation_id part of the method identity 2019-06-10 08:01:19 +02:00
core_namemap.c OSSL_NAMEMAP: make names case insensitive 2019-06-24 10:58:13 +02: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 Fix NULL pointer dereference in the ex_data code 2019-06-28 10:22:21 +01: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 Provide an ability to deregister thread stop handlers 2019-06-19 11:54:34 +01:00
initthread.c Fix Typos 2019-07-02 14:22:29 +02: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 Print thread IDs nicely. 2019-06-21 08:29:44 +10:00
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 Remove OPENSSL_memcmp. 2019-06-21 10:03:55 +10:00
o_time.c
params.c Change OSSL_PARAM return size to not be a pointer. 2019-06-24 14:43:55 +10:00
pariscid.pl
ppc_arch.h
ppccap.c crypto/ppccap.c: Fix FIPS build on PPC 2019-06-17 09:43:21 +02:00
ppccpuid.pl
provider_conf.c Rename the PROVIDER_CONF trace to CONF 2019-04-05 12:50:55 +02:00
provider_core.c FIPS module: adapt for the changed error reporting methods 2019-07-02 17:02:02 +02: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 Change OSSL_PARAM return size to not be a pointer. 2019-06-24 14:43:55 +10:00
README.sparse_array Fix Typos 2019-07-02 14:22:29 +02:00
s390x_arch.h s390x assembly pack: add support for pcc and kma instructions 2019-06-29 23:13:45 +02:00
s390xcap.c s390x assembly pack: add support for pcc and kma instructions 2019-06-29 23:13:45 +02:00
s390xcpuid.pl s390x assembly pack: add support for pcc and kma instructions 2019-06-29 23:13:45 +02:00
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 Fix Typos 2019-07-02 14:22:29 +02:00
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 crypto/trace.c: Remove unexisting categories 2019-06-22 21:11:52 +02:00
uid.c Remove NextStep support 2019-07-01 13:32:46 -04:00
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
brevity):

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