3 * Written by Dr Stephen N Henson (steve@openssl.org) for the OpenSSL project
6 /* ====================================================================
7 * Copyright (c) 2000-2005 The OpenSSL Project. All rights reserved.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
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
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/)"
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.
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.
35 * 6. Redistributions of any form whatsoever must retain the following
37 * "This product includes software developed by the OpenSSL Project
38 * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
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 * ====================================================================
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).
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>
68 static int asn1_check_eoc(const unsigned char **in
, long len
);
69 static int asn1_find_end(const unsigned char **in
, long len
, char inf
);
71 static int asn1_collect(BUF_MEM
*buf
, const unsigned char **in
, long len
,
72 char inf
, int tag
, int aclass
, int depth
);
74 static int collect_data(BUF_MEM
*buf
, const unsigned char **p
, long plen
);
76 static int asn1_check_tlen(long *olen
, int *otag
, unsigned char *oclass
,
78 const unsigned char **in
, long len
,
79 int exptag
, int expclass
, char opt
, ASN1_TLC
*ctx
);
81 static int asn1_template_ex_d2i(ASN1_VALUE
**pval
,
82 const unsigned char **in
, long len
,
83 const ASN1_TEMPLATE
*tt
, char opt
,
85 static int asn1_template_noexp_d2i(ASN1_VALUE
**val
,
86 const unsigned char **in
, long len
,
87 const ASN1_TEMPLATE
*tt
, char opt
,
89 static int asn1_d2i_ex_primitive(ASN1_VALUE
**pval
,
90 const unsigned char **in
, long len
,
92 int tag
, int aclass
, char opt
,
95 /* Table to convert tags to bit values, used for MSTRING type */
96 static const unsigned long tag2bit
[32] = {
98 0, 0, 0, B_ASN1_BIT_STRING
,
100 B_ASN1_OCTET_STRING
, 0, 0, B_ASN1_UNKNOWN
,
102 B_ASN1_UNKNOWN
, B_ASN1_UNKNOWN
, B_ASN1_UNKNOWN
, B_ASN1_UNKNOWN
,
104 B_ASN1_UTF8STRING
, B_ASN1_UNKNOWN
, B_ASN1_UNKNOWN
, B_ASN1_UNKNOWN
,
106 B_ASN1_SEQUENCE
, 0, B_ASN1_NUMERICSTRING
, B_ASN1_PRINTABLESTRING
,
108 B_ASN1_T61STRING
, B_ASN1_VIDEOTEXSTRING
, B_ASN1_IA5STRING
,
110 B_ASN1_UTCTIME
, B_ASN1_GENERALIZEDTIME
,
112 B_ASN1_GRAPHICSTRING
, B_ASN1_ISO64STRING
, B_ASN1_GENERALSTRING
,
114 B_ASN1_UNIVERSALSTRING
, B_ASN1_UNKNOWN
, B_ASN1_BMPSTRING
, B_ASN1_UNKNOWN
,
117 unsigned long ASN1_tag2bit(int tag
)
119 if ((tag
< 0) || (tag
> 30))
124 /* Macro to initialize and invalidate the cache */
126 #define asn1_tlc_clear(c) if (c) (c)->valid = 0
127 /* Version to avoid compiler warning about 'c' always non-NULL */
128 #define asn1_tlc_clear_nc(c) (c)->valid = 0
131 * Decode an ASN1 item, this currently behaves just like a standard 'd2i'
132 * function. 'in' points to a buffer to read the data from, in future we
133 * will have more advanced versions that can input data a piece at a time and
134 * this will simply be a special case.
137 ASN1_VALUE
*ASN1_item_d2i(ASN1_VALUE
**pval
,
138 const unsigned char **in
, long len
,
142 ASN1_VALUE
*ptmpval
= NULL
;
145 asn1_tlc_clear_nc(&c
);
146 if (ASN1_item_ex_d2i(pval
, in
, len
, it
, -1, 0, 0, &c
) > 0)
151 int ASN1_template_d2i(ASN1_VALUE
**pval
,
152 const unsigned char **in
, long len
,
153 const ASN1_TEMPLATE
*tt
)
156 asn1_tlc_clear_nc(&c
);
157 return asn1_template_ex_d2i(pval
, in
, len
, tt
, 0, &c
);
161 * Decode an item, taking care of IMPLICIT tagging, if any. If 'opt' set and
162 * tag mismatch return -1 to handle OPTIONAL
165 int ASN1_item_ex_d2i(ASN1_VALUE
**pval
, const unsigned char **in
, long len
,
167 int tag
, int aclass
, char opt
, ASN1_TLC
*ctx
)
169 const ASN1_TEMPLATE
*tt
, *errtt
= NULL
;
170 const ASN1_COMPAT_FUNCS
*cf
;
171 const ASN1_EXTERN_FUNCS
*ef
;
172 const ASN1_AUX
*aux
= it
->funcs
;
173 ASN1_aux_cb
*asn1_cb
;
174 const unsigned char *p
= NULL
, *q
;
175 unsigned char *wp
= NULL
; /* BIG FAT WARNING! BREAKS CONST WHERE USED */
176 unsigned char imphack
= 0, oclass
;
177 char seq_eoc
, seq_nolen
, cst
, isopt
;
182 ASN1_VALUE
**pchptr
, *ptmpval
;
185 if (aux
&& aux
->asn1_cb
)
186 asn1_cb
= aux
->asn1_cb
;
191 case ASN1_ITYPE_PRIMITIVE
:
194 * tagging or OPTIONAL is currently illegal on an item template
195 * because the flags can't get passed down. In practice this
196 * isn't a problem: we include the relevant flags from the item
197 * template in the template itself.
199 if ((tag
!= -1) || opt
) {
200 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I
,
201 ASN1_R_ILLEGAL_OPTIONS_ON_ITEM_TEMPLATE
);
204 return asn1_template_ex_d2i(pval
, in
, len
,
205 it
->templates
, opt
, ctx
);
207 return asn1_d2i_ex_primitive(pval
, in
, len
, it
,
208 tag
, aclass
, opt
, ctx
);
210 case ASN1_ITYPE_MSTRING
:
212 /* Just read in tag and class */
213 ret
= asn1_check_tlen(NULL
, &otag
, &oclass
, NULL
, NULL
,
214 &p
, len
, -1, 0, 1, ctx
);
216 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I
, ERR_R_NESTED_ASN1_ERROR
);
220 /* Must be UNIVERSAL class */
221 if (oclass
!= V_ASN1_UNIVERSAL
) {
222 /* If OPTIONAL, assume this is OK */
225 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I
, ASN1_R_MSTRING_NOT_UNIVERSAL
);
228 /* Check tag matches bit map */
229 if (!(ASN1_tag2bit(otag
) & it
->utype
)) {
230 /* If OPTIONAL, assume this is OK */
233 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I
, ASN1_R_MSTRING_WRONG_TAG
);
236 return asn1_d2i_ex_primitive(pval
, in
, len
, it
, otag
, 0, 0, ctx
);
238 case ASN1_ITYPE_EXTERN
:
239 /* Use new style d2i */
241 return ef
->asn1_ex_d2i(pval
, in
, len
, it
, tag
, aclass
, opt
, ctx
);
243 case ASN1_ITYPE_COMPAT
:
244 /* we must resort to old style evil hackery */
247 /* If OPTIONAL see if it is there */
256 * Don't care about anything other than presence of expected tag
259 ret
= asn1_check_tlen(NULL
, NULL
, NULL
, NULL
, NULL
,
260 &p
, len
, exptag
, aclass
, 1, ctx
);
262 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I
, ERR_R_NESTED_ASN1_ERROR
);
270 * This is the old style evil hack IMPLICIT handling: since the
271 * underlying code is expecting a tag and class other than the one
272 * present we change the buffer temporarily then change it back
273 * afterwards. This doesn't and never did work for tags > 30. Yes
274 * this is *horrible* but it is only needed for old style d2i which
275 * will hopefully not be around for much longer. FIXME: should copy
276 * the buffer then modify it so the input buffer can be const: we
277 * should *always* copy because the old style d2i might modify the
282 wp
= *(unsigned char **)in
;
285 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I
, ERR_R_NESTED_ASN1_ERROR
);
288 *wp
= (unsigned char)((*p
& V_ASN1_CONSTRUCTED
)
292 ptmpval
= cf
->asn1_d2i(pval
, in
, len
);
300 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I
, ERR_R_NESTED_ASN1_ERROR
);
303 case ASN1_ITYPE_CHOICE
:
304 if (asn1_cb
&& !asn1_cb(ASN1_OP_D2I_PRE
, pval
, it
, NULL
))
307 /* Free up and zero CHOICE value if initialised */
308 i
= asn1_get_choice_selector(pval
, it
);
309 if ((i
>= 0) && (i
< it
->tcount
)) {
310 tt
= it
->templates
+ i
;
311 pchptr
= asn1_get_field_ptr(pval
, tt
);
312 ASN1_template_free(pchptr
, tt
);
313 asn1_set_choice_selector(pval
, -1, it
);
315 } else if (!ASN1_item_ex_new(pval
, it
)) {
316 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I
, ERR_R_NESTED_ASN1_ERROR
);
319 /* CHOICE type, try each possibility in turn */
321 for (i
= 0, tt
= it
->templates
; i
< it
->tcount
; i
++, tt
++) {
322 pchptr
= asn1_get_field_ptr(pval
, tt
);
324 * We mark field as OPTIONAL so its absence can be recognised.
326 ret
= asn1_template_ex_d2i(pchptr
, &p
, len
, tt
, 1, ctx
);
327 /* If field not present, try the next one */
330 /* If positive return, read OK, break loop */
333 /* Otherwise must be an ASN1 parsing error */
335 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I
, ERR_R_NESTED_ASN1_ERROR
);
339 /* Did we fall off the end without reading anything? */
340 if (i
== it
->tcount
) {
341 /* If OPTIONAL, this is OK */
343 /* Free and zero it */
344 ASN1_item_ex_free(pval
, it
);
347 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I
, ASN1_R_NO_MATCHING_CHOICE_TYPE
);
351 asn1_set_choice_selector(pval
, i
, it
);
353 if (asn1_cb
&& !asn1_cb(ASN1_OP_D2I_POST
, pval
, it
, NULL
))
357 case ASN1_ITYPE_NDEF_SEQUENCE
:
358 case ASN1_ITYPE_SEQUENCE
:
362 /* If no IMPLICIT tagging set to SEQUENCE, UNIVERSAL */
364 tag
= V_ASN1_SEQUENCE
;
365 aclass
= V_ASN1_UNIVERSAL
;
367 /* Get SEQUENCE length and update len, p */
368 ret
= asn1_check_tlen(&len
, NULL
, NULL
, &seq_eoc
, &cst
,
369 &p
, len
, tag
, aclass
, opt
, ctx
);
371 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I
, ERR_R_NESTED_ASN1_ERROR
);
373 } else if (ret
== -1)
375 if (aux
&& (aux
->flags
& ASN1_AFLG_BROKEN
)) {
376 len
= tmplen
- (p
- *in
);
379 /* If indefinite we don't do a length check */
383 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I
, ASN1_R_SEQUENCE_NOT_CONSTRUCTED
);
387 if (!*pval
&& !ASN1_item_ex_new(pval
, it
)) {
388 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I
, ERR_R_NESTED_ASN1_ERROR
);
392 if (asn1_cb
&& !asn1_cb(ASN1_OP_D2I_PRE
, pval
, it
, NULL
))
395 /* Free up and zero any ADB found */
396 for (i
= 0, tt
= it
->templates
; i
< it
->tcount
; i
++, tt
++) {
397 if (tt
->flags
& ASN1_TFLG_ADB_MASK
) {
398 const ASN1_TEMPLATE
*seqtt
;
399 ASN1_VALUE
**pseqval
;
400 seqtt
= asn1_do_adb(pval
, tt
, 1);
401 pseqval
= asn1_get_field_ptr(pval
, seqtt
);
402 ASN1_template_free(pseqval
, seqtt
);
406 /* Get each field entry */
407 for (i
= 0, tt
= it
->templates
; i
< it
->tcount
; i
++, tt
++) {
408 const ASN1_TEMPLATE
*seqtt
;
409 ASN1_VALUE
**pseqval
;
410 seqtt
= asn1_do_adb(pval
, tt
, 1);
413 pseqval
= asn1_get_field_ptr(pval
, seqtt
);
414 /* Have we ran out of data? */
418 if (asn1_check_eoc(&p
, len
)) {
420 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I
, ASN1_R_UNEXPECTED_EOC
);
429 * This determines the OPTIONAL flag value. The field cannot be
430 * omitted if it is the last of a SEQUENCE and there is still
431 * data to be read. This isn't strictly necessary but it
432 * increases efficiency in some cases.
434 if (i
== (it
->tcount
- 1))
437 isopt
= (char)(seqtt
->flags
& ASN1_TFLG_OPTIONAL
);
439 * attempt to read in field, allowing each to be OPTIONAL
442 ret
= asn1_template_ex_d2i(pseqval
, &p
, len
, seqtt
, isopt
, ctx
);
446 } else if (ret
== -1) {
448 * OPTIONAL component absent. Free and zero the field.
450 ASN1_template_free(pseqval
, seqtt
);
457 /* Check for EOC if expecting one */
458 if (seq_eoc
&& !asn1_check_eoc(&p
, len
)) {
459 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I
, ASN1_R_MISSING_EOC
);
462 /* Check all data read */
463 if (!seq_nolen
&& len
) {
464 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I
, ASN1_R_SEQUENCE_LENGTH_MISMATCH
);
469 * If we get here we've got no more data in the SEQUENCE, however we
470 * may not have read all fields so check all remaining are OPTIONAL
471 * and clear any that are.
473 for (; i
< it
->tcount
; tt
++, i
++) {
474 const ASN1_TEMPLATE
*seqtt
;
475 seqtt
= asn1_do_adb(pval
, tt
, 1);
478 if (seqtt
->flags
& ASN1_TFLG_OPTIONAL
) {
479 ASN1_VALUE
**pseqval
;
480 pseqval
= asn1_get_field_ptr(pval
, seqtt
);
481 ASN1_template_free(pseqval
, seqtt
);
484 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I
, ASN1_R_FIELD_MISSING
);
489 if (!asn1_enc_save(pval
, *in
, p
- *in
, it
))
492 if (asn1_cb
&& !asn1_cb(ASN1_OP_D2I_POST
, pval
, it
, NULL
))
500 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I
, ASN1_R_AUX_ERROR
);
502 ASN1_item_ex_free(pval
, it
);
504 ERR_add_error_data(4, "Field=", errtt
->field_name
,
505 ", Type=", it
->sname
);
507 ERR_add_error_data(2, "Type=", it
->sname
);
512 * Templates are handled with two separate functions. One handles any
513 * EXPLICIT tag and the other handles the rest.
516 static int asn1_template_ex_d2i(ASN1_VALUE
**val
,
517 const unsigned char **in
, long inlen
,
518 const ASN1_TEMPLATE
*tt
, char opt
,
524 const unsigned char *p
, *q
;
529 aclass
= flags
& ASN1_TFLG_TAG_CLASS
;
533 /* Check if EXPLICIT tag expected */
534 if (flags
& ASN1_TFLG_EXPTAG
) {
537 * Need to work out amount of data available to the inner content and
538 * where it starts: so read in EXPLICIT header to get the info.
540 ret
= asn1_check_tlen(&len
, NULL
, NULL
, &exp_eoc
, &cst
,
541 &p
, inlen
, tt
->tag
, aclass
, opt
, ctx
);
544 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I
, ERR_R_NESTED_ASN1_ERROR
);
546 } else if (ret
== -1)
549 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I
,
550 ASN1_R_EXPLICIT_TAG_NOT_CONSTRUCTED
);
553 /* We've found the field so it can't be OPTIONAL now */
554 ret
= asn1_template_noexp_d2i(val
, &p
, len
, tt
, 0, ctx
);
556 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I
, ERR_R_NESTED_ASN1_ERROR
);
559 /* We read the field in OK so update length */
562 /* If NDEF we must have an EOC here */
563 if (!asn1_check_eoc(&p
, len
)) {
564 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I
, ASN1_R_MISSING_EOC
);
569 * Otherwise we must hit the EXPLICIT tag end or its an error
572 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I
,
573 ASN1_R_EXPLICIT_LENGTH_MISMATCH
);
578 return asn1_template_noexp_d2i(val
, in
, inlen
, tt
, opt
, ctx
);
584 ASN1_template_free(val
, tt
);
588 static int asn1_template_noexp_d2i(ASN1_VALUE
**val
,
589 const unsigned char **in
, long len
,
590 const ASN1_TEMPLATE
*tt
, char opt
,
595 const unsigned char *p
, *q
;
599 aclass
= flags
& ASN1_TFLG_TAG_CLASS
;
604 if (flags
& ASN1_TFLG_SK_MASK
) {
605 /* SET OF, SEQUENCE OF */
608 /* First work out expected inner tag value */
609 if (flags
& ASN1_TFLG_IMPTAG
) {
613 skaclass
= V_ASN1_UNIVERSAL
;
614 if (flags
& ASN1_TFLG_SET_OF
)
617 sktag
= V_ASN1_SEQUENCE
;
620 ret
= asn1_check_tlen(&len
, NULL
, NULL
, &sk_eoc
, NULL
,
621 &p
, len
, sktag
, skaclass
, opt
, ctx
);
623 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I
, ERR_R_NESTED_ASN1_ERROR
);
625 } else if (ret
== -1)
628 *val
= (ASN1_VALUE
*)sk_new_null();
631 * We've got a valid STACK: free up any items present
633 STACK_OF(ASN1_VALUE
) *sktmp
= (STACK_OF(ASN1_VALUE
) *)*val
;
635 while (sk_ASN1_VALUE_num(sktmp
) > 0) {
636 vtmp
= sk_ASN1_VALUE_pop(sktmp
);
637 ASN1_item_ex_free(&vtmp
, ASN1_ITEM_ptr(tt
->item
));
642 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I
, ERR_R_MALLOC_FAILURE
);
646 /* Read as many items as we can */
650 /* See if EOC found */
651 if (asn1_check_eoc(&p
, len
)) {
653 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I
,
654 ASN1_R_UNEXPECTED_EOC
);
662 if (!ASN1_item_ex_d2i(&skfield
, &p
, len
,
663 ASN1_ITEM_ptr(tt
->item
), -1, 0, 0, ctx
)) {
664 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I
,
665 ERR_R_NESTED_ASN1_ERROR
);
669 if (!sk_ASN1_VALUE_push((STACK_OF(ASN1_VALUE
) *)*val
, skfield
)) {
670 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I
, ERR_R_MALLOC_FAILURE
);
675 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I
, ASN1_R_MISSING_EOC
);
678 } else if (flags
& ASN1_TFLG_IMPTAG
) {
679 /* IMPLICIT tagging */
680 ret
= ASN1_item_ex_d2i(val
, &p
, len
,
681 ASN1_ITEM_ptr(tt
->item
), tt
->tag
, aclass
, opt
,
684 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I
, ERR_R_NESTED_ASN1_ERROR
);
686 } else if (ret
== -1)
689 /* Nothing special */
690 ret
= ASN1_item_ex_d2i(val
, &p
, len
, ASN1_ITEM_ptr(tt
->item
),
693 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I
, ERR_R_NESTED_ASN1_ERROR
);
695 } else if (ret
== -1)
703 ASN1_template_free(val
, tt
);
707 static int asn1_d2i_ex_primitive(ASN1_VALUE
**pval
,
708 const unsigned char **in
, long inlen
,
710 int tag
, int aclass
, char opt
, ASN1_TLC
*ctx
)
714 char cst
, inf
, free_cont
= 0;
715 const unsigned char *p
;
717 const unsigned char *cont
= NULL
;
720 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE
, ASN1_R_ILLEGAL_NULL
);
721 return 0; /* Should never happen */
724 if (it
->itype
== ASN1_ITYPE_MSTRING
) {
730 if (utype
== V_ASN1_ANY
) {
731 /* If type is ANY need to figure out type from tag */
732 unsigned char oclass
;
734 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE
, ASN1_R_ILLEGAL_TAGGED_ANY
);
738 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE
,
739 ASN1_R_ILLEGAL_OPTIONAL_ANY
);
743 ret
= asn1_check_tlen(NULL
, &utype
, &oclass
, NULL
, NULL
,
744 &p
, inlen
, -1, 0, 0, ctx
);
746 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE
, ERR_R_NESTED_ASN1_ERROR
);
749 if (oclass
!= V_ASN1_UNIVERSAL
)
750 utype
= V_ASN1_OTHER
;
754 aclass
= V_ASN1_UNIVERSAL
;
758 ret
= asn1_check_tlen(&plen
, NULL
, NULL
, &inf
, &cst
,
759 &p
, inlen
, tag
, aclass
, opt
, ctx
);
761 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE
, ERR_R_NESTED_ASN1_ERROR
);
763 } else if (ret
== -1)
766 /* SEQUENCE, SET and "OTHER" are left in encoded form */
767 if ((utype
== V_ASN1_SEQUENCE
)
768 || (utype
== V_ASN1_SET
) || (utype
== V_ASN1_OTHER
)) {
770 * Clear context cache for type OTHER because the auto clear when we
771 * have a exact match wont work
773 if (utype
== V_ASN1_OTHER
) {
776 /* SEQUENCE and SET must be constructed */
778 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE
,
779 ASN1_R_TYPE_NOT_CONSTRUCTED
);
784 /* If indefinite length constructed find the real end */
786 if (!asn1_find_end(&p
, plen
, inf
))
790 len
= p
- cont
+ plen
;
795 if (utype
== V_ASN1_NULL
|| utype
== V_ASN1_BOOLEAN
796 || utype
== V_ASN1_OBJECT
|| utype
== V_ASN1_INTEGER
797 || utype
== V_ASN1_ENUMERATED
) {
798 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE
, ASN1_R_TYPE_NOT_PRIMITIVE
);
805 * Should really check the internal tags are correct but some things
806 * may get this wrong. The relevant specs say that constructed string
807 * types should be OCTET STRINGs internally irrespective of the type.
808 * So instead just check for UNIVERSAL class and ignore the tag.
810 if (!asn1_collect(&buf
, &p
, plen
, inf
, -1, V_ASN1_UNIVERSAL
, 0)) {
815 /* Append a final null to string */
816 if (!BUF_MEM_grow_clean(&buf
, len
+ 1)) {
817 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE
, ERR_R_MALLOC_FAILURE
);
821 cont
= (const unsigned char *)buf
.data
;
829 /* We now have content length and type: translate into a structure */
830 if (!asn1_ex_c2i(pval
, cont
, len
, utype
, &free_cont
, it
))
836 if (free_cont
&& buf
.data
)
837 OPENSSL_free(buf
.data
);
841 /* Translate ASN1 content octets into a structure */
843 int asn1_ex_c2i(ASN1_VALUE
**pval
, const unsigned char *cont
, int len
,
844 int utype
, char *free_cont
, const ASN1_ITEM
*it
)
846 ASN1_VALUE
**opval
= NULL
;
848 ASN1_TYPE
*typ
= NULL
;
850 const ASN1_PRIMITIVE_FUNCS
*pf
;
854 if (pf
&& pf
->prim_c2i
)
855 return pf
->prim_c2i(pval
, cont
, len
, utype
, free_cont
, it
);
856 /* If ANY type clear type and set pointer to internal value */
857 if (it
->utype
== V_ASN1_ANY
) {
859 typ
= ASN1_TYPE_new();
862 *pval
= (ASN1_VALUE
*)typ
;
864 typ
= (ASN1_TYPE
*)*pval
;
866 if (utype
!= typ
->type
)
867 ASN1_TYPE_set(typ
, utype
, NULL
);
869 pval
= &typ
->value
.asn1_value
;
873 if (!c2i_ASN1_OBJECT((ASN1_OBJECT
**)pval
, &cont
, len
))
879 ASN1err(ASN1_F_ASN1_EX_C2I
, ASN1_R_NULL_IS_WRONG_LENGTH
);
882 *pval
= (ASN1_VALUE
*)1;
887 ASN1err(ASN1_F_ASN1_EX_C2I
, ASN1_R_BOOLEAN_IS_WRONG_LENGTH
);
891 tbool
= (ASN1_BOOLEAN
*)pval
;
896 case V_ASN1_BIT_STRING
:
897 if (!c2i_ASN1_BIT_STRING((ASN1_BIT_STRING
**)pval
, &cont
, len
))
902 case V_ASN1_NEG_INTEGER
:
903 case V_ASN1_ENUMERATED
:
904 case V_ASN1_NEG_ENUMERATED
:
905 tint
= (ASN1_INTEGER
**)pval
;
906 if (!c2i_ASN1_INTEGER(tint
, &cont
, len
))
908 /* Fixup type to match the expected form */
909 (*tint
)->type
= utype
| ((*tint
)->type
& V_ASN1_NEG
);
912 case V_ASN1_OCTET_STRING
:
913 case V_ASN1_NUMERICSTRING
:
914 case V_ASN1_PRINTABLESTRING
:
915 case V_ASN1_T61STRING
:
916 case V_ASN1_VIDEOTEXSTRING
:
917 case V_ASN1_IA5STRING
:
919 case V_ASN1_GENERALIZEDTIME
:
920 case V_ASN1_GRAPHICSTRING
:
921 case V_ASN1_VISIBLESTRING
:
922 case V_ASN1_GENERALSTRING
:
923 case V_ASN1_UNIVERSALSTRING
:
924 case V_ASN1_BMPSTRING
:
925 case V_ASN1_UTF8STRING
:
928 case V_ASN1_SEQUENCE
:
930 if (utype
== V_ASN1_BMPSTRING
&& (len
& 1)) {
931 ASN1err(ASN1_F_ASN1_EX_C2I
, ASN1_R_BMPSTRING_IS_WRONG_LENGTH
);
934 if (utype
== V_ASN1_UNIVERSALSTRING
&& (len
& 3)) {
935 ASN1err(ASN1_F_ASN1_EX_C2I
,
936 ASN1_R_UNIVERSALSTRING_IS_WRONG_LENGTH
);
939 /* All based on ASN1_STRING and handled the same */
941 stmp
= ASN1_STRING_type_new(utype
);
943 ASN1err(ASN1_F_ASN1_EX_C2I
, ERR_R_MALLOC_FAILURE
);
946 *pval
= (ASN1_VALUE
*)stmp
;
948 stmp
= (ASN1_STRING
*)*pval
;
951 /* If we've already allocated a buffer use it */
954 OPENSSL_free(stmp
->data
);
955 stmp
->data
= (unsigned char *)cont
; /* UGLY CAST! RL */
959 if (!ASN1_STRING_set(stmp
, cont
, len
)) {
960 ASN1err(ASN1_F_ASN1_EX_C2I
, ERR_R_MALLOC_FAILURE
);
961 ASN1_STRING_free(stmp
);
968 /* If ASN1_ANY and NULL type fix up value */
969 if (typ
&& (utype
== V_ASN1_NULL
))
970 typ
->value
.ptr
= NULL
;
983 * This function finds the end of an ASN1 structure when passed its maximum
984 * length, whether it is indefinite length and a pointer to the content. This
985 * is more efficient than calling asn1_collect because it does not recurse on
986 * each indefinite length header.
989 static int asn1_find_end(const unsigned char **in
, long len
, char inf
)
993 const unsigned char *p
= *in
, *q
;
994 /* If not indefinite length constructed just add length */
1001 * Indefinite length constructed form. Find the end when enough EOCs are
1002 * found. If more indefinite length constructed headers are encountered
1003 * increment the expected eoc count otherwise just skip to the end of the
1007 if (asn1_check_eoc(&p
, len
)) {
1009 if (expected_eoc
== 0)
1015 /* Just read in a header: only care about the length */
1016 if (!asn1_check_tlen(&plen
, NULL
, NULL
, &inf
, NULL
, &p
, len
,
1018 ASN1err(ASN1_F_ASN1_FIND_END
, ERR_R_NESTED_ASN1_ERROR
);
1028 ASN1err(ASN1_F_ASN1_FIND_END
, ASN1_R_MISSING_EOC
);
1036 * This function collects the asn1 data from a constructred string type into
1037 * a buffer. The values of 'in' and 'len' should refer to the contents of the
1038 * constructed type and 'inf' should be set if it is indefinite length.
1041 #ifndef ASN1_MAX_STRING_NEST
1043 * This determines how many levels of recursion are permitted in ASN1 string
1044 * types. If it is not limited stack overflows can occur. If set to zero no
1045 * recursion is allowed at all. Although zero should be adequate examples
1046 * exist that require a value of 1. So 5 should be more than enough.
1048 # define ASN1_MAX_STRING_NEST 5
1051 static int asn1_collect(BUF_MEM
*buf
, const unsigned char **in
, long len
,
1052 char inf
, int tag
, int aclass
, int depth
)
1054 const unsigned char *p
, *q
;
1060 * If no buffer and not indefinite length constructed just pass over the
1070 if (asn1_check_eoc(&p
, len
)) {
1072 * EOC is illegal outside indefinite length constructed form
1075 ASN1err(ASN1_F_ASN1_COLLECT
, ASN1_R_UNEXPECTED_EOC
);
1082 if (!asn1_check_tlen(&plen
, NULL
, NULL
, &ininf
, &cst
, &p
,
1083 len
, tag
, aclass
, 0, NULL
)) {
1084 ASN1err(ASN1_F_ASN1_COLLECT
, ERR_R_NESTED_ASN1_ERROR
);
1088 /* If indefinite length constructed update max length */
1090 if (depth
>= ASN1_MAX_STRING_NEST
) {
1091 ASN1err(ASN1_F_ASN1_COLLECT
, ASN1_R_NESTED_ASN1_STRING
);
1094 if (!asn1_collect(buf
, &p
, plen
, ininf
, tag
, aclass
, depth
+ 1))
1096 } else if (plen
&& !collect_data(buf
, &p
, plen
))
1101 ASN1err(ASN1_F_ASN1_COLLECT
, ASN1_R_MISSING_EOC
);
1108 static int collect_data(BUF_MEM
*buf
, const unsigned char **p
, long plen
)
1113 if (!BUF_MEM_grow_clean(buf
, len
+ plen
)) {
1114 ASN1err(ASN1_F_COLLECT_DATA
, ERR_R_MALLOC_FAILURE
);
1117 memcpy(buf
->data
+ len
, *p
, plen
);
1123 /* Check for ASN1 EOC and swallow it if found */
1125 static int asn1_check_eoc(const unsigned char **in
, long len
)
1127 const unsigned char *p
;
1131 if (!p
[0] && !p
[1]) {
1139 * Check an ASN1 tag and length: a bit like ASN1_get_object but it sets the
1140 * length for indefinite length constructed form, we don't know the exact
1141 * length but we can set an upper bound to the amount of data available minus
1142 * the header length just read.
1145 static int asn1_check_tlen(long *olen
, int *otag
, unsigned char *oclass
,
1146 char *inf
, char *cst
,
1147 const unsigned char **in
, long len
,
1148 int exptag
, int expclass
, char opt
, ASN1_TLC
*ctx
)
1153 const unsigned char *p
, *q
;
1157 if (ctx
&& ctx
->valid
) {
1160 pclass
= ctx
->pclass
;
1164 i
= ASN1_get_object(&p
, &plen
, &ptag
, &pclass
, len
);
1168 ctx
->pclass
= pclass
;
1170 ctx
->hdrlen
= p
- q
;
1173 * If definite length, and no error, length + header can't exceed
1174 * total amount of data available.
1176 if (!(i
& 0x81) && ((plen
+ ctx
->hdrlen
) > len
)) {
1177 ASN1err(ASN1_F_ASN1_CHECK_TLEN
, ASN1_R_TOO_LONG
);
1178 asn1_tlc_clear(ctx
);
1185 ASN1err(ASN1_F_ASN1_CHECK_TLEN
, ASN1_R_BAD_OBJECT_HEADER
);
1186 asn1_tlc_clear(ctx
);
1190 if ((exptag
!= ptag
) || (expclass
!= pclass
)) {
1192 * If type is OPTIONAL, not an error: indicate missing type.
1196 asn1_tlc_clear(ctx
);
1197 ASN1err(ASN1_F_ASN1_CHECK_TLEN
, ASN1_R_WRONG_TAG
);
1201 * We have a tag and class match: assume we are going to do something
1204 asn1_tlc_clear(ctx
);
1208 plen
= len
- (p
- q
);
1214 *cst
= i
& V_ASN1_CONSTRUCTED
;