summaryrefslogtreecommitdiff
path: root/src/lib/libcrypto/lhash
diff options
context:
space:
mode:
Diffstat (limited to 'src/lib/libcrypto/lhash')
-rw-r--r--src/lib/libcrypto/lhash/lhash.c433
-rw-r--r--src/lib/libcrypto/lhash/lhash.h179
2 files changed, 0 insertions, 612 deletions
diff --git a/src/lib/libcrypto/lhash/lhash.c b/src/lib/libcrypto/lhash/lhash.c
deleted file mode 100644
index aa532267de..0000000000
--- a/src/lib/libcrypto/lhash/lhash.c
+++ /dev/null
@@ -1,433 +0,0 @@
1/* $OpenBSD: lhash.c,v 1.28 2024/07/14 14:32:45 jsing Exp $ */
2/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
3 * All rights reserved.
4 *
5 * This package is an SSL implementation written
6 * by Eric Young (eay@cryptsoft.com).
7 * The implementation was written so as to conform with Netscapes SSL.
8 *
9 * This library is free for commercial and non-commercial use as long as
10 * the following conditions are aheared to. The following conditions
11 * apply to all code found in this distribution, be it the RC4, RSA,
12 * lhash, DES, etc., code; not just the SSL code. The SSL documentation
13 * included with this distribution is covered by the same copyright terms
14 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
15 *
16 * Copyright remains Eric Young's, and as such any Copyright notices in
17 * the code are not to be removed.
18 * If this package is used in a product, Eric Young should be given attribution
19 * as the author of the parts of the library used.
20 * This can be in the form of a textual message at program startup or
21 * in documentation (online or textual) provided with the package.
22 *
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
25 * are met:
26 * 1. Redistributions of source code must retain the copyright
27 * notice, this list of conditions and the following disclaimer.
28 * 2. Redistributions in binary form must reproduce the above copyright
29 * notice, this list of conditions and the following disclaimer in the
30 * documentation and/or other materials provided with the distribution.
31 * 3. All advertising materials mentioning features or use of this software
32 * must display the following acknowledgement:
33 * "This product includes cryptographic software written by
34 * Eric Young (eay@cryptsoft.com)"
35 * The word 'cryptographic' can be left out if the rouines from the library
36 * being used are not cryptographic related :-).
37 * 4. If you include any Windows specific code (or a derivative thereof) from
38 * the apps directory (application code) you must include an acknowledgement:
39 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
40 *
41 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
42 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
43 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
44 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
45 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
46 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
47 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
49 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
50 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
51 * SUCH DAMAGE.
52 *
53 * The licence and distribution terms for any publically available version or
54 * derivative of this code cannot be changed. i.e. this code cannot simply be
55 * copied and put under another distribution licence
56 * [including the GNU Public Licence.]
57 */
58
59#include <stdio.h>
60#include <string.h>
61#include <stdlib.h>
62
63#include <openssl/opensslconf.h>
64
65#include <openssl/crypto.h>
66#include <openssl/lhash.h>
67
68#undef MIN_NODES
69#define MIN_NODES 16
70#define UP_LOAD (2*LH_LOAD_MULT) /* load times 256 (default 2) */
71#define DOWN_LOAD (LH_LOAD_MULT) /* load times 256 (default 1) */
72
73typedef struct lhash_node_st {
74 void *data;
75 struct lhash_node_st *next;
76#ifndef OPENSSL_NO_HASH_COMP
77 unsigned long hash;
78#endif
79} LHASH_NODE;
80
81struct lhash_st {
82 LHASH_NODE **b;
83 LHASH_COMP_FN_TYPE comp;
84 LHASH_HASH_FN_TYPE hash;
85 unsigned int num_nodes;
86 unsigned int num_alloc_nodes;
87 unsigned int p;
88 unsigned int pmax;
89 unsigned long up_load; /* load times 256 */
90 unsigned long down_load; /* load times 256 */
91 unsigned long num_items;
92
93 int error;
94} /* _LHASH */;
95
96static void
97expand(_LHASH *lh)
98{
99 LHASH_NODE **n, **n1, **n2, *np;
100 unsigned int p, i, j;
101 unsigned long hash, nni;
102
103 lh->num_nodes++;
104 p = (int)lh->p++;
105 n1 = &(lh->b[p]);
106 n2 = &(lh->b[p + (int)lh->pmax]);
107 *n2 = NULL; /* 27/07/92 - eay - undefined pointer bug */
108 nni = lh->num_alloc_nodes;
109
110 for (np = *n1; np != NULL; ) {
111#ifndef OPENSSL_NO_HASH_COMP
112 hash = np->hash;
113#else
114 hash = lh->hash(np->data);
115#endif
116 if ((hash % nni) != p) { /* move it */
117 *n1 = (*n1)->next;
118 np->next= *n2;
119 *n2 = np;
120 } else
121 n1 = &((*n1)->next);
122 np= *n1;
123 }
124
125 if ((lh->p) >= lh->pmax) {
126 j = (int)lh->num_alloc_nodes * 2;
127 n = reallocarray(lh->b, j, sizeof(LHASH_NODE *));
128 if (n == NULL) {
129/* fputs("realloc error in lhash", stderr); */
130 lh->error++;
131 lh->p = 0;
132 return;
133 }
134 /* else */
135 for (i = (int)lh->num_alloc_nodes; i < j; i++)/* 26/02/92 eay */
136 n[i] = NULL; /* 02/03/92 eay */
137 lh->pmax = lh->num_alloc_nodes;
138 lh->num_alloc_nodes = j;
139 lh->p = 0;
140 lh->b = n;
141 }
142}
143
144static void
145contract(_LHASH *lh)
146{
147 LHASH_NODE **n, *n1, *np;
148
149 np = lh->b[lh->p + lh->pmax - 1];
150 lh->b[lh->p+lh->pmax - 1] = NULL; /* 24/07-92 - eay - weird but :-( */
151 if (lh->p == 0) {
152 n = reallocarray(lh->b, lh->pmax, sizeof(LHASH_NODE *));
153 if (n == NULL) {
154/* fputs("realloc error in lhash", stderr); */
155 lh->error++;
156 return;
157 }
158 lh->num_alloc_nodes /= 2;
159 lh->pmax /= 2;
160 lh->p = lh->pmax - 1;
161 lh->b = n;
162 } else
163 lh->p--;
164
165 lh->num_nodes--;
166
167 n1 = lh->b[(int)lh->p];
168 if (n1 == NULL)
169 lh->b[(int)lh->p] = np;
170 else {
171 while (n1->next != NULL)
172 n1 = n1->next;
173 n1->next = np;
174 }
175}
176
177static LHASH_NODE **
178getrn(_LHASH *lh, const void *data, unsigned long *rhash)
179{
180 LHASH_NODE **ret, *n1;
181 unsigned long hash, nn;
182 LHASH_COMP_FN_TYPE cf;
183
184 hash = (*(lh->hash))(data);
185 *rhash = hash;
186
187 nn = hash % lh->pmax;
188 if (nn < lh->p)
189 nn = hash % lh->num_alloc_nodes;
190
191 cf = lh->comp;
192 ret = &(lh->b[(int)nn]);
193 for (n1 = *ret; n1 != NULL; n1 = n1->next) {
194#ifndef OPENSSL_NO_HASH_COMP
195 if (n1->hash != hash) {
196 ret = &(n1->next);
197 continue;
198 }
199#endif
200 if (cf(n1->data, data) == 0)
201 break;
202 ret = &(n1->next);
203 }
204 return (ret);
205}
206
207_LHASH *
208lh_new(LHASH_HASH_FN_TYPE h, LHASH_COMP_FN_TYPE c)
209{
210 _LHASH *ret;
211
212 if ((ret = calloc(1, sizeof(_LHASH))) == NULL)
213 return NULL;
214 if ((ret->b = calloc(MIN_NODES, sizeof(LHASH_NODE *))) == NULL) {
215 free(ret);
216 return NULL;
217 }
218 ret->comp = ((c == NULL) ? (LHASH_COMP_FN_TYPE)strcmp : c);
219 ret->hash = ((h == NULL) ? (LHASH_HASH_FN_TYPE)lh_strhash : h);
220 ret->num_nodes = MIN_NODES / 2;
221 ret->num_alloc_nodes = MIN_NODES;
222 ret->pmax = MIN_NODES / 2;
223 ret->up_load = UP_LOAD;
224 ret->down_load = DOWN_LOAD;
225
226 return (ret);
227}
228LCRYPTO_ALIAS(lh_new);
229
230void
231lh_free(_LHASH *lh)
232{
233 unsigned int i;
234 LHASH_NODE *n, *nn;
235
236 if (lh == NULL)
237 return;
238
239 for (i = 0; i < lh->num_nodes; i++) {
240 n = lh->b[i];
241 while (n != NULL) {
242 nn = n->next;
243 free(n);
244 n = nn;
245 }
246 }
247 free(lh->b);
248 free(lh);
249}
250LCRYPTO_ALIAS(lh_free);
251
252int
253lh_error(_LHASH *lh)
254{
255 return lh->error;
256}
257LCRYPTO_ALIAS(lh_error);
258
259void *
260lh_insert(_LHASH *lh, void *data)
261{
262 unsigned long hash;
263 LHASH_NODE *nn, **rn;
264 void *ret;
265
266 lh->error = 0;
267 if (lh->up_load <= (lh->num_items * LH_LOAD_MULT / lh->num_nodes))
268 expand(lh);
269
270 rn = getrn(lh, data, &hash);
271
272 if (*rn == NULL) {
273 if ((nn = malloc(sizeof(LHASH_NODE))) == NULL) {
274 lh->error++;
275 return (NULL);
276 }
277 nn->data = data;
278 nn->next = NULL;
279#ifndef OPENSSL_NO_HASH_COMP
280 nn->hash = hash;
281#endif
282 *rn = nn;
283 ret = NULL;
284 lh->num_items++;
285 }
286 else /* replace same key */
287 {
288 ret = (*rn)->data;
289 (*rn)->data = data;
290 }
291 return (ret);
292}
293LCRYPTO_ALIAS(lh_insert);
294
295void *
296lh_delete(_LHASH *lh, const void *data)
297{
298 unsigned long hash;
299 LHASH_NODE *nn, **rn;
300 void *ret;
301
302 lh->error = 0;
303 rn = getrn(lh, data, &hash);
304
305 if (*rn == NULL) {
306 return (NULL);
307 } else {
308 nn= *rn;
309 *rn = nn->next;
310 ret = nn->data;
311 free(nn);
312 }
313
314 lh->num_items--;
315 if ((lh->num_nodes > MIN_NODES) &&
316 (lh->down_load >= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)))
317 contract(lh);
318
319 return (ret);
320}
321LCRYPTO_ALIAS(lh_delete);
322
323void *
324lh_retrieve(_LHASH *lh, const void *data)
325{
326 unsigned long hash;
327 LHASH_NODE **rn;
328 void *ret;
329
330 lh->error = 0;
331 rn = getrn(lh, data, &hash);
332
333 if (*rn == NULL) {
334 return (NULL);
335 } else {
336 ret = (*rn)->data;
337 }
338 return (ret);
339}
340LCRYPTO_ALIAS(lh_retrieve);
341
342static void
343doall_util_fn(_LHASH *lh, int use_arg, LHASH_DOALL_FN_TYPE func,
344 LHASH_DOALL_ARG_FN_TYPE func_arg, void *arg)
345{
346 LHASH_NODE *a, *n;
347 int down_load;
348 int i;
349
350 if (lh == NULL)
351 return;
352
353 /*
354 * Disable contraction of the hash while walking, as some consumers use
355 * it to delete hash entries. A better option would be to snapshot the
356 * hash, making it insert safe as well.
357 */
358 down_load = lh->down_load;
359 lh->down_load = 0;
360
361 /* reverse the order so we search from 'top to bottom'
362 * We were having memory leaks otherwise */
363 for (i = lh->num_nodes - 1; i >= 0; i--) {
364 a = lh->b[i];
365 while (a != NULL) {
366 /* 28/05/91 - eay - n added so items can be deleted
367 * via lh_doall */
368 /* 22/05/08 - ben - eh? since a is not passed,
369 * this should not be needed */
370 n = a->next;
371 if (use_arg)
372 func_arg(a->data, arg);
373 else
374 func(a->data);
375 a = n;
376 }
377 }
378
379 /* Restore down load factor and trigger contraction. */
380 lh->down_load = down_load;
381 if ((lh->num_nodes > MIN_NODES) &&
382 (lh->down_load >= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)))
383 contract(lh);
384}
385
386void
387lh_doall(_LHASH *lh, LHASH_DOALL_FN_TYPE func)
388{
389 doall_util_fn(lh, 0, func, (LHASH_DOALL_ARG_FN_TYPE)0, NULL);
390}
391LCRYPTO_ALIAS(lh_doall);
392
393void
394lh_doall_arg(_LHASH *lh, LHASH_DOALL_ARG_FN_TYPE func, void *arg)
395{
396 doall_util_fn(lh, 1, (LHASH_DOALL_FN_TYPE)0, func, arg);
397}
398LCRYPTO_ALIAS(lh_doall_arg);
399
400/* The following hash seems to work very well on normal text strings
401 * no collisions on /usr/dict/words and it distributes on %2^n quite
402 * well, not as good as MD5, but still good.
403 */
404unsigned long
405lh_strhash(const char *c)
406{
407 unsigned long ret = 0;
408 unsigned long n, v;
409 unsigned int r;
410
411 if (c == NULL || *c == '\0')
412 return ret;
413
414 n = 0x100;
415 while (*c) {
416 v = n | *c;
417 n += 0x100;
418 if ((r = ((v >> 2) ^ v) & 0x0f) != 0)
419 ret = (ret << r) | (ret >> (32 - r));
420 ret &= 0xFFFFFFFFUL;
421 ret ^= v * v;
422 c++;
423 }
424 return (ret >> 16) ^ ret;
425}
426LCRYPTO_ALIAS(lh_strhash);
427
428unsigned long
429lh_num_items(const _LHASH *lh)
430{
431 return lh ? lh->num_items : 0;
432}
433LCRYPTO_ALIAS(lh_num_items);
diff --git a/src/lib/libcrypto/lhash/lhash.h b/src/lib/libcrypto/lhash/lhash.h
deleted file mode 100644
index 86d05544a0..0000000000
--- a/src/lib/libcrypto/lhash/lhash.h
+++ /dev/null
@@ -1,179 +0,0 @@
1/* $OpenBSD: lhash.h,v 1.14 2024/03/02 11:11:11 tb Exp $ */
2/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
3 * All rights reserved.
4 *
5 * This package is an SSL implementation written
6 * by Eric Young (eay@cryptsoft.com).
7 * The implementation was written so as to conform with Netscapes SSL.
8 *
9 * This library is free for commercial and non-commercial use as long as
10 * the following conditions are aheared to. The following conditions
11 * apply to all code found in this distribution, be it the RC4, RSA,
12 * lhash, DES, etc., code; not just the SSL code. The SSL documentation
13 * included with this distribution is covered by the same copyright terms
14 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
15 *
16 * Copyright remains Eric Young's, and as such any Copyright notices in
17 * the code are not to be removed.
18 * If this package is used in a product, Eric Young should be given attribution
19 * as the author of the parts of the library used.
20 * This can be in the form of a textual message at program startup or
21 * in documentation (online or textual) provided with the package.
22 *
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
25 * are met:
26 * 1. Redistributions of source code must retain the copyright
27 * notice, this list of conditions and the following disclaimer.
28 * 2. Redistributions in binary form must reproduce the above copyright
29 * notice, this list of conditions and the following disclaimer in the
30 * documentation and/or other materials provided with the distribution.
31 * 3. All advertising materials mentioning features or use of this software
32 * must display the following acknowledgement:
33 * "This product includes cryptographic software written by
34 * Eric Young (eay@cryptsoft.com)"
35 * The word 'cryptographic' can be left out if the rouines from the library
36 * being used are not cryptographic related :-).
37 * 4. If you include any Windows specific code (or a derivative thereof) from
38 * the apps directory (application code) you must include an acknowledgement:
39 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
40 *
41 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
42 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
43 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
44 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
45 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
46 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
47 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
49 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
50 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
51 * SUCH DAMAGE.
52 *
53 * The licence and distribution terms for any publically available version or
54 * derivative of this code cannot be changed. i.e. this code cannot simply be
55 * copied and put under another distribution licence
56 * [including the GNU Public Licence.]
57 */
58
59/* Header for dynamic hash table routines
60 * Author - Eric Young
61 */
62
63#ifndef HEADER_LHASH_H
64#define HEADER_LHASH_H
65
66#include <openssl/opensslconf.h>
67
68#include <stdio.h>
69
70#ifndef OPENSSL_NO_BIO
71#include <openssl/bio.h>
72#endif
73
74#ifdef __cplusplus
75extern "C" {
76#endif
77
78typedef int (*LHASH_COMP_FN_TYPE)(const void *, const void *);
79typedef unsigned long (*LHASH_HASH_FN_TYPE)(const void *);
80typedef void (*LHASH_DOALL_FN_TYPE)(void *);
81typedef void (*LHASH_DOALL_ARG_FN_TYPE)(void *, void *);
82
83/* Macros for declaring and implementing type-safe wrappers for LHASH callbacks.
84 * This way, callbacks can be provided to LHASH structures without function
85 * pointer casting and the macro-defined callbacks provide per-variable casting
86 * before deferring to the underlying type-specific callbacks. NB: It is
87 * possible to place a "static" in front of both the DECLARE and IMPLEMENT
88 * macros if the functions are strictly internal. */
89
90/* First: "hash" functions */
91#define DECLARE_LHASH_HASH_FN(name, o_type) \
92 unsigned long name##_LHASH_HASH(const void *);
93#define IMPLEMENT_LHASH_HASH_FN(name, o_type) \
94 unsigned long name##_LHASH_HASH(const void *arg) { \
95 const o_type *a = arg; \
96 return name##_hash(a); }
97#define LHASH_HASH_FN(name) name##_LHASH_HASH
98
99/* Second: "compare" functions */
100#define DECLARE_LHASH_COMP_FN(name, o_type) \
101 int name##_LHASH_COMP(const void *, const void *);
102#define IMPLEMENT_LHASH_COMP_FN(name, o_type) \
103 int name##_LHASH_COMP(const void *arg1, const void *arg2) { \
104 const o_type *a = arg1; \
105 const o_type *b = arg2; \
106 return name##_cmp(a,b); }
107#define LHASH_COMP_FN(name) name##_LHASH_COMP
108
109/* Third: "doall" functions */
110#define DECLARE_LHASH_DOALL_FN(name, o_type) \
111 void name##_LHASH_DOALL(void *);
112#define IMPLEMENT_LHASH_DOALL_FN(name, o_type) \
113 void name##_LHASH_DOALL(void *arg) { \
114 o_type *a = arg; \
115 name##_doall(a); }
116#define LHASH_DOALL_FN(name) name##_LHASH_DOALL
117
118/* Fourth: "doall_arg" functions */
119#define DECLARE_LHASH_DOALL_ARG_FN(name, o_type, a_type) \
120 void name##_LHASH_DOALL_ARG(void *, void *);
121#define IMPLEMENT_LHASH_DOALL_ARG_FN(name, o_type, a_type) \
122 void name##_LHASH_DOALL_ARG(void *arg1, void *arg2) { \
123 o_type *a = arg1; \
124 a_type *b = arg2; \
125 name##_doall_arg(a, b); }
126#define LHASH_DOALL_ARG_FN(name) name##_LHASH_DOALL_ARG
127
128typedef struct lhash_st _LHASH;
129
130#define LH_LOAD_MULT 256
131
132_LHASH *lh_new(LHASH_HASH_FN_TYPE h, LHASH_COMP_FN_TYPE c);
133void lh_free(_LHASH *lh);
134int lh_error(_LHASH *lh);
135void *lh_insert(_LHASH *lh, void *data);
136void *lh_delete(_LHASH *lh, const void *data);
137void *lh_retrieve(_LHASH *lh, const void *data);
138void lh_doall(_LHASH *lh, LHASH_DOALL_FN_TYPE func);
139void lh_doall_arg(_LHASH *lh, LHASH_DOALL_ARG_FN_TYPE func, void *arg);
140unsigned long lh_strhash(const char *c);
141unsigned long lh_num_items(const _LHASH *lh);
142
143/* Type checking... */
144
145#define LHASH_OF(type) struct lhash_st_##type
146
147#define DECLARE_LHASH_OF(type) LHASH_OF(type)
148
149#define CHECKED_LHASH_OF(type,lh) \
150 ((_LHASH *)CHECKED_PTR_OF(LHASH_OF(type),lh))
151
152/* Define wrapper functions. */
153#define LHM_lh_new(type, name) \
154 ((LHASH_OF(type) *)lh_new(LHASH_HASH_FN(name), LHASH_COMP_FN(name)))
155#define LHM_lh_error(type, lh) \
156 lh_error(CHECKED_LHASH_OF(type,lh))
157#define LHM_lh_insert(type, lh, inst) \
158 ((type *)lh_insert(CHECKED_LHASH_OF(type, lh), \
159 CHECKED_PTR_OF(type, inst)))
160#define LHM_lh_retrieve(type, lh, inst) \
161 ((type *)lh_retrieve(CHECKED_LHASH_OF(type, lh), \
162 CHECKED_PTR_OF(type, inst)))
163#define LHM_lh_delete(type, lh, inst) \
164 ((type *)lh_delete(CHECKED_LHASH_OF(type, lh), \
165 CHECKED_PTR_OF(type, inst)))
166#define LHM_lh_doall(type, lh,fn) lh_doall(CHECKED_LHASH_OF(type, lh), fn)
167#define LHM_lh_doall_arg(type, lh, fn, arg_type, arg) \
168 lh_doall_arg(CHECKED_LHASH_OF(type, lh), fn, CHECKED_PTR_OF(arg_type, arg))
169#define LHM_lh_num_items(type, lh) lh_num_items(CHECKED_LHASH_OF(type, lh))
170#define LHM_lh_free(type, lh) lh_free(CHECKED_LHASH_OF(type, lh))
171
172DECLARE_LHASH_OF(OPENSSL_STRING);
173DECLARE_LHASH_OF(OPENSSL_CSTRING);
174
175#ifdef __cplusplus
176}
177#endif
178
179#endif
generated by cgit v1.2.3-55-g6feb (git 2.39.1) at 2025-12-23 21:02:10 +0000