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