Head

GCC Code Coverage Report

Directory:	./		Exec	Total	Coverage
File:	lib/libcrypto/lhash/lhash.c	Lines:	163	185	88.1 %
Date:	2017-11-07	Branches:	56	70	80.0 %


/* $OpenBSD: lhash.c,v 1.18 2016/11/08 20:20:06 miod Exp $ */
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
 * All rights reserved.
 *
 * This package is an SSL implementation written
 * by Eric Young (eay@cryptsoft.com).
 * The implementation was written so as to conform with Netscapes SSL.
 *
 * This library is free for commercial and non-commercial use as long as
 * the following conditions are aheared to.  The following conditions
 * apply to all code found in this distribution, be it the RC4, RSA,
 * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
 * included with this distribution is covered by the same copyright terms
 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
 *
 * Copyright remains Eric Young's, and as such any Copyright notices in
 * the code are not to be removed.
 * If this package is used in a product, Eric Young should be given attribution
 * as the author of the parts of the library used.
 * This can be in the form of a textual message at program startup or
 * in documentation (online or textual) provided with the package.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *    "This product includes cryptographic software written by
 *     Eric Young (eay@cryptsoft.com)"
 *    The word 'cryptographic' can be left out if the rouines from the library
 *    being used are not cryptographic related :-).
 * 4. If you include any Windows specific code (or a derivative thereof) from
 *    the apps directory (application code) you must include an acknowledgement:
 *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
 *
 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 * The licence and distribution terms for any publically available version or
 * derivative of this code cannot be changed.  i.e. this code cannot simply be
 * copied and put under another distribution licence
 * [including the GNU Public Licence.]
 */

/* Code for dynamic hash table routines
 * Author - Eric Young v 2.0
 *
 * 2.2 eay - added #include "crypto.h" so the memory leak checking code is
 *	     present. eay 18-Jun-98
 *
 * 2.1 eay - Added an 'error in last operation' flag. eay 6-May-98
 *
 * 2.0 eay - Fixed a bug that occurred when using lh_delete
 *	     from inside lh_doall().  As entries were deleted,
 *	     the 'table' was 'contract()ed', making some entries
 *	     jump from the end of the table to the start, there by
 *	     skipping the lh_doall() processing. eay - 4/12/95
 *
 * 1.9 eay - Fixed a memory leak in lh_free, the LHASH_NODEs
 *	     were not being free()ed. 21/11/95
 *
 * 1.8 eay - Put the stats routines into a separate file, lh_stats.c
 *	     19/09/95
 *
 * 1.7 eay - Removed the fputs() for realloc failures - the code
 *           should silently tolerate them.  I have also fixed things
 *           lint complained about 04/05/95
 *
 * 1.6 eay - Fixed an invalid pointers in contract/expand 27/07/92
 *
 * 1.5 eay - Fixed a misuse of realloc in expand 02/03/1992
 *
 * 1.4 eay - Fixed lh_doall so the function can call lh_delete 28/05/91
 *
 * 1.3 eay - Fixed a few lint problems 19/3/1991
 *
 * 1.2 eay - Fixed lh_doall problem 13/3/1991
 *
 * 1.1 eay - Added lh_doall
 *
 * 1.0 eay - First version
 */
#include <stdio.h>
#include <string.h>
#include <stdlib.h>

#include <openssl/opensslconf.h>

#include <openssl/crypto.h>
#include <openssl/lhash.h>

#undef MIN_NODES
#define MIN_NODES	16
#define UP_LOAD		(2*LH_LOAD_MULT) /* load times 256  (default 2) */
#define DOWN_LOAD	(LH_LOAD_MULT)   /* load times 256  (default 1) */

static void expand(_LHASH *lh);
static void contract(_LHASH *lh);
static LHASH_NODE **getrn(_LHASH *lh, const void *data, unsigned long *rhash);

