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