sl@0: /* crypto/lhash/lh_stats.c */
sl@0: /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
sl@0:  * All rights reserved.
sl@0:  *
sl@0:  * This package is an SSL implementation written
sl@0:  * by Eric Young (eay@cryptsoft.com).
sl@0:  * The implementation was written so as to conform with Netscapes SSL.
sl@0:  * 
sl@0:  * This library is free for commercial and non-commercial use as long as
sl@0:  * the following conditions are aheared to.  The following conditions
sl@0:  * apply to all code found in this distribution, be it the RC4, RSA,
sl@0:  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
sl@0:  * included with this distribution is covered by the same copyright terms
sl@0:  * except that the holder is Tim Hudson (tjh@cryptsoft.com).
sl@0:  * 
sl@0:  * Copyright remains Eric Young's, and as such any Copyright notices in
sl@0:  * the code are not to be removed.
sl@0:  * If this package is used in a product, Eric Young should be given attribution
sl@0:  * as the author of the parts of the library used.
sl@0:  * This can be in the form of a textual message at program startup or
sl@0:  * in documentation (online or textual) provided with the package.
sl@0:  * 
sl@0:  * Redistribution and use in source and binary forms, with or without
sl@0:  * modification, are permitted provided that the following conditions
sl@0:  * are met:
sl@0:  * 1. Redistributions of source code must retain the copyright
sl@0:  *    notice, this list of conditions and the following disclaimer.
sl@0:  * 2. Redistributions in binary form must reproduce the above copyright
sl@0:  *    notice, this list of conditions and the following disclaimer in the
sl@0:  *    documentation and/or other materials provided with the distribution.
sl@0:  * 3. All advertising materials mentioning features or use of this software
sl@0:  *    must display the following acknowledgement:
sl@0:  *    "This product includes cryptographic software written by
sl@0:  *     Eric Young (eay@cryptsoft.com)"
sl@0:  *    The word 'cryptographic' can be left out if the rouines from the library
sl@0:  *    being used are not cryptographic related :-).
sl@0:  * 4. If you include any Windows specific code (or a derivative thereof) from 
sl@0:  *    the apps directory (application code) you must include an acknowledgement:
sl@0:  *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
sl@0:  * 
sl@0:  * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
sl@0:  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
sl@0:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
sl@0:  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
sl@0:  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
sl@0:  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
sl@0:  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
sl@0:  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
sl@0:  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
sl@0:  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
sl@0:  * SUCH DAMAGE.
sl@0:  * 
sl@0:  * The licence and distribution terms for any publically available version or
sl@0:  * derivative of this code cannot be changed.  i.e. this code cannot simply be
sl@0:  * copied and put under another distribution licence
sl@0:  * [including the GNU Public Licence.]
sl@0:  */
sl@0: 
sl@0: #include <stdio.h>
sl@0: #include <string.h>
sl@0: #include <stdlib.h>
sl@0: /* If you wish to build this outside of SSLeay, remove the following lines
sl@0:  * and things should work as expected */
sl@0: #include "cryptlib.h"
sl@0: 
sl@0: #ifndef OPENSSL_NO_BIO
sl@0: #include <openssl/bio.h>
sl@0: #endif
sl@0: #include <openssl/lhash.h>
sl@0: 
sl@0: #ifdef OPENSSL_NO_BIO
sl@0: 
sl@0: EXPORT_C void lh_stats(LHASH *lh, FILE *out)
sl@0: 	{
sl@0: 	fprintf(out,"num_items             = %lu\n",lh->num_items);
sl@0: 	fprintf(out,"num_nodes             = %u\n",lh->num_nodes);
sl@0: 	fprintf(out,"num_alloc_nodes       = %u\n",lh->num_alloc_nodes);
sl@0: 	fprintf(out,"num_expands           = %lu\n",lh->num_expands);
sl@0: 	fprintf(out,"num_expand_reallocs   = %lu\n",lh->num_expand_reallocs);
sl@0: 	fprintf(out,"num_contracts         = %lu\n",lh->num_contracts);
sl@0: 	fprintf(out,"num_contract_reallocs = %lu\n",lh->num_contract_reallocs);
sl@0: 	fprintf(out,"num_hash_calls        = %lu\n",lh->num_hash_calls);
sl@0: 	fprintf(out,"num_comp_calls        = %lu\n",lh->num_comp_calls);
sl@0: 	fprintf(out,"num_insert            = %lu\n",lh->num_insert);
sl@0: 	fprintf(out,"num_replace           = %lu\n",lh->num_replace);
sl@0: 	fprintf(out,"num_delete            = %lu\n",lh->num_delete);
sl@0: 	fprintf(out,"num_no_delete         = %lu\n",lh->num_no_delete);
sl@0: 	fprintf(out,"num_retrieve          = %lu\n",lh->num_retrieve);
sl@0: 	fprintf(out,"num_retrieve_miss     = %lu\n",lh->num_retrieve_miss);
sl@0: 	fprintf(out,"num_hash_comps        = %lu\n",lh->num_hash_comps);
sl@0: #if 0
sl@0: 	fprintf(out,"p                     = %u\n",lh->p);
sl@0: 	fprintf(out,"pmax                  = %u\n",lh->pmax);
sl@0: 	fprintf(out,"up_load               = %lu\n",lh->up_load);
sl@0: 	fprintf(out,"down_load             = %lu\n",lh->down_load);
sl@0: #endif
sl@0: 	}
sl@0: 
sl@0: EXPORT_C void lh_node_stats(LHASH *lh, FILE *out)
sl@0: 	{
sl@0: 	LHASH_NODE *n;
sl@0: 	unsigned int i,num;
sl@0: 
sl@0: 	for (i=0; i<lh->num_nodes; i++)
sl@0: 		{
sl@0: 		for (n=lh->b[i],num=0; n != NULL; n=n->next)
sl@0: 			num++;
sl@0: 		fprintf(out,"node %6u -> %3u\n",i,num);
sl@0: 		}
sl@0: 	}
sl@0: 
sl@0: EXPORT_C void lh_node_usage_stats(LHASH *lh, FILE *out)
sl@0: 	{
sl@0: 	LHASH_NODE *n;
sl@0: 	unsigned long num;
sl@0: 	unsigned int i;
sl@0: 	unsigned long total=0,n_used=0;
sl@0: 
sl@0: 	for (i=0; i<lh->num_nodes; i++)
sl@0: 		{
sl@0: 		for (n=lh->b[i],num=0; n != NULL; n=n->next)
sl@0: 			num++;
sl@0: 		if (num != 0)
sl@0: 			{
sl@0: 			n_used++;
sl@0: 			total+=num;
sl@0: 			}
sl@0: 		}
sl@0: 	fprintf(out,"%lu nodes used out of %u\n",n_used,lh->num_nodes);
sl@0: 	fprintf(out,"%lu items\n",total);
sl@0: 	if (n_used == 0) return;
sl@0: 	fprintf(out,"load %d.%02d  actual load %d.%02d\n",
sl@0: 		(int)(total/lh->num_nodes),
sl@0: 		(int)((total%lh->num_nodes)*100/lh->num_nodes),
sl@0: 		(int)(total/n_used),
sl@0: 		(int)((total%n_used)*100/n_used));
sl@0: 	}
sl@0: 
sl@0: #else
sl@0: 
sl@0: #ifndef OPENSSL_NO_FP_API
sl@0: EXPORT_C void lh_stats(const LHASH *lh, FILE *fp)
sl@0: 	{
sl@0: 	BIO *bp;
sl@0: 
sl@0: 	bp=BIO_new(BIO_s_file());
sl@0: 	if (bp == NULL) goto end;
sl@0: 	BIO_set_fp(bp,fp,BIO_NOCLOSE);
sl@0: 	lh_stats_bio(lh,bp);
sl@0: 	BIO_free(bp);
sl@0: end:;
sl@0: 	}
sl@0: 
sl@0: EXPORT_C void lh_node_stats(const LHASH *lh, FILE *fp)
sl@0: 	{
sl@0: 	BIO *bp;
sl@0: 
sl@0: 	bp=BIO_new(BIO_s_file());
sl@0: 	if (bp == NULL) goto end;
sl@0: 	BIO_set_fp(bp,fp,BIO_NOCLOSE);
sl@0: 	lh_node_stats_bio(lh,bp);
sl@0: 	BIO_free(bp);
sl@0: end:;
sl@0: 	}
sl@0: 
sl@0: EXPORT_C void lh_node_usage_stats(const LHASH *lh, FILE *fp)
sl@0: 	{
sl@0: 	BIO *bp;
sl@0: 
sl@0: 	bp=BIO_new(BIO_s_file());
sl@0: 	if (bp == NULL) goto end;
sl@0: 	BIO_set_fp(bp,fp,BIO_NOCLOSE);
sl@0: 	lh_node_usage_stats_bio(lh,bp);
sl@0: 	BIO_free(bp);
sl@0: end:;
sl@0: 	}
sl@0: 
sl@0: #endif
sl@0: 
sl@0: EXPORT_C void lh_stats_bio(const LHASH *lh, BIO *out)
sl@0: 	{
sl@0: 	BIO_printf(out,"num_items             = %lu\n",lh->num_items);
sl@0: 	BIO_printf(out,"num_nodes             = %u\n",lh->num_nodes);
sl@0: 	BIO_printf(out,"num_alloc_nodes       = %u\n",lh->num_alloc_nodes);
sl@0: 	BIO_printf(out,"num_expands           = %lu\n",lh->num_expands);
sl@0: 	BIO_printf(out,"num_expand_reallocs   = %lu\n",
sl@0: 		   lh->num_expand_reallocs);
sl@0: 	BIO_printf(out,"num_contracts         = %lu\n",lh->num_contracts);
sl@0: 	BIO_printf(out,"num_contract_reallocs = %lu\n",
sl@0: 		   lh->num_contract_reallocs);
sl@0: 	BIO_printf(out,"num_hash_calls        = %lu\n",lh->num_hash_calls);
sl@0: 	BIO_printf(out,"num_comp_calls        = %lu\n",lh->num_comp_calls);
sl@0: 	BIO_printf(out,"num_insert            = %lu\n",lh->num_insert);
sl@0: 	BIO_printf(out,"num_replace           = %lu\n",lh->num_replace);
sl@0: 	BIO_printf(out,"num_delete            = %lu\n",lh->num_delete);
sl@0: 	BIO_printf(out,"num_no_delete         = %lu\n",lh->num_no_delete);
sl@0: 	BIO_printf(out,"num_retrieve          = %lu\n",lh->num_retrieve);
sl@0: 	BIO_printf(out,"num_retrieve_miss     = %lu\n",lh->num_retrieve_miss);
sl@0: 	BIO_printf(out,"num_hash_comps        = %lu\n",lh->num_hash_comps);
sl@0: #if 0
sl@0: 	BIO_printf(out,"p                     = %u\n",lh->p);
sl@0: 	BIO_printf(out,"pmax                  = %u\n",lh->pmax);
sl@0: 	BIO_printf(out,"up_load               = %lu\n",lh->up_load);
sl@0: 	BIO_printf(out,"down_load             = %lu\n",lh->down_load);
sl@0: #endif
sl@0: 	}
sl@0: 
sl@0: EXPORT_C void lh_node_stats_bio(const LHASH *lh, BIO *out)
sl@0: 	{
sl@0: 	LHASH_NODE *n;
sl@0: 	unsigned int i,num;
sl@0: 
sl@0: 	for (i=0; i<lh->num_nodes; i++)
sl@0: 		{
sl@0: 		for (n=lh->b[i],num=0; n != NULL; n=n->next)
sl@0: 			num++;
sl@0: 		BIO_printf(out,"node %6u -> %3u\n",i,num);
sl@0: 		}
sl@0: 	}
sl@0: 
sl@0: EXPORT_C void lh_node_usage_stats_bio(const LHASH *lh, BIO *out)
sl@0: 	{
sl@0: 	LHASH_NODE *n;
sl@0: 	unsigned long num;
sl@0: 	unsigned int i;
sl@0: 	unsigned long total=0,n_used=0;
sl@0: 
sl@0: 	for (i=0; i<lh->num_nodes; i++)
sl@0: 		{
sl@0: 		for (n=lh->b[i],num=0; n != NULL; n=n->next)
sl@0: 			num++;
sl@0: 		if (num != 0)
sl@0: 			{
sl@0: 			n_used++;
sl@0: 			total+=num;
sl@0: 			}
sl@0: 		}
sl@0: 	BIO_printf(out,"%lu nodes used out of %u\n",n_used,lh->num_nodes);
sl@0: 	BIO_printf(out,"%lu items\n",total);
sl@0: 	if (n_used == 0) return;
sl@0: 	BIO_printf(out,"load %d.%02d  actual load %d.%02d\n",
sl@0: 		   (int)(total/lh->num_nodes),
sl@0: 		   (int)((total%lh->num_nodes)*100/lh->num_nodes),
sl@0: 		   (int)(total/n_used),
sl@0: 		   (int)((total%n_used)*100/n_used));
sl@0: 	}
sl@0: 
sl@0: #endif