| /optee_os/lib/libmbedtls/mbedtls/ |
| H A D | LICENSE | 3 This means that users may choose which of these licenses they take the code
6 The full text of each of these licenses is given below.
18 and distribution as defined by Sections 1 through 9 of this document.
23 "Legal Entity" shall mean the union of the acting entity and all
25 control with that entity. For the purposes of this definition,
27 direction or management of such entity, whether by contract or
28 otherwise, or (ii) ownership of fifty percent (50%) or more of the
29 outstanding shares, or (iii) beneficial ownership of such entity.
39 transformation or translation of a Source form, including but
43 "Work" shall mean the work of authorship, whether in Source or
[all …]
|
| /optee_os/lib/libmbedtls/mbedtls/library/ |
| H A D | bignum_core.h | 10 * bound that's of the form 2^n-1 where n is a multiple of #biL.
11 * These can be thought of integers written in base 2^#biL with a fixed
12 * number of digits. Digits in this base are called *limbs*.
13 * Many operations treat these numbers as the principal representation of
23 * - **Bignum parameters**: Bignums are passed as pointers to an array of
30 * The initial content of output-only parameters is ignored.
32 * naming of operands of certain operations (e.g.
34 * - \p T is a temporary storage area. The initial content of such
37 * Most functions work on bignums of a given size and take a single
41 * total size of all parameters overflows #SIZE_MAX is undefined.
[all …]
|
| H A D | bignum_mod_raw.h | 10 * has no protection against passing invalid arguments such as arrays of
13 * expense of code size and sometimes more cumbersome memory management.
18 * of type #mbedtls_mpi_mod_modulus. The structure must be set up with an
19 * array of limbs storing the bignum value of the modulus. The modulus must
22 * - **Bignum parameters**: Bignums are passed as pointers to an array of
27 * The initial content of output-only parameters is ignored.
28 * - \c T is a temporary storage area. The initial content of such a
31 * member of the modulus argument. All bignum parameters must have the same
32 * number of limbs as the modulus. All bignum sizes must be at least 1 and
35 * - **Bignum representation**: the representation of inputs and outputs is
[all …]
|
| H A D | psa_crypto_core.h | 15 * is basically just an alias to it. This is to ease the maintenance of the
30 * \note For now, only checks the state of the driver subsystem,
50 /* This field is accessed in a lot of places. Putting it first
55 * The current state of the key slot, as described in
58 * Library functions can modify the state of a key slot by calling
63 * which transfers the state of a slot from PSA_SLOT_FILLING to
65 * if the state of the slot is not PSA_SLOT_FILLING.
67 * Library functions which traverse the array of key slots only consider
76 /* The index of the slice containing this slot.
93 /* The index of the next slot in the free list for this
[all …]
|
| H A D | bignum_mod.h | 10 * of type #mbedtls_mpi_mod_modulus. The structure must be set up with an
11 * array of limbs storing the bignum value of the modulus. The modulus must
14 * of type \c const #mbedtls_mpi_mod_modulus* must not modify its value.
15 * - **Bignum parameters**: Bignums are passed as pointers to an array of
20 * modified by the function. Functions which take a parameter of
23 * The initial bignum value of output-only parameters is ignored, but
28 * residue. These must be pointers to an array of limbs.
29 * - \c T is a temporary storage area. The initial content of such a
35 * number of limbs as the modulus. All bignum sizes must be at least 1 and
38 * - **Bignum representation**: the representation of inputs and outputs is
[all …]
|
| H A D | psa_crypto_ecp.h | 2 * PSA ECP layer on top of Mbed TLS crypto
15 /** Load the contents of a key buffer into an internal ECP representation
17 * \param[in] type The type of key contained in \p data.
18 * \param[in] curve_bits The nominal bit-size of the curve.
27 * \param[in] data_length The size in bytes of \p data.
30 * contents of the context and the context itself
39 /** Load the public part of an internal ECP, if required.
50 * \note The signature of this function is that of a PSA driver
58 * \param[in] data_length Size of the \p data buffer in bytes.
61 * \param[in] key_buffer_size Size of the \p key_buffer buffer in bytes. This
[all …]
|
| H A D | psa_crypto_aead.h | 17 * \note The signature of this function is that of a PSA driver
22 * \param[in] attributes The attributes of the key to use for the
25 * \param key_buffer_size Size of the \p key_buffer buffer in bytes.
28 * \param nonce_length Size of the nonce buffer in bytes. This must
32 * key_type is the type of key.
35 * \param additional_data_length Size of additional_data in bytes.
37 * \param plaintext_length Size of plaintext in bytes.
40 * part of this output. For algorithms where the
45 * \param ciphertext_size Size of the ciphertext buffer in bytes. This
51 * of key.
[all …]
|
| H A D | ecp_invasive.h | 41 * \return The id of the ecp variant.
49 * This function implements key generation for the set of secret keys
56 * \p high_bit The position of the high-order bit of the key to generate.
57 * This is the bit-size of the key minus 1:
59 * \param d The randomly generated key. This is a number of size
79 * This operation expects a 384 bit MPI and the result of the reduction
82 * \param[in,out] Np The address of the MPI to be converted.
85 * of the reduced value is the same as that of the modulus
87 * \param[in] Nn The length of \p Np in limbs.
98 * \param[in,out] X The address of the MPI to be converted.
[all …]
|
| H A D | psa_crypto_rsa.h | 2 * PSA RSA layer on top of Mbed TLS crypto
15 /** Load the contents of a key buffer into an internal RSA representation
17 * \param[in] type The type of key contained in \p data.
19 * \param[in] data_length The size in bytes of \p data.
22 * contents of the context and the context itself
32 * \note The signature of this function is that of a PSA driver
40 * \param[in] data_length Size of the \p data buffer in bytes.
43 * \param[in] key_buffer_size Size of the \p key_buffer buffer in bytes. This
45 * \param[out] key_buffer_length The length of the data written in \p
47 * \param[out] bits The key size in number of bits.
[all …]
|
| H A D | psa_crypto_cipher.h | 16 * as well as the PSA type and size of the key to be used with the cipher
21 * \param[in,out] key_bits Size of the key in bits. The value provided in input
38 * as well as the PSA type and size of the key to be used with the cipher
43 * \param key_bits Size of the key in bits
46 * \return The Mbed TLS cipher information of the cipher algorithm.
57 * \note The signature of this function is that of a PSA driver
65 * \param[in] attributes The attributes of the key to use for the
68 * \param[in] key_buffer_size Size of the \p key_buffer buffer in bytes.
87 * \note The signature of this function is that of a PSA driver
95 * \param[in] attributes The attributes of the key to use for the
[all …]
|
| H A D | psa_crypto_ffdh.h | 2 * PSA FFDH layer on top of Mbed TLS crypto
16 * \param[in] attributes The attributes of the key to use for the
19 * of the peer's public key.
20 * \param[in] peer_key_length Size of the \p peer_key buffer in
24 * \param[in] key_buffer_size Size of the \p key_buffer buffer in
28 * \param[in] shared_secret_size Size of the \p shared_secret buffer in
30 * \param[out] shared_secret_length On success, the number of bytes that make
50 /** Export a public key or the public part of a DH key pair in binary format.
53 * \param[in] key_buffer Material or context of the key to export.
54 * \param[in] key_buffer_size Size of the \p key_buffer buffer in bytes.
[all …]
|
| H A D | ssl_tls13_keys.h | 11 * the point of use. See e.g. the definition of mbedtls_ssl_tls13_labels_union
64 /* Maximum length of the label field in the HkdfLabel struct defined in
68 /* The maximum length of HKDF contexts used in the TLS 1.3 standard.
69 * Since contexts are always hashes of message transcripts, this can
76 * bytes of key material where hash_size is the output size of the
92 * This must be a readable buffer of length
94 * \param secret_len The length of \p secret in Bytes.
96 * This must be a readable buffer of length
98 * \param label_len The length of \p label in Bytes.
100 * This must be a readable buffer of length \p ctx_len Bytes.
[all …]
|
| /optee_os/lib/libutils/compiler-rt/ |
| H A D | LICENSE.TXT | 14 and distribution as defined by Sections 1 through 9 of this document.
19 "Legal Entity" shall mean the union of the acting entity and all
21 control with that entity. For the purposes of this definition,
23 direction or management of such entity, whether by contract or
24 otherwise, or (ii) ownership of fifty percent (50%) or more of the
25 outstanding shares, or (iii) beneficial ownership of such entity.
35 transformation or translation of a Source form, including but
39 "Work" shall mean the work of authorship, whether in Source or
47 represent, as a whole, an original work of authorship. For the purposes
48 of this License, Derivative Works shall not include works that remain
[all …]
|
| /optee_os/lib/libutee/arch/arm/gprof/ |
| H A D | gmon.h | 9 * 1. Redistributions of source code must retain the above copyright notice,
10 * this list of conditions and the following disclaimer.
13 * this list of conditions and the following disclaimer in the documentation
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
22 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
23 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
26 * POSSIBILITY OF SUCH DAMAGE.
33 * The Regents of the University of California. All rights reserved.
[all …]
|
| H A D | gmon_out.h | 9 * 1. Redistributions of source code must retain the above copyright notice,
10 * this list of conditions and the following disclaimer.
13 * this list of conditions and the following disclaimer in the documentation
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
22 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
23 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
26 * POSSIBILITY OF SUCH DAMAGE.
38 * The object code form of an Application may incorporate material from a
[all …]
|
| /optee_os/core/lib/zlib/ |
| H A D | zlib.h | 2 /* zlib.h -- interface of the 'zlib' general purpose compression library
9 arising from the use of this software.
15 1. The origin of this software must not be misrepresented; you must not
50 decompression functions, including integrity checks of the uncompressed data.
51 This version of the library supports only one compression method (deflation)
56 or can be done by repeated calls of the compression function. In the latter
65 with an interface similar to that of stdio using the functions that start
78 the consistency of the compressed data, so the library should never crash
79 even in the case of corrupted input.
82 typedef voidpf (*alloc_func) OF((voidpf opaque, uInt items, uInt size));
[all …]
|
| H A D | inftrees.h | 4 * For conditions of distribution and use, see copyright notice in zlib.h
8 part of the implementation of the compression library and is
15 table that indexes more bits of the code. op indicates whether
17 distance, an end-of-block, or an invalid code. For a table
18 pointer, the low four bits of op is the number of index bits of
19 that table. For a length or distance, the low four bits of op
20 is the number of extra bits to get after the code. bits is
21 the number of bits in this code or part of the code to drop off
22 of the bit buffer. val is the actual byte to output in the case
23 of a literal, the base length or distance, or the offset from
[all …]
|
| /optee_os/lib/libmbedtls/mbedtls/include/mbedtls/ |
| H A D | asn1write.h | 47 * \param start The start of the buffer, for bounds-checking.
50 * \return The number of bytes written to \p p on success.
61 * \param start The start of the buffer, for bounds-checking.
64 * \return The number of bytes written to \p p on success.
78 * \param start The start of the buffer, for bounds-checking.
80 * \param size The length of the data buffer.
82 * \return The number of bytes written to \p p on success.
96 * \param start The start of the buffer, for bounds-checking.
100 * \return The number of bytes written to \p p on success.
114 * \param start The start of the buffer, for bounds-checking.
[all …]
|
| H A D | asn1.h | 36 /** Out of data when parsing an ASN1 data structure. */
38 /** ASN1 tag was of an unexpected value. */
97 * Bit masks for each of the components of an ASN.1 tag as specified in
112 /** Returns the size of the binary string, without the trailing \\0 */
153 unsigned char unused_bits; /**< Number of unused bits at the end of the string */
159 * Container for a sequence of ASN.1 items
166 * The details of memory management for sequences are not documented and
176 * Container for a sequence or list of 'named' ASN.1 data items
184 * The details of memory management for named data sequences are not
193 * This field exists for the sake of Mbed TLS's X.509 certificate parsing
[all …]
|
| H A D | ccm.h | 17 * Definition of CCM:
24 * Definition of CCM*:
27 * the representation of octets is most-significant-bit-first order. This is
75 size_t MBEDTLS_PRIVATE(processed); /*!< Track how many bytes of input data
148 * \param length The length of the input data in Bytes.
150 * buffer of at least \p iv_len Bytes.
151 * \param iv_len The length of the nonce in Bytes: 7, 8, 9, 10, 11, 12,
152 * or 13. The length L of the message length field is
155 * zero, \p ad must be a readable buffer of at least that
157 * \param ad_len The length of additional data in Bytes.
[all …]
|
| /optee_os/core/arch/arm/kernel/ |
| H A D | spin_lock_a64.S | 9 * 1. Redistributions of source code must retain the above copyright notice,
10 * this list of conditions and the following disclaimer.
13 * this list of conditions and the following disclaimer in the documentation
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
22 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
23 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
26 * POSSIBILITY OF SUCH DAMAGE.
35 * Redistributions of source code must retain the above copyright notice, this
[all …]
|
| /optee_os/lib/libutils/isoc/arch/arm/softfloat/ |
| H A D | COPYING.txt | 7 The following applies to the whole of SoftFloat Release 3a as well as to
10 Copyright 2011, 2012, 2013, 2014, 2015 The Regents of the University of
16 1. Redistributions of source code must retain the above copyright notice,
17 this list of conditions, and the following disclaimer.
20 notice, this list of conditions, and the following disclaimer in the
23 3. Neither the name of the University nor the names of its contributors
29 WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, ARE
32 (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
33 LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
34 ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
[all …]
|
| /optee_os/lib/libmbedtls/mbedtls/include/psa/ |
| H A D | crypto_types.h | 10 * This file contains portable definitions of integral types for properties
11 * of cryptographic keys, designations of cryptographic algorithms, and
27 * is basically just an alias to it. This is to ease the maintenance of the
53 * encoded as one of the \c PSA_ERROR_xxx values defined here. */
68 /** \brief Encoding of a key type.
70 * Values of this type are generally constructed by macros called
73 * \note Values of this type are encoded in the persistent key store.
80 /** The type of PSA elliptic curve family identifiers.
82 * Values of this type are generally constructed by macros called
92 * \note Values of this type are encoded in the persistent key store.
[all …]
|
| /optee_os/lib/libutils/isoc/newlib/ |
| H A D | str-two-way.h | 9 * 1. Redistributions of source code must retain the above copyright notice,
10 * this list of conditions and the following disclaimer.
13 * this list of conditions and the following disclaimer in the documentation
16 * 3. Neither the name of the copyright holder nor the names of its
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
26 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
27 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
29 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
30 * POSSIBILITY OF SUCH DAMAGE.
[all …]
|
| /optee_os/core/lib/qcbor/ |
| H A D | README.md | 7 except sorting of encoded maps)
21 **Focused on C / native data representation** – Careful conversion of
32 description of decoded data item is 56 bytes. Stack use is light and
35 of memory usage making it good for embedded implementations that
38 **Easy decoding of maps** – The "spiffy decode" functions allow
39 fetching map items directly by label. Detection of duplicate map
40 items is automatically performed. This makes decoding of complex
43 **Supports most of RFC 8949** – With some size limits, all data types
48 allocator be set up. Encoding of indefinite length strings is
55 discipline for very safe coding and handling of binary data.
[all …]
|