| 1 |
/* Copyright (C) 1995-1998 Eric Young ([email protected]) |
| 2 |
* All rights reserved. |
| 3 |
* |
| 4 |
* This package is an SSL implementation written |
| 5 |
* by Eric Young ([email protected]). |
| 6 |
* The implementation was written so as to conform with Netscapes SSL. |
| 7 |
* |
| 8 |
* This library is free for commercial and non-commercial use as long as |
| 9 |
* the following conditions are aheared to. The following conditions |
| 10 |
* apply to all code found in this distribution, be it the RC4, RSA, |
| 11 |
* lhash, DES, etc., code; not just the SSL code. The SSL documentation |
| 12 |
* included with this distribution is covered by the same copyright terms |
| 13 |
* except that the holder is Tim Hudson ([email protected]). |
| 14 |
* |
| 15 |
* Copyright remains Eric Young's, and as such any Copyright notices in |
| 16 |
* the code are not to be removed. |
| 17 |
* If this package is used in a product, Eric Young should be given attribution |
| 18 |
* as the author of the parts of the library used. |
| 19 |
* This can be in the form of a textual message at program startup or |
| 20 |
* in documentation (online or textual) provided with the package. |
| 21 |
* |
| 22 |
* Redistribution and use in source and binary forms, with or without |
| 23 |
* modification, are permitted provided that the following conditions |
| 24 |
* are met: |
| 25 |
* 1. Redistributions of source code must retain the copyright |
| 26 |
* notice, this list of conditions and the following disclaimer. |
| 27 |
* 2. Redistributions in binary form must reproduce the above copyright |
| 28 |
* notice, this list of conditions and the following disclaimer in the |
| 29 |
* documentation and/or other materials provided with the distribution. |
| 30 |
* 3. All advertising materials mentioning features or use of this software |
| 31 |
* must display the following acknowledgement: |
| 32 |
* "This product includes cryptographic software written by |
| 33 |
* Eric Young ([email protected])" |
| 34 |
* The word 'cryptographic' can be left out if the rouines from the library |
| 35 |
* being used are not cryptographic related :-). |
| 36 |
* 4. If you include any Windows specific code (or a derivative thereof) from |
| 37 |
* the apps directory (application code) you must include an acknowledgement: |
| 38 |
* "This product includes software written by Tim Hudson ([email protected])" |
| 39 |
* |
| 40 |
* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND |
| 41 |
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 42 |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 43 |
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE |
| 44 |
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 45 |
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 46 |
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 47 |
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 48 |
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 49 |
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 50 |
* SUCH DAMAGE. |
| 51 |
* |
| 52 |
* The licence and distribution terms for any publically available version or |
| 53 |
* derivative of this code cannot be changed. i.e. this code cannot simply be |
| 54 |
* copied and put under another distribution licence |
| 55 |
* [including the GNU Public Licence.] */ |
| 56 |
|
| 57 |
#include <openssl/asn1.h> |
| 58 |
|
| 59 |
#include <openssl/asn1t.h> |
| 60 |
#include <openssl/mem.h> |
| 61 |
|
| 62 |
static void asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it, |
| 63 |
int combine); |
| 64 |
|
| 65 |
/* Free up an ASN1 structure */ |
| 66 |
|
| 67 |
void ASN1_item_free(ASN1_VALUE *val, const ASN1_ITEM *it) |
| 68 |
{ |
| 69 |
asn1_item_combine_free(&val, it, 0); |
| 70 |
} |
| 71 |
|
| 72 |
void ASN1_item_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it) |
| 73 |
{ |
| 74 |
asn1_item_combine_free(pval, it, 0); |
| 75 |
} |
| 76 |
|
| 77 |
static void asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it, |
| 78 |
int combine) |
| 79 |
{ |
| 80 |
const ASN1_TEMPLATE *tt = NULL, *seqtt; |
| 81 |
const ASN1_EXTERN_FUNCS *ef; |
| 82 |
const ASN1_COMPAT_FUNCS *cf; |
| 83 |
const ASN1_AUX *aux = it->funcs; |
| 84 |
ASN1_aux_cb *asn1_cb; |
| 85 |
int i; |
| 86 |
if (!pval) |
| 87 |
return; |
| 88 |
if ((it->itype != ASN1_ITYPE_PRIMITIVE) && !*pval) |
| 89 |
return; |
| 90 |
if (aux && aux->asn1_cb) |
| 91 |
asn1_cb = aux->asn1_cb; |
| 92 |
else |
| 93 |
asn1_cb = 0; |
| 94 |
|
| 95 |
switch (it->itype) { |
| 96 |
|
| 97 |
case ASN1_ITYPE_PRIMITIVE: |
| 98 |
if (it->templates) |
| 99 |
ASN1_template_free(pval, it->templates); |
| 100 |
else |
| 101 |
ASN1_primitive_free(pval, it); |
| 102 |
break; |
| 103 |
|
| 104 |
case ASN1_ITYPE_MSTRING: |
| 105 |
ASN1_primitive_free(pval, it); |
| 106 |
break; |
| 107 |
|
| 108 |
case ASN1_ITYPE_CHOICE: |
| 109 |
if (asn1_cb) { |
| 110 |
i = asn1_cb(ASN1_OP_FREE_PRE, pval, it, NULL); |
| 111 |
if (i == 2) |
| 112 |
return; |
| 113 |
} |
| 114 |
i = asn1_get_choice_selector(pval, it); |
| 115 |
if ((i >= 0) && (i < it->tcount)) { |
| 116 |
ASN1_VALUE **pchval; |
| 117 |
tt = it->templates + i; |
| 118 |
pchval = asn1_get_field_ptr(pval, tt); |
| 119 |
ASN1_template_free(pchval, tt); |
| 120 |
} |
| 121 |
if (asn1_cb) |
| 122 |
asn1_cb(ASN1_OP_FREE_POST, pval, it, NULL); |
| 123 |
if (!combine) { |
| 124 |
OPENSSL_free(*pval); |
| 125 |
*pval = NULL; |
| 126 |
} |
| 127 |
break; |
| 128 |
|
| 129 |
case ASN1_ITYPE_COMPAT: |
| 130 |
cf = it->funcs; |
| 131 |
if (cf && cf->asn1_free) |
| 132 |
cf->asn1_free(*pval); |
| 133 |
break; |
| 134 |
|
| 135 |
case ASN1_ITYPE_EXTERN: |
| 136 |
ef = it->funcs; |
| 137 |
if (ef && ef->asn1_ex_free) |
| 138 |
ef->asn1_ex_free(pval, it); |
| 139 |
break; |
| 140 |
|
| 141 |
case ASN1_ITYPE_NDEF_SEQUENCE: |
| 142 |
case ASN1_ITYPE_SEQUENCE: |
| 143 |
if (!asn1_refcount_dec_and_test_zero(pval, it)) |
| 144 |
return; |
| 145 |
if (asn1_cb) { |
| 146 |
i = asn1_cb(ASN1_OP_FREE_PRE, pval, it, NULL); |
| 147 |
if (i == 2) |
| 148 |
return; |
| 149 |
} |
| 150 |
asn1_enc_free(pval, it); |
| 151 |
/* |
| 152 |
* If we free up as normal we will invalidate any ANY DEFINED BY |
| 153 |
* field and we wont be able to determine the type of the field it |
| 154 |
* defines. So free up in reverse order. |
| 155 |
*/ |
| 156 |
tt = it->templates + it->tcount - 1; |
| 157 |
for (i = 0; i < it->tcount; tt--, i++) { |
| 158 |
ASN1_VALUE **pseqval; |
| 159 |
seqtt = asn1_do_adb(pval, tt, 0); |
| 160 |
if (!seqtt) |
| 161 |
continue; |
| 162 |
pseqval = asn1_get_field_ptr(pval, seqtt); |
| 163 |
ASN1_template_free(pseqval, seqtt); |
| 164 |
} |
| 165 |
if (asn1_cb) |
| 166 |
asn1_cb(ASN1_OP_FREE_POST, pval, it, NULL); |
| 167 |
if (!combine) { |
| 168 |
OPENSSL_free(*pval); |
| 169 |
*pval = NULL; |
| 170 |
} |
| 171 |
break; |
| 172 |
} |
| 173 |
} |
| 174 |
|
| 175 |
void ASN1_template_free(ASN1_VALUE **pval, const ASN1_TEMPLATE *tt) |
| 176 |
{ |
| 177 |
size_t i; |
| 178 |
if (tt->flags & ASN1_TFLG_SK_MASK) { |
| 179 |
STACK_OF(ASN1_VALUE) *sk = (STACK_OF(ASN1_VALUE) *)*pval; |
| 180 |
for (i = 0; i < sk_ASN1_VALUE_num(sk); i++) { |
| 181 |
ASN1_VALUE *vtmp; |
| 182 |
vtmp = sk_ASN1_VALUE_value(sk, i); |
| 183 |
asn1_item_combine_free(&vtmp, ASN1_ITEM_ptr(tt->item), 0); |
| 184 |
} |
| 185 |
sk_ASN1_VALUE_free(sk); |
| 186 |
*pval = NULL; |
| 187 |
} else |
| 188 |
asn1_item_combine_free(pval, ASN1_ITEM_ptr(tt->item), |
| 189 |
tt->flags & ASN1_TFLG_COMBINE); |
| 190 |
} |
| 191 |
|
| 192 |
void ASN1_primitive_free(ASN1_VALUE **pval, const ASN1_ITEM *it) |
| 193 |
{ |
| 194 |
int utype; |
| 195 |
if (it) { |
| 196 |
const ASN1_PRIMITIVE_FUNCS *pf; |
| 197 |
pf = it->funcs; |
| 198 |
if (pf && pf->prim_free) { |
| 199 |
pf->prim_free(pval, it); |
| 200 |
return; |
| 201 |
} |
| 202 |
} |
| 203 |
/* Special case: if 'it' is NULL free contents of ASN1_TYPE */ |
| 204 |
if (!it) { |
| 205 |
ASN1_TYPE *typ = (ASN1_TYPE *)*pval; |
| 206 |
utype = typ->type; |
| 207 |
pval = &typ->value.asn1_value; |
| 208 |
if (!*pval) |
| 209 |
return; |
| 210 |
} else if (it->itype == ASN1_ITYPE_MSTRING) { |
| 211 |
utype = -1; |
| 212 |
if (!*pval) |
| 213 |
return; |
| 214 |
} else { |
| 215 |
utype = it->utype; |
| 216 |
if ((utype != V_ASN1_BOOLEAN) && !*pval) |
| 217 |
return; |
| 218 |
} |
| 219 |
|
| 220 |
switch (utype) { |
| 221 |
case V_ASN1_OBJECT: |
| 222 |
ASN1_OBJECT_free((ASN1_OBJECT *)*pval); |
| 223 |
break; |
| 224 |
|
| 225 |
case V_ASN1_BOOLEAN: |
| 226 |
if (it) |
| 227 |
*(ASN1_BOOLEAN *)pval = it->size; |
| 228 |
else |
| 229 |
*(ASN1_BOOLEAN *)pval = -1; |
| 230 |
return; |
| 231 |
|
| 232 |
case V_ASN1_NULL: |
| 233 |
break; |
| 234 |
|
| 235 |
case V_ASN1_ANY: |
| 236 |
ASN1_primitive_free(pval, NULL); |
| 237 |
OPENSSL_free(*pval); |
| 238 |
break; |
| 239 |
|
| 240 |
default: |
| 241 |
ASN1_STRING_free((ASN1_STRING *)*pval); |
| 242 |
*pval = NULL; |
| 243 |
break; |
| 244 |
} |
| 245 |
*pval = NULL; |
| 246 |
} |