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>
67 #include "asn1_locl.h"
69 static int asn1_check_eoc(const unsigned char **in, long len);
70 static int asn1_find_end(const unsigned char **in, long len, char inf);
72 static int asn1_collect(BUF_MEM *buf, const unsigned char **in, long len,
73 char inf, int tag, int aclass, int depth);
75 static int collect_data(BUF_MEM *buf, const unsigned char **p, long plen);
77 static int asn1_check_tlen(long *olen, int *otag, unsigned char *oclass,
79 const unsigned char **in, long len,
80 int exptag, int expclass, char opt, ASN1_TLC *ctx);
82 static int asn1_template_ex_d2i(ASN1_VALUE **pval,
83 const unsigned char **in, long len,
84 const ASN1_TEMPLATE *tt, char opt,
86 static int asn1_template_noexp_d2i(ASN1_VALUE **val,
87 const unsigned char **in, long len,
88 const ASN1_TEMPLATE *tt, char opt,
90 static int asn1_d2i_ex_primitive(ASN1_VALUE **pval,
91 const unsigned char **in, long len,
93 int tag, int aclass, char opt,
96 /* Table to convert tags to bit values, used for MSTRING type */
97 static const unsigned long tag2bit[32] = {
99 0, 0, 0, B_ASN1_BIT_STRING,
101 B_ASN1_OCTET_STRING, 0, 0, B_ASN1_UNKNOWN,
103 B_ASN1_UNKNOWN, B_ASN1_UNKNOWN, B_ASN1_UNKNOWN, B_ASN1_UNKNOWN,
105 B_ASN1_UTF8STRING, B_ASN1_UNKNOWN, B_ASN1_UNKNOWN, B_ASN1_UNKNOWN,
107 B_ASN1_SEQUENCE, 0, B_ASN1_NUMERICSTRING, B_ASN1_PRINTABLESTRING,
109 B_ASN1_T61STRING, B_ASN1_VIDEOTEXSTRING, B_ASN1_IA5STRING,
111 B_ASN1_UTCTIME, B_ASN1_GENERALIZEDTIME,
113 B_ASN1_GRAPHICSTRING, B_ASN1_ISO64STRING, B_ASN1_GENERALSTRING,
115 B_ASN1_UNIVERSALSTRING, B_ASN1_UNKNOWN, B_ASN1_BMPSTRING, B_ASN1_UNKNOWN,
118 unsigned long ASN1_tag2bit(int tag)
120 if ((tag < 0) || (tag > 30))
125 /* Macro to initialize and invalidate the cache */
127 #define asn1_tlc_clear(c) if (c) (c)->valid = 0
128 /* Version to avoid compiler warning about 'c' always non-NULL */
129 #define asn1_tlc_clear_nc(c) (c)->valid = 0
132 * Decode an ASN1 item, this currently behaves just like a standard 'd2i'
133 * function. 'in' points to a buffer to read the data from, in future we
134 * will have more advanced versions that can input data a piece at a time and
135 * this will simply be a special case.
138 ASN1_VALUE *ASN1_item_d2i(ASN1_VALUE **pval,
139 const unsigned char **in, long len,
143 ASN1_VALUE *ptmpval = NULL;
146 asn1_tlc_clear_nc(&c);
147 if (ASN1_item_ex_d2i(pval, in, len, it, -1, 0, 0, &c) > 0)
153 * Decode an item, taking care of IMPLICIT tagging, if any. If 'opt' set and
154 * tag mismatch return -1 to handle OPTIONAL
157 int ASN1_item_ex_d2i(ASN1_VALUE **pval, const unsigned char **in, long len,
159 int tag, int aclass, char opt, ASN1_TLC *ctx)
161 const ASN1_TEMPLATE *tt, *errtt = NULL;
162 const ASN1_EXTERN_FUNCS *ef;
163 const ASN1_AUX *aux = it->funcs;
164 ASN1_aux_cb *asn1_cb;
165 const unsigned char *p = NULL, *q;
166 unsigned char oclass;
167 char seq_eoc, seq_nolen, cst, isopt;
175 if (aux && aux->asn1_cb)
176 asn1_cb = aux->asn1_cb;
181 case ASN1_ITYPE_PRIMITIVE:
184 * tagging or OPTIONAL is currently illegal on an item template
185 * because the flags can't get passed down. In practice this
186 * isn't a problem: we include the relevant flags from the item
187 * template in the template itself.
189 if ((tag != -1) || opt) {
190 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I,
191 ASN1_R_ILLEGAL_OPTIONS_ON_ITEM_TEMPLATE);
194 return asn1_template_ex_d2i(pval, in, len,
195 it->templates, opt, ctx);
197 return asn1_d2i_ex_primitive(pval, in, len, it,
198 tag, aclass, opt, ctx);
200 case ASN1_ITYPE_MSTRING:
202 /* Just read in tag and class */
203 ret = asn1_check_tlen(NULL, &otag, &oclass, NULL, NULL,
204 &p, len, -1, 0, 1, ctx);
206 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
210 /* Must be UNIVERSAL class */
211 if (oclass != V_ASN1_UNIVERSAL) {
212 /* If OPTIONAL, assume this is OK */
215 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_MSTRING_NOT_UNIVERSAL);
218 /* Check tag matches bit map */
219 if (!(ASN1_tag2bit(otag) & it->utype)) {
220 /* If OPTIONAL, assume this is OK */
223 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_MSTRING_WRONG_TAG);
226 return asn1_d2i_ex_primitive(pval, in, len, it, otag, 0, 0, ctx);
228 case ASN1_ITYPE_EXTERN:
229 /* Use new style d2i */
231 return ef->asn1_ex_d2i(pval, in, len, it, tag, aclass, opt, ctx);
233 case ASN1_ITYPE_CHOICE:
234 if (asn1_cb && !asn1_cb(ASN1_OP_D2I_PRE, pval, it, NULL))
237 /* Free up and zero CHOICE value if initialised */
238 i = asn1_get_choice_selector(pval, it);
239 if ((i >= 0) && (i < it->tcount)) {
240 tt = it->templates + i;
241 pchptr = asn1_get_field_ptr(pval, tt);
242 asn1_template_free(pchptr, tt);
243 asn1_set_choice_selector(pval, -1, it);
245 } else if (!ASN1_item_ex_new(pval, it)) {
246 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
249 /* CHOICE type, try each possibility in turn */
251 for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) {
252 pchptr = asn1_get_field_ptr(pval, tt);
254 * We mark field as OPTIONAL so its absence can be recognised.
256 ret = asn1_template_ex_d2i(pchptr, &p, len, tt, 1, ctx);
257 /* If field not present, try the next one */
260 /* If positive return, read OK, break loop */
263 /* Otherwise must be an ASN1 parsing error */
265 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
269 /* Did we fall off the end without reading anything? */
270 if (i == it->tcount) {
271 /* If OPTIONAL, this is OK */
273 /* Free and zero it */
274 ASN1_item_ex_free(pval, it);
277 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_NO_MATCHING_CHOICE_TYPE);
281 asn1_set_choice_selector(pval, i, it);
283 if (asn1_cb && !asn1_cb(ASN1_OP_D2I_POST, pval, it, NULL))
287 case ASN1_ITYPE_NDEF_SEQUENCE:
288 case ASN1_ITYPE_SEQUENCE:
292 /* If no IMPLICIT tagging set to SEQUENCE, UNIVERSAL */
294 tag = V_ASN1_SEQUENCE;
295 aclass = V_ASN1_UNIVERSAL;
297 /* Get SEQUENCE length and update len, p */
298 ret = asn1_check_tlen(&len, NULL, NULL, &seq_eoc, &cst,
299 &p, len, tag, aclass, opt, ctx);
301 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
303 } else if (ret == -1)
305 if (aux && (aux->flags & ASN1_AFLG_BROKEN)) {
306 len = tmplen - (p - *in);
309 /* If indefinite we don't do a length check */
313 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_SEQUENCE_NOT_CONSTRUCTED);
317 if (!*pval && !ASN1_item_ex_new(pval, it)) {
318 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
322 if (asn1_cb && !asn1_cb(ASN1_OP_D2I_PRE, pval, it, NULL))
325 /* Free up and zero any ADB found */
326 for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) {
327 if (tt->flags & ASN1_TFLG_ADB_MASK) {
328 const ASN1_TEMPLATE *seqtt;
329 ASN1_VALUE **pseqval;
330 seqtt = asn1_do_adb(pval, tt, 1);
331 pseqval = asn1_get_field_ptr(pval, seqtt);
332 asn1_template_free(pseqval, seqtt);
336 /* Get each field entry */
337 for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) {
338 const ASN1_TEMPLATE *seqtt;
339 ASN1_VALUE **pseqval;
340 seqtt = asn1_do_adb(pval, tt, 1);
343 pseqval = asn1_get_field_ptr(pval, seqtt);
344 /* Have we ran out of data? */
348 if (asn1_check_eoc(&p, len)) {
350 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_UNEXPECTED_EOC);
359 * This determines the OPTIONAL flag value. The field cannot be
360 * omitted if it is the last of a SEQUENCE and there is still
361 * data to be read. This isn't strictly necessary but it
362 * increases efficiency in some cases.
364 if (i == (it->tcount - 1))
367 isopt = (char)(seqtt->flags & ASN1_TFLG_OPTIONAL);
369 * attempt to read in field, allowing each to be OPTIONAL
372 ret = asn1_template_ex_d2i(pseqval, &p, len, seqtt, isopt, ctx);
376 } else if (ret == -1) {
378 * OPTIONAL component absent. Free and zero the field.
380 asn1_template_free(pseqval, seqtt);
387 /* Check for EOC if expecting one */
388 if (seq_eoc && !asn1_check_eoc(&p, len)) {
389 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_MISSING_EOC);
392 /* Check all data read */
393 if (!seq_nolen && len) {
394 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_SEQUENCE_LENGTH_MISMATCH);
399 * If we get here we've got no more data in the SEQUENCE, however we
400 * may not have read all fields so check all remaining are OPTIONAL
401 * and clear any that are.
403 for (; i < it->tcount; tt++, i++) {
404 const ASN1_TEMPLATE *seqtt;
405 seqtt = asn1_do_adb(pval, tt, 1);
408 if (seqtt->flags & ASN1_TFLG_OPTIONAL) {
409 ASN1_VALUE **pseqval;
410 pseqval = asn1_get_field_ptr(pval, seqtt);
411 asn1_template_free(pseqval, seqtt);
414 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_FIELD_MISSING);
419 if (!asn1_enc_save(pval, *in, p - *in, it))
422 if (asn1_cb && !asn1_cb(ASN1_OP_D2I_POST, pval, it, NULL))
430 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_AUX_ERROR);
432 ASN1_item_ex_free(pval, it);
434 ERR_add_error_data(4, "Field=", errtt->field_name,
435 ", Type=", it->sname);
437 ERR_add_error_data(2, "Type=", it->sname);
442 * Templates are handled with two separate functions. One handles any
443 * EXPLICIT tag and the other handles the rest.
446 static int asn1_template_ex_d2i(ASN1_VALUE **val,
447 const unsigned char **in, long inlen,
448 const ASN1_TEMPLATE *tt, char opt,
454 const unsigned char *p, *q;
459 aclass = flags & ASN1_TFLG_TAG_CLASS;
463 /* Check if EXPLICIT tag expected */
464 if (flags & ASN1_TFLG_EXPTAG) {
467 * Need to work out amount of data available to the inner content and
468 * where it starts: so read in EXPLICIT header to get the info.
470 ret = asn1_check_tlen(&len, NULL, NULL, &exp_eoc, &cst,
471 &p, inlen, tt->tag, aclass, opt, ctx);
474 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
476 } else if (ret == -1)
479 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I,
480 ASN1_R_EXPLICIT_TAG_NOT_CONSTRUCTED);
483 /* We've found the field so it can't be OPTIONAL now */
484 ret = asn1_template_noexp_d2i(val, &p, len, tt, 0, ctx);
486 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
489 /* We read the field in OK so update length */
492 /* If NDEF we must have an EOC here */
493 if (!asn1_check_eoc(&p, len)) {
494 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ASN1_R_MISSING_EOC);
499 * Otherwise we must hit the EXPLICIT tag end or its an error
502 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I,
503 ASN1_R_EXPLICIT_LENGTH_MISMATCH);
508 return asn1_template_noexp_d2i(val, in, inlen, tt, opt, ctx);
514 asn1_template_free(val, tt);
518 static int asn1_template_noexp_d2i(ASN1_VALUE **val,
519 const unsigned char **in, long len,
520 const ASN1_TEMPLATE *tt, char opt,
525 const unsigned char *p, *q;
529 aclass = flags & ASN1_TFLG_TAG_CLASS;
534 if (flags & ASN1_TFLG_SK_MASK) {
535 /* SET OF, SEQUENCE OF */
538 /* First work out expected inner tag value */
539 if (flags & ASN1_TFLG_IMPTAG) {
543 skaclass = V_ASN1_UNIVERSAL;
544 if (flags & ASN1_TFLG_SET_OF)
547 sktag = V_ASN1_SEQUENCE;
550 ret = asn1_check_tlen(&len, NULL, NULL, &sk_eoc, NULL,
551 &p, len, sktag, skaclass, opt, ctx);
553 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_NESTED_ASN1_ERROR);
555 } else if (ret == -1)
558 *val = (ASN1_VALUE *)sk_new_null();
561 * We've got a valid STACK: free up any items present
563 STACK_OF(ASN1_VALUE) *sktmp = (STACK_OF(ASN1_VALUE) *)*val;
565 while (sk_ASN1_VALUE_num(sktmp) > 0) {
566 vtmp = sk_ASN1_VALUE_pop(sktmp);
567 ASN1_item_ex_free(&vtmp, ASN1_ITEM_ptr(tt->item));
572 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_MALLOC_FAILURE);
576 /* Read as many items as we can */
580 /* See if EOC found */
581 if (asn1_check_eoc(&p, len)) {
583 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I,
584 ASN1_R_UNEXPECTED_EOC);
592 if (!ASN1_item_ex_d2i(&skfield, &p, len,
593 ASN1_ITEM_ptr(tt->item), -1, 0, 0, ctx)) {
594 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I,
595 ERR_R_NESTED_ASN1_ERROR);
599 if (!sk_ASN1_VALUE_push((STACK_OF(ASN1_VALUE) *)*val, skfield)) {
600 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_MALLOC_FAILURE);
605 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ASN1_R_MISSING_EOC);
608 } else if (flags & ASN1_TFLG_IMPTAG) {
609 /* IMPLICIT tagging */
610 ret = ASN1_item_ex_d2i(val, &p, len,
611 ASN1_ITEM_ptr(tt->item), tt->tag, aclass, opt,
614 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_NESTED_ASN1_ERROR);
616 } else if (ret == -1)
619 /* Nothing special */
620 ret = ASN1_item_ex_d2i(val, &p, len, ASN1_ITEM_ptr(tt->item),
623 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_NESTED_ASN1_ERROR);
625 } else if (ret == -1)
633 asn1_template_free(val, tt);
637 static int asn1_d2i_ex_primitive(ASN1_VALUE **pval,
638 const unsigned char **in, long inlen,
640 int tag, int aclass, char opt, ASN1_TLC *ctx)
644 char cst, inf, free_cont = 0;
645 const unsigned char *p;
647 const unsigned char *cont = NULL;
650 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_ILLEGAL_NULL);
651 return 0; /* Should never happen */
654 if (it->itype == ASN1_ITYPE_MSTRING) {
660 if (utype == V_ASN1_ANY) {
661 /* If type is ANY need to figure out type from tag */
662 unsigned char oclass;
664 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_ILLEGAL_TAGGED_ANY);
668 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE,
669 ASN1_R_ILLEGAL_OPTIONAL_ANY);
673 ret = asn1_check_tlen(NULL, &utype, &oclass, NULL, NULL,
674 &p, inlen, -1, 0, 0, ctx);
676 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_NESTED_ASN1_ERROR);
679 if (oclass != V_ASN1_UNIVERSAL)
680 utype = V_ASN1_OTHER;
684 aclass = V_ASN1_UNIVERSAL;
688 ret = asn1_check_tlen(&plen, NULL, NULL, &inf, &cst,
689 &p, inlen, tag, aclass, opt, ctx);
691 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_NESTED_ASN1_ERROR);
693 } else if (ret == -1)
696 /* SEQUENCE, SET and "OTHER" are left in encoded form */
697 if ((utype == V_ASN1_SEQUENCE)
698 || (utype == V_ASN1_SET) || (utype == V_ASN1_OTHER)) {
700 * Clear context cache for type OTHER because the auto clear when we
701 * have a exact match wont work
703 if (utype == V_ASN1_OTHER) {
706 /* SEQUENCE and SET must be constructed */
708 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE,
709 ASN1_R_TYPE_NOT_CONSTRUCTED);
714 /* If indefinite length constructed find the real end */
716 if (!asn1_find_end(&p, plen, inf))
720 len = p - cont + plen;
725 if (utype == V_ASN1_NULL || utype == V_ASN1_BOOLEAN
726 || utype == V_ASN1_OBJECT || utype == V_ASN1_INTEGER
727 || utype == V_ASN1_ENUMERATED) {
728 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_TYPE_NOT_PRIMITIVE);
735 * Should really check the internal tags are correct but some things
736 * may get this wrong. The relevant specs say that constructed string
737 * types should be OCTET STRINGs internally irrespective of the type.
738 * So instead just check for UNIVERSAL class and ignore the tag.
740 if (!asn1_collect(&buf, &p, plen, inf, -1, V_ASN1_UNIVERSAL, 0)) {
745 /* Append a final null to string */
746 if (!BUF_MEM_grow_clean(&buf, len + 1)) {
747 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_MALLOC_FAILURE);
751 cont = (const unsigned char *)buf.data;
759 /* We now have content length and type: translate into a structure */
760 if (!asn1_ex_c2i(pval, cont, len, utype, &free_cont, it))
766 if (free_cont && buf.data)
767 OPENSSL_free(buf.data);
771 /* Translate ASN1 content octets into a structure */
773 int asn1_ex_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len,
774 int utype, char *free_cont, const ASN1_ITEM *it)
776 ASN1_VALUE **opval = NULL;
778 ASN1_TYPE *typ = NULL;
780 const ASN1_PRIMITIVE_FUNCS *pf;
784 if (pf && pf->prim_c2i)
785 return pf->prim_c2i(pval, cont, len, utype, free_cont, it);
786 /* If ANY type clear type and set pointer to internal value */
787 if (it->utype == V_ASN1_ANY) {
789 typ = ASN1_TYPE_new();
792 *pval = (ASN1_VALUE *)typ;
794 typ = (ASN1_TYPE *)*pval;
796 if (utype != typ->type)
797 ASN1_TYPE_set(typ, utype, NULL);
799 pval = &typ->value.asn1_value;
803 if (!c2i_ASN1_OBJECT((ASN1_OBJECT **)pval, &cont, len))
809 ASN1err(ASN1_F_ASN1_EX_C2I, ASN1_R_NULL_IS_WRONG_LENGTH);
812 *pval = (ASN1_VALUE *)1;
817 ASN1err(ASN1_F_ASN1_EX_C2I, ASN1_R_BOOLEAN_IS_WRONG_LENGTH);
821 tbool = (ASN1_BOOLEAN *)pval;
826 case V_ASN1_BIT_STRING:
827 if (!c2i_ASN1_BIT_STRING((ASN1_BIT_STRING **)pval, &cont, len))
832 case V_ASN1_NEG_INTEGER:
833 case V_ASN1_ENUMERATED:
834 case V_ASN1_NEG_ENUMERATED:
835 tint = (ASN1_INTEGER **)pval;
836 if (!c2i_ASN1_INTEGER(tint, &cont, len))
838 /* Fixup type to match the expected form */
839 (*tint)->type = utype | ((*tint)->type & V_ASN1_NEG);
842 case V_ASN1_OCTET_STRING:
843 case V_ASN1_NUMERICSTRING:
844 case V_ASN1_PRINTABLESTRING:
845 case V_ASN1_T61STRING:
846 case V_ASN1_VIDEOTEXSTRING:
847 case V_ASN1_IA5STRING:
849 case V_ASN1_GENERALIZEDTIME:
850 case V_ASN1_GRAPHICSTRING:
851 case V_ASN1_VISIBLESTRING:
852 case V_ASN1_GENERALSTRING:
853 case V_ASN1_UNIVERSALSTRING:
854 case V_ASN1_BMPSTRING:
855 case V_ASN1_UTF8STRING:
858 case V_ASN1_SEQUENCE:
860 if (utype == V_ASN1_BMPSTRING && (len & 1)) {
861 ASN1err(ASN1_F_ASN1_EX_C2I, ASN1_R_BMPSTRING_IS_WRONG_LENGTH);
864 if (utype == V_ASN1_UNIVERSALSTRING && (len & 3)) {
865 ASN1err(ASN1_F_ASN1_EX_C2I,
866 ASN1_R_UNIVERSALSTRING_IS_WRONG_LENGTH);
869 /* All based on ASN1_STRING and handled the same */
871 stmp = ASN1_STRING_type_new(utype);
873 ASN1err(ASN1_F_ASN1_EX_C2I, ERR_R_MALLOC_FAILURE);
876 *pval = (ASN1_VALUE *)stmp;
878 stmp = (ASN1_STRING *)*pval;
881 /* If we've already allocated a buffer use it */
884 OPENSSL_free(stmp->data);
885 stmp->data = (unsigned char *)cont; /* UGLY CAST! RL */
889 if (!ASN1_STRING_set(stmp, cont, len)) {
890 ASN1err(ASN1_F_ASN1_EX_C2I, ERR_R_MALLOC_FAILURE);
891 ASN1_STRING_free(stmp);
898 /* If ASN1_ANY and NULL type fix up value */
899 if (typ && (utype == V_ASN1_NULL))
900 typ->value.ptr = NULL;
913 * This function finds the end of an ASN1 structure when passed its maximum
914 * length, whether it is indefinite length and a pointer to the content. This
915 * is more efficient than calling asn1_collect because it does not recurse on
916 * each indefinite length header.
919 static int asn1_find_end(const unsigned char **in, long len, char inf)
923 const unsigned char *p = *in, *q;
924 /* If not indefinite length constructed just add length */
931 * Indefinite length constructed form. Find the end when enough EOCs are
932 * found. If more indefinite length constructed headers are encountered
933 * increment the expected eoc count otherwise just skip to the end of the
937 if (asn1_check_eoc(&p, len)) {
939 if (expected_eoc == 0)
945 /* Just read in a header: only care about the length */
946 if (!asn1_check_tlen(&plen, NULL, NULL, &inf, NULL, &p, len,
948 ASN1err(ASN1_F_ASN1_FIND_END, ERR_R_NESTED_ASN1_ERROR);
958 ASN1err(ASN1_F_ASN1_FIND_END, ASN1_R_MISSING_EOC);
966 * This function collects the asn1 data from a constructred string type into
967 * a buffer. The values of 'in' and 'len' should refer to the contents of the
968 * constructed type and 'inf' should be set if it is indefinite length.
971 #ifndef ASN1_MAX_STRING_NEST
973 * This determines how many levels of recursion are permitted in ASN1 string
974 * types. If it is not limited stack overflows can occur. If set to zero no
975 * recursion is allowed at all. Although zero should be adequate examples
976 * exist that require a value of 1. So 5 should be more than enough.
978 # define ASN1_MAX_STRING_NEST 5
981 static int asn1_collect(BUF_MEM *buf, const unsigned char **in, long len,
982 char inf, int tag, int aclass, int depth)
984 const unsigned char *p, *q;
990 * If no buffer and not indefinite length constructed just pass over the
1000 if (asn1_check_eoc(&p, len)) {
1002 * EOC is illegal outside indefinite length constructed form
1005 ASN1err(ASN1_F_ASN1_COLLECT, ASN1_R_UNEXPECTED_EOC);
1012 if (!asn1_check_tlen(&plen, NULL, NULL, &ininf, &cst, &p,
1013 len, tag, aclass, 0, NULL)) {
1014 ASN1err(ASN1_F_ASN1_COLLECT, ERR_R_NESTED_ASN1_ERROR);
1018 /* If indefinite length constructed update max length */
1020 if (depth >= ASN1_MAX_STRING_NEST) {
1021 ASN1err(ASN1_F_ASN1_COLLECT, ASN1_R_NESTED_ASN1_STRING);
1024 if (!asn1_collect(buf, &p, plen, ininf, tag, aclass, depth + 1))
1026 } else if (plen && !collect_data(buf, &p, plen))
1031 ASN1err(ASN1_F_ASN1_COLLECT, ASN1_R_MISSING_EOC);
1038 static int collect_data(BUF_MEM *buf, const unsigned char **p, long plen)
1043 if (!BUF_MEM_grow_clean(buf, len + plen)) {
1044 ASN1err(ASN1_F_COLLECT_DATA, ERR_R_MALLOC_FAILURE);
1047 memcpy(buf->data + len, *p, plen);
1053 /* Check for ASN1 EOC and swallow it if found */
1055 static int asn1_check_eoc(const unsigned char **in, long len)
1057 const unsigned char *p;
1061 if (!p[0] && !p[1]) {
1069 * Check an ASN1 tag and length: a bit like ASN1_get_object but it sets the
1070 * length for indefinite length constructed form, we don't know the exact
1071 * length but we can set an upper bound to the amount of data available minus
1072 * the header length just read.
1075 static int asn1_check_tlen(long *olen, int *otag, unsigned char *oclass,
1076 char *inf, char *cst,
1077 const unsigned char **in, long len,
1078 int exptag, int expclass, char opt, ASN1_TLC *ctx)
1083 const unsigned char *p, *q;
1087 if (ctx && ctx->valid) {
1090 pclass = ctx->pclass;
1094 i = ASN1_get_object(&p, &plen, &ptag, &pclass, len);
1098 ctx->pclass = pclass;
1100 ctx->hdrlen = p - q;
1103 * If definite length, and no error, length + header can't exceed
1104 * total amount of data available.
1106 if (!(i & 0x81) && ((plen + ctx->hdrlen) > len)) {
1107 ASN1err(ASN1_F_ASN1_CHECK_TLEN, ASN1_R_TOO_LONG);
1108 asn1_tlc_clear(ctx);
1115 ASN1err(ASN1_F_ASN1_CHECK_TLEN, ASN1_R_BAD_OBJECT_HEADER);
1116 asn1_tlc_clear(ctx);
1120 if ((exptag != ptag) || (expclass != pclass)) {
1122 * If type is OPTIONAL, not an error: indicate missing type.
1126 asn1_tlc_clear(ctx);
1127 ASN1err(ASN1_F_ASN1_CHECK_TLEN, ASN1_R_WRONG_TAG);
1131 * We have a tag and class match: assume we are going to do something
1134 asn1_tlc_clear(ctx);
1138 plen = len - (p - q);
1144 *cst = i & V_ASN1_CONSTRUCTED;