mirror/openssl
2
0
Fork 0
mirror of https://github.com/openssl/openssl.git synced 2024-11-27 05:21:51 +08:00
Code Issues Packages Projects Releases Wiki Activity
74ecf9e2bb
openssl/crypto/lhash/lh_stats.c
Bodo Möller ec577822f9 Change #include filenames from <foo.h> to <openssl.h>. 
Submitted by:
Reviewed by:
PR:
1999-04-23 22:13:45 +00:00

272 lines
8.7 KiB
C
Raw Blame History

/* crypto/lhash/lh_stats.c */
/* 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>
/* If you wish to build this outside of SSLeay, remove the following lines
* and things should work as expected */
#include "cryptlib.h"
#include <openssl/lhash.h>
#ifndef HEADER_BIO_H
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);
#ifdef DEBUG
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
#ifndef NO_FP_API
void lh_stats(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(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(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:;
}
#endif
void lh_stats_bio(LHASH *lh, BIO *out)
{
char buf[128];
sprintf(buf,"num_items = %lu\n",lh->num_items);
BIO_puts(out,buf);
sprintf(buf,"num_nodes = %u\n",lh->num_nodes);
BIO_puts(out,buf);
sprintf(buf,"num_alloc_nodes = %u\n",lh->num_alloc_nodes);
BIO_puts(out,buf);
sprintf(buf,"num_expands = %lu\n",lh->num_expands);
BIO_puts(out,buf);
sprintf(buf,"num_expand_reallocs = %lu\n",lh->num_expand_reallocs);
BIO_puts(out,buf);
sprintf(buf,"num_contracts = %lu\n",lh->num_contracts);
BIO_puts(out,buf);
sprintf(buf,"num_contract_reallocs = %lu\n",lh->num_contract_reallocs);
BIO_puts(out,buf);
sprintf(buf,"num_hash_calls = %lu\n",lh->num_hash_calls);
BIO_puts(out,buf);
sprintf(buf,"num_comp_calls = %lu\n",lh->num_comp_calls);
BIO_puts(out,buf);
sprintf(buf,"num_insert = %lu\n",lh->num_insert);
BIO_puts(out,buf);
sprintf(buf,"num_replace = %lu\n",lh->num_replace);
BIO_puts(out,buf);
sprintf(buf,"num_delete = %lu\n",lh->num_delete);
BIO_puts(out,buf);
sprintf(buf,"num_no_delete = %lu\n",lh->num_no_delete);
BIO_puts(out,buf);
sprintf(buf,"num_retrieve = %lu\n",lh->num_retrieve);
BIO_puts(out,buf);
sprintf(buf,"num_retrieve_miss = %lu\n",lh->num_retrieve_miss);
BIO_puts(out,buf);
sprintf(buf,"num_hash_comps = %lu\n",lh->num_hash_comps);
BIO_puts(out,buf);
#ifdef DEBUG
sprintf(buf,"p = %u\n",lh->p);
BIO_puts(out,buf);
sprintf(buf,"pmax = %u\n",lh->pmax);
BIO_puts(out,buf);
sprintf(buf,"up_load = %lu\n",lh->up_load);
BIO_puts(out,buf);
sprintf(buf,"down_load = %lu\n",lh->down_load);
BIO_puts(out,buf);
#endif
}
void lh_node_stats_bio(LHASH *lh, BIO *out)
{
LHASH_NODE *n;
unsigned int i,num;
char buf[128];
for (i=0; i<lh->num_nodes; i++)
{
for (n=lh->b[i],num=0; n != NULL; n=n->next)
num++;
sprintf(buf,"node %6u -> %3u\n",i,num);
BIO_puts(out,buf);
}
}
void lh_node_usage_stats_bio(LHASH *lh, BIO *out)
{
LHASH_NODE *n;
unsigned long num;
unsigned int i;
unsigned long total=0,n_used=0;
char buf[128];
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;
}
}
sprintf(buf,"%lu nodes used out of %u\n",n_used,lh->num_nodes);
BIO_puts(out,buf);
sprintf(buf,"%lu items\n",total);
BIO_puts(out,buf);
if (n_used == 0) return;
sprintf(buf,"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));
BIO_puts(out,buf);
}
#endif
Reference in New Issue View Git Blame Copy Permalink