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