You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244
  1. /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
  2. * All rights reserved.
  3. *
  4. * This package is an SSL implementation written
  5. * by Eric Young (eay@cryptsoft.com).
  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 (tjh@cryptsoft.com).
  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 (eay@cryptsoft.com)"
  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 (tjh@cryptsoft.com)"
  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. #include <openssl/asn1.h>
  57. #include <openssl/asn1t.h>
  58. #include <openssl/mem.h>
  59. #include "asn1_locl.h"
  60. /* Free up an ASN1 structure */
  61. void ASN1_item_free(ASN1_VALUE *val, const ASN1_ITEM *it)
  62. {
  63. asn1_item_combine_free(&val, it, 0);
  64. }
  65. void ASN1_item_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it)
  66. {
  67. asn1_item_combine_free(pval, it, 0);
  68. }
  69. void asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it, int combine)
  70. {
  71. const ASN1_TEMPLATE *tt = NULL, *seqtt;
  72. const ASN1_EXTERN_FUNCS *ef;
  73. const ASN1_COMPAT_FUNCS *cf;
  74. const ASN1_AUX *aux = it->funcs;
  75. ASN1_aux_cb *asn1_cb;
  76. int i;
  77. if (!pval)
  78. return;
  79. if ((it->itype != ASN1_ITYPE_PRIMITIVE) && !*pval)
  80. return;
  81. if (aux && aux->asn1_cb)
  82. asn1_cb = aux->asn1_cb;
  83. else
  84. asn1_cb = 0;
  85. switch (it->itype) {
  86. case ASN1_ITYPE_PRIMITIVE:
  87. if (it->templates)
  88. ASN1_template_free(pval, it->templates);
  89. else
  90. ASN1_primitive_free(pval, it);
  91. break;
  92. case ASN1_ITYPE_MSTRING:
  93. ASN1_primitive_free(pval, it);
  94. break;
  95. case ASN1_ITYPE_CHOICE:
  96. if (asn1_cb) {
  97. i = asn1_cb(ASN1_OP_FREE_PRE, pval, it, NULL);
  98. if (i == 2)
  99. return;
  100. }
  101. i = asn1_get_choice_selector(pval, it);
  102. if ((i >= 0) && (i < it->tcount)) {
  103. ASN1_VALUE **pchval;
  104. tt = it->templates + i;
  105. pchval = asn1_get_field_ptr(pval, tt);
  106. ASN1_template_free(pchval, tt);
  107. }
  108. if (asn1_cb)
  109. asn1_cb(ASN1_OP_FREE_POST, pval, it, NULL);
  110. if (!combine) {
  111. OPENSSL_free(*pval);
  112. *pval = NULL;
  113. }
  114. break;
  115. case ASN1_ITYPE_COMPAT:
  116. cf = it->funcs;
  117. if (cf && cf->asn1_free)
  118. cf->asn1_free(*pval);
  119. break;
  120. case ASN1_ITYPE_EXTERN:
  121. ef = it->funcs;
  122. if (ef && ef->asn1_ex_free)
  123. ef->asn1_ex_free(pval, it);
  124. break;
  125. case ASN1_ITYPE_NDEF_SEQUENCE:
  126. case ASN1_ITYPE_SEQUENCE:
  127. if (!asn1_refcount_dec_and_test_zero(pval, it))
  128. return;
  129. if (asn1_cb) {
  130. i = asn1_cb(ASN1_OP_FREE_PRE, pval, it, NULL);
  131. if (i == 2)
  132. return;
  133. }
  134. asn1_enc_free(pval, it);
  135. /*
  136. * If we free up as normal we will invalidate any ANY DEFINED BY
  137. * field and we wont be able to determine the type of the field it
  138. * defines. So free up in reverse order.
  139. */
  140. tt = it->templates + it->tcount - 1;
  141. for (i = 0; i < it->tcount; tt--, i++) {
  142. ASN1_VALUE **pseqval;
  143. seqtt = asn1_do_adb(pval, tt, 0);
  144. if (!seqtt)
  145. continue;
  146. pseqval = asn1_get_field_ptr(pval, seqtt);
  147. ASN1_template_free(pseqval, seqtt);
  148. }
  149. if (asn1_cb)
  150. asn1_cb(ASN1_OP_FREE_POST, pval, it, NULL);
  151. if (!combine) {
  152. OPENSSL_free(*pval);
  153. *pval = NULL;
  154. }
  155. break;
  156. }
  157. }
  158. void ASN1_template_free(ASN1_VALUE **pval, const ASN1_TEMPLATE *tt)
  159. {
  160. size_t i;
  161. if (tt->flags & ASN1_TFLG_SK_MASK) {
  162. STACK_OF(ASN1_VALUE) *sk = (STACK_OF(ASN1_VALUE) *)*pval;
  163. for (i = 0; i < sk_ASN1_VALUE_num(sk); i++) {
  164. ASN1_VALUE *vtmp;
  165. vtmp = sk_ASN1_VALUE_value(sk, i);
  166. asn1_item_combine_free(&vtmp, ASN1_ITEM_ptr(tt->item), 0);
  167. }
  168. sk_ASN1_VALUE_free(sk);
  169. *pval = NULL;
  170. } else
  171. asn1_item_combine_free(pval, ASN1_ITEM_ptr(tt->item),
  172. tt->flags & ASN1_TFLG_COMBINE);
  173. }
  174. void ASN1_primitive_free(ASN1_VALUE **pval, const ASN1_ITEM *it)
  175. {
  176. int utype;
  177. if (it) {
  178. const ASN1_PRIMITIVE_FUNCS *pf;
  179. pf = it->funcs;
  180. if (pf && pf->prim_free) {
  181. pf->prim_free(pval, it);
  182. return;
  183. }
  184. }
  185. /* Special case: if 'it' is NULL free contents of ASN1_TYPE */
  186. if (!it) {
  187. ASN1_TYPE *typ = (ASN1_TYPE *)*pval;
  188. utype = typ->type;
  189. pval = &typ->value.asn1_value;
  190. if (!*pval)
  191. return;
  192. } else if (it->itype == ASN1_ITYPE_MSTRING) {
  193. utype = -1;
  194. if (!*pval)
  195. return;
  196. } else {
  197. utype = it->utype;
  198. if ((utype != V_ASN1_BOOLEAN) && !*pval)
  199. return;
  200. }
  201. switch (utype) {
  202. case V_ASN1_OBJECT:
  203. ASN1_OBJECT_free((ASN1_OBJECT *)*pval);
  204. break;
  205. case V_ASN1_BOOLEAN:
  206. if (it)
  207. *(ASN1_BOOLEAN *)pval = it->size;
  208. else
  209. *(ASN1_BOOLEAN *)pval = -1;
  210. return;
  211. case V_ASN1_NULL:
  212. break;
  213. case V_ASN1_ANY:
  214. ASN1_primitive_free(pval, NULL);
  215. OPENSSL_free(*pval);
  216. break;
  217. default:
  218. ASN1_STRING_free((ASN1_STRING *)*pval);
  219. *pval = NULL;
  220. break;
  221. }
  222. *pval = NULL;
  223. }