/src/openssl/crypto/buffer/buffer.c
Line  | Count  | Source (jump to first uncovered line)  | 
1  |  | /*  | 
2  |  |  * Copyright 1995-2020 The OpenSSL Project Authors. All Rights Reserved.  | 
3  |  |  *  | 
4  |  |  * Licensed under the Apache License 2.0 (the "License").  You may not use  | 
5  |  |  * this file except in compliance with the License.  You can obtain a copy  | 
6  |  |  * in the file LICENSE in the source distribution or at  | 
7  |  |  * https://www.openssl.org/source/license.html  | 
8  |  |  */  | 
9  |  |  | 
10  |  | #include <stdio.h>  | 
11  |  | #include "internal/cryptlib.h"  | 
12  |  | #include <openssl/buffer.h>  | 
13  |  |  | 
14  |  | /*  | 
15  |  |  * LIMIT_BEFORE_EXPANSION is the maximum n such that (n+3)/3*4 < 2**31. That  | 
16  |  |  * function is applied in several functions in this file and this limit  | 
17  |  |  * ensures that the result fits in an int.  | 
18  |  |  */  | 
19  | 43.1k  | #define LIMIT_BEFORE_EXPANSION 0x5ffffffc  | 
20  |  |  | 
21  |  | BUF_MEM *BUF_MEM_new_ex(unsigned long flags)  | 
22  | 0  | { | 
23  | 0  |     BUF_MEM *ret;  | 
24  |  | 
  | 
25  | 0  |     ret = BUF_MEM_new();  | 
26  | 0  |     if (ret != NULL)  | 
27  | 0  |         ret->flags = flags;  | 
28  | 0  |     return ret;  | 
29  | 0  | }  | 
30  |  |  | 
31  |  | BUF_MEM *BUF_MEM_new(void)  | 
32  | 6.20k  | { | 
33  | 6.20k  |     BUF_MEM *ret;  | 
34  |  |  | 
35  | 6.20k  |     ret = OPENSSL_zalloc(sizeof(*ret));  | 
36  | 6.20k  |     if (ret == NULL)  | 
37  | 0  |         return NULL;  | 
38  | 6.20k  |     return ret;  | 
39  | 6.20k  | }  | 
40  |  |  | 
41  |  | void BUF_MEM_free(BUF_MEM *a)  | 
42  | 5.09k  | { | 
43  | 5.09k  |     if (a == NULL)  | 
44  | 0  |         return;  | 
45  | 5.09k  |     if (a->data != NULL) { | 
46  | 5.09k  |         if (a->flags & BUF_MEM_FLAG_SECURE)  | 
47  | 0  |             OPENSSL_secure_clear_free(a->data, a->max);  | 
48  | 5.09k  |         else  | 
49  | 5.09k  |             OPENSSL_clear_free(a->data, a->max);  | 
50  | 5.09k  |     }  | 
51  | 5.09k  |     OPENSSL_free(a);  | 
52  | 5.09k  | }  | 
53  |  |  | 
54  |  | /* Allocate a block of secure memory; copy over old data if there  | 
55  |  |  * was any, and then free it. */  | 
56  |  | static char *sec_alloc_realloc(BUF_MEM *str, size_t len)  | 
57  | 0  | { | 
58  | 0  |     char *ret;  | 
59  |  | 
  | 
60  | 0  |     ret = OPENSSL_secure_malloc(len);  | 
61  | 0  |     if (str->data != NULL) { | 
62  | 0  |         if (ret != NULL) { | 
63  | 0  |             memcpy(ret, str->data, str->length);  | 
64  | 0  |             OPENSSL_secure_clear_free(str->data, str->length);  | 
65  | 0  |             str->data = NULL;  | 
66  | 0  |         }  | 
67  | 0  |     }  | 
68  | 0  |     return ret;  | 
69  | 0  | }  | 
70  |  |  | 
71  |  | size_t BUF_MEM_grow(BUF_MEM *str, size_t len)  | 
72  | 819k  | { | 
73  | 819k  |     char *ret;  | 
74  | 819k  |     size_t n;  | 
75  |  |  | 
76  | 819k  |     if (str->length >= len) { | 
77  | 1.06k  |         str->length = len;  | 
78  | 1.06k  |         return len;  | 
79  | 1.06k  |     }  | 
80  | 818k  |     if (str->max >= len) { | 
81  | 811k  |         if (str->data != NULL)  | 
82  | 811k  |             memset(&str->data[str->length], 0, len - str->length);  | 
83  | 811k  |         str->length = len;  | 
84  | 811k  |         return len;  | 
85  | 811k  |     }  | 
86  |  |     /* This limit is sufficient to ensure (len+3)/3*4 < 2**31 */  | 
87  | 6.93k  |     if (len > LIMIT_BEFORE_EXPANSION) { | 
88  | 0  |         ERR_raise(ERR_LIB_BUF, ERR_R_PASSED_INVALID_ARGUMENT);  | 
89  | 0  |         return 0;  | 
90  | 0  |     }  | 
91  | 6.93k  |     n = (len + 3) / 3 * 4;  | 
92  | 6.93k  |     if ((str->flags & BUF_MEM_FLAG_SECURE))  | 
93  | 0  |         ret = sec_alloc_realloc(str, n);  | 
94  | 6.93k  |     else  | 
95  | 6.93k  |         ret = OPENSSL_realloc(str->data, n);  | 
96  | 6.93k  |     if (ret == NULL) { | 
97  | 0  |         len = 0;  | 
98  | 6.93k  |     } else { | 
99  | 6.93k  |         str->data = ret;  | 
100  | 6.93k  |         str->max = n;  | 
101  | 6.93k  |         memset(&str->data[str->length], 0, len - str->length);  | 
102  | 6.93k  |         str->length = len;  | 
103  | 6.93k  |     }  | 
104  | 6.93k  |     return len;  | 
105  | 6.93k  | }  | 
106  |  |  | 
107  |  | size_t BUF_MEM_grow_clean(BUF_MEM *str, size_t len)  | 
108  | 259k  | { | 
109  | 259k  |     char *ret;  | 
110  | 259k  |     size_t n;  | 
111  |  |  | 
112  | 259k  |     if (str->length >= len) { | 
113  | 0  |         if (str->data != NULL)  | 
114  | 0  |             memset(&str->data[len], 0, str->length - len);  | 
115  | 0  |         str->length = len;  | 
116  | 0  |         return len;  | 
117  | 0  |     }  | 
118  | 259k  |     if (str->max >= len) { | 
119  | 223k  |         memset(&str->data[str->length], 0, len - str->length);  | 
120  | 223k  |         str->length = len;  | 
121  | 223k  |         return len;  | 
122  | 223k  |     }  | 
123  |  |     /* This limit is sufficient to ensure (len+3)/3*4 < 2**31 */  | 
124  | 36.1k  |     if (len > LIMIT_BEFORE_EXPANSION) { | 
125  | 0  |         ERR_raise(ERR_LIB_BUF, ERR_R_PASSED_INVALID_ARGUMENT);  | 
126  | 0  |         return 0;  | 
127  | 0  |     }  | 
128  | 36.1k  |     n = (len + 3) / 3 * 4;  | 
129  | 36.1k  |     if ((str->flags & BUF_MEM_FLAG_SECURE))  | 
130  | 0  |         ret = sec_alloc_realloc(str, n);  | 
131  | 36.1k  |     else  | 
132  | 36.1k  |         ret = OPENSSL_clear_realloc(str->data, str->max, n);  | 
133  | 36.1k  |     if (ret == NULL) { | 
134  | 0  |         len = 0;  | 
135  | 36.1k  |     } else { | 
136  | 36.1k  |         str->data = ret;  | 
137  | 36.1k  |         str->max = n;  | 
138  | 36.1k  |         memset(&str->data[str->length], 0, len - str->length);  | 
139  | 36.1k  |         str->length = len;  | 
140  | 36.1k  |     }  | 
141  | 36.1k  |     return len;  | 
142  | 36.1k  | }  | 
143  |  |  | 
144  |  | void BUF_reverse(unsigned char *out, const unsigned char *in, size_t size)  | 
145  | 0  | { | 
146  | 0  |     size_t i;  | 
147  | 0  |     if (in) { | 
148  | 0  |         out += size - 1;  | 
149  | 0  |         for (i = 0; i < size; i++)  | 
150  | 0  |             *out-- = *in++;  | 
151  | 0  |     } else { | 
152  | 0  |         unsigned char *q;  | 
153  | 0  |         char c;  | 
154  | 0  |         q = out + size - 1;  | 
155  | 0  |         for (i = 0; i < size / 2; i++) { | 
156  | 0  |             c = *q;  | 
157  | 0  |             *q-- = *out;  | 
158  | 0  |             *out++ = c;  | 
159  | 0  |         }  | 
160  | 0  |     }  | 
161  | 0  | }  |