/src/openssl111/crypto/buffer/buffer.c
| Line | Count | Source (jump to first uncovered line) | 
| 1 |  | /* | 
| 2 |  |  * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved. | 
| 3 |  |  * | 
| 4 |  |  * Licensed under the OpenSSL license (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 | 15.5M | #define LIMIT_BEFORE_EXPANSION 0x5ffffffc | 
| 20 |  |  | 
| 21 |  | BUF_MEM *BUF_MEM_new_ex(unsigned long flags) | 
| 22 | 1.66M | { | 
| 23 | 1.66M |     BUF_MEM *ret; | 
| 24 |  |  | 
| 25 | 1.66M |     ret = BUF_MEM_new(); | 
| 26 | 1.66M |     if (ret != NULL) | 
| 27 | 1.66M |         ret->flags = flags; | 
| 28 | 1.66M |     return ret; | 
| 29 | 1.66M | } | 
| 30 |  |  | 
| 31 |  | BUF_MEM *BUF_MEM_new(void) | 
| 32 | 6.06M | { | 
| 33 | 6.06M |     BUF_MEM *ret; | 
| 34 |  |  | 
| 35 | 6.06M |     ret = OPENSSL_zalloc(sizeof(*ret)); | 
| 36 | 6.06M |     if (ret == NULL) { | 
| 37 | 0 |         BUFerr(BUF_F_BUF_MEM_NEW, ERR_R_MALLOC_FAILURE); | 
| 38 | 0 |         return NULL; | 
| 39 | 0 |     } | 
| 40 | 6.06M |     return ret; | 
| 41 | 6.06M | } | 
| 42 |  |  | 
| 43 |  | void BUF_MEM_free(BUF_MEM *a) | 
| 44 | 4.52M | { | 
| 45 | 4.52M |     if (a == NULL) | 
| 46 | 120k |         return; | 
| 47 | 4.40M |     if (a->data != NULL) { | 
| 48 | 1.74M |         if (a->flags & BUF_MEM_FLAG_SECURE) | 
| 49 | 12.4k |             OPENSSL_secure_clear_free(a->data, a->max); | 
| 50 | 1.72M |         else | 
| 51 | 1.72M |             OPENSSL_clear_free(a->data, a->max); | 
| 52 | 1.74M |     } | 
| 53 | 4.40M |     OPENSSL_free(a); | 
| 54 | 4.40M | } | 
| 55 |  |  | 
| 56 |  | /* Allocate a block of secure memory; copy over old data if there | 
| 57 |  |  * was any, and then free it. */ | 
| 58 |  | static char *sec_alloc_realloc(BUF_MEM *str, size_t len) | 
| 59 | 43.9k | { | 
| 60 | 43.9k |     char *ret; | 
| 61 |  |  | 
| 62 | 43.9k |     ret = OPENSSL_secure_malloc(len); | 
| 63 | 43.9k |     if (str->data != NULL) { | 
| 64 | 31.4k |         if (ret != NULL) { | 
| 65 | 31.4k |             memcpy(ret, str->data, str->length); | 
| 66 | 31.4k |             OPENSSL_secure_clear_free(str->data, str->length); | 
| 67 | 31.4k |             str->data = NULL; | 
| 68 | 31.4k |         } | 
| 69 | 31.4k |     } | 
| 70 | 43.9k |     return ret; | 
| 71 | 43.9k | } | 
| 72 |  |  | 
| 73 |  | size_t BUF_MEM_grow(BUF_MEM *str, size_t len) | 
| 74 | 22.3M | { | 
| 75 | 22.3M |     char *ret; | 
| 76 | 22.3M |     size_t n; | 
| 77 |  |  | 
| 78 | 22.3M |     if (str->length >= len) { | 
| 79 | 19.3M |         str->length = len; | 
| 80 | 19.3M |         return len; | 
| 81 | 19.3M |     } | 
| 82 | 2.96M |     if (str->max >= len) { | 
| 83 | 1.63M |         if (str->data != NULL) | 
| 84 | 1.63M |             memset(&str->data[str->length], 0, len - str->length); | 
| 85 | 1.63M |         str->length = len; | 
| 86 | 1.63M |         return len; | 
| 87 | 1.63M |     } | 
| 88 |  |     /* This limit is sufficient to ensure (len+3)/3*4 < 2**31 */ | 
| 89 | 1.33M |     if (len > LIMIT_BEFORE_EXPANSION) { | 
| 90 | 0 |         BUFerr(BUF_F_BUF_MEM_GROW, ERR_R_MALLOC_FAILURE); | 
| 91 | 0 |         return 0; | 
| 92 | 0 |     } | 
| 93 | 1.33M |     n = (len + 3) / 3 * 4; | 
| 94 | 1.33M |     if ((str->flags & BUF_MEM_FLAG_SECURE)) | 
| 95 | 0 |         ret = sec_alloc_realloc(str, n); | 
| 96 | 1.33M |     else | 
| 97 | 1.33M |         ret = OPENSSL_realloc(str->data, n); | 
| 98 | 1.33M |     if (ret == NULL) { | 
| 99 | 0 |         BUFerr(BUF_F_BUF_MEM_GROW, ERR_R_MALLOC_FAILURE); | 
| 100 | 0 |         len = 0; | 
| 101 | 1.33M |     } else { | 
| 102 | 1.33M |         str->data = ret; | 
| 103 | 1.33M |         str->max = n; | 
| 104 | 1.33M |         memset(&str->data[str->length], 0, len - str->length); | 
| 105 | 1.33M |         str->length = len; | 
| 106 | 1.33M |     } | 
| 107 | 1.33M |     return len; | 
| 108 | 1.33M | } | 
| 109 |  |  | 
| 110 |  | size_t BUF_MEM_grow_clean(BUF_MEM *str, size_t len) | 
| 111 | 705M | { | 
| 112 | 705M |     char *ret; | 
| 113 | 705M |     size_t n; | 
| 114 |  |  | 
| 115 | 705M |     if (str->length >= len) { | 
| 116 | 77.8k |         if (str->data != NULL) | 
| 117 | 77.8k |             memset(&str->data[len], 0, str->length - len); | 
| 118 | 77.8k |         str->length = len; | 
| 119 | 77.8k |         return len; | 
| 120 | 77.8k |     } | 
| 121 | 705M |     if (str->max >= len) { | 
| 122 | 691M |         memset(&str->data[str->length], 0, len - str->length); | 
| 123 | 691M |         str->length = len; | 
| 124 | 691M |         return len; | 
| 125 | 691M |     } | 
| 126 |  |     /* This limit is sufficient to ensure (len+3)/3*4 < 2**31 */ | 
| 127 | 14.2M |     if (len > LIMIT_BEFORE_EXPANSION) { | 
| 128 | 0 |         BUFerr(BUF_F_BUF_MEM_GROW_CLEAN, ERR_R_MALLOC_FAILURE); | 
| 129 | 0 |         return 0; | 
| 130 | 0 |     } | 
| 131 | 14.2M |     n = (len + 3) / 3 * 4; | 
| 132 | 14.2M |     if ((str->flags & BUF_MEM_FLAG_SECURE)) | 
| 133 | 43.9k |         ret = sec_alloc_realloc(str, n); | 
| 134 | 14.1M |     else | 
| 135 | 14.1M |         ret = OPENSSL_clear_realloc(str->data, str->max, n); | 
| 136 | 14.2M |     if (ret == NULL) { | 
| 137 | 0 |         BUFerr(BUF_F_BUF_MEM_GROW_CLEAN, ERR_R_MALLOC_FAILURE); | 
| 138 | 0 |         len = 0; | 
| 139 | 14.2M |     } else { | 
| 140 | 14.2M |         str->data = ret; | 
| 141 | 14.2M |         str->max = n; | 
| 142 | 14.2M |         memset(&str->data[str->length], 0, len - str->length); | 
| 143 | 14.2M |         str->length = len; | 
| 144 | 14.2M |     } | 
| 145 | 14.2M |     return len; | 
| 146 | 14.2M | } | 
| 147 |  |  | 
| 148 |  | void BUF_reverse(unsigned char *out, const unsigned char *in, size_t size) | 
| 149 | 0 | { | 
| 150 | 0 |     size_t i; | 
| 151 | 0 |     if (in) { | 
| 152 | 0 |         out += size - 1; | 
| 153 | 0 |         for (i = 0; i < size; i++) | 
| 154 | 0 |             *out-- = *in++; | 
| 155 | 0 |     } else { | 
| 156 | 0 |         unsigned char *q; | 
| 157 | 0 |         char c; | 
| 158 | 0 |         q = out + size - 1; | 
| 159 | 0 |         for (i = 0; i < size / 2; i++) { | 
| 160 | 0 |             c = *q; | 
| 161 | 0 |             *q-- = *out; | 
| 162 | 0 |             *out++ = c; | 
| 163 | 0 |         } | 
| 164 | 0 |     } | 
| 165 | 0 | } |