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 /* Allocate structure */
308 if (!*pval && !ASN1_item_ex_new(pval, it)) {
309 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
312 /* CHOICE type, try each possibility in turn */
314 for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) {
315 pchptr = asn1_get_field_ptr(pval, tt);
317 * We mark field as OPTIONAL so its absence can be recognised.
319 ret = asn1_template_ex_d2i(pchptr, &p, len, tt, 1, ctx);
320 /* If field not present, try the next one */
323 /* If positive return, read OK, break loop */
326 /* Otherwise must be an ASN1 parsing error */
328 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
332 /* Did we fall off the end without reading anything? */
333 if (i == it->tcount) {
334 /* If OPTIONAL, this is OK */
336 /* Free and zero it */
337 ASN1_item_ex_free(pval, it);
340 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_NO_MATCHING_CHOICE_TYPE);
344 asn1_set_choice_selector(pval, i, it);
346 if (asn1_cb && !asn1_cb(ASN1_OP_D2I_POST, pval, it, NULL))
350 case ASN1_ITYPE_NDEF_SEQUENCE:
351 case ASN1_ITYPE_SEQUENCE:
355 /* If no IMPLICIT tagging set to SEQUENCE, UNIVERSAL */
357 tag = V_ASN1_SEQUENCE;
358 aclass = V_ASN1_UNIVERSAL;
360 /* Get SEQUENCE length and update len, p */
361 ret = asn1_check_tlen(&len, NULL, NULL, &seq_eoc, &cst,
362 &p, len, tag, aclass, opt, ctx);
364 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
366 } else if (ret == -1)
368 if (aux && (aux->flags & ASN1_AFLG_BROKEN)) {
369 len = tmplen - (p - *in);
372 /* If indefinite we don't do a length check */
376 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_SEQUENCE_NOT_CONSTRUCTED);
380 if (!*pval && !ASN1_item_ex_new(pval, it)) {
381 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
385 if (asn1_cb && !asn1_cb(ASN1_OP_D2I_PRE, pval, it, NULL))
388 /* Get each field entry */
389 for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) {
390 const ASN1_TEMPLATE *seqtt;
391 ASN1_VALUE **pseqval;
392 seqtt = asn1_do_adb(pval, tt, 1);
395 pseqval = asn1_get_field_ptr(pval, seqtt);
396 /* Have we ran out of data? */
400 if (asn1_check_eoc(&p, len)) {
402 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_UNEXPECTED_EOC);
411 * This determines the OPTIONAL flag value. The field cannot be
412 * omitted if it is the last of a SEQUENCE and there is still
413 * data to be read. This isn't strictly necessary but it
414 * increases efficiency in some cases.
416 if (i == (it->tcount - 1))
419 isopt = (char)(seqtt->flags & ASN1_TFLG_OPTIONAL);
421 * attempt to read in field, allowing each to be OPTIONAL
424 ret = asn1_template_ex_d2i(pseqval, &p, len, seqtt, isopt, ctx);
428 } else if (ret == -1) {
430 * OPTIONAL component absent. Free and zero the field.
432 ASN1_template_free(pseqval, seqtt);
439 /* Check for EOC if expecting one */
440 if (seq_eoc && !asn1_check_eoc(&p, len)) {
441 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_MISSING_EOC);
444 /* Check all data read */
445 if (!seq_nolen && len) {
446 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_SEQUENCE_LENGTH_MISMATCH);
451 * If we get here we've got no more data in the SEQUENCE, however we
452 * may not have read all fields so check all remaining are OPTIONAL
453 * and clear any that are.
455 for (; i < it->tcount; tt++, i++) {
456 const ASN1_TEMPLATE *seqtt;
457 seqtt = asn1_do_adb(pval, tt, 1);
460 if (seqtt->flags & ASN1_TFLG_OPTIONAL) {
461 ASN1_VALUE **pseqval;
462 pseqval = asn1_get_field_ptr(pval, seqtt);
463 ASN1_template_free(pseqval, seqtt);
466 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_FIELD_MISSING);
471 if (!asn1_enc_save(pval, *in, p - *in, it))
474 if (asn1_cb && !asn1_cb(ASN1_OP_D2I_POST, pval, it, NULL))
482 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_AUX_ERROR);
484 ASN1_item_ex_free(pval, it);
486 ERR_add_error_data(4, "Field=", errtt->field_name,
487 ", Type=", it->sname);
489 ERR_add_error_data(2, "Type=", it->sname);
494 * Templates are handled with two separate functions. One handles any
495 * EXPLICIT tag and the other handles the rest.
498 static int asn1_template_ex_d2i(ASN1_VALUE **val,
499 const unsigned char **in, long inlen,
500 const ASN1_TEMPLATE *tt, char opt,
506 const unsigned char *p, *q;
511 aclass = flags & ASN1_TFLG_TAG_CLASS;
515 /* Check if EXPLICIT tag expected */
516 if (flags & ASN1_TFLG_EXPTAG) {
519 * Need to work out amount of data available to the inner content and
520 * where it starts: so read in EXPLICIT header to get the info.
522 ret = asn1_check_tlen(&len, NULL, NULL, &exp_eoc, &cst,
523 &p, inlen, tt->tag, aclass, opt, ctx);
526 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
528 } else if (ret == -1)
531 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I,
532 ASN1_R_EXPLICIT_TAG_NOT_CONSTRUCTED);
535 /* We've found the field so it can't be OPTIONAL now */
536 ret = asn1_template_noexp_d2i(val, &p, len, tt, 0, ctx);
538 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
541 /* We read the field in OK so update length */
544 /* If NDEF we must have an EOC here */
545 if (!asn1_check_eoc(&p, len)) {
546 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ASN1_R_MISSING_EOC);
551 * Otherwise we must hit the EXPLICIT tag end or its an error
554 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I,
555 ASN1_R_EXPLICIT_LENGTH_MISMATCH);
560 return asn1_template_noexp_d2i(val, in, inlen, tt, opt, ctx);
566 ASN1_template_free(val, tt);
570 static int asn1_template_noexp_d2i(ASN1_VALUE **val,
571 const unsigned char **in, long len,
572 const ASN1_TEMPLATE *tt, char opt,
577 const unsigned char *p, *q;
581 aclass = flags & ASN1_TFLG_TAG_CLASS;
586 if (flags & ASN1_TFLG_SK_MASK) {
587 /* SET OF, SEQUENCE OF */
590 /* First work out expected inner tag value */
591 if (flags & ASN1_TFLG_IMPTAG) {
595 skaclass = V_ASN1_UNIVERSAL;
596 if (flags & ASN1_TFLG_SET_OF)
599 sktag = V_ASN1_SEQUENCE;
602 ret = asn1_check_tlen(&len, NULL, NULL, &sk_eoc, NULL,
603 &p, len, sktag, skaclass, opt, ctx);
605 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_NESTED_ASN1_ERROR);
607 } else if (ret == -1)
610 *val = (ASN1_VALUE *)sk_new_null();
613 * We've got a valid STACK: free up any items present
615 STACK_OF(ASN1_VALUE) *sktmp = (STACK_OF(ASN1_VALUE) *)*val;
617 while (sk_ASN1_VALUE_num(sktmp) > 0) {
618 vtmp = sk_ASN1_VALUE_pop(sktmp);
619 ASN1_item_ex_free(&vtmp, ASN1_ITEM_ptr(tt->item));
624 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_MALLOC_FAILURE);
628 /* Read as many items as we can */
632 /* See if EOC found */
633 if (asn1_check_eoc(&p, len)) {
635 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I,
636 ASN1_R_UNEXPECTED_EOC);
644 if (!ASN1_item_ex_d2i(&skfield, &p, len,
645 ASN1_ITEM_ptr(tt->item), -1, 0, 0, ctx)) {
646 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I,
647 ERR_R_NESTED_ASN1_ERROR);
651 if (!sk_ASN1_VALUE_push((STACK_OF(ASN1_VALUE) *)*val, skfield)) {
652 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_MALLOC_FAILURE);
657 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ASN1_R_MISSING_EOC);
660 } else if (flags & ASN1_TFLG_IMPTAG) {
661 /* IMPLICIT tagging */
662 ret = ASN1_item_ex_d2i(val, &p, len,
663 ASN1_ITEM_ptr(tt->item), tt->tag, aclass, opt,
666 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_NESTED_ASN1_ERROR);
668 } else if (ret == -1)
671 /* Nothing special */
672 ret = ASN1_item_ex_d2i(val, &p, len, ASN1_ITEM_ptr(tt->item),
675 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_NESTED_ASN1_ERROR);
677 } else if (ret == -1)
685 ASN1_template_free(val, tt);
689 static int asn1_d2i_ex_primitive(ASN1_VALUE **pval,
690 const unsigned char **in, long inlen,
692 int tag, int aclass, char opt, ASN1_TLC *ctx)
696 char cst, inf, free_cont = 0;
697 const unsigned char *p;
699 const unsigned char *cont = NULL;
702 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_ILLEGAL_NULL);
703 return 0; /* Should never happen */
706 if (it->itype == ASN1_ITYPE_MSTRING) {
712 if (utype == V_ASN1_ANY) {
713 /* If type is ANY need to figure out type from tag */
714 unsigned char oclass;
716 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_ILLEGAL_TAGGED_ANY);
720 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE,
721 ASN1_R_ILLEGAL_OPTIONAL_ANY);
725 ret = asn1_check_tlen(NULL, &utype, &oclass, NULL, NULL,
726 &p, inlen, -1, 0, 0, ctx);
728 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_NESTED_ASN1_ERROR);
731 if (oclass != V_ASN1_UNIVERSAL)
732 utype = V_ASN1_OTHER;
736 aclass = V_ASN1_UNIVERSAL;
740 ret = asn1_check_tlen(&plen, NULL, NULL, &inf, &cst,
741 &p, inlen, tag, aclass, opt, ctx);
743 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_NESTED_ASN1_ERROR);
745 } else if (ret == -1)
748 /* SEQUENCE, SET and "OTHER" are left in encoded form */
749 if ((utype == V_ASN1_SEQUENCE)
750 || (utype == V_ASN1_SET) || (utype == V_ASN1_OTHER)) {
752 * Clear context cache for type OTHER because the auto clear when we
753 * have a exact match wont work
755 if (utype == V_ASN1_OTHER) {
758 /* SEQUENCE and SET must be constructed */
760 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE,
761 ASN1_R_TYPE_NOT_CONSTRUCTED);
766 /* If indefinite length constructed find the real end */
768 if (!asn1_find_end(&p, plen, inf))
772 len = p - cont + plen;
777 if (utype == V_ASN1_NULL || utype == V_ASN1_BOOLEAN
778 || utype == V_ASN1_OBJECT || utype == V_ASN1_INTEGER
779 || utype == V_ASN1_ENUMERATED) {
780 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_TYPE_NOT_PRIMITIVE);
787 * Should really check the internal tags are correct but some things
788 * may get this wrong. The relevant specs say that constructed string
789 * types should be OCTET STRINGs internally irrespective of the type.
790 * So instead just check for UNIVERSAL class and ignore the tag.
792 if (!asn1_collect(&buf, &p, plen, inf, -1, V_ASN1_UNIVERSAL, 0)) {
797 /* Append a final null to string */
798 if (!BUF_MEM_grow_clean(&buf, len + 1)) {
799 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_MALLOC_FAILURE);
803 cont = (const unsigned char *)buf.data;
811 /* We now have content length and type: translate into a structure */
812 if (!asn1_ex_c2i(pval, cont, len, utype, &free_cont, it))
818 if (free_cont && buf.data)
819 OPENSSL_free(buf.data);
823 /* Translate ASN1 content octets into a structure */
825 int asn1_ex_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len,
826 int utype, char *free_cont, const ASN1_ITEM *it)
828 ASN1_VALUE **opval = NULL;
830 ASN1_TYPE *typ = NULL;
832 const ASN1_PRIMITIVE_FUNCS *pf;
836 if (pf && pf->prim_c2i)
837 return pf->prim_c2i(pval, cont, len, utype, free_cont, it);
838 /* If ANY type clear type and set pointer to internal value */
839 if (it->utype == V_ASN1_ANY) {
841 typ = ASN1_TYPE_new();
844 *pval = (ASN1_VALUE *)typ;
846 typ = (ASN1_TYPE *)*pval;
848 if (utype != typ->type)
849 ASN1_TYPE_set(typ, utype, NULL);
851 pval = &typ->value.asn1_value;
855 if (!c2i_ASN1_OBJECT((ASN1_OBJECT **)pval, &cont, len))
861 ASN1err(ASN1_F_ASN1_EX_C2I, ASN1_R_NULL_IS_WRONG_LENGTH);
864 *pval = (ASN1_VALUE *)1;
869 ASN1err(ASN1_F_ASN1_EX_C2I, ASN1_R_BOOLEAN_IS_WRONG_LENGTH);
873 tbool = (ASN1_BOOLEAN *)pval;
878 case V_ASN1_BIT_STRING:
879 if (!c2i_ASN1_BIT_STRING((ASN1_BIT_STRING **)pval, &cont, len))
884 case V_ASN1_NEG_INTEGER:
885 case V_ASN1_ENUMERATED:
886 case V_ASN1_NEG_ENUMERATED:
887 tint = (ASN1_INTEGER **)pval;
888 if (!c2i_ASN1_INTEGER(tint, &cont, len))
890 /* Fixup type to match the expected form */
891 (*tint)->type = utype | ((*tint)->type & V_ASN1_NEG);
894 case V_ASN1_OCTET_STRING:
895 case V_ASN1_NUMERICSTRING:
896 case V_ASN1_PRINTABLESTRING:
897 case V_ASN1_T61STRING:
898 case V_ASN1_VIDEOTEXSTRING:
899 case V_ASN1_IA5STRING:
901 case V_ASN1_GENERALIZEDTIME:
902 case V_ASN1_GRAPHICSTRING:
903 case V_ASN1_VISIBLESTRING:
904 case V_ASN1_GENERALSTRING:
905 case V_ASN1_UNIVERSALSTRING:
906 case V_ASN1_BMPSTRING:
907 case V_ASN1_UTF8STRING:
910 case V_ASN1_SEQUENCE:
912 if (utype == V_ASN1_BMPSTRING && (len & 1)) {
913 ASN1err(ASN1_F_ASN1_EX_C2I, ASN1_R_BMPSTRING_IS_WRONG_LENGTH);
916 if (utype == V_ASN1_UNIVERSALSTRING && (len & 3)) {
917 ASN1err(ASN1_F_ASN1_EX_C2I,
918 ASN1_R_UNIVERSALSTRING_IS_WRONG_LENGTH);
921 /* All based on ASN1_STRING and handled the same */
923 stmp = ASN1_STRING_type_new(utype);
925 ASN1err(ASN1_F_ASN1_EX_C2I, ERR_R_MALLOC_FAILURE);
928 *pval = (ASN1_VALUE *)stmp;
930 stmp = (ASN1_STRING *)*pval;
933 /* If we've already allocated a buffer use it */
936 OPENSSL_free(stmp->data);
937 stmp->data = (unsigned char *)cont; /* UGLY CAST! RL */
941 if (!ASN1_STRING_set(stmp, cont, len)) {
942 ASN1err(ASN1_F_ASN1_EX_C2I, ERR_R_MALLOC_FAILURE);
943 ASN1_STRING_free(stmp);
950 /* If ASN1_ANY and NULL type fix up value */
951 if (typ && (utype == V_ASN1_NULL))
952 typ->value.ptr = NULL;
965 * This function finds the end of an ASN1 structure when passed its maximum
966 * length, whether it is indefinite length and a pointer to the content. This
967 * is more efficient than calling asn1_collect because it does not recurse on
968 * each indefinite length header.
971 static int asn1_find_end(const unsigned char **in, long len, char inf)
975 const unsigned char *p = *in, *q;
976 /* If not indefinite length constructed just add length */
983 * Indefinite length constructed form. Find the end when enough EOCs are
984 * found. If more indefinite length constructed headers are encountered
985 * increment the expected eoc count otherwise just skip to the end of the
989 if (asn1_check_eoc(&p, len)) {
991 if (expected_eoc == 0)
997 /* Just read in a header: only care about the length */
998 if (!asn1_check_tlen(&plen, NULL, NULL, &inf, NULL, &p, len,
1000 ASN1err(ASN1_F_ASN1_FIND_END, ERR_R_NESTED_ASN1_ERROR);
1010 ASN1err(ASN1_F_ASN1_FIND_END, ASN1_R_MISSING_EOC);
1018 * This function collects the asn1 data from a constructred string type into
1019 * a buffer. The values of 'in' and 'len' should refer to the contents of the
1020 * constructed type and 'inf' should be set if it is indefinite length.
1023 #ifndef ASN1_MAX_STRING_NEST
1025 * This determines how many levels of recursion are permitted in ASN1 string
1026 * types. If it is not limited stack overflows can occur. If set to zero no
1027 * recursion is allowed at all. Although zero should be adequate examples
1028 * exist that require a value of 1. So 5 should be more than enough.
1030 # define ASN1_MAX_STRING_NEST 5
1033 static int asn1_collect(BUF_MEM *buf, const unsigned char **in, long len,
1034 char inf, int tag, int aclass, int depth)
1036 const unsigned char *p, *q;
1042 * If no buffer and not indefinite length constructed just pass over the
1052 if (asn1_check_eoc(&p, len)) {
1054 * EOC is illegal outside indefinite length constructed form
1057 ASN1err(ASN1_F_ASN1_COLLECT, ASN1_R_UNEXPECTED_EOC);
1064 if (!asn1_check_tlen(&plen, NULL, NULL, &ininf, &cst, &p,
1065 len, tag, aclass, 0, NULL)) {
1066 ASN1err(ASN1_F_ASN1_COLLECT, ERR_R_NESTED_ASN1_ERROR);
1070 /* If indefinite length constructed update max length */
1072 if (depth >= ASN1_MAX_STRING_NEST) {
1073 ASN1err(ASN1_F_ASN1_COLLECT, ASN1_R_NESTED_ASN1_STRING);
1076 if (!asn1_collect(buf, &p, plen, ininf, tag, aclass, depth + 1))
1078 } else if (plen && !collect_data(buf, &p, plen))
1083 ASN1err(ASN1_F_ASN1_COLLECT, ASN1_R_MISSING_EOC);
1090 static int collect_data(BUF_MEM *buf, const unsigned char **p, long plen)
1095 if (!BUF_MEM_grow_clean(buf, len + plen)) {
1096 ASN1err(ASN1_F_COLLECT_DATA, ERR_R_MALLOC_FAILURE);
1099 memcpy(buf->data + len, *p, plen);
1105 /* Check for ASN1 EOC and swallow it if found */
1107 static int asn1_check_eoc(const unsigned char **in, long len)
1109 const unsigned char *p;
1113 if (!p[0] && !p[1]) {
1121 * Check an ASN1 tag and length: a bit like ASN1_get_object but it sets the
1122 * length for indefinite length constructed form, we don't know the exact
1123 * length but we can set an upper bound to the amount of data available minus
1124 * the header length just read.
1127 static int asn1_check_tlen(long *olen, int *otag, unsigned char *oclass,
1128 char *inf, char *cst,
1129 const unsigned char **in, long len,
1130 int exptag, int expclass, char opt, ASN1_TLC *ctx)
1135 const unsigned char *p, *q;
1139 if (ctx && ctx->valid) {
1142 pclass = ctx->pclass;
1146 i = ASN1_get_object(&p, &plen, &ptag, &pclass, len);
1150 ctx->pclass = pclass;
1152 ctx->hdrlen = p - q;
1155 * If definite length, and no error, length + header can't exceed
1156 * total amount of data available.
1158 if (!(i & 0x81) && ((plen + ctx->hdrlen) > len)) {
1159 ASN1err(ASN1_F_ASN1_CHECK_TLEN, ASN1_R_TOO_LONG);
1160 asn1_tlc_clear(ctx);
1167 ASN1err(ASN1_F_ASN1_CHECK_TLEN, ASN1_R_BAD_OBJECT_HEADER);
1168 asn1_tlc_clear(ctx);
1172 if ((exptag != ptag) || (expclass != pclass)) {
1174 * If type is OPTIONAL, not an error: indicate missing type.
1178 asn1_tlc_clear(ctx);
1179 ASN1err(ASN1_F_ASN1_CHECK_TLEN, ASN1_R_WRONG_TAG);
1183 * We have a tag and class match: assume we are going to do something
1186 asn1_tlc_clear(ctx);
1190 plen = len - (p - q);
1196 *cst = i & V_ASN1_CONSTRUCTED;