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