]>
Commit | Line | Data |
---|---|---|
9d6b1ce6 | 1 | /* tasn_dec.c */ |
0f113f3e MC |
2 | /* |
3 | * Written by Dr Stephen N Henson (steve@openssl.org) for the OpenSSL project | |
4 | * 2000. | |
9d6b1ce6 DSH |
5 | */ |
6 | /* ==================================================================== | |
7bdeeb64 | 7 | * Copyright (c) 2000-2005 The OpenSSL Project. All rights reserved. |
9d6b1ce6 DSH |
8 | * |
9 | * Redistribution and use in source and binary forms, with or without | |
10 | * modification, are permitted provided that the following conditions | |
11 | * are met: | |
12 | * | |
13 | * 1. Redistributions of source code must retain the above copyright | |
0f113f3e | 14 | * notice, this list of conditions and the following disclaimer. |
9d6b1ce6 DSH |
15 | * |
16 | * 2. Redistributions in binary form must reproduce the above copyright | |
17 | * notice, this list of conditions and the following disclaimer in | |
18 | * the documentation and/or other materials provided with the | |
19 | * distribution. | |
20 | * | |
21 | * 3. All advertising materials mentioning features or use of this | |
22 | * software must display the following acknowledgment: | |
23 | * "This product includes software developed by the OpenSSL Project | |
24 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | |
25 | * | |
26 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | |
27 | * endorse or promote products derived from this software without | |
28 | * prior written permission. For written permission, please contact | |
29 | * licensing@OpenSSL.org. | |
30 | * | |
31 | * 5. Products derived from this software may not be called "OpenSSL" | |
32 | * nor may "OpenSSL" appear in their names without prior written | |
33 | * permission of the OpenSSL Project. | |
34 | * | |
35 | * 6. Redistributions of any form whatsoever must retain the following | |
36 | * acknowledgment: | |
37 | * "This product includes software developed by the OpenSSL Project | |
38 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | |
39 | * | |
40 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | |
41 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
42 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | |
43 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | |
44 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
45 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | |
46 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | |
47 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
48 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | |
49 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | |
50 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | |
51 | * OF THE POSSIBILITY OF SUCH DAMAGE. | |
52 | * ==================================================================== | |
53 | * | |
54 | * This product includes cryptographic software written by Eric Young | |
55 | * (eay@cryptsoft.com). This product includes software written by Tim | |
56 | * Hudson (tjh@cryptsoft.com). | |
57 | * | |
58 | */ | |
59 | ||
9d6b1ce6 | 60 | #include <stddef.h> |
a9daa467 | 61 | #include <string.h> |
9d6b1ce6 DSH |
62 | #include <openssl/asn1.h> |
63 | #include <openssl/asn1t.h> | |
64 | #include <openssl/objects.h> | |
65 | #include <openssl/buffer.h> | |
66 | #include <openssl/err.h> | |
c1ee50aa | 67 | #include "asn1_locl.h" |
9d6b1ce6 | 68 | |
f93ad22f DSH |
69 | static int asn1_item_embed_d2i(ASN1_VALUE **pval, const unsigned char **in, |
70 | long len, const ASN1_ITEM *it, | |
71 | int tag, int aclass, char opt, ASN1_TLC *ctx); | |
72 | ||
875a644a | 73 | static int asn1_check_eoc(const unsigned char **in, long len); |
e1cc0671 | 74 | static int asn1_find_end(const unsigned char **in, long len, char inf); |
8845420f DSH |
75 | |
76 | static int asn1_collect(BUF_MEM *buf, const unsigned char **in, long len, | |
0f113f3e | 77 | char inf, int tag, int aclass, int depth); |
8845420f | 78 | |
875a644a | 79 | static int collect_data(BUF_MEM *buf, const unsigned char **p, long plen); |
8845420f DSH |
80 | |
81 | static int asn1_check_tlen(long *olen, int *otag, unsigned char *oclass, | |
0f113f3e MC |
82 | char *inf, char *cst, |
83 | const unsigned char **in, long len, | |
84 | int exptag, int expclass, char opt, ASN1_TLC *ctx); | |
8845420f DSH |
85 | |
86 | static int asn1_template_ex_d2i(ASN1_VALUE **pval, | |
0f113f3e MC |
87 | const unsigned char **in, long len, |
88 | const ASN1_TEMPLATE *tt, char opt, | |
89 | ASN1_TLC *ctx); | |
8845420f | 90 | static int asn1_template_noexp_d2i(ASN1_VALUE **val, |
0f113f3e MC |
91 | const unsigned char **in, long len, |
92 | const ASN1_TEMPLATE *tt, char opt, | |
93 | ASN1_TLC *ctx); | |
8845420f | 94 | static int asn1_d2i_ex_primitive(ASN1_VALUE **pval, |
0f113f3e MC |
95 | const unsigned char **in, long len, |
96 | const ASN1_ITEM *it, | |
97 | int tag, int aclass, char opt, | |
98 | ASN1_TLC *ctx); | |
23dc1706 DSH |
99 | static int asn1_ex_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, |
100 | int utype, char *free_cont, const ASN1_ITEM *it); | |
9d6b1ce6 | 101 | |
1241126a | 102 | /* Table to convert tags to bit values, used for MSTRING type */ |
2d3e956a | 103 | static const unsigned long tag2bit[32] = { |
b853717f | 104 | /* tags 0 - 3 */ |
0f113f3e | 105 | 0, 0, 0, B_ASN1_BIT_STRING, |
b853717f | 106 | /* tags 4- 7 */ |
0f113f3e | 107 | B_ASN1_OCTET_STRING, 0, 0, B_ASN1_UNKNOWN, |
b853717f | 108 | /* tags 8-11 */ |
0f113f3e | 109 | B_ASN1_UNKNOWN, B_ASN1_UNKNOWN, B_ASN1_UNKNOWN, B_ASN1_UNKNOWN, |
b853717f | 110 | /* tags 12-15 */ |
0f113f3e | 111 | B_ASN1_UTF8STRING, B_ASN1_UNKNOWN, B_ASN1_UNKNOWN, B_ASN1_UNKNOWN, |
b853717f | 112 | /* tags 16-19 */ |
0f113f3e | 113 | B_ASN1_SEQUENCE, 0, B_ASN1_NUMERICSTRING, B_ASN1_PRINTABLESTRING, |
b853717f | 114 | /* tags 20-22 */ |
0f113f3e | 115 | B_ASN1_T61STRING, B_ASN1_VIDEOTEXSTRING, B_ASN1_IA5STRING, |
b853717f | 116 | /* tags 23-24 */ |
0f113f3e | 117 | B_ASN1_UTCTIME, B_ASN1_GENERALIZEDTIME, |
b853717f | 118 | /* tags 25-27 */ |
0f113f3e | 119 | B_ASN1_GRAPHICSTRING, B_ASN1_ISO64STRING, B_ASN1_GENERALSTRING, |
b853717f | 120 | /* tags 28-31 */ |
0f113f3e MC |
121 | B_ASN1_UNIVERSALSTRING, B_ASN1_UNKNOWN, B_ASN1_BMPSTRING, B_ASN1_UNKNOWN, |
122 | }; | |
1241126a DSH |
123 | |
124 | unsigned long ASN1_tag2bit(int tag) | |
0f113f3e MC |
125 | { |
126 | if ((tag < 0) || (tag > 30)) | |
127 | return 0; | |
128 | return tag2bit[tag]; | |
129 | } | |
1241126a | 130 | |
9d6b1ce6 DSH |
131 | /* Macro to initialize and invalidate the cache */ |
132 | ||
0f113f3e | 133 | #define asn1_tlc_clear(c) if (c) (c)->valid = 0 |
de121164 | 134 | /* Version to avoid compiler warning about 'c' always non-NULL */ |
0f113f3e MC |
135 | #define asn1_tlc_clear_nc(c) (c)->valid = 0 |
136 | ||
137 | /* | |
138 | * Decode an ASN1 item, this currently behaves just like a standard 'd2i' | |
139 | * function. 'in' points to a buffer to read the data from, in future we | |
140 | * will have more advanced versions that can input data a piece at a time and | |
141 | * this will simply be a special case. | |
9d6b1ce6 DSH |
142 | */ |
143 | ||
8845420f | 144 | ASN1_VALUE *ASN1_item_d2i(ASN1_VALUE **pval, |
0f113f3e MC |
145 | const unsigned char **in, long len, |
146 | const ASN1_ITEM *it) | |
147 | { | |
148 | ASN1_TLC c; | |
149 | ASN1_VALUE *ptmpval = NULL; | |
150 | if (!pval) | |
151 | pval = &ptmpval; | |
152 | asn1_tlc_clear_nc(&c); | |
153 | if (ASN1_item_ex_d2i(pval, in, len, it, -1, 0, 0, &c) > 0) | |
154 | return *pval; | |
155 | return NULL; | |
156 | } | |
9d6b1ce6 | 157 | |
f93ad22f DSH |
158 | int ASN1_item_ex_d2i(ASN1_VALUE **pval, const unsigned char **in, long len, |
159 | const ASN1_ITEM *it, | |
160 | int tag, int aclass, char opt, ASN1_TLC *ctx) | |
161 | { | |
162 | int rv; | |
163 | rv = asn1_item_embed_d2i(pval, in, len, it, tag, aclass, opt, ctx); | |
164 | if (rv <= 0) | |
165 | ASN1_item_ex_free(pval, it); | |
166 | return rv; | |
167 | } | |
168 | ||
0f113f3e MC |
169 | /* |
170 | * Decode an item, taking care of IMPLICIT tagging, if any. If 'opt' set and | |
171 | * tag mismatch return -1 to handle OPTIONAL | |
9d6b1ce6 DSH |
172 | */ |
173 | ||
f93ad22f DSH |
174 | static int asn1_item_embed_d2i(ASN1_VALUE **pval, const unsigned char **in, |
175 | long len, const ASN1_ITEM *it, | |
176 | int tag, int aclass, char opt, ASN1_TLC *ctx) | |
0f113f3e MC |
177 | { |
178 | const ASN1_TEMPLATE *tt, *errtt = NULL; | |
0f113f3e MC |
179 | const ASN1_EXTERN_FUNCS *ef; |
180 | const ASN1_AUX *aux = it->funcs; | |
181 | ASN1_aux_cb *asn1_cb; | |
182 | const unsigned char *p = NULL, *q; | |
dd12df79 | 183 | unsigned char oclass; |
0f113f3e MC |
184 | char seq_eoc, seq_nolen, cst, isopt; |
185 | long tmplen; | |
186 | int i; | |
187 | int otag; | |
188 | int ret = 0; | |
dd12df79 | 189 | ASN1_VALUE **pchptr; |
0f113f3e MC |
190 | if (!pval) |
191 | return 0; | |
192 | if (aux && aux->asn1_cb) | |
193 | asn1_cb = aux->asn1_cb; | |
194 | else | |
195 | asn1_cb = 0; | |
196 | ||
197 | switch (it->itype) { | |
198 | case ASN1_ITYPE_PRIMITIVE: | |
199 | if (it->templates) { | |
200 | /* | |
201 | * tagging or OPTIONAL is currently illegal on an item template | |
202 | * because the flags can't get passed down. In practice this | |
203 | * isn't a problem: we include the relevant flags from the item | |
204 | * template in the template itself. | |
205 | */ | |
206 | if ((tag != -1) || opt) { | |
f93ad22f | 207 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, |
0f113f3e MC |
208 | ASN1_R_ILLEGAL_OPTIONS_ON_ITEM_TEMPLATE); |
209 | goto err; | |
210 | } | |
211 | return asn1_template_ex_d2i(pval, in, len, | |
212 | it->templates, opt, ctx); | |
213 | } | |
214 | return asn1_d2i_ex_primitive(pval, in, len, it, | |
215 | tag, aclass, opt, ctx); | |
0f113f3e MC |
216 | |
217 | case ASN1_ITYPE_MSTRING: | |
218 | p = *in; | |
219 | /* Just read in tag and class */ | |
220 | ret = asn1_check_tlen(NULL, &otag, &oclass, NULL, NULL, | |
221 | &p, len, -1, 0, 1, ctx); | |
222 | if (!ret) { | |
f93ad22f | 223 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ERR_R_NESTED_ASN1_ERROR); |
0f113f3e MC |
224 | goto err; |
225 | } | |
226 | ||
227 | /* Must be UNIVERSAL class */ | |
228 | if (oclass != V_ASN1_UNIVERSAL) { | |
229 | /* If OPTIONAL, assume this is OK */ | |
230 | if (opt) | |
231 | return -1; | |
f93ad22f | 232 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ASN1_R_MSTRING_NOT_UNIVERSAL); |
0f113f3e MC |
233 | goto err; |
234 | } | |
235 | /* Check tag matches bit map */ | |
236 | if (!(ASN1_tag2bit(otag) & it->utype)) { | |
237 | /* If OPTIONAL, assume this is OK */ | |
238 | if (opt) | |
239 | return -1; | |
f93ad22f | 240 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ASN1_R_MSTRING_WRONG_TAG); |
0f113f3e MC |
241 | goto err; |
242 | } | |
243 | return asn1_d2i_ex_primitive(pval, in, len, it, otag, 0, 0, ctx); | |
244 | ||
245 | case ASN1_ITYPE_EXTERN: | |
246 | /* Use new style d2i */ | |
247 | ef = it->funcs; | |
248 | return ef->asn1_ex_d2i(pval, in, len, it, tag, aclass, opt, ctx); | |
249 | ||
0f113f3e MC |
250 | case ASN1_ITYPE_CHOICE: |
251 | if (asn1_cb && !asn1_cb(ASN1_OP_D2I_PRE, pval, it, NULL)) | |
252 | goto auxerr; | |
8106d61c DSH |
253 | if (*pval) { |
254 | /* Free up and zero CHOICE value if initialised */ | |
255 | i = asn1_get_choice_selector(pval, it); | |
256 | if ((i >= 0) && (i < it->tcount)) { | |
257 | tt = it->templates + i; | |
258 | pchptr = asn1_get_field_ptr(pval, tt); | |
c315a547 | 259 | asn1_template_free(pchptr, tt); |
8106d61c DSH |
260 | asn1_set_choice_selector(pval, -1, it); |
261 | } | |
262 | } else if (!ASN1_item_ex_new(pval, it)) { | |
f93ad22f | 263 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ERR_R_NESTED_ASN1_ERROR); |
0f113f3e MC |
264 | goto err; |
265 | } | |
266 | /* CHOICE type, try each possibility in turn */ | |
267 | p = *in; | |
268 | for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) { | |
269 | pchptr = asn1_get_field_ptr(pval, tt); | |
270 | /* | |
271 | * We mark field as OPTIONAL so its absence can be recognised. | |
272 | */ | |
273 | ret = asn1_template_ex_d2i(pchptr, &p, len, tt, 1, ctx); | |
274 | /* If field not present, try the next one */ | |
275 | if (ret == -1) | |
276 | continue; | |
277 | /* If positive return, read OK, break loop */ | |
278 | if (ret > 0) | |
279 | break; | |
280 | /* Otherwise must be an ASN1 parsing error */ | |
281 | errtt = tt; | |
f93ad22f | 282 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ERR_R_NESTED_ASN1_ERROR); |
0f113f3e MC |
283 | goto err; |
284 | } | |
285 | ||
286 | /* Did we fall off the end without reading anything? */ | |
287 | if (i == it->tcount) { | |
288 | /* If OPTIONAL, this is OK */ | |
289 | if (opt) { | |
290 | /* Free and zero it */ | |
291 | ASN1_item_ex_free(pval, it); | |
292 | return -1; | |
293 | } | |
f93ad22f | 294 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ASN1_R_NO_MATCHING_CHOICE_TYPE); |
0f113f3e MC |
295 | goto err; |
296 | } | |
297 | ||
298 | asn1_set_choice_selector(pval, i, it); | |
0f113f3e MC |
299 | if (asn1_cb && !asn1_cb(ASN1_OP_D2I_POST, pval, it, NULL)) |
300 | goto auxerr; | |
a46c9789 | 301 | *in = p; |
0f113f3e MC |
302 | return 1; |
303 | ||
304 | case ASN1_ITYPE_NDEF_SEQUENCE: | |
305 | case ASN1_ITYPE_SEQUENCE: | |
306 | p = *in; | |
307 | tmplen = len; | |
308 | ||
309 | /* If no IMPLICIT tagging set to SEQUENCE, UNIVERSAL */ | |
310 | if (tag == -1) { | |
311 | tag = V_ASN1_SEQUENCE; | |
312 | aclass = V_ASN1_UNIVERSAL; | |
313 | } | |
314 | /* Get SEQUENCE length and update len, p */ | |
315 | ret = asn1_check_tlen(&len, NULL, NULL, &seq_eoc, &cst, | |
316 | &p, len, tag, aclass, opt, ctx); | |
317 | if (!ret) { | |
f93ad22f | 318 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ERR_R_NESTED_ASN1_ERROR); |
0f113f3e MC |
319 | goto err; |
320 | } else if (ret == -1) | |
321 | return -1; | |
322 | if (aux && (aux->flags & ASN1_AFLG_BROKEN)) { | |
323 | len = tmplen - (p - *in); | |
324 | seq_nolen = 1; | |
325 | } | |
326 | /* If indefinite we don't do a length check */ | |
327 | else | |
328 | seq_nolen = seq_eoc; | |
329 | if (!cst) { | |
f93ad22f | 330 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ASN1_R_SEQUENCE_NOT_CONSTRUCTED); |
0f113f3e MC |
331 | goto err; |
332 | } | |
333 | ||
334 | if (!*pval && !ASN1_item_ex_new(pval, it)) { | |
f93ad22f | 335 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ERR_R_NESTED_ASN1_ERROR); |
0f113f3e MC |
336 | goto err; |
337 | } | |
338 | ||
339 | if (asn1_cb && !asn1_cb(ASN1_OP_D2I_PRE, pval, it, NULL)) | |
340 | goto auxerr; | |
341 | ||
8106d61c DSH |
342 | /* Free up and zero any ADB found */ |
343 | for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) { | |
344 | if (tt->flags & ASN1_TFLG_ADB_MASK) { | |
345 | const ASN1_TEMPLATE *seqtt; | |
346 | ASN1_VALUE **pseqval; | |
347 | seqtt = asn1_do_adb(pval, tt, 1); | |
348 | pseqval = asn1_get_field_ptr(pval, seqtt); | |
c315a547 | 349 | asn1_template_free(pseqval, seqtt); |
8106d61c DSH |
350 | } |
351 | } | |
352 | ||
0f113f3e MC |
353 | /* Get each field entry */ |
354 | for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) { | |
355 | const ASN1_TEMPLATE *seqtt; | |
356 | ASN1_VALUE **pseqval; | |
357 | seqtt = asn1_do_adb(pval, tt, 1); | |
358 | if (!seqtt) | |
359 | goto err; | |
360 | pseqval = asn1_get_field_ptr(pval, seqtt); | |
361 | /* Have we ran out of data? */ | |
362 | if (!len) | |
363 | break; | |
364 | q = p; | |
365 | if (asn1_check_eoc(&p, len)) { | |
366 | if (!seq_eoc) { | |
f93ad22f | 367 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ASN1_R_UNEXPECTED_EOC); |
0f113f3e MC |
368 | goto err; |
369 | } | |
370 | len -= p - q; | |
371 | seq_eoc = 0; | |
372 | q = p; | |
373 | break; | |
374 | } | |
375 | /* | |
376 | * This determines the OPTIONAL flag value. The field cannot be | |
377 | * omitted if it is the last of a SEQUENCE and there is still | |
378 | * data to be read. This isn't strictly necessary but it | |
379 | * increases efficiency in some cases. | |
380 | */ | |
381 | if (i == (it->tcount - 1)) | |
382 | isopt = 0; | |
383 | else | |
384 | isopt = (char)(seqtt->flags & ASN1_TFLG_OPTIONAL); | |
385 | /* | |
386 | * attempt to read in field, allowing each to be OPTIONAL | |
387 | */ | |
388 | ||
389 | ret = asn1_template_ex_d2i(pseqval, &p, len, seqtt, isopt, ctx); | |
390 | if (!ret) { | |
391 | errtt = seqtt; | |
392 | goto err; | |
393 | } else if (ret == -1) { | |
394 | /* | |
395 | * OPTIONAL component absent. Free and zero the field. | |
396 | */ | |
c315a547 | 397 | asn1_template_free(pseqval, seqtt); |
0f113f3e MC |
398 | continue; |
399 | } | |
400 | /* Update length */ | |
401 | len -= p - q; | |
402 | } | |
403 | ||
404 | /* Check for EOC if expecting one */ | |
405 | if (seq_eoc && !asn1_check_eoc(&p, len)) { | |
f93ad22f | 406 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ASN1_R_MISSING_EOC); |
0f113f3e MC |
407 | goto err; |
408 | } | |
409 | /* Check all data read */ | |
410 | if (!seq_nolen && len) { | |
f93ad22f | 411 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ASN1_R_SEQUENCE_LENGTH_MISMATCH); |
0f113f3e MC |
412 | goto err; |
413 | } | |
414 | ||
415 | /* | |
416 | * If we get here we've got no more data in the SEQUENCE, however we | |
417 | * may not have read all fields so check all remaining are OPTIONAL | |
418 | * and clear any that are. | |
419 | */ | |
420 | for (; i < it->tcount; tt++, i++) { | |
421 | const ASN1_TEMPLATE *seqtt; | |
422 | seqtt = asn1_do_adb(pval, tt, 1); | |
423 | if (!seqtt) | |
424 | goto err; | |
425 | if (seqtt->flags & ASN1_TFLG_OPTIONAL) { | |
426 | ASN1_VALUE **pseqval; | |
427 | pseqval = asn1_get_field_ptr(pval, seqtt); | |
c315a547 | 428 | asn1_template_free(pseqval, seqtt); |
0f113f3e MC |
429 | } else { |
430 | errtt = seqtt; | |
f93ad22f | 431 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ASN1_R_FIELD_MISSING); |
0f113f3e MC |
432 | goto err; |
433 | } | |
434 | } | |
435 | /* Save encoding */ | |
436 | if (!asn1_enc_save(pval, *in, p - *in, it)) | |
437 | goto auxerr; | |
0f113f3e MC |
438 | if (asn1_cb && !asn1_cb(ASN1_OP_D2I_POST, pval, it, NULL)) |
439 | goto auxerr; | |
a46c9789 | 440 | *in = p; |
0f113f3e MC |
441 | return 1; |
442 | ||
443 | default: | |
444 | return 0; | |
445 | } | |
446 | auxerr: | |
f93ad22f | 447 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ASN1_R_AUX_ERROR); |
0f113f3e | 448 | err: |
0f113f3e MC |
449 | if (errtt) |
450 | ERR_add_error_data(4, "Field=", errtt->field_name, | |
451 | ", Type=", it->sname); | |
452 | else | |
453 | ERR_add_error_data(2, "Type=", it->sname); | |
454 | return 0; | |
455 | } | |
456 | ||
457 | /* | |
458 | * Templates are handled with two separate functions. One handles any | |
459 | * EXPLICIT tag and the other handles the rest. | |
9d6b1ce6 DSH |
460 | */ |
461 | ||
8845420f | 462 | static int asn1_template_ex_d2i(ASN1_VALUE **val, |
0f113f3e MC |
463 | const unsigned char **in, long inlen, |
464 | const ASN1_TEMPLATE *tt, char opt, | |
465 | ASN1_TLC *ctx) | |
466 | { | |
467 | int flags, aclass; | |
468 | int ret; | |
469 | long len; | |
470 | const unsigned char *p, *q; | |
471 | char exp_eoc; | |
472 | if (!val) | |
473 | return 0; | |
474 | flags = tt->flags; | |
475 | aclass = flags & ASN1_TFLG_TAG_CLASS; | |
476 | ||
477 | p = *in; | |
478 | ||
479 | /* Check if EXPLICIT tag expected */ | |
480 | if (flags & ASN1_TFLG_EXPTAG) { | |
481 | char cst; | |
482 | /* | |
483 | * Need to work out amount of data available to the inner content and | |
484 | * where it starts: so read in EXPLICIT header to get the info. | |
485 | */ | |
486 | ret = asn1_check_tlen(&len, NULL, NULL, &exp_eoc, &cst, | |
487 | &p, inlen, tt->tag, aclass, opt, ctx); | |
488 | q = p; | |
489 | if (!ret) { | |
490 | ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ERR_R_NESTED_ASN1_ERROR); | |
491 | return 0; | |
492 | } else if (ret == -1) | |
493 | return -1; | |
494 | if (!cst) { | |
495 | ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, | |
496 | ASN1_R_EXPLICIT_TAG_NOT_CONSTRUCTED); | |
497 | return 0; | |
498 | } | |
499 | /* We've found the field so it can't be OPTIONAL now */ | |
500 | ret = asn1_template_noexp_d2i(val, &p, len, tt, 0, ctx); | |
501 | if (!ret) { | |
502 | ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ERR_R_NESTED_ASN1_ERROR); | |
503 | return 0; | |
504 | } | |
505 | /* We read the field in OK so update length */ | |
506 | len -= p - q; | |
507 | if (exp_eoc) { | |
508 | /* If NDEF we must have an EOC here */ | |
509 | if (!asn1_check_eoc(&p, len)) { | |
510 | ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ASN1_R_MISSING_EOC); | |
511 | goto err; | |
512 | } | |
513 | } else { | |
514 | /* | |
515 | * Otherwise we must hit the EXPLICIT tag end or its an error | |
516 | */ | |
517 | if (len) { | |
518 | ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, | |
519 | ASN1_R_EXPLICIT_LENGTH_MISMATCH); | |
520 | goto err; | |
521 | } | |
522 | } | |
523 | } else | |
524 | return asn1_template_noexp_d2i(val, in, inlen, tt, opt, ctx); | |
525 | ||
526 | *in = p; | |
527 | return 1; | |
528 | ||
529 | err: | |
0f113f3e MC |
530 | return 0; |
531 | } | |
9d6b1ce6 | 532 | |
8845420f | 533 | static int asn1_template_noexp_d2i(ASN1_VALUE **val, |
0f113f3e MC |
534 | const unsigned char **in, long len, |
535 | const ASN1_TEMPLATE *tt, char opt, | |
536 | ASN1_TLC *ctx) | |
537 | { | |
538 | int flags, aclass; | |
539 | int ret; | |
de17bd5d | 540 | ASN1_VALUE *tval; |
0f113f3e MC |
541 | const unsigned char *p, *q; |
542 | if (!val) | |
543 | return 0; | |
544 | flags = tt->flags; | |
545 | aclass = flags & ASN1_TFLG_TAG_CLASS; | |
546 | ||
547 | p = *in; | |
548 | q = p; | |
549 | ||
de17bd5d DSH |
550 | /* |
551 | * If field is embedded then val needs fixing so it is a pointer to | |
552 | * a pointer to a field. | |
553 | */ | |
554 | if (tt->flags & ASN1_TFLG_EMBED) { | |
555 | tval = (ASN1_VALUE *)val; | |
556 | val = &tval; | |
557 | } | |
558 | ||
0f113f3e MC |
559 | if (flags & ASN1_TFLG_SK_MASK) { |
560 | /* SET OF, SEQUENCE OF */ | |
561 | int sktag, skaclass; | |
562 | char sk_eoc; | |
563 | /* First work out expected inner tag value */ | |
564 | if (flags & ASN1_TFLG_IMPTAG) { | |
565 | sktag = tt->tag; | |
566 | skaclass = aclass; | |
567 | } else { | |
568 | skaclass = V_ASN1_UNIVERSAL; | |
569 | if (flags & ASN1_TFLG_SET_OF) | |
570 | sktag = V_ASN1_SET; | |
571 | else | |
572 | sktag = V_ASN1_SEQUENCE; | |
573 | } | |
574 | /* Get the tag */ | |
575 | ret = asn1_check_tlen(&len, NULL, NULL, &sk_eoc, NULL, | |
576 | &p, len, sktag, skaclass, opt, ctx); | |
577 | if (!ret) { | |
578 | ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_NESTED_ASN1_ERROR); | |
579 | return 0; | |
580 | } else if (ret == -1) | |
581 | return -1; | |
582 | if (!*val) | |
583 | *val = (ASN1_VALUE *)sk_new_null(); | |
584 | else { | |
585 | /* | |
586 | * We've got a valid STACK: free up any items present | |
587 | */ | |
588 | STACK_OF(ASN1_VALUE) *sktmp = (STACK_OF(ASN1_VALUE) *)*val; | |
589 | ASN1_VALUE *vtmp; | |
590 | while (sk_ASN1_VALUE_num(sktmp) > 0) { | |
591 | vtmp = sk_ASN1_VALUE_pop(sktmp); | |
592 | ASN1_item_ex_free(&vtmp, ASN1_ITEM_ptr(tt->item)); | |
593 | } | |
594 | } | |
595 | ||
596 | if (!*val) { | |
597 | ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_MALLOC_FAILURE); | |
598 | goto err; | |
599 | } | |
600 | ||
601 | /* Read as many items as we can */ | |
602 | while (len > 0) { | |
603 | ASN1_VALUE *skfield; | |
604 | q = p; | |
605 | /* See if EOC found */ | |
606 | if (asn1_check_eoc(&p, len)) { | |
607 | if (!sk_eoc) { | |
608 | ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, | |
609 | ASN1_R_UNEXPECTED_EOC); | |
610 | goto err; | |
611 | } | |
612 | len -= p - q; | |
613 | sk_eoc = 0; | |
614 | break; | |
615 | } | |
616 | skfield = NULL; | |
f93ad22f DSH |
617 | if (!asn1_item_embed_d2i(&skfield, &p, len, |
618 | ASN1_ITEM_ptr(tt->item), -1, 0, 0, ctx)) { | |
0f113f3e MC |
619 | ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, |
620 | ERR_R_NESTED_ASN1_ERROR); | |
621 | goto err; | |
622 | } | |
623 | len -= p - q; | |
624 | if (!sk_ASN1_VALUE_push((STACK_OF(ASN1_VALUE) *)*val, skfield)) { | |
625 | ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_MALLOC_FAILURE); | |
626 | goto err; | |
627 | } | |
628 | } | |
629 | if (sk_eoc) { | |
630 | ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ASN1_R_MISSING_EOC); | |
631 | goto err; | |
632 | } | |
633 | } else if (flags & ASN1_TFLG_IMPTAG) { | |
634 | /* IMPLICIT tagging */ | |
f93ad22f DSH |
635 | ret = asn1_item_embed_d2i(val, &p, len, |
636 | ASN1_ITEM_ptr(tt->item), tt->tag, aclass, opt, | |
637 | ctx); | |
0f113f3e MC |
638 | if (!ret) { |
639 | ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_NESTED_ASN1_ERROR); | |
640 | goto err; | |
641 | } else if (ret == -1) | |
642 | return -1; | |
643 | } else { | |
644 | /* Nothing special */ | |
f93ad22f DSH |
645 | ret = asn1_item_embed_d2i(val, &p, len, ASN1_ITEM_ptr(tt->item), |
646 | -1, 0, opt, ctx); | |
0f113f3e MC |
647 | if (!ret) { |
648 | ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_NESTED_ASN1_ERROR); | |
649 | goto err; | |
650 | } else if (ret == -1) | |
651 | return -1; | |
652 | } | |
653 | ||
654 | *in = p; | |
655 | return 1; | |
656 | ||
657 | err: | |
0f113f3e MC |
658 | return 0; |
659 | } | |
9d6b1ce6 | 660 | |
8845420f | 661 | static int asn1_d2i_ex_primitive(ASN1_VALUE **pval, |
0f113f3e MC |
662 | const unsigned char **in, long inlen, |
663 | const ASN1_ITEM *it, | |
664 | int tag, int aclass, char opt, ASN1_TLC *ctx) | |
665 | { | |
666 | int ret = 0, utype; | |
667 | long plen; | |
668 | char cst, inf, free_cont = 0; | |
669 | const unsigned char *p; | |
4c9b0a03 | 670 | BUF_MEM buf = { 0 }; |
0f113f3e MC |
671 | const unsigned char *cont = NULL; |
672 | long len; | |
673 | if (!pval) { | |
674 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_ILLEGAL_NULL); | |
675 | return 0; /* Should never happen */ | |
676 | } | |
677 | ||
678 | if (it->itype == ASN1_ITYPE_MSTRING) { | |
679 | utype = tag; | |
680 | tag = -1; | |
681 | } else | |
682 | utype = it->utype; | |
683 | ||
684 | if (utype == V_ASN1_ANY) { | |
685 | /* If type is ANY need to figure out type from tag */ | |
686 | unsigned char oclass; | |
687 | if (tag >= 0) { | |
688 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_ILLEGAL_TAGGED_ANY); | |
689 | return 0; | |
690 | } | |
691 | if (opt) { | |
692 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, | |
693 | ASN1_R_ILLEGAL_OPTIONAL_ANY); | |
694 | return 0; | |
695 | } | |
696 | p = *in; | |
697 | ret = asn1_check_tlen(NULL, &utype, &oclass, NULL, NULL, | |
698 | &p, inlen, -1, 0, 0, ctx); | |
699 | if (!ret) { | |
700 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_NESTED_ASN1_ERROR); | |
701 | return 0; | |
702 | } | |
703 | if (oclass != V_ASN1_UNIVERSAL) | |
704 | utype = V_ASN1_OTHER; | |
705 | } | |
706 | if (tag == -1) { | |
707 | tag = utype; | |
708 | aclass = V_ASN1_UNIVERSAL; | |
709 | } | |
710 | p = *in; | |
711 | /* Check header */ | |
712 | ret = asn1_check_tlen(&plen, NULL, NULL, &inf, &cst, | |
713 | &p, inlen, tag, aclass, opt, ctx); | |
714 | if (!ret) { | |
715 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_NESTED_ASN1_ERROR); | |
716 | return 0; | |
717 | } else if (ret == -1) | |
718 | return -1; | |
719 | ret = 0; | |
720 | /* SEQUENCE, SET and "OTHER" are left in encoded form */ | |
721 | if ((utype == V_ASN1_SEQUENCE) | |
722 | || (utype == V_ASN1_SET) || (utype == V_ASN1_OTHER)) { | |
723 | /* | |
724 | * Clear context cache for type OTHER because the auto clear when we | |
725 | * have a exact match wont work | |
726 | */ | |
727 | if (utype == V_ASN1_OTHER) { | |
728 | asn1_tlc_clear(ctx); | |
729 | } | |
730 | /* SEQUENCE and SET must be constructed */ | |
731 | else if (!cst) { | |
732 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, | |
733 | ASN1_R_TYPE_NOT_CONSTRUCTED); | |
734 | return 0; | |
735 | } | |
736 | ||
737 | cont = *in; | |
738 | /* If indefinite length constructed find the real end */ | |
739 | if (inf) { | |
740 | if (!asn1_find_end(&p, plen, inf)) | |
741 | goto err; | |
742 | len = p - cont; | |
743 | } else { | |
744 | len = p - cont + plen; | |
745 | p += plen; | |
746 | buf.data = NULL; | |
747 | } | |
748 | } else if (cst) { | |
749 | if (utype == V_ASN1_NULL || utype == V_ASN1_BOOLEAN | |
750 | || utype == V_ASN1_OBJECT || utype == V_ASN1_INTEGER | |
751 | || utype == V_ASN1_ENUMERATED) { | |
752 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_TYPE_NOT_PRIMITIVE); | |
753 | return 0; | |
754 | } | |
755 | buf.length = 0; | |
756 | buf.max = 0; | |
757 | buf.data = NULL; | |
758 | /* | |
759 | * Should really check the internal tags are correct but some things | |
760 | * may get this wrong. The relevant specs say that constructed string | |
761 | * types should be OCTET STRINGs internally irrespective of the type. | |
762 | * So instead just check for UNIVERSAL class and ignore the tag. | |
763 | */ | |
764 | if (!asn1_collect(&buf, &p, plen, inf, -1, V_ASN1_UNIVERSAL, 0)) { | |
765 | free_cont = 1; | |
766 | goto err; | |
767 | } | |
768 | len = buf.length; | |
769 | /* Append a final null to string */ | |
770 | if (!BUF_MEM_grow_clean(&buf, len + 1)) { | |
771 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_MALLOC_FAILURE); | |
772 | return 0; | |
773 | } | |
774 | buf.data[len] = 0; | |
775 | cont = (const unsigned char *)buf.data; | |
776 | free_cont = 1; | |
777 | } else { | |
778 | cont = p; | |
779 | len = plen; | |
780 | p += plen; | |
781 | } | |
782 | ||
783 | /* We now have content length and type: translate into a structure */ | |
784 | if (!asn1_ex_c2i(pval, cont, len, utype, &free_cont, it)) | |
785 | goto err; | |
786 | ||
787 | *in = p; | |
788 | ret = 1; | |
789 | err: | |
b548a1f1 | 790 | if (free_cont) |
0f113f3e MC |
791 | OPENSSL_free(buf.data); |
792 | return ret; | |
793 | } | |
9d6b1ce6 DSH |
794 | |
795 | /* Translate ASN1 content octets into a structure */ | |
796 | ||
23dc1706 DSH |
797 | static int asn1_ex_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, |
798 | int utype, char *free_cont, const ASN1_ITEM *it) | |
0f113f3e MC |
799 | { |
800 | ASN1_VALUE **opval = NULL; | |
801 | ASN1_STRING *stmp; | |
802 | ASN1_TYPE *typ = NULL; | |
803 | int ret = 0; | |
804 | const ASN1_PRIMITIVE_FUNCS *pf; | |
805 | ASN1_INTEGER **tint; | |
806 | pf = it->funcs; | |
807 | ||
808 | if (pf && pf->prim_c2i) | |
809 | return pf->prim_c2i(pval, cont, len, utype, free_cont, it); | |
810 | /* If ANY type clear type and set pointer to internal value */ | |
811 | if (it->utype == V_ASN1_ANY) { | |
812 | if (!*pval) { | |
813 | typ = ASN1_TYPE_new(); | |
814 | if (typ == NULL) | |
815 | goto err; | |
816 | *pval = (ASN1_VALUE *)typ; | |
817 | } else | |
818 | typ = (ASN1_TYPE *)*pval; | |
819 | ||
820 | if (utype != typ->type) | |
821 | ASN1_TYPE_set(typ, utype, NULL); | |
822 | opval = pval; | |
823 | pval = &typ->value.asn1_value; | |
824 | } | |
825 | switch (utype) { | |
826 | case V_ASN1_OBJECT: | |
827 | if (!c2i_ASN1_OBJECT((ASN1_OBJECT **)pval, &cont, len)) | |
828 | goto err; | |
829 | break; | |
830 | ||
831 | case V_ASN1_NULL: | |
832 | if (len) { | |
833 | ASN1err(ASN1_F_ASN1_EX_C2I, ASN1_R_NULL_IS_WRONG_LENGTH); | |
834 | goto err; | |
835 | } | |
836 | *pval = (ASN1_VALUE *)1; | |
837 | break; | |
838 | ||
839 | case V_ASN1_BOOLEAN: | |
840 | if (len != 1) { | |
841 | ASN1err(ASN1_F_ASN1_EX_C2I, ASN1_R_BOOLEAN_IS_WRONG_LENGTH); | |
842 | goto err; | |
843 | } else { | |
844 | ASN1_BOOLEAN *tbool; | |
845 | tbool = (ASN1_BOOLEAN *)pval; | |
846 | *tbool = *cont; | |
847 | } | |
848 | break; | |
849 | ||
850 | case V_ASN1_BIT_STRING: | |
851 | if (!c2i_ASN1_BIT_STRING((ASN1_BIT_STRING **)pval, &cont, len)) | |
852 | goto err; | |
853 | break; | |
854 | ||
855 | case V_ASN1_INTEGER: | |
856 | case V_ASN1_NEG_INTEGER: | |
857 | case V_ASN1_ENUMERATED: | |
858 | case V_ASN1_NEG_ENUMERATED: | |
859 | tint = (ASN1_INTEGER **)pval; | |
860 | if (!c2i_ASN1_INTEGER(tint, &cont, len)) | |
861 | goto err; | |
862 | /* Fixup type to match the expected form */ | |
863 | (*tint)->type = utype | ((*tint)->type & V_ASN1_NEG); | |
864 | break; | |
865 | ||
866 | case V_ASN1_OCTET_STRING: | |
867 | case V_ASN1_NUMERICSTRING: | |
868 | case V_ASN1_PRINTABLESTRING: | |
869 | case V_ASN1_T61STRING: | |
870 | case V_ASN1_VIDEOTEXSTRING: | |
871 | case V_ASN1_IA5STRING: | |
872 | case V_ASN1_UTCTIME: | |
873 | case V_ASN1_GENERALIZEDTIME: | |
874 | case V_ASN1_GRAPHICSTRING: | |
875 | case V_ASN1_VISIBLESTRING: | |
876 | case V_ASN1_GENERALSTRING: | |
877 | case V_ASN1_UNIVERSALSTRING: | |
878 | case V_ASN1_BMPSTRING: | |
879 | case V_ASN1_UTF8STRING: | |
880 | case V_ASN1_OTHER: | |
881 | case V_ASN1_SET: | |
882 | case V_ASN1_SEQUENCE: | |
883 | default: | |
884 | if (utype == V_ASN1_BMPSTRING && (len & 1)) { | |
885 | ASN1err(ASN1_F_ASN1_EX_C2I, ASN1_R_BMPSTRING_IS_WRONG_LENGTH); | |
886 | goto err; | |
887 | } | |
888 | if (utype == V_ASN1_UNIVERSALSTRING && (len & 3)) { | |
889 | ASN1err(ASN1_F_ASN1_EX_C2I, | |
890 | ASN1_R_UNIVERSALSTRING_IS_WRONG_LENGTH); | |
891 | goto err; | |
892 | } | |
893 | /* All based on ASN1_STRING and handled the same */ | |
894 | if (!*pval) { | |
895 | stmp = ASN1_STRING_type_new(utype); | |
90945fa3 | 896 | if (stmp == NULL) { |
0f113f3e MC |
897 | ASN1err(ASN1_F_ASN1_EX_C2I, ERR_R_MALLOC_FAILURE); |
898 | goto err; | |
899 | } | |
900 | *pval = (ASN1_VALUE *)stmp; | |
901 | } else { | |
902 | stmp = (ASN1_STRING *)*pval; | |
903 | stmp->type = utype; | |
904 | } | |
905 | /* If we've already allocated a buffer use it */ | |
906 | if (*free_cont) { | |
b548a1f1 | 907 | OPENSSL_free(stmp->data); |
0f113f3e MC |
908 | stmp->data = (unsigned char *)cont; /* UGLY CAST! RL */ |
909 | stmp->length = len; | |
910 | *free_cont = 0; | |
911 | } else { | |
912 | if (!ASN1_STRING_set(stmp, cont, len)) { | |
913 | ASN1err(ASN1_F_ASN1_EX_C2I, ERR_R_MALLOC_FAILURE); | |
914 | ASN1_STRING_free(stmp); | |
915 | *pval = NULL; | |
916 | goto err; | |
917 | } | |
918 | } | |
919 | break; | |
920 | } | |
921 | /* If ASN1_ANY and NULL type fix up value */ | |
922 | if (typ && (utype == V_ASN1_NULL)) | |
923 | typ->value.ptr = NULL; | |
924 | ||
925 | ret = 1; | |
926 | err: | |
927 | if (!ret) { | |
928 | ASN1_TYPE_free(typ); | |
929 | if (opval) | |
930 | *opval = NULL; | |
931 | } | |
932 | return ret; | |
933 | } | |
934 | ||
935 | /* | |
936 | * This function finds the end of an ASN1 structure when passed its maximum | |
937 | * length, whether it is indefinite length and a pointer to the content. This | |
938 | * is more efficient than calling asn1_collect because it does not recurse on | |
939 | * each indefinite length header. | |
e1cc0671 DSH |
940 | */ |
941 | ||
942 | static int asn1_find_end(const unsigned char **in, long len, char inf) | |
0f113f3e MC |
943 | { |
944 | int expected_eoc; | |
945 | long plen; | |
946 | const unsigned char *p = *in, *q; | |
947 | /* If not indefinite length constructed just add length */ | |
948 | if (inf == 0) { | |
949 | *in += len; | |
950 | return 1; | |
951 | } | |
952 | expected_eoc = 1; | |
953 | /* | |
954 | * Indefinite length constructed form. Find the end when enough EOCs are | |
955 | * found. If more indefinite length constructed headers are encountered | |
956 | * increment the expected eoc count otherwise just skip to the end of the | |
957 | * data. | |
958 | */ | |
959 | while (len > 0) { | |
960 | if (asn1_check_eoc(&p, len)) { | |
961 | expected_eoc--; | |
962 | if (expected_eoc == 0) | |
963 | break; | |
964 | len -= 2; | |
965 | continue; | |
966 | } | |
967 | q = p; | |
968 | /* Just read in a header: only care about the length */ | |
969 | if (!asn1_check_tlen(&plen, NULL, NULL, &inf, NULL, &p, len, | |
970 | -1, 0, 0, NULL)) { | |
971 | ASN1err(ASN1_F_ASN1_FIND_END, ERR_R_NESTED_ASN1_ERROR); | |
972 | return 0; | |
973 | } | |
974 | if (inf) | |
975 | expected_eoc++; | |
976 | else | |
977 | p += plen; | |
978 | len -= p - q; | |
979 | } | |
980 | if (expected_eoc) { | |
981 | ASN1err(ASN1_F_ASN1_FIND_END, ASN1_R_MISSING_EOC); | |
982 | return 0; | |
983 | } | |
984 | *in = p; | |
985 | return 1; | |
986 | } | |
987 | ||
988 | /* | |
989 | * This function collects the asn1 data from a constructred string type into | |
990 | * a buffer. The values of 'in' and 'len' should refer to the contents of the | |
991 | * constructed type and 'inf' should be set if it is indefinite length. | |
9d6b1ce6 DSH |
992 | */ |
993 | ||
854a225a | 994 | #ifndef ASN1_MAX_STRING_NEST |
0f113f3e MC |
995 | /* |
996 | * This determines how many levels of recursion are permitted in ASN1 string | |
997 | * types. If it is not limited stack overflows can occur. If set to zero no | |
998 | * recursion is allowed at all. Although zero should be adequate examples | |
999 | * exist that require a value of 1. So 5 should be more than enough. | |
854a225a | 1000 | */ |
0f113f3e | 1001 | # define ASN1_MAX_STRING_NEST 5 |
854a225a DSH |
1002 | #endif |
1003 | ||
8845420f | 1004 | static int asn1_collect(BUF_MEM *buf, const unsigned char **in, long len, |
0f113f3e MC |
1005 | char inf, int tag, int aclass, int depth) |
1006 | { | |
1007 | const unsigned char *p, *q; | |
1008 | long plen; | |
1009 | char cst, ininf; | |
1010 | p = *in; | |
1011 | inf &= 1; | |
1012 | /* | |
1013 | * If no buffer and not indefinite length constructed just pass over the | |
1014 | * encoded data | |
1015 | */ | |
1016 | if (!buf && !inf) { | |
1017 | *in += len; | |
1018 | return 1; | |
1019 | } | |
1020 | while (len > 0) { | |
1021 | q = p; | |
1022 | /* Check for EOC */ | |
1023 | if (asn1_check_eoc(&p, len)) { | |
1024 | /* | |
1025 | * EOC is illegal outside indefinite length constructed form | |
1026 | */ | |
1027 | if (!inf) { | |
1028 | ASN1err(ASN1_F_ASN1_COLLECT, ASN1_R_UNEXPECTED_EOC); | |
1029 | return 0; | |
1030 | } | |
1031 | inf = 0; | |
1032 | break; | |
1033 | } | |
1034 | ||
1035 | if (!asn1_check_tlen(&plen, NULL, NULL, &ininf, &cst, &p, | |
1036 | len, tag, aclass, 0, NULL)) { | |
1037 | ASN1err(ASN1_F_ASN1_COLLECT, ERR_R_NESTED_ASN1_ERROR); | |
1038 | return 0; | |
1039 | } | |
1040 | ||
1041 | /* If indefinite length constructed update max length */ | |
1042 | if (cst) { | |
1043 | if (depth >= ASN1_MAX_STRING_NEST) { | |
1044 | ASN1err(ASN1_F_ASN1_COLLECT, ASN1_R_NESTED_ASN1_STRING); | |
1045 | return 0; | |
1046 | } | |
1047 | if (!asn1_collect(buf, &p, plen, ininf, tag, aclass, depth + 1)) | |
1048 | return 0; | |
1049 | } else if (plen && !collect_data(buf, &p, plen)) | |
1050 | return 0; | |
1051 | len -= p - q; | |
1052 | } | |
1053 | if (inf) { | |
1054 | ASN1err(ASN1_F_ASN1_COLLECT, ASN1_R_MISSING_EOC); | |
1055 | return 0; | |
1056 | } | |
1057 | *in = p; | |
1058 | return 1; | |
1059 | } | |
9d6b1ce6 | 1060 | |
875a644a | 1061 | static int collect_data(BUF_MEM *buf, const unsigned char **p, long plen) |
0f113f3e MC |
1062 | { |
1063 | int len; | |
1064 | if (buf) { | |
1065 | len = buf->length; | |
1066 | if (!BUF_MEM_grow_clean(buf, len + plen)) { | |
1067 | ASN1err(ASN1_F_COLLECT_DATA, ERR_R_MALLOC_FAILURE); | |
1068 | return 0; | |
1069 | } | |
1070 | memcpy(buf->data + len, *p, plen); | |
1071 | } | |
1072 | *p += plen; | |
1073 | return 1; | |
1074 | } | |
9d6b1ce6 DSH |
1075 | |
1076 | /* Check for ASN1 EOC and swallow it if found */ | |
1077 | ||
875a644a | 1078 | static int asn1_check_eoc(const unsigned char **in, long len) |
0f113f3e MC |
1079 | { |
1080 | const unsigned char *p; | |
1081 | if (len < 2) | |
1082 | return 0; | |
1083 | p = *in; | |
1084 | if (!p[0] && !p[1]) { | |
1085 | *in += 2; | |
1086 | return 1; | |
1087 | } | |
1088 | return 0; | |
1089 | } | |
1090 | ||
1091 | /* | |
1092 | * Check an ASN1 tag and length: a bit like ASN1_get_object but it sets the | |
1093 | * length for indefinite length constructed form, we don't know the exact | |
1094 | * length but we can set an upper bound to the amount of data available minus | |
1095 | * the header length just read. | |
9d6b1ce6 DSH |
1096 | */ |
1097 | ||
8845420f | 1098 | static int asn1_check_tlen(long *olen, int *otag, unsigned char *oclass, |
0f113f3e MC |
1099 | char *inf, char *cst, |
1100 | const unsigned char **in, long len, | |
1101 | int exptag, int expclass, char opt, ASN1_TLC *ctx) | |
1102 | { | |
1103 | int i; | |
1104 | int ptag, pclass; | |
1105 | long plen; | |
1106 | const unsigned char *p, *q; | |
1107 | p = *in; | |
1108 | q = p; | |
1109 | ||
1110 | if (ctx && ctx->valid) { | |
1111 | i = ctx->ret; | |
1112 | plen = ctx->plen; | |
1113 | pclass = ctx->pclass; | |
1114 | ptag = ctx->ptag; | |
1115 | p += ctx->hdrlen; | |
1116 | } else { | |
1117 | i = ASN1_get_object(&p, &plen, &ptag, &pclass, len); | |
1118 | if (ctx) { | |
1119 | ctx->ret = i; | |
1120 | ctx->plen = plen; | |
1121 | ctx->pclass = pclass; | |
1122 | ctx->ptag = ptag; | |
1123 | ctx->hdrlen = p - q; | |
1124 | ctx->valid = 1; | |
1125 | /* | |
1126 | * If definite length, and no error, length + header can't exceed | |
1127 | * total amount of data available. | |
1128 | */ | |
1129 | if (!(i & 0x81) && ((plen + ctx->hdrlen) > len)) { | |
1130 | ASN1err(ASN1_F_ASN1_CHECK_TLEN, ASN1_R_TOO_LONG); | |
1131 | asn1_tlc_clear(ctx); | |
1132 | return 0; | |
1133 | } | |
1134 | } | |
1135 | } | |
1136 | ||
1137 | if (i & 0x80) { | |
1138 | ASN1err(ASN1_F_ASN1_CHECK_TLEN, ASN1_R_BAD_OBJECT_HEADER); | |
1139 | asn1_tlc_clear(ctx); | |
1140 | return 0; | |
1141 | } | |
1142 | if (exptag >= 0) { | |
1143 | if ((exptag != ptag) || (expclass != pclass)) { | |
1144 | /* | |
1145 | * If type is OPTIONAL, not an error: indicate missing type. | |
1146 | */ | |
1147 | if (opt) | |
1148 | return -1; | |
1149 | asn1_tlc_clear(ctx); | |
1150 | ASN1err(ASN1_F_ASN1_CHECK_TLEN, ASN1_R_WRONG_TAG); | |
1151 | return 0; | |
1152 | } | |
1153 | /* | |
1154 | * We have a tag and class match: assume we are going to do something | |
1155 | * with it | |
1156 | */ | |
1157 | asn1_tlc_clear(ctx); | |
1158 | } | |
1159 | ||
1160 | if (i & 1) | |
1161 | plen = len - (p - q); | |
1162 | ||
1163 | if (inf) | |
1164 | *inf = i & 1; | |
1165 | ||
1166 | if (cst) | |
1167 | *cst = i & V_ASN1_CONSTRUCTED; | |
1168 | ||
1169 | if (olen) | |
1170 | *olen = plen; | |
1171 | ||
1172 | if (oclass) | |
1173 | *oclass = pclass; | |
1174 | ||
1175 | if (otag) | |
1176 | *otag = ptag; | |
1177 | ||
1178 | *in = p; | |
1179 | return 1; | |
1180 | } |