diff options
| author | cvs2svn <admin@example.com> | 2015-03-08 16:48:48 +0000 |
|---|---|---|
| committer | cvs2svn <admin@example.com> | 2015-03-08 16:48:48 +0000 |
| commit | da1a9ad3a4a867ba6569c05e6fca66d7f296c553 (patch) | |
| tree | 44872802e872bdfd60730fa9cf01d9d5751251c1 /src/lib/libcrypto/asn1/tasn_fre.c | |
| parent | 973703db67a8e73d70e63afa8f2cde19da09144d (diff) | |
| download | openbsd-OPENBSD_5_7_BASE.tar.gz openbsd-OPENBSD_5_7_BASE.tar.bz2 openbsd-OPENBSD_5_7_BASE.zip | |
This commit was manufactured by cvs2git to create tag 'OPENBSD_5_7_BASE'.OPENBSD_5_7_BASE
Diffstat (limited to 'src/lib/libcrypto/asn1/tasn_fre.c')
| -rw-r--r-- | src/lib/libcrypto/asn1/tasn_fre.c | 243 |
1 files changed, 0 insertions, 243 deletions
diff --git a/src/lib/libcrypto/asn1/tasn_fre.c b/src/lib/libcrypto/asn1/tasn_fre.c deleted file mode 100644 index 30d68786b1..0000000000 --- a/src/lib/libcrypto/asn1/tasn_fre.c +++ /dev/null | |||
| @@ -1,243 +0,0 @@ | |||
| 1 | /* $OpenBSD: tasn_fre.c,v 1.14 2015/02/14 15:23:57 miod 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_AUX *aux = it->funcs; | ||
| 88 | ASN1_aux_cb *asn1_cb = NULL; | ||
| 89 | int i; | ||
| 90 | |||
| 91 | if (pval == NULL || *pval == NULL) | ||
| 92 | return; | ||
| 93 | |||
| 94 | if (aux != NULL && aux->asn1_cb != NULL) | ||
| 95 | asn1_cb = aux->asn1_cb; | ||
| 96 | |||
| 97 | switch (it->itype) { | ||
| 98 | case ASN1_ITYPE_PRIMITIVE: | ||
| 99 | if (it->templates) | ||
| 100 | ASN1_template_free(pval, it->templates); | ||
| 101 | else | ||
| 102 | ASN1_primitive_free(pval, it); | ||
| 103 | break; | ||
| 104 | |||
| 105 | case ASN1_ITYPE_MSTRING: | ||
| 106 | ASN1_primitive_free(pval, it); | ||
| 107 | break; | ||
| 108 | |||
| 109 | case ASN1_ITYPE_CHOICE: | ||
| 110 | if (asn1_cb) { | ||
| 111 | i = asn1_cb(ASN1_OP_FREE_PRE, pval, it, NULL); | ||
| 112 | if (i == 2) | ||
| 113 | return; | ||
| 114 | } | ||
| 115 | i = asn1_get_choice_selector(pval, it); | ||
| 116 | if ((i >= 0) && (i < it->tcount)) { | ||
| 117 | ASN1_VALUE **pchval; | ||
| 118 | tt = it->templates + i; | ||
| 119 | pchval = asn1_get_field_ptr(pval, tt); | ||
| 120 | ASN1_template_free(pchval, tt); | ||
| 121 | } | ||
| 122 | if (asn1_cb) | ||
| 123 | asn1_cb(ASN1_OP_FREE_POST, pval, it, NULL); | ||
| 124 | if (!combine) { | ||
| 125 | free(*pval); | ||
| 126 | *pval = NULL; | ||
| 127 | } | ||
| 128 | break; | ||
| 129 | |||
| 130 | case ASN1_ITYPE_EXTERN: | ||
| 131 | ef = it->funcs; | ||
| 132 | if (ef && ef->asn1_ex_free) | ||
| 133 | ef->asn1_ex_free(pval, it); | ||
| 134 | break; | ||
| 135 | |||
| 136 | case ASN1_ITYPE_NDEF_SEQUENCE: | ||
| 137 | case ASN1_ITYPE_SEQUENCE: | ||
| 138 | if (asn1_do_lock(pval, -1, it) > 0) | ||
| 139 | return; | ||
| 140 | if (asn1_cb) { | ||
| 141 | i = asn1_cb(ASN1_OP_FREE_PRE, pval, it, NULL); | ||
| 142 | if (i == 2) | ||
| 143 | return; | ||
| 144 | } | ||
| 145 | 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 | tt = it->templates + it->tcount - 1; | ||
| 152 | for (i = 0; i < it->tcount; tt--, i++) { | ||
| 153 | ASN1_VALUE **pseqval; | ||
| 154 | seqtt = asn1_do_adb(pval, tt, 0); | ||
| 155 | if (!seqtt) | ||
| 156 | continue; | ||
| 157 | pseqval = asn1_get_field_ptr(pval, seqtt); | ||
| 158 | ASN1_template_free(pseqval, seqtt); | ||
| 159 | } | ||
| 160 | if (asn1_cb) | ||
| 161 | asn1_cb(ASN1_OP_FREE_POST, pval, it, NULL); | ||
| 162 | if (!combine) { | ||
| 163 | free(*pval); | ||
| 164 | *pval = NULL; | ||
| 165 | } | ||
| 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_combine_free(&vtmp, ASN1_ITEM_ptr(tt->item), | ||
| 180 | 0); | ||
| 181 | } | ||
| 182 | sk_ASN1_VALUE_free(sk); | ||
| 183 | *pval = NULL; | ||
| 184 | } else | ||
| 185 | asn1_item_combine_free(pval, ASN1_ITEM_ptr(tt->item), | ||
| 186 | tt->flags & ASN1_TFLG_COMBINE); | ||
| 187 | } | ||
| 188 | |||
| 189 | void | ||
| 190 | ASN1_primitive_free(ASN1_VALUE **pval, const ASN1_ITEM *it) | ||
| 191 | { | ||
| 192 | int utype; | ||
| 193 | if (it) { | ||
| 194 | const ASN1_PRIMITIVE_FUNCS *pf; | ||
| 195 | pf = it->funcs; | ||
| 196 | if (pf && pf->prim_free) { | ||
| 197 | pf->prim_free(pval, it); | ||
| 198 | return; | ||
| 199 | } | ||
| 200 | } | ||
| 201 | /* Special case: if 'it' is NULL free contents of ASN1_TYPE */ | ||
| 202 | if (!it) { | ||
| 203 | ASN1_TYPE *typ = (ASN1_TYPE *)*pval; | ||
| 204 | utype = typ->type; | ||
| 205 | pval = &typ->value.asn1_value; | ||
| 206 | if (!*pval) | ||
| 207 | return; | ||
| 208 | } else if (it->itype == ASN1_ITYPE_MSTRING) { | ||
| 209 | utype = -1; | ||
| 210 | if (!*pval) | ||
| 211 | return; | ||
| 212 | } else { | ||
| 213 | utype = it->utype; | ||
| 214 | if ((utype != V_ASN1_BOOLEAN) && !*pval) | ||
| 215 | return; | ||
| 216 | } | ||
| 217 | |||
| 218 | switch (utype) { | ||
| 219 | case V_ASN1_OBJECT: | ||
| 220 | ASN1_OBJECT_free((ASN1_OBJECT *)*pval); | ||
| 221 | break; | ||
| 222 | |||
| 223 | case V_ASN1_BOOLEAN: | ||
| 224 | if (it) | ||
| 225 | *(ASN1_BOOLEAN *)pval = it->size; | ||
| 226 | else | ||
| 227 | *(ASN1_BOOLEAN *)pval = -1; | ||
| 228 | return; | ||
| 229 | |||
| 230 | case V_ASN1_NULL: | ||
| 231 | break; | ||
| 232 | |||
| 233 | case V_ASN1_ANY: | ||
| 234 | ASN1_primitive_free(pval, NULL); | ||
| 235 | free(*pval); | ||
| 236 | break; | ||
| 237 | |||
| 238 | default: | ||
| 239 | ASN1_STRING_free((ASN1_STRING *)*pval); | ||
| 240 | break; | ||
| 241 | } | ||
| 242 | *pval = NULL; | ||
| 243 | } | ||
