buffer.c 6.0 KB

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