summaryrefslogtreecommitdiff
path: root/src/lib/libcrypto/lhash/lh_stats.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/lib/libcrypto/lhash/lh_stats.c')
-rw-r--r--src/lib/libcrypto/lhash/lh_stats.c271
1 files changed, 0 insertions, 271 deletions
diff --git a/src/lib/libcrypto/lhash/lh_stats.c b/src/lib/libcrypto/lhash/lh_stats.c
deleted file mode 100644
index 80b931c12b..0000000000
--- a/src/lib/libcrypto/lhash/lh_stats.c
+++ /dev/null
@@ -1,271 +0,0 @@
1/* crypto/lhash/lh_stats.c */
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/* If you wish to build this outside of SSLeay, remove the following lines
63 * and things should work as expected */
64#include "cryptlib.h"
65
66#include <openssl/lhash.h>
67
68#ifndef HEADER_BIO_H
69
70void lh_stats(LHASH *lh, FILE *out)
71 {
72 fprintf(out,"num_items = %lu\n",lh->num_items);
73 fprintf(out,"num_nodes = %u\n",lh->num_nodes);
74 fprintf(out,"num_alloc_nodes = %u\n",lh->num_alloc_nodes);
75 fprintf(out,"num_expands = %lu\n",lh->num_expands);
76 fprintf(out,"num_expand_reallocs = %lu\n",lh->num_expand_reallocs);
77 fprintf(out,"num_contracts = %lu\n",lh->num_contracts);
78 fprintf(out,"num_contract_reallocs = %lu\n",lh->num_contract_reallocs);
79 fprintf(out,"num_hash_calls = %lu\n",lh->num_hash_calls);
80 fprintf(out,"num_comp_calls = %lu\n",lh->num_comp_calls);
81 fprintf(out,"num_insert = %lu\n",lh->num_insert);
82 fprintf(out,"num_replace = %lu\n",lh->num_replace);
83 fprintf(out,"num_delete = %lu\n",lh->num_delete);
84 fprintf(out,"num_no_delete = %lu\n",lh->num_no_delete);
85 fprintf(out,"num_retrieve = %lu\n",lh->num_retrieve);
86 fprintf(out,"num_retrieve_miss = %lu\n",lh->num_retrieve_miss);
87 fprintf(out,"num_hash_comps = %lu\n",lh->num_hash_comps);
88#ifdef DEBUG
89 fprintf(out,"p = %u\n",lh->p);
90 fprintf(out,"pmax = %u\n",lh->pmax);
91 fprintf(out,"up_load = %lu\n",lh->up_load);
92 fprintf(out,"down_load = %lu\n",lh->down_load);
93#endif
94 }
95
96void lh_node_stats(LHASH *lh, FILE *out)
97 {
98 LHASH_NODE *n;
99 unsigned int i,num;
100
101 for (i=0; i<lh->num_nodes; i++)
102 {
103 for (n=lh->b[i],num=0; n != NULL; n=n->next)
104 num++;
105 fprintf(out,"node %6u -> %3u\n",i,num);
106 }
107 }
108
109void lh_node_usage_stats(LHASH *lh, FILE *out)
110 {
111 LHASH_NODE *n;
112 unsigned long num;
113 unsigned int i;
114 unsigned long total=0,n_used=0;
115
116 for (i=0; i<lh->num_nodes; i++)
117 {
118 for (n=lh->b[i],num=0; n != NULL; n=n->next)
119 num++;
120 if (num != 0)
121 {
122 n_used++;
123 total+=num;
124 }
125 }
126 fprintf(out,"%lu nodes used out of %u\n",n_used,lh->num_nodes);
127 fprintf(out,"%lu items\n",total);
128 if (n_used == 0) return;
129 fprintf(out,"load %d.%02d actual load %d.%02d\n",
130 (int)(total/lh->num_nodes),
131 (int)((total%lh->num_nodes)*100/lh->num_nodes),
132 (int)(total/n_used),
133 (int)((total%n_used)*100/n_used));
134 }
135
136#else
137
138#ifndef NO_FP_API
139void lh_stats(LHASH *lh, FILE *fp)
140 {
141 BIO *bp;
142
143 bp=BIO_new(BIO_s_file());
144 if (bp == NULL) goto end;
145 BIO_set_fp(bp,fp,BIO_NOCLOSE);
146 lh_stats_bio(lh,bp);
147 BIO_free(bp);
148end:;
149 }
150
151void lh_node_stats(LHASH *lh, FILE *fp)
152 {
153 BIO *bp;
154
155 bp=BIO_new(BIO_s_file());
156 if (bp == NULL) goto end;
157 BIO_set_fp(bp,fp,BIO_NOCLOSE);
158 lh_node_stats_bio(lh,bp);
159 BIO_free(bp);
160end:;
161 }
162
163void lh_node_usage_stats(LHASH *lh, FILE *fp)
164 {
165 BIO *bp;
166
167 bp=BIO_new(BIO_s_file());
168 if (bp == NULL) goto end;
169 BIO_set_fp(bp,fp,BIO_NOCLOSE);
170 lh_node_usage_stats_bio(lh,bp);
171 BIO_free(bp);
172end:;
173 }
174
175#endif
176
177void lh_stats_bio(LHASH *lh, BIO *out)
178 {
179 char buf[128];
180
181 sprintf(buf,"num_items = %lu\n",lh->num_items);
182 BIO_puts(out,buf);
183 sprintf(buf,"num_nodes = %u\n",lh->num_nodes);
184 BIO_puts(out,buf);
185 sprintf(buf,"num_alloc_nodes = %u\n",lh->num_alloc_nodes);
186 BIO_puts(out,buf);
187 sprintf(buf,"num_expands = %lu\n",lh->num_expands);
188 BIO_puts(out,buf);
189 sprintf(buf,"num_expand_reallocs = %lu\n",lh->num_expand_reallocs);
190 BIO_puts(out,buf);
191 sprintf(buf,"num_contracts = %lu\n",lh->num_contracts);
192 BIO_puts(out,buf);
193 sprintf(buf,"num_contract_reallocs = %lu\n",lh->num_contract_reallocs);
194 BIO_puts(out,buf);
195 sprintf(buf,"num_hash_calls = %lu\n",lh->num_hash_calls);
196 BIO_puts(out,buf);
197 sprintf(buf,"num_comp_calls = %lu\n",lh->num_comp_calls);
198 BIO_puts(out,buf);
199 sprintf(buf,"num_insert = %lu\n",lh->num_insert);
200 BIO_puts(out,buf);
201 sprintf(buf,"num_replace = %lu\n",lh->num_replace);
202 BIO_puts(out,buf);
203 sprintf(buf,"num_delete = %lu\n",lh->num_delete);
204 BIO_puts(out,buf);
205 sprintf(buf,"num_no_delete = %lu\n",lh->num_no_delete);
206 BIO_puts(out,buf);
207 sprintf(buf,"num_retrieve = %lu\n",lh->num_retrieve);
208 BIO_puts(out,buf);
209 sprintf(buf,"num_retrieve_miss = %lu\n",lh->num_retrieve_miss);
210 BIO_puts(out,buf);
211 sprintf(buf,"num_hash_comps = %lu\n",lh->num_hash_comps);
212 BIO_puts(out,buf);
213#ifdef DEBUG
214 sprintf(buf,"p = %u\n",lh->p);
215 BIO_puts(out,buf);
216 sprintf(buf,"pmax = %u\n",lh->pmax);
217 BIO_puts(out,buf);
218 sprintf(buf,"up_load = %lu\n",lh->up_load);
219 BIO_puts(out,buf);
220 sprintf(buf,"down_load = %lu\n",lh->down_load);
221 BIO_puts(out,buf);
222#endif
223 }
224
225void lh_node_stats_bio(LHASH *lh, BIO *out)
226 {
227 LHASH_NODE *n;
228 unsigned int i,num;
229 char buf[128];
230
231 for (i=0; i<lh->num_nodes; i++)
232 {
233 for (n=lh->b[i],num=0; n != NULL; n=n->next)
234 num++;
235 sprintf(buf,"node %6u -> %3u\n",i,num);
236 BIO_puts(out,buf);
237 }
238 }
239
240void lh_node_usage_stats_bio(LHASH *lh, BIO *out)
241 {
242 LHASH_NODE *n;
243 unsigned long num;
244 unsigned int i;
245 unsigned long total=0,n_used=0;
246 char buf[128];
247
248 for (i=0; i<lh->num_nodes; i++)
249 {
250 for (n=lh->b[i],num=0; n != NULL; n=n->next)
251 num++;
252 if (num != 0)
253 {
254 n_used++;
255 total+=num;
256 }
257 }
258 sprintf(buf,"%lu nodes used out of %u\n",n_used,lh->num_nodes);
259 BIO_puts(out,buf);
260 sprintf(buf,"%lu items\n",total);
261 BIO_puts(out,buf);
262 if (n_used == 0) return;
263 sprintf(buf,"load %d.%02d actual load %d.%02d\n",
264 (int)(total/lh->num_nodes),
265 (int)((total%lh->num_nodes)*100/lh->num_nodes),
266 (int)(total/n_used),
267 (int)((total%n_used)*100/n_used));
268 BIO_puts(out,buf);
269 }
270
271#endif
generated by cgit v1.2.3-55-g6feb (git 2.39.1) at 2025-05-03 19:51:11 +0000