]> git.ipfire.org Git - thirdparty/openssl.git/blame - crypto/property/property.c
Rename OPENSSL_CTX prefix to OSSL_LIB_CTX
[thirdparty/openssl.git] / crypto / property / property.c
CommitLineData
1bdbdaff 1/*
454afd98 2 * Copyright 2019-2020 The OpenSSL Project Authors. All Rights Reserved.
1bdbdaff
P
3 * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
4 *
5 * Licensed under the Apache License 2.0 (the "License"). You may not use
6 * this file except in compliance with the License. You can obtain a copy
7 * in the file LICENSE in the source distribution or at
8 * https://www.openssl.org/source/license.html
9 */
10
11#include <string.h>
12#include <stdio.h>
13#include <stdarg.h>
14#include <openssl/crypto.h>
15#include "internal/property.h"
25f2138b 16#include "crypto/ctype.h"
1bdbdaff
P
17#include <openssl/lhash.h>
18#include <openssl/rand.h>
19#include "internal/thread_once.h"
25f2138b
DMSP
20#include "crypto/lhash.h"
21#include "crypto/sparse_array.h"
706457b7 22#include "property_local.h"
1bdbdaff 23
e5ecfcc7
P
24/*
25 * The number of elements in the query cache before we initiate a flush.
26 * If reducing this, also ensure the stochastic test in test/property_test.c
27 * isn't likely to fail.
28 */
29#define IMPL_CACHE_FLUSH_THRESHOLD 500
bdbf2df2
P
30
31typedef struct {
32 void *method;
33 int (*up_ref)(void *);
34 void (*free)(void *);
35} METHOD;
1bdbdaff
P
36
37typedef struct {
c1d56231 38 const OSSL_PROVIDER *provider;
1bdbdaff 39 OSSL_PROPERTY_LIST *properties;
bdbf2df2 40 METHOD method;
1bdbdaff
P
41} IMPLEMENTATION;
42
43DEFINE_STACK_OF(IMPLEMENTATION)
44
45typedef struct {
46 const char *query;
bdbf2df2 47 METHOD method;
1bdbdaff
P
48 char body[1];
49} QUERY;
50
51DEFINE_LHASH_OF(QUERY);
52
53typedef struct {
54 int nid;
55 STACK_OF(IMPLEMENTATION) *impls;
56 LHASH_OF(QUERY) *cache;
57} ALGORITHM;
58
59struct ossl_method_store_st {
b4250010 60 OSSL_LIB_CTX *ctx;
1bdbdaff
P
61 size_t nelem;
62 SPARSE_ARRAY_OF(ALGORITHM) *algs;
1bdbdaff 63 int need_flush;
1bdbdaff
P
64 CRYPTO_RWLOCK *lock;
65};
66
67typedef struct {
1bdbdaff
P
68 LHASH_OF(QUERY) *cache;
69 size_t nelem;
f06cf3c4 70 uint32_t seed;
1bdbdaff
P
71} IMPL_CACHE_FLUSH;
72
73DEFINE_SPARSE_ARRAY_OF(ALGORITHM);
74
75static void ossl_method_cache_flush(OSSL_METHOD_STORE *store, int nid);
f9e504e8
P
76
77/* Global properties are stored per library context */
78static void ossl_ctx_global_properties_free(void *vstore)
79{
80 OSSL_PROPERTY_LIST **plp = vstore;
81
82 if (plp != NULL) {
83 ossl_property_free(*plp);
84 OPENSSL_free(plp);
85 }
86}
87
b4250010 88static void *ossl_ctx_global_properties_new(OSSL_LIB_CTX *ctx)
f9e504e8
P
89{
90 return OPENSSL_zalloc(sizeof(OSSL_PROPERTY_LIST **));
91}
92
93
b4250010 94static const OSSL_LIB_CTX_METHOD ossl_ctx_global_properties_method = {
f9e504e8
P
95 ossl_ctx_global_properties_new,
96 ossl_ctx_global_properties_free,
97};
98
b4250010 99OSSL_PROPERTY_LIST **ossl_ctx_global_properties(OSSL_LIB_CTX *libctx,
e6c54619 100 int loadconfig)
f9e504e8 101{
e6c54619
MC
102#ifndef FIPS_MODULE
103 if (loadconfig && !OPENSSL_init_crypto(OPENSSL_INIT_LOAD_CONFIG, NULL))
104 return NULL;
105#endif
b4250010
DMSP
106 return ossl_lib_ctx_get_data(libctx, OSSL_LIB_CTX_GLOBAL_PROPERTIES,
107 &ossl_ctx_global_properties_method);
f9e504e8 108}
1bdbdaff 109
bdbf2df2
P
110static int ossl_method_up_ref(METHOD *method)
111{
112 return (*method->up_ref)(method->method);
113}
114
115static void ossl_method_free(METHOD *method)
116{
117 (*method->free)(method->method);
118}
119
1bdbdaff
P
120int ossl_property_read_lock(OSSL_METHOD_STORE *p)
121{
122 return p != NULL ? CRYPTO_THREAD_read_lock(p->lock) : 0;
123}
124
125int ossl_property_write_lock(OSSL_METHOD_STORE *p)
126{
127 return p != NULL ? CRYPTO_THREAD_write_lock(p->lock) : 0;
128}
129
130int ossl_property_unlock(OSSL_METHOD_STORE *p)
131{
132 return p != 0 ? CRYPTO_THREAD_unlock(p->lock) : 0;
133}
134
1bdbdaff
P
135static unsigned long query_hash(const QUERY *a)
136{
137 return OPENSSL_LH_strhash(a->query);
138}
139
140static int query_cmp(const QUERY *a, const QUERY *b)
141{
142 return strcmp(a->query, b->query);
143}
144
145static void impl_free(IMPLEMENTATION *impl)
146{
147 if (impl != NULL) {
bdbf2df2 148 ossl_method_free(&impl->method);
1bdbdaff
P
149 OPENSSL_free(impl);
150 }
151}
152
153static void impl_cache_free(QUERY *elem)
154{
bdbf2df2
P
155 if (elem != NULL) {
156 ossl_method_free(&elem->method);
157 OPENSSL_free(elem);
158 }
1bdbdaff
P
159}
160
8ab53b19 161static void alg_cleanup(ossl_uintmax_t idx, ALGORITHM *a)
1bdbdaff
P
162{
163 if (a != NULL) {
164 sk_IMPLEMENTATION_pop_free(a->impls, &impl_free);
165 lh_QUERY_doall(a->cache, &impl_cache_free);
166 lh_QUERY_free(a->cache);
167 OPENSSL_free(a);
168 }
169}
170
1aedc35f 171/*
b4250010 172 * The OSSL_LIB_CTX param here allows access to underlying property data needed
1aedc35f
MC
173 * for computation
174 */
b4250010 175OSSL_METHOD_STORE *ossl_method_store_new(OSSL_LIB_CTX *ctx)
1bdbdaff 176{
909f2e59 177 OSSL_METHOD_STORE *res;
1bdbdaff 178
909f2e59 179 res = OPENSSL_zalloc(sizeof(*res));
1bdbdaff 180 if (res != NULL) {
1aedc35f 181 res->ctx = ctx;
1bdbdaff
P
182 if ((res->algs = ossl_sa_ALGORITHM_new()) == NULL) {
183 OPENSSL_free(res);
184 return NULL;
185 }
186 if ((res->lock = CRYPTO_THREAD_lock_new()) == NULL) {
bdbf2df2 187 ossl_sa_ALGORITHM_free(res->algs);
1bdbdaff
P
188 OPENSSL_free(res);
189 return NULL;
190 }
191 }
192 return res;
193}
194
195void ossl_method_store_free(OSSL_METHOD_STORE *store)
196{
197 if (store != NULL) {
198 ossl_sa_ALGORITHM_doall(store->algs, &alg_cleanup);
199 ossl_sa_ALGORITHM_free(store->algs);
1bdbdaff
P
200 CRYPTO_THREAD_lock_free(store->lock);
201 OPENSSL_free(store);
202 }
203}
204
205static ALGORITHM *ossl_method_store_retrieve(OSSL_METHOD_STORE *store, int nid)
206{
207 return ossl_sa_ALGORITHM_get(store->algs, nid);
208}
209
210static int ossl_method_store_insert(OSSL_METHOD_STORE *store, ALGORITHM *alg)
211{
212 return ossl_sa_ALGORITHM_set(store->algs, alg->nid, alg);
213}
214
c1d56231 215int ossl_method_store_add(OSSL_METHOD_STORE *store, const OSSL_PROVIDER *prov,
b1d40ddf
RL
216 int nid, const char *properties, void *method,
217 int (*method_up_ref)(void *),
218 void (*method_destruct)(void *))
1bdbdaff
P
219{
220 ALGORITHM *alg = NULL;
221 IMPLEMENTATION *impl;
222 int ret = 0;
c1d56231 223 int i;
1bdbdaff 224
0a79572a 225 if (nid <= 0 || method == NULL || store == NULL)
1bdbdaff
P
226 return 0;
227 if (properties == NULL)
228 properties = "";
229
230 /* Create new entry */
231 impl = OPENSSL_malloc(sizeof(*impl));
232 if (impl == NULL)
233 return 0;
bdbf2df2
P
234 impl->method.method = method;
235 impl->method.up_ref = method_up_ref;
236 impl->method.free = method_destruct;
237 if (!ossl_method_up_ref(&impl->method)) {
c1d56231 238 OPENSSL_free(impl);
b1d40ddf 239 return 0;
c1d56231
RL
240 }
241 impl->provider = prov;
1bdbdaff
P
242
243 /*
244 * Insert into the hash table if required.
245 *
246 * A write lock is used unconditionally because we wend our way down to the
247 * property string code which isn't locking friendly.
248 */
249 ossl_property_write_lock(store);
250 ossl_method_cache_flush(store, nid);
1aedc35f
MC
251 if ((impl->properties = ossl_prop_defn_get(store->ctx, properties)) == NULL) {
252 impl->properties = ossl_parse_property(store->ctx, properties);
253 if (impl->properties == NULL)
1bdbdaff 254 goto err;
1aedc35f 255 ossl_prop_defn_set(store->ctx, properties, impl->properties);
1bdbdaff
P
256 }
257
258 alg = ossl_method_store_retrieve(store, nid);
259 if (alg == NULL) {
260 if ((alg = OPENSSL_zalloc(sizeof(*alg))) == NULL
261 || (alg->impls = sk_IMPLEMENTATION_new_null()) == NULL
262 || (alg->cache = lh_QUERY_new(&query_hash, &query_cmp)) == NULL)
263 goto err;
264 alg->nid = nid;
265 if (!ossl_method_store_insert(store, alg))
266 goto err;
267 }
268
c1d56231
RL
269 /* Push onto stack if there isn't one there already */
270 for (i = 0; i < sk_IMPLEMENTATION_num(alg->impls); i++) {
271 const IMPLEMENTATION *tmpimpl = sk_IMPLEMENTATION_value(alg->impls, i);
272
273 if (tmpimpl->provider == impl->provider
274 && tmpimpl->properties == impl->properties)
275 break;
276 }
277 if (i == sk_IMPLEMENTATION_num(alg->impls)
278 && sk_IMPLEMENTATION_push(alg->impls, impl))
1bdbdaff
P
279 ret = 1;
280 ossl_property_unlock(store);
281 if (ret == 0)
282 impl_free(impl);
283 return ret;
284
285err:
286 ossl_property_unlock(store);
287 alg_cleanup(0, alg);
288 impl_free(impl);
289 return 0;
290}
291
292int ossl_method_store_remove(OSSL_METHOD_STORE *store, int nid,
0a79572a 293 const void *method)
1bdbdaff
P
294{
295 ALGORITHM *alg = NULL;
296 int i;
297
0a79572a 298 if (nid <= 0 || method == NULL || store == NULL)
1bdbdaff
P
299 return 0;
300
301 ossl_property_write_lock(store);
302 ossl_method_cache_flush(store, nid);
303 alg = ossl_method_store_retrieve(store, nid);
304 if (alg == NULL) {
305 ossl_property_unlock(store);
306 return 0;
307 }
308
309 /*
310 * A sorting find then a delete could be faster but these stacks should be
311 * relatively small, so we avoid the overhead. Sorting could also surprise
312 * users when result orderings change (even though they are not guaranteed).
313 */
314 for (i = 0; i < sk_IMPLEMENTATION_num(alg->impls); i++) {
315 IMPLEMENTATION *impl = sk_IMPLEMENTATION_value(alg->impls, i);
316
bdbf2df2
P
317 if (impl->method.method == method) {
318 impl_free(impl);
225c9660 319 (void)sk_IMPLEMENTATION_delete(alg->impls, i);
1bdbdaff 320 ossl_property_unlock(store);
1bdbdaff
P
321 return 1;
322 }
323 }
324 ossl_property_unlock(store);
325 return 0;
326}
327
328int ossl_method_store_fetch(OSSL_METHOD_STORE *store, int nid,
f9e504e8
P
329 const char *prop_query,
330 void **method)
1bdbdaff 331{
6f924bb8 332 OSSL_PROPERTY_LIST **plp;
1bdbdaff
P
333 ALGORITHM *alg;
334 IMPLEMENTATION *impl;
f9e504e8 335 OSSL_PROPERTY_LIST *pq = NULL, *p2 = NULL;
bdbf2df2 336 METHOD *best_method = NULL;
1bdbdaff 337 int ret = 0;
da89ac0b 338 int j, best = -1, score, optional;
1bdbdaff 339
f844f9eb 340#ifndef FIPS_MODULE
29dc6e00
MC
341 OPENSSL_init_crypto(OPENSSL_INIT_LOAD_CONFIG, NULL);
342#endif
343
0a79572a 344 if (nid <= 0 || method == NULL || store == NULL)
1bdbdaff
P
345 return 0;
346
347 /*
348 * This only needs to be a read lock, because queries never create property
349 * names or value and thus don't modify any of the property string layer.
350 */
351 ossl_property_read_lock(store);
352 alg = ossl_method_store_retrieve(store, nid);
353 if (alg == NULL) {
354 ossl_property_unlock(store);
355 return 0;
356 }
357
6f924bb8 358 if (prop_query != NULL)
f9e504e8 359 p2 = pq = ossl_parse_query(store->ctx, prop_query);
e6c54619 360 plp = ossl_ctx_global_properties(store->ctx, 1);
f9e504e8
P
361 if (plp != NULL && *plp != NULL) {
362 if (pq == NULL) {
363 pq = *plp;
364 } else {
365 p2 = ossl_property_merge(pq, *plp);
84ba665d 366 ossl_property_free(pq);
f9e504e8
P
367 if (p2 == NULL)
368 goto fin;
f9e504e8
P
369 pq = p2;
370 }
371 }
372
373 if (pq == NULL) {
1bdbdaff 374 if ((impl = sk_IMPLEMENTATION_value(alg->impls, 0)) != NULL) {
bdbf2df2 375 best_method = &impl->method;
1bdbdaff
P
376 ret = 1;
377 }
378 goto fin;
379 }
da89ac0b 380 optional = ossl_property_has_optional(pq);
1bdbdaff
P
381 for (j = 0; j < sk_IMPLEMENTATION_num(alg->impls); j++) {
382 impl = sk_IMPLEMENTATION_value(alg->impls, j);
da89ac0b
P
383 score = ossl_property_match_count(pq, impl->properties);
384 if (score > best) {
bdbf2df2
P
385 best_method = &impl->method;
386 best = score;
1bdbdaff 387 ret = 1;
da89ac0b
P
388 if (!optional)
389 goto fin;
1bdbdaff
P
390 }
391 }
392fin:
bdbf2df2
P
393 if (ret && ossl_method_up_ref(best_method))
394 *method = best_method->method;
395 else
396 ret = 0;
1bdbdaff 397 ossl_property_unlock(store);
f9e504e8 398 ossl_property_free(p2);
1bdbdaff
P
399 return ret;
400}
401
04cb5ec0 402static void impl_cache_flush_alg(ossl_uintmax_t idx, ALGORITHM *alg, void *arg)
1bdbdaff 403{
04cb5ec0
SL
404 SPARSE_ARRAY_OF(ALGORITHM) *algs = arg;
405
1bdbdaff 406 lh_QUERY_doall(alg->cache, &impl_cache_free);
04cb5ec0
SL
407 if (algs != NULL) {
408 sk_IMPLEMENTATION_pop_free(alg->impls, &impl_free);
409 lh_QUERY_free(alg->cache);
410 OPENSSL_free(alg);
411 ossl_sa_ALGORITHM_set(algs, idx, NULL);
412 } else {
413 lh_QUERY_flush(alg->cache);
414 }
1bdbdaff
P
415}
416
417static void ossl_method_cache_flush(OSSL_METHOD_STORE *store, int nid)
418{
419 ALGORITHM *alg = ossl_method_store_retrieve(store, nid);
420
421 if (alg != NULL) {
422 store->nelem -= lh_QUERY_num_items(alg->cache);
04cb5ec0 423 impl_cache_flush_alg(0, alg, NULL);
1bdbdaff
P
424 }
425}
426
04cb5ec0 427void ossl_method_store_flush_cache(OSSL_METHOD_STORE *store, int all)
1bdbdaff 428{
04cb5ec0
SL
429 void *arg = (all != 0 ? store->algs : NULL);
430
f9e504e8 431 ossl_property_write_lock(store);
04cb5ec0 432 ossl_sa_ALGORITHM_doall_arg(store->algs, &impl_cache_flush_alg, arg);
1bdbdaff 433 store->nelem = 0;
f9e504e8 434 ossl_property_unlock(store);
1bdbdaff
P
435}
436
437IMPLEMENT_LHASH_DOALL_ARG(QUERY, IMPL_CACHE_FLUSH);
438
439/*
440 * Flush an element from the query cache (perhaps).
441 *
f06cf3c4
P
442 * In order to avoid taking a write lock or using atomic operations
443 * to keep accurate least recently used (LRU) or least frequently used
444 * (LFU) information, the procedure used here is to stochastically
445 * flush approximately half the cache.
1bdbdaff 446 *
f06cf3c4
P
447 * This procedure isn't ideal, LRU or LFU would be better. However,
448 * in normal operation, reaching a full cache would be unexpected.
449 * It means that no steady state of algorithm queries has been reached.
450 * That is, it is most likely an attack of some form. A suboptimal clearance
451 * strategy that doesn't degrade performance of the normal case is
452 * preferable to a more refined approach that imposes a performance
453 * impact.
1bdbdaff
P
454 */
455static void impl_cache_flush_cache(QUERY *c, IMPL_CACHE_FLUSH *state)
456{
f06cf3c4
P
457 uint32_t n;
458
459 /*
460 * Implement the 32 bit xorshift as suggested by George Marsaglia in:
461 * https://doi.org/10.18637/jss.v008.i14
462 *
463 * This is a very fast PRNG so there is no need to extract bits one at a
464 * time and use the entire value each time.
465 */
466 n = state->seed;
467 n ^= n << 13;
468 n ^= n >> 17;
469 n ^= n << 5;
470 state->seed = n;
471
472 if ((n & 1) != 0)
bdbf2df2 473 impl_cache_free(lh_QUERY_delete(state->cache, c));
1bdbdaff
P
474 else
475 state->nelem++;
476}
477
8ab53b19
P
478static void impl_cache_flush_one_alg(ossl_uintmax_t idx, ALGORITHM *alg,
479 void *v)
1bdbdaff
P
480{
481 IMPL_CACHE_FLUSH *state = (IMPL_CACHE_FLUSH *)v;
482
483 state->cache = alg->cache;
484 lh_QUERY_doall_IMPL_CACHE_FLUSH(state->cache, &impl_cache_flush_cache,
485 state);
486}
487
488static void ossl_method_cache_flush_some(OSSL_METHOD_STORE *store)
489{
490 IMPL_CACHE_FLUSH state;
491
492 state.nelem = 0;
f06cf3c4
P
493 if ((state.seed = OPENSSL_rdtsc()) == 0)
494 state.seed = 1;
1bdbdaff 495 store->need_flush = 0;
e2e5abe4 496 ossl_sa_ALGORITHM_doall_arg(store->algs, &impl_cache_flush_one_alg, &state);
1bdbdaff
P
497 store->nelem = state.nelem;
498}
499
500int ossl_method_store_cache_get(OSSL_METHOD_STORE *store, int nid,
0a79572a 501 const char *prop_query, void **method)
1bdbdaff
P
502{
503 ALGORITHM *alg;
504 QUERY elem, *r;
bdbf2df2 505 int res = 0;
1bdbdaff
P
506
507 if (nid <= 0 || store == NULL)
508 return 0;
509
510 ossl_property_read_lock(store);
511 alg = ossl_method_store_retrieve(store, nid);
bdbf2df2
P
512 if (alg == NULL)
513 goto err;
1bdbdaff 514
1393722a 515 elem.query = prop_query != NULL ? prop_query : "";
1bdbdaff 516 r = lh_QUERY_retrieve(alg->cache, &elem);
bdbf2df2
P
517 if (r == NULL)
518 goto err;
519 if (ossl_method_up_ref(&r->method)) {
520 *method = r->method.method;
521 res = 1;
1bdbdaff 522 }
bdbf2df2 523err:
1bdbdaff 524 ossl_property_unlock(store);
bdbf2df2 525 return res;
1bdbdaff
P
526}
527
528int ossl_method_store_cache_set(OSSL_METHOD_STORE *store, int nid,
bdbf2df2
P
529 const char *prop_query, void *method,
530 int (*method_up_ref)(void *),
531 void (*method_destruct)(void *))
1bdbdaff
P
532{
533 QUERY elem, *old, *p = NULL;
534 ALGORITHM *alg;
535 size_t len;
bdbf2df2 536 int res = 1;
1bdbdaff
P
537
538 if (nid <= 0 || store == NULL)
539 return 0;
540 if (prop_query == NULL)
541 return 1;
542
543 ossl_property_write_lock(store);
544 if (store->need_flush)
545 ossl_method_cache_flush_some(store);
546 alg = ossl_method_store_retrieve(store, nid);
bdbf2df2
P
547 if (alg == NULL)
548 goto err;
1bdbdaff 549
0a79572a 550 if (method == NULL) {
1bdbdaff 551 elem.query = prop_query;
bdbf2df2
P
552 if ((old = lh_QUERY_delete(alg->cache, &elem)) != NULL) {
553 impl_cache_free(old);
f06cf3c4 554 store->nelem--;
bdbf2df2
P
555 }
556 goto end;
1bdbdaff
P
557 }
558 p = OPENSSL_malloc(sizeof(*p) + (len = strlen(prop_query)));
559 if (p != NULL) {
560 p->query = p->body;
bdbf2df2
P
561 p->method.method = method;
562 p->method.up_ref = method_up_ref;
563 p->method.free = method_destruct;
564 if (!ossl_method_up_ref(&p->method))
565 goto err;
1bdbdaff 566 memcpy((char *)p->query, prop_query, len + 1);
f06cf3c4 567 if ((old = lh_QUERY_insert(alg->cache, p)) != NULL) {
bdbf2df2
P
568 impl_cache_free(old);
569 goto end;
f06cf3c4
P
570 }
571 if (!lh_QUERY_error(alg->cache)) {
572 if (++store->nelem >= IMPL_CACHE_FLUSH_THRESHOLD)
1bdbdaff 573 store->need_flush = 1;
bdbf2df2 574 goto end;
1bdbdaff 575 }
bdbf2df2 576 ossl_method_free(&p->method);
1bdbdaff 577 }
bdbf2df2
P
578err:
579 res = 0;
defd3ed8 580 OPENSSL_free(p);
bdbf2df2
P
581end:
582 ossl_property_unlock(store);
583 return res;
1bdbdaff 584}