Nelze vybrat více než 25 témat Téma musí začínat písmenem nebo číslem, může obsahovat pomlčky („-“) a může být dlouhé až 35 znaků.

ex_data_impl.c 13 KiB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400
  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 <openssl/err.h>
  111. #include <openssl/lhash.h>
  112. #include <openssl/mem.h>
  113. #include <openssl/stack.h>
  114. #include <openssl/thread.h>
  115. #include "crypto_error.h"
  116. #include "internal.h"
  117. typedef struct crypto_ex_data_func_st {
  118. long argl; /* Arbitary long */
  119. void *argp; /* Arbitary void pointer */
  120. CRYPTO_EX_new *new_func;
  121. CRYPTO_EX_free *free_func;
  122. CRYPTO_EX_dup *dup_func;
  123. } CRYPTO_EX_DATA_FUNCS;
  124. typedef struct st_ex_class_item {
  125. STACK_OF(CRYPTO_EX_DATA_FUNCS) *meth;
  126. int class_value;
  127. /* TODO(fork): isn't |meth_num| just the length of |meth|? */
  128. int meth_num;
  129. } EX_CLASS_ITEM;
  130. static LHASH_OF(EX_CLASS_ITEM) *global_classes = NULL;
  131. static int global_next_class = 100;
  132. static int new_class(void) {
  133. int ret;
  134. CRYPTO_w_lock(CRYPTO_LOCK_EX_DATA);
  135. ret = global_next_class++;
  136. CRYPTO_w_unlock(CRYPTO_LOCK_EX_DATA);
  137. return ret;
  138. }
  139. /* class_hash is a hash function used by an LHASH of |EX_CLASS_ITEM|
  140. * structures. */
  141. static uint32_t class_hash(const EX_CLASS_ITEM *a) {
  142. return a->class_value;
  143. }
  144. /* class_cmp is a comparision function for an LHASH of |EX_CLASS_ITEM|
  145. * structures. */
  146. static int class_cmp(const EX_CLASS_ITEM *a, const EX_CLASS_ITEM *b) {
  147. return a->class_value - b->class_value;
  148. }
  149. /* data_funcs_free is a callback function from |sk_pop_free| that frees a
  150. * |CRYPTO_EX_DATA_FUNCS|. */
  151. static void data_funcs_free(CRYPTO_EX_DATA_FUNCS *funcs) {
  152. OPENSSL_free(funcs);
  153. }
  154. /* class_free is a callback function from lh_doall to free the EX_CLASS_ITEM
  155. * structures. */
  156. static void class_free(EX_CLASS_ITEM *item) {
  157. sk_CRYPTO_EX_DATA_FUNCS_pop_free(item->meth, data_funcs_free);
  158. }
  159. static LHASH_OF(EX_CLASS_ITEM) *get_classes() {
  160. LHASH_OF(EX_CLASS_ITEM) *ret;
  161. CRYPTO_r_lock(CRYPTO_LOCK_EX_DATA);
  162. ret = global_classes;
  163. CRYPTO_r_unlock(CRYPTO_LOCK_EX_DATA);
  164. if (ret != NULL) {
  165. return ret;
  166. }
  167. CRYPTO_w_lock(CRYPTO_LOCK_EX_DATA);
  168. if (global_classes == NULL) {
  169. global_classes = lh_EX_CLASS_ITEM_new(class_hash, class_cmp);
  170. }
  171. ret = global_classes;
  172. CRYPTO_w_unlock(CRYPTO_LOCK_EX_DATA);
  173. return ret;
  174. }
  175. static void cleanup(void) {
  176. LHASH_OF(EX_CLASS_ITEM) *classes = get_classes();
  177. lh_EX_CLASS_ITEM_doall(classes, class_free);
  178. lh_EX_CLASS_ITEM_free(classes);
  179. global_classes = NULL;
  180. }
  181. static EX_CLASS_ITEM *get_class(int class_value) {
  182. LHASH_OF(EX_CLASS_ITEM) *const classes = get_classes();
  183. EX_CLASS_ITEM template, *class_item;
  184. int ok = 0;
  185. CRYPTO_w_lock(CRYPTO_LOCK_EX_DATA);
  186. template.class_value = class_value;
  187. class_item = lh_EX_CLASS_ITEM_retrieve(classes, &template);
  188. if (class_item != NULL) {
  189. ok = 1;
  190. } else {
  191. class_item = OPENSSL_malloc(sizeof(EX_CLASS_ITEM));
  192. if (class_item) {
  193. class_item->class_value = class_value;
  194. class_item->meth_num = 0;
  195. class_item->meth = sk_CRYPTO_EX_DATA_FUNCS_new_null();
  196. if (class_item->meth != NULL) {
  197. EX_CLASS_ITEM *old_data;
  198. ok = lh_EX_CLASS_ITEM_insert(classes, &old_data, class_item);
  199. assert(old_data == NULL);
  200. }
  201. }
  202. }
  203. CRYPTO_w_unlock(CRYPTO_LOCK_EX_DATA);
  204. if (!ok) {
  205. if (class_item) {
  206. if (class_item->meth) {
  207. sk_CRYPTO_EX_DATA_FUNCS_free(class_item->meth);
  208. }
  209. OPENSSL_free(class_item);
  210. class_item = NULL;
  211. }
  212. OPENSSL_PUT_ERROR(CRYPTO, get_class, ERR_R_MALLOC_FAILURE);
  213. }
  214. return class_item;
  215. }
  216. static int get_new_index(int class_value, long argl, void *argp,
  217. CRYPTO_EX_new *new_func, CRYPTO_EX_dup *dup_func,
  218. CRYPTO_EX_free *free_func) {
  219. EX_CLASS_ITEM *const item = get_class(class_value);
  220. CRYPTO_EX_DATA_FUNCS *funcs;
  221. int ret = -1;
  222. if (!item) {
  223. return -1;
  224. }
  225. funcs = OPENSSL_malloc(sizeof(CRYPTO_EX_DATA_FUNCS));
  226. if (funcs == NULL) {
  227. OPENSSL_PUT_ERROR(CRYPTO, get_new_index, ERR_R_MALLOC_FAILURE);
  228. return -1;
  229. }
  230. funcs->argl = argl;
  231. funcs->argp = argp;
  232. funcs->new_func = new_func;
  233. funcs->dup_func = dup_func;
  234. funcs->free_func = free_func;
  235. CRYPTO_w_lock(CRYPTO_LOCK_EX_DATA);
  236. /* TODO(fork): this loop appears to only ever run once. */
  237. while (sk_CRYPTO_EX_DATA_FUNCS_num(item->meth) <= item->meth_num) {
  238. if (!sk_CRYPTO_EX_DATA_FUNCS_push(item->meth, NULL)) {
  239. OPENSSL_PUT_ERROR(CRYPTO, get_new_index, ERR_R_MALLOC_FAILURE);
  240. OPENSSL_free(funcs);
  241. goto err;
  242. }
  243. }
  244. ret = item->meth_num++;
  245. (void)sk_CRYPTO_EX_DATA_FUNCS_set(item->meth, ret, funcs);
  246. err:
  247. CRYPTO_w_unlock(CRYPTO_LOCK_EX_DATA);
  248. return ret;
  249. }
  250. /* get_func_pointers takes a copy of the CRYPTO_EX_DATA_FUNCS pointers, if any,
  251. * for the given class. If there are some pointers, it sets |*out| to point to
  252. * a fresh stack of them. Otherwise it sets |*out| to NULL. It returns one on
  253. * success or zero on error. */
  254. static int get_func_pointers(STACK_OF(CRYPTO_EX_DATA_FUNCS) **out,
  255. int class_value) {
  256. EX_CLASS_ITEM *const item = get_class(class_value);
  257. size_t n;
  258. if (!item) {
  259. return 0;
  260. }
  261. *out = NULL;
  262. /* CRYPTO_EX_DATA_FUNCS structures are static once set, so we can take a
  263. * shallow copy of the list under lock and then use the structures without
  264. * the lock held. */
  265. CRYPTO_r_lock(CRYPTO_LOCK_EX_DATA);
  266. n = sk_CRYPTO_EX_DATA_FUNCS_num(item->meth);
  267. if (n > 0) {
  268. *out = sk_CRYPTO_EX_DATA_FUNCS_dup(item->meth);
  269. }
  270. CRYPTO_r_unlock(CRYPTO_LOCK_EX_DATA);
  271. if (n > 0 && *out == NULL) {
  272. OPENSSL_PUT_ERROR(CRYPTO, get_func_pointers, ERR_R_MALLOC_FAILURE);
  273. return 0;
  274. }
  275. return 1;
  276. }
  277. static int new_ex_data(int class_value, void *obj, CRYPTO_EX_DATA *ad) {
  278. STACK_OF(CRYPTO_EX_DATA_FUNCS) *func_pointers;
  279. size_t i;
  280. ad->sk = NULL;
  281. if (!get_func_pointers(&func_pointers, class_value)) {
  282. return 0;
  283. }
  284. for (i = 0; i < sk_CRYPTO_EX_DATA_FUNCS_num(func_pointers); i++) {
  285. CRYPTO_EX_DATA_FUNCS *func_pointer =
  286. sk_CRYPTO_EX_DATA_FUNCS_value(func_pointers, i);
  287. if (func_pointer->new_func) {
  288. func_pointer->new_func(obj, NULL, ad, i, func_pointer->argl,
  289. func_pointer->argp);
  290. }
  291. }
  292. sk_CRYPTO_EX_DATA_FUNCS_free(func_pointers);
  293. return 1;
  294. }
  295. static int dup_ex_data(int class_value, CRYPTO_EX_DATA *to,
  296. const CRYPTO_EX_DATA *from) {
  297. STACK_OF(CRYPTO_EX_DATA_FUNCS) *func_pointers;
  298. size_t i;
  299. if (!from->sk) {
  300. /* In this case, |from| is blank, which is also the initial state of |to|,
  301. * so there's nothing to do. */
  302. return 1;
  303. }
  304. if (!get_func_pointers(&func_pointers, class_value)) {
  305. return 0;
  306. }
  307. for (i = 0; i < sk_CRYPTO_EX_DATA_FUNCS_num(func_pointers); i++) {
  308. CRYPTO_EX_DATA_FUNCS *func_pointer =
  309. sk_CRYPTO_EX_DATA_FUNCS_value(func_pointers, i);
  310. void *ptr = CRYPTO_get_ex_data(from, i);
  311. if (func_pointer->dup_func) {
  312. func_pointer->dup_func(to, from, &ptr, i, func_pointer->argl,
  313. func_pointer->argp);
  314. }
  315. CRYPTO_set_ex_data(to, i, ptr);
  316. }
  317. sk_CRYPTO_EX_DATA_FUNCS_free(func_pointers);
  318. return 1;
  319. }
  320. static void free_ex_data(int class_value, void *obj, CRYPTO_EX_DATA *ad) {
  321. STACK_OF(CRYPTO_EX_DATA_FUNCS) *func_pointers;
  322. size_t i;
  323. if (!get_func_pointers(&func_pointers, class_value)) {
  324. return;
  325. }
  326. for (i = 0; i < sk_CRYPTO_EX_DATA_FUNCS_num(func_pointers); i++) {
  327. CRYPTO_EX_DATA_FUNCS *func_pointer =
  328. sk_CRYPTO_EX_DATA_FUNCS_value(func_pointers, i);
  329. if (func_pointer->free_func) {
  330. void *ptr = CRYPTO_get_ex_data(ad, i);
  331. func_pointer->free_func(obj, ptr, ad, i, func_pointer->argl,
  332. func_pointer->argp);
  333. }
  334. }
  335. sk_CRYPTO_EX_DATA_FUNCS_free(func_pointers);
  336. if (ad->sk) {
  337. sk_void_free(ad->sk);
  338. ad->sk = NULL;
  339. }
  340. }
  341. const CRYPTO_EX_DATA_IMPL ex_data_default_impl = {
  342. new_class, cleanup, get_new_index, new_ex_data, dup_ex_data, free_ex_data};