* dump_gap_stats() - print stats on gap sizes */
| 493 | * dump_gap_stats() - print stats on gap sizes |
| 494 | */ |
| 495 | static inline void |
| 496 | dump_gap_stats(const struct gap_stats *stats, struct sbuf *s) |
| 497 | { |
| 498 | int i; |
| 499 | |
| 500 | sbuf_printf(s, "number of maximal free ranges: %jd\n", |
| 501 | (intmax_t)stats->num); |
| 502 | sbuf_printf(s, "largest free range: %jd\n", (intmax_t)stats->max); |
| 503 | sbuf_printf(s, "average maximal free range size: %jd\n", |
| 504 | (intmax_t)stats->avg); |
| 505 | sbuf_printf(s, "number of maximal free ranges of different sizes:\n"); |
| 506 | sbuf_printf(s, " count | size range\n"); |
| 507 | sbuf_printf(s, " ----- | ----------\n"); |
| 508 | for (i = 0; i < stats->max_bucket; i++) { |
| 509 | if (stats->histo[i] != 0) { |
| 510 | sbuf_printf(s, "%20jd | ", |
| 511 | (intmax_t)stats->histo[i]); |
| 512 | if (fib[i] != fib[i + 1] - 1) |
| 513 | sbuf_printf(s, "%jd to %jd\n", (intmax_t)fib[i], |
| 514 | (intmax_t)fib[i + 1] - 1); |
| 515 | else |
| 516 | sbuf_printf(s, "%jd\n", (intmax_t)fib[i]); |
| 517 | } |
| 518 | } |
| 519 | sbuf_printf(s, "%20jd | ", (intmax_t)stats->histo[i]); |
| 520 | if (stats->histo[i] > 1) |
| 521 | sbuf_printf(s, "%jd to %jd\n", (intmax_t)fib[i], |
| 522 | (intmax_t)stats->max); |
| 523 | else |
| 524 | sbuf_printf(s, "%jd\n", (intmax_t)stats->max); |
| 525 | } |
| 526 | |
| 527 | /* |
| 528 | * blist_stats() - dump radix tree stats |
no test coverage detected