You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 

233 line
6.4 KiB

  1. /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
  2. * All rights reserved.
  3. *
  4. * This package is an SSL implementation written
  5. * by Eric Young (eay@cryptsoft.com).
  6. * The implementation was written so as to conform with Netscapes SSL.
  7. *
  8. * This library is free for commercial and non-commercial use as long as
  9. * the following conditions are aheared to. The following conditions
  10. * apply to all code found in this distribution, be it the RC4, RSA,
  11. * lhash, DES, etc., code; not just the SSL code. The SSL documentation
  12. * included with this distribution is covered by the same copyright terms
  13. * except that the holder is Tim Hudson (tjh@cryptsoft.com).
  14. *
  15. * Copyright remains Eric Young's, and as such any Copyright notices in
  16. * the code are not to be removed.
  17. * If this package is used in a product, Eric Young should be given attribution
  18. * as the author of the parts of the library used.
  19. * This can be in the form of a textual message at program startup or
  20. * in documentation (online or textual) provided with the package.
  21. *
  22. * Redistribution and use in source and binary forms, with or without
  23. * modification, are permitted provided that the following conditions
  24. * are met:
  25. * 1. Redistributions of source code must retain the copyright
  26. * notice, this list of conditions and the following disclaimer.
  27. * 2. Redistributions in binary form must reproduce the above copyright
  28. * notice, this list of conditions and the following disclaimer in the
  29. * documentation and/or other materials provided with the distribution.
  30. * 3. All advertising materials mentioning features or use of this software
  31. * must display the following acknowledgement:
  32. * "This product includes cryptographic software written by
  33. * Eric Young (eay@cryptsoft.com)"
  34. * The word 'cryptographic' can be left out if the rouines from the library
  35. * being used are not cryptographic related :-).
  36. * 4. If you include any Windows specific code (or a derivative thereof) from
  37. * the apps directory (application code) you must include an acknowledgement:
  38. * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
  39. *
  40. * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
  41. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  42. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  43. * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  44. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  45. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  46. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  47. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  48. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  49. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  50. * SUCH DAMAGE.
  51. *
  52. * The licence and distribution terms for any publically available version or
  53. * derivative of this code cannot be changed. i.e. this code cannot simply be
  54. * copied and put under another distribution licence
  55. * [including the GNU Public Licence.] */
  56. #include <openssl/buf.h>
  57. #include <openssl/mem.h>
  58. #include <openssl/err.h>
  59. BUF_MEM *BUF_MEM_new(void) {
  60. BUF_MEM *ret;
  61. ret = OPENSSL_malloc(sizeof(BUF_MEM));
  62. if (ret == NULL) {
  63. OPENSSL_PUT_ERROR(BUF, BUF_MEM_new, ERR_R_MALLOC_FAILURE);
  64. return NULL;
  65. }
  66. memset(ret, 0, sizeof(BUF_MEM));
  67. return ret;
  68. }
  69. void BUF_MEM_free(BUF_MEM *buf) {
  70. if (buf == NULL) {
  71. return;
  72. }
  73. if (buf->data != NULL) {
  74. OPENSSL_cleanse(buf->data, buf->max);
  75. OPENSSL_free(buf->data);
  76. }
  77. OPENSSL_free(buf);
  78. }
  79. static size_t buf_mem_grow(BUF_MEM *buf, size_t len, char clean) {
  80. char *new_buf;
  81. size_t n, alloc_size;
  82. if (buf->length >= len) {
  83. buf->length = len;
  84. return len;
  85. }
  86. if (buf->max >= len) {
  87. memset(&buf->data[buf->length], 0, len - buf->length);
  88. buf->length = len;
  89. return len;
  90. }
  91. n = len + 3;
  92. if (n < len) {
  93. /* overflow */
  94. OPENSSL_PUT_ERROR(BUF, buf_mem_grow, ERR_R_MALLOC_FAILURE);
  95. return 0;
  96. }
  97. n = n / 3;
  98. alloc_size = n * 4;
  99. if (alloc_size / 4 != n) {
  100. /* overflow */
  101. OPENSSL_PUT_ERROR(BUF, buf_mem_grow, ERR_R_MALLOC_FAILURE);
  102. return 0;
  103. }
  104. if (buf->data == NULL) {
  105. new_buf = OPENSSL_malloc(alloc_size);
  106. } else {
  107. if (clean) {
  108. new_buf = OPENSSL_realloc_clean(buf->data, buf->max, alloc_size);
  109. } else {
  110. new_buf = OPENSSL_realloc(buf->data, alloc_size);
  111. }
  112. }
  113. if (new_buf == NULL) {
  114. OPENSSL_PUT_ERROR(BUF, buf_mem_grow, ERR_R_MALLOC_FAILURE);
  115. len = 0;
  116. } else {
  117. buf->data = new_buf;
  118. buf->max = alloc_size;
  119. memset(&buf->data[buf->length], 0, len - buf->length);
  120. buf->length = len;
  121. }
  122. return len;
  123. }
  124. size_t BUF_MEM_grow(BUF_MEM *buf, size_t len) {
  125. return buf_mem_grow(buf, len, 0 /* don't clear old buffer contents. */);
  126. }
  127. size_t BUF_MEM_grow_clean(BUF_MEM *buf, size_t len) {
  128. return buf_mem_grow(buf, len, 1 /* clear old buffer contents. */);
  129. }
  130. char *BUF_strdup(const char *buf) {
  131. if (buf == NULL) {
  132. return NULL;
  133. }
  134. return BUF_strndup(buf, strlen(buf));
  135. }
  136. size_t BUF_strnlen(const char *str, size_t max_len) {
  137. size_t i;
  138. for (i = 0; i < max_len; i++) {
  139. if (str[i] == 0) {
  140. break;
  141. }
  142. }
  143. return i;
  144. }
  145. char *BUF_strndup(const char *buf, size_t size) {
  146. char *ret;
  147. size_t alloc_size;
  148. if (buf == NULL) {
  149. return NULL;
  150. }
  151. size = BUF_strnlen(buf, size);
  152. alloc_size = size + 1;
  153. if (alloc_size < size) {
  154. /* overflow */
  155. OPENSSL_PUT_ERROR(BUF, BUF_strndup, ERR_R_MALLOC_FAILURE);
  156. return NULL;
  157. }
  158. ret = OPENSSL_malloc(alloc_size);
  159. if (ret == NULL) {
  160. OPENSSL_PUT_ERROR(BUF, BUF_strndup, ERR_R_MALLOC_FAILURE);
  161. return NULL;
  162. }
  163. BUF_strlcpy(ret, buf, alloc_size);
  164. return ret;
  165. }
  166. size_t BUF_strlcpy(char *dst, const char *src, size_t dst_size) {
  167. size_t l = 0;
  168. for (; dst_size > 1 && *src; dst_size--) {
  169. *dst++ = *src++;
  170. l++;
  171. }
  172. if (dst_size) {
  173. *dst = 0;
  174. }
  175. return l + strlen(src);
  176. }
  177. size_t BUF_strlcat(char *dst, const char *src, size_t dst_size) {
  178. size_t l = 0;
  179. for (; dst_size > 0 && *dst; dst_size--, dst++) {
  180. l++;
  181. }
  182. return l + BUF_strlcpy(dst, src, dst_size);
  183. }
  184. void *BUF_memdup(const void *data, size_t dst_size) {
  185. void *ret;
  186. if (data == NULL) {
  187. return NULL;
  188. }
  189. ret = OPENSSL_malloc(dst_size);
  190. if (ret == NULL) {
  191. OPENSSL_PUT_ERROR(BUF, BUF_memdup, ERR_R_MALLOC_FAILURE);
  192. return NULL;
  193. }
  194. memcpy(ret, data, dst_size);
  195. return ret;
  196. }