_LHASH *
lh_new(LHASH_HASH_FN_TYPE h, LHASH_COMP_FN_TYPE c)
{
	_LHASH *ret;
	int i;

	if ((ret = malloc(sizeof(_LHASH))) == NULL)
		goto err0;
	if ((ret->b = reallocarray(NULL, MIN_NODES, sizeof(LHASH_NODE *))) == NULL)
		goto err1;
	for (i = 0; i < MIN_NODES; i++)
		ret->b[i] = NULL;
	ret->comp = ((c == NULL) ? (LHASH_COMP_FN_TYPE)strcmp : c);
	ret->hash = ((h == NULL) ? (LHASH_HASH_FN_TYPE)lh_strhash : h);
	ret->num_nodes = MIN_NODES / 2;
	ret->num_alloc_nodes = MIN_NODES;
	ret->p = 0;
	ret->pmax = MIN_NODES / 2;
	ret->up_load = UP_LOAD;
	ret->down_load = DOWN_LOAD;
	ret->num_items = 0;

	ret->num_expands = 0;
	ret->num_expand_reallocs = 0;
	ret->num_contracts = 0;
	ret->num_contract_reallocs = 0;
	ret->num_hash_calls = 0;
	ret->num_comp_calls = 0;
	ret->num_insert = 0;
	ret->num_replace = 0;
	ret->num_delete = 0;
	ret->num_no_delete = 0;
	ret->num_retrieve = 0;
	ret->num_retrieve_miss = 0;
	ret->num_hash_comps = 0;

	ret->error = 0;
	return (ret);

err1:
	free(ret);
err0:
	return (NULL);
}

void
lh_free(_LHASH *lh)
{
	unsigned int i;
	LHASH_NODE *n, *nn;

	if (lh == NULL)
		return;

	for (i = 0; i < lh->num_nodes; i++) {
		n = lh->b[i];
		while (n != NULL) {
			nn = n->next;
			free(n);
			n = nn;
		}
	}
	free(lh->b);
	free(lh);
}

void *
lh_insert(_LHASH *lh, void *data)
{
	unsigned long hash;
	LHASH_NODE *nn, **rn;
	void *ret;

	lh->error = 0;
	if (lh->up_load <= (lh->num_items * LH_LOAD_MULT / lh->num_nodes))
		expand(lh);

	rn = getrn(lh, data, &hash);

	if (*rn == NULL) {
		if ((nn = malloc(sizeof(LHASH_NODE))) == NULL) {
			lh->error++;
			return (NULL);
		}
		nn->data = data;
		nn->next = NULL;
#ifndef OPENSSL_NO_HASH_COMP
		nn->hash = hash;
#endif
		*rn = nn;
		ret = NULL;
		lh->num_insert++;
		lh->num_items++;
	}
	else /* replace same key */
	{
		ret = (*rn)->data;
		(*rn)->data = data;
		lh->num_replace++;
	}
	return (ret);
}

void *
lh_delete(_LHASH *lh, const void *data)
{
	unsigned long hash;
	LHASH_NODE *nn, **rn;
	void *ret;

	lh->error = 0;
	rn = getrn(lh, data, &hash);

	if (*rn == NULL) {
		lh->num_no_delete++;
		return (NULL);
	} else {
		nn= *rn;
		*rn = nn->next;
		ret = nn->data;
		free(nn);
		lh->num_delete++;
	}

	lh->num_items--;
	if ((lh->num_nodes > MIN_NODES) &&
	    (lh->down_load >= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)))
		contract(lh);

	return (ret);
}

void *
lh_retrieve(_LHASH *lh, const void *data)
{
	unsigned long hash;
	LHASH_NODE **rn;
	void *ret;

	lh->error = 0;
	rn = getrn(lh, data, &hash);

	if (*rn == NULL) {
		lh->num_retrieve_miss++;
		return (NULL);
	} else {
		ret = (*rn)->data;
		lh->num_retrieve++;
	}
	return (ret);
}

static void
doall_util_fn(_LHASH *lh, int use_arg, LHASH_DOALL_FN_TYPE func,
    LHASH_DOALL_ARG_FN_TYPE func_arg, void *arg)
{
	int i;
	LHASH_NODE *a, *n;

	if (lh == NULL)
		return;

	/* reverse the order so we search from 'top to bottom'
	 * We were having memory leaks otherwise */
	for (i = lh->num_nodes - 1; i >= 0; i--) {
		a = lh->b[i];
		while (a != NULL) {
			/* 28/05/91 - eay - n added so items can be deleted
			 * via lh_doall */
			/* 22/05/08 - ben - eh? since a is not passed,
			 * this should not be needed */
			n = a->next;
			if (use_arg)
				func_arg(a->data, arg);
			else
				func(a->data);
			a = n;
		}
	}
}

void
lh_doall(_LHASH *lh, LHASH_DOALL_FN_TYPE func)
{
	doall_util_fn(lh, 0, func, (LHASH_DOALL_ARG_FN_TYPE)0, NULL);
}

void
lh_doall_arg(_LHASH *lh, LHASH_DOALL_ARG_FN_TYPE func, void *arg)
{
	doall_util_fn(lh, 1, (LHASH_DOALL_FN_TYPE)0, func, arg);
}

