a_d2i_fp.c 8.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267
  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 "internal/cryptlib.h"
  61. #include <openssl/buffer.h>
  62. #include <openssl/asn1.h>
  63. static int asn1_d2i_read_bio(BIO *in, BUF_MEM **pb);
  64. #ifndef NO_OLD_ASN1
  65. # ifndef OPENSSL_NO_STDIO
  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. BUF_MEM_free(b);
  93. return (ret);
  94. }
  95. #endif
  96. void *ASN1_item_d2i_bio(const ASN1_ITEM *it, BIO *in, void *x)
  97. {
  98. BUF_MEM *b = NULL;
  99. const unsigned char *p;
  100. void *ret = NULL;
  101. int len;
  102. len = asn1_d2i_read_bio(in, &b);
  103. if (len < 0)
  104. goto err;
  105. p = (const unsigned char *)b->data;
  106. ret = ASN1_item_d2i(x, &p, len, it);
  107. err:
  108. BUF_MEM_free(b);
  109. return (ret);
  110. }
  111. #ifndef OPENSSL_NO_STDIO
  112. void *ASN1_item_d2i_fp(const ASN1_ITEM *it, FILE *in, void *x)
  113. {
  114. BIO *b;
  115. char *ret;
  116. if ((b = BIO_new(BIO_s_file())) == NULL) {
  117. ASN1err(ASN1_F_ASN1_ITEM_D2I_FP, ERR_R_BUF_LIB);
  118. return (NULL);
  119. }
  120. BIO_set_fp(b, in, BIO_NOCLOSE);
  121. ret = ASN1_item_d2i_bio(it, b, x);
  122. BIO_free(b);
  123. return (ret);
  124. }
  125. #endif
  126. #define HEADER_SIZE 8
  127. static int asn1_d2i_read_bio(BIO *in, BUF_MEM **pb)
  128. {
  129. BUF_MEM *b;
  130. unsigned char *p;
  131. int i;
  132. size_t want = HEADER_SIZE;
  133. int eos = 0;
  134. size_t off = 0;
  135. size_t len = 0;
  136. const unsigned char *q;
  137. long slen;
  138. int inf, tag, xclass;
  139. b = BUF_MEM_new();
  140. if (b == NULL) {
  141. ASN1err(ASN1_F_ASN1_D2I_READ_BIO, ERR_R_MALLOC_FAILURE);
  142. return -1;
  143. }
  144. ERR_clear_error();
  145. for (;;) {
  146. if (want >= (len - off)) {
  147. want -= (len - off);
  148. if (len + want < len || !BUF_MEM_grow_clean(b, len + want)) {
  149. ASN1err(ASN1_F_ASN1_D2I_READ_BIO, ERR_R_MALLOC_FAILURE);
  150. goto err;
  151. }
  152. i = BIO_read(in, &(b->data[len]), want);
  153. if ((i < 0) && ((len - off) == 0)) {
  154. ASN1err(ASN1_F_ASN1_D2I_READ_BIO, ASN1_R_NOT_ENOUGH_DATA);
  155. goto err;
  156. }
  157. if (i > 0) {
  158. if (len + i < len) {
  159. ASN1err(ASN1_F_ASN1_D2I_READ_BIO, ASN1_R_TOO_LONG);
  160. goto err;
  161. }
  162. len += i;
  163. }
  164. }
  165. /* else data already loaded */
  166. p = (unsigned char *)&(b->data[off]);
  167. q = p;
  168. inf = ASN1_get_object(&q, &slen, &tag, &xclass, len - off);
  169. if (inf & 0x80) {
  170. unsigned long e;
  171. e = ERR_GET_REASON(ERR_peek_error());
  172. if (e != ASN1_R_TOO_LONG)
  173. goto err;
  174. else
  175. ERR_clear_error(); /* clear error */
  176. }
  177. i = q - p; /* header length */
  178. off += i; /* end of data */
  179. if (inf & 1) {
  180. /* no data body so go round again */
  181. eos++;
  182. if (eos < 0) {
  183. ASN1err(ASN1_F_ASN1_D2I_READ_BIO, ASN1_R_HEADER_TOO_LONG);
  184. goto err;
  185. }
  186. want = HEADER_SIZE;
  187. } else if (eos && (slen == 0) && (tag == V_ASN1_EOC)) {
  188. /* eos value, so go back and read another header */
  189. eos--;
  190. if (eos <= 0)
  191. break;
  192. else
  193. want = HEADER_SIZE;
  194. } else {
  195. /* suck in slen bytes of data */
  196. want = slen;
  197. if (want > (len - off)) {
  198. want -= (len - off);
  199. if (want > INT_MAX /* BIO_read takes an int length */ ||
  200. len + want < len) {
  201. ASN1err(ASN1_F_ASN1_D2I_READ_BIO, ASN1_R_TOO_LONG);
  202. goto err;
  203. }
  204. if (!BUF_MEM_grow_clean(b, len + want)) {
  205. ASN1err(ASN1_F_ASN1_D2I_READ_BIO, ERR_R_MALLOC_FAILURE);
  206. goto err;
  207. }
  208. while (want > 0) {
  209. i = BIO_read(in, &(b->data[len]), want);
  210. if (i <= 0) {
  211. ASN1err(ASN1_F_ASN1_D2I_READ_BIO,
  212. ASN1_R_NOT_ENOUGH_DATA);
  213. goto err;
  214. }
  215. /*
  216. * This can't overflow because |len+want| didn't
  217. * overflow.
  218. */
  219. len += i;
  220. want -= i;
  221. }
  222. }
  223. if (off + slen < off) {
  224. ASN1err(ASN1_F_ASN1_D2I_READ_BIO, ASN1_R_TOO_LONG);
  225. goto err;
  226. }
  227. off += slen;
  228. if (eos <= 0) {
  229. break;
  230. } else
  231. want = HEADER_SIZE;
  232. }
  233. }
  234. if (off > INT_MAX) {
  235. ASN1err(ASN1_F_ASN1_D2I_READ_BIO, ASN1_R_TOO_LONG);
  236. goto err;
  237. }
  238. *pb = b;
  239. return off;
  240. err:
  241. BUF_MEM_free(b);
  242. return -1;
  243. }