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.

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269
  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/mem.h>
  57. #include <assert.h>
  58. #include <stdarg.h>
  59. #include <stdio.h>
  60. #if defined(OPENSSL_WINDOWS)
  61. OPENSSL_MSVC_PRAGMA(warning(push, 3))
  62. #include <windows.h>
  63. OPENSSL_MSVC_PRAGMA(warning(pop))
  64. #endif
  65. #include "internal.h"
  66. #define OPENSSL_MALLOC_PREFIX 8
  67. #if defined(OPENSSL_ASAN)
  68. void __asan_poison_memory_region(const volatile void *addr, size_t size);
  69. void __asan_unpoison_memory_region(const volatile void *addr, size_t size);
  70. #else
  71. static void __asan_poison_memory_region(const void *addr, size_t size) {}
  72. static void __asan_unpoison_memory_region(const void *addr, size_t size) {}
  73. #endif
  74. #if defined(__GNUC__) || defined(__clang__)
  75. // sdallocx is a sized |free| function. By passing the size (which we happen to
  76. // always know in BoringSSL), the malloc implementation can save work. We cannot
  77. // depend on |sdallocx| being available so we declare a wrapper that falls back
  78. // to |free| as a weak symbol.
  79. //
  80. // This will always be safe, but will only be overridden if the malloc
  81. // implementation is statically linked with BoringSSL. So, if |sdallocx| is
  82. // provided in, say, libc.so, we still won't use it because that's dynamically
  83. // linked. This isn't an ideal result, but its helps in some cases.
  84. void sdallocx(void *ptr, size_t size, int flags);
  85. __attribute((weak, noinline))
  86. #else
  87. static
  88. #endif
  89. void sdallocx(void *ptr, size_t size, int flags) {
  90. free(ptr);
  91. }
  92. void *OPENSSL_malloc(size_t size) {
  93. void *ptr = malloc(size + OPENSSL_MALLOC_PREFIX);
  94. if (ptr == NULL) {
  95. return NULL;
  96. }
  97. *(size_t *)ptr = size;
  98. __asan_poison_memory_region(ptr, OPENSSL_MALLOC_PREFIX);
  99. return ((uint8_t *)ptr) + OPENSSL_MALLOC_PREFIX;
  100. }
  101. void OPENSSL_free(void *orig_ptr) {
  102. if (orig_ptr == NULL) {
  103. return;
  104. }
  105. void *ptr = ((uint8_t *)orig_ptr) - OPENSSL_MALLOC_PREFIX;
  106. __asan_unpoison_memory_region(ptr, OPENSSL_MALLOC_PREFIX);
  107. size_t size = *(size_t *)ptr;
  108. OPENSSL_cleanse(ptr, size + OPENSSL_MALLOC_PREFIX);
  109. sdallocx(ptr, size + OPENSSL_MALLOC_PREFIX, 0 /* flags */);
  110. }
  111. void *OPENSSL_realloc(void *orig_ptr, size_t new_size) {
  112. if (orig_ptr == NULL) {
  113. return OPENSSL_malloc(new_size);
  114. }
  115. void *ptr = ((uint8_t *)orig_ptr) - OPENSSL_MALLOC_PREFIX;
  116. __asan_unpoison_memory_region(ptr, OPENSSL_MALLOC_PREFIX);
  117. size_t old_size = *(size_t *)ptr;
  118. __asan_poison_memory_region(ptr, OPENSSL_MALLOC_PREFIX);
  119. void *ret = OPENSSL_malloc(new_size);
  120. if (ret == NULL) {
  121. return NULL;
  122. }
  123. size_t to_copy = new_size;
  124. if (old_size < to_copy) {
  125. to_copy = old_size;
  126. }
  127. memcpy(ret, orig_ptr, to_copy);
  128. OPENSSL_free(orig_ptr);
  129. return ret;
  130. }
  131. void OPENSSL_cleanse(void *ptr, size_t len) {
  132. #if defined(OPENSSL_WINDOWS)
  133. SecureZeroMemory(ptr, len);
  134. #else
  135. OPENSSL_memset(ptr, 0, len);
  136. #if !defined(OPENSSL_NO_ASM)
  137. /* As best as we can tell, this is sufficient to break any optimisations that
  138. might try to eliminate "superfluous" memsets. If there's an easy way to
  139. detect memset_s, it would be better to use that. */
  140. __asm__ __volatile__("" : : "r"(ptr) : "memory");
  141. #endif
  142. #endif // !OPENSSL_NO_ASM
  143. }
  144. void OPENSSL_clear_free(void *ptr, size_t unused) {
  145. OPENSSL_free(ptr);
  146. }
  147. int CRYPTO_memcmp(const void *in_a, const void *in_b, size_t len) {
  148. const uint8_t *a = in_a;
  149. const uint8_t *b = in_b;
  150. uint8_t x = 0;
  151. for (size_t i = 0; i < len; i++) {
  152. x |= a[i] ^ b[i];
  153. }
  154. return x;
  155. }
  156. uint32_t OPENSSL_hash32(const void *ptr, size_t len) {
  157. // These are the FNV-1a parameters for 32 bits.
  158. static const uint32_t kPrime = 16777619u;
  159. static const uint32_t kOffsetBasis = 2166136261u;
  160. const uint8_t *in = ptr;
  161. uint32_t h = kOffsetBasis;
  162. for (size_t i = 0; i < len; i++) {
  163. h ^= in[i];
  164. h *= kPrime;
  165. }
  166. return h;
  167. }
  168. size_t OPENSSL_strnlen(const char *s, size_t len) {
  169. for (size_t i = 0; i < len; i++) {
  170. if (s[i] == 0) {
  171. return i;
  172. }
  173. }
  174. return len;
  175. }
  176. char *OPENSSL_strdup(const char *s) {
  177. const size_t len = strlen(s) + 1;
  178. char *ret = OPENSSL_malloc(len);
  179. if (ret == NULL) {
  180. return NULL;
  181. }
  182. OPENSSL_memcpy(ret, s, len);
  183. return ret;
  184. }
  185. int OPENSSL_tolower(int c) {
  186. if (c >= 'A' && c <= 'Z') {
  187. return c + ('a' - 'A');
  188. }
  189. return c;
  190. }
  191. int OPENSSL_strcasecmp(const char *a, const char *b) {
  192. for (size_t i = 0;; i++) {
  193. const int aa = OPENSSL_tolower(a[i]);
  194. const int bb = OPENSSL_tolower(b[i]);
  195. if (aa < bb) {
  196. return -1;
  197. } else if (aa > bb) {
  198. return 1;
  199. } else if (aa == 0) {
  200. return 0;
  201. }
  202. }
  203. }
  204. int OPENSSL_strncasecmp(const char *a, const char *b, size_t n) {
  205. for (size_t i = 0; i < n; i++) {
  206. const int aa = OPENSSL_tolower(a[i]);
  207. const int bb = OPENSSL_tolower(b[i]);
  208. if (aa < bb) {
  209. return -1;
  210. } else if (aa > bb) {
  211. return 1;
  212. } else if (aa == 0) {
  213. return 0;
  214. }
  215. }
  216. return 0;
  217. }
  218. int BIO_snprintf(char *buf, size_t n, const char *format, ...) {
  219. va_list args;
  220. va_start(args, format);
  221. int ret = BIO_vsnprintf(buf, n, format, args);
  222. va_end(args);
  223. return ret;
  224. }
  225. int BIO_vsnprintf(char *buf, size_t n, const char *format, va_list args) {
  226. return vsnprintf(buf, n, format, args);
  227. }