1 |
|
|
/* $OpenBSD: tasn_fre.c,v 1.15 2016/12/30 16:04:34 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 |
|
|
static void asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it, |
66 |
|
|
int combine); |
67 |
|
|
|
68 |
|
|
/* Free up an ASN1 structure */ |
69 |
|
|
|
70 |
|
|
void |
71 |
|
|
ASN1_item_free(ASN1_VALUE *val, const ASN1_ITEM *it) |
72 |
|
|
{ |
73 |
|
784610 |
asn1_item_combine_free(&val, it, 0); |
74 |
|
784610 |
} |
75 |
|
|
|
76 |
|
|
void |
77 |
|
|
ASN1_item_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it) |
78 |
|
|
{ |
79 |
|
920 |
asn1_item_combine_free(pval, it, 0); |
80 |
|
460 |
} |
81 |
|
|
|
82 |
|
|
static void |
83 |
|
|
asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it, int combine) |
84 |
|
|
{ |
85 |
|
|
const ASN1_TEMPLATE *tt = NULL, *seqtt; |
86 |
|
|
const ASN1_EXTERN_FUNCS *ef; |
87 |
|
3828948 |
const ASN1_AUX *aux = it->funcs; |
88 |
|
|
ASN1_aux_cb *asn1_cb = NULL; |
89 |
|
|
int i; |
90 |
|
|
|
91 |
✓✗✓✓
|
3828948 |
if (pval == NULL || *pval == NULL) |
92 |
|
537821 |
return; |
93 |
|
|
|
94 |
✓✓✓✓
|
1485808 |
if (aux != NULL && aux->asn1_cb != NULL) |
95 |
|
61997 |
asn1_cb = aux->asn1_cb; |
96 |
|
|
|
97 |
✓✓✓✓ ✗✓✓ |
2733963 |
switch (it->itype) { |
98 |
|
|
case ASN1_ITYPE_PRIMITIVE: |
99 |
✓✓ |
630969 |
if (it->templates) |
100 |
|
20 |
ASN1_template_free(pval, it->templates); |
101 |
|
|
else |
102 |
|
630949 |
ASN1_primitive_free(pval, it); |
103 |
|
|
break; |
104 |
|
|
|
105 |
|
|
case ASN1_ITYPE_MSTRING: |
106 |
|
275570 |
ASN1_primitive_free(pval, it); |
107 |
|
275570 |
break; |
108 |
|
|
|
109 |
|
|
case ASN1_ITYPE_CHOICE: |
110 |
✗✓ |
1612 |
if (asn1_cb) { |
111 |
|
|
i = asn1_cb(ASN1_OP_FREE_PRE, pval, it, NULL); |
112 |
|
|
if (i == 2) |
113 |
|
|
return; |
114 |
|
|
} |
115 |
|
1612 |
i = asn1_get_choice_selector(pval, it); |
116 |
✓✗✓✗
|
3224 |
if ((i >= 0) && (i < it->tcount)) { |
117 |
|
|
ASN1_VALUE **pchval; |
118 |
|
1612 |
tt = it->templates + i; |
119 |
|
1612 |
pchval = asn1_get_field_ptr(pval, tt); |
120 |
|
1612 |
ASN1_template_free(pchval, tt); |
121 |
|
1612 |
} |
122 |
✗✓ |
1612 |
if (asn1_cb) |
123 |
|
|
asn1_cb(ASN1_OP_FREE_POST, pval, it, NULL); |
124 |
✓✓ |
1612 |
if (!combine) { |
125 |
|
1508 |
free(*pval); |
126 |
|
1508 |
*pval = NULL; |
127 |
|
1508 |
} |
128 |
|
|
break; |
129 |
|
|
|
130 |
|
|
case ASN1_ITYPE_EXTERN: |
131 |
|
31566 |
ef = it->funcs; |
132 |
✓✗✓✗
|
63132 |
if (ef && ef->asn1_ex_free) |
133 |
|
31566 |
ef->asn1_ex_free(pval, it); |
134 |
|
|
break; |
135 |
|
|
|
136 |
|
|
case ASN1_ITYPE_NDEF_SEQUENCE: |
137 |
|
|
case ASN1_ITYPE_SEQUENCE: |
138 |
✓✓ |
436936 |
if (asn1_do_lock(pval, -1, it) > 0) |
139 |
|
19343 |
return; |
140 |
✓✓ |
417593 |
if (asn1_cb) { |
141 |
|
31780 |
i = asn1_cb(ASN1_OP_FREE_PRE, pval, it, NULL); |
142 |
✗✓ |
31780 |
if (i == 2) |
143 |
|
|
return; |
144 |
|
|
} |
145 |
|
417593 |
asn1_enc_free(pval, it); |
146 |
|
|
/* If we free up as normal we will invalidate any |
147 |
|
|
* ANY DEFINED BY field and we wont be able to |
148 |
|
|
* determine the type of the field it defines. So |
149 |
|
|
* free up in reverse order. |
150 |
|
|
*/ |
151 |
|
417593 |
tt = it->templates + it->tcount - 1; |
152 |
✓✓ |
2901414 |
for (i = 0; i < it->tcount; tt--, i++) { |
153 |
|
|
ASN1_VALUE **pseqval; |
154 |
|
1033114 |
seqtt = asn1_do_adb(pval, tt, 0); |
155 |
✗✓ |
1033114 |
if (!seqtt) |
156 |
|
|
continue; |
157 |
|
1033114 |
pseqval = asn1_get_field_ptr(pval, seqtt); |
158 |
|
1033114 |
ASN1_template_free(pseqval, seqtt); |
159 |
|
1033114 |
} |
160 |
✓✓ |
417593 |
if (asn1_cb) |
161 |
|
31780 |
asn1_cb(ASN1_OP_FREE_POST, pval, it, NULL); |
162 |
✓✗ |
417593 |
if (!combine) { |
163 |
|
417593 |
free(*pval); |
164 |
|
417593 |
*pval = NULL; |
165 |
|
417593 |
} |
166 |
|
|
break; |
167 |
|
|
} |
168 |
|
3271784 |
} |
169 |
|
|
|
170 |
|
|
void |
171 |
|
|
ASN1_template_free(ASN1_VALUE **pval, const ASN1_TEMPLATE *tt) |
172 |
|
|
{ |
173 |
|
|
int i; |
174 |
✓✓ |
2203108 |
if (tt->flags & ASN1_TFLG_SK_MASK) { |
175 |
|
19512 |
STACK_OF(ASN1_VALUE) *sk = (STACK_OF(ASN1_VALUE) *)*pval; |
176 |
✓✓ |
133748 |
for (i = 0; i < sk_ASN1_VALUE_num(sk); i++) { |
177 |
|
47362 |
ASN1_VALUE *vtmp; |
178 |
|
47362 |
vtmp = sk_ASN1_VALUE_value(sk, i); |
179 |
|
47362 |
asn1_item_combine_free(&vtmp, tt->item, |
180 |
|
|
0); |
181 |
|
47362 |
} |
182 |
|
19512 |
sk_ASN1_VALUE_free(sk); |
183 |
|
19512 |
*pval = NULL; |
184 |
|
19512 |
} else |
185 |
|
2164084 |
asn1_item_combine_free(pval, tt->item, |
186 |
|
1082042 |
tt->flags & ASN1_TFLG_COMBINE); |
187 |
|
1101554 |
} |
188 |
|
|
|
189 |
|
|
void |
190 |
|
|
ASN1_primitive_free(ASN1_VALUE **pval, const ASN1_ITEM *it) |
191 |
|
|
{ |
192 |
|
|
int utype; |
193 |
✓✓ |
1905714 |
if (it) { |
194 |
|
|
const ASN1_PRIMITIVE_FUNCS *pf; |
195 |
|
906519 |
pf = it->funcs; |
196 |
✓✓✓✗
|
917393 |
if (pf && pf->prim_free) { |
197 |
|
10874 |
pf->prim_free(pval, it); |
198 |
|
10874 |
return; |
199 |
|
|
} |
200 |
✓✓ |
895645 |
} |
201 |
|
|
/* Special case: if 'it' is NULL free contents of ASN1_TYPE */ |
202 |
✓✓ |
941983 |
if (!it) { |
203 |
|
46338 |
ASN1_TYPE *typ = (ASN1_TYPE *)*pval; |
204 |
|
46338 |
utype = typ->type; |
205 |
|
46338 |
pval = &typ->value.asn1_value; |
206 |
✓✓ |
46338 |
if (!*pval) |
207 |
|
43764 |
return; |
208 |
✓✓✓✓
|
898219 |
} else if (it->itype == ASN1_ITYPE_MSTRING) { |
209 |
|
|
utype = -1; |
210 |
✗✓ |
275570 |
if (!*pval) |
211 |
|
|
return; |
212 |
|
|
} else { |
213 |
|
620075 |
utype = it->utype; |
214 |
✓✓✗✓
|
1169470 |
if ((utype != V_ASN1_BOOLEAN) && !*pval) |
215 |
|
|
return; |
216 |
|
|
} |
217 |
|
|
|
218 |
✓✓✓✓ ✓ |
1725746 |
switch (utype) { |
219 |
|
|
case V_ASN1_OBJECT: |
220 |
|
345386 |
ASN1_OBJECT_free((ASN1_OBJECT *)*pval); |
221 |
|
345386 |
break; |
222 |
|
|
|
223 |
|
|
case V_ASN1_BOOLEAN: |
224 |
✓✗ |
70680 |
if (it) |
225 |
|
70680 |
*(ASN1_BOOLEAN *)pval = it->size; |
226 |
|
|
else |
227 |
|
|
*(ASN1_BOOLEAN *)pval = -1; |
228 |
|
70680 |
return; |
229 |
|
|
|
230 |
|
|
case V_ASN1_NULL: |
231 |
|
|
break; |
232 |
|
|
|
233 |
|
|
case V_ASN1_ANY: |
234 |
|
46338 |
ASN1_primitive_free(pval, NULL); |
235 |
|
46338 |
free(*pval); |
236 |
|
46338 |
break; |
237 |
|
|
|
238 |
|
|
default: |
239 |
|
435803 |
ASN1_STRING_free((ASN1_STRING *)*pval); |
240 |
|
435803 |
break; |
241 |
|
|
} |
242 |
|
827539 |
*pval = NULL; |
243 |
|
1780396 |
} |