155714Skris/* crypto/buffer/buffer.c */
255714Skris/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
355714Skris * All rights reserved.
455714Skris *
555714Skris * This package is an SSL implementation written
655714Skris * by Eric Young (eay@cryptsoft.com).
755714Skris * The implementation was written so as to conform with Netscapes SSL.
8280304Sjkim *
955714Skris * This library is free for commercial and non-commercial use as long as
1055714Skris * the following conditions are aheared to.  The following conditions
1155714Skris * apply to all code found in this distribution, be it the RC4, RSA,
1255714Skris * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
1355714Skris * included with this distribution is covered by the same copyright terms
1455714Skris * except that the holder is Tim Hudson (tjh@cryptsoft.com).
15280304Sjkim *
1655714Skris * Copyright remains Eric Young's, and as such any Copyright notices in
1755714Skris * the code are not to be removed.
1855714Skris * If this package is used in a product, Eric Young should be given attribution
1955714Skris * as the author of the parts of the library used.
2055714Skris * This can be in the form of a textual message at program startup or
2155714Skris * in documentation (online or textual) provided with the package.
22280304Sjkim *
2355714Skris * Redistribution and use in source and binary forms, with or without
2455714Skris * modification, are permitted provided that the following conditions
2555714Skris * are met:
2655714Skris * 1. Redistributions of source code must retain the copyright
2755714Skris *    notice, this list of conditions and the following disclaimer.
2855714Skris * 2. Redistributions in binary form must reproduce the above copyright
2955714Skris *    notice, this list of conditions and the following disclaimer in the
3055714Skris *    documentation and/or other materials provided with the distribution.
3155714Skris * 3. All advertising materials mentioning features or use of this software
3255714Skris *    must display the following acknowledgement:
3355714Skris *    "This product includes cryptographic software written by
3455714Skris *     Eric Young (eay@cryptsoft.com)"
3555714Skris *    The word 'cryptographic' can be left out if the rouines from the library
3655714Skris *    being used are not cryptographic related :-).
37280304Sjkim * 4. If you include any Windows specific code (or a derivative thereof) from
3855714Skris *    the apps directory (application code) you must include an acknowledgement:
3955714Skris *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
40280304Sjkim *
4155714Skris * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
4255714Skris * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
4355714Skris * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
4455714Skris * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
4555714Skris * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
4655714Skris * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
4755714Skris * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
4855714Skris * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
4955714Skris * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
5055714Skris * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
5155714Skris * SUCH DAMAGE.
52280304Sjkim *
5355714Skris * The licence and distribution terms for any publically available version or
5455714Skris * derivative of this code cannot be changed.  i.e. this code cannot simply be
5555714Skris * copied and put under another distribution licence
5655714Skris * [including the GNU Public Licence.]
5755714Skris */
5855714Skris
5955714Skris#include <stdio.h>
6055714Skris#include "cryptlib.h"
6155714Skris#include <openssl/buffer.h>
6255714Skris
63280304Sjkim/*
64280304Sjkim * LIMIT_BEFORE_EXPANSION is the maximum n such that (n+3)/3*4 < 2**31. That
65280304Sjkim * function is applied in several functions in this file and this limit
66280304Sjkim * ensures that the result fits in an int.
67280304Sjkim */
68234954Sbz#define LIMIT_BEFORE_EXPANSION 0x5ffffffc
69234954Sbz
7055714SkrisBUF_MEM *BUF_MEM_new(void)
71280304Sjkim{
72280304Sjkim    BUF_MEM *ret;
7355714Skris
74280304Sjkim    ret = OPENSSL_malloc(sizeof(BUF_MEM));
75280304Sjkim    if (ret == NULL) {
76280304Sjkim        BUFerr(BUF_F_BUF_MEM_NEW, ERR_R_MALLOC_FAILURE);
77280304Sjkim        return (NULL);
78280304Sjkim    }
79280304Sjkim    ret->length = 0;
80280304Sjkim    ret->max = 0;
81280304Sjkim    ret->data = NULL;
82280304Sjkim    return (ret);
83280304Sjkim}
8455714Skris
8555714Skrisvoid BUF_MEM_free(BUF_MEM *a)
86280304Sjkim{
87280304Sjkim    if (a == NULL)
88280304Sjkim        return;
8955714Skris
90280304Sjkim    if (a->data != NULL) {
91284285Sjkim        OPENSSL_cleanse(a->data, a->max);
92280304Sjkim        OPENSSL_free(a->data);
93280304Sjkim    }
94280304Sjkim    OPENSSL_free(a);
95280304Sjkim}
9655714Skris
97238405Sjkimint BUF_MEM_grow(BUF_MEM *str, size_t len)
98280304Sjkim{
99280304Sjkim    char *ret;
100280304Sjkim    size_t n;
10155714Skris
102280304Sjkim    if (str->length >= len) {
103280304Sjkim        str->length = len;
104280304Sjkim        return (len);
105280304Sjkim    }
106280304Sjkim    if (str->max >= len) {
107280304Sjkim        memset(&str->data[str->length], 0, len - str->length);
108280304Sjkim        str->length = len;
109280304Sjkim        return (len);
110280304Sjkim    }
111280304Sjkim    /* This limit is sufficient to ensure (len+3)/3*4 < 2**31 */
112280304Sjkim    if (len > LIMIT_BEFORE_EXPANSION) {
113280304Sjkim        BUFerr(BUF_F_BUF_MEM_GROW, ERR_R_MALLOC_FAILURE);
114280304Sjkim        return 0;
115280304Sjkim    }
116280304Sjkim    n = (len + 3) / 3 * 4;
117280304Sjkim    if (str->data == NULL)
118280304Sjkim        ret = OPENSSL_malloc(n);
119280304Sjkim    else
120280304Sjkim        ret = OPENSSL_realloc(str->data, n);
121280304Sjkim    if (ret == NULL) {
122280304Sjkim        BUFerr(BUF_F_BUF_MEM_GROW, ERR_R_MALLOC_FAILURE);
123280304Sjkim        len = 0;
124280304Sjkim    } else {
125280304Sjkim        str->data = ret;
126280304Sjkim        str->max = n;
127280304Sjkim        memset(&str->data[str->length], 0, len - str->length);
128280304Sjkim        str->length = len;
129280304Sjkim    }
130280304Sjkim    return (len);
131280304Sjkim}
132109998Smarkm
133238405Sjkimint BUF_MEM_grow_clean(BUF_MEM *str, size_t len)
134280304Sjkim{
135280304Sjkim    char *ret;
136280304Sjkim    size_t n;
137109998Smarkm
138280304Sjkim    if (str->length >= len) {
139280304Sjkim        memset(&str->data[len], 0, str->length - len);
140280304Sjkim        str->length = len;
141280304Sjkim        return (len);
142280304Sjkim    }
143280304Sjkim    if (str->max >= len) {
144280304Sjkim        memset(&str->data[str->length], 0, len - str->length);
145280304Sjkim        str->length = len;
146280304Sjkim        return (len);
147280304Sjkim    }
148280304Sjkim    /* This limit is sufficient to ensure (len+3)/3*4 < 2**31 */
149280304Sjkim    if (len > LIMIT_BEFORE_EXPANSION) {
150280304Sjkim        BUFerr(BUF_F_BUF_MEM_GROW_CLEAN, ERR_R_MALLOC_FAILURE);
151280304Sjkim        return 0;
152280304Sjkim    }
153280304Sjkim    n = (len + 3) / 3 * 4;
154280304Sjkim    if (str->data == NULL)
155280304Sjkim        ret = OPENSSL_malloc(n);
156280304Sjkim    else
157280304Sjkim        ret = OPENSSL_realloc_clean(str->data, str->max, n);
158280304Sjkim    if (ret == NULL) {
159280304Sjkim        BUFerr(BUF_F_BUF_MEM_GROW_CLEAN, ERR_R_MALLOC_FAILURE);
160280304Sjkim        len = 0;
161280304Sjkim    } else {
162280304Sjkim        str->data = ret;
163280304Sjkim        str->max = n;
164280304Sjkim        memset(&str->data[str->length], 0, len - str->length);
165280304Sjkim        str->length = len;
166280304Sjkim    }
167280304Sjkim    return (len);
168280304Sjkim}
169238405Sjkim
170264331Sjkimvoid BUF_reverse(unsigned char *out, const unsigned char *in, size_t size)
171280304Sjkim{
172280304Sjkim    size_t i;
173280304Sjkim    if (in) {
174280304Sjkim        out += size - 1;
175280304Sjkim        for (i = 0; i < size; i++)
176280304Sjkim            *out-- = *in++;
177280304Sjkim    } else {
178280304Sjkim        unsigned char *q;
179280304Sjkim        char c;
180280304Sjkim        q = out + size - 1;
181280304Sjkim        for (i = 0; i < size / 2; i++) {
182280304Sjkim            c = *q;
183280304Sjkim            *q-- = *out;
184280304Sjkim            *out++ = c;
185280304Sjkim        }
186280304Sjkim    }
187280304Sjkim}
188