1 /* $OpenBSD: tasn_fre.c,v 1.20 2022/05/12 19:55:58 jsing Exp $ */
2 /* Written by Dr Stephen N Henson (steve@openssl.org) for the OpenSSL
3  * project 2000.
4  */
5 /* ====================================================================
6  * Copyright (c) 2000 The OpenSSL Project.  All rights reserved.
7  *
8  * Redistribution and use in source and binary forms, with or without
9  * modification, are permitted provided that the following conditions
10  * are met:
11  *
12  * 1. Redistributions of source code must retain the above copyright
13  *    notice, this list of conditions and the following disclaimer.
14  *
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
18  *    distribution.
19  *
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/)"
24  *
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.
29  *
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.
33  *
34  * 6. Redistributions of any form whatsoever must retain the following
35  *    acknowledgment:
36  *    "This product includes software developed by the OpenSSL Project
37  *    for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
38  *
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  * ====================================================================
52  *
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).
56  *
57  */
58 
59 
60 #include <stddef.h>
61 #include <openssl/asn1.h>
62 #include <openssl/asn1t.h>
63 #include <openssl/objects.h>
64 
65 #include "asn1_locl.h"
66 
67 static void asn1_item_free(ASN1_VALUE **pval, const ASN1_ITEM *it);
68 
69 /* Free up an ASN1 structure */
70 
71 void
72 ASN1_item_free(ASN1_VALUE *val, const ASN1_ITEM *it)
73 {
74 	asn1_item_free(&val, it);
75 }
76 
77 void
78 ASN1_item_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it)
79 {
80 	asn1_item_free(pval, it);
81 }
82 
83 static void
84 asn1_item_free(ASN1_VALUE **pval, const ASN1_ITEM *it)
85 {
86 	const ASN1_TEMPLATE *tt = NULL, *seqtt;
87 	const ASN1_EXTERN_FUNCS *ef;
88 	const ASN1_AUX *aux = it->funcs;
89 	ASN1_aux_cb *asn1_cb = NULL;
90 	int i;
91 
92 	if (pval == NULL)
93 		return;
94 	/* For primitive types *pval may be something other than C pointer. */
95 	if (it->itype != ASN1_ITYPE_PRIMITIVE && *pval == NULL)
96 		return;
97 
98 	if (aux != NULL && aux->asn1_cb != NULL)
99 		asn1_cb = aux->asn1_cb;
100 
101 	switch (it->itype) {
102 	case ASN1_ITYPE_PRIMITIVE:
103 		if (it->templates)
104 			ASN1_template_free(pval, it->templates);
105 		else
106 			ASN1_primitive_free(pval, it);
107 		break;
108 
109 	case ASN1_ITYPE_MSTRING:
110 		ASN1_primitive_free(pval, it);
111 		break;
112 
113 	case ASN1_ITYPE_CHOICE:
114 		if (asn1_cb) {
115 			i = asn1_cb(ASN1_OP_FREE_PRE, pval, it, NULL);
116 			if (i == 2)
117 				return;
118 		}
119 		i = asn1_get_choice_selector(pval, it);
120 		if ((i >= 0) && (i < it->tcount)) {
121 			ASN1_VALUE **pchval;
122 			tt = it->templates + i;
123 			pchval = asn1_get_field_ptr(pval, tt);
124 			ASN1_template_free(pchval, tt);
125 		}
126 		if (asn1_cb)
127 			asn1_cb(ASN1_OP_FREE_POST, pval, it, NULL);
128 		free(*pval);
129 		*pval = NULL;
130 		break;
131 
132 	case ASN1_ITYPE_EXTERN:
133 		ef = it->funcs;
134 		if (ef && ef->asn1_ex_free)
135 			ef->asn1_ex_free(pval, it);
136 		break;
137 
138 	case ASN1_ITYPE_NDEF_SEQUENCE:
139 	case ASN1_ITYPE_SEQUENCE:
140 		if (asn1_do_lock(pval, -1, it) > 0)
141 			return;
142 		if (asn1_cb) {
143 			i = asn1_cb(ASN1_OP_FREE_PRE, pval, it, NULL);
144 			if (i == 2)
145 				return;
146 		}
147 		asn1_enc_cleanup(pval, it);
148 		/* If we free up as normal we will invalidate any
149 		 * ANY DEFINED BY field and we wont be able to
150 		 * determine the type of the field it defines. So
151 		 * free up in reverse order.
152 		 */
153 		tt = it->templates + it->tcount - 1;
154 		for (i = 0; i < it->tcount; tt--, i++) {
155 			ASN1_VALUE **pseqval;
156 			seqtt = asn1_do_adb(pval, tt, 0);
157 			if (!seqtt)
158 				continue;
159 			pseqval = asn1_get_field_ptr(pval, seqtt);
160 			ASN1_template_free(pseqval, seqtt);
161 		}
162 		if (asn1_cb)
163 			asn1_cb(ASN1_OP_FREE_POST, pval, it, NULL);
164 		free(*pval);
165 		*pval = NULL;
166 		break;
167 	}
168 }
169 
170 void
171 ASN1_template_free(ASN1_VALUE **pval, const ASN1_TEMPLATE *tt)
172 {
173 	int i;
174 	if (tt->flags & ASN1_TFLG_SK_MASK) {
175 		STACK_OF(ASN1_VALUE) *sk = (STACK_OF(ASN1_VALUE) *)*pval;
176 		for (i = 0; i < sk_ASN1_VALUE_num(sk); i++) {
177 			ASN1_VALUE *vtmp;
178 			vtmp = sk_ASN1_VALUE_value(sk, i);
179 			asn1_item_free(&vtmp, tt->item);
180 		}
181 		sk_ASN1_VALUE_free(sk);
182 		*pval = NULL;
183 	} else
184 		asn1_item_free(pval, tt->item);
185 }
186 
187 void
188 ASN1_primitive_free(ASN1_VALUE **pval, const ASN1_ITEM *it)
189 {
190 	int utype;
191 
192 	if (it != NULL && it->funcs != NULL) {
193 		const ASN1_PRIMITIVE_FUNCS *pf = it->funcs;
194 
195 		pf->prim_free(pval, it);
196 		return;
197 	}
198 
199 	/* Special case: if 'it' is NULL free contents of ASN1_TYPE */
200 	if (!it) {
201 		ASN1_TYPE *typ = (ASN1_TYPE *)*pval;
202 		utype = typ->type;
203 		pval = &typ->value.asn1_value;
204 		if (!*pval)
205 			return;
206 	} else if (it->itype == ASN1_ITYPE_MSTRING) {
207 		utype = -1;
208 		if (!*pval)
209 			return;
210 	} else {
211 		utype = it->utype;
212 		if ((utype != V_ASN1_BOOLEAN) && !*pval)
213 			return;
214 	}
215 
216 	switch (utype) {
217 	case V_ASN1_OBJECT:
218 		ASN1_OBJECT_free((ASN1_OBJECT *)*pval);
219 		break;
220 
221 	case V_ASN1_BOOLEAN:
222 		if (it)
223 			*(ASN1_BOOLEAN *)pval = it->size;
224 		else
225 			*(ASN1_BOOLEAN *)pval = -1;
226 		return;
227 
228 	case V_ASN1_NULL:
229 		break;
230 
231 	case V_ASN1_ANY:
232 		ASN1_primitive_free(pval, NULL);
233 		free(*pval);
234 		break;
235 
236 	default:
237 		ASN1_STRING_free((ASN1_STRING *)*pval);
238 		break;
239 	}
240 	*pval = NULL;
241 }
242