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_EXTERN_FUNCS *ef;
171 const ASN1_AUX *aux = it->funcs;
172 ASN1_aux_cb *asn1_cb;
173 const unsigned char *p = NULL, *q;
174 unsigned char oclass;
175 char seq_eoc, seq_nolen, cst, isopt;
183 if (aux && aux->asn1_cb)
184 asn1_cb = aux->asn1_cb;
189 case ASN1_ITYPE_PRIMITIVE:
192 * tagging or OPTIONAL is currently illegal on an item template
193 * because the flags can't get passed down. In practice this
194 * isn't a problem: we include the relevant flags from the item
195 * template in the template itself.
197 if ((tag != -1) || opt) {
198 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I,
199 ASN1_R_ILLEGAL_OPTIONS_ON_ITEM_TEMPLATE);
202 return asn1_template_ex_d2i(pval, in, len,
203 it->templates, opt, ctx);
205 return asn1_d2i_ex_primitive(pval, in, len, it,
206 tag, aclass, opt, ctx);
208 case ASN1_ITYPE_MSTRING:
210 /* Just read in tag and class */
211 ret = asn1_check_tlen(NULL, &otag, &oclass, NULL, NULL,
212 &p, len, -1, 0, 1, ctx);
214 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
218 /* Must be UNIVERSAL class */
219 if (oclass != V_ASN1_UNIVERSAL) {
220 /* If OPTIONAL, assume this is OK */
223 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_MSTRING_NOT_UNIVERSAL);
226 /* Check tag matches bit map */
227 if (!(ASN1_tag2bit(otag) & it->utype)) {
228 /* If OPTIONAL, assume this is OK */
231 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_MSTRING_WRONG_TAG);
234 return asn1_d2i_ex_primitive(pval, in, len, it, otag, 0, 0, ctx);
236 case ASN1_ITYPE_EXTERN:
237 /* Use new style d2i */
239 return ef->asn1_ex_d2i(pval, in, len, it, tag, aclass, opt, ctx);
241 case ASN1_ITYPE_CHOICE:
242 if (asn1_cb && !asn1_cb(ASN1_OP_D2I_PRE, pval, it, NULL))
245 /* Free up and zero CHOICE value if initialised */
246 i = asn1_get_choice_selector(pval, it);
247 if ((i >= 0) && (i < it->tcount)) {
248 tt = it->templates + i;
249 pchptr = asn1_get_field_ptr(pval, tt);
250 ASN1_template_free(pchptr, tt);
251 asn1_set_choice_selector(pval, -1, it);
253 } else if (!ASN1_item_ex_new(pval, it)) {
254 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
257 /* CHOICE type, try each possibility in turn */
259 for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) {
260 pchptr = asn1_get_field_ptr(pval, tt);
262 * We mark field as OPTIONAL so its absence can be recognised.
264 ret = asn1_template_ex_d2i(pchptr, &p, len, tt, 1, ctx);
265 /* If field not present, try the next one */
268 /* If positive return, read OK, break loop */
271 /* Otherwise must be an ASN1 parsing error */
273 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
277 /* Did we fall off the end without reading anything? */
278 if (i == it->tcount) {
279 /* If OPTIONAL, this is OK */
281 /* Free and zero it */
282 ASN1_item_ex_free(pval, it);
285 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_NO_MATCHING_CHOICE_TYPE);
289 asn1_set_choice_selector(pval, i, it);
291 if (asn1_cb && !asn1_cb(ASN1_OP_D2I_POST, pval, it, NULL))
295 case ASN1_ITYPE_NDEF_SEQUENCE:
296 case ASN1_ITYPE_SEQUENCE:
300 /* If no IMPLICIT tagging set to SEQUENCE, UNIVERSAL */
302 tag = V_ASN1_SEQUENCE;
303 aclass = V_ASN1_UNIVERSAL;
305 /* Get SEQUENCE length and update len, p */
306 ret = asn1_check_tlen(&len, NULL, NULL, &seq_eoc, &cst,
307 &p, len, tag, aclass, opt, ctx);
309 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
311 } else if (ret == -1)
313 if (aux && (aux->flags & ASN1_AFLG_BROKEN)) {
314 len = tmplen - (p - *in);
317 /* If indefinite we don't do a length check */
321 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_SEQUENCE_NOT_CONSTRUCTED);
325 if (!*pval && !ASN1_item_ex_new(pval, it)) {
326 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
330 if (asn1_cb && !asn1_cb(ASN1_OP_D2I_PRE, pval, it, NULL))
333 /* Free up and zero any ADB found */
334 for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) {
335 if (tt->flags & ASN1_TFLG_ADB_MASK) {
336 const ASN1_TEMPLATE *seqtt;
337 ASN1_VALUE **pseqval;
338 seqtt = asn1_do_adb(pval, tt, 1);
339 pseqval = asn1_get_field_ptr(pval, seqtt);
340 ASN1_template_free(pseqval, seqtt);
344 /* Get each field entry */
345 for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) {
346 const ASN1_TEMPLATE *seqtt;
347 ASN1_VALUE **pseqval;
348 seqtt = asn1_do_adb(pval, tt, 1);
351 pseqval = asn1_get_field_ptr(pval, seqtt);
352 /* Have we ran out of data? */
356 if (asn1_check_eoc(&p, len)) {
358 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_UNEXPECTED_EOC);
367 * This determines the OPTIONAL flag value. The field cannot be
368 * omitted if it is the last of a SEQUENCE and there is still
369 * data to be read. This isn't strictly necessary but it
370 * increases efficiency in some cases.
372 if (i == (it->tcount - 1))
375 isopt = (char)(seqtt->flags & ASN1_TFLG_OPTIONAL);
377 * attempt to read in field, allowing each to be OPTIONAL
380 ret = asn1_template_ex_d2i(pseqval, &p, len, seqtt, isopt, ctx);
384 } else if (ret == -1) {
386 * OPTIONAL component absent. Free and zero the field.
388 ASN1_template_free(pseqval, seqtt);
395 /* Check for EOC if expecting one */
396 if (seq_eoc && !asn1_check_eoc(&p, len)) {
397 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_MISSING_EOC);
400 /* Check all data read */
401 if (!seq_nolen && len) {
402 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_SEQUENCE_LENGTH_MISMATCH);
407 * If we get here we've got no more data in the SEQUENCE, however we
408 * may not have read all fields so check all remaining are OPTIONAL
409 * and clear any that are.
411 for (; i < it->tcount; tt++, i++) {
412 const ASN1_TEMPLATE *seqtt;
413 seqtt = asn1_do_adb(pval, tt, 1);
416 if (seqtt->flags & ASN1_TFLG_OPTIONAL) {
417 ASN1_VALUE **pseqval;
418 pseqval = asn1_get_field_ptr(pval, seqtt);
419 ASN1_template_free(pseqval, seqtt);
422 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_FIELD_MISSING);
427 if (!asn1_enc_save(pval, *in, p - *in, it))
430 if (asn1_cb && !asn1_cb(ASN1_OP_D2I_POST, pval, it, NULL))
438 ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_AUX_ERROR);
440 ASN1_item_ex_free(pval, it);
442 ERR_add_error_data(4, "Field=", errtt->field_name,
443 ", Type=", it->sname);
445 ERR_add_error_data(2, "Type=", it->sname);
450 * Templates are handled with two separate functions. One handles any
451 * EXPLICIT tag and the other handles the rest.
454 static int asn1_template_ex_d2i(ASN1_VALUE **val,
455 const unsigned char **in, long inlen,
456 const ASN1_TEMPLATE *tt, char opt,
462 const unsigned char *p, *q;
467 aclass = flags & ASN1_TFLG_TAG_CLASS;
471 /* Check if EXPLICIT tag expected */
472 if (flags & ASN1_TFLG_EXPTAG) {
475 * Need to work out amount of data available to the inner content and
476 * where it starts: so read in EXPLICIT header to get the info.
478 ret = asn1_check_tlen(&len, NULL, NULL, &exp_eoc, &cst,
479 &p, inlen, tt->tag, aclass, opt, ctx);
482 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
484 } else if (ret == -1)
487 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I,
488 ASN1_R_EXPLICIT_TAG_NOT_CONSTRUCTED);
491 /* We've found the field so it can't be OPTIONAL now */
492 ret = asn1_template_noexp_d2i(val, &p, len, tt, 0, ctx);
494 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
497 /* We read the field in OK so update length */
500 /* If NDEF we must have an EOC here */
501 if (!asn1_check_eoc(&p, len)) {
502 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ASN1_R_MISSING_EOC);
507 * Otherwise we must hit the EXPLICIT tag end or its an error
510 ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I,
511 ASN1_R_EXPLICIT_LENGTH_MISMATCH);
516 return asn1_template_noexp_d2i(val, in, inlen, tt, opt, ctx);
522 ASN1_template_free(val, tt);
526 static int asn1_template_noexp_d2i(ASN1_VALUE **val,
527 const unsigned char **in, long len,
528 const ASN1_TEMPLATE *tt, char opt,
533 const unsigned char *p, *q;
537 aclass = flags & ASN1_TFLG_TAG_CLASS;
542 if (flags & ASN1_TFLG_SK_MASK) {
543 /* SET OF, SEQUENCE OF */
546 /* First work out expected inner tag value */
547 if (flags & ASN1_TFLG_IMPTAG) {
551 skaclass = V_ASN1_UNIVERSAL;
552 if (flags & ASN1_TFLG_SET_OF)
555 sktag = V_ASN1_SEQUENCE;
558 ret = asn1_check_tlen(&len, NULL, NULL, &sk_eoc, NULL,
559 &p, len, sktag, skaclass, opt, ctx);
561 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_NESTED_ASN1_ERROR);
563 } else if (ret == -1)
566 *val = (ASN1_VALUE *)sk_new_null();
569 * We've got a valid STACK: free up any items present
571 STACK_OF(ASN1_VALUE) *sktmp = (STACK_OF(ASN1_VALUE) *)*val;
573 while (sk_ASN1_VALUE_num(sktmp) > 0) {
574 vtmp = sk_ASN1_VALUE_pop(sktmp);
575 ASN1_item_ex_free(&vtmp, ASN1_ITEM_ptr(tt->item));
580 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_MALLOC_FAILURE);
584 /* Read as many items as we can */
588 /* See if EOC found */
589 if (asn1_check_eoc(&p, len)) {
591 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I,
592 ASN1_R_UNEXPECTED_EOC);
600 if (!ASN1_item_ex_d2i(&skfield, &p, len,
601 ASN1_ITEM_ptr(tt->item), -1, 0, 0, ctx)) {
602 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I,
603 ERR_R_NESTED_ASN1_ERROR);
607 if (!sk_ASN1_VALUE_push((STACK_OF(ASN1_VALUE) *)*val, skfield)) {
608 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_MALLOC_FAILURE);
613 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ASN1_R_MISSING_EOC);
616 } else if (flags & ASN1_TFLG_IMPTAG) {
617 /* IMPLICIT tagging */
618 ret = ASN1_item_ex_d2i(val, &p, len,
619 ASN1_ITEM_ptr(tt->item), tt->tag, aclass, opt,
622 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_NESTED_ASN1_ERROR);
624 } else if (ret == -1)
627 /* Nothing special */
628 ret = ASN1_item_ex_d2i(val, &p, len, ASN1_ITEM_ptr(tt->item),
631 ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_NESTED_ASN1_ERROR);
633 } else if (ret == -1)
641 ASN1_template_free(val, tt);
645 static int asn1_d2i_ex_primitive(ASN1_VALUE **pval,
646 const unsigned char **in, long inlen,
648 int tag, int aclass, char opt, ASN1_TLC *ctx)
652 char cst, inf, free_cont = 0;
653 const unsigned char *p;
655 const unsigned char *cont = NULL;
658 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_ILLEGAL_NULL);
659 return 0; /* Should never happen */
662 if (it->itype == ASN1_ITYPE_MSTRING) {
668 if (utype == V_ASN1_ANY) {
669 /* If type is ANY need to figure out type from tag */
670 unsigned char oclass;
672 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_ILLEGAL_TAGGED_ANY);
676 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE,
677 ASN1_R_ILLEGAL_OPTIONAL_ANY);
681 ret = asn1_check_tlen(NULL, &utype, &oclass, NULL, NULL,
682 &p, inlen, -1, 0, 0, ctx);
684 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_NESTED_ASN1_ERROR);
687 if (oclass != V_ASN1_UNIVERSAL)
688 utype = V_ASN1_OTHER;
692 aclass = V_ASN1_UNIVERSAL;
696 ret = asn1_check_tlen(&plen, NULL, NULL, &inf, &cst,
697 &p, inlen, tag, aclass, opt, ctx);
699 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_NESTED_ASN1_ERROR);
701 } else if (ret == -1)
704 /* SEQUENCE, SET and "OTHER" are left in encoded form */
705 if ((utype == V_ASN1_SEQUENCE)
706 || (utype == V_ASN1_SET) || (utype == V_ASN1_OTHER)) {
708 * Clear context cache for type OTHER because the auto clear when we
709 * have a exact match wont work
711 if (utype == V_ASN1_OTHER) {
714 /* SEQUENCE and SET must be constructed */
716 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE,
717 ASN1_R_TYPE_NOT_CONSTRUCTED);
722 /* If indefinite length constructed find the real end */
724 if (!asn1_find_end(&p, plen, inf))
728 len = p - cont + plen;
733 if (utype == V_ASN1_NULL || utype == V_ASN1_BOOLEAN
734 || utype == V_ASN1_OBJECT || utype == V_ASN1_INTEGER
735 || utype == V_ASN1_ENUMERATED) {
736 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_TYPE_NOT_PRIMITIVE);
743 * Should really check the internal tags are correct but some things
744 * may get this wrong. The relevant specs say that constructed string
745 * types should be OCTET STRINGs internally irrespective of the type.
746 * So instead just check for UNIVERSAL class and ignore the tag.
748 if (!asn1_collect(&buf, &p, plen, inf, -1, V_ASN1_UNIVERSAL, 0)) {
753 /* Append a final null to string */
754 if (!BUF_MEM_grow_clean(&buf, len + 1)) {
755 ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_MALLOC_FAILURE);
759 cont = (const unsigned char *)buf.data;
767 /* We now have content length and type: translate into a structure */
768 if (!asn1_ex_c2i(pval, cont, len, utype, &free_cont, it))
774 if (free_cont && buf.data)
775 OPENSSL_free(buf.data);
779 /* Translate ASN1 content octets into a structure */
781 int asn1_ex_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len,
782 int utype, char *free_cont, const ASN1_ITEM *it)
784 ASN1_VALUE **opval = NULL;
786 ASN1_TYPE *typ = NULL;
788 const ASN1_PRIMITIVE_FUNCS *pf;
792 if (pf && pf->prim_c2i)
793 return pf->prim_c2i(pval, cont, len, utype, free_cont, it);
794 /* If ANY type clear type and set pointer to internal value */
795 if (it->utype == V_ASN1_ANY) {
797 typ = ASN1_TYPE_new();
800 *pval = (ASN1_VALUE *)typ;
802 typ = (ASN1_TYPE *)*pval;
804 if (utype != typ->type)
805 ASN1_TYPE_set(typ, utype, NULL);
807 pval = &typ->value.asn1_value;
811 if (!c2i_ASN1_OBJECT((ASN1_OBJECT **)pval, &cont, len))
817 ASN1err(ASN1_F_ASN1_EX_C2I, ASN1_R_NULL_IS_WRONG_LENGTH);
820 *pval = (ASN1_VALUE *)1;
825 ASN1err(ASN1_F_ASN1_EX_C2I, ASN1_R_BOOLEAN_IS_WRONG_LENGTH);
829 tbool = (ASN1_BOOLEAN *)pval;
834 case V_ASN1_BIT_STRING:
835 if (!c2i_ASN1_BIT_STRING((ASN1_BIT_STRING **)pval, &cont, len))
840 case V_ASN1_NEG_INTEGER:
841 case V_ASN1_ENUMERATED:
842 case V_ASN1_NEG_ENUMERATED:
843 tint = (ASN1_INTEGER **)pval;
844 if (!c2i_ASN1_INTEGER(tint, &cont, len))
846 /* Fixup type to match the expected form */
847 (*tint)->type = utype | ((*tint)->type & V_ASN1_NEG);
850 case V_ASN1_OCTET_STRING:
851 case V_ASN1_NUMERICSTRING:
852 case V_ASN1_PRINTABLESTRING:
853 case V_ASN1_T61STRING:
854 case V_ASN1_VIDEOTEXSTRING:
855 case V_ASN1_IA5STRING:
857 case V_ASN1_GENERALIZEDTIME:
858 case V_ASN1_GRAPHICSTRING:
859 case V_ASN1_VISIBLESTRING:
860 case V_ASN1_GENERALSTRING:
861 case V_ASN1_UNIVERSALSTRING:
862 case V_ASN1_BMPSTRING:
863 case V_ASN1_UTF8STRING:
866 case V_ASN1_SEQUENCE:
868 if (utype == V_ASN1_BMPSTRING && (len & 1)) {
869 ASN1err(ASN1_F_ASN1_EX_C2I, ASN1_R_BMPSTRING_IS_WRONG_LENGTH);
872 if (utype == V_ASN1_UNIVERSALSTRING && (len & 3)) {
873 ASN1err(ASN1_F_ASN1_EX_C2I,
874 ASN1_R_UNIVERSALSTRING_IS_WRONG_LENGTH);
877 /* All based on ASN1_STRING and handled the same */
879 stmp = ASN1_STRING_type_new(utype);
881 ASN1err(ASN1_F_ASN1_EX_C2I, ERR_R_MALLOC_FAILURE);
884 *pval = (ASN1_VALUE *)stmp;
886 stmp = (ASN1_STRING *)*pval;
889 /* If we've already allocated a buffer use it */
892 OPENSSL_free(stmp->data);
893 stmp->data = (unsigned char *)cont; /* UGLY CAST! RL */
897 if (!ASN1_STRING_set(stmp, cont, len)) {
898 ASN1err(ASN1_F_ASN1_EX_C2I, ERR_R_MALLOC_FAILURE);
899 ASN1_STRING_free(stmp);
906 /* If ASN1_ANY and NULL type fix up value */
907 if (typ && (utype == V_ASN1_NULL))
908 typ->value.ptr = NULL;
921 * This function finds the end of an ASN1 structure when passed its maximum
922 * length, whether it is indefinite length and a pointer to the content. This
923 * is more efficient than calling asn1_collect because it does not recurse on
924 * each indefinite length header.
927 static int asn1_find_end(const unsigned char **in, long len, char inf)
931 const unsigned char *p = *in, *q;
932 /* If not indefinite length constructed just add length */
939 * Indefinite length constructed form. Find the end when enough EOCs are
940 * found. If more indefinite length constructed headers are encountered
941 * increment the expected eoc count otherwise just skip to the end of the
945 if (asn1_check_eoc(&p, len)) {
947 if (expected_eoc == 0)
953 /* Just read in a header: only care about the length */
954 if (!asn1_check_tlen(&plen, NULL, NULL, &inf, NULL, &p, len,
956 ASN1err(ASN1_F_ASN1_FIND_END, ERR_R_NESTED_ASN1_ERROR);
966 ASN1err(ASN1_F_ASN1_FIND_END, ASN1_R_MISSING_EOC);
974 * This function collects the asn1 data from a constructred string type into
975 * a buffer. The values of 'in' and 'len' should refer to the contents of the
976 * constructed type and 'inf' should be set if it is indefinite length.
979 #ifndef ASN1_MAX_STRING_NEST
981 * This determines how many levels of recursion are permitted in ASN1 string
982 * types. If it is not limited stack overflows can occur. If set to zero no
983 * recursion is allowed at all. Although zero should be adequate examples
984 * exist that require a value of 1. So 5 should be more than enough.
986 # define ASN1_MAX_STRING_NEST 5
989 static int asn1_collect(BUF_MEM *buf, const unsigned char **in, long len,
990 char inf, int tag, int aclass, int depth)
992 const unsigned char *p, *q;
998 * If no buffer and not indefinite length constructed just pass over the
1008 if (asn1_check_eoc(&p, len)) {
1010 * EOC is illegal outside indefinite length constructed form
1013 ASN1err(ASN1_F_ASN1_COLLECT, ASN1_R_UNEXPECTED_EOC);
1020 if (!asn1_check_tlen(&plen, NULL, NULL, &ininf, &cst, &p,
1021 len, tag, aclass, 0, NULL)) {
1022 ASN1err(ASN1_F_ASN1_COLLECT, ERR_R_NESTED_ASN1_ERROR);
1026 /* If indefinite length constructed update max length */
1028 if (depth >= ASN1_MAX_STRING_NEST) {
1029 ASN1err(ASN1_F_ASN1_COLLECT, ASN1_R_NESTED_ASN1_STRING);
1032 if (!asn1_collect(buf, &p, plen, ininf, tag, aclass, depth + 1))
1034 } else if (plen && !collect_data(buf, &p, plen))
1039 ASN1err(ASN1_F_ASN1_COLLECT, ASN1_R_MISSING_EOC);
1046 static int collect_data(BUF_MEM *buf, const unsigned char **p, long plen)
1051 if (!BUF_MEM_grow_clean(buf, len + plen)) {
1052 ASN1err(ASN1_F_COLLECT_DATA, ERR_R_MALLOC_FAILURE);
1055 memcpy(buf->data + len, *p, plen);
1061 /* Check for ASN1 EOC and swallow it if found */
1063 static int asn1_check_eoc(const unsigned char **in, long len)
1065 const unsigned char *p;
1069 if (!p[0] && !p[1]) {
1077 * Check an ASN1 tag and length: a bit like ASN1_get_object but it sets the
1078 * length for indefinite length constructed form, we don't know the exact
1079 * length but we can set an upper bound to the amount of data available minus
1080 * the header length just read.
1083 static int asn1_check_tlen(long *olen, int *otag, unsigned char *oclass,
1084 char *inf, char *cst,
1085 const unsigned char **in, long len,
1086 int exptag, int expclass, char opt, ASN1_TLC *ctx)
1091 const unsigned char *p, *q;
1095 if (ctx && ctx->valid) {
1098 pclass = ctx->pclass;
1102 i = ASN1_get_object(&p, &plen, &ptag, &pclass, len);
1106 ctx->pclass = pclass;
1108 ctx->hdrlen = p - q;
1111 * If definite length, and no error, length + header can't exceed
1112 * total amount of data available.
1114 if (!(i & 0x81) && ((plen + ctx->hdrlen) > len)) {
1115 ASN1err(ASN1_F_ASN1_CHECK_TLEN, ASN1_R_TOO_LONG);
1116 asn1_tlc_clear(ctx);
1123 ASN1err(ASN1_F_ASN1_CHECK_TLEN, ASN1_R_BAD_OBJECT_HEADER);
1124 asn1_tlc_clear(ctx);
1128 if ((exptag != ptag) || (expclass != pclass)) {
1130 * If type is OPTIONAL, not an error: indicate missing type.
1134 asn1_tlc_clear(ctx);
1135 ASN1err(ASN1_F_ASN1_CHECK_TLEN, ASN1_R_WRONG_TAG);
1139 * We have a tag and class match: assume we are going to do something
1142 asn1_tlc_clear(ctx);
1146 plen = len - (p - q);
1152 *cst = i & V_ASN1_CONSTRUCTED;