kiper220/mimalloc
1
0
Fork 0
mirror of https://github.com/microsoft/mimalloc.git synced 2025-05-09 16:59:32 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions

add more detailed block info for heap visiting

Browse source
This commit is contained in:
daan 2020-04-07 08:36:22 -07:00
parent 173978c122
commit 75053f211a
1 changed files with 17 additions and 13 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

30
test/main-override-static.c
View file

@ -6,41 +6,44 @@
#include <mimalloc.h> #include <mimalloc.h>
#include <mimalloc-override.h> // redefines malloc etc. #include <mimalloc-override.h> // redefines malloc etc.
#include <mimalloc-internal.h>
typedef struct mi_visit_info_s { typedef struct mi_visit_info_s {
size_t area_count; size_t area_count;
size_t block_count; size_t block_count;
mi_output_fun* out;
void* out_arg;
} mi_visit_info_t; } mi_visit_info_t;
static bool visit(const mi_heap_t* heap, const mi_heap_area_t* area, const mi_block_info_t* info, void* arg) { static bool visit(const mi_heap_t* heap, const mi_heap_area_t* area, const mi_block_info_t* info, void* arg) {
mi_visit_info_t* varg = (mi_visit_info_t*)(arg); mi_visit_info_t* varg = (mi_visit_info_t*)(arg);
if (info==NULL) { if (info==NULL) {
printf(varg->area_count==0 ? " {" : " ]\n}\n,{"); _mi_fprintf(varg->out, varg->out_arg, varg->area_count==0 ? " {" : " ]\n}\n,{");
varg->area_count++; varg->area_count++;
varg->block_count = 0; varg->block_count = 0;
printf("\"area\": %zu, \"start\": 0x%p, \"block_size\": %zu, \"used_size\": %zu,\n \"reserved\": %zu, \"committed\": %zu,", varg->area_count, area->blocks, area->block_size, area->used, area->reserved, area->committed); _mi_fprintf(varg->out, varg->out_arg, "\"area\": %zu, \"start\": 0x%p, \"block_size\": %zu, \"used_size\": %zu,\n \"reserved\": %zu, \"committed\": %zu,", varg->area_count, area->blocks, area->block_size, area->used, area->reserved, area->committed);
printf(" \"blocks\": [\n"); _mi_fprintf(varg->out, varg->out_arg, " \"blocks\": [\n");
} }
else { else {
printf(varg->block_count==0 ? " {" : " ,{"); _mi_fprintf(varg->out, varg->out_arg, varg->block_count==0 ? " {" : " ,{");
varg->block_count++; varg->block_count++;
printf("\"block\": 0x%p, \"valid\": %s, \"size\": %zu, \"usable_size\": %zu, \"allocated_size\": %zu,\n ", info->block, info->valid ? "true" : "false", info->size, info->usable_size, info->allocated_size); _mi_fprintf(varg->out, varg->out_arg, "\"block\": 0x%p, \"valid\": %s, \"size\": %zu, \"usable_size\": %zu, \"allocated_size\": %zu,\n ", info->block, info->valid ? "true" : "false", info->size, info->usable_size, info->allocated_size);
int lineno; int lineno;
const char* fname; const char* fname;
void* ret = mi_source_unpack(info->source, &fname, &lineno); void* ret = mi_source_unpack(info->source, &fname, &lineno);
if (fname!=NULL) printf("\"source\": \"%s:%i\" }\n", fname, lineno); if (fname!=NULL) _mi_fprintf(varg->out, varg->out_arg, "\"source\": \"%s:%i\" }\n", fname, lineno);
else if (ret != NULL) printf("\"source\": \"(%p)\" }\n", ret); else if (ret != NULL) _mi_fprintf(varg->out, varg->out_arg, "\"source\": \"(%p)\" }\n", ret);
else printf("\"source\": \"\" }\n"); else _mi_fprintf(varg->out, varg->out_arg, "\"source\": \"\" }\n");
} }
return true;
} }
static void mi_heap_to_json(mi_heap_t* heap) { static void mi_heap_to_json(mi_heap_t* heap, mi_output_fun* out, void* arg ) {
if (heap==NULL) heap = mi_heap_get_default(); if (heap==NULL) heap = mi_heap_get_default();
mi_visit_info_t info = { 0, 0 }; mi_visit_info_t info = { 0, 0, out, arg };
printf("[\n"); _mi_fprintf(info.out, info.out_arg, "[\n");
mi_heap_visit_blocks(heap, true, &visit, &info); mi_heap_visit_blocks(heap, true, &visit, &info);
printf(info.area_count==0 ? "]\n" : " ] }\n]\n"); _mi_fprintf(info.out, info.out_arg, info.area_count==0 ? "]\n" : " ] }\n]\n");
} }
@ -71,6 +74,7 @@ int main() {
free(p2); free(p2);
p2 = malloc(16); p2 = malloc(16);
p1 = realloc(p1, 32); p1 = realloc(p1, 32);
mi_heap_to_json(NULL,NULL,NULL);
free(p1); free(p1);
free(p2); free(p2);
//free(s); //free(s);