Non puoi selezionare più di 25 argomenti Gli argomenti devono iniziare con una lettera o un numero, possono includere trattini ('-') e possono essere lunghi fino a 35 caratteri.
 
 
 
 
 
 

295 righe
11 KiB

  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. */
  57. /* ====================================================================
  58. * Copyright (c) 1998-2001 The OpenSSL Project. All rights reserved.
  59. *
  60. * Redistribution and use in source and binary forms, with or without
  61. * modification, are permitted provided that the following conditions
  62. * are met:
  63. *
  64. * 1. Redistributions of source code must retain the above copyright
  65. * notice, this list of conditions and the following disclaimer.
  66. *
  67. * 2. Redistributions in binary form must reproduce the above copyright
  68. * notice, this list of conditions and the following disclaimer in
  69. * the documentation and/or other materials provided with the
  70. * distribution.
  71. *
  72. * 3. All advertising materials mentioning features or use of this
  73. * software must display the following acknowledgment:
  74. * "This product includes software developed by the OpenSSL Project
  75. * for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
  76. *
  77. * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
  78. * endorse or promote products derived from this software without
  79. * prior written permission. For written permission, please contact
  80. * openssl-core@openssl.org.
  81. *
  82. * 5. Products derived from this software may not be called "OpenSSL"
  83. * nor may "OpenSSL" appear in their names without prior written
  84. * permission of the OpenSSL Project.
  85. *
  86. * 6. Redistributions of any form whatsoever must retain the following
  87. * acknowledgment:
  88. * "This product includes software developed by the OpenSSL Project
  89. * for use in the OpenSSL Toolkit (http://www.openssl.org/)"
  90. *
  91. * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
  92. * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  93. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  94. * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
  95. * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  96. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  97. * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  98. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  99. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  100. * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  101. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
  102. * OF THE POSSIBILITY OF SUCH DAMAGE.
  103. * ====================================================================
  104. *
  105. * This product includes cryptographic software written by Eric Young
  106. * (eay@cryptsoft.com). This product includes software written by Tim
  107. * Hudson (tjh@cryptsoft.com). */
  108. #include <openssl/ex_data.h>
  109. #include <assert.h>
  110. #include <string.h>
  111. #include <openssl/crypto.h>
  112. #include <openssl/err.h>
  113. #include <openssl/lhash.h>
  114. #include <openssl/mem.h>
  115. #include <openssl/stack.h>
  116. #include <openssl/thread.h>
  117. #include "internal.h"
  118. struct crypto_ex_data_func_st {
  119. long argl; /* Arbitary long */
  120. void *argp; /* Arbitary void pointer */
  121. CRYPTO_EX_free *free_func;
  122. CRYPTO_EX_dup *dup_func;
  123. };
  124. int CRYPTO_get_ex_new_index(CRYPTO_EX_DATA_CLASS *ex_data_class, int *out_index,
  125. long argl, void *argp, CRYPTO_EX_dup *dup_func,
  126. CRYPTO_EX_free *free_func) {
  127. CRYPTO_EX_DATA_FUNCS *funcs;
  128. int ret = 0;
  129. funcs = OPENSSL_malloc(sizeof(CRYPTO_EX_DATA_FUNCS));
  130. if (funcs == NULL) {
  131. OPENSSL_PUT_ERROR(CRYPTO, ERR_R_MALLOC_FAILURE);
  132. return 0;
  133. }
  134. funcs->argl = argl;
  135. funcs->argp = argp;
  136. funcs->dup_func = dup_func;
  137. funcs->free_func = free_func;
  138. CRYPTO_STATIC_MUTEX_lock_write(&ex_data_class->lock);
  139. if (ex_data_class->meth == NULL) {
  140. ex_data_class->meth = sk_CRYPTO_EX_DATA_FUNCS_new_null();
  141. }
  142. if (ex_data_class->meth == NULL ||
  143. !sk_CRYPTO_EX_DATA_FUNCS_push(ex_data_class->meth, funcs)) {
  144. OPENSSL_PUT_ERROR(CRYPTO, ERR_R_MALLOC_FAILURE);
  145. OPENSSL_free(funcs);
  146. goto err;
  147. }
  148. *out_index = sk_CRYPTO_EX_DATA_FUNCS_num(ex_data_class->meth) - 1 +
  149. ex_data_class->num_reserved;
  150. ret = 1;
  151. err:
  152. CRYPTO_STATIC_MUTEX_unlock(&ex_data_class->lock);
  153. return ret;
  154. }
  155. int CRYPTO_set_ex_data(CRYPTO_EX_DATA *ad, int index, void *val) {
  156. int n, i;
  157. if (ad->sk == NULL) {
  158. ad->sk = sk_void_new_null();
  159. if (ad->sk == NULL) {
  160. OPENSSL_PUT_ERROR(CRYPTO, ERR_R_MALLOC_FAILURE);
  161. return 0;
  162. }
  163. }
  164. n = sk_void_num(ad->sk);
  165. /* Add NULL values until the stack is long enough. */
  166. for (i = n; i <= index; i++) {
  167. if (!sk_void_push(ad->sk, NULL)) {
  168. OPENSSL_PUT_ERROR(CRYPTO, ERR_R_MALLOC_FAILURE);
  169. return 0;
  170. }
  171. }
  172. sk_void_set(ad->sk, index, val);
  173. return 1;
  174. }
  175. void *CRYPTO_get_ex_data(const CRYPTO_EX_DATA *ad, int idx) {
  176. if (ad->sk == NULL || idx < 0 || (size_t)idx >= sk_void_num(ad->sk)) {
  177. return NULL;
  178. }
  179. return sk_void_value(ad->sk, idx);
  180. }
  181. /* get_func_pointers takes a copy of the CRYPTO_EX_DATA_FUNCS pointers, if any,
  182. * for the given class. If there are some pointers, it sets |*out| to point to
  183. * a fresh stack of them. Otherwise it sets |*out| to NULL. It returns one on
  184. * success or zero on error. */
  185. static int get_func_pointers(STACK_OF(CRYPTO_EX_DATA_FUNCS) **out,
  186. CRYPTO_EX_DATA_CLASS *ex_data_class) {
  187. size_t n;
  188. *out = NULL;
  189. /* CRYPTO_EX_DATA_FUNCS structures are static once set, so we can take a
  190. * shallow copy of the list under lock and then use the structures without
  191. * the lock held. */
  192. CRYPTO_STATIC_MUTEX_lock_read(&ex_data_class->lock);
  193. n = sk_CRYPTO_EX_DATA_FUNCS_num(ex_data_class->meth);
  194. if (n > 0) {
  195. *out = sk_CRYPTO_EX_DATA_FUNCS_dup(ex_data_class->meth);
  196. }
  197. CRYPTO_STATIC_MUTEX_unlock(&ex_data_class->lock);
  198. if (n > 0 && *out == NULL) {
  199. OPENSSL_PUT_ERROR(CRYPTO, ERR_R_MALLOC_FAILURE);
  200. return 0;
  201. }
  202. return 1;
  203. }
  204. void CRYPTO_new_ex_data(CRYPTO_EX_DATA *ad) {
  205. ad->sk = NULL;
  206. }
  207. int CRYPTO_dup_ex_data(CRYPTO_EX_DATA_CLASS *ex_data_class, CRYPTO_EX_DATA *to,
  208. const CRYPTO_EX_DATA *from) {
  209. if (from->sk == NULL) {
  210. /* In this case, |from| is blank, which is also the initial state of |to|,
  211. * so there's nothing to do. */
  212. return 1;
  213. }
  214. STACK_OF(CRYPTO_EX_DATA_FUNCS) *func_pointers;
  215. if (!get_func_pointers(&func_pointers, ex_data_class)) {
  216. return 0;
  217. }
  218. size_t i;
  219. for (i = 0; i < sk_CRYPTO_EX_DATA_FUNCS_num(func_pointers); i++) {
  220. CRYPTO_EX_DATA_FUNCS *func_pointer =
  221. sk_CRYPTO_EX_DATA_FUNCS_value(func_pointers, i);
  222. void *ptr = CRYPTO_get_ex_data(from, i + ex_data_class->num_reserved);
  223. if (func_pointer->dup_func) {
  224. func_pointer->dup_func(to, from, &ptr, i + ex_data_class->num_reserved,
  225. func_pointer->argl, func_pointer->argp);
  226. }
  227. CRYPTO_set_ex_data(to, i + ex_data_class->num_reserved, ptr);
  228. }
  229. sk_CRYPTO_EX_DATA_FUNCS_free(func_pointers);
  230. return 1;
  231. }
  232. void CRYPTO_free_ex_data(CRYPTO_EX_DATA_CLASS *ex_data_class, void *obj,
  233. CRYPTO_EX_DATA *ad) {
  234. if (ad->sk == NULL) {
  235. /* Nothing to do. */
  236. return;
  237. }
  238. STACK_OF(CRYPTO_EX_DATA_FUNCS) *func_pointers;
  239. if (!get_func_pointers(&func_pointers, ex_data_class)) {
  240. /* TODO(davidben): This leaks memory on malloc error. */
  241. return;
  242. }
  243. size_t i;
  244. for (i = 0; i < sk_CRYPTO_EX_DATA_FUNCS_num(func_pointers); i++) {
  245. CRYPTO_EX_DATA_FUNCS *func_pointer =
  246. sk_CRYPTO_EX_DATA_FUNCS_value(func_pointers, i);
  247. if (func_pointer->free_func) {
  248. void *ptr = CRYPTO_get_ex_data(ad, i + ex_data_class->num_reserved);
  249. func_pointer->free_func(obj, ptr, ad, i + ex_data_class->num_reserved,
  250. func_pointer->argl, func_pointer->argp);
  251. }
  252. }
  253. sk_CRYPTO_EX_DATA_FUNCS_free(func_pointers);
  254. sk_void_free(ad->sk);
  255. ad->sk = NULL;
  256. }
  257. void CRYPTO_cleanup_all_ex_data(void) {}