3 * Written by Dr Stephen N Henson (steve@openssl.org) for the OpenSSL project
6 /* ====================================================================
7 * Copyright (c) 2000 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).
61 #include <openssl/asn1.h>
62 #include <openssl/asn1t.h>
63 #include <openssl/objects.h>
64 #include "asn1_locl.h"
66 /* Free up an ASN1 structure */
68 void ASN1_item_free(ASN1_VALUE *val, const ASN1_ITEM *it)
70 ASN1_item_ex_free(&val, it);
73 void ASN1_item_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it)
75 const ASN1_TEMPLATE *tt = NULL, *seqtt;
76 const ASN1_EXTERN_FUNCS *ef;
77 const ASN1_AUX *aux = it->funcs;
83 if ((it->itype != ASN1_ITYPE_PRIMITIVE) && !*pval)
85 if (aux && aux->asn1_cb)
86 asn1_cb = aux->asn1_cb;
92 case ASN1_ITYPE_PRIMITIVE:
94 asn1_template_free(pval, it->templates);
96 asn1_primitive_free(pval, it);
99 case ASN1_ITYPE_MSTRING:
100 asn1_primitive_free(pval, it);
103 case ASN1_ITYPE_CHOICE:
105 i = asn1_cb(ASN1_OP_FREE_PRE, pval, it, NULL);
109 i = asn1_get_choice_selector(pval, it);
110 if ((i >= 0) && (i < it->tcount)) {
113 tt = it->templates + i;
114 pchval = asn1_get_field_ptr(pval, tt);
115 asn1_template_free(pchval, tt);
118 asn1_cb(ASN1_OP_FREE_POST, pval, it, NULL);
123 case ASN1_ITYPE_EXTERN:
125 if (ef && ef->asn1_ex_free)
126 ef->asn1_ex_free(pval, it);
129 case ASN1_ITYPE_NDEF_SEQUENCE:
130 case ASN1_ITYPE_SEQUENCE:
131 if (asn1_do_lock(pval, -1, it) > 0)
134 i = asn1_cb(ASN1_OP_FREE_PRE, pval, it, NULL);
138 asn1_enc_free(pval, it);
140 * If we free up as normal we will invalidate any ANY DEFINED BY
141 * field and we wont be able to determine the type of the field it
142 * defines. So free up in reverse order.
144 tt = it->templates + it->tcount - 1;
145 for (i = 0; i < it->tcount; tt--, i++) {
146 ASN1_VALUE **pseqval;
147 seqtt = asn1_do_adb(pval, tt, 0);
150 pseqval = asn1_get_field_ptr(pval, seqtt);
151 asn1_template_free(pseqval, seqtt);
154 asn1_cb(ASN1_OP_FREE_POST, pval, it, NULL);
161 void asn1_template_free(ASN1_VALUE **pval, const ASN1_TEMPLATE *tt)
163 if (tt->flags & ASN1_TFLG_SK_MASK) {
164 STACK_OF(ASN1_VALUE) *sk = (STACK_OF(ASN1_VALUE) *)*pval;
167 for (i = 0; i < sk_ASN1_VALUE_num(sk); i++) {
168 ASN1_VALUE *vtmp = sk_ASN1_VALUE_value(sk, i);
170 ASN1_item_ex_free(&vtmp, ASN1_ITEM_ptr(tt->item));
172 sk_ASN1_VALUE_free(sk);
175 ASN1_item_ex_free(pval, ASN1_ITEM_ptr(tt->item));
179 void asn1_primitive_free(ASN1_VALUE **pval, const ASN1_ITEM *it)
183 /* Special case: if 'it' is a primitive with a free_func, use that. */
185 const ASN1_PRIMITIVE_FUNCS *pf = it->funcs;
187 if (pf && pf->prim_free) {
188 pf->prim_free(pval, it);
193 /* Special case: if 'it' is NULL, free contents of ASN1_TYPE */
195 ASN1_TYPE *typ = (ASN1_TYPE *)*pval;
198 pval = &typ->value.asn1_value;
201 } else if (it->itype == ASN1_ITYPE_MSTRING) {
207 if ((utype != V_ASN1_BOOLEAN) && !*pval)
213 ASN1_OBJECT_free((ASN1_OBJECT *)*pval);
218 *(ASN1_BOOLEAN *)pval = it->size;
220 *(ASN1_BOOLEAN *)pval = -1;
227 asn1_primitive_free(pval, NULL);
232 ASN1_STRING_free((ASN1_STRING *)*pval);