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;
183 int combine = aclass & ASN1_TFLG_COMBINE;
184 aclass &= ~ASN1_TFLG_COMBINE;
187 if (aux && aux->asn1_cb)
188 asn1_cb = aux->asn1_cb;
193 case ASN1_ITYPE_PRIMITIVE:
196 * tagging or OPTIONAL is currently illegal on an item template
197 * because the flags can't get passed down. In practice this
198 * isn't a problem: we include the relevant flags from the item
199 * template in the template itself.
201 if ((tag != -1) || opt) {
202 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I,
203 ASN1_R_ILLEGAL_OPTIONS_ON_ITEM_TEMPLATE);
206 return asn1_template_ex_d2i(pval, in, len,
207 it->templates, opt, ctx);
209 return asn1_d2i_ex_primitive(pval, in, len, it,
210 tag, aclass, opt, ctx);
213 case ASN1_ITYPE_MSTRING:
215 /* Just read in tag and class */
216 ret = asn1_check_tlen(NULL, &otag, &oclass, NULL, NULL,
217 &p, len, -1, 0, 1, ctx);
219 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
223 /* Must be UNIVERSAL class */
224 if (oclass != V_ASN1_UNIVERSAL) {
225 /* If OPTIONAL, assume this is OK */
228 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_MSTRING_NOT_UNIVERSAL);
231 /* Check tag matches bit map */
232 if (!(ASN1_tag2bit(otag) & it->utype)) {
233 /* If OPTIONAL, assume this is OK */
236 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_MSTRING_WRONG_TAG);
239 return asn1_d2i_ex_primitive(pval, in, len, it, otag, 0, 0, ctx);
241 case ASN1_ITYPE_EXTERN:
242 /* Use new style d2i */
244 return ef->asn1_ex_d2i(pval, in, len, it, tag, aclass, opt, ctx);
246 case ASN1_ITYPE_COMPAT:
247 /* we must resort to old style evil hackery */
250 /* If OPTIONAL see if it is there */
259 * Don't care about anything other than presence of expected tag
262 ret = asn1_check_tlen(NULL, NULL, NULL, NULL, NULL,
263 &p, len, exptag, aclass, 1, ctx);
265 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
273 * This is the old style evil hack IMPLICIT handling: since the
274 * underlying code is expecting a tag and class other than the one
275 * present we change the buffer temporarily then change it back
276 * afterwards. This doesn't and never did work for tags > 30. Yes
277 * this is *horrible* but it is only needed for old style d2i which
278 * will hopefully not be around for much longer. FIXME: should copy
279 * the buffer then modify it so the input buffer can be const: we
280 * should *always* copy because the old style d2i might modify the
285 wp = *(unsigned char **)in;
288 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
291 *wp = (unsigned char)((*p & V_ASN1_CONSTRUCTED)
295 ptmpval = cf->asn1_d2i(pval, in, len);
303 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
306 case ASN1_ITYPE_CHOICE:
307 if (asn1_cb && !asn1_cb(ASN1_OP_D2I_PRE, pval, it, NULL))
310 /* Free up and zero CHOICE value if initialised */
311 i = asn1_get_choice_selector(pval, it);
312 if ((i >= 0) && (i < it->tcount)) {
313 tt = it->templates + i;
314 pchptr = asn1_get_field_ptr(pval, tt);
315 ASN1_template_free(pchptr, tt);
316 asn1_set_choice_selector(pval, -1, it);
318 } else if (!ASN1_item_ex_new(pval, it)) {
319 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
322 /* CHOICE type, try each possibility in turn */
324 for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) {
325 pchptr = asn1_get_field_ptr(pval, tt);
327 * We mark field as OPTIONAL so its absence can be recognised.
329 ret = asn1_template_ex_d2i(pchptr, &p, len, tt, 1, ctx);
330 /* If field not present, try the next one */
333 /* If positive return, read OK, break loop */
336 /* Otherwise must be an ASN1 parsing error */
338 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
342 /* Did we fall off the end without reading anything? */
343 if (i == it->tcount) {
344 /* If OPTIONAL, this is OK */
346 /* Free and zero it */
347 ASN1_item_ex_free(pval, it);
350 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_NO_MATCHING_CHOICE_TYPE);
354 asn1_set_choice_selector(pval, i, it);
355 if (asn1_cb && !asn1_cb(ASN1_OP_D2I_POST, pval, it, NULL))
360 case ASN1_ITYPE_NDEF_SEQUENCE:
361 case ASN1_ITYPE_SEQUENCE:
365 /* If no IMPLICIT tagging set to SEQUENCE, UNIVERSAL */
367 tag = V_ASN1_SEQUENCE;
368 aclass = V_ASN1_UNIVERSAL;
370 /* Get SEQUENCE length and update len, p */
371 ret = asn1_check_tlen(&len, NULL, NULL, &seq_eoc, &cst,
372 &p, len, tag, aclass, opt, ctx);
374 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
376 } else if (ret == -1)
378 if (aux && (aux->flags & ASN1_AFLG_BROKEN)) {
379 len = tmplen - (p - *in);
382 /* If indefinite we don't do a length check */
386 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_SEQUENCE_NOT_CONSTRUCTED);
390 if (!*pval && !ASN1_item_ex_new(pval, it)) {
391 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
395 if (asn1_cb && !asn1_cb(ASN1_OP_D2I_PRE, pval, it, NULL))
398 /* Free up and zero any ADB found */
399 for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) {
400 if (tt->flags & ASN1_TFLG_ADB_MASK) {
401 const ASN1_TEMPLATE *seqtt;
402 ASN1_VALUE **pseqval;
403 seqtt = asn1_do_adb(pval, tt, 0);
406 pseqval = asn1_get_field_ptr(pval, seqtt);
407 ASN1_template_free(pseqval, seqtt);
411 /* Get each field entry */
412 for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) {
413 const ASN1_TEMPLATE *seqtt;
414 ASN1_VALUE **pseqval;
415 seqtt = asn1_do_adb(pval, tt, 1);
418 pseqval = asn1_get_field_ptr(pval, seqtt);
419 /* Have we ran out of data? */
423 if (asn1_check_eoc(&p, len)) {
425 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_UNEXPECTED_EOC);
434 * This determines the OPTIONAL flag value. The field cannot be
435 * omitted if it is the last of a SEQUENCE and there is still
436 * data to be read. This isn't strictly necessary but it
437 * increases efficiency in some cases.
439 if (i == (it->tcount - 1))
442 isopt = (char)(seqtt->flags & ASN1_TFLG_OPTIONAL);
444 * attempt to read in field, allowing each to be OPTIONAL
447 ret = asn1_template_ex_d2i(pseqval, &p, len, seqtt, isopt, ctx);
451 } else if (ret == -1) {
453 * OPTIONAL component absent. Free and zero the field.
455 ASN1_template_free(pseqval, seqtt);
462 /* Check for EOC if expecting one */
463 if (seq_eoc && !asn1_check_eoc(&p, len)) {
464 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_MISSING_EOC);
467 /* Check all data read */
468 if (!seq_nolen && len) {
469 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_SEQUENCE_LENGTH_MISMATCH);
474 * If we get here we've got no more data in the SEQUENCE, however we
475 * may not have read all fields so check all remaining are OPTIONAL
476 * and clear any that are.
478 for (; i < it->tcount; tt++, i++) {
479 const ASN1_TEMPLATE *seqtt;
480 seqtt = asn1_do_adb(pval, tt, 1);
483 if (seqtt->flags & ASN1_TFLG_OPTIONAL) {
484 ASN1_VALUE **pseqval;
485 pseqval = asn1_get_field_ptr(pval, seqtt);
486 ASN1_template_free(pseqval, seqtt);
489 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_FIELD_MISSING);
494 if (!asn1_enc_save(pval, *in, p - *in, it))
496 if (asn1_cb && !asn1_cb(ASN1_OP_D2I_POST, pval, it, NULL))
505 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_AUX_ERROR);
508 ASN1_item_ex_free(pval, it);
510 ERR_add_error_data(4, "Field=", errtt->field_name,
511 ", Type=", it->sname);
513 ERR_add_error_data(2, "Type=", it->sname);
518 * Templates are handled with two separate functions. One handles any
519 * EXPLICIT tag and the other handles the rest.
522 static int asn1_template_ex_d2i(ASN1_VALUE **val,
523 const unsigned char **in, long inlen,
524 const ASN1_TEMPLATE *tt, char opt,
530 const unsigned char *p, *q;
535 aclass = flags & ASN1_TFLG_TAG_CLASS;
539 /* Check if EXPLICIT tag expected */
540 if (flags & ASN1_TFLG_EXPTAG) {
543 * Need to work out amount of data available to the inner content and
544 * where it starts: so read in EXPLICIT header to get the info.
546 ret = asn1_check_tlen(&len, NULL, NULL, &exp_eoc, &cst,
547 &p, inlen, tt->tag, aclass, opt, ctx);
550 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
552 } else if (ret == -1)
555 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I,
556 ASN1_R_EXPLICIT_TAG_NOT_CONSTRUCTED);
559 /* We've found the field so it can't be OPTIONAL now */
560 ret = asn1_template_noexp_d2i(val, &p, len, tt, 0, ctx);
562 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
565 /* We read the field in OK so update length */
568 /* If NDEF we must have an EOC here */
569 if (!asn1_check_eoc(&p, len)) {
570 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ASN1_R_MISSING_EOC);
575 * Otherwise we must hit the EXPLICIT tag end or its an error
578 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I,
579 ASN1_R_EXPLICIT_LENGTH_MISMATCH);
584 return asn1_template_noexp_d2i(val, in, inlen, tt, opt, ctx);
590 ASN1_template_free(val, tt);
594 static int asn1_template_noexp_d2i(ASN1_VALUE **val,
595 const unsigned char **in, long len,
596 const ASN1_TEMPLATE *tt, char opt,
601 const unsigned char *p, *q;
605 aclass = flags & ASN1_TFLG_TAG_CLASS;
610 if (flags & ASN1_TFLG_SK_MASK) {
611 /* SET OF, SEQUENCE OF */
614 /* First work out expected inner tag value */
615 if (flags & ASN1_TFLG_IMPTAG) {
619 skaclass = V_ASN1_UNIVERSAL;
620 if (flags & ASN1_TFLG_SET_OF)
623 sktag = V_ASN1_SEQUENCE;
626 ret = asn1_check_tlen(&len, NULL, NULL, &sk_eoc, NULL,
627 &p, len, sktag, skaclass, opt, ctx);
629 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_NESTED_ASN1_ERROR);
631 } else if (ret == -1)
634 *val = (ASN1_VALUE *)sk_new_null();
637 * We've got a valid STACK: free up any items present
639 STACK_OF(ASN1_VALUE) *sktmp = (STACK_OF(ASN1_VALUE) *)*val;
641 while (sk_ASN1_VALUE_num(sktmp) > 0) {
642 vtmp = sk_ASN1_VALUE_pop(sktmp);
643 ASN1_item_ex_free(&vtmp, ASN1_ITEM_ptr(tt->item));
648 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_MALLOC_FAILURE);
652 /* Read as many items as we can */
656 /* See if EOC found */
657 if (asn1_check_eoc(&p, len)) {
659 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I,
660 ASN1_R_UNEXPECTED_EOC);
668 if (!ASN1_item_ex_d2i(&skfield, &p, len,
669 ASN1_ITEM_ptr(tt->item), -1, 0, 0, ctx)) {
670 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I,
671 ERR_R_NESTED_ASN1_ERROR);
675 if (!sk_ASN1_VALUE_push((STACK_OF(ASN1_VALUE) *)*val, skfield)) {
676 ASN1_item_ex_free(&skfield, ASN1_ITEM_ptr(tt->item));
677 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_MALLOC_FAILURE);
682 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ASN1_R_MISSING_EOC);
685 } else if (flags & ASN1_TFLG_IMPTAG) {
686 /* IMPLICIT tagging */
687 ret = ASN1_item_ex_d2i(val, &p, len,
688 ASN1_ITEM_ptr(tt->item), tt->tag, aclass, opt,
691 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_NESTED_ASN1_ERROR);
693 } else if (ret == -1)
696 /* Nothing special */
697 ret = ASN1_item_ex_d2i(val, &p, len, ASN1_ITEM_ptr(tt->item),
698 -1, tt->flags & ASN1_TFLG_COMBINE, opt, ctx);
700 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_NESTED_ASN1_ERROR);
702 } else if (ret == -1)
710 ASN1_template_free(val, tt);
714 static int asn1_d2i_ex_primitive(ASN1_VALUE **pval,
715 const unsigned char **in, long inlen,
717 int tag, int aclass, char opt, ASN1_TLC *ctx)
721 char cst, inf, free_cont = 0;
722 const unsigned char *p;
723 BUF_MEM buf = { 0, NULL, 0 };
724 const unsigned char *cont = NULL;
727 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_ILLEGAL_NULL);
728 return 0; /* Should never happen */
731 if (it->itype == ASN1_ITYPE_MSTRING) {
737 if (utype == V_ASN1_ANY) {
738 /* If type is ANY need to figure out type from tag */
739 unsigned char oclass;
741 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_ILLEGAL_TAGGED_ANY);
745 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE,
746 ASN1_R_ILLEGAL_OPTIONAL_ANY);
750 ret = asn1_check_tlen(NULL, &utype, &oclass, NULL, NULL,
751 &p, inlen, -1, 0, 0, ctx);
753 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_NESTED_ASN1_ERROR);
756 if (oclass != V_ASN1_UNIVERSAL)
757 utype = V_ASN1_OTHER;
761 aclass = V_ASN1_UNIVERSAL;
765 ret = asn1_check_tlen(&plen, NULL, NULL, &inf, &cst,
766 &p, inlen, tag, aclass, opt, ctx);
768 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_NESTED_ASN1_ERROR);
770 } else if (ret == -1)
773 /* SEQUENCE, SET and "OTHER" are left in encoded form */
774 if ((utype == V_ASN1_SEQUENCE)
775 || (utype == V_ASN1_SET) || (utype == V_ASN1_OTHER)) {
777 * Clear context cache for type OTHER because the auto clear when we
778 * have a exact match wont work
780 if (utype == V_ASN1_OTHER) {
783 /* SEQUENCE and SET must be constructed */
785 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE,
786 ASN1_R_TYPE_NOT_CONSTRUCTED);
791 /* If indefinite length constructed find the real end */
793 if (!asn1_find_end(&p, plen, inf))
797 len = p - cont + plen;
801 if (utype == V_ASN1_NULL || utype == V_ASN1_BOOLEAN
802 || utype == V_ASN1_OBJECT || utype == V_ASN1_INTEGER
803 || utype == V_ASN1_ENUMERATED) {
804 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_TYPE_NOT_PRIMITIVE);
808 /* Free any returned 'buf' content */
811 * Should really check the internal tags are correct but some things
812 * may get this wrong. The relevant specs say that constructed string
813 * types should be OCTET STRINGs internally irrespective of the type.
814 * So instead just check for UNIVERSAL class and ignore the tag.
816 if (!asn1_collect(&buf, &p, plen, inf, -1, V_ASN1_UNIVERSAL, 0)) {
820 /* Append a final null to string */
821 if (!BUF_MEM_grow_clean(&buf, len + 1)) {
822 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_MALLOC_FAILURE);
826 cont = (const unsigned char *)buf.data;
833 /* We now have content length and type: translate into a structure */
834 /* asn1_ex_c2i may reuse allocated buffer, and so sets free_cont to 0 */
835 if (!asn1_ex_c2i(pval, cont, len, utype, &free_cont, it))
841 if (free_cont && buf.data)
842 OPENSSL_free(buf.data);
846 /* Translate ASN1 content octets into a structure */
848 int asn1_ex_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len,
849 int utype, char *free_cont, const ASN1_ITEM *it)
851 ASN1_VALUE **opval = NULL;
853 ASN1_TYPE *typ = NULL;
855 const ASN1_PRIMITIVE_FUNCS *pf;
859 if (pf && pf->prim_c2i)
860 return pf->prim_c2i(pval, cont, len, utype, free_cont, it);
861 /* If ANY type clear type and set pointer to internal value */
862 if (it->utype == V_ASN1_ANY) {
864 typ = ASN1_TYPE_new();
867 *pval = (ASN1_VALUE *)typ;
869 typ = (ASN1_TYPE *)*pval;
871 if (utype != typ->type)
872 ASN1_TYPE_set(typ, utype, NULL);
874 pval = &typ->value.asn1_value;
878 if (!c2i_ASN1_OBJECT((ASN1_OBJECT **)pval, &cont, len))
884 ASN1err(ASN1_F_ASN1_EX_C2I, ASN1_R_NULL_IS_WRONG_LENGTH);
887 *pval = (ASN1_VALUE *)1;
892 ASN1err(ASN1_F_ASN1_EX_C2I, ASN1_R_BOOLEAN_IS_WRONG_LENGTH);
896 tbool = (ASN1_BOOLEAN *)pval;
901 case V_ASN1_BIT_STRING:
902 if (!c2i_ASN1_BIT_STRING((ASN1_BIT_STRING **)pval, &cont, len))
907 case V_ASN1_ENUMERATED:
908 tint = (ASN1_INTEGER **)pval;
909 if (!c2i_ASN1_INTEGER(tint, &cont, len))
911 /* Fixup type to match the expected form */
912 (*tint)->type = utype | ((*tint)->type & V_ASN1_NEG);
915 case V_ASN1_OCTET_STRING:
916 case V_ASN1_NUMERICSTRING:
917 case V_ASN1_PRINTABLESTRING:
918 case V_ASN1_T61STRING:
919 case V_ASN1_VIDEOTEXSTRING:
920 case V_ASN1_IA5STRING:
922 case V_ASN1_GENERALIZEDTIME:
923 case V_ASN1_GRAPHICSTRING:
924 case V_ASN1_VISIBLESTRING:
925 case V_ASN1_GENERALSTRING:
926 case V_ASN1_UNIVERSALSTRING:
927 case V_ASN1_BMPSTRING:
928 case V_ASN1_UTF8STRING:
931 case V_ASN1_SEQUENCE:
933 if (utype == V_ASN1_BMPSTRING && (len & 1)) {
934 ASN1err(ASN1_F_ASN1_EX_C2I, ASN1_R_BMPSTRING_IS_WRONG_LENGTH);
937 if (utype == V_ASN1_UNIVERSALSTRING && (len & 3)) {
938 ASN1err(ASN1_F_ASN1_EX_C2I,
939 ASN1_R_UNIVERSALSTRING_IS_WRONG_LENGTH);
942 /* All based on ASN1_STRING and handled the same */
944 stmp = ASN1_STRING_type_new(utype);
946 ASN1err(ASN1_F_ASN1_EX_C2I, ERR_R_MALLOC_FAILURE);
949 *pval = (ASN1_VALUE *)stmp;
951 stmp = (ASN1_STRING *)*pval;
954 /* If we've already allocated a buffer use it */
957 OPENSSL_free(stmp->data);
958 stmp->data = (unsigned char *)cont; /* UGLY CAST! RL */
962 if (!ASN1_STRING_set(stmp, cont, len)) {
963 ASN1err(ASN1_F_ASN1_EX_C2I, ERR_R_MALLOC_FAILURE);
964 ASN1_STRING_free(stmp);
971 /* If ASN1_ANY and NULL type fix up value */
972 if (typ && (utype == V_ASN1_NULL))
973 typ->value.ptr = NULL;
986 * This function finds the end of an ASN1 structure when passed its maximum
987 * length, whether it is indefinite length and a pointer to the content. This
988 * is more efficient than calling asn1_collect because it does not recurse on
989 * each indefinite length header.
992 static int asn1_find_end(const unsigned char **in, long len, char inf)
996 const unsigned char *p = *in, *q;
997 /* If not indefinite length constructed just add length */
1004 * Indefinite length constructed form. Find the end when enough EOCs are
1005 * found. If more indefinite length constructed headers are encountered
1006 * increment the expected eoc count otherwise just skip to the end of the
1010 if (asn1_check_eoc(&p, len)) {
1012 if (expected_eoc == 0)
1018 /* Just read in a header: only care about the length */
1019 if (!asn1_check_tlen(&plen, NULL, NULL, &inf, NULL, &p, len,
1021 ASN1err(ASN1_F_ASN1_FIND_END, ERR_R_NESTED_ASN1_ERROR);
1031 ASN1err(ASN1_F_ASN1_FIND_END, ASN1_R_MISSING_EOC);
1039 * This function collects the asn1 data from a constructred string type into
1040 * a buffer. The values of 'in' and 'len' should refer to the contents of the
1041 * constructed type and 'inf' should be set if it is indefinite length.
1044 #ifndef ASN1_MAX_STRING_NEST
1046 * This determines how many levels of recursion are permitted in ASN1 string
1047 * types. If it is not limited stack overflows can occur. If set to zero no
1048 * recursion is allowed at all. Although zero should be adequate examples
1049 * exist that require a value of 1. So 5 should be more than enough.
1051 # define ASN1_MAX_STRING_NEST 5
1054 static int asn1_collect(BUF_MEM *buf, const unsigned char **in, long len,
1055 char inf, int tag, int aclass, int depth)
1057 const unsigned char *p, *q;
1063 * If no buffer and not indefinite length constructed just pass over the
1073 if (asn1_check_eoc(&p, len)) {
1075 * EOC is illegal outside indefinite length constructed form
1078 ASN1err(ASN1_F_ASN1_COLLECT, ASN1_R_UNEXPECTED_EOC);
1085 if (!asn1_check_tlen(&plen, NULL, NULL, &ininf, &cst, &p,
1086 len, tag, aclass, 0, NULL)) {
1087 ASN1err(ASN1_F_ASN1_COLLECT, ERR_R_NESTED_ASN1_ERROR);
1091 /* If indefinite length constructed update max length */
1093 if (depth >= ASN1_MAX_STRING_NEST) {
1094 ASN1err(ASN1_F_ASN1_COLLECT, ASN1_R_NESTED_ASN1_STRING);
1097 if (!asn1_collect(buf, &p, plen, ininf, tag, aclass, depth + 1))
1099 } else if (plen && !collect_data(buf, &p, plen))
1104 ASN1err(ASN1_F_ASN1_COLLECT, ASN1_R_MISSING_EOC);
1111 static int collect_data(BUF_MEM *buf, const unsigned char **p, long plen)
1116 if (!BUF_MEM_grow_clean(buf, len + plen)) {
1117 ASN1err(ASN1_F_COLLECT_DATA, ERR_R_MALLOC_FAILURE);
1120 memcpy(buf->data + len, *p, plen);
1126 /* Check for ASN1 EOC and swallow it if found */
1128 static int asn1_check_eoc(const unsigned char **in, long len)
1130 const unsigned char *p;
1134 if (!p[0] && !p[1]) {
1142 * Check an ASN1 tag and length: a bit like ASN1_get_object but it sets the
1143 * length for indefinite length constructed form, we don't know the exact
1144 * length but we can set an upper bound to the amount of data available minus
1145 * the header length just read.
1148 static int asn1_check_tlen(long *olen, int *otag, unsigned char *oclass,
1149 char *inf, char *cst,
1150 const unsigned char **in, long len,
1151 int exptag, int expclass, char opt, ASN1_TLC *ctx)
1156 const unsigned char *p, *q;
1160 if (ctx && ctx->valid) {
1163 pclass = ctx->pclass;
1167 i = ASN1_get_object(&p, &plen, &ptag, &pclass, len);
1171 ctx->pclass = pclass;
1173 ctx->hdrlen = p - q;
1176 * If definite length, and no error, length + header can't exceed
1177 * total amount of data available.
1179 if (!(i & 0x81) && ((plen + ctx->hdrlen) > len)) {
1180 ASN1err(ASN1_F_ASN1_CHECK_TLEN, ASN1_R_TOO_LONG);
1181 asn1_tlc_clear(ctx);
1188 ASN1err(ASN1_F_ASN1_CHECK_TLEN, ASN1_R_BAD_OBJECT_HEADER);
1189 asn1_tlc_clear(ctx);
1193 if ((exptag != ptag) || (expclass != pclass)) {
1195 * If type is OPTIONAL, not an error: indicate missing type.
1199 asn1_tlc_clear(ctx);
1200 ASN1err(ASN1_F_ASN1_CHECK_TLEN, ASN1_R_WRONG_TAG);
1204 * We have a tag and class match: assume we are going to do something
1207 asn1_tlc_clear(ctx);
1211 plen = len - (p - q);
1217 *cst = i & V_ASN1_CONSTRUCTED;