mirror of
https://github.com/openssl/openssl.git
synced 2024-12-05 07:54:47 +08:00
unify spelling of serialize
Reviewed-by: Matt Caswell <matt@openssl.org> (Merged from https://github.com/openssl/openssl/pull/12104)
This commit is contained in:
parent
adf3f83e52
commit
aa97970c1a
@ -3647,7 +3647,7 @@ static int generate_session_id(SSL *ssl, unsigned char *id,
|
||||
|
||||
/*
|
||||
* By default s_server uses an in-memory cache which caches SSL_SESSION
|
||||
* structures without any serialisation. This hides some bugs which only
|
||||
* structures without any serialization. This hides some bugs which only
|
||||
* become apparent in deployed servers. By implementing a basic external
|
||||
* session cache some issues can be debugged using s_server.
|
||||
*/
|
||||
|
@ -437,7 +437,7 @@ BN_MONT_CTX *BN_MONT_CTX_set_locked(BN_MONT_CTX **pmont, CRYPTO_RWLOCK *lock,
|
||||
return ret;
|
||||
|
||||
/*
|
||||
* We don't want to serialise globally while doing our lazy-init math in
|
||||
* We don't want to serialize globally while doing our lazy-init math in
|
||||
* BN_MONT_CTX_set. That punishes threads that are doing independent
|
||||
* things. Instead, punish the case where more than one thread tries to
|
||||
* lazy-init the same 'pmont', by having each do the lazy-init math work
|
||||
|
@ -169,7 +169,7 @@ c448_error_t c448_ed448_sign(
|
||||
|
||||
{
|
||||
/*
|
||||
* Schedule the secret key, First EDDSA_448_PRIVATE_BYTES is serialised
|
||||
* Schedule the secret key, First EDDSA_448_PRIVATE_BYTES is serialized
|
||||
* secret scalar,next EDDSA_448_PRIVATE_BYTES bytes is the seed.
|
||||
*/
|
||||
uint8_t expanded[EDDSA_448_PRIVATE_BYTES * 2];
|
||||
|
@ -59,7 +59,7 @@ typedef uint64_t u64;
|
||||
|
||||
/*
|
||||
* The underlying field. P256 operates over GF(2^256-2^224+2^192+2^96-1). We
|
||||
* can serialise an element of this field into 32 bytes. We call this an
|
||||
* can serialize an element of this field into 32 bytes. We call this an
|
||||
* felem_bytearray.
|
||||
*/
|
||||
|
||||
@ -138,7 +138,7 @@ static void bin32_to_felem(felem out, const u8 in[32])
|
||||
}
|
||||
|
||||
/*
|
||||
* smallfelem_to_bin32 takes a smallfelem and serialises into a little
|
||||
* smallfelem_to_bin32 takes a smallfelem and serializes into a little
|
||||
* endian, 32 byte array. This assumes that the CPU is little-endian.
|
||||
*/
|
||||
static void smallfelem_to_bin32(u8 out[32], const smallfelem in)
|
||||
|
@ -55,7 +55,7 @@ typedef uint8_t u8;
|
||||
typedef uint64_t u64;
|
||||
|
||||
/*
|
||||
* The underlying field. P521 operates over GF(2^521-1). We can serialise an
|
||||
* The underlying field. P521 operates over GF(2^521-1). We can serialize an
|
||||
* element of this field into 66 bytes where the most significant byte
|
||||
* contains only a single bit. We call this an felem_bytearray.
|
||||
*/
|
||||
@ -156,7 +156,7 @@ static void bin66_to_felem(felem out, const u8 in[66])
|
||||
}
|
||||
|
||||
/*
|
||||
* felem_to_bin66 takes an felem and serialises into a little endian, 66 byte
|
||||
* felem_to_bin66 takes an felem and serializes into a little endian, 66 byte
|
||||
* array. This assumes that the CPU is little-endian.
|
||||
*/
|
||||
static void felem_to_bin66(u8 out[66], const felem in)
|
||||
|
@ -331,7 +331,7 @@ __owur int SCT_LIST_validate(const STACK_OF(SCT) *scts,
|
||||
|
||||
|
||||
/*********************************
|
||||
* SCT parsing and serialisation *
|
||||
* SCT parsing and serialization *
|
||||
*********************************/
|
||||
|
||||
/*
|
||||
|
@ -76,7 +76,7 @@ typedef struct DSA_SIG_st DSA_SIG;
|
||||
|
||||
/*
|
||||
* TODO(3.0): consider removing the ASN.1 encoding and decoding when
|
||||
* deserialisation is completed elsewhere.
|
||||
* deserialization is completed elsewhere.
|
||||
*/
|
||||
# define d2i_DSAparams_fp(fp, x) \
|
||||
(DSA *)ASN1_d2i_fp((char *(*)())DSA_new, \
|
||||
|
@ -34,7 +34,7 @@
|
||||
#define MAX_HASH_BLOCK_SIZE 128
|
||||
|
||||
/*
|
||||
* u32toLE serialises an unsigned, 32-bit number (n) as four bytes at (p) in
|
||||
* u32toLE serializes an unsigned, 32-bit number (n) as four bytes at (p) in
|
||||
* little-endian order. The value of p is advanced by four.
|
||||
*/
|
||||
#define u32toLE(n, p) \
|
||||
|
Loading…
Reference in New Issue
Block a user