1fa5abc0b4
e.g. here: adbe3b837e/src/node_crypto.cc (L3439)
Change-Id: I2d43a3439d6a56c8eee3636b3c1f5ba615b233ba
Reviewed-on: https://boringssl-review.googlesource.com/c/boringssl/+/35144
Reviewed-by: Adam Langley <agl@google.com>
Commit-Queue: Adam Langley <agl@google.com>
258 lines
7.5 KiB
C
258 lines
7.5 KiB
C
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
|
|
* All rights reserved.
|
|
*
|
|
* This package is an SSL implementation written
|
|
* by Eric Young (eay@cryptsoft.com).
|
|
* The implementation was written so as to conform with Netscapes SSL.
|
|
*
|
|
* This library is free for commercial and non-commercial use as long as
|
|
* the following conditions are aheared to. The following conditions
|
|
* apply to all code found in this distribution, be it the RC4, RSA,
|
|
* lhash, DES, etc., code; not just the SSL code. The SSL documentation
|
|
* included with this distribution is covered by the same copyright terms
|
|
* except that the holder is Tim Hudson (tjh@cryptsoft.com).
|
|
*
|
|
* Copyright remains Eric Young's, and as such any Copyright notices in
|
|
* the code are not to be removed.
|
|
* If this package is used in a product, Eric Young should be given attribution
|
|
* as the author of the parts of the library used.
|
|
* This can be in the form of a textual message at program startup or
|
|
* in documentation (online or textual) provided with the package.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* "This product includes cryptographic software written by
|
|
* Eric Young (eay@cryptsoft.com)"
|
|
* The word 'cryptographic' can be left out if the rouines from the library
|
|
* being used are not cryptographic related :-).
|
|
* 4. If you include any Windows specific code (or a derivative thereof) from
|
|
* the apps directory (application code) you must include an acknowledgement:
|
|
* "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* The licence and distribution terms for any publically available version or
|
|
* derivative of this code cannot be changed. i.e. this code cannot simply be
|
|
* copied and put under another distribution licence
|
|
* [including the GNU Public Licence.] */
|
|
|
|
#include <openssl/mem.h>
|
|
|
|
#include <assert.h>
|
|
#include <stdarg.h>
|
|
#include <stdio.h>
|
|
|
|
#if defined(OPENSSL_WINDOWS)
|
|
OPENSSL_MSVC_PRAGMA(warning(push, 3))
|
|
#include <windows.h>
|
|
OPENSSL_MSVC_PRAGMA(warning(pop))
|
|
#endif
|
|
|
|
#include "internal.h"
|
|
|
|
|
|
#define OPENSSL_MALLOC_PREFIX 8
|
|
|
|
#if defined(__GNUC__) || defined(__clang__)
|
|
// sdallocx is a sized |free| function. By passing the size (which we happen to
|
|
// always know in BoringSSL), the malloc implementation can save work. We cannot
|
|
// depend on |sdallocx| being available so we declare a wrapper that falls back
|
|
// to |free| as a weak symbol.
|
|
//
|
|
// This will always be safe, but will only be overridden if the malloc
|
|
// implementation is statically linked with BoringSSL. So, if |sdallocx| is
|
|
// provided in, say, libc.so, we still won't use it because that's dynamically
|
|
// linked. This isn't an ideal result, but its helps in some cases.
|
|
void sdallocx(void *ptr, size_t size, int flags);
|
|
|
|
__attribute((weak, noinline))
|
|
#else
|
|
static
|
|
#endif
|
|
void sdallocx(void *ptr, size_t size, int flags) {
|
|
free(ptr);
|
|
}
|
|
|
|
void *OPENSSL_malloc(size_t size) {
|
|
void *ptr = malloc(size + OPENSSL_MALLOC_PREFIX);
|
|
if (ptr == NULL) {
|
|
return NULL;
|
|
}
|
|
|
|
*(size_t *)ptr = size;
|
|
|
|
return ((uint8_t *)ptr) + OPENSSL_MALLOC_PREFIX;
|
|
}
|
|
|
|
void OPENSSL_free(void *orig_ptr) {
|
|
if (orig_ptr == NULL) {
|
|
return;
|
|
}
|
|
|
|
void *ptr = ((uint8_t *)orig_ptr) - OPENSSL_MALLOC_PREFIX;
|
|
|
|
size_t size = *(size_t *)ptr;
|
|
OPENSSL_cleanse(ptr, size + OPENSSL_MALLOC_PREFIX);
|
|
sdallocx(ptr, size + OPENSSL_MALLOC_PREFIX, 0 /* flags */);
|
|
}
|
|
|
|
void *OPENSSL_realloc(void *orig_ptr, size_t new_size) {
|
|
if (orig_ptr == NULL) {
|
|
return OPENSSL_malloc(new_size);
|
|
}
|
|
|
|
void *ptr = ((uint8_t *)orig_ptr) - OPENSSL_MALLOC_PREFIX;
|
|
size_t old_size = *(size_t *)ptr;
|
|
|
|
void *ret = OPENSSL_malloc(new_size);
|
|
if (ret == NULL) {
|
|
return NULL;
|
|
}
|
|
|
|
size_t to_copy = new_size;
|
|
if (old_size < to_copy) {
|
|
to_copy = old_size;
|
|
}
|
|
|
|
memcpy(ret, orig_ptr, to_copy);
|
|
OPENSSL_free(orig_ptr);
|
|
|
|
return ret;
|
|
}
|
|
|
|
void OPENSSL_cleanse(void *ptr, size_t len) {
|
|
#if defined(OPENSSL_WINDOWS)
|
|
SecureZeroMemory(ptr, len);
|
|
#else
|
|
OPENSSL_memset(ptr, 0, len);
|
|
|
|
#if !defined(OPENSSL_NO_ASM)
|
|
/* As best as we can tell, this is sufficient to break any optimisations that
|
|
might try to eliminate "superfluous" memsets. If there's an easy way to
|
|
detect memset_s, it would be better to use that. */
|
|
__asm__ __volatile__("" : : "r"(ptr) : "memory");
|
|
#endif
|
|
#endif // !OPENSSL_NO_ASM
|
|
}
|
|
|
|
void OPENSSL_clear_free(void *ptr, size_t unused) {
|
|
OPENSSL_free(ptr);
|
|
}
|
|
|
|
int CRYPTO_memcmp(const void *in_a, const void *in_b, size_t len) {
|
|
const uint8_t *a = in_a;
|
|
const uint8_t *b = in_b;
|
|
uint8_t x = 0;
|
|
|
|
for (size_t i = 0; i < len; i++) {
|
|
x |= a[i] ^ b[i];
|
|
}
|
|
|
|
return x;
|
|
}
|
|
|
|
uint32_t OPENSSL_hash32(const void *ptr, size_t len) {
|
|
// These are the FNV-1a parameters for 32 bits.
|
|
static const uint32_t kPrime = 16777619u;
|
|
static const uint32_t kOffsetBasis = 2166136261u;
|
|
|
|
const uint8_t *in = ptr;
|
|
uint32_t h = kOffsetBasis;
|
|
|
|
for (size_t i = 0; i < len; i++) {
|
|
h ^= in[i];
|
|
h *= kPrime;
|
|
}
|
|
|
|
return h;
|
|
}
|
|
|
|
size_t OPENSSL_strnlen(const char *s, size_t len) {
|
|
for (size_t i = 0; i < len; i++) {
|
|
if (s[i] == 0) {
|
|
return i;
|
|
}
|
|
}
|
|
|
|
return len;
|
|
}
|
|
|
|
char *OPENSSL_strdup(const char *s) {
|
|
const size_t len = strlen(s) + 1;
|
|
char *ret = OPENSSL_malloc(len);
|
|
if (ret == NULL) {
|
|
return NULL;
|
|
}
|
|
OPENSSL_memcpy(ret, s, len);
|
|
return ret;
|
|
}
|
|
|
|
int OPENSSL_tolower(int c) {
|
|
if (c >= 'A' && c <= 'Z') {
|
|
return c + ('a' - 'A');
|
|
}
|
|
return c;
|
|
}
|
|
|
|
int OPENSSL_strcasecmp(const char *a, const char *b) {
|
|
for (size_t i = 0;; i++) {
|
|
const int aa = OPENSSL_tolower(a[i]);
|
|
const int bb = OPENSSL_tolower(b[i]);
|
|
|
|
if (aa < bb) {
|
|
return -1;
|
|
} else if (aa > bb) {
|
|
return 1;
|
|
} else if (aa == 0) {
|
|
return 0;
|
|
}
|
|
}
|
|
}
|
|
|
|
int OPENSSL_strncasecmp(const char *a, const char *b, size_t n) {
|
|
for (size_t i = 0; i < n; i++) {
|
|
const int aa = OPENSSL_tolower(a[i]);
|
|
const int bb = OPENSSL_tolower(b[i]);
|
|
|
|
if (aa < bb) {
|
|
return -1;
|
|
} else if (aa > bb) {
|
|
return 1;
|
|
} else if (aa == 0) {
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
int BIO_snprintf(char *buf, size_t n, const char *format, ...) {
|
|
va_list args;
|
|
va_start(args, format);
|
|
int ret = BIO_vsnprintf(buf, n, format, args);
|
|
va_end(args);
|
|
return ret;
|
|
}
|
|
|
|
int BIO_vsnprintf(char *buf, size_t n, const char *format, va_list args) {
|
|
return vsnprintf(buf, n, format, args);
|
|
}
|