crypto/lhash/lh_stats.c

   1 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
   2  * All rights reserved.
   3  *
   4  * This package is an SSL implementation written
   5  * by Eric Young (eay@cryptsoft.com).
   6  * The implementation was written so as to conform with Netscapes SSL.
   7  *
   8  * This library is free for commercial and non-commercial use as long as
   9  * the following conditions are aheared to.  The following conditions
  10  * apply to all code found in this distribution, be it the RC4, RSA,
  11  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
  12  * included with this distribution is covered by the same copyright terms
  13  * except that the holder is Tim Hudson (tjh@cryptsoft.com).
  14  *
  15  * Copyright remains Eric Young's, and as such any Copyright notices in
  16  * the code are not to be removed.
  17  * If this package is used in a product, Eric Young should be given attribution
  18  * as the author of the parts of the library used.
  19  * This can be in the form of a textual message at program startup or
  20  * in documentation (online or textual) provided with the package.
  21  *
  22  * Redistribution and use in source and binary forms, with or without
  23  * modification, are permitted provided that the following conditions
  24  * are met:
  25  * 1. Redistributions of source code must retain the copyright
  26  *    notice, this list of conditions and the following disclaimer.
  27  * 2. Redistributions in binary form must reproduce the above copyright
  28  *    notice, this list of conditions and the following disclaimer in the
  29  *    documentation and/or other materials provided with the distribution.
  30  * 3. All advertising materials mentioning features or use of this software
  31  *    must display the following acknowledgement:
  32  *    "This product includes cryptographic software written by
  33  *     Eric Young (eay@cryptsoft.com)"
  34  *    The word 'cryptographic' can be left out if the rouines from the library
  35  *    being used are not cryptographic related :-).
  36  * 4. If you include any Windows specific code (or a derivative thereof) from
  37  *    the apps directory (application code) you must include an acknowledgement:
  38  *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
  39  *
  40  * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
  41  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  42  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  43  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  44  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  45  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  46  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  47  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  48  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  49  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  50  * SUCH DAMAGE.
  51  *
  52  * The licence and distribution terms for any publically available version or
  53  * derivative of this code cannot be changed.  i.e. this code cannot simply be
  54  * copied and put under another distribution licence
  55  * [including the GNU Public Licence.]
  56  */
  57
  58 #include <stdio.h>
  59 #include <string.h>
  60 #include <stdlib.h>
  61 /*
  62  * If you wish to build this outside of OpenSSL, remove the following lines
  63  * and things should work as expected
  64  */
  65 #include "internal/cryptlib.h"
  66
  67 #include <openssl/bio.h>
  68 #include <openssl/lhash.h>
  69
  70 # ifndef OPENSSL_NO_STDIO
  71 void lh_stats(const _LHASH *lh, FILE *fp)
  72 {
  73     BIO *bp;
  74
  75     bp = BIO_new(BIO_s_file());
  76     if (bp == NULL)
  77         goto end;
  78     BIO_set_fp(bp, fp, BIO_NOCLOSE);
  79     lh_stats_bio(lh, bp);
  80     BIO_free(bp);
  81  end:;
  82 }
  83
  84 void lh_node_stats(const _LHASH *lh, FILE *fp)
  85 {
  86     BIO *bp;
  87
  88     bp = BIO_new(BIO_s_file());
  89     if (bp == NULL)
  90         goto end;
  91     BIO_set_fp(bp, fp, BIO_NOCLOSE);
  92     lh_node_stats_bio(lh, bp);
  93     BIO_free(bp);
  94  end:;
  95 }
  96
  97 void lh_node_usage_stats(const _LHASH *lh, FILE *fp)
  98 {
  99     BIO *bp;
 100
 101     bp = BIO_new(BIO_s_file());
 102     if (bp == NULL)
 103         goto end;
 104     BIO_set_fp(bp, fp, BIO_NOCLOSE);
 105     lh_node_usage_stats_bio(lh, bp);
 106     BIO_free(bp);
 107  end:;
 108 }
 109
 110 # endif
 111
 112 void lh_stats_bio(const _LHASH *lh, BIO *out)
 113 {
 114     BIO_printf(out, "num_items             = %lu\n", lh->num_items);
 115     BIO_printf(out, "num_nodes             = %u\n", lh->num_nodes);
 116     BIO_printf(out, "num_alloc_nodes       = %u\n", lh->num_alloc_nodes);
 117     BIO_printf(out, "num_expands           = %lu\n", lh->num_expands);
 118     BIO_printf(out, "num_expand_reallocs   = %lu\n", lh->num_expand_reallocs);
 119     BIO_printf(out, "num_contracts         = %lu\n", lh->num_contracts);
 120     BIO_printf(out, "num_contract_reallocs = %lu\n",
 121                lh->num_contract_reallocs);
 122     BIO_printf(out, "num_hash_calls        = %lu\n", lh->num_hash_calls);
 123     BIO_printf(out, "num_comp_calls        = %lu\n", lh->num_comp_calls);
 124     BIO_printf(out, "num_insert            = %lu\n", lh->num_insert);
 125     BIO_printf(out, "num_replace           = %lu\n", lh->num_replace);
 126     BIO_printf(out, "num_delete            = %lu\n", lh->num_delete);
 127     BIO_printf(out, "num_no_delete         = %lu\n", lh->num_no_delete);
 128     BIO_printf(out, "num_retrieve          = %lu\n", lh->num_retrieve);
 129     BIO_printf(out, "num_retrieve_miss     = %lu\n", lh->num_retrieve_miss);
 130     BIO_printf(out, "num_hash_comps        = %lu\n", lh->num_hash_comps);
 131 }
 132
 133 void lh_node_stats_bio(const _LHASH *lh, BIO *out)
 134 {
 135     LHASH_NODE *n;
 136     unsigned int i, num;
 137
 138     for (i = 0; i < lh->num_nodes; i++) {
 139         for (n = lh->b[i], num = 0; n != NULL; n = n->next)
 140             num++;
 141         BIO_printf(out, "node %6u -> %3u\n", i, num);
 142     }
 143 }
 144
 145 void lh_node_usage_stats_bio(const _LHASH *lh, BIO *out)
 146 {
 147     LHASH_NODE *n;
 148     unsigned long num;
 149     unsigned int i;
 150     unsigned long total = 0, n_used = 0;
 151
 152     for (i = 0; i < lh->num_nodes; i++) {
 153         for (n = lh->b[i], num = 0; n != NULL; n = n->next)
 154             num++;
 155         if (num != 0) {
 156             n_used++;
 157             total += num;
 158         }
 159     }
 160     BIO_printf(out, "%lu nodes used out of %u\n", n_used, lh->num_nodes);
 161     BIO_printf(out, "%lu items\n", total);
 162     if (n_used == 0)
 163         return;
 164     BIO_printf(out, "load %d.%02d  actual load %d.%02d\n",
 165                (int)(total / lh->num_nodes),
 166                (int)((total % lh->num_nodes) * 100 / lh->num_nodes),
 167                (int)(total / n_used), (int)((total % n_used) * 100 / n_used));
 168 }