Lines Matching defs:lh
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)
113 void lh_node_usage_stats(LHASH *lh, FILE *out)
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);
133 (int)(total / lh->num_nodes),
134 (int)((total % lh->num_nodes) * 100 / lh->num_nodes),
141 void lh_stats(const _LHASH *lh, FILE *fp)
149 lh_stats_bio(lh, bp);
154 void lh_node_stats(const _LHASH *lh, FILE *fp)
162 lh_node_stats_bio(lh, bp);
167 void lh_node_usage_stats(const _LHASH *lh, FILE *fp)
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);
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)
221 void lh_node_usage_stats_bio(const _LHASH *lh, BIO *out)
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);
241 (int)(total / lh->num_nodes),
242 (int)((total % lh->num_nodes) * 100 / lh->num_nodes),