static void
expand(_LHASH *lh)
{
	LHASH_NODE **n, **n1, **n2, *np;
	unsigned int p, i, j;
	unsigned long hash, nni;

	lh->num_nodes++;
	lh->num_expands++;
	p = (int)lh->p++;
	n1 = &(lh->b[p]);
	n2 = &(lh->b[p + (int)lh->pmax]);
	*n2 = NULL;        /* 27/07/92 - eay - undefined pointer bug */
	nni = lh->num_alloc_nodes;

	for (np = *n1; np != NULL; ) {
#ifndef OPENSSL_NO_HASH_COMP
		hash = np->hash;
#else
		hash = lh->hash(np->data);
		lh->num_hash_calls++;
#endif
		if ((hash % nni) != p) { /* move it */
			*n1 = (*n1)->next;
			np->next= *n2;
			*n2 = np;
		} else
			n1 = &((*n1)->next);
		np= *n1;
	}

	if ((lh->p) >= lh->pmax) {
		j = (int)lh->num_alloc_nodes * 2;
		n = reallocarray(lh->b, j, sizeof(LHASH_NODE *));
		if (n == NULL) {
/*			fputs("realloc error in lhash", stderr); */
			lh->error++;
			lh->p = 0;
			return;
		}
		/* else */
		for (i = (int)lh->num_alloc_nodes; i < j; i++)/* 26/02/92 eay */
			n[i] = NULL;			  /* 02/03/92 eay */
		lh->pmax = lh->num_alloc_nodes;
		lh->num_alloc_nodes = j;
		lh->num_expand_reallocs++;
		lh->p = 0;
		lh->b = n;
	}
}

static void
contract(_LHASH *lh)
{
	LHASH_NODE **n, *n1, *np;

	np = lh->b[lh->p + lh->pmax - 1];
	lh->b[lh->p+lh->pmax - 1] = NULL; /* 24/07-92 - eay - weird but :-( */
	if (lh->p == 0) {
		n = reallocarray(lh->b, lh->pmax, sizeof(LHASH_NODE *));
		if (n == NULL) {
/*			fputs("realloc error in lhash", stderr); */
			lh->error++;
			return;
		}
		lh->num_contract_reallocs++;
		lh->num_alloc_nodes /= 2;
		lh->pmax /= 2;
		lh->p = lh->pmax - 1;
		lh->b = n;
	} else
		lh->p--;

	lh->num_nodes--;
	lh->num_contracts++;

	n1 = lh->b[(int)lh->p];
	if (n1 == NULL)
		lh->b[(int)lh->p] = np;
	else {
		while (n1->next != NULL)
			n1 = n1->next;
		n1->next = np;
	}
}

static LHASH_NODE **getrn(_LHASH *lh, const void *data, unsigned long *rhash)
{
	LHASH_NODE **ret, *n1;
	unsigned long hash, nn;
	LHASH_COMP_FN_TYPE cf;

	hash = (*(lh->hash))(data);
	lh->num_hash_calls++;
	*rhash = hash;

	nn = hash % lh->pmax;
	if (nn < lh->p)
		nn = hash % lh->num_alloc_nodes;

	cf = lh->comp;
	ret = &(lh->b[(int)nn]);
	for (n1 = *ret; n1 != NULL; n1 = n1->next) {
#ifndef OPENSSL_NO_HASH_COMP
		lh->num_hash_comps++;
		if (n1->hash != hash) {
			ret = &(n1->next);
			continue;
		}
#endif
		lh->num_comp_calls++;
		if (cf(n1->data, data) == 0)
			break;
		ret = &(n1->next);
	}
	return (ret);
}

/* The following hash seems to work very well on normal text strings
 * no collisions on /usr/dict/words and it distributes on %2^n quite
 * well, not as good as MD5, but still good.
 */
unsigned long
lh_strhash(const char *c)
{
	unsigned long ret = 0;
	unsigned long n, v;
	unsigned int r;

	if (c == NULL || *c == '\0')
		return ret;

	n = 0x100;
	while (*c) {
		v = n | *c;
		n += 0x100;
		if ((r = ((v >> 2) ^ v) & 0x0f) != 0)
			ret = (ret << r) | (ret >> (32 - r));
		ret &= 0xFFFFFFFFUL;
		ret ^= v * v;
		c++;
	}
	return (ret >> 16) ^ ret;
}

unsigned long
lh_num_items(const _LHASH *lh)
{
	return lh ? lh->num_items : 0;
}


Generated by: GCOVR (Version 3.3)

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