a_d2i_fp.c 9.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285
  1. /* crypto/asn1/a_d2i_fp.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 <limits.h>
  60. #include "cryptlib.h"
  61. #include <openssl/buffer.h>
  62. #include <openssl/asn1_mac.h>
  63. static int asn1_d2i_read_bio(BIO *in, BUF_MEM **pb);
  64. #ifndef NO_OLD_ASN1
  65. # ifndef OPENSSL_NO_FP_API
  66. void *ASN1_d2i_fp(void *(*xnew) (void), d2i_of_void *d2i, FILE *in, void **x)
  67. {
  68. BIO *b;
  69. void *ret;
  70. if ((b = BIO_new(BIO_s_file())) == NULL) {
  71. ASN1err(ASN1_F_ASN1_D2I_FP, ERR_R_BUF_LIB);
  72. return (NULL);
  73. }
  74. BIO_set_fp(b, in, BIO_NOCLOSE);
  75. ret = ASN1_d2i_bio(xnew, d2i, b, x);
  76. BIO_free(b);
  77. return (ret);
  78. }
  79. # endif
  80. void *ASN1_d2i_bio(void *(*xnew) (void), d2i_of_void *d2i, BIO *in, void **x)
  81. {
  82. BUF_MEM *b = NULL;
  83. const unsigned char *p;
  84. void *ret = NULL;
  85. int len;
  86. len = asn1_d2i_read_bio(in, &b);
  87. if (len < 0)
  88. goto err;
  89. p = (unsigned char *)b->data;
  90. ret = d2i(x, &p, len);
  91. err:
  92. if (b != NULL)
  93. BUF_MEM_free(b);
  94. return (ret);
  95. }
  96. #endif
  97. void *ASN1_item_d2i_bio(const ASN1_ITEM *it, BIO *in, void *x)
  98. {
  99. BUF_MEM *b = NULL;
  100. const unsigned char *p;
  101. void *ret = NULL;
  102. int len;
  103. len = asn1_d2i_read_bio(in, &b);
  104. if (len < 0)
  105. goto err;
  106. p = (const unsigned char *)b->data;
  107. ret = ASN1_item_d2i(x, &p, len, it);
  108. err:
  109. if (b != NULL)
  110. BUF_MEM_free(b);
  111. return (ret);
  112. }
  113. #ifndef OPENSSL_NO_FP_API
  114. void *ASN1_item_d2i_fp(const ASN1_ITEM *it, FILE *in, void *x)
  115. {
  116. BIO *b;
  117. char *ret;
  118. if ((b = BIO_new(BIO_s_file())) == NULL) {
  119. ASN1err(ASN1_F_ASN1_ITEM_D2I_FP, ERR_R_BUF_LIB);
  120. return (NULL);
  121. }
  122. BIO_set_fp(b, in, BIO_NOCLOSE);
  123. ret = ASN1_item_d2i_bio(it, b, x);
  124. BIO_free(b);
  125. return (ret);
  126. }
  127. #endif
  128. #define HEADER_SIZE 8
  129. #define ASN1_CHUNK_INITIAL_SIZE (16 * 1024)
  130. static int asn1_d2i_read_bio(BIO *in, BUF_MEM **pb)
  131. {
  132. BUF_MEM *b;
  133. unsigned char *p;
  134. int i;
  135. ASN1_const_CTX c;
  136. size_t want = HEADER_SIZE;
  137. int eos = 0;
  138. size_t off = 0;
  139. size_t len = 0;
  140. b = BUF_MEM_new();
  141. if (b == NULL) {
  142. ASN1err(ASN1_F_ASN1_D2I_READ_BIO, ERR_R_MALLOC_FAILURE);
  143. return -1;
  144. }
  145. ERR_clear_error();
  146. for (;;) {
  147. if (want >= (len - off)) {
  148. want -= (len - off);
  149. if (len + want < len || !BUF_MEM_grow_clean(b, len + want)) {
  150. ASN1err(ASN1_F_ASN1_D2I_READ_BIO, ERR_R_MALLOC_FAILURE);
  151. goto err;
  152. }
  153. i = BIO_read(in, &(b->data[len]), want);
  154. if ((i < 0) && ((len - off) == 0)) {
  155. ASN1err(ASN1_F_ASN1_D2I_READ_BIO, ASN1_R_NOT_ENOUGH_DATA);
  156. goto err;
  157. }
  158. if (i > 0) {
  159. if (len + i < len) {
  160. ASN1err(ASN1_F_ASN1_D2I_READ_BIO, ASN1_R_TOO_LONG);
  161. goto err;
  162. }
  163. len += i;
  164. }
  165. }
  166. /* else data already loaded */
  167. p = (unsigned char *)&(b->data[off]);
  168. c.p = p;
  169. c.inf = ASN1_get_object(&(c.p), &(c.slen), &(c.tag), &(c.xclass),
  170. len - off);
  171. if (c.inf & 0x80) {
  172. unsigned long e;
  173. e = ERR_GET_REASON(ERR_peek_error());
  174. if (e != ASN1_R_TOO_LONG)
  175. goto err;
  176. else
  177. ERR_clear_error(); /* clear error */
  178. }
  179. i = c.p - p; /* header length */
  180. off += i; /* end of data */
  181. if (c.inf & 1) {
  182. /* no data body so go round again */
  183. eos++;
  184. if (eos < 0) {
  185. ASN1err(ASN1_F_ASN1_D2I_READ_BIO, ASN1_R_HEADER_TOO_LONG);
  186. goto err;
  187. }
  188. want = HEADER_SIZE;
  189. } else if (eos && (c.slen == 0) && (c.tag == V_ASN1_EOC)) {
  190. /* eos value, so go back and read another header */
  191. eos--;
  192. if (eos <= 0)
  193. break;
  194. else
  195. want = HEADER_SIZE;
  196. } else {
  197. /* suck in c.slen bytes of data */
  198. want = c.slen;
  199. if (want > (len - off)) {
  200. size_t chunk_max = ASN1_CHUNK_INITIAL_SIZE;
  201. want -= (len - off);
  202. if (want > INT_MAX /* BIO_read takes an int length */ ||
  203. len + want < len) {
  204. ASN1err(ASN1_F_ASN1_D2I_READ_BIO, ASN1_R_TOO_LONG);
  205. goto err;
  206. }
  207. while (want > 0) {
  208. /*
  209. * Read content in chunks of increasing size
  210. * so we can return an error for EOF without
  211. * having to allocate the entire content length
  212. * in one go.
  213. */
  214. size_t chunk = want > chunk_max ? chunk_max : want;
  215. if (!BUF_MEM_grow_clean(b, len + chunk)) {
  216. ASN1err(ASN1_F_ASN1_D2I_READ_BIO, ERR_R_MALLOC_FAILURE);
  217. goto err;
  218. }
  219. want -= chunk;
  220. while (chunk > 0) {
  221. i = BIO_read(in, &(b->data[len]), chunk);
  222. if (i <= 0) {
  223. ASN1err(ASN1_F_ASN1_D2I_READ_BIO,
  224. ASN1_R_NOT_ENOUGH_DATA);
  225. goto err;
  226. }
  227. /*
  228. * This can't overflow because |len+want| didn't
  229. * overflow.
  230. */
  231. len += i;
  232. chunk -= i;
  233. }
  234. if (chunk_max < INT_MAX/2)
  235. chunk_max *= 2;
  236. }
  237. }
  238. if (off + c.slen < off) {
  239. ASN1err(ASN1_F_ASN1_D2I_READ_BIO, ASN1_R_TOO_LONG);
  240. goto err;
  241. }
  242. off += c.slen;
  243. if (eos <= 0) {
  244. break;
  245. } else
  246. want = HEADER_SIZE;
  247. }
  248. }
  249. if (off > INT_MAX) {
  250. ASN1err(ASN1_F_ASN1_D2I_READ_BIO, ASN1_R_TOO_LONG);
  251. goto err;
  252. }
  253. *pb = b;
  254. return off;
  255. err:
  256. if (b != NULL)
  257. BUF_MEM_free(b);
  258. return -1;
  259. }