Head

GCC Code Coverage Report

Directory:	./		Exec	Total	Coverage
File:	lib/libcrypto/lhash/lh_stats.c	Lines:	40	56	71.4 %
Date:	2017-11-13	Branches:	11	18	61.1 %


/* $OpenBSD: lh_stats.c,v 1.12 2014/07/11 08:44:48 jsing 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.]
 */

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

#include <openssl/opensslconf.h>

#ifndef OPENSSL_NO_BIO
#include <openssl/bio.h>
#endif
#include <openssl/lhash.h>

#ifdef OPENSSL_NO_BIO

void
lh_stats(LHASH *lh, FILE *out)
{
	fprintf(out, "num_items             = %lu\n", lh->num_items);
	fprintf(out, "num_nodes             = %u\n", lh->num_nodes);
	fprintf(out, "num_alloc_nodes       = %u\n", lh->num_alloc_nodes);
	fprintf(out, "num_expands           = %lu\n", lh->num_expands);
	fprintf(out, "num_expand_reallocs   = %lu\n", lh->num_expand_reallocs);
	fprintf(out, "num_contracts         = %lu\n", lh->num_contracts);
	fprintf(out, "num_contract_reallocs = %lu\n",
	    lh->num_contract_reallocs);
	fprintf(out, "num_hash_calls        = %lu\n", lh->num_hash_calls);
	fprintf(out, "num_comp_calls        = %lu\n", lh->num_comp_calls);
	fprintf(out, "num_insert            = %lu\n", lh->num_insert);
	fprintf(out, "num_replace           = %lu\n", lh->num_replace);
	fprintf(out, "num_delete            = %lu\n", lh->num_delete);
	fprintf(out, "num_no_delete         = %lu\n", lh->num_no_delete);
	fprintf(out, "num_retrieve          = %lu\n", lh->num_retrieve);
	fprintf(out, "num_retrieve_miss     = %lu\n", lh->num_retrieve_miss);
	fprintf(out, "num_hash_comps        = %lu\n", lh->num_hash_comps);
#if 0
	fprintf(out, "p                     = %u\n", lh->p);
	fprintf(out, "pmax                  = %u\n", lh->pmax);
	fprintf(out, "up_load               = %lu\n", lh->up_load);
	fprintf(out, "down_load             = %lu\n", lh->down_load);
#endif
}

void
lh_node_stats(LHASH *lh, FILE *out)
{
	LHASH_NODE *n;
	unsigned int i, num;

	for (i = 0; i < lh->num_nodes; i++) {
		for (n = lh->b[i], num = 0; n != NULL; n = n->next)
			num++;
		fprintf(out, "node %6u -> %3u\n", i, num);
	}
}

void
lh_node_usage_stats(LHASH *lh, FILE *out)
{
	LHASH_NODE *n;
	unsigned long num;
	unsigned int i;
	unsigned long total = 0, n_used = 0;

	for (i = 0; i < lh->num_nodes; i++) {
		for (n = lh->b[i], num = 0; n != NULL; n = n->next)
			num++;
		if (num != 0) {
			n_used++;
			total += num;
		}
	}
	fprintf(out, "%lu nodes used out of %u\n", n_used, lh->num_nodes);
	fprintf(out, "%lu items\n", total);
	if (n_used == 0)
		return;
	fprintf(out, "load %d.%02d  actual load %d.%02d\n",
	    (int)(total / lh->num_nodes),
	    (int)((total % lh->num_nodes) * 100 / lh->num_nodes),
	    (int)(total / n_used),
	    (int)((total % n_used) * 100 / n_used));
}

#else

void
lh_stats(const _LHASH *lh, FILE *fp)
{
	BIO *bp;

	bp = BIO_new(BIO_s_file());
	if (bp == NULL)
		goto end;
	BIO_set_fp(bp, fp, BIO_NOCLOSE);
	lh_stats_bio(lh, bp);
	BIO_free(bp);
end:;
}

