]>
Commit | Line | Data |
---|---|---|
d02b48c6 | 1 | /* crypto/lhash/lhash.c */ |
58964a49 | 2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) |
d02b48c6 RE |
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. | |
0f113f3e | 8 | * |
d02b48c6 RE |
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). | |
0f113f3e | 15 | * |
d02b48c6 RE |
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. | |
0f113f3e | 22 | * |
d02b48c6 RE |
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 :-). | |
0f113f3e | 37 | * 4. If you include any Windows specific code (or a derivative thereof) from |
d02b48c6 RE |
38 | * the apps directory (application code) you must include an acknowledgement: |
39 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | |
0f113f3e | 40 | * |
d02b48c6 RE |
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. | |
0f113f3e | 52 | * |
d02b48c6 RE |
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 | ||
1d97c843 TH |
59 | /*- |
60 | * Code for dynamic hash table routines | |
d02b48c6 RE |
61 | * Author - Eric Young v 2.0 |
62 | * | |
dfeab068 | 63 | * 2.2 eay - added #include "crypto.h" so the memory leak checking code is |
0f113f3e | 64 | * present. eay 18-Jun-98 |
dfeab068 RE |
65 | * |
66 | * 2.1 eay - Added an 'error in last operation' flag. eay 6-May-98 | |
67 | * | |
657e60fa | 68 | * 2.0 eay - Fixed a bug that occurred when using lh_delete |
0f113f3e MC |
69 | * from inside lh_doall(). As entries were deleted, |
70 | * the 'table' was 'contract()ed', making some entries | |
71 | * jump from the end of the table to the start, there by | |
72 | * skipping the lh_doall() processing. eay - 4/12/95 | |
d02b48c6 RE |
73 | * |
74 | * 1.9 eay - Fixed a memory leak in lh_free, the LHASH_NODEs | |
0f113f3e | 75 | * were not being free()ed. 21/11/95 |
d02b48c6 RE |
76 | * |
77 | * 1.8 eay - Put the stats routines into a separate file, lh_stats.c | |
0f113f3e | 78 | * 19/09/95 |
d02b48c6 RE |
79 | * |
80 | * 1.7 eay - Removed the fputs() for realloc failures - the code | |
81 | * should silently tolerate them. I have also fixed things | |
82 | * lint complained about 04/05/95 | |
83 | * | |
84 | * 1.6 eay - Fixed an invalid pointers in contract/expand 27/07/92 | |
85 | * | |
86 | * 1.5 eay - Fixed a misuse of realloc in expand 02/03/1992 | |
87 | * | |
88 | * 1.4 eay - Fixed lh_doall so the function can call lh_delete 28/05/91 | |
89 | * | |
90 | * 1.3 eay - Fixed a few lint problems 19/3/1991 | |
91 | * | |
92 | * 1.2 eay - Fixed lh_doall problem 13/3/1991 | |
93 | * | |
94 | * 1.1 eay - Added lh_doall | |
95 | * | |
96 | * 1.0 eay - First version | |
97 | */ | |
98 | #include <stdio.h> | |
99 | #include <string.h> | |
100 | #include <stdlib.h> | |
ec577822 BM |
101 | #include <openssl/crypto.h> |
102 | #include <openssl/lhash.h> | |
d02b48c6 | 103 | |
0f113f3e | 104 | const char lh_version[] = "lhash" OPENSSL_VERSION_PTEXT; |
b4cadc6e | 105 | |
0f113f3e MC |
106 | #undef MIN_NODES |
107 | #define MIN_NODES 16 | |
108 | #define UP_LOAD (2*LH_LOAD_MULT) /* load times 256 (default 2) */ | |
109 | #define DOWN_LOAD (LH_LOAD_MULT) /* load times 256 (default 1) */ | |
d02b48c6 | 110 | |
3c1d6bbc BL |
111 | static void expand(_LHASH *lh); |
112 | static void contract(_LHASH *lh); | |
113 | static LHASH_NODE **getrn(_LHASH *lh, const void *data, unsigned long *rhash); | |
d02b48c6 | 114 | |
3c1d6bbc | 115 | _LHASH *lh_new(LHASH_HASH_FN_TYPE h, LHASH_COMP_FN_TYPE c) |
0f113f3e MC |
116 | { |
117 | _LHASH *ret; | |
118 | int i; | |
119 | ||
120 | if ((ret = OPENSSL_malloc(sizeof(_LHASH))) == NULL) | |
121 | goto err0; | |
122 | if ((ret->b = OPENSSL_malloc(sizeof(LHASH_NODE *) * MIN_NODES)) == NULL) | |
123 | goto err1; | |
124 | for (i = 0; i < MIN_NODES; i++) | |
125 | ret->b[i] = NULL; | |
126 | ret->comp = ((c == NULL) ? (LHASH_COMP_FN_TYPE)strcmp : c); | |
127 | ret->hash = ((h == NULL) ? (LHASH_HASH_FN_TYPE)lh_strhash : h); | |
128 | ret->num_nodes = MIN_NODES / 2; | |
129 | ret->num_alloc_nodes = MIN_NODES; | |
130 | ret->p = 0; | |
131 | ret->pmax = MIN_NODES / 2; | |
132 | ret->up_load = UP_LOAD; | |
133 | ret->down_load = DOWN_LOAD; | |
134 | ret->num_items = 0; | |
135 | ||
136 | ret->num_expands = 0; | |
137 | ret->num_expand_reallocs = 0; | |
138 | ret->num_contracts = 0; | |
139 | ret->num_contract_reallocs = 0; | |
140 | ret->num_hash_calls = 0; | |
141 | ret->num_comp_calls = 0; | |
142 | ret->num_insert = 0; | |
143 | ret->num_replace = 0; | |
144 | ret->num_delete = 0; | |
145 | ret->num_no_delete = 0; | |
146 | ret->num_retrieve = 0; | |
147 | ret->num_retrieve_miss = 0; | |
148 | ret->num_hash_comps = 0; | |
149 | ||
150 | ret->error = 0; | |
151 | return (ret); | |
152 | err1: | |
153 | OPENSSL_free(ret); | |
154 | err0: | |
155 | return (NULL); | |
156 | } | |
d02b48c6 | 157 | |
3c1d6bbc | 158 | void lh_free(_LHASH *lh) |
0f113f3e MC |
159 | { |
160 | unsigned int i; | |
161 | LHASH_NODE *n, *nn; | |
162 | ||
163 | if (lh == NULL) | |
164 | return; | |
165 | ||
166 | for (i = 0; i < lh->num_nodes; i++) { | |
167 | n = lh->b[i]; | |
168 | while (n != NULL) { | |
169 | nn = n->next; | |
170 | OPENSSL_free(n); | |
171 | n = nn; | |
172 | } | |
173 | } | |
174 | OPENSSL_free(lh->b); | |
175 | OPENSSL_free(lh); | |
176 | } | |
d02b48c6 | 177 | |
3c1d6bbc | 178 | void *lh_insert(_LHASH *lh, void *data) |
0f113f3e MC |
179 | { |
180 | unsigned long hash; | |
181 | LHASH_NODE *nn, **rn; | |
182 | void *ret; | |
183 | ||
184 | lh->error = 0; | |
185 | if (lh->up_load <= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)) | |
186 | expand(lh); | |
187 | ||
188 | rn = getrn(lh, data, &hash); | |
189 | ||
190 | if (*rn == NULL) { | |
b196e7d9 | 191 | if ((nn = OPENSSL_malloc(sizeof(LHASH_NODE))) == NULL) { |
0f113f3e MC |
192 | lh->error++; |
193 | return (NULL); | |
194 | } | |
195 | nn->data = data; | |
196 | nn->next = NULL; | |
0f113f3e | 197 | nn->hash = hash; |
0f113f3e MC |
198 | *rn = nn; |
199 | ret = NULL; | |
200 | lh->num_insert++; | |
201 | lh->num_items++; | |
202 | } else { /* replace same key */ | |
203 | ||
204 | ret = (*rn)->data; | |
205 | (*rn)->data = data; | |
206 | lh->num_replace++; | |
207 | } | |
208 | return (ret); | |
209 | } | |
d02b48c6 | 210 | |
3c1d6bbc | 211 | void *lh_delete(_LHASH *lh, const void *data) |
0f113f3e MC |
212 | { |
213 | unsigned long hash; | |
214 | LHASH_NODE *nn, **rn; | |
215 | void *ret; | |
216 | ||
217 | lh->error = 0; | |
218 | rn = getrn(lh, data, &hash); | |
219 | ||
220 | if (*rn == NULL) { | |
221 | lh->num_no_delete++; | |
222 | return (NULL); | |
223 | } else { | |
224 | nn = *rn; | |
225 | *rn = nn->next; | |
226 | ret = nn->data; | |
227 | OPENSSL_free(nn); | |
228 | lh->num_delete++; | |
229 | } | |
230 | ||
231 | lh->num_items--; | |
232 | if ((lh->num_nodes > MIN_NODES) && | |
233 | (lh->down_load >= (lh->num_items * LH_LOAD_MULT / lh->num_nodes))) | |
234 | contract(lh); | |
235 | ||
236 | return (ret); | |
237 | } | |
d02b48c6 | 238 | |
3c1d6bbc | 239 | void *lh_retrieve(_LHASH *lh, const void *data) |
0f113f3e MC |
240 | { |
241 | unsigned long hash; | |
242 | LHASH_NODE **rn; | |
243 | void *ret; | |
244 | ||
245 | lh->error = 0; | |
246 | rn = getrn(lh, data, &hash); | |
247 | ||
248 | if (*rn == NULL) { | |
249 | lh->num_retrieve_miss++; | |
250 | return (NULL); | |
251 | } else { | |
252 | ret = (*rn)->data; | |
253 | lh->num_retrieve++; | |
254 | } | |
255 | return (ret); | |
256 | } | |
d02b48c6 | 257 | |
3c1d6bbc | 258 | static void doall_util_fn(_LHASH *lh, int use_arg, LHASH_DOALL_FN_TYPE func, |
0f113f3e MC |
259 | LHASH_DOALL_ARG_FN_TYPE func_arg, void *arg) |
260 | { | |
261 | int i; | |
262 | LHASH_NODE *a, *n; | |
263 | ||
264 | if (lh == NULL) | |
265 | return; | |
266 | ||
267 | /* | |
268 | * reverse the order so we search from 'top to bottom' We were having | |
269 | * memory leaks otherwise | |
270 | */ | |
271 | for (i = lh->num_nodes - 1; i >= 0; i--) { | |
272 | a = lh->b[i]; | |
273 | while (a != NULL) { | |
274 | /* | |
275 | * 28/05/91 - eay - n added so items can be deleted via lh_doall | |
276 | */ | |
277 | /* | |
278 | * 22/05/08 - ben - eh? since a is not passed, this should not be | |
279 | * needed | |
280 | */ | |
281 | n = a->next; | |
282 | if (use_arg) | |
283 | func_arg(a->data, arg); | |
284 | else | |
285 | func(a->data); | |
286 | a = n; | |
287 | } | |
288 | } | |
289 | } | |
d02b48c6 | 290 | |
3c1d6bbc | 291 | void lh_doall(_LHASH *lh, LHASH_DOALL_FN_TYPE func) |
0f113f3e MC |
292 | { |
293 | doall_util_fn(lh, 0, func, (LHASH_DOALL_ARG_FN_TYPE)0, NULL); | |
294 | } | |
18602745 | 295 | |
3c1d6bbc | 296 | void lh_doall_arg(_LHASH *lh, LHASH_DOALL_ARG_FN_TYPE func, void *arg) |
0f113f3e MC |
297 | { |
298 | doall_util_fn(lh, 1, (LHASH_DOALL_FN_TYPE)0, func, arg); | |
299 | } | |
18602745 | 300 | |
3c1d6bbc | 301 | static void expand(_LHASH *lh) |
0f113f3e MC |
302 | { |
303 | LHASH_NODE **n, **n1, **n2, *np; | |
304 | unsigned int p, i, j; | |
305 | unsigned long hash, nni; | |
306 | ||
307 | lh->num_nodes++; | |
308 | lh->num_expands++; | |
309 | p = (int)lh->p++; | |
310 | n1 = &(lh->b[p]); | |
311 | n2 = &(lh->b[p + (int)lh->pmax]); | |
312 | *n2 = NULL; /* 27/07/92 - eay - undefined pointer bug */ | |
313 | nni = lh->num_alloc_nodes; | |
314 | ||
315 | for (np = *n1; np != NULL;) { | |
0f113f3e | 316 | hash = np->hash; |
0f113f3e MC |
317 | if ((hash % nni) != p) { /* move it */ |
318 | *n1 = (*n1)->next; | |
319 | np->next = *n2; | |
320 | *n2 = np; | |
321 | } else | |
322 | n1 = &((*n1)->next); | |
323 | np = *n1; | |
324 | } | |
325 | ||
326 | if ((lh->p) >= lh->pmax) { | |
327 | j = (int)lh->num_alloc_nodes * 2; | |
b196e7d9 | 328 | n = OPENSSL_realloc(lh->b, (int)(sizeof(LHASH_NODE *) * j)); |
0f113f3e | 329 | if (n == NULL) { |
b196e7d9 | 330 | /* fputs("realloc error in lhash",stderr); */ |
0f113f3e MC |
331 | lh->error++; |
332 | lh->p = 0; | |
333 | return; | |
334 | } | |
0f113f3e MC |
335 | for (i = (int)lh->num_alloc_nodes; i < j; i++) /* 26/02/92 eay */ |
336 | n[i] = NULL; /* 02/03/92 eay */ | |
337 | lh->pmax = lh->num_alloc_nodes; | |
338 | lh->num_alloc_nodes = j; | |
339 | lh->num_expand_reallocs++; | |
340 | lh->p = 0; | |
341 | lh->b = n; | |
342 | } | |
343 | } | |
d02b48c6 | 344 | |
3c1d6bbc | 345 | static void contract(_LHASH *lh) |
0f113f3e MC |
346 | { |
347 | LHASH_NODE **n, *n1, *np; | |
348 | ||
349 | np = lh->b[lh->p + lh->pmax - 1]; | |
350 | lh->b[lh->p + lh->pmax - 1] = NULL; /* 24/07-92 - eay - weird but :-( */ | |
351 | if (lh->p == 0) { | |
b196e7d9 RS |
352 | n = OPENSSL_realloc(lh->b, |
353 | (unsigned int)(sizeof(LHASH_NODE *) * lh->pmax)); | |
0f113f3e | 354 | if (n == NULL) { |
b196e7d9 | 355 | /* fputs("realloc error in lhash",stderr); */ |
0f113f3e MC |
356 | lh->error++; |
357 | return; | |
358 | } | |
359 | lh->num_contract_reallocs++; | |
360 | lh->num_alloc_nodes /= 2; | |
361 | lh->pmax /= 2; | |
362 | lh->p = lh->pmax - 1; | |
363 | lh->b = n; | |
364 | } else | |
365 | lh->p--; | |
366 | ||
367 | lh->num_nodes--; | |
368 | lh->num_contracts++; | |
369 | ||
370 | n1 = lh->b[(int)lh->p]; | |
371 | if (n1 == NULL) | |
372 | lh->b[(int)lh->p] = np; | |
373 | else { | |
374 | while (n1->next != NULL) | |
375 | n1 = n1->next; | |
376 | n1->next = np; | |
377 | } | |
378 | } | |
d02b48c6 | 379 | |
3c1d6bbc | 380 | static LHASH_NODE **getrn(_LHASH *lh, const void *data, unsigned long *rhash) |
0f113f3e MC |
381 | { |
382 | LHASH_NODE **ret, *n1; | |
383 | unsigned long hash, nn; | |
384 | LHASH_COMP_FN_TYPE cf; | |
385 | ||
386 | hash = (*(lh->hash)) (data); | |
387 | lh->num_hash_calls++; | |
388 | *rhash = hash; | |
389 | ||
390 | nn = hash % lh->pmax; | |
391 | if (nn < lh->p) | |
392 | nn = hash % lh->num_alloc_nodes; | |
393 | ||
394 | cf = lh->comp; | |
395 | ret = &(lh->b[(int)nn]); | |
396 | for (n1 = *ret; n1 != NULL; n1 = n1->next) { | |
0f113f3e MC |
397 | lh->num_hash_comps++; |
398 | if (n1->hash != hash) { | |
399 | ret = &(n1->next); | |
400 | continue; | |
401 | } | |
0f113f3e MC |
402 | lh->num_comp_calls++; |
403 | if (cf(n1->data, data) == 0) | |
404 | break; | |
405 | ret = &(n1->next); | |
406 | } | |
407 | return (ret); | |
408 | } | |
409 | ||
410 | /* | |
411 | * The following hash seems to work very well on normal text strings no | |
412 | * collisions on /usr/dict/words and it distributes on %2^n quite well, not | |
413 | * as good as MD5, but still good. | |
d02b48c6 | 414 | */ |
6b691a5c | 415 | unsigned long lh_strhash(const char *c) |
0f113f3e MC |
416 | { |
417 | unsigned long ret = 0; | |
418 | long n; | |
419 | unsigned long v; | |
420 | int r; | |
421 | ||
422 | if ((c == NULL) || (*c == '\0')) | |
423 | return (ret); | |
c80fd6b2 | 424 | /*- |
35a1cc90 MC |
425 | unsigned char b[16]; |
426 | MD5(c,strlen(c),b); | |
427 | return(b[0]|(b[1]<<8)|(b[2]<<16)|(b[3]<<24)); | |
d02b48c6 RE |
428 | */ |
429 | ||
0f113f3e MC |
430 | n = 0x100; |
431 | while (*c) { | |
432 | v = n | (*c); | |
433 | n += 0x100; | |
434 | r = (int)((v >> 2) ^ v) & 0x0f; | |
435 | ret = (ret << r) | (ret >> (32 - r)); | |
436 | ret &= 0xFFFFFFFFL; | |
437 | ret ^= v * v; | |
438 | c++; | |
439 | } | |
440 | return ((ret >> 16) ^ ret); | |
441 | } | |
d02b48c6 | 442 | |
3c1d6bbc | 443 | unsigned long lh_num_items(const _LHASH *lh) |
0f113f3e MC |
444 | { |
445 | return lh ? lh->num_items : 0; | |
446 | } |