]>
git.ipfire.org Git - thirdparty/openssl.git/blob - crypto/lhash/lh_stats.c
1 /* crypto/lhash/lh_stats.c */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
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.
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).
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.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
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)"
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
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.]
63 * If you wish to build this outside of SSLeay, remove the following lines
64 * and things should work as expected
68 #ifndef OPENSSL_NO_BIO
69 # include <openssl/bio.h>
71 #include <openssl/lhash.h>
75 void lh_stats(LHASH
*lh
, FILE *out
)
77 fprintf(out
, "num_items = %lu\n", lh
->num_items
);
78 fprintf(out
, "num_nodes = %u\n", lh
->num_nodes
);
79 fprintf(out
, "num_alloc_nodes = %u\n", lh
->num_alloc_nodes
);
80 fprintf(out
, "num_expands = %lu\n", lh
->num_expands
);
81 fprintf(out
, "num_expand_reallocs = %lu\n", lh
->num_expand_reallocs
);
82 fprintf(out
, "num_contracts = %lu\n", lh
->num_contracts
);
83 fprintf(out
, "num_contract_reallocs = %lu\n", lh
->num_contract_reallocs
);
84 fprintf(out
, "num_hash_calls = %lu\n", lh
->num_hash_calls
);
85 fprintf(out
, "num_comp_calls = %lu\n", lh
->num_comp_calls
);
86 fprintf(out
, "num_insert = %lu\n", lh
->num_insert
);
87 fprintf(out
, "num_replace = %lu\n", lh
->num_replace
);
88 fprintf(out
, "num_delete = %lu\n", lh
->num_delete
);
89 fprintf(out
, "num_no_delete = %lu\n", lh
->num_no_delete
);
90 fprintf(out
, "num_retrieve = %lu\n", lh
->num_retrieve
);
91 fprintf(out
, "num_retrieve_miss = %lu\n", lh
->num_retrieve_miss
);
92 fprintf(out
, "num_hash_comps = %lu\n", lh
->num_hash_comps
);
94 fprintf(out
, "p = %u\n", lh
->p
);
95 fprintf(out
, "pmax = %u\n", lh
->pmax
);
96 fprintf(out
, "up_load = %lu\n", lh
->up_load
);
97 fprintf(out
, "down_load = %lu\n", lh
->down_load
);
101 void lh_node_stats(LHASH
*lh
, FILE *out
)
106 for (i
= 0; i
< lh
->num_nodes
; i
++) {
107 for (n
= lh
->b
[i
], num
= 0; n
!= NULL
; n
= n
->next
)
109 fprintf(out
, "node %6u -> %3u\n", i
, num
);
113 void lh_node_usage_stats(LHASH
*lh
, FILE *out
)
118 unsigned long total
= 0, n_used
= 0;
120 for (i
= 0; i
< lh
->num_nodes
; i
++) {
121 for (n
= lh
->b
[i
], num
= 0; n
!= NULL
; n
= n
->next
)
128 fprintf(out
, "%lu nodes used out of %u\n", n_used
, lh
->num_nodes
);
129 fprintf(out
, "%lu items\n", total
);
132 fprintf(out
, "load %d.%02d actual load %d.%02d\n",
133 (int)(total
/ lh
->num_nodes
),
134 (int)((total
% lh
->num_nodes
) * 100 / lh
->num_nodes
),
135 (int)(total
/ n_used
), (int)((total
% n_used
) * 100 / n_used
));
140 # ifndef OPENSSL_NO_FP_API
141 void lh_stats(const _LHASH
*lh
, FILE *fp
)
145 bp
= BIO_new(BIO_s_file());
148 BIO_set_fp(bp
, fp
, BIO_NOCLOSE
);
149 lh_stats_bio(lh
, bp
);
154 void lh_node_stats(const _LHASH
*lh
, FILE *fp
)
158 bp
= BIO_new(BIO_s_file());
161 BIO_set_fp(bp
, fp
, BIO_NOCLOSE
);
162 lh_node_stats_bio(lh
, bp
);
167 void lh_node_usage_stats(const _LHASH
*lh
, FILE *fp
)
171 bp
= BIO_new(BIO_s_file());
174 BIO_set_fp(bp
, fp
, BIO_NOCLOSE
);
175 lh_node_usage_stats_bio(lh
, bp
);
182 void lh_stats_bio(const _LHASH
*lh
, BIO
*out
)
184 BIO_printf(out
, "num_items = %lu\n", lh
->num_items
);
185 BIO_printf(out
, "num_nodes = %u\n", lh
->num_nodes
);
186 BIO_printf(out
, "num_alloc_nodes = %u\n", lh
->num_alloc_nodes
);
187 BIO_printf(out
, "num_expands = %lu\n", lh
->num_expands
);
188 BIO_printf(out
, "num_expand_reallocs = %lu\n", lh
->num_expand_reallocs
);
189 BIO_printf(out
, "num_contracts = %lu\n", lh
->num_contracts
);
190 BIO_printf(out
, "num_contract_reallocs = %lu\n",
191 lh
->num_contract_reallocs
);
192 BIO_printf(out
, "num_hash_calls = %lu\n", lh
->num_hash_calls
);
193 BIO_printf(out
, "num_comp_calls = %lu\n", lh
->num_comp_calls
);
194 BIO_printf(out
, "num_insert = %lu\n", lh
->num_insert
);
195 BIO_printf(out
, "num_replace = %lu\n", lh
->num_replace
);
196 BIO_printf(out
, "num_delete = %lu\n", lh
->num_delete
);
197 BIO_printf(out
, "num_no_delete = %lu\n", lh
->num_no_delete
);
198 BIO_printf(out
, "num_retrieve = %lu\n", lh
->num_retrieve
);
199 BIO_printf(out
, "num_retrieve_miss = %lu\n", lh
->num_retrieve_miss
);
200 BIO_printf(out
, "num_hash_comps = %lu\n", lh
->num_hash_comps
);
202 BIO_printf(out
, "p = %u\n", lh
->p
);
203 BIO_printf(out
, "pmax = %u\n", lh
->pmax
);
204 BIO_printf(out
, "up_load = %lu\n", lh
->up_load
);
205 BIO_printf(out
, "down_load = %lu\n", lh
->down_load
);
209 void lh_node_stats_bio(const _LHASH
*lh
, BIO
*out
)
214 for (i
= 0; i
< lh
->num_nodes
; i
++) {
215 for (n
= lh
->b
[i
], num
= 0; n
!= NULL
; n
= n
->next
)
217 BIO_printf(out
, "node %6u -> %3u\n", i
, num
);
221 void lh_node_usage_stats_bio(const _LHASH
*lh
, BIO
*out
)
226 unsigned long total
= 0, n_used
= 0;
228 for (i
= 0; i
< lh
->num_nodes
; i
++) {
229 for (n
= lh
->b
[i
], num
= 0; n
!= NULL
; n
= n
->next
)
236 BIO_printf(out
, "%lu nodes used out of %u\n", n_used
, lh
->num_nodes
);
237 BIO_printf(out
, "%lu items\n", total
);
240 BIO_printf(out
, "load %d.%02d actual load %d.%02d\n",
241 (int)(total
/ lh
->num_nodes
),
242 (int)((total
% lh
->num_nodes
) * 100 / lh
->num_nodes
),
243 (int)(total
/ n_used
), (int)((total
% n_used
) * 100 / n_used
));