void
lh_node_stats(const _LHASH *lh, FILE *fp)
{
	BIO *bp;

	bp = BIO_new(BIO_s_file());
	if (bp == NULL)
		goto end;
	BIO_set_fp(bp, fp, BIO_NOCLOSE);
	lh_node_stats_bio(lh, bp);
	BIO_free(bp);
end:;
}

void
lh_node_usage_stats(const _LHASH *lh, FILE *fp)
{
	BIO *bp;

	bp = BIO_new(BIO_s_file());
	if (bp == NULL)
		goto end;
	BIO_set_fp(bp, fp, BIO_NOCLOSE);
	lh_node_usage_stats_bio(lh, bp);
	BIO_free(bp);
end:;
}


void
lh_stats_bio(const _LHASH *lh, BIO *out)
{
	BIO_printf(out, "num_items             = %lu\n", lh->num_items);
	BIO_printf(out, "num_nodes             = %u\n", lh->num_nodes);
	BIO_printf(out, "num_alloc_nodes       = %u\n", lh->num_alloc_nodes);
	BIO_printf(out, "num_expands           = %lu\n", lh->num_expands);
	BIO_printf(out, "num_expand_reallocs   = %lu\n",
	    lh->num_expand_reallocs);
	BIO_printf(out, "num_contracts         = %lu\n", lh->num_contracts);
	BIO_printf(out, "num_contract_reallocs = %lu\n",
	    lh->num_contract_reallocs);
	BIO_printf(out, "num_hash_calls        = %lu\n", lh->num_hash_calls);
	BIO_printf(out, "num_comp_calls        = %lu\n", lh->num_comp_calls);
	BIO_printf(out, "num_insert            = %lu\n", lh->num_insert);
	BIO_printf(out, "num_replace           = %lu\n", lh->num_replace);
	BIO_printf(out, "num_delete            = %lu\n", lh->num_delete);
	BIO_printf(out, "num_no_delete         = %lu\n", lh->num_no_delete);
	BIO_printf(out, "num_retrieve          = %lu\n", lh->num_retrieve);
	BIO_printf(out, "num_retrieve_miss     = %lu\n", lh->num_retrieve_miss);
	BIO_printf(out, "num_hash_comps        = %lu\n", lh->num_hash_comps);
#if 0
	BIO_printf(out, "p                     = %u\n", lh->p);
	BIO_printf(out, "pmax                  = %u\n", lh->pmax);
	BIO_printf(out, "up_load               = %lu\n", lh->up_load);
	BIO_printf(out, "down_load             = %lu\n", lh->down_load);
#endif
}

void
lh_node_stats_bio(const _LHASH *lh, BIO *out)
{
	LHASH_NODE *n;
	unsigned int i, num;

	for (i = 0; i < lh->num_nodes; i++) {
		for (n = lh->b[i], num = 0; n != NULL; n = n->next)
			num++;
		BIO_printf(out, "node %6u -> %3u\n", i, num);
	}
}

void
lh_node_usage_stats_bio(const _LHASH *lh, BIO *out)
{
	LHASH_NODE *n;
	unsigned long num;
	unsigned int i;
	unsigned long total = 0, n_used = 0;

	for (i = 0; i < lh->num_nodes; i++) {
		for (n = lh->b[i], num = 0; n != NULL; n = n->next)
			num++;
		if (num != 0) {
			n_used++;
			total += num;
		}
	}
	BIO_printf(out, "%lu nodes used out of %u\n", n_used, lh->num_nodes);
	BIO_printf(out, "%lu items\n", total);
	if (n_used == 0)
		return;
	BIO_printf(out, "load %d.%02d  actual load %d.%02d\n",
	    (int)(total / lh->num_nodes),
	    (int)((total % lh->num_nodes) * 100 / lh->num_nodes),
	    (int)(total / n_used),
	    (int)((total % n_used) * 100 / n_used));
}

#endif


Generated by: GCOVR (Version 3.3)

