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
129 * Decode an ASN1 item, this currently behaves just like a standard 'd2i'
130 * function. 'in' points to a buffer to read the data from, in future we
131 * will have more advanced versions that can input data a piece at a time and
132 * this will simply be a special case.
135 ASN1_VALUE *ASN1_item_d2i(ASN1_VALUE **pval,
136 const unsigned char **in, long len,
140 ASN1_VALUE *ptmpval = NULL;
144 if (ASN1_item_ex_d2i(pval, in, len, it, -1, 0, 0, &c) > 0)
149 int ASN1_template_d2i(ASN1_VALUE **pval,
150 const unsigned char **in, long len,
151 const ASN1_TEMPLATE *tt)
155 return asn1_template_ex_d2i(pval, in, len, tt, 0, &c);
159 * Decode an item, taking care of IMPLICIT tagging, if any. If 'opt' set and
160 * tag mismatch return -1 to handle OPTIONAL
163 int ASN1_item_ex_d2i(ASN1_VALUE **pval, const unsigned char **in, long len,
165 int tag, int aclass, char opt, ASN1_TLC *ctx)
167 const ASN1_TEMPLATE *tt, *errtt = NULL;
168 const ASN1_COMPAT_FUNCS *cf;
169 const ASN1_EXTERN_FUNCS *ef;
170 const ASN1_AUX *aux = it->funcs;
171 ASN1_aux_cb *asn1_cb;
172 const unsigned char *p = NULL, *q;
173 unsigned char *wp = NULL; /* BIG FAT WARNING! BREAKS CONST WHERE USED */
174 unsigned char imphack = 0, oclass;
175 char seq_eoc, seq_nolen, cst, isopt;
180 ASN1_VALUE **pchptr, *ptmpval;
181 int combine = aclass & ASN1_TFLG_COMBINE;
182 aclass &= ~ASN1_TFLG_COMBINE;
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);
211 case ASN1_ITYPE_MSTRING:
213 /* Just read in tag and class */
214 ret = asn1_check_tlen(NULL, &otag, &oclass, NULL, NULL,
215 &p, len, -1, 0, 1, ctx);
217 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
221 /* Must be UNIVERSAL class */
222 if (oclass != V_ASN1_UNIVERSAL) {
223 /* If OPTIONAL, assume this is OK */
226 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_MSTRING_NOT_UNIVERSAL);
229 /* Check tag matches bit map */
230 if (!(ASN1_tag2bit(otag) & it->utype)) {
231 /* If OPTIONAL, assume this is OK */
234 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_MSTRING_WRONG_TAG);
237 return asn1_d2i_ex_primitive(pval, in, len, it, otag, 0, 0, ctx);
239 case ASN1_ITYPE_EXTERN:
240 /* Use new style d2i */
242 return ef->asn1_ex_d2i(pval, in, len, it, tag, aclass, opt, ctx);
244 case ASN1_ITYPE_COMPAT:
245 /* we must resort to old style evil hackery */
248 /* If OPTIONAL see if it is there */
257 * Don't care about anything other than presence of expected tag
260 ret = asn1_check_tlen(NULL, NULL, NULL, NULL, NULL,
261 &p, len, exptag, aclass, 1, ctx);
263 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
271 * This is the old style evil hack IMPLICIT handling: since the
272 * underlying code is expecting a tag and class other than the one
273 * present we change the buffer temporarily then change it back
274 * afterwards. This doesn't and never did work for tags > 30. Yes
275 * this is *horrible* but it is only needed for old style d2i which
276 * will hopefully not be around for much longer. FIXME: should copy
277 * the buffer then modify it so the input buffer can be const: we
278 * should *always* copy because the old style d2i might modify the
283 wp = *(unsigned char **)in;
286 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
289 *wp = (unsigned char)((*p & V_ASN1_CONSTRUCTED)
293 ptmpval = cf->asn1_d2i(pval, in, len);
301 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
304 case ASN1_ITYPE_CHOICE:
305 if (asn1_cb && !asn1_cb(ASN1_OP_D2I_PRE, pval, it))
308 /* Free up and zero CHOICE value if initialised */
309 i = asn1_get_choice_selector(pval, it);
310 if ((i >= 0) && (i < it->tcount)) {
311 tt = it->templates + i;
312 pchptr = asn1_get_field_ptr(pval, tt);
313 ASN1_template_free(pchptr, tt);
314 asn1_set_choice_selector(pval, -1, it);
316 } else if (!ASN1_item_ex_new(pval, it)) {
317 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
320 /* CHOICE type, try each possibility in turn */
322 for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) {
323 pchptr = asn1_get_field_ptr(pval, tt);
325 * We mark field as OPTIONAL so its absence can be recognised.
327 ret = asn1_template_ex_d2i(pchptr, &p, len, tt, 1, ctx);
328 /* If field not present, try the next one */
331 /* If positive return, read OK, break loop */
334 /* Otherwise must be an ASN1 parsing error */
336 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
340 /* Did we fall off the end without reading anything? */
341 if (i == it->tcount) {
342 /* If OPTIONAL, this is OK */
344 /* Free and zero it */
345 ASN1_item_ex_free(pval, it);
348 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_NO_MATCHING_CHOICE_TYPE);
352 asn1_set_choice_selector(pval, i, it);
354 if (asn1_cb && !asn1_cb(ASN1_OP_D2I_POST, pval, it))
358 case ASN1_ITYPE_NDEF_SEQUENCE:
359 case ASN1_ITYPE_SEQUENCE:
363 /* If no IMPLICIT tagging set to SEQUENCE, UNIVERSAL */
365 tag = V_ASN1_SEQUENCE;
366 aclass = V_ASN1_UNIVERSAL;
368 /* Get SEQUENCE length and update len, p */
369 ret = asn1_check_tlen(&len, NULL, NULL, &seq_eoc, &cst,
370 &p, len, tag, aclass, opt, ctx);
372 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
374 } else if (ret == -1)
376 if (aux && (aux->flags & ASN1_AFLG_BROKEN)) {
377 len = tmplen - (p - *in);
380 /* If indefinite we don't do a length check */
384 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_SEQUENCE_NOT_CONSTRUCTED);
388 if (!*pval && !ASN1_item_ex_new(pval, it)) {
389 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
393 if (asn1_cb && !asn1_cb(ASN1_OP_D2I_PRE, pval, it))
396 /* Free up and zero any ADB found */
397 for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) {
398 if (tt->flags & ASN1_TFLG_ADB_MASK) {
399 const ASN1_TEMPLATE *seqtt;
400 ASN1_VALUE **pseqval;
401 seqtt = asn1_do_adb(pval, tt, 1);
402 pseqval = asn1_get_field_ptr(pval, seqtt);
403 ASN1_template_free(pseqval, seqtt);
407 /* Get each field entry */
408 for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) {
409 const ASN1_TEMPLATE *seqtt;
410 ASN1_VALUE **pseqval;
411 seqtt = asn1_do_adb(pval, tt, 1);
414 pseqval = asn1_get_field_ptr(pval, seqtt);
415 /* Have we ran out of data? */
419 if (asn1_check_eoc(&p, len)) {
421 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_UNEXPECTED_EOC);
430 * This determines the OPTIONAL flag value. The field cannot be
431 * omitted if it is the last of a SEQUENCE and there is still
432 * data to be read. This isn't strictly necessary but it
433 * increases efficiency in some cases.
435 if (i == (it->tcount - 1))
438 isopt = (char)(seqtt->flags & ASN1_TFLG_OPTIONAL);
440 * attempt to read in field, allowing each to be OPTIONAL
443 ret = asn1_template_ex_d2i(pseqval, &p, len, seqtt, isopt, ctx);
447 } else if (ret == -1) {
449 * OPTIONAL component absent. Free and zero the field.
451 ASN1_template_free(pseqval, seqtt);
458 /* Check for EOC if expecting one */
459 if (seq_eoc && !asn1_check_eoc(&p, len)) {
460 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_MISSING_EOC);
463 /* Check all data read */
464 if (!seq_nolen && len) {
465 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_SEQUENCE_LENGTH_MISMATCH);
470 * If we get here we've got no more data in the SEQUENCE, however we
471 * may not have read all fields so check all remaining are OPTIONAL
472 * and clear any that are.
474 for (; i < it->tcount; tt++, i++) {
475 const ASN1_TEMPLATE *seqtt;
476 seqtt = asn1_do_adb(pval, tt, 1);
479 if (seqtt->flags & ASN1_TFLG_OPTIONAL) {
480 ASN1_VALUE **pseqval;
481 pseqval = asn1_get_field_ptr(pval, seqtt);
482 ASN1_template_free(pseqval, seqtt);
485 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_FIELD_MISSING);
490 if (!asn1_enc_save(pval, *in, p - *in, it))
493 if (asn1_cb && !asn1_cb(ASN1_OP_D2I_POST, pval, it))
501 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_AUX_ERROR);
504 ASN1_item_ex_free(pval, it);
506 ERR_add_error_data(4, "Field=", errtt->field_name,
507 ", Type=", it->sname);
509 ERR_add_error_data(2, "Type=", it->sname);
514 * Templates are handled with two separate functions. One handles any
515 * EXPLICIT tag and the other handles the rest.
518 static int asn1_template_ex_d2i(ASN1_VALUE **val,
519 const unsigned char **in, long inlen,
520 const ASN1_TEMPLATE *tt, char opt,
526 const unsigned char *p, *q;
531 aclass = flags & ASN1_TFLG_TAG_CLASS;
535 /* Check if EXPLICIT tag expected */
536 if (flags & ASN1_TFLG_EXPTAG) {
539 * Need to work out amount of data available to the inner content and
540 * where it starts: so read in EXPLICIT header to get the info.
542 ret = asn1_check_tlen(&len, NULL, NULL, &exp_eoc, &cst,
543 &p, inlen, tt->tag, aclass, opt, ctx);
546 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
548 } else if (ret == -1)
551 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I,
552 ASN1_R_EXPLICIT_TAG_NOT_CONSTRUCTED);
555 /* We've found the field so it can't be OPTIONAL now */
556 ret = asn1_template_noexp_d2i(val, &p, len, tt, 0, ctx);
558 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
561 /* We read the field in OK so update length */
564 /* If NDEF we must have an EOC here */
565 if (!asn1_check_eoc(&p, len)) {
566 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ASN1_R_MISSING_EOC);
571 * Otherwise we must hit the EXPLICIT tag end or its an error
574 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I,
575 ASN1_R_EXPLICIT_LENGTH_MISMATCH);
580 return asn1_template_noexp_d2i(val, in, inlen, tt, opt, ctx);
586 ASN1_template_free(val, tt);
590 static int asn1_template_noexp_d2i(ASN1_VALUE **val,
591 const unsigned char **in, long len,
592 const ASN1_TEMPLATE *tt, char opt,
597 const unsigned char *p, *q;
601 aclass = flags & ASN1_TFLG_TAG_CLASS;
606 if (flags & ASN1_TFLG_SK_MASK) {
607 /* SET OF, SEQUENCE OF */
610 /* First work out expected inner tag value */
611 if (flags & ASN1_TFLG_IMPTAG) {
615 skaclass = V_ASN1_UNIVERSAL;
616 if (flags & ASN1_TFLG_SET_OF)
619 sktag = V_ASN1_SEQUENCE;
622 ret = asn1_check_tlen(&len, NULL, NULL, &sk_eoc, NULL,
623 &p, len, sktag, skaclass, opt, ctx);
625 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_NESTED_ASN1_ERROR);
627 } else if (ret == -1)
630 *val = (ASN1_VALUE *)sk_new_null();
633 * We've got a valid STACK: free up any items present
635 STACK *sktmp = (STACK *) * val;
637 while (sk_num(sktmp) > 0) {
638 vtmp = (ASN1_VALUE *)sk_pop(sktmp);
639 ASN1_item_ex_free(&vtmp, ASN1_ITEM_ptr(tt->item));
644 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_MALLOC_FAILURE);
648 /* Read as many items as we can */
652 /* See if EOC found */
653 if (asn1_check_eoc(&p, len)) {
655 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I,
656 ASN1_R_UNEXPECTED_EOC);
664 if (!ASN1_item_ex_d2i(&skfield, &p, len,
665 ASN1_ITEM_ptr(tt->item), -1, 0, 0, ctx)) {
666 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I,
667 ERR_R_NESTED_ASN1_ERROR);
671 if (!sk_push((STACK *) * val, (char *)skfield)) {
672 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_MALLOC_FAILURE);
677 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ASN1_R_MISSING_EOC);
680 } else if (flags & ASN1_TFLG_IMPTAG) {
681 /* IMPLICIT tagging */
682 ret = ASN1_item_ex_d2i(val, &p, len,
683 ASN1_ITEM_ptr(tt->item), tt->tag, aclass, opt,
686 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_NESTED_ASN1_ERROR);
688 } else if (ret == -1)
691 /* Nothing special */
692 ret = ASN1_item_ex_d2i(val, &p, len, ASN1_ITEM_ptr(tt->item),
693 -1, tt->flags & ASN1_TFLG_COMBINE, opt, ctx);
695 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_NESTED_ASN1_ERROR);
697 } else if (ret == -1)
705 ASN1_template_free(val, tt);
709 static int asn1_d2i_ex_primitive(ASN1_VALUE **pval,
710 const unsigned char **in, long inlen,
712 int tag, int aclass, char opt, ASN1_TLC *ctx)
716 char cst, inf, free_cont = 0;
717 const unsigned char *p;
719 const unsigned char *cont = NULL;
722 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_ILLEGAL_NULL);
723 return 0; /* Should never happen */
726 if (it->itype == ASN1_ITYPE_MSTRING) {
732 if (utype == V_ASN1_ANY) {
733 /* If type is ANY need to figure out type from tag */
734 unsigned char oclass;
736 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_ILLEGAL_TAGGED_ANY);
740 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE,
741 ASN1_R_ILLEGAL_OPTIONAL_ANY);
745 ret = asn1_check_tlen(NULL, &utype, &oclass, NULL, NULL,
746 &p, inlen, -1, 0, 0, ctx);
748 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_NESTED_ASN1_ERROR);
751 if (oclass != V_ASN1_UNIVERSAL)
752 utype = V_ASN1_OTHER;
756 aclass = V_ASN1_UNIVERSAL;
760 ret = asn1_check_tlen(&plen, NULL, NULL, &inf, &cst,
761 &p, inlen, tag, aclass, opt, ctx);
763 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_NESTED_ASN1_ERROR);
765 } else if (ret == -1)
768 /* SEQUENCE, SET and "OTHER" are left in encoded form */
769 if ((utype == V_ASN1_SEQUENCE)
770 || (utype == V_ASN1_SET) || (utype == V_ASN1_OTHER)) {
772 * Clear context cache for type OTHER because the auto clear when we
773 * have a exact match wont work
775 if (utype == V_ASN1_OTHER) {
778 /* SEQUENCE and SET must be constructed */
780 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE,
781 ASN1_R_TYPE_NOT_CONSTRUCTED);
786 /* If indefinite length constructed find the real end */
788 if (!asn1_find_end(&p, plen, inf))
792 len = p - cont + plen;
797 if (utype == V_ASN1_NULL || utype == V_ASN1_BOOLEAN
798 || utype == V_ASN1_OBJECT || utype == V_ASN1_INTEGER
799 || utype == V_ASN1_ENUMERATED) {
800 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_TYPE_NOT_PRIMITIVE);
807 * Should really check the internal tags are correct but some things
808 * may get this wrong. The relevant specs say that constructed string
809 * types should be OCTET STRINGs internally irrespective of the type.
810 * So instead just check for UNIVERSAL class and ignore the tag.
812 if (!asn1_collect(&buf, &p, plen, inf, -1, V_ASN1_UNIVERSAL, 0)) {
817 /* Append a final null to string */
818 if (!BUF_MEM_grow_clean(&buf, len + 1)) {
819 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_MALLOC_FAILURE);
823 cont = (const unsigned char *)buf.data;
831 /* We now have content length and type: translate into a structure */
832 if (!asn1_ex_c2i(pval, cont, len, utype, &free_cont, it))
838 if (free_cont && buf.data)
839 OPENSSL_free(buf.data);
843 /* Translate ASN1 content octets into a structure */
845 int asn1_ex_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len,
846 int utype, char *free_cont, const ASN1_ITEM *it)
848 ASN1_VALUE **opval = NULL;
850 ASN1_TYPE *typ = NULL;
852 const ASN1_PRIMITIVE_FUNCS *pf;
856 if (pf && pf->prim_c2i)
857 return pf->prim_c2i(pval, cont, len, utype, free_cont, it);
858 /* If ANY type clear type and set pointer to internal value */
859 if (it->utype == V_ASN1_ANY) {
861 typ = ASN1_TYPE_new();
864 *pval = (ASN1_VALUE *)typ;
866 typ = (ASN1_TYPE *)*pval;
868 if (utype != typ->type)
869 ASN1_TYPE_set(typ, utype, NULL);
871 pval = &typ->value.asn1_value;
875 if (!c2i_ASN1_OBJECT((ASN1_OBJECT **)pval, &cont, len))
881 ASN1err(ASN1_F_ASN1_EX_C2I, ASN1_R_NULL_IS_WRONG_LENGTH);
884 *pval = (ASN1_VALUE *)1;
889 ASN1err(ASN1_F_ASN1_EX_C2I, ASN1_R_BOOLEAN_IS_WRONG_LENGTH);
893 tbool = (ASN1_BOOLEAN *)pval;
898 case V_ASN1_BIT_STRING:
899 if (!c2i_ASN1_BIT_STRING((ASN1_BIT_STRING **)pval, &cont, len))
904 case V_ASN1_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;