docs/mimalloc-doc_8h_source.html
Loading...
Searching...
No Matches
mimalloc-doc.h
1/* ----------------------------------------------------------------------------
2Copyright (c) 2018-2025, Microsoft Research, Daan Leijen
3This is free software; you can redistribute it and/or modify it under the
4terms of the MIT license. A copy of the license can be found in the file
5"LICENSE" at the root of this distribution.
6-----------------------------------------------------------------------------*/
7
8#error "documentation file only!"
9
10
121
122
127
132void* mi_malloc(size_t size);
133
138void* mi_zalloc(size_t size);
139
149void* mi_calloc(size_t count, size_t size);
150
164void* mi_realloc(void* p, size_t newsize);
165
179void* mi_expand(void* p, size_t newsize);
180
190void* mi_mallocn(size_t count, size_t size);
191
201void* mi_reallocn(void* p, size_t count, size_t size);
202
219void* mi_reallocf(void* p, size_t newsize);
220
221
230char* mi_strdup(const char* s);
231
241char* mi_strndup(const char* s, size_t n);
242
255char* mi_realpath(const char* fname, char* resolved_name);
256
270size_t mi_usable_size(void* p);
271
281size_t mi_good_size(size_t size);
282
284
285
286// ------------------------------------------------------
287// Aligned allocation
288// ------------------------------------------------------
289
297
315void* mi_malloc_aligned(size_t size, size_t alignment);
316void* mi_zalloc_aligned(size_t size, size_t alignment);
317void* mi_calloc_aligned(size_t count, size_t size, size_t alignment);
318void* mi_realloc_aligned(void* p, size_t newsize, size_t alignment);
319
331void* mi_malloc_aligned_at(size_t size, size_t alignment, size_t offset);
332void* mi_zalloc_aligned_at(size_t size, size_t alignment, size_t offset);
333void* mi_calloc_aligned_at(size_t count, size_t size, size_t alignment, size_t offset);
334void* mi_realloc_aligned_at(void* p, size_t newsize, size_t alignment, size_t offset);
335
337
338
347
359#define mi_malloc_tp(tp) ((tp*)mi_malloc(sizeof(tp)))
360
362#define mi_zalloc_tp(tp) ((tp*)mi_zalloc(sizeof(tp)))
363
365#define mi_calloc_tp(tp,count) ((tp*)mi_calloc(count,sizeof(tp)))
366
368#define mi_mallocn_tp(tp,count) ((tp*)mi_mallocn(count,sizeof(tp)))
369
371#define mi_reallocn_tp(p,tp,count) ((tp*)mi_reallocn(p,count,sizeof(tp)))
372
374#define mi_heap_malloc_tp(tp,hp) ((tp*)mi_heap_malloc(hp,sizeof(tp)))
375
377#define mi_heap_zalloc_tp(tp,hp) ((tp*)mi_heap_zalloc(hp,sizeof(tp)))
378
380#define mi_heap_calloc_tp(tp,hp,count) ((tp*)mi_heap_calloc(hp,count,sizeof(tp)))
381
383#define mi_heap_mallocn_tp(tp,hp,count) ((tp*)mi_heap_mallocn(hp,count,sizeof(tp)))
384
386#define mi_heap_reallocn_tp(tp,hp,p,count) ((tp*)mi_heap_reallocn(p,count,sizeof(tp)))
387
389#define mi_heap_recalloc_tp(tp,hp,p,count) ((tp*)mi_heap_recalloc(p,count,sizeof(tp)))
390
392
402
413void* mi_recalloc(void* p, size_t count, size_t size);
414
415void* mi_rezalloc(void* p, size_t newsize);
416void* mi_recalloc(void* p, size_t newcount, size_t size) ;
417
418void* mi_rezalloc_aligned(void* p, size_t newsize, size_t alignment);
419void* mi_rezalloc_aligned_at(void* p, size_t newsize, size_t alignment, size_t offset);
420void* mi_recalloc_aligned(void* p, size_t newcount, size_t size, size_t alignment);
421void* mi_recalloc_aligned_at(void* p, size_t newcount, size_t size, size_t alignment, size_t offset);
422
423void* mi_heap_rezalloc(mi_heap_t* heap, void* p, size_t newsize);
424void* mi_heap_recalloc(mi_heap_t* heap, void* p, size_t newcount, size_t size);
425
426void* mi_heap_rezalloc_aligned(mi_heap_t* heap, void* p, size_t newsize, size_t alignment);
427void* mi_heap_rezalloc_aligned_at(mi_heap_t* heap, void* p, size_t newsize, size_t alignment, size_t offset);
428void* mi_heap_recalloc_aligned(mi_heap_t* heap, void* p, size_t newcount, size_t size, size_t alignment);
429void* mi_heap_recalloc_aligned_at(mi_heap_t* heap, void* p, size_t newcount, size_t size, size_t alignment, size_t offset);
430
432
433
434
452
458struct mi_heap_s;
459
465typedef struct mi_heap_s mi_heap_t;
466
469
476void mi_heap_delete(mi_heap_t* heap);
477
484void mi_heap_destroy(mi_heap_t* heap);
485
490mi_heap_t* mi_heap_set_default(mi_heap_t* heap);
491
495mi_heap_t* mi_heap_get_default();
496
503mi_heap_t* mi_heap_get_backing();
504
508void mi_heap_set_numa_affinity(mi_heap_t* heap, int numa_node);
509
515mi_heap_t* mi_heap_main(void);
516
522mi_heap_t* mi_heap_of(const void* p);
523
528bool mi_heap_contains(const mi_heap_t* heap, const void* p);
529
533bool mi_any_heap_contains(const void* p);
534
535
541bool mi_is_in_heap_region(const void* p);
542
548bool mi_check_owned(const void* p);
549
556bool mi_heap_contains_block(mi_heap_t* heap, const void* p);
557
564bool mi_heap_check_owned(mi_heap_t* heap, const void* p);
565
567void mi_heap_collect(mi_heap_t* heap, bool force);
568
571void* mi_heap_malloc(mi_heap_t* heap, size_t size);
572
576void* mi_heap_malloc_small(mi_heap_t* heap, size_t size);
577
580void* mi_heap_zalloc(mi_heap_t* heap, size_t size);
581
585void* mi_heap_zalloc_small(mi_heap_t* heap, size_t size);
586
589void* mi_heap_calloc(mi_heap_t* heap, size_t count, size_t size);
590
593void* mi_heap_mallocn(mi_heap_t* heap, size_t count, size_t size);
594
597char* mi_heap_strdup(mi_heap_t* heap, const char* s);
598
601char* mi_heap_strndup(mi_heap_t* heap, const char* s, size_t n);
602
605char* mi_heap_realpath(mi_heap_t* heap, const char* fname, char* resolved_name);
606
607void* mi_heap_realloc(mi_heap_t* heap, void* p, size_t newsize);
608void* mi_heap_reallocn(mi_heap_t* heap, void* p, size_t count, size_t size);
609void* mi_heap_reallocf(mi_heap_t* heap, void* p, size_t newsize);
610
611void* mi_heap_malloc_aligned(mi_heap_t* heap, size_t size, size_t alignment);
612void* mi_heap_malloc_aligned_at(mi_heap_t* heap, size_t size, size_t alignment, size_t offset);
613void* mi_heap_zalloc_aligned(mi_heap_t* heap, size_t size, size_t alignment);
614void* mi_heap_zalloc_aligned_at(mi_heap_t* heap, size_t size, size_t alignment, size_t offset);
615void* mi_heap_calloc_aligned(mi_heap_t* heap, size_t count, size_t size, size_t alignment);
616void* mi_heap_calloc_aligned_at(mi_heap_t* heap, size_t count, size_t size, size_t alignment, size_t offset);
617void* mi_heap_realloc_aligned(mi_heap_t* heap, void* p, size_t newsize, size_t alignment);
618void* mi_heap_realloc_aligned_at(mi_heap_t* heap, void* p, size_t newsize, size_t alignment, size_t offset);
619
621
622
623
628
629
632typedef struct mi_heap_area_s {
637size_t block_size;
638size_t full_block_size;
640} [mi_heap_area_t](group analysis.html#structmi heap area t);
641
649typedef bool (mi_block_visit_fun)(const mi_heap_t* heap, const [mi_heap_area_t](group__analysis.html#structmi heap area__t)* area, void* block, size_t block_size, void* arg);
650
665bool mi_heap_visit_blocks(const mi_heap_t* heap, bool visit_blocks, mi_block_visit_fun* visitor, void* arg);
666
682bool mi_abandoned_visit_blocks(mi_subproc_id_t subproc_id, int heap_tag, bool visit_blocks, mi_block_visit_fun* visitor, void* arg);
683
685
686// ------------------------------------------------------
687// Arenas
688// ------------------------------------------------------
689
697
699typedef int mi_arena_id_t;
700
709intmi_reserve_os_memory(size_t size, bool commit, bool allow_large);
710
718int mi_reserve_os_memory_ex(size_t size, bool commit, bool allow_large, bool exclusive, mi_arena_id_t* arena_id);
719
732int mi_reserve_huge_os_pages_interleave(size_t pages, size_t numa_nodes, size_t timeout_msecs);
733
746int mi_reserve_huge_os_pages_at(size_t pages, int numa_node, size_t timeout_msecs);
747
755intmi_reserve_huge_os_pages_at_ex(size_t pages, int numa_node, size_t timeout_msecs, bool exclusive, mi_arena_id_t* arena_id);
756
759size_t mi_arena_min_alignment(void);
760
772bool mi_manage_os_memory(void* start, size_t size, bool is_committed, bool is_large, bool is_zero, int numa_node);
773
784boolmi_manage_os_memory_ex(void* start, size_t size, bool is_committed, bool is_large, bool is_zero, int numa_node, bool exclusive, mi_arena_id_t* arena_id);
785
786
788void mi_debug_show_arenas(void);
789
794void* mi_arena_area(mi_arena_id_t arena_id, size_t* size);
795
796
797
801mi_heap_t* mi_heap_new_in_arena(mi_arena_id_t arena_id);
802
814mi_heap_t* mi_heap_new_ex(int heap_tag, bool allow_destroy, mi_arena_id_t arena_id);
815
817
818
827
832typedef void* mi_subproc_id_t;
833
835mi_subproc_id_t mi_subproc_main(void);
836
838mi_subproc_id_t mi_subproc_current(void);
839
842mi_subproc_id_t mi_subproc_new(void);
843
847void mi_subproc_destroy(mi_subproc_id_t subproc);
848
853void mi_subproc_delete(mi_subproc_id_t subproc);
854
858void mi_subproc_add_current_thread(mi_subproc_id_t subproc);
859
863typedef bool (mi_heap_visit_fun)(mi_heap_t* heap, void* arg);
864
870bool mi_subproc_visit_heaps(mi_subproc_id_t subproc, mi_heap_visit_fun* visitor, void* arg);
871
873
874
875// ------------------------------------------------------
876// Extended functionality
877// ------------------------------------------------------
878
883
887#define MI_SMALL_SIZE_MAX (128*sizeof(void*))
888
892intmi_version(void);
893
901void mi_collect(bool force);
902
908void mi_thread_set_in_threadpool(void);
909
914bool mi_is_redirected();
915
919void mi_thread_init(void);
920
925void mi_thread_done(void);
926
933typedef void (mi_deferred_free_fun)(bool force, unsigned long long heartbeat, void* arg);
934
950voidmi_register_deferred_free(mi_deferred_free_fun* deferred_free, void* arg);
951
957typedef void (mi_output_fun)(const char* msg, void* arg);
958
965void mi_register_output(mi_output_fun* out, void* arg);
966
972typedef void (mi_error_fun)(int err, void* arg);
973
989void mi_register_error(mi_error_fun* errfun, void* arg);
990
998void* mi_malloc_small(size_t size);
999
1007void* mi_zalloc_small(size_t size);
1008
1022void mi_free_small(void* p);
1023
1025
1026
1027
1028
1029
1030// ------------------------------------------------------
1031// Statistics
1032// ------------------------------------------------------
1033
1037
1039#define MI_STAT_VERSION 4
1040
1050#define mi_stats_t_decl(name)
1051
1053struct [mi_stats_s](group__stats.html#structmi stats s) {
1058};
1059
1061typedef struct [mi_stats_s](group stats.html#structmi stats__s) mi_stats_t;
1062
1063
1066void mi_process_info_print(void);
1067
1072void mi_process_info_print_out(mi_output_fun* out, void* arg);
1073
1087void 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);
1088
1089
1094void mi_stats_print(void* out);
1095
1101void mi_stats_print_out(mi_output_fun* out, void* arg);
1102
1108bool mi_stats_get(mi_stats_t* stats);
1109
1115char* mi_stats_get_json(size_t buf_size, char* buf);
1116
1118size_tmi_stats_get_bin_size(size_t bin);
1119
1126bool mi_heap_stats_get(mi_heap_t* heap, mi_stats_t* stats);
1127
1134char* mi_heap_stats_get_json(mi_heap_t* heap, size_t buf_size, char* buf); // use mi_free to free the result if the input buf == NULL
1135
1140void mi_heap_stats_print_out(mi_heap_t* heap, mi_output_fun* out, void* arg);
1141
1145void mi_heap_stats_merge_to_subproc(mi_heap_t* heap);
1146
1153bool mi_subproc_stats_get(mi_subproc_id_t subproc_id, mi_stats_t* stats);
1154
1161char* mi_subproc_stats_get_json(mi_subproc_id_t subproc_id, size_t buf_size, char* buf); // use mi_free to free the result if the input buf == NULL
1162
1167voidmi_subproc_stats_print_out(mi_subproc_id_t subproc_id, mi_output_fun* out, void* arg);
1168
1169
1174void mi_subproc_heap_stats_print_out(mi_subproc_id_t subproc_id, mi_output_fun* out, void* arg);
1175
1182char* mi_stats_as_json( mi_stats_t* stats, size_t buf_size, char* buf);
1183
1185void mi_stats_reset(void);
1186
1188void mi_stats_merge(void);
1189
1191
1192// ------------------------------------------------------
1193// Runtime Options
1194// ------------------------------------------------------
1195
1200
1203void mi_options_print(void);
1204
1210void mi_options_print_out(mi_output_fun* out, void* arg);
1211
1212
1214typedef enum mi_option_e {
1215// stable options
1221
1222// advanced options
1223mi_option_reserve_huge_os_pages,
1224mi_option_reserve_huge_os_pages_at,
1225mi_option_reserve_os_memory,
1226mi_option_allow_large_os_pages,
1227mi_option_purge_decommits,
1231mi_option_generic_collect,
1233
1234// guard pages
1237mi_option_guarded_precise,
1238mi_option_guarded_sample_rate,
1239mi_option_guarded_sample_seed,
1240
1241// experimental options
1243mi_option_eager_commit_delay,
1244mi_option_arena_eager_commit,
1245mi_option_abandoned_page_purge,
1248mi_option_disallow_os_alloc,
1249mi_option_max_segment_reclaim,
1250mi_option_destroy_on_exit,
1251mi_option_arena_purge_mult,
1252mi_option_abandoned_reclaim_on_free,
1253mi_option_purge_extend_delay,
1254mi_option_disallow_arena_alloc,
1255mi_option_visit_abandoned,
1256mi_option_target_segments_per_thread,
1257
1258// v3 options
1259mi_option_page_reclaim_on_free,
1260mi_option_page_full_retain,
1261mi_option_page_max_candidates,
1264mi_option_page_commit_on_demand,
1265mi_option_page_max_reclaim,
1266mi_option_page_cross_thread_max_reclaim,
1267mi_option_minimal_purge_size,
1268mi_option_arena_max_object_size,
1269
1270_mi_option_last
1272
1273
1274boolmi_option_is_enabled(mi_option_t option);
1275voidmi_option_enable(mi_option_t option);
1276voidmi_option_disable(mi_option_t option);
1277voidmi_option_set_enabled(mi_option_t option, bool enable);
1278voidmi_option_set_enabled_default(mi_option_t option, bool enable);
1279
1280longmi_option_get(mi_option_t option);
1281longmi_option_get_clamp(mi_option_t option, long min, long max);
1282size_t mi_option_get_size(mi_option_t option);
1283
1284voidmi_option_set(mi_option_t option, long value);
1285voidmi_option_set_default(mi_option_t option, long value);
1286
1288
1301
1303struct mi_theap_s;
1304
1306typedef struct mi_theap_s mi_theap_t;
1307
1314mi_theap_t* mi_heap_theap(mi_heap_t* heap);
1315
1317void mi_theap_collect(mi_theap_t* theap, bool force);
1318
1323mi_theap_t* mi_theap_set_default(mi_theap_t* theap);
1324
1327mi_theap_t* mi_theap_get_default();
1328
1331void* mi_theap_malloc(mi_theap_t* theap, size_t size);
1332
1336void* mi_theap_malloc_small(mi_theap_t* theap, size_t size);
1337
1340void* mi_theap_zalloc(mi_theap_t* theap, size_t size);
1341
1345void* mi_theap_zalloc_small(mi_theap_t* theap, size_t size);
1346
1347void* mi_theap_calloc(mi_theap_t* theap, size_t count, size_t size);
1348void* mi_theap_malloc_aligned(mi_theap_t* theap, size_t size, size_t alignment);
1349void* mi_theap_realloc(mi_theap_t* theap, void* p, size_t newsize);
1350
1352
1353
1359
1362void* mi__expand(void* p, size_t newsize);
1363
1364size_t mi_malloc_size(const void* p);
1365size_t mi_malloc_good_size(size_t size);
1366size_t mi_malloc_usable_size(const void *p);
1367
1368int mi_posix_memalign(void** p, size_t alignment, size_t size);
1369int mi__posix_memalign(void** p, size_t alignment, size_t size);
1370void* mi_memalign(size_t alignment, size_t size);
1371void* mi_valloc(size_t size);
1372void* mi_pvalloc(size_t size);
1373void* mi_aligned_alloc(size_t alignment, size_t size);
1374
1375unsigned short* mi_wcsdup(const unsigned short* s);
1376unsigned char* mi_mbsdup(const unsigned char* s);
1377int mi_dupenv_s(char** buf, size_t* size, const char* name);
1378int mi_wdupenv_s(unsigned short** buf, size_t* size, const unsigned short* name);
1379
1382void* mi_reallocarray(void* p, size_t count, size_t size);
1383
1385intmi_reallocarr(void* p, size_t count, size_t size);
1386
1387void* mi_aligned_recalloc(void* p, size_t newcount, size_t size, size_t alignment);
1388void* mi_aligned_offset_recalloc(void* p, size_t newcount, size_t size, size_t alignment, size_t offset);
1389
1390void mi_free_size(void* p, size_t size);
1391void mi_free_size_aligned(void* p, size_t size, size_t alignment);
1392void mi_free_aligned(void* p, size_t alignment);
1393
1395
1408
1410void* mi_new(std::size_t n) noexcept(false);
1411
1413void* mi_new_n(size_t count, size_t size) noexcept(false);
1414
1416void* mi_new_aligned(std::size_t n, std::align_val_t alignment) noexcept(false);
1417
1419void* mi_new_nothrow(size_t n);
1420
1422void* mi_new_aligned_nothrow(size_t n, size_t alignment);
1423
1425void* mi_new_realloc(void* p, size_t newsize);
1426
1428void* mi_new_reallocn(void* p, size_t newcount, size_t size);
1429
1437template<class T> struct [mi_stl_allocator](group__cpp.html#structmi stl allocator) { }
1438
1440
void * mi_malloc_aligned_at(size_t size, size_t alignment, size_t offset)
Allocate size bytes aligned by alignment at a specified offset.
void * mi_calloc_aligned(size_t count, size_t size, size_t alignment)
void * mi_realloc_aligned(void *p, size_t newsize, size_t alignment)
void * mi_malloc_aligned(size_t size, size_t alignment)
Allocate size bytes aligned by alignment.
void * mi_zalloc_aligned_at(size_t size, size_t alignment, size_t offset)
void * mi_calloc_aligned_at(size_t count, size_t size, size_t alignment, size_t offset)
void * mi_zalloc_aligned(size_t size, size_t alignment)
void * mi_realloc_aligned_at(void *p, size_t newsize, size_t alignment, size_t offset)
int heap_tag
heap tag associated with this area (see mi_heap_new_ex)
Definition mimalloc-doc.h:639
size_t block_size
size in bytes of one block
Definition mimalloc-doc.h:637
size_t committed
current committed bytes of this area
Definition mimalloc-doc.h:635
mi_heap_area_t::full_block_size
size_t full_block_size
size in bytes of a full block including padding and metadata.
Definition mimalloc-doc.h:638
size_t used
bytes in use by allocated blocks
Definition mimalloc-doc.h:636
void * blocks
start of the area containing heap blocks
Definition mimalloc-doc.h:633
size_t reserved
bytes reserved for this area
Definition mimalloc-doc.h:634
bool mi_abandoned_visit_blocks(mi_subproc_id_t subproc_id, int heap_tag, bool visit_blocks, mi_block_visit_fun *visitor, void *arg)
v1,v2: Visit all areas and blocks in abandoned heaps.
bool mi_block_visit_fun(const mi_heap_t *heap, const mi_heap_area_t *area, void *block, size_t block_size, void *arg)
Visitor function passed to mi_heap_visit_blocks()
Definition mimalloc-doc.h:649
bool mi_heap_visit_blocks(const mi_heap_t *heap, bool visit_blocks, mi_block_visit_fun *visitor, void *arg)
Visit all areas and blocks in a heap.
[mi_heap_area_t](group analysis.html#structmi heap area t)
An area of heap space contains blocks of a single size.
Definition mimalloc-doc.h:632
int mi_reserve_os_memory(size_t size, bool commit, bool allow_large)
Reserve OS memory for use by mimalloc.
mi_reserve_huge_os_pages_interleave
int mi_reserve_huge_os_pages_interleave(size_t pages, size_t numa_nodes, size_t timeout_msecs)
Reserve pages of huge OS pages (1GiB) evenly divided over numa_nodes nodes, but stops after at most t...
int mi_reserve_os_memory_ex(size_t size, bool commit, bool allow_large, bool exclusive, mi_arena_id_t *arena_id)
Reserve OS memory to be managed in an arena.
mi_heap_t * mi_heap_new_ex(int heap_tag, bool allow_destroy, mi_arena_id_t arena_id)
v1,v2: Create a new heap.
bool mi_manage_os_memory_ex(void *start, size_t size, bool is_committed, bool is_large, bool is_zero, int numa_node, bool exclusive, mi_arena_id_t *arena_id)
Manage externally allocated memory as a mimalloc arena.
bool mi_manage_os_memory(void *start, size_t size, bool is_committed, bool is_large, bool is_zero, int numa_node)
Manage a particular memory area for use by mimalloc.
mi_reserve_huge_os_pages_at_ex
int mi_reserve_huge_os_pages_at_ex(size_t pages, int numa_node, size_t timeout_msecs, bool exclusive, mi_arena_id_t *arena_id)
Reserve huge OS pages (1GiB) into a single arena.
int mi_reserve_huge_os_pages_at(size_t pages, int numa_node, size_t timeout_msecs)
Reserve pages of huge OS pages (1GiB) at a specific numa_node, but stops after at most timeout_msecs ...
void mi_debug_show_arenas(void)
Show all current arena's.
int mi_arena_id_t
Each arena has an associated identifier.
Definition mimalloc-doc.h:699
void * mi_arena_area(mi_arena_id_t arena_id, size_t *size)
Return the start and size of an arena.
size_t mi_arena_min_alignment(void)
Return the minimal alignment required for managed OS memory.
mi_heap_t * mi_heap_new_in_arena(mi_arena_id_t arena_id)
Create a new heap that only allocates in the specified arena.
void * mi_new_nothrow(size_t n)
like mi_malloc, but when out of memory, use std::get_new_handler but return NULL on failure.
void * mi_new(std::size_t n) noexcept(false)
like mi_malloc(), but when out of memory, use std::get_new_handler and raise std::bad_alloc exception...
void * mi_new_realloc(void *p, size_t newsize)
like mi_realloc(), but when out of memory, use std::get_new_handler and raise std::bad_alloc exceptio...
void * mi_new_aligned(std::size_t n, std::align_val_t alignment) noexcept(false)
like mi_malloc_aligned(), but when out of memory, use std::get_new_handler and raise std::bad_alloc e...
void * mi_new_aligned_nothrow(size_t n, size_t alignment)
like mi_malloc_aligned, but when out of memory, use std::get_new_handler but return NULL on failure.
void * mi_new_reallocn(void *p, size_t newcount, size_t size)
like mi_reallocn(), but when out of memory, use std::get_new_handler and raise std::bad_alloc excepti...
void * mi_new_n(size_t count, size_t size) noexcept(false)
like mi_mallocn(), but when out of memory, use std::get_new_handler and raise std::bad_alloc exceptio...
[mi_stl_allocator](group cpp.html#structmi stl__allocator)
std::allocator implementation for mimalloc for use in STL containers. For example:
Definition mimalloc-doc.h:1437
void mi_thread_done(void)
Uninitialize mimalloc on a thread.
void mi_deferred_free_fun(bool force, unsigned long long heartbeat, void *arg)
Type of deferred free functions.
Definition mimalloc-doc.h:933
void mi_free_small(void *p)
v3: Can be used to free an object that was allocated with mi_malloc_small et al.
void mi_register_deferred_free(mi_deferred_free_fun *deferred_free, void *arg)
Register a deferred free function.
void mi_collect(bool force)
Eagerly free memory.
void * mi_zalloc_small(size_t size)
Allocate a zero initialized small object.
void * mi_malloc_small(size_t size)
Allocate a small object.
void mi_error_fun(int err, void *arg)
Type of error callback functions.
Definition mimalloc-doc.h:972
void mi_register_error(mi_error_fun *errfun, void *arg)
Register an error callback function.
bool mi_is_redirected()
Is the C runtime malloc API redirected?
void mi_thread_set_in_threadpool(void)
v3: Communicate that a thread is in a threadpool.
void mi_output_fun(const char *msg, void *arg)
Type of output functions.
Definition mimalloc-doc.h:957
void mi_register_output(mi_output_fun *out, void *arg)
Register an output function.
int mi_version(void)
Return the mimalloc version.
void mi_thread_init(void)
Initialize mimalloc on a thread.
void * mi_heap_malloc_small(mi_heap_t *heap, size_t size)
Allocate a small object in a specific heap.
void * mi_heap_zalloc_small(mi_heap_t *heap, size_t size)
Allocate a small object in a specific heap.
bool mi_heap_check_owned(mi_heap_t *heap, const void *p)
v1,v2: Check safely if any pointer is part of a heap.
mi_heap_t * mi_heap_get_default()
v1,v2: Get the default heap that is used for mi_malloc() et al.
bool mi_any_heap_contains(const void *p)
v3: is a pointer pointing into mimalloc managed memory?
void mi_heap_delete(mi_heap_t *heap)
Delete a previously allocated heap.
void * mi_heap_malloc_aligned(mi_heap_t *heap, size_t size, size_t alignment)
mi_heap_t * mi_heap_set_default(mi_heap_t *heap)
v1,v2: Set the default heap to use in the current thread for mi_malloc() et al.
struct mi_heap_s mi_heap_t
Type of first-class heaps.
Definition mimalloc-doc.h:465
mi_heap_t * mi_heap_of(const void *p)
v3: return the heap that contains the given pointer.
void * mi_heap_zalloc_aligned_at(mi_heap_t *heap, size_t size, size_t alignment, size_t offset)
char * mi_heap_realpath(mi_heap_t *heap, const char *fname, char *resolved_name)
Resolve a file path name using a specific heap to allocate the result.
char * mi_heap_strdup(mi_heap_t *heap, const char *s)
Duplicate a string in a specific heap.
bool mi_is_in_heap_region(const void *p)
v1,v2: Is a pointer part of our heap?
bool mi_check_owned(const void *p)
v1,v2: Check if any pointer is part of the default heap of this thread.
void * mi_heap_zalloc_aligned(mi_heap_t *heap, size_t size, size_t alignment)
void * mi_heap_realloc_aligned_at(mi_heap_t *heap, void *p, size_t newsize, size_t alignment, size_t offset)
void mi_heap_collect(mi_heap_t *heap, bool force)
Release outstanding resources in a specific heap.
mi_heap_t * mi_heap_main(void)
v3: the main heap (of the current sub-process)
void mi_heap_destroy(mi_heap_t *heap)
Destroy a heap, freeing all its still allocated blocks.
void * mi_heap_calloc_aligned_at(mi_heap_t *heap, size_t count, size_t size, size_t alignment, size_t offset)
mi_heap_t * mi_heap_new()
Create a new heap that can be used for allocation.
bool mi_heap_contains_block(mi_heap_t *heap, const void *p)
v1,v2: Does a heap contain a pointer to a previously allocated block?
void mi_heap_set_numa_affinity(mi_heap_t *heap, int numa_node)
v3: set NUMA affinity for a heap.
void * mi_heap_mallocn(mi_heap_t *heap, size_t count, size_t size)
Allocate count elements in a specific heap.
void * mi_heap_malloc(mi_heap_t *heap, size_t size)
Allocate in a specific heap.
void * mi_heap_zalloc(mi_heap_t *heap, size_t size)
Allocate zero-initialized in a specific heap.
void * mi_heap_calloc(mi_heap_t *heap, size_t count, size_t size)
Allocate count zero-initialized elements in a specific heap.
void * mi_heap_realloc(mi_heap_t *heap, void *p, size_t newsize)
mi_heap_t * mi_heap_get_backing()
v1,v2: Get the backing heap.
bool mi_heap_contains(const mi_heap_t *heap, const void *p)
v3: does a heap contain a specific pointer?
void * mi_heap_calloc_aligned(mi_heap_t *heap, size_t count, size_t size, size_t alignment)
void * mi_heap_reallocn(mi_heap_t *heap, void *p, size_t count, size_t size)
void * mi_heap_realloc_aligned(mi_heap_t *heap, void *p, size_t newsize, size_t alignment)
char * mi_heap_strndup(mi_heap_t *heap, const char *s, size_t n)
Duplicate a string of at most length n in a specific heap.
void * mi_heap_reallocf(mi_heap_t *heap, void *p, size_t newsize)
void * mi_heap_malloc_aligned_at(mi_heap_t *heap, size_t size, size_t alignment, size_t offset)
void * mi_realloc(void *p, size_t newsize)
Re-allocate memory to newsize bytes.
size_t mi_usable_size(void *p)
Return the available bytes in a memory block.
void * mi_expand(void *p, size_t newsize)
Try to re-allocate memory to newsize bytes in place.
char * mi_strdup(const char *s)
Allocate and duplicate a string.
char * mi_strndup(const char *s, size_t n)
Allocate and duplicate a string up to n bytes.
void * mi_reallocf(void *p, size_t newsize)
Re-allocate memory to newsize bytes,.
void * mi_mallocn(size_t count, size_t size)
Allocate count elements of size bytes.
void * mi_calloc(size_t count, size_t size)
Allocate zero-initialized count elements of size bytes.
void * mi_reallocn(void *p, size_t count, size_t size)
Re-allocate memory to count elements of size bytes.
char * mi_realpath(const char *fname, char *resolved_name)
Resolve a file path name.
size_t mi_good_size(size_t size)
Return the probable allocation block size for a given required size.
void * mi_malloc(size_t size)
Allocate size bytes.
void * mi_zalloc(size_t size)
Allocate zero-initialized size bytes.
void mi_free(void *p)
Free previously allocated memory.
void mi_option_enable(mi_option_t option)
void mi_options_print_out(mi_output_fun *out, void *arg)
Print out all process info.
size_t mi_option_get_size(mi_option_t option)
bool mi_option_is_enabled(mi_option_t option)
void mi_option_set_enabled_default(mi_option_t option, bool enable)
long mi_option_get(mi_option_t option)
void mi_option_set_default(mi_option_t option, long value)
long mi_option_get_clamp(mi_option_t option, long min, long max)
void mi_option_set_enabled(mi_option_t option, bool enable)
void mi_option_disable(mi_option_t option)
void mi_options_print(void)
Print out all runtime parameters for mimalloc. Also printed with MIMALLOC_VERBOSE=1 at startup.
void mi_option_set(mi_option_t option, long value)
mi_option_t
Runtime options.
Definition mimalloc-doc.h:1214
@ mi_option_guarded_min
only used when building with MI_GUARDED: minimal rounded object size for guarded objects (=0)
Definition mimalloc-doc.h:1235
mi_option_abandoned_reclaim_on_free
@ mi_option_abandoned_reclaim_on_free
v1,v2: allow to reclaim an abandoned segment on a free (=1)
Definition mimalloc-doc.h:1252
@ mi_option_purge_extend_delay
v1,v2: extend purge delay on each subsequent delay (=1)
Definition mimalloc-doc.h:1253
@ mi_option_allow_thp
allow transparent huge pages? (=1) (on Android =0 by default). Set to 0 to disable THP for the proces...
Definition mimalloc-doc.h:1232
@ mi_option_show_stats
Print statistics on termination.
Definition mimalloc-doc.h:1217
@ mi_option_use_numa_nodes
0 = use all available numa nodes, otherwise use at most N nodes.
Definition mimalloc-doc.h:1247
@ mi_option_page_max_reclaim
v3: don't reclaim pages of the same originating theap if we already own N pages (in that size class) ...
Definition mimalloc-doc.h:1265
mi_option_abandoned_page_purge
@ mi_option_abandoned_page_purge
v1,v2: immediately purge delayed purges on thread termination
Definition mimalloc-doc.h:1245
@ mi_option_eager_commit_delay
v2: the first N segments per thread are not eagerly committed (but per page in the segment on demand)
Definition mimalloc-doc.h:1243
@ mi_option_eager_commit
v1,v2: eager commit segments? (after eager_commit_delay segments) (enabled by default).
Definition mimalloc-doc.h:1242
@ mi_option_guarded_precise
disregard minimal alignment requirement to always place guarded blocks exactly in front of a guard pa...
Definition mimalloc-doc.h:1237
@ mi_option_visit_abandoned
allow visiting heap blocks from abandoned threads (=0)
Definition mimalloc-doc.h:1255
@ mi_option_os_tag
tag used for OS logging (macOS only for now) (=100)
Definition mimalloc-doc.h:1229
mi_option_arena_max_object_size
@ mi_option_arena_max_object_size
v3: set maximal object size that can be allocated in an arena (in KiB) (=2GiB on 64-bit).
Definition mimalloc-doc.h:1268
@ mi_option_minimal_purge_size
v3: set minimal purge size (in KiB) (=0). By default set to either 64 or 2048 if THP is enabled....
Definition mimalloc-doc.h:1267
@ _mi_option_last
Definition mimalloc-doc.h:1270
@ mi_option_destroy_on_exit
if set, release all memory on exit; sometimes used for dynamic unloading but can be unsafe
Definition mimalloc-doc.h:1250
mi_option_page_cross_thread_max_reclaim
@ mi_option_page_cross_thread_max_reclaim
v3: don't reclaim pages across threads if we already own N pages (in that size class) (=16)
Definition mimalloc-doc.h:1266
mi_option_page_commit_on_demand
@ mi_option_page_commit_on_demand
v3: commit page memory on-demand (=0)
Definition mimalloc-doc.h:1264
@ mi_option_guarded_sample_seed
can be set to allow for a (more) deterministic re-execution when a guard page is triggered (=0)
Definition mimalloc-doc.h:1239
@ mi_option_verbose
Print verbose messages.
Definition mimalloc-doc.h:1218
mi_option_allow_large_os_pages
@ mi_option_allow_large_os_pages
allow large (2 or 4 MiB) OS pages, implies eager commit.
Definition mimalloc-doc.h:1226
@ mi_option_arena_purge_mult
multiplier for purge_delay for the purging delay for arenas (=10)
Definition mimalloc-doc.h:1251
mi_option_target_segments_per_thread
@ mi_option_target_segments_per_thread
v1,v2: experimental (=0)
Definition mimalloc-doc.h:1256
@ mi_option_generic_collect
collect heaps every N (=10000) generic allocation calls
Definition mimalloc-doc.h:1231
@ mi_option_retry_on_oom
retry on out-of-memory for N milli seconds (=400), set to 0 to disable retries. (only on windows)
Definition mimalloc-doc.h:1230
@ mi_option_guarded_max
only used when building with MI_GUARDED: maximal rounded object size for guarded objects (=0)
Definition mimalloc-doc.h:1236
@ mi_option_purge_decommits
should a memory purge decommit? (=1). Set to 0 to use memory reset on a purge (instead of decommit)
Definition mimalloc-doc.h:1227
mi_option_reserve_huge_os_pages_at
@ mi_option_reserve_huge_os_pages_at
Reserve N huge OS pages at a specific NUMA node N.
Definition mimalloc-doc.h:1224
@ mi_option_pagemap_commit
v3: commit the full pagemap (to always catch invalid pointer uses) (=0)
Definition mimalloc-doc.h:1263
@ mi_option_max_segment_reclaim
v2: max. percentage of the abandoned segments can be reclaimed per try (=10%)
Definition mimalloc-doc.h:1249
@ mi_option_max_vabits
v3: max user space virtual address bits to consider (=48)
Definition mimalloc-doc.h:1262
@ mi_option_arena_reserve
initial memory size for arena reservation (= 1 GiB on 64-bit) (internally, this value is in KiB; use ...
Definition mimalloc-doc.h:1228
mi_option_page_reclaim_on_free
@ mi_option_page_reclaim_on_free
v3: reclaim abandoned pages on a free (=0). -1 disallowr always, 0 allows if the page originated from...
Definition mimalloc-doc.h:1259
mi_option_reserve_huge_os_pages
@ mi_option_reserve_huge_os_pages
reserve N huge OS pages (1GiB pages) at startup
Definition mimalloc-doc.h:1223
@ mi_option_page_max_candidates
v3: max candidate pages to consider for allocation (=4)
Definition mimalloc-doc.h:1261
@ mi_option_disallow_os_alloc
1 = do not use OS memory for allocation (but only programmatically reserved arenas)
Definition mimalloc-doc.h:1248
@ mi_option_purge_delay
memory purging is delayed by N milli seconds; use 0 for immediate purging or -1 for no purging at all...
Definition mimalloc-doc.h:1246
mi_option_disallow_arena_alloc
@ mi_option_disallow_arena_alloc
1 = do not use arena's for allocation (except if using specific arena id's)
Definition mimalloc-doc.h:1254
@ mi_option_guarded_sample_rate
1 out of N allocations in the min/max range will be guarded (=1000)
Definition mimalloc-doc.h:1238
@ mi_option_max_errors
issue at most N error messages
Definition mimalloc-doc.h:1219
@ mi_option_page_full_retain
v3: retain N full (small) pages per size class (=2). Use -1 for infinite (as in v1,...
Definition mimalloc-doc.h:1260
@ mi_option_max_warnings
issue at most N warning messages
Definition mimalloc-doc.h:1220
@ mi_option_show_errors
Print error messages.
Definition mimalloc-doc.h:1216
@ mi_option_reserve_os_memory
reserve specified amount of OS memory in an arena at startup (internally, this value is in KiB; use m...
Definition mimalloc-doc.h:1225
@ mi_option_arena_eager_commit
eager commit arenas? Use 2 to enable just on overcommit systems (=2)
Definition mimalloc-doc.h:1244
size_t mi_malloc_usable_size(const void *p)
void mi_free_aligned(void *p, size_t alignment)
void * mi_aligned_offset_recalloc(void *p, size_t newcount, size_t size, size_t alignment, size_t offset)
void * mi_aligned_alloc(size_t alignment, size_t size)
size_t mi_malloc_size(const void *p)
void * mi_valloc(size_t size)
void * mi_pvalloc(size_t size)
void * mi__expand(void *p, size_t newsize)
int mi_wdupenv_s(unsigned short **buf, size_t *size, const unsigned short *name)
void mi_cfree(void *p)
Just as free but also checks if the pointer p belongs to our heap.
void * mi_memalign(size_t alignment, size_t size)
void mi_free_size_aligned(void *p, size_t size, size_t alignment)
unsigned char * mi_mbsdup(const unsigned char *s)
int mi_reallocarr(void *p, size_t count, size_t size)
Corresponds to reallocarr in NetBSD.
size_t mi_malloc_good_size(size_t size)
unsigned short * mi_wcsdup(const unsigned short *s)
int mi_dupenv_s(char **buf, size_t *size, const char *name)
int mi_posix_memalign(void **p, size_t alignment, size_t size)
int mi__posix_memalign(void **p, size_t alignment, size_t size)
void * mi_reallocarray(void *p, size_t count, size_t size)
Correspond s to reallocarray in FreeBSD.
void mi_free_size(void *p, size_t size)
void * mi_aligned_recalloc(void *p, size_t newcount, size_t size, size_t alignment)
size_t version
initialize with `MI_STAT_VERSION (so linking dynamically with a separately compiled mimalloc is safe)
Definition mimalloc-doc.h:1057
size_t size
initialize with sizeof(mi_stats_t) (so linking dynamically with a separately compiled mimalloc is saf...
Definition mimalloc-doc.h:1055
void mi_process_info_print_out(mi_output_fun *out, void *arg)
Print out all process info.
mi_subproc_heap_stats_print_out
void mi_subproc_heap_stats_print_out(mi_subproc_id_t subproc_id, mi_output_fun *out, void *arg)
v3: Print statistics for a given subprocess with each heap separately printed.
bool mi_heap_stats_get(mi_heap_t *heap, mi_stats_t *stats)
v3: Return statistics for a given heap.
void mi_stats_print(void *out)
Deprecated.
void mi_stats_reset(void)
v1,v2: Reset statistics.
void mi_stats_print_out(mi_output_fun *out, void *arg)
Print statistics of the current subprocess aggregated over all its heaps.
void mi_subproc_stats_print_out(mi_subproc_id_t subproc_id, mi_output_fun *out, void *arg)
v3: Print the subproc statistics aggregated over all its heaps.
mi_heap_stats_merge_to_subproc
void mi_heap_stats_merge_to_subproc(mi_heap_t *heap)
v3: xplicitly merge the statistics of the current heap with the subprocess.
bool mi_subproc_stats_get(mi_subproc_id_t subproc_id, mi_stats_t *stats)
v3: Get statistics for a given subprocess aggregated over all its heaps.
char * mi_stats_as_json(mi_stats_t *stats, size_t buf_size, char *buf)
v3: Show the given statistics as JSON.
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)
Return process information (time and memory usage).
void mi_stats_merge(void)
v1,v2: Merge thread local statistics with the main statistics and reset.
bool mi_stats_get(mi_stats_t *stats)
Get the statistics for the current subprocess aggregated over all its heaps.
char * mi_heap_stats_get_json(mi_heap_t *heap, size_t buf_size, char *buf)
v3: Get the statistics for a heap as JSON.
char * mi_subproc_stats_get_json(mi_subproc_id_t subproc_id, size_t buf_size, char *buf)
v3: Show the subproc statistics aggregated over all its heaps as JSON.
char * mi_stats_get_json(size_t buf_size, char *buf)
Get the statistics for the current subprocess aggregated over all its heaps as JSON.
size_t mi_stats_get_bin_size(size_t bin)
v3: Return the block size for the given bin.
void mi_process_info_print(void)
Print out all process info.
void mi_heap_stats_print_out(mi_heap_t *heap, mi_output_fun *out, void *arg)
v3: Show the heap statistics as JSON.
[mi_stats_s](group stats.html#structmi stats__s)
Statistics. See include/mimalloc-stats.h for the full definition.
Definition mimalloc-doc.h:1053
mi_subproc_id_t mi_subproc_main(void)
Get the main sub-process identifier.
bool mi_heap_visit_fun(mi_heap_t *heap, void *arg)
The type of a heap visitor function.
Definition mimalloc-doc.h:863
mi_subproc_id_t mi_subproc_new(void)
Create a fresh sub-process (with no associated threads yet).
void * mi_subproc_id_t
A process can associate threads with sub-processes.
Definition mimalloc-doc.h:832
void mi_subproc_delete(mi_subproc_id_t subproc)
v1,v2: Delete a previously created sub-process.
mi_subproc_id_t mi_subproc_current(void)
Get the current sub-process identifier of this thread.
void mi_subproc_destroy(mi_subproc_id_t subproc)
v3: Destroy a previously created sub-process.
void mi_subproc_add_current_thread(mi_subproc_id_t subproc)
Add the current thread to the given sub-process.
bool mi_subproc_visit_heaps(mi_subproc_id_t subproc, mi_heap_visit_fun *visitor, void *arg)
Visit all heaps belonging to a subprocess.
mi_theap_t * mi_theap_set_default(mi_theap_t *theap)
Set the default thread-local theap to use in the current thread for mi_malloc() et al.
void * mi_theap_realloc(mi_theap_t *theap, void *p, size_t newsize)
void * mi_theap_malloc_small(mi_theap_t *theap, size_t size)
Allocate a small object in a specific theap. size must be smaller or equal to MI_SMALL_SIZE_MAX().
mi_theap_t * mi_theap_get_default()
Get the default theap that is used for mi_malloc() et al. for the current thread.
mi_theap_t * mi_heap_theap(mi_heap_t *heap)
Return the thread-local theap for the given heap.
void * mi_theap_malloc_aligned(mi_theap_t *theap, size_t size, size_t alignment)
struct mi_theap_s mi_theap_t
Type of thread-local heaps.
Definition mimalloc-doc.h:1306
void mi_theap_collect(mi_theap_t *theap, bool force)
Release outstanding resources in a specific theap.
void * mi_theap_zalloc(mi_theap_t *theap, size_t size)
Allocate zero-initialized in a specific heap.
void * mi_theap_zalloc_small(mi_theap_t *theap, size_t size)
Allocate a small object in a specific theap. size must be smaller or equal to MI_SMALL_SIZE_MAX().
void * mi_theap_malloc(mi_theap_t *theap, size_t size)
Allocate in a specific theap.
void * mi_theap_calloc(mi_theap_t *theap, size_t count, size_t size)
void * mi_heap_recalloc_aligned_at(mi_heap_t *heap, void *p, size_t newcount, size_t size, size_t alignment, size_t offset)
void * mi_recalloc(void *p, size_t count, size_t size)
Re-allocate memory to count elements of size bytes, with extra memory initialized to zero.
void * mi_heap_rezalloc_aligned_at(mi_heap_t *heap, void *p, size_t newsize, size_t alignment, size_t offset)
void * mi_recalloc_aligned(void *p, size_t newcount, size_t size, size_t alignment)
void * mi_rezalloc_aligned(void *p, size_t newsize, size_t alignment)
void * mi_heap_rezalloc_aligned(mi_heap_t *heap, void *p, size_t newsize, size_t alignment)
void * mi_rezalloc_aligned_at(void *p, size_t newsize, size_t alignment, size_t offset)
void * mi_heap_recalloc_aligned(mi_heap_t *heap, void *p, size_t newcount, size_t size, size_t alignment)
void * mi_heap_rezalloc(mi_heap_t *heap, void *p, size_t newsize)
void * mi_recalloc_aligned_at(void *p, size_t newcount, size_t size, size_t alignment, size_t offset)
void * mi_heap_recalloc(mi_heap_t *heap, void *p, size_t newcount, size_t size)
void * mi_rezalloc(void *p, size_t newsize)