Lines Matching refs:lh
73 void lh_stats(LHASH *lh, FILE *out)
75 fprintf(out,"num_items = %lu\n",lh->num_items);
76 fprintf(out,"num_nodes = %u\n",lh->num_nodes);
77 fprintf(out,"num_alloc_nodes = %u\n",lh->num_alloc_nodes);
78 fprintf(out,"num_expands = %lu\n",lh->num_expands);
79 fprintf(out,"num_expand_reallocs = %lu\n",lh->num_expand_reallocs);
80 fprintf(out,"num_contracts = %lu\n",lh->num_contracts);
81 fprintf(out,"num_contract_reallocs = %lu\n",lh->num_contract_reallocs);
82 fprintf(out,"num_hash_calls = %lu\n",lh->num_hash_calls);
83 fprintf(out,"num_comp_calls = %lu\n",lh->num_comp_calls);
84 fprintf(out,"num_insert = %lu\n",lh->num_insert);
85 fprintf(out,"num_replace = %lu\n",lh->num_replace);
86 fprintf(out,"num_delete = %lu\n",lh->num_delete);
87 fprintf(out,"num_no_delete = %lu\n",lh->num_no_delete);
88 fprintf(out,"num_retrieve = %lu\n",lh->num_retrieve);
89 fprintf(out,"num_retrieve_miss = %lu\n",lh->num_retrieve_miss);
90 fprintf(out,"num_hash_comps = %lu\n",lh->num_hash_comps);
92 fprintf(out,"p = %u\n",lh->p);
93 fprintf(out,"pmax = %u\n",lh->pmax);
94 fprintf(out,"up_load = %lu\n",lh->up_load);
95 fprintf(out,"down_load = %lu\n",lh->down_load);
99 void lh_node_stats(LHASH *lh, FILE *out)
104 for (i=0; i<lh->num_nodes; i++)
106 for (n=lh->b[i],num=0; n != NULL; n=n->next)
112 void lh_node_usage_stats(LHASH *lh, FILE *out)
119 for (i=0; i<lh->num_nodes; i++)
121 for (n=lh->b[i],num=0; n != NULL; n=n->next)
129 fprintf(out,"%lu nodes used out of %u\n",n_used,lh->num_nodes);
133 (int)(total/lh->num_nodes),
134 (int)((total%lh->num_nodes)*100/lh->num_nodes),
142 void lh_stats(const _LHASH *lh, FILE *fp)
149 lh_stats_bio(lh,bp);
154 void lh_node_stats(const _LHASH *lh, FILE *fp)
161 lh_node_stats_bio(lh,bp);
166 void lh_node_usage_stats(const _LHASH *lh, FILE *fp)
173 lh_node_usage_stats_bio(lh,bp);
180 void lh_stats_bio(const _LHASH *lh, BIO *out)
182 BIO_printf(out,"num_items = %lu\n",lh->num_items);
183 BIO_printf(out,"num_nodes = %u\n",lh->num_nodes);
184 BIO_printf(out,"num_alloc_nodes = %u\n",lh->num_alloc_nodes);
185 BIO_printf(out,"num_expands = %lu\n",lh->num_expands);
187 lh->num_expand_reallocs);
188 BIO_printf(out,"num_contracts = %lu\n",lh->num_contracts);
190 lh->num_contract_reallocs);
191 BIO_printf(out,"num_hash_calls = %lu\n",lh->num_hash_calls);
192 BIO_printf(out,"num_comp_calls = %lu\n",lh->num_comp_calls);
193 BIO_printf(out,"num_insert = %lu\n",lh->num_insert);
194 BIO_printf(out,"num_replace = %lu\n",lh->num_replace);
195 BIO_printf(out,"num_delete = %lu\n",lh->num_delete);
196 BIO_printf(out,"num_no_delete = %lu\n",lh->num_no_delete);
197 BIO_printf(out,"num_retrieve = %lu\n",lh->num_retrieve);
198 BIO_printf(out,"num_retrieve_miss = %lu\n",lh->num_retrieve_miss);
199 BIO_printf(out,"num_hash_comps = %lu\n",lh->num_hash_comps);
201 BIO_printf(out,"p = %u\n",lh->p);
202 BIO_printf(out,"pmax = %u\n",lh->pmax);
203 BIO_printf(out,"up_load = %lu\n",lh->up_load);
204 BIO_printf(out,"down_load = %lu\n",lh->down_load);
208 void lh_node_stats_bio(const _LHASH *lh, BIO *out)
213 for (i=0; i<lh->num_nodes; i++)
215 for (n=lh->b[i],num=0; n != NULL; n=n->next)
221 void lh_node_usage_stats_bio(const _LHASH *lh, BIO *out)
228 for (i=0; i<lh->num_nodes; i++)
230 for (n=lh->b[i],num=0; n != NULL; n=n->next)
238 BIO_printf(out,"%lu nodes used out of %u\n",n_used,lh->num_nodes);
242 (int)(total/lh->num_nodes),
243 (int)((total%lh->num_nodes)*100/lh->num_nodes),
