1 /* $OpenBSD: tasn_fre.c,v 1.12 2014/07/10 12:24:25 tedu 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 asn1_item_combine_free(&val, it, 0); 74 } 75 76 void 77 ASN1_item_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it) 78 { 79 asn1_item_combine_free(pval, it, 0); 80 } 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 const ASN1_COMPAT_FUNCS *cf; 88 const ASN1_AUX *aux = it->funcs; 89 ASN1_aux_cb *asn1_cb; 90 int i; 91 92 if (pval == NULL || *pval == NULL) 93 return; 94 95 if (aux && aux->asn1_cb) 96 asn1_cb = aux->asn1_cb; 97 else 98 asn1_cb = 0; 99 100 switch (it->itype) { 101 case ASN1_ITYPE_PRIMITIVE: 102 if (it->templates) 103 ASN1_template_free(pval, it->templates); 104 else 105 ASN1_primitive_free(pval, it); 106 break; 107 108 case ASN1_ITYPE_MSTRING: 109 ASN1_primitive_free(pval, it); 110 break; 111 112 case ASN1_ITYPE_CHOICE: 113 if (asn1_cb) { 114 i = asn1_cb(ASN1_OP_FREE_PRE, pval, it, NULL); 115 if (i == 2) 116 return; 117 } 118 i = asn1_get_choice_selector(pval, it); 119 if ((i >= 0) && (i < it->tcount)) { 120 ASN1_VALUE **pchval; 121 tt = it->templates + i; 122 pchval = asn1_get_field_ptr(pval, tt); 123 ASN1_template_free(pchval, tt); 124 } 125 if (asn1_cb) 126 asn1_cb(ASN1_OP_FREE_POST, pval, it, NULL); 127 if (!combine) { 128 free(*pval); 129 *pval = NULL; 130 } 131 break; 132 133 case ASN1_ITYPE_COMPAT: 134 cf = it->funcs; 135 if (cf && cf->asn1_free) 136 cf->asn1_free(*pval); 137 break; 138 139 case ASN1_ITYPE_EXTERN: 140 ef = it->funcs; 141 if (ef && ef->asn1_ex_free) 142 ef->asn1_ex_free(pval, it); 143 break; 144 145 case ASN1_ITYPE_NDEF_SEQUENCE: 146 case ASN1_ITYPE_SEQUENCE: 147 if (asn1_do_lock(pval, -1, it) > 0) 148 return; 149 if (asn1_cb) { 150 i = asn1_cb(ASN1_OP_FREE_PRE, pval, it, NULL); 151 if (i == 2) 152 return; 153 } 154 asn1_enc_free(pval, it); 155 /* If we free up as normal we will invalidate any 156 * ANY DEFINED BY field and we wont be able to 157 * determine the type of the field it defines. So 158 * free up in reverse order. 159 */ 160 tt = it->templates + it->tcount - 1; 161 for (i = 0; i < it->tcount; tt--, i++) { 162 ASN1_VALUE **pseqval; 163 seqtt = asn1_do_adb(pval, tt, 0); 164 if (!seqtt) 165 continue; 166 pseqval = asn1_get_field_ptr(pval, seqtt); 167 ASN1_template_free(pseqval, seqtt); 168 } 169 if (asn1_cb) 170 asn1_cb(ASN1_OP_FREE_POST, pval, it, NULL); 171 if (!combine) { 172 free(*pval); 173 *pval = NULL; 174 } 175 break; 176 } 177 } 178 179 void 180 ASN1_template_free(ASN1_VALUE **pval, const ASN1_TEMPLATE *tt) 181 { 182 int i; 183 if (tt->flags & ASN1_TFLG_SK_MASK) { 184 STACK_OF(ASN1_VALUE) *sk = (STACK_OF(ASN1_VALUE) *)*pval; 185 for (i = 0; i < sk_ASN1_VALUE_num(sk); i++) { 186 ASN1_VALUE *vtmp; 187 vtmp = sk_ASN1_VALUE_value(sk, i); 188 asn1_item_combine_free(&vtmp, ASN1_ITEM_ptr(tt->item), 189 0); 190 } 191 sk_ASN1_VALUE_free(sk); 192 *pval = NULL; 193 } else 194 asn1_item_combine_free(pval, ASN1_ITEM_ptr(tt->item), 195 tt->flags & ASN1_TFLG_COMBINE); 196 } 197 198 void 199 ASN1_primitive_free(ASN1_VALUE **pval, const ASN1_ITEM *it) 200 { 201 int utype; 202 if (it) { 203 const ASN1_PRIMITIVE_FUNCS *pf; 204 pf = it->funcs; 205 if (pf && pf->prim_free) { 206 pf->prim_free(pval, it); 207 return; 208 } 209 } 210 /* Special case: if 'it' is NULL free contents of ASN1_TYPE */ 211 if (!it) { 212 ASN1_TYPE *typ = (ASN1_TYPE *)*pval; 213 utype = typ->type; 214 pval = &typ->value.asn1_value; 215 if (!*pval) 216 return; 217 } else if (it->itype == ASN1_ITYPE_MSTRING) { 218 utype = -1; 219 if (!*pval) 220 return; 221 } else { 222 utype = it->utype; 223 if ((utype != V_ASN1_BOOLEAN) && !*pval) 224 return; 225 } 226 227 switch (utype) { 228 case V_ASN1_OBJECT: 229 ASN1_OBJECT_free((ASN1_OBJECT *)*pval); 230 break; 231 232 case V_ASN1_BOOLEAN: 233 if (it) 234 *(ASN1_BOOLEAN *)pval = it->size; 235 else 236 *(ASN1_BOOLEAN *)pval = -1; 237 return; 238 239 case V_ASN1_NULL: 240 break; 241 242 case V_ASN1_ANY: 243 ASN1_primitive_free(pval, NULL); 244 free(*pval); 245 break; 246 247 default: 248 ASN1_STRING_free((ASN1_STRING *)*pval); 249 break; 250 } 251 *pval = NULL; 252 } 253