Line	Branch	Exec	Source
1			/* $OpenBSD: lh_stats.c,v 1.12 2014/07/11 08:44:48 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			#ifndef OPENSSL_NO_BIO
66			#include <openssl/bio.h>
67			#endif
68			#include <openssl/lhash.h>
69
70			#ifdef OPENSSL_NO_BIO
71
72			void
73			lh_stats(LHASH lh, FILE out)
74			{
75			fprintf(out, "num_items = %lu\n", lh->num_items);
76			fprintf(out, "num_nodes = %u\n", lh->num_nodes);
77			fprintf(out, "num_alloc_nodes = %u\n", lh->num_alloc_nodes);
78			fprintf(out, "num_expands = %lu\n", lh->num_expands);
79			fprintf(out, "num_expand_reallocs = %lu\n", lh->num_expand_reallocs);
80			fprintf(out, "num_contracts = %lu\n", lh->num_contracts);
81			fprintf(out, "num_contract_reallocs = %lu\n",
82			lh->num_contract_reallocs);
83			fprintf(out, "num_hash_calls = %lu\n", lh->num_hash_calls);
84			fprintf(out, "num_comp_calls = %lu\n", lh->num_comp_calls);
85			fprintf(out, "num_insert = %lu\n", lh->num_insert);
86			fprintf(out, "num_replace = %lu\n", lh->num_replace);
87			fprintf(out, "num_delete = %lu\n", lh->num_delete);
88			fprintf(out, "num_no_delete = %lu\n", lh->num_no_delete);
89			fprintf(out, "num_retrieve = %lu\n", lh->num_retrieve);
90			fprintf(out, "num_retrieve_miss = %lu\n", lh->num_retrieve_miss);
91			fprintf(out, "num_hash_comps = %lu\n", lh->num_hash_comps);
92			#if 0
93			fprintf(out, "p = %u\n", lh->p);
94			fprintf(out, "pmax = %u\n", lh->pmax);
95			fprintf(out, "up_load = %lu\n", lh->up_load);
96			fprintf(out, "down_load = %lu\n", lh->down_load);
97			#endif
98			}
99
100			void
101			lh_node_stats(LHASH lh, FILE out)
102			{
103			LHASH_NODE *n;
104			unsigned int i, num;
105
106			for (i = 0; i < lh->num_nodes; i++) {
107			for (n = lh->b[i], num = 0; n != NULL; n = n->next)
108			num++;
109			fprintf(out, "node %6u -> %3u\n", i, num);
110			}
111			}
112
113			void
114			lh_node_usage_stats(LHASH lh, FILE out)
115			{
116			LHASH_NODE *n;
117			unsigned long num;
118			unsigned int i;
119			unsigned long total = 0, n_used = 0;
120
121			for (i = 0; i < lh->num_nodes; i++) {
122			for (n = lh->b[i], num = 0; n != NULL; n = n->next)
123			num++;
124			if (num != 0) {
125			n_used++;
126			total += num;
127			}
128			}
129			fprintf(out, "%lu nodes used out of %u\n", n_used, lh->num_nodes);
130			fprintf(out, "%lu items\n", total);
131			if (n_used == 0)
132			return;
133			fprintf(out, "load %d.%02d actual load %d.%02d\n",
134			(int)(total / lh->num_nodes),
135			(int)((total % lh->num_nodes) * 100 / lh->num_nodes),
136			(int)(total / n_used),
137			(int)((total % n_used) * 100 / n_used));
138			}
139
140			#else
141
142			void
143			lh_stats(const _LHASH lh, FILE fp)
144			{
145			BIO *bp;
146
147			bp = BIO_new(BIO_s_file());
148			if (bp == NULL)
149			goto end;
150			BIO_set_fp(bp, fp, BIO_NOCLOSE);
151			lh_stats_bio(lh, bp);
152			BIO_free(bp);
153			end:;
154			}
155
156			void
157			lh_node_stats(const _LHASH lh, FILE fp)
158			{
159			BIO *bp;
160
161			bp = BIO_new(BIO_s_file());
162			if (bp == NULL)
163			goto end;
164			BIO_set_fp(bp, fp, BIO_NOCLOSE);
165			lh_node_stats_bio(lh, bp);
166			BIO_free(bp);
167			end:;
168			}
169
170			void
171			lh_node_usage_stats(const _LHASH lh, FILE fp)
172			{
173			BIO *bp;
174
175			bp = BIO_new(BIO_s_file());
176			if (bp == NULL)
177			goto end;
178			BIO_set_fp(bp, fp, BIO_NOCLOSE);
179			lh_node_usage_stats_bio(lh, bp);
180			BIO_free(bp);
181			end:;
182			}
183
184
185			void
186			lh_stats_bio(const _LHASH lh, BIO out)
187			{
188		4	BIO_printf(out, "num_items = %lu\n", lh->num_items);
189		2	BIO_printf(out, "num_nodes = %u\n", lh->num_nodes);
190		2	BIO_printf(out, "num_alloc_nodes = %u\n", lh->num_alloc_nodes);
191		2	BIO_printf(out, "num_expands = %lu\n", lh->num_expands);
192		2	BIO_printf(out, "num_expand_reallocs = %lu\n",
193		2	lh->num_expand_reallocs);
194		2	BIO_printf(out, "num_contracts = %lu\n", lh->num_contracts);
195		2	BIO_printf(out, "num_contract_reallocs = %lu\n",
196		2	lh->num_contract_reallocs);
197		2	BIO_printf(out, "num_hash_calls = %lu\n", lh->num_hash_calls);
198		2	BIO_printf(out, "num_comp_calls = %lu\n", lh->num_comp_calls);
199		2	BIO_printf(out, "num_insert = %lu\n", lh->num_insert);
200		2	BIO_printf(out, "num_replace = %lu\n", lh->num_replace);
201		2	BIO_printf(out, "num_delete = %lu\n", lh->num_delete);
202		2	BIO_printf(out, "num_no_delete = %lu\n", lh->num_no_delete);
203		2	BIO_printf(out, "num_retrieve = %lu\n", lh->num_retrieve);
204		2	BIO_printf(out, "num_retrieve_miss = %lu\n", lh->num_retrieve_miss);
205		2	BIO_printf(out, "num_hash_comps = %lu\n", lh->num_hash_comps);
206			#if 0
207			BIO_printf(out, "p = %u\n", lh->p);
208			BIO_printf(out, "pmax = %u\n", lh->pmax);
209			BIO_printf(out, "up_load = %lu\n", lh->up_load);
210			BIO_printf(out, "down_load = %lu\n", lh->down_load);
211			#endif
212		2	}
213
214			void
215			lh_node_stats_bio(const _LHASH lh, BIO out)
216			{
217			LHASH_NODE *n;
218			unsigned int i, num;
219
220	✓✓	3026	for (i = 0; i < lh->num_nodes; i++) {
221	✓✓	9060	for (n = lh->b[i], num = 0; n != NULL; n = n->next)
222		3020	num++;
223		1510	BIO_printf(out, "node %6u -> %3u\n", i, num);
224			}
225		2	}
226
227			void
228			lh_node_usage_stats_bio(const _LHASH lh, BIO out)
229			{
230			LHASH_NODE *n;
231			unsigned long num;
232			unsigned int i;
233			unsigned long total = 0, n_used = 0;
234
235	✓✓	3026	for (i = 0; i < lh->num_nodes; i++) {
236	✓✓	9060	for (n = lh->b[i], num = 0; n != NULL; n = n->next)
237		3020	num++;
238	✓✓	1510	if (num != 0) {
239		758	n_used++;
240		758	total += num;
241		758	}
242			}
243		2	BIO_printf(out, "%lu nodes used out of %u\n", n_used, lh->num_nodes);
244		2	BIO_printf(out, "%lu items\n", total);
245	✗✓	2	if (n_used == 0)
246			return;
247		2	BIO_printf(out, "load %d.%02d actual load %d.%02d\n",
248		2	(int)(total / lh->num_nodes),
249		2	(int)((total % lh->num_nodes) * 100 / lh->num_nodes),
250		2	(int)(total / n_used),
251		2	(int)((total % n_used) * 100 / n_used));
252		4	}
253
254			#endif