2 /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL
5 /* ====================================================================
6 * Copyright (c) 2000 The OpenSSL Project. All rights reserved.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in
17 * the documentation and/or other materials provided with the
20 * 3. All advertising materials mentioning features or use of this
21 * software must display the following acknowledgment:
22 * "This product includes software developed by the OpenSSL Project
23 * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
25 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
26 * endorse or promote products derived from this software without
27 * prior written permission. For written permission, please contact
28 * licensing@OpenSSL.org.
30 * 5. Products derived from this software may not be called "OpenSSL"
31 * nor may "OpenSSL" appear in their names without prior written
32 * permission of the OpenSSL Project.
34 * 6. Redistributions of any form whatsoever must retain the following
36 * "This product includes software developed by the OpenSSL Project
37 * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
39 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
40 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
41 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
42 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
43 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
44 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
45 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
46 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
47 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
48 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
49 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
50 * OF THE POSSIBILITY OF SUCH DAMAGE.
51 * ====================================================================
53 * This product includes cryptographic software written by Eric Young
54 * (eay@cryptsoft.com). This product includes software written by Tim
55 * Hudson (tjh@cryptsoft.com).
61 #include <openssl/asn1.h>
62 #include <openssl/asn1t.h>
63 #include <openssl/objects.h>
65 static void asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it, int combine);
67 /* Free up an ASN1 structure */
69 void ASN1_item_free(ASN1_VALUE *val, const ASN1_ITEM *it)
71 asn1_item_combine_free(&val, it, 0);
74 void ASN1_item_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it)
76 asn1_item_combine_free(pval, it, 0);
79 static void asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it, int combine)
81 const ASN1_TEMPLATE *tt = NULL, *seqtt;
82 const ASN1_EXTERN_FUNCS *ef;
83 const ASN1_COMPAT_FUNCS *cf;
84 const ASN1_AUX *aux = it->funcs;
88 if((it->itype != ASN1_ITYPE_PRIMITIVE) && !*pval) return;
89 if(aux && aux->asn1_cb) asn1_cb = aux->asn1_cb;
94 case ASN1_ITYPE_PRIMITIVE:
95 if(it->templates) ASN1_template_free(pval, it->templates);
96 else 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);
108 i = asn1_get_choice_selector(pval, it);
109 if(asn1_cb) asn1_cb(ASN1_OP_FREE_PRE, pval, it);
110 if((i >= 0) && (i < it->tcount)) {
112 tt = it->templates + i;
113 pchval = asn1_get_field_ptr(pval, tt);
114 ASN1_template_free(pchval, tt);
116 if(asn1_cb) asn1_cb(ASN1_OP_FREE_POST, pval, it);
123 case ASN1_ITYPE_COMPAT:
125 if(cf && cf->asn1_free) cf->asn1_free(*pval);
128 case ASN1_ITYPE_EXTERN:
130 if(ef && ef->asn1_ex_free) ef->asn1_ex_free(pval, it);
133 case ASN1_ITYPE_NDEF_SEQUENCE:
134 case ASN1_ITYPE_SEQUENCE:
135 if(asn1_do_lock(pval, -1, it) > 0) return;
137 i = asn1_cb(ASN1_OP_FREE_PRE, pval, it);
140 asn1_enc_free(pval, it);
141 /* If we free up as normal we will invalidate any
142 * ANY DEFINED BY field and we wont be able to
143 * determine the type of the field it defines. So
144 * free up in reverse order.
146 tt = it->templates + it->tcount - 1;
147 for(i = 0; i < it->tcount; tt--, i++) {
148 ASN1_VALUE **pseqval;
149 seqtt = asn1_do_adb(pval, tt, 0);
151 pseqval = asn1_get_field_ptr(pval, seqtt);
152 ASN1_template_free(pseqval, seqtt);
154 if(asn1_cb) asn1_cb(ASN1_OP_FREE_POST, pval, it);
163 void ASN1_template_free(ASN1_VALUE **pval, const ASN1_TEMPLATE *tt)
166 if(tt->flags & ASN1_TFLG_SK_MASK) {
167 STACK_OF(ASN1_VALUE) *sk = (STACK_OF(ASN1_VALUE) *)*pval;
168 for(i = 0; i < sk_ASN1_VALUE_num(sk); i++) {
170 vtmp = sk_ASN1_VALUE_value(sk, i);
171 asn1_item_combine_free(&vtmp, ASN1_ITEM_ptr(tt->item), 0);
173 sk_ASN1_VALUE_free(sk);
175 } else asn1_item_combine_free(pval, ASN1_ITEM_ptr(tt->item),
176 tt->flags & ASN1_TFLG_COMBINE);
179 void ASN1_primitive_free(ASN1_VALUE **pval, const ASN1_ITEM *it)
183 const ASN1_PRIMITIVE_FUNCS *pf;
185 if(pf && pf->prim_free) {
186 pf->prim_free(pval, it);
190 /* Special case: if 'it' is NULL free contents of ASN1_TYPE */
192 ASN1_TYPE *typ = (ASN1_TYPE *)*pval;
194 pval = (ASN1_VALUE **)&typ->value.ptr;
196 } else if(it->itype == ASN1_ITYPE_MSTRING) {
201 if((utype != V_ASN1_BOOLEAN) && !*pval) return;
206 ASN1_OBJECT_free((ASN1_OBJECT *)*pval);
211 *(ASN1_BOOLEAN *)pval = it->size;
213 *(ASN1_BOOLEAN *)pval = -1;
220 ASN1_primitive_free(pval, NULL);
225 ASN1_STRING_free((ASN1_STRING *)*pval);