1998-12-21 10:56:39 +00:00
|
|
|
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
|
1998-12-21 10:52:47 +00:00
|
|
|
* 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.
|
2015-01-22 03:40:55 +00:00
|
|
|
*
|
1998-12-21 10:52:47 +00:00
|
|
|
* 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).
|
2015-01-22 03:40:55 +00:00
|
|
|
*
|
1998-12-21 10:52:47 +00:00
|
|
|
* 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.
|
2015-01-22 03:40:55 +00:00
|
|
|
*
|
1998-12-21 10:52:47 +00:00
|
|
|
* 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 :-).
|
2015-01-22 03:40:55 +00:00
|
|
|
* 4. If you include any Windows specific code (or a derivative thereof) from
|
1998-12-21 10:52:47 +00:00
|
|
|
* the apps directory (application code) you must include an acknowledgement:
|
|
|
|
* "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
|
2015-01-22 03:40:55 +00:00
|
|
|
*
|
1998-12-21 10:52:47 +00:00
|
|
|
* 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.
|
2015-01-22 03:40:55 +00:00
|
|
|
*
|
1998-12-21 10:52:47 +00:00
|
|
|
* 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 <stdio.h>
|
2015-05-14 14:56:48 +00:00
|
|
|
#include "internal/cryptlib.h"
|
1999-04-23 22:13:45 +00:00
|
|
|
#include <openssl/buffer.h>
|
1998-12-21 10:52:47 +00:00
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
/*
|
|
|
|
* LIMIT_BEFORE_EXPANSION is the maximum n such that (n+3)/3*4 < 2**31. That
|
|
|
|
* function is applied in several functions in this file and this limit
|
|
|
|
* ensures that the result fits in an int.
|
|
|
|
*/
|
2012-04-19 16:19:56 +00:00
|
|
|
#define LIMIT_BEFORE_EXPANSION 0x5ffffffc
|
|
|
|
|
2015-04-24 20:39:40 +00:00
|
|
|
BUF_MEM *BUF_MEM_new_ex(unsigned long flags)
|
|
|
|
{
|
|
|
|
BUF_MEM *ret;
|
|
|
|
|
|
|
|
ret = BUF_MEM_new();
|
|
|
|
if (ret != NULL)
|
|
|
|
ret->flags = flags;
|
|
|
|
return (ret);
|
|
|
|
}
|
|
|
|
|
1999-04-19 21:31:43 +00:00
|
|
|
BUF_MEM *BUF_MEM_new(void)
|
2015-01-22 03:40:55 +00:00
|
|
|
{
|
|
|
|
BUF_MEM *ret;
|
1998-12-21 10:52:47 +00:00
|
|
|
|
2015-09-03 13:15:26 +00:00
|
|
|
ret = OPENSSL_zalloc(sizeof(*ret));
|
2015-01-22 03:40:55 +00:00
|
|
|
if (ret == NULL) {
|
|
|
|
BUFerr(BUF_F_BUF_MEM_NEW, ERR_R_MALLOC_FAILURE);
|
|
|
|
return (NULL);
|
|
|
|
}
|
|
|
|
return (ret);
|
|
|
|
}
|
1998-12-21 10:52:47 +00:00
|
|
|
|
1999-04-19 21:31:43 +00:00
|
|
|
void BUF_MEM_free(BUF_MEM *a)
|
2015-01-22 03:40:55 +00:00
|
|
|
{
|
|
|
|
if (a == NULL)
|
|
|
|
return;
|
1999-01-07 19:15:59 +00:00
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
if (a->data != NULL) {
|
2015-04-24 20:39:40 +00:00
|
|
|
memset(a->data, 0, (unsigned int)a->max);
|
|
|
|
if (a->flags & BUF_MEM_FLAG_SECURE)
|
|
|
|
OPENSSL_secure_free(a->data);
|
|
|
|
else
|
|
|
|
OPENSSL_clear_free(a->data, a->max);
|
2015-01-22 03:40:55 +00:00
|
|
|
}
|
|
|
|
OPENSSL_free(a);
|
|
|
|
}
|
1998-12-21 10:52:47 +00:00
|
|
|
|
2015-04-24 20:39:40 +00:00
|
|
|
/* Allocate a block of secure memory; copy over old data if there
|
|
|
|
* was any, and then free it. */
|
|
|
|
static char *sec_alloc_realloc(BUF_MEM *str, size_t len)
|
|
|
|
{
|
|
|
|
char *ret;
|
|
|
|
|
|
|
|
ret = OPENSSL_secure_malloc(len);
|
|
|
|
if (str->data != NULL) {
|
|
|
|
if (ret != NULL)
|
|
|
|
memcpy(ret, str->data, str->length);
|
|
|
|
OPENSSL_secure_free(str->data);
|
|
|
|
}
|
|
|
|
return (ret);
|
|
|
|
}
|
|
|
|
|
2015-02-13 13:02:24 +00:00
|
|
|
size_t BUF_MEM_grow(BUF_MEM *str, size_t len)
|
2015-01-22 03:40:55 +00:00
|
|
|
{
|
|
|
|
char *ret;
|
|
|
|
size_t n;
|
1998-12-21 10:52:47 +00:00
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
if (str->length >= len) {
|
|
|
|
str->length = len;
|
|
|
|
return (len);
|
|
|
|
}
|
|
|
|
if (str->max >= len) {
|
2016-05-04 10:45:49 +00:00
|
|
|
if (str->data != NULL)
|
|
|
|
memset(&str->data[str->length], 0, len - str->length);
|
2015-01-22 03:40:55 +00:00
|
|
|
str->length = len;
|
|
|
|
return (len);
|
|
|
|
}
|
|
|
|
/* This limit is sufficient to ensure (len+3)/3*4 < 2**31 */
|
|
|
|
if (len > LIMIT_BEFORE_EXPANSION) {
|
|
|
|
BUFerr(BUF_F_BUF_MEM_GROW, ERR_R_MALLOC_FAILURE);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
n = (len + 3) / 3 * 4;
|
2015-04-24 20:39:40 +00:00
|
|
|
if ((str->flags & BUF_MEM_FLAG_SECURE))
|
|
|
|
ret = sec_alloc_realloc(str, n);
|
|
|
|
else
|
|
|
|
ret = OPENSSL_realloc(str->data, n);
|
2015-01-22 03:40:55 +00:00
|
|
|
if (ret == NULL) {
|
|
|
|
BUFerr(BUF_F_BUF_MEM_GROW, ERR_R_MALLOC_FAILURE);
|
|
|
|
len = 0;
|
|
|
|
} else {
|
|
|
|
str->data = ret;
|
|
|
|
str->max = n;
|
|
|
|
memset(&str->data[str->length], 0, len - str->length);
|
|
|
|
str->length = len;
|
|
|
|
}
|
|
|
|
return (len);
|
|
|
|
}
|
1998-12-21 10:52:47 +00:00
|
|
|
|
2015-02-13 13:02:24 +00:00
|
|
|
size_t BUF_MEM_grow_clean(BUF_MEM *str, size_t len)
|
2015-01-22 03:40:55 +00:00
|
|
|
{
|
|
|
|
char *ret;
|
|
|
|
size_t n;
|
2002-11-13 15:43:43 +00:00
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
if (str->length >= len) {
|
2016-05-04 10:45:49 +00:00
|
|
|
if (str->data != NULL)
|
|
|
|
memset(&str->data[len], 0, str->length - len);
|
2015-01-22 03:40:55 +00:00
|
|
|
str->length = len;
|
|
|
|
return (len);
|
|
|
|
}
|
|
|
|
if (str->max >= len) {
|
|
|
|
memset(&str->data[str->length], 0, len - str->length);
|
|
|
|
str->length = len;
|
|
|
|
return (len);
|
|
|
|
}
|
|
|
|
/* This limit is sufficient to ensure (len+3)/3*4 < 2**31 */
|
|
|
|
if (len > LIMIT_BEFORE_EXPANSION) {
|
|
|
|
BUFerr(BUF_F_BUF_MEM_GROW_CLEAN, ERR_R_MALLOC_FAILURE);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
n = (len + 3) / 3 * 4;
|
2015-04-24 20:39:40 +00:00
|
|
|
if ((str->flags & BUF_MEM_FLAG_SECURE))
|
|
|
|
ret = sec_alloc_realloc(str, n);
|
|
|
|
else
|
2015-12-16 21:51:12 +00:00
|
|
|
ret = OPENSSL_clear_realloc(str->data, str->max, n);
|
2015-01-22 03:40:55 +00:00
|
|
|
if (ret == NULL) {
|
|
|
|
BUFerr(BUF_F_BUF_MEM_GROW_CLEAN, ERR_R_MALLOC_FAILURE);
|
|
|
|
len = 0;
|
|
|
|
} else {
|
|
|
|
str->data = ret;
|
|
|
|
str->max = n;
|
|
|
|
memset(&str->data[str->length], 0, len - str->length);
|
|
|
|
str->length = len;
|
|
|
|
}
|
|
|
|
return (len);
|
|
|
|
}
|
2002-11-13 15:43:43 +00:00
|
|
|
|
2016-02-01 14:26:18 +00:00
|
|
|
void BUF_reverse(unsigned char *out, const unsigned char *in, size_t size)
|
2015-01-22 03:40:55 +00:00
|
|
|
{
|
|
|
|
size_t i;
|
|
|
|
if (in) {
|
|
|
|
out += size - 1;
|
|
|
|
for (i = 0; i < size; i++)
|
|
|
|
*out-- = *in++;
|
|
|
|
} else {
|
|
|
|
unsigned char *q;
|
|
|
|
char c;
|
|
|
|
q = out + size - 1;
|
|
|
|
for (i = 0; i < size / 2; i++) {
|
|
|
|
c = *q;
|
|
|
|
*q-- = *out;
|
|
|
|
*out++ = c;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|