Buckets:
| /* ---------------------------------------------------------------------------- | |
| Copyright (c) 2018-2025, Microsoft Research, Daan Leijen | |
| This is free software; you can redistribute it and/or modify it under the | |
| terms of the MIT license. A copy of the license can be found in the file | |
| "LICENSE" at the root of this distribution. | |
| -----------------------------------------------------------------------------*/ | |
| /* ----------------------------------------------------------- | |
| Statistics operations | |
| ----------------------------------------------------------- */ | |
| static void mi_stat_update_mt(mi_stat_count_t* stat, int64_t amount) { | |
| if (amount == 0) return; | |
| // add atomically | |
| int64_t current = mi_atomic_addi64_relaxed(&stat->current, amount); | |
| mi_atomic_maxi64_relaxed(&stat->peak, current + amount); | |
| if (amount > 0) { | |
| mi_atomic_addi64_relaxed(&stat->total, amount); | |
| } | |
| } | |
| static void mi_stat_update(mi_stat_count_t* stat, int64_t amount) { | |
| if (amount == 0) return; | |
| // add thread local | |
| stat->current += amount; | |
| if (stat->current > stat->peak) { stat->peak = stat->current; } | |
| if (amount > 0) { stat->total += amount; } | |
| } | |
| void __mi_stat_counter_increase_mt(mi_stat_counter_t* stat, size_t amount) { | |
| mi_atomic_addi64_relaxed(&stat->total, (int64_t)amount); | |
| } | |
| void __mi_stat_counter_increase(mi_stat_counter_t* stat, size_t amount) { | |
| stat->total += amount; | |
| } | |
| void __mi_stat_increase_mt(mi_stat_count_t* stat, size_t amount) { | |
| mi_stat_update_mt(stat, (int64_t)amount); | |
| } | |
| void __mi_stat_increase(mi_stat_count_t* stat, size_t amount) { | |
| mi_stat_update(stat, (int64_t)amount); | |
| } | |
| void __mi_stat_decrease_mt(mi_stat_count_t* stat, size_t amount) { | |
| mi_stat_update_mt(stat, -((int64_t)amount)); | |
| } | |
| void __mi_stat_decrease(mi_stat_count_t* stat, size_t amount) { | |
| mi_stat_update(stat, -((int64_t)amount)); | |
| } | |
| // Adjust stats to compensate; for example before committing a range, | |
| // first adjust downwards with parts that were already committed so | |
| // we avoid double counting. | |
| static void mi_stat_adjust_mt(mi_stat_count_t* stat, int64_t amount) { | |
| if (amount == 0) return; | |
| // adjust atomically | |
| mi_atomic_addi64_relaxed(&stat->current, amount); | |
| mi_atomic_addi64_relaxed(&stat->total, amount); | |
| } | |
| static void mi_stat_adjust(mi_stat_count_t* stat, int64_t amount) { | |
| if (amount == 0) return; | |
| stat->current += amount; | |
| stat->total += amount; | |
| } | |
| void __mi_stat_adjust_increase_mt(mi_stat_count_t* stat, size_t amount) { | |
| mi_stat_adjust_mt(stat, (int64_t)amount); | |
| } | |
| void __mi_stat_adjust_increase(mi_stat_count_t* stat, size_t amount) { | |
| mi_stat_adjust(stat, (int64_t)amount); | |
| } | |
| void __mi_stat_adjust_decrease_mt(mi_stat_count_t* stat, size_t amount) { | |
| mi_stat_adjust_mt(stat, -((int64_t)amount)); | |
| } | |
| void __mi_stat_adjust_decrease(mi_stat_count_t* stat, size_t amount) { | |
| mi_stat_adjust(stat, -((int64_t)amount)); | |
| } | |
| // must be thread safe as it is called from stats_merge | |
| static void mi_stat_count_add_mt(mi_stat_count_t* stat, const mi_stat_count_t* src) { | |
| if (stat==src) return; | |
| mi_atomic_void_addi64_relaxed(&stat->total, &src->total); | |
| const int64_t prev_current = mi_atomic_addi64_relaxed(&stat->current, src->current); | |
| // Global current plus thread peak approximates new global peak | |
| // note: peak scores do really not work across threads. | |
| // we used to just add them together but that often overestimates in practice. | |
| // similarly, max does not seem to work well. The current approach | |
| // by Artem Kharytoniuk (@artem-lunarg) seems to work better, see PR#1112 | |
| // for a longer description. | |
| mi_atomic_maxi64_relaxed(&stat->peak, prev_current + src->peak); | |
| } | |
| static void mi_stat_counter_add_mt(mi_stat_counter_t* stat, const mi_stat_counter_t* src) { | |
| if (stat==src) return; | |
| mi_atomic_void_addi64_relaxed(&stat->total, &src->total); | |
| } | |
| // must be thread safe as it is called from stats_merge | |
| static void mi_stats_add(mi_stats_t* stats, const mi_stats_t* src) { | |
| if (stats==src) return; | |
| // copy all fields | |
| MI_STAT_FIELDS() | |
| for (size_t i = 0; i <= MI_BIN_HUGE; i++) { | |
| mi_stat_count_add_mt(&stats->malloc_bins[i], &src->malloc_bins[i]); | |
| } | |
| for (size_t i = 0; i <= MI_BIN_HUGE; i++) { | |
| mi_stat_count_add_mt(&stats->page_bins[i], &src->page_bins[i]); | |
| } | |
| } | |
| /* ----------------------------------------------------------- | |
| Display statistics | |
| ----------------------------------------------------------- */ | |
| // unit > 0 : size in binary bytes | |
| // unit == 0: count as decimal | |
| // unit < 0 : count in binary | |
| static void mi_printf_amount(int64_t n, int64_t unit, mi_output_fun* out, void* arg, const char* fmt) { | |
| char buf[32]; _mi_memzero_var(buf); | |
| int len = 32; | |
| const char* suffix = (unit <= 0 ? " " : "B"); | |
| const int64_t base = (unit == 0 ? 1000 : 1024); | |
| if (unit>0) n *= unit; | |
| const int64_t pos = (n < 0 ? -n : n); | |
| if (pos < base) { | |
| if (n!=1 || suffix[0] != 'B') { // skip printing 1 B for the unit column | |
| _mi_snprintf(buf, len, "%lld %-3s", (long long)n, (n==0 ? "" : suffix)); | |
| } | |
| } | |
| else { | |
| int64_t divider = base; | |
| const char* magnitude = "K"; | |
| if (pos >= divider*base) { divider *= base; magnitude = "M"; } | |
| if (pos >= divider*base) { divider *= base; magnitude = "G"; } | |
| const int64_t tens = (n / (divider/10)); | |
| const long whole = (long)(tens/10); | |
| const long frac1 = (long)(tens%10); | |
| char unitdesc[8]; | |
| _mi_snprintf(unitdesc, 8, "%s%s%s", magnitude, (base==1024 ? "i" : ""), suffix); | |
| _mi_snprintf(buf, len, "%ld.%ld %-3s", whole, (frac1 < 0 ? -frac1 : frac1), unitdesc); | |
| } | |
| _mi_fprintf(out, arg, (fmt==NULL ? "%12s" : fmt), buf); | |
| } | |
| static void mi_print_amount(int64_t n, int64_t unit, mi_output_fun* out, void* arg) { | |
| mi_printf_amount(n,unit,out,arg,NULL); | |
| } | |
| static void mi_print_count(int64_t n, int64_t unit, mi_output_fun* out, void* arg) { | |
| if (unit==1) _mi_fprintf(out, arg, "%12s"," "); | |
| else mi_print_amount(n,0,out,arg); | |
| } | |
| static void mi_stat_print_ex(const mi_stat_count_t* stat, const char* msg, int64_t unit, mi_output_fun* out, void* arg, const char* notok ) { | |
| _mi_fprintf(out, arg," %-10s:", msg); | |
| if (unit != 0) { | |
| if (unit > 0) { | |
| mi_print_amount(stat->peak, unit, out, arg); | |
| mi_print_amount(stat->total, unit, out, arg); | |
| // mi_print_amount(stat->freed, unit, out, arg); | |
| mi_print_amount(stat->current, unit, out, arg); | |
| mi_print_amount(unit, 1, out, arg); | |
| mi_print_count(stat->total, unit, out, arg); | |
| } | |
| else { | |
| mi_print_amount(stat->peak, -1, out, arg); | |
| mi_print_amount(stat->total, -1, out, arg); | |
| // mi_print_amount(stat->freed, -1, out, arg); | |
| mi_print_amount(stat->current, -1, out, arg); | |
| if (unit == -1) { | |
| _mi_fprintf(out, arg, "%24s", ""); | |
| } | |
| else { | |
| mi_print_amount(-unit, 1, out, arg); | |
| mi_print_count((stat->total / -unit), 0, out, arg); | |
| } | |
| } | |
| if (stat->current != 0) { | |
| _mi_fprintf(out, arg, " "); | |
| _mi_fprintf(out, arg, (notok == NULL ? "not all freed" : notok)); | |
| _mi_fprintf(out, arg, "\n"); | |
| } | |
| else { | |
| _mi_fprintf(out, arg, " ok\n"); | |
| } | |
| } | |
| else { | |
| mi_print_amount(stat->peak, 0, out, arg); | |
| mi_print_amount(stat->total, 0, out, arg); | |
| mi_print_amount(stat->current, 0, out, arg); | |
| _mi_fprintf(out, arg, "\n"); | |
| } | |
| } | |
| static void mi_stat_print(const mi_stat_count_t* stat, const char* msg, int64_t unit, mi_output_fun* out, void* arg) { | |
| mi_stat_print_ex(stat, msg, unit, out, arg, NULL); | |
| } | |
| static void mi_stat_total_print(const mi_stat_count_t* stat, const char* msg, int64_t unit, mi_output_fun* out, void* arg) { | |
| _mi_fprintf(out, arg, " %-10s:", msg); | |
| _mi_fprintf(out, arg, "%12s", " "); // no peak | |
| mi_print_amount(stat->total, unit, out, arg); | |
| _mi_fprintf(out, arg, "\n"); | |
| } | |
| static void mi_stat_counter_print(const mi_stat_counter_t* stat, const char* msg, mi_output_fun* out, void* arg ) { | |
| _mi_fprintf(out, arg, " %-10s:", msg); | |
| mi_print_amount(stat->total, 0, out, arg); | |
| _mi_fprintf(out, arg, "\n"); | |
| } | |
| static void mi_stat_counter_print_size(const mi_stat_counter_t* stat, const char* msg, mi_output_fun* out, void* arg ) { | |
| _mi_fprintf(out, arg, " %-10s:", msg); | |
| mi_print_amount(stat->total, 1, out, arg); | |
| _mi_fprintf(out, arg, "\n"); | |
| } | |
| static void mi_stat_average_print(int64_t count, int64_t total, const char* msg, mi_output_fun* out, void* arg) { | |
| const int64_t avg_tens = (count == 0 ? 0 : (total*10 / count)); | |
| const int64_t avg_whole = avg_tens/10; | |
| const int64_t avg_frac1 = avg_tens%10; | |
| _mi_fprintf(out, arg, " %-10s: %5lld.%lld avg\n", msg, avg_whole, avg_frac1); | |
| } | |
| static void mi_print_header(const char* name,mi_output_fun* out, void* arg ) { | |
| _mi_fprintf(out, arg, " %-11s %11s %11s %11s %11s %11s\n", | |
| name, "peak ", "total ", "current ", "block ", "total# "); | |
| } | |
| static bool mi_stats_print_bins(const mi_stat_count_t* bins, size_t max, mi_output_fun* out, void* arg) { | |
| bool found = false; | |
| char buf[64]; | |
| for (size_t i = 0; i <= max; i++) { | |
| if (bins[i].total > 0) { | |
| found = true; | |
| const size_t unit = _mi_bin_size((uint8_t)i); | |
| const char* pagekind = (unit <= MI_SMALL_MAX_OBJ_SIZE ? "S" : | |
| (unit <= MI_MEDIUM_MAX_OBJ_SIZE ? "M" : | |
| (unit <= MI_LARGE_MAX_OBJ_SIZE ? "L" : "H"))); | |
| _mi_snprintf(buf, 64, "bin%2s %3lu", pagekind, (long)i); | |
| mi_stat_print(&bins[i], buf, (int64_t)unit, out, arg); | |
| } | |
| } | |
| if (found) { | |
| _mi_fprintf(out, arg, "\n"); | |
| } | |
| return found; | |
| } | |
| //------------------------------------------------------------ | |
| // Use an output wrapper for line-buffered output | |
| // (which is nice when using loggers etc.) | |
| //------------------------------------------------------------ | |
| typedef struct buffered_s { | |
| mi_output_fun* out; // original output function | |
| void* arg; // and state | |
| char* buf; // local buffer of at least size `count+1` | |
| size_t used; // currently used chars `used <= count` | |
| size_t count; // total chars available for output | |
| } buffered_t; | |
| static void mi_buffered_flush(buffered_t* buf) { | |
| buf->buf[buf->used] = 0; | |
| _mi_fputs(buf->out, buf->arg, NULL, buf->buf); | |
| buf->used = 0; | |
| } | |
| static void mi_cdecl mi_buffered_out(const char* msg, void* arg) { | |
| buffered_t* buf = (buffered_t*)arg; | |
| if (msg==NULL || buf==NULL) return; | |
| for (const char* src = msg; *src != 0; src++) { | |
| char c = *src; | |
| if (buf->used >= buf->count) mi_buffered_flush(buf); | |
| mi_assert_internal(buf->used < buf->count); | |
| buf->buf[buf->used++] = c; | |
| if (c == '\n') mi_buffered_flush(buf); | |
| } | |
| } | |
| //------------------------------------------------------------ | |
| // Print statistics | |
| //------------------------------------------------------------ | |
| mi_decl_export void mi_process_info_print_out(mi_output_fun* out, void* arg) mi_attr_noexcept | |
| { | |
| size_t elapsed; | |
| size_t user_time; | |
| size_t sys_time; | |
| size_t current_rss; | |
| size_t peak_rss; | |
| size_t current_commit; | |
| size_t peak_commit; | |
| size_t page_faults; | |
| mi_process_info(&elapsed, &user_time, &sys_time, ¤t_rss, &peak_rss, ¤t_commit, &peak_commit, &page_faults); | |
| _mi_fprintf(out, arg, " %-10s: %5zu.%03zu s\n", "elapsed", elapsed/1000, elapsed%1000); | |
| _mi_fprintf(out, arg, " %-10s: user: %zu.%03zu s, system: %zu.%03zu s, faults: %zu, peak rss: ", "process", | |
| user_time/1000, user_time%1000, sys_time/1000, sys_time%1000, page_faults); | |
| mi_printf_amount((int64_t)peak_rss, 1, out, arg, "%s"); | |
| if (peak_commit > 0) { | |
| _mi_fprintf(out, arg, ", peak commit: "); | |
| mi_printf_amount((int64_t)peak_commit, 1, out, arg, "%s"); | |
| } | |
| _mi_fprintf(out, arg, "\n"); | |
| } | |
| void _mi_stats_print(const char* name, size_t id, mi_stats_t* stats, mi_output_fun* out0, void* arg0) mi_attr_noexcept { | |
| // wrap the output function to be line buffered | |
| char buf[256]; _mi_memzero_var(buf); | |
| buffered_t buffer = { out0, arg0, NULL, 0, 255 }; | |
| buffer.buf = buf; | |
| mi_output_fun* out = &mi_buffered_out; | |
| void* arg = &buffer; | |
| // and print using that | |
| _mi_fprintf(out, arg, "%s %zu\n", name, id); | |
| if (stats->malloc_normal.total + stats->malloc_huge.total != 0) { | |
| mi_print_header("blocks", out, arg); | |
| mi_stats_print_bins(stats->malloc_bins, MI_BIN_HUGE, out, arg); | |
| mi_stat_print(&stats->malloc_normal, "binned", (stats->malloc_normal_count.total == 0 ? -1 : 1), out, arg); | |
| mi_stat_print(&stats->malloc_huge, "huge", (stats->malloc_huge_count.total == 0 ? -1 : 1), out, arg); | |
| mi_stat_count_t total = { 0,0,0 }; | |
| mi_stat_count_add_mt(&total, &stats->malloc_normal); | |
| mi_stat_count_add_mt(&total, &stats->malloc_huge); | |
| mi_stat_print_ex(&total, "total", 1, out, arg, ""); | |
| mi_stat_total_print(&stats->malloc_requested, "malloc req", 1, out, arg); | |
| _mi_fprintf(out, arg, "\n"); | |
| } | |
| if (stats->pages.total != 0) { | |
| mi_print_header("pages", out, arg); | |
| mi_stat_print_ex(&stats->page_committed, "touched", 1, out, arg, ""); | |
| // mi_stat_print(&stats->segments, "segments", -1, out, arg); | |
| // mi_stat_print(&stats->segments_abandoned, "-abandoned", -1, out, arg); | |
| // mi_stat_print(&stats->segments_cache, "-cached", -1, out, arg); | |
| mi_stat_print(&stats->pages, "pages", 0, out, arg); | |
| mi_stat_print(&stats->pages_abandoned, "abandoned", 0, out, arg); | |
| mi_stat_counter_print(&stats->pages_reclaim_on_alloc, "reclaima", out, arg); | |
| mi_stat_counter_print(&stats->pages_reclaim_on_free, "reclaimf", out, arg); | |
| mi_stat_counter_print(&stats->pages_reabandon_full, "reabandon", out, arg); | |
| mi_stat_counter_print(&stats->pages_unabandon_busy_wait, "waits", out, arg); | |
| mi_stat_counter_print(&stats->pages_extended, "extended", out, arg); | |
| mi_stat_counter_print(&stats->pages_retire, "retire", out, arg); | |
| mi_stat_average_print(stats->page_searches_count.total, stats->page_searches.total, "searches", out, arg); | |
| _mi_fprintf(out, arg, "\n"); | |
| } | |
| if (stats->arena_count.total > 0) { | |
| mi_print_header("arenas", out, arg); | |
| mi_stat_print_ex(&stats->reserved, "reserved", 1, out, arg, ""); | |
| mi_stat_print_ex(&stats->committed, "committed", 1, out, arg, ""); | |
| mi_stat_counter_print_size(&stats->reset, "reset", out, arg); | |
| mi_stat_counter_print_size(&stats->purged, "purged", out, arg); | |
| mi_stat_counter_print(&stats->arena_count, "arenas", out, arg); | |
| mi_stat_counter_print(&stats->arena_rollback_count, "rollback", out, arg); | |
| mi_stat_counter_print(&stats->mmap_calls, "mmaps", out, arg); | |
| mi_stat_counter_print(&stats->commit_calls, "commits", out, arg); | |
| mi_stat_counter_print(&stats->reset_calls, "resets", out, arg); | |
| mi_stat_counter_print(&stats->purge_calls, "purges", out, arg); | |
| mi_stat_counter_print(&stats->malloc_guarded_count, "guarded", out, arg); | |
| mi_stat_print_ex(&stats->theaps, "theaps", 0, out, arg, ""); | |
| mi_stat_print_ex(&stats->heaps, "heaps", 0, out, arg, ""); | |
| mi_stat_counter_print(&stats->heaps_delete_wait, "heap waits", out, arg); | |
| _mi_fprintf(out, arg, "\n"); | |
| mi_print_header("process", out, arg); | |
| mi_stat_print_ex(&stats->threads, "threads", 0, out, arg, ""); | |
| _mi_fprintf(out, arg, " %-10s: %5i\n", "numa nodes", _mi_os_numa_node_count()); | |
| mi_process_info_print_out(out, arg); | |
| } | |
| _mi_fprintf(out, arg, "\n"); | |
| } | |
| static mi_msecs_t mi_process_start; // = 0 | |
| // called on process init | |
| void _mi_stats_init(void) { | |
| if (mi_process_start == 0) { mi_process_start = _mi_clock_start(); }; | |
| } | |
| static void mi_stats_add_into(mi_stats_t* to, mi_stats_t* from) { | |
| mi_assert_internal(to != NULL && from != NULL); | |
| if (to == from) return; | |
| mi_stats_add(to, from); | |
| } | |
| void _mi_stats_merge_into(mi_stats_t* to, mi_stats_t* from) { | |
| mi_assert_internal(to != NULL && from != NULL); | |
| if (to == from) return; | |
| mi_stats_add(to, from); | |
| _mi_memzero(from, sizeof(mi_stats_t)); | |
| } | |
| static mi_stats_t* mi_stats_merge_theap_to_heap(mi_theap_t* theap) mi_attr_noexcept { | |
| mi_stats_t* stats = &theap->stats; | |
| mi_stats_t* heap_stats = &_mi_theap_heap(theap)->stats; | |
| _mi_stats_merge_into( heap_stats, stats ); | |
| return heap_stats; | |
| } | |
| static mi_stats_t* mi_heap_get_stats(mi_heap_t* heap) { | |
| if (heap==NULL) { heap = mi_heap_main(); } | |
| mi_theap_t* theap = _mi_heap_theap_peek(heap); | |
| if (theap==NULL) return &heap->stats; | |
| else return mi_stats_merge_theap_to_heap(theap); | |
| } | |
| // deprecated | |
| void mi_stats_reset(void) mi_attr_noexcept { | |
| if (!mi_theap_is_initialized(_mi_theap_default())) return; | |
| mi_heap_get_stats(mi_heap_main()); | |
| mi_heap_stats_merge_to_subproc(mi_heap_main()); | |
| } | |
| void mi_heap_stats_print_out(mi_heap_t* heap, mi_output_fun* out, void* arg) mi_attr_noexcept { | |
| if (heap==NULL) { heap = mi_heap_main(); } | |
| _mi_stats_print("heap", heap->heap_seq, mi_heap_get_stats(heap), out, arg); | |
| } | |
| typedef struct mi_heap_print_visit_info_s { | |
| mi_output_fun* out; | |
| void* out_arg; | |
| } mi_heap_print_visit_info_t; | |
| static bool mi_cdecl mi_heap_print_visitor(mi_heap_t* heap, void* arg) { | |
| mi_heap_print_visit_info_t* vinfo = (mi_heap_print_visit_info_t*)(arg); | |
| mi_heap_stats_print_out(heap, vinfo->out, vinfo->out_arg); | |
| return true; | |
| } | |
| // show each heap and then the subproc | |
| void mi_subproc_heap_stats_print_out(mi_subproc_id_t subproc_id, mi_output_fun* out, void* arg) mi_attr_noexcept { | |
| mi_subproc_t* subproc = _mi_subproc_from_id(subproc_id); | |
| if (subproc==NULL) return; | |
| mi_heap_print_visit_info_t vinfo = { out, arg }; | |
| mi_subproc_visit_heaps(subproc, &mi_heap_print_visitor, &vinfo); | |
| _mi_stats_print("subproc", subproc->subproc_seq, &subproc->stats, out, arg); | |
| } | |
| // aggregate all stats from the heaps and subproc and print those | |
| void mi_subproc_stats_print_out(mi_subproc_id_t subproc_id, mi_output_fun* out, void* arg) mi_attr_noexcept { | |
| mi_subproc_t* subproc = _mi_subproc_from_id(subproc_id); | |
| if (subproc==NULL) return; | |
| mi_stats_t_decl(stats); | |
| if (mi_subproc_stats_get(subproc_id, &stats)) { | |
| _mi_stats_print("subproc", subproc->subproc_seq, &stats, out, arg); | |
| } | |
| } | |
| void mi_stats_print_out(mi_output_fun* out, void* arg) mi_attr_noexcept { | |
| mi_subproc_stats_print_out(mi_subproc_current(),out, arg); | |
| } | |
| // deprecated | |
| void mi_stats_print(void* out) mi_attr_noexcept { | |
| // for compatibility there is an `out` parameter (which can be `stdout` or `stderr`) | |
| mi_stats_print_out((mi_output_fun*)out, NULL); | |
| } | |
| // deprecated | |
| void mi_thread_stats_print_out(mi_output_fun* out, void* arg) mi_attr_noexcept { | |
| mi_theap_t* theap = _mi_theap_default(); | |
| if (theap==NULL || !mi_theap_is_initialized(theap)) return; | |
| _mi_stats_print("heap", _mi_theap_heap(theap)->heap_seq, &theap->stats, out, arg); | |
| mi_stats_merge_theap_to_heap(_mi_theap_default()); | |
| } | |
| // ---------------------------------------------------------------- | |
| // Basic timer for convenience; use milli-seconds to avoid doubles | |
| // ---------------------------------------------------------------- | |
| static mi_msecs_t mi_clock_diff; | |
| mi_msecs_t _mi_clock_now(void) { | |
| return _mi_prim_clock_now(); | |
| } | |
| mi_msecs_t _mi_clock_start(void) { | |
| if (mi_clock_diff == 0.0) { | |
| mi_msecs_t t0 = _mi_clock_now(); | |
| mi_clock_diff = _mi_clock_now() - t0; | |
| } | |
| return _mi_clock_now(); | |
| } | |
| mi_msecs_t _mi_clock_end(mi_msecs_t start) { | |
| mi_msecs_t end = _mi_clock_now(); | |
| return (end - start - mi_clock_diff); | |
| } | |
| // -------------------------------------------------------- | |
| // Basic process statistics | |
| // -------------------------------------------------------- | |
| mi_decl_export void mi_process_info(size_t* elapsed_msecs, size_t* user_msecs, size_t* system_msecs, size_t* current_rss, size_t* peak_rss, size_t* current_commit, size_t* peak_commit, size_t* page_faults) mi_attr_noexcept | |
| { | |
| mi_process_info_t pinfo; | |
| _mi_memzero_var(pinfo); | |
| pinfo.elapsed = _mi_clock_end(mi_process_start); | |
| { const mi_subproc_t* subproc = _mi_subproc_main(); | |
| if (subproc!=NULL) { | |
| pinfo.current_commit = (size_t)(mi_atomic_loadi64_relaxed((_Atomic(int64_t)*)(&subproc->stats.committed.current))); | |
| pinfo.peak_commit = (size_t)(mi_atomic_loadi64_relaxed((_Atomic(int64_t)*)(&subproc->stats.committed.peak))); | |
| } | |
| } | |
| pinfo.current_rss = pinfo.current_commit; | |
| pinfo.peak_rss = pinfo.peak_commit; | |
| pinfo.utime = 0; | |
| pinfo.stime = 0; | |
| pinfo.page_faults = 0; | |
| _mi_prim_process_info(&pinfo); | |
| if (elapsed_msecs!=NULL) *elapsed_msecs = (pinfo.elapsed < 0 ? 0 : (pinfo.elapsed < (mi_msecs_t)PTRDIFF_MAX ? (size_t)pinfo.elapsed : PTRDIFF_MAX)); | |
| if (user_msecs!=NULL) *user_msecs = (pinfo.utime < 0 ? 0 : (pinfo.utime < (mi_msecs_t)PTRDIFF_MAX ? (size_t)pinfo.utime : PTRDIFF_MAX)); | |
| if (system_msecs!=NULL) *system_msecs = (pinfo.stime < 0 ? 0 : (pinfo.stime < (mi_msecs_t)PTRDIFF_MAX ? (size_t)pinfo.stime : PTRDIFF_MAX)); | |
| if (current_rss!=NULL) *current_rss = pinfo.current_rss; | |
| if (peak_rss!=NULL) *peak_rss = pinfo.peak_rss; | |
| if (current_commit!=NULL) *current_commit = pinfo.current_commit; | |
| if (peak_commit!=NULL) *peak_commit = pinfo.peak_commit; | |
| if (page_faults!=NULL) *page_faults = pinfo.page_faults; | |
| } | |
| mi_decl_export void mi_process_info_print(void) mi_attr_noexcept { | |
| mi_process_info_print_out(NULL, NULL); | |
| } | |
| // -------------------------------------------------------- | |
| // Return statistics | |
| // -------------------------------------------------------- | |
| size_t mi_stats_get_bin_size(size_t bin) mi_attr_noexcept { | |
| if (bin > MI_BIN_HUGE) return 0; | |
| return _mi_bin_size(bin); | |
| } | |
| static bool _mi_stats_get(const mi_stats_t* stats_in, mi_stats_t* stats_out) mi_attr_noexcept { | |
| if (stats_out == NULL || stats_out->size != sizeof(mi_stats_t) || stats_out->version != MI_STAT_VERSION) return false; | |
| if (stats_in == NULL || stats_in->size != stats_out->size) return false; | |
| _mi_memcpy(stats_out, stats_in, stats_out->size); | |
| return true; | |
| } | |
| bool mi_subproc_stats_get_exclusive(mi_subproc_id_t subproc_id, mi_stats_t* stats) mi_attr_noexcept { | |
| const mi_subproc_t* subproc = _mi_subproc_from_id(subproc_id); | |
| if (subproc==NULL) return false; | |
| return _mi_stats_get(&subproc->stats, stats); | |
| } | |
| bool mi_heap_stats_get(mi_heap_t* heap, mi_stats_t* stats) mi_attr_noexcept { | |
| return _mi_stats_get(mi_heap_get_stats(heap), stats); | |
| } | |
| static bool mi_cdecl mi_heap_aggregate_visitor(mi_heap_t* heap, void* arg) { | |
| mi_stats_t* stats = (mi_stats_t*)arg; | |
| mi_stats_add_into(stats, &heap->stats); | |
| return true; | |
| } | |
| bool mi_subproc_stats_get(mi_subproc_id_t subproc_id, mi_stats_t* stats) mi_attr_noexcept { | |
| mi_subproc_t* subproc = _mi_subproc_from_id(subproc_id); | |
| if (subproc == NULL || stats == NULL || stats->size != sizeof(mi_stats_t) || stats->version != MI_STAT_VERSION) return false; | |
| _mi_memzero(stats,stats->size); | |
| stats->size = sizeof(mi_stats_t); | |
| stats->version = MI_STAT_VERSION; | |
| mi_subproc_visit_heaps(subproc, &mi_heap_aggregate_visitor, stats); | |
| mi_stats_add_into(stats, &subproc->stats); | |
| return true; | |
| } | |
| bool mi_stats_get(mi_stats_t* stats) mi_attr_noexcept { | |
| return mi_subproc_stats_get(mi_subproc_current(), stats); | |
| } | |
| // -------------------------------------------------------- | |
| // Statics in json format | |
| // -------------------------------------------------------- | |
| typedef struct mi_json_buf_s { | |
| char* buf; | |
| size_t size; | |
| size_t used; | |
| bool can_realloc; | |
| } mi_json_buf_t; | |
| static bool mi_json_buf_expand(mi_json_buf_t* hbuf) { | |
| if (hbuf==NULL) return false; | |
| if (hbuf->buf != NULL && hbuf->size>0) { | |
| hbuf->buf[hbuf->size-1] = 0; | |
| } | |
| if (hbuf->size > SIZE_MAX/2 || !hbuf->can_realloc) return false; | |
| const size_t newsize = (hbuf->size == 0 ? mi_good_size(12*MI_KiB) : 2*hbuf->size); | |
| char* const newbuf = (char*)mi_rezalloc(hbuf->buf, newsize); | |
| if (newbuf == NULL) return false; | |
| hbuf->buf = newbuf; | |
| hbuf->size = newsize; | |
| return true; | |
| } | |
| static void mi_json_buf_print(mi_json_buf_t* hbuf, const char* msg) { | |
| if (msg==NULL || hbuf==NULL) return; | |
| if (hbuf->used + 1 >= hbuf->size && !hbuf->can_realloc) return; | |
| for (const char* src = msg; *src != 0; src++) { | |
| char c = *src; | |
| if (hbuf->used + 1 >= hbuf->size) { | |
| if (!mi_json_buf_expand(hbuf)) return; | |
| } | |
| mi_assert_internal(hbuf->used < hbuf->size); | |
| hbuf->buf[hbuf->used++] = c; | |
| } | |
| mi_assert_internal(hbuf->used < hbuf->size); | |
| hbuf->buf[hbuf->used] = 0; | |
| } | |
| static void mi_json_buf_print_count_bin(mi_json_buf_t* hbuf, const char* prefix, mi_stat_count_t* stat, size_t bin, bool add_comma) { | |
| const size_t binsize = mi_stats_get_bin_size(bin); | |
| const size_t pagesize = (binsize <= MI_SMALL_MAX_OBJ_SIZE ? MI_SMALL_PAGE_SIZE : | |
| (binsize <= MI_MEDIUM_MAX_OBJ_SIZE ? MI_MEDIUM_PAGE_SIZE : | |
| (binsize <= MI_LARGE_MAX_OBJ_SIZE ? MI_LARGE_PAGE_SIZE : 0))); | |
| char buf[128]; | |
| _mi_snprintf(buf, 128, "%s{ \"total\": %lld, \"peak\": %lld, \"current\": %lld, \"block_size\": %zu, \"page_size\": %zu }%s\n", prefix, stat->total, stat->peak, stat->current, binsize, pagesize, (add_comma ? "," : "")); | |
| buf[127] = 0; | |
| mi_json_buf_print(hbuf, buf); | |
| } | |
| static void mi_json_buf_print_count_cbin(mi_json_buf_t* hbuf, const char* prefix, mi_stat_count_t* stat, mi_chunkbin_t bin, bool add_comma) { | |
| const char* cbin = " "; | |
| switch(bin) { | |
| case MI_CBIN_SMALL: cbin = "S"; break; | |
| case MI_CBIN_MEDIUM: cbin = "M"; break; | |
| case MI_CBIN_LARGE: cbin = "L"; break; | |
| case MI_CBIN_HUGE: cbin = "H"; break; | |
| case MI_CBIN_OTHER: cbin = "X"; break; | |
| default: cbin = " "; break; | |
| } | |
| char buf[128]; | |
| _mi_snprintf(buf, 128, "%s{ \"total\": %lld, \"peak\": %lld, \"current\": %lld, \"bin\": \"%s\" }%s\n", prefix, stat->total, stat->peak, stat->current, cbin, (add_comma ? "," : "")); | |
| buf[127] = 0; | |
| mi_json_buf_print(hbuf, buf); | |
| } | |
| static void mi_json_buf_print_count(mi_json_buf_t* hbuf, const char* prefix, mi_stat_count_t* stat, bool add_comma) { | |
| char buf[128]; | |
| _mi_snprintf(buf, 128, "%s{ \"total\": %lld, \"peak\": %lld, \"current\": %lld }%s\n", prefix, stat->total, stat->peak, stat->current, (add_comma ? "," : "")); | |
| buf[127] = 0; | |
| mi_json_buf_print(hbuf, buf); | |
| } | |
| static void mi_json_buf_print_count_value(mi_json_buf_t* hbuf, const char* name, mi_stat_count_t* stat) { | |
| char buf[128]; | |
| _mi_snprintf(buf, 128, " \"%s\": ", name); | |
| buf[127] = 0; | |
| mi_json_buf_print(hbuf, buf); | |
| mi_json_buf_print_count(hbuf, "", stat, true); | |
| } | |
| static void mi_json_buf_print_value(mi_json_buf_t* hbuf, const char* name, int64_t val) { | |
| char buf[128]; | |
| _mi_snprintf(buf, 128, " \"%s\": %lld,\n", name, val); | |
| buf[127] = 0; | |
| mi_json_buf_print(hbuf, buf); | |
| } | |
| static void mi_json_buf_print_size(mi_json_buf_t* hbuf, const char* name, size_t val, bool add_comma) { | |
| char buf[128]; | |
| _mi_snprintf(buf, 128, " \"%s\": %zu%s\n", name, val, (add_comma ? "," : "")); | |
| buf[127] = 0; | |
| mi_json_buf_print(hbuf, buf); | |
| } | |
| static void mi_json_buf_print_counter_value(mi_json_buf_t* hbuf, const char* name, mi_stat_counter_t* stat) { | |
| mi_json_buf_print_value(hbuf, name, stat->total); | |
| } | |
| static char* mi_stats_get_json_from(mi_stats_t* stats, size_t output_size, char* output_buf) mi_attr_noexcept { | |
| if (stats==NULL || stats->size!=sizeof(mi_stats_t) || stats->version!=MI_STAT_VERSION) return NULL; | |
| mi_json_buf_t hbuf = { NULL, 0, 0, true }; | |
| if (output_size > 0 && output_buf != NULL) { | |
| _mi_memzero(output_buf, output_size); | |
| hbuf.buf = output_buf; | |
| hbuf.size = output_size; | |
| hbuf.can_realloc = false; | |
| } | |
| else { | |
| if (!mi_json_buf_expand(&hbuf)) return NULL; | |
| } | |
| mi_json_buf_print(&hbuf, "{\n"); | |
| mi_json_buf_print_value(&hbuf, "stat_version", MI_STAT_VERSION); | |
| mi_json_buf_print_value(&hbuf, "mimalloc_version", MI_MALLOC_VERSION); | |
| // process info | |
| mi_json_buf_print(&hbuf, " \"process\": {\n"); | |
| size_t elapsed; | |
| size_t user_time; | |
| size_t sys_time; | |
| size_t current_rss; | |
| size_t peak_rss; | |
| size_t current_commit; | |
| size_t peak_commit; | |
| size_t page_faults; | |
| mi_process_info(&elapsed, &user_time, &sys_time, ¤t_rss, &peak_rss, ¤t_commit, &peak_commit, &page_faults); | |
| mi_json_buf_print_size(&hbuf, "elapsed_msecs", elapsed, true); | |
| mi_json_buf_print_size(&hbuf, "user_msecs", user_time, true); | |
| mi_json_buf_print_size(&hbuf, "system_msecs", sys_time, true); | |
| mi_json_buf_print_size(&hbuf, "page_faults", page_faults, true); | |
| mi_json_buf_print_size(&hbuf, "rss_current", current_rss, true); | |
| mi_json_buf_print_size(&hbuf, "rss_peak", peak_rss, true); | |
| mi_json_buf_print_size(&hbuf, "commit_current", current_commit, true); | |
| mi_json_buf_print_size(&hbuf, "commit_peak", peak_commit, false); | |
| mi_json_buf_print(&hbuf, " },\n"); | |
| // statistics | |
| MI_STAT_FIELDS() | |
| // size bins | |
| mi_json_buf_print(&hbuf, " \"malloc_bins\": [\n"); | |
| for (size_t i = 0; i <= MI_BIN_HUGE; i++) { | |
| mi_json_buf_print_count_bin(&hbuf, " ", &stats->malloc_bins[i], i, i!=MI_BIN_HUGE); | |
| } | |
| mi_json_buf_print(&hbuf, " ],\n"); | |
| mi_json_buf_print(&hbuf, " \"page_bins\": [\n"); | |
| for (size_t i = 0; i <= MI_BIN_HUGE; i++) { | |
| mi_json_buf_print_count_bin(&hbuf, " ", &stats->page_bins[i], i, i!=MI_BIN_HUGE); | |
| } | |
| mi_json_buf_print(&hbuf, " ],\n"); | |
| mi_json_buf_print(&hbuf, " \"chunk_bins\": [\n"); | |
| for (size_t i = 0; i < MI_CBIN_COUNT; i++) { | |
| mi_json_buf_print_count_cbin(&hbuf, " ", &stats->chunk_bins[i], (mi_chunkbin_t)i, i!=MI_CBIN_COUNT-1); | |
| } | |
| mi_json_buf_print(&hbuf, " ]\n"); | |
| mi_json_buf_print(&hbuf, "}\n"); | |
| if (hbuf.used >= hbuf.size) { | |
| // failed | |
| if (hbuf.can_realloc) { mi_free(hbuf.buf); } | |
| return NULL; | |
| } | |
| else { | |
| return hbuf.buf; | |
| } | |
| } | |
| char* mi_subproc_stats_get_json(mi_subproc_id_t subproc_id, size_t buf_size, char* buf) mi_attr_noexcept { | |
| mi_subproc_t* subproc = _mi_subproc_from_id(subproc_id); | |
| if (subproc==NULL) return NULL; | |
| mi_stats_t_decl(stats); | |
| if (!mi_subproc_stats_get(subproc_id,&stats)) return NULL; | |
| return mi_stats_get_json_from(&stats, buf_size, buf); | |
| } | |
| char* mi_heap_stats_get_json(mi_heap_t* heap, size_t buf_size, char* buf) mi_attr_noexcept { | |
| return mi_stats_get_json_from(mi_heap_get_stats(heap), buf_size, buf); | |
| } | |
| char* mi_stats_get_json(size_t buf_size, char* buf) mi_attr_noexcept { | |
| return mi_subproc_stats_get_json(mi_subproc_current(), buf_size, buf); | |
| } | |
| char* mi_stats_as_json(mi_stats_t* stats, size_t buf_size, char* buf) mi_attr_noexcept { | |
| return mi_stats_get_json_from(stats, buf_size, buf); | |
| } | |
Xet Storage Details
- Size:
- 31.1 kB
- Xet hash:
- bf760cd2a73733d02042e4d42182f764e73361dd81243bb92a37783363f22b23
·
Xet efficiently stores files, intelligently splitting them into unique chunks and accelerating uploads and downloads. More info.