From b74f9b979f6d9646d2d11d436893d2d8d1ac18af Mon Sep 17 00:00:00 2001 From: daan Date: Sat, 10 Aug 2019 17:27:07 -0700 Subject: update documentation --- docs/mimalloc-doc_8h_source.html | 27 +++++++++++++++++---------- 1 file changed, 17 insertions(+), 10 deletions(-) (limited to 'docs/mimalloc-doc_8h_source.html') diff --git a/docs/mimalloc-doc_8h_source.html b/docs/mimalloc-doc_8h_source.html index f12cfdb..b4b6e01 100644 --- a/docs/mimalloc-doc_8h_source.html +++ b/docs/mimalloc-doc_8h_source.html @@ -102,9 +102,10 @@ $(document).ready(function(){initNavTree('mimalloc-doc_8h_source.html','');});
mimalloc-doc.h
-
1 /* ----------------------------------------------------------------------------
2 Copyright (c) 2018, Microsoft Research, Daan Leijen
3 This is free software; you can redistribute it and/or modify it under the
4 terms 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 
78 
82 
86 void mi_free(void* p);
87 
92 void* mi_malloc(size_t size);
93 
98 void* mi_zalloc(size_t size);
99 
109 void* mi_calloc(size_t count, size_t size);
110 
123 void* mi_realloc(void* p, size_t newsize);
124 
135 void* mi_recalloc(void* p, size_t count, size_t size);
136 
150 void* mi_expand(void* p, size_t newsize);
151 
161 void* mi_mallocn(size_t count, size_t size);
162 
172 void* mi_reallocn(void* p, size_t count, size_t size);
173 
190 void* mi_reallocf(void* p, size_t newsize);
191 
192 
201 char* mi_strdup(const char* s);
202 
212 char* mi_strndup(const char* s, size_t n);
213 
226 char* mi_realpath(const char* fname, char* resolved_name);
227 
229 
230 // ------------------------------------------------------
231 // Extended functionality
232 // ------------------------------------------------------
233 
237 
240 #define MI_SMALL_SIZE_MAX (128*sizeof(void*))
241 
249 void* mi_malloc_small(size_t size);
250 
258 void* mi_zalloc_small(size_t size);
259 
274 size_t mi_usable_size(void* p);
275 
285 size_t mi_good_size(size_t size);
286 
294 void mi_collect(bool force);
295 
300 void mi_stats_print(FILE* out);
301 
303 void mi_stats_reset();
304 
308 void mi_thread_init();
309 
314 void mi_thread_done();
315 
320 void mi_thread_stats_print(FILE* out);
321 
327 typedef void (mi_deferred_free_fun)(bool force, unsigned long long heartbeat);
328 
343 void mi_register_deferred_free(mi_deferred_free_fun* deferred_free);
344 
346 
347 // ------------------------------------------------------
348 // Aligned allocation
349 // ------------------------------------------------------
350 
356 
369 void* mi_malloc_aligned(size_t size, size_t alignment);
370 void* mi_zalloc_aligned(size_t size, size_t alignment);
371 void* mi_calloc_aligned(size_t count, size_t size, size_t alignment);
372 void* mi_realloc_aligned(void* p, size_t newsize, size_t alignment);
373 
384 void* mi_malloc_aligned_at(size_t size, size_t alignment, size_t offset);
385 void* mi_zalloc_aligned_at(size_t size, size_t alignment, size_t offset);
386 void* mi_calloc_aligned_at(size_t count, size_t size, size_t alignment, size_t offset);
387 void* mi_realloc_aligned_at(void* p, size_t newsize, size_t alignment, size_t offset);
388 
390 
396 
401 struct mi_heap_s;
402 
407 typedef struct mi_heap_s mi_heap_t;
408 
410 mi_heap_t* mi_heap_new();
411 
419 void mi_heap_delete(mi_heap_t* heap);
420 
428 void mi_heap_destroy(mi_heap_t* heap);
429 
433 mi_heap_t* mi_heap_set_default(mi_heap_t* heap);
434 
437 mi_heap_t* mi_heap_get_default();
438 
444 mi_heap_t* mi_heap_get_backing();
445 
448 void* mi_heap_malloc(mi_heap_t* heap, size_t size);
449 
452 void* mi_heap_zalloc(mi_heap_t* heap, size_t size);
453 
456 void* mi_heap_calloc(mi_heap_t* heap, size_t count, size_t size);
457 
460 void* mi_heap_mallocn(mi_heap_t* heap, size_t count, size_t size);
461 
464 char* mi_heap_strdup(mi_heap_t* heap, const char* s);
465 
468 char* mi_heap_strndup(mi_heap_t* heap, const char* s, size_t n);
469 
472 char* mi_heap_realpath(mi_heap_t* heap, const char* fname, char* resolved_name);
473 
474 void* mi_heap_realloc(mi_heap_t* heap, void* p, size_t newsize);
475 void* mi_heap_reallocn(mi_heap_t* heap, void* p, size_t count, size_t size);
476 void* mi_heap_reallocf(mi_heap_t* heap, void* p, size_t newsize);
477 
478 void* mi_heap_malloc_aligned(mi_heap_t* heap, size_t size, size_t alignment);
479 void* mi_heap_malloc_aligned_at(mi_heap_t* heap, size_t size, size_t alignment, size_t offset);
480 void* mi_heap_zalloc_aligned(mi_heap_t* heap, size_t size, size_t alignment);
481 void* mi_heap_zalloc_aligned_at(mi_heap_t* heap, size_t size, size_t alignment, size_t offset);
482 void* mi_heap_calloc_aligned(mi_heap_t* heap, size_t count, size_t size, size_t alignment);
483 void* mi_heap_calloc_aligned_at(mi_heap_t* heap, size_t count, size_t size, size_t alignment, size_t offset);
484 void* mi_heap_realloc_aligned(mi_heap_t* heap, void* p, size_t newsize, size_t alignment);
485 void* mi_heap_realloc_aligned_at(mi_heap_t* heap, void* p, size_t newsize, size_t alignment, size_t offset);
486 
488 
494 
506 #define mi_malloc_tp(tp) ((tp*)mi_malloc(sizeof(tp)))
507 
509 #define mi_zalloc_tp(tp) ((tp*)mi_zalloc(sizeof(tp)))
510 
512 #define mi_calloc_tp(tp,count) ((tp*)mi_calloc(count,sizeof(tp)))
513 
515 #define mi_mallocn_tp(tp,count) ((tp*)mi_mallocn(count,sizeof(tp)))
516 
518 #define mi_reallocn_tp(p,tp,count) ((tp*)mi_reallocn(p,count,sizeof(tp)))
519 
521 #define mi_heap_malloc_tp(hp,tp) ((tp*)mi_heap_malloc(hp,sizeof(tp)))
522 
524 #define mi_heap_zalloc_tp(hp,tp) ((tp*)mi_heap_zalloc(hp,sizeof(tp)))
525 
527 #define mi_heap_calloc_tp(hp,tp,count) ((tp*)mi_heap_calloc(hp,count,sizeof(tp)))
528 
530 #define mi_heap_mallocn_tp(hp,tp,count) ((tp*)mi_heap_mallocn(hp,count,sizeof(tp)))
531 
533 #define mi_heap_reallocn_tp(hp,p,tp,count) ((tp*)mi_heap_reallocn(p,count,sizeof(tp)))
534 
536 
542 
549 bool mi_heap_contains_block(mi_heap_t* heap, const void* p);
550 
559 bool mi_heap_check_owned(mi_heap_t* heap, const void* p);
560 
568 bool mi_check_owned(const void* p);
569 
572 typedef struct mi_heap_area_s {
573  void* blocks;
574  size_t reserved;
575  size_t committed;
576  size_t used;
577  size_t block_size;
578 } mi_heap_area_t;
579 
587 typedef bool (mi_block_visit_fun)(const mi_heap_t* heap, const mi_heap_area_t* area, void* block, size_t block_size, void* arg);
588 
600 bool mi_heap_visit_blocks(const mi_heap_t* heap, bool visit_all_blocks, mi_block_visit_fun* visitor, void* arg);
601 
603 
609 
611 typedef enum mi_option_e {
612  mi_option_page_reset,
613  mi_option_cache_reset,
614  mi_option_pool_commit,
615  mi_option_show_stats,
616  mi_option_show_errors,
617  mi_option_verbose,
618  _mi_option_last
619 } mi_option_t;
620 
621 bool mi_option_enabled(mi_option_t option);
622 void mi_option_enable(mi_option_t option, bool enable);
623 void mi_option_enable_default(mi_option_t option, bool enable);
624 
625 long mi_option_get(mi_option_t option);
626 void mi_option_set(mi_option_t option, long value);
627 void mi_option_set_default(mi_option_t option, long value);
628 
629 
631 
638 
639 void* mi_recalloc(void* p, size_t count, size_t size);
640 size_t mi_malloc_size(const void* p);
641 size_t mi_malloc_usable_size(const void *p);
642 void mi_cfree(void* p);
643 
644 int mi_posix_memalign(void** p, size_t alignment, size_t size);
645 int mi__posix_memalign(void** p, size_t alignment, size_t size);
646 void* mi_memalign(size_t alignment, size_t size);
647 void* mi_valloc(size_t size);
648 
649 void* mi_pvalloc(size_t size);
650 void* mi_aligned_alloc(size_t alignment, size_t size);
651 void* mi_reallocarray(void* p, size_t count, size_t size);
652 
653 void mi_free_size(void* p, size_t size);
654 void mi_free_size_aligned(void* p, size_t size, size_t alignment);
655 void mi_free_aligned(void* p, size_t alignment);
656 
658 void* mi_new(std::size_t n) noexcept(false);
659 
661 void* mi_new_aligned(std::size_t n, std::align_val_t alignment) noexcept(false);
662 
663 
665 
mi_stats_print
void mi_stats_print(FILE *out)
Print statistics.
+
1 /* ----------------------------------------------------------------------------
2 Copyright (c) 2018, Microsoft Research, Daan Leijen
3 This is free software; you can redistribute it and/or modify it under the
4 terms 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 
78 
82 
86 void mi_free(void* p);
87 
92 void* mi_malloc(size_t size);
93 
98 void* mi_zalloc(size_t size);
99 
109 void* mi_calloc(size_t count, size_t size);
110 
123 void* mi_realloc(void* p, size_t newsize);
124 
135 void* mi_recalloc(void* p, size_t count, size_t size);
136 
150 void* mi_expand(void* p, size_t newsize);
151 
161 void* mi_mallocn(size_t count, size_t size);
162 
172 void* mi_reallocn(void* p, size_t count, size_t size);
173 
190 void* mi_reallocf(void* p, size_t newsize);
191 
192 
201 char* mi_strdup(const char* s);
202 
212 char* mi_strndup(const char* s, size_t n);
213 
226 char* mi_realpath(const char* fname, char* resolved_name);
227 
229 
230 // ------------------------------------------------------
231 // Extended functionality
232 // ------------------------------------------------------
233 
237 
240 #define MI_SMALL_SIZE_MAX (128*sizeof(void*))
241 
249 void* mi_malloc_small(size_t size);
250 
258 void* mi_zalloc_small(size_t size);
259 
274 size_t mi_usable_size(void* p);
275 
285 size_t mi_good_size(size_t size);
286 
294 void mi_collect(bool force);
295 
300 void mi_stats_print(FILE* out);
301 
303 void mi_stats_reset();
304 
308 void mi_thread_init();
309 
314 void mi_thread_done();
315 
320 void mi_thread_stats_print(FILE* out);
321 
327 typedef void (mi_deferred_free_fun)(bool force, unsigned long long heartbeat);
328 
343 void mi_register_deferred_free(mi_deferred_free_fun* deferred_free);
344 
346 
347 // ------------------------------------------------------
348 // Aligned allocation
349 // ------------------------------------------------------
350 
356 
369 void* mi_malloc_aligned(size_t size, size_t alignment);
370 void* mi_zalloc_aligned(size_t size, size_t alignment);
371 void* mi_calloc_aligned(size_t count, size_t size, size_t alignment);
372 void* mi_realloc_aligned(void* p, size_t newsize, size_t alignment);
373 
384 void* mi_malloc_aligned_at(size_t size, size_t alignment, size_t offset);
385 void* mi_zalloc_aligned_at(size_t size, size_t alignment, size_t offset);
386 void* mi_calloc_aligned_at(size_t count, size_t size, size_t alignment, size_t offset);
387 void* mi_realloc_aligned_at(void* p, size_t newsize, size_t alignment, size_t offset);
388 
390 
396 
401 struct mi_heap_s;
402 
407 typedef struct mi_heap_s mi_heap_t;
408 
410 mi_heap_t* mi_heap_new();
411 
419 void mi_heap_delete(mi_heap_t* heap);
420 
428 void mi_heap_destroy(mi_heap_t* heap);
429 
433 mi_heap_t* mi_heap_set_default(mi_heap_t* heap);
434 
437 mi_heap_t* mi_heap_get_default();
438 
444 mi_heap_t* mi_heap_get_backing();
445 
448 void* mi_heap_malloc(mi_heap_t* heap, size_t size);
449 
452 void* mi_heap_zalloc(mi_heap_t* heap, size_t size);
453 
456 void* mi_heap_calloc(mi_heap_t* heap, size_t count, size_t size);
457 
460 void* mi_heap_mallocn(mi_heap_t* heap, size_t count, size_t size);
461 
464 char* mi_heap_strdup(mi_heap_t* heap, const char* s);
465 
468 char* mi_heap_strndup(mi_heap_t* heap, const char* s, size_t n);
469 
472 char* mi_heap_realpath(mi_heap_t* heap, const char* fname, char* resolved_name);
473 
474 void* mi_heap_realloc(mi_heap_t* heap, void* p, size_t newsize);
475 void* mi_heap_reallocn(mi_heap_t* heap, void* p, size_t count, size_t size);
476 void* mi_heap_reallocf(mi_heap_t* heap, void* p, size_t newsize);
477 
478 void* mi_heap_malloc_aligned(mi_heap_t* heap, size_t size, size_t alignment);
479 void* mi_heap_malloc_aligned_at(mi_heap_t* heap, size_t size, size_t alignment, size_t offset);
480 void* mi_heap_zalloc_aligned(mi_heap_t* heap, size_t size, size_t alignment);
481 void* mi_heap_zalloc_aligned_at(mi_heap_t* heap, size_t size, size_t alignment, size_t offset);
482 void* mi_heap_calloc_aligned(mi_heap_t* heap, size_t count, size_t size, size_t alignment);
483 void* mi_heap_calloc_aligned_at(mi_heap_t* heap, size_t count, size_t size, size_t alignment, size_t offset);
484 void* mi_heap_realloc_aligned(mi_heap_t* heap, void* p, size_t newsize, size_t alignment);
485 void* mi_heap_realloc_aligned_at(mi_heap_t* heap, void* p, size_t newsize, size_t alignment, size_t offset);
486 
488 
494 
506 #define mi_malloc_tp(tp) ((tp*)mi_malloc(sizeof(tp)))
507 
509 #define mi_zalloc_tp(tp) ((tp*)mi_zalloc(sizeof(tp)))
510 
512 #define mi_calloc_tp(tp,count) ((tp*)mi_calloc(count,sizeof(tp)))
513 
515 #define mi_mallocn_tp(tp,count) ((tp*)mi_mallocn(count,sizeof(tp)))
516 
518 #define mi_reallocn_tp(p,tp,count) ((tp*)mi_reallocn(p,count,sizeof(tp)))
519 
521 #define mi_heap_malloc_tp(hp,tp) ((tp*)mi_heap_malloc(hp,sizeof(tp)))
522 
524 #define mi_heap_zalloc_tp(hp,tp) ((tp*)mi_heap_zalloc(hp,sizeof(tp)))
525 
527 #define mi_heap_calloc_tp(hp,tp,count) ((tp*)mi_heap_calloc(hp,count,sizeof(tp)))
528 
530 #define mi_heap_mallocn_tp(hp,tp,count) ((tp*)mi_heap_mallocn(hp,count,sizeof(tp)))
531 
533 #define mi_heap_reallocn_tp(hp,p,tp,count) ((tp*)mi_heap_reallocn(p,count,sizeof(tp)))
534 
536 
542 
549 bool mi_heap_contains_block(mi_heap_t* heap, const void* p);
550 
559 bool mi_heap_check_owned(mi_heap_t* heap, const void* p);
560 
568 bool mi_check_owned(const void* p);
569 
572 typedef struct mi_heap_area_s {
573  void* blocks;
574  size_t reserved;
575  size_t committed;
576  size_t used;
577  size_t block_size;
578 } mi_heap_area_t;
579 
587 typedef bool (mi_block_visit_fun)(const mi_heap_t* heap, const mi_heap_area_t* area, void* block, size_t block_size, void* arg);
588 
600 bool mi_heap_visit_blocks(const mi_heap_t* heap, bool visit_all_blocks, mi_block_visit_fun* visitor, void* arg);
601 
603 
609 
611 typedef enum mi_option_e {
612  // stable options
613  mi_option_show_stats,
614  mi_option_show_errors,
615  mi_option_verbose,
616  // the following options are experimental
617  mi_option_secure,
618  mi_option_eager_commit,
619  mi_option_eager_region_commit,
620  mi_option_large_os_pages,
621  mi_option_page_reset,
622  mi_option_cache_reset,
623  mi_option_reset_decommits,
624  mi_option_reset_discards,
625  _mi_option_last
626 } mi_option_t;
627 
628 
629 bool mi_option_enabled(mi_option_t option);
630 void mi_option_enable(mi_option_t option, bool enable);
631 void mi_option_enable_default(mi_option_t option, bool enable);
632 
633 long mi_option_get(mi_option_t option);
634 void mi_option_set(mi_option_t option, long value);
635 void mi_option_set_default(mi_option_t option, long value);
636 
637 
639 
646 
647 void* mi_recalloc(void* p, size_t count, size_t size);
648 size_t mi_malloc_size(const void* p);
649 size_t mi_malloc_usable_size(const void *p);
650 void mi_cfree(void* p);
651 
652 int mi_posix_memalign(void** p, size_t alignment, size_t size);
653 int mi__posix_memalign(void** p, size_t alignment, size_t size);
654 void* mi_memalign(size_t alignment, size_t size);
655 void* mi_valloc(size_t size);
656 
657 void* mi_pvalloc(size_t size);
658 void* mi_aligned_alloc(size_t alignment, size_t size);
659 void* mi_reallocarray(void* p, size_t count, size_t size);
660 
661 void mi_free_size(void* p, size_t size);
662 void mi_free_size_aligned(void* p, size_t size, size_t alignment);
663 void mi_free_aligned(void* p, size_t alignment);
664 
666 void* mi_new(std::size_t n) noexcept(false);
667 
669 void* mi_new_aligned(std::size_t n, std::align_val_t alignment) noexcept(false);
670 
672 void* mi_new_nothrow(size_t n);
673 ``
675 void* mi_new_aligned_nothrow(size_t n, size_t alignment);
676 
678 
mi_stats_print
void mi_stats_print(FILE *out)
Print statistics.
mi_option_enable_default
void mi_option_enable_default(mi_option_t option, bool enable)
mi_usable_size
size_t mi_usable_size(void *p)
Return the available bytes in a memory block.
+
mi_option_reset_discards
Experimental.
Definition: mimalloc-doc.h:624
mi_reallocn
void * mi_reallocn(void *p, size_t count, size_t size)
Re-allocate memory to count elements of size bytes.
mi_malloc_aligned
void * mi_malloc_aligned(size_t size, size_t alignment)
Allocate size bytes aligned by alignment.
mi_heap_realloc_aligned
void * mi_heap_realloc_aligned(mi_heap_t *heap, void *p, size_t newsize, size_t alignment)
@@ -112,17 +113,18 @@ $(document).ready(function(){initNavTree('mimalloc-doc_8h_source.html','');});
mi_mallocn
void * mi_mallocn(size_t count, size_t size)
Allocate count elements of size bytes.
mi_malloc_size
size_t mi_malloc_size(const void *p)
mi_thread_done
void mi_thread_done()
Uninitialize mimalloc on a thread.
-
mi_option_cache_reset
Reset segment memory when a segment is cached.
Definition: mimalloc-doc.h:613
+
mi_option_cache_reset
Reset segment memory when a segment is cached.
Definition: mimalloc-doc.h:622
mi_posix_memalign
int mi_posix_memalign(void **p, size_t alignment, size_t size)
-
mi_option_pool_commit
Commit segments in large pools.
Definition: mimalloc-doc.h:614
mi_option_set_default
void mi_option_set_default(mi_option_t option, long value)
-
mi_new_aligned
void * mi_new_aligned(std::size_t n, std::align_val_t alignment) noexcept(false)
Only defined in C++ compilation; raise std::bad_alloc exception on failure.
+
mi_new_aligned
void * mi_new_aligned(std::size_t n, std::align_val_t alignment) noexcept(false)
raise std::bad_alloc exception on failure.
+
mi_option_eager_commit
Eagerly commit segments (4MiB) (enabled by default).
Definition: mimalloc-doc.h:618
mi_heap_zalloc
void * mi_heap_zalloc(mi_heap_t *heap, size_t size)
Allocate zero-initialized in a specific heap.
mi_option_set
void mi_option_set(mi_option_t option, long value)
mi_register_deferred_free
void mi_register_deferred_free(mi_deferred_free_fun *deferred_free)
Register a deferred free function.
+
mi_option_eager_region_commit
Eagerly commit large (256MiB) memory regions (enabled by default except on Windows)
Definition: mimalloc-doc.h:619
mi_cfree
void mi_cfree(void *p)
mi_thread_stats_print
void mi_thread_stats_print(FILE *out)
Print out heap statistics for this thread.
-
_mi_option_last
Definition: mimalloc-doc.h:618
+
_mi_option_last
Definition: mimalloc-doc.h:625
mi_realloc_aligned_at
void * mi_realloc_aligned_at(void *p, size_t newsize, size_t alignment, size_t offset)
mi_heap_area_t::blocks
void * blocks
start of the area containing heap blocks
Definition: mimalloc-doc.h:573
mi_realloc_aligned
void * mi_realloc_aligned(void *p, size_t newsize, size_t alignment)
@@ -140,7 +142,7 @@ $(document).ready(function(){initNavTree('mimalloc-doc_8h_source.html','');});
mi_zalloc
void * mi_zalloc(size_t size)
Allocate zero-initialized size bytes.
mi_thread_init
void mi_thread_init()
Initialize mimalloc on a thread.
mi_heap_calloc
void * mi_heap_calloc(mi_heap_t *heap, size_t count, size_t size)
Allocate count zero-initialized elements in a specific heap.
-
mi_new
void * mi_new(std::size_t n) noexcept(false)
Only defined in C++ compilation; raise std::bad_alloc exception on failure.
+
mi_new
void * mi_new(std::size_t n) noexcept(false)
raise std::bad_alloc exception on failure.
mi_heap_calloc_aligned
void * mi_heap_calloc_aligned(mi_heap_t *heap, size_t count, size_t size, size_t alignment)
mi_heap_area_t::block_size
size_t block_size
size in bytes of one block
Definition: mimalloc-doc.h:577
mi_reallocarray
void * mi_reallocarray(void *p, size_t count, size_t size)
@@ -148,18 +150,21 @@ $(document).ready(function(){initNavTree('mimalloc-doc_8h_source.html','');});
mi_realloc
void * mi_realloc(void *p, size_t newsize)
Re-allocate memory to newsize bytes.
mi_heap_reallocf
void * mi_heap_reallocf(mi_heap_t *heap, void *p, size_t newsize)
mi_free_size_aligned
void mi_free_size_aligned(void *p, size_t size, size_t alignment)
-
mi_option_page_reset
Reset page memory when it becomes free.
Definition: mimalloc-doc.h:612
+
mi_option_page_reset
Reset page memory when it becomes free.
Definition: mimalloc-doc.h:621
mi_heap_visit_blocks
bool mi_heap_visit_blocks(const mi_heap_t *heap, bool visit_all_blocks, mi_block_visit_fun *visitor, void *arg)
Visit all areas and blocks in a heap.
mi_malloc
void * mi_malloc(size_t size)
Allocate size bytes.
mi_option_enabled
bool mi_option_enabled(mi_option_t option)
+
mi_option_reset_decommits
Experimental.
Definition: mimalloc-doc.h:623
mi_heap_strndup
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.
mi_block_visit_fun
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:587
mi_heap_malloc_aligned_at
void * mi_heap_malloc_aligned_at(mi_heap_t *heap, size_t size, size_t alignment, size_t offset)
mi_realpath
char * mi_realpath(const char *fname, char *resolved_name)
Resolve a file path name.
-
mi_option_show_errors
Print error messages to stderr.
Definition: mimalloc-doc.h:616
+
mi_option_show_errors
Print error messages to stderr.
Definition: mimalloc-doc.h:614
mi_memalign
void * mi_memalign(size_t alignment, size_t size)
+
mi_new_aligned_nothrow
void * mi_new_aligned_nothrow(size_t n, size_t alignment)
return NULL on failure.
+
mi_new_nothrow
void * mi_new_nothrow(size_t n)
return NULL on failure.
mi_heap_contains_block
bool mi_heap_contains_block(mi_heap_t *heap, const void *p)
Does a heap contain a pointer to a previously allocated block?
-
mi_option_verbose
Print verbose messages to stderr.
Definition: mimalloc-doc.h:617
+
mi_option_verbose
Print verbose messages to stderr.
Definition: mimalloc-doc.h:615
mi_zalloc_aligned_at
void * mi_zalloc_aligned_at(size_t size, size_t alignment, size_t offset)
mi_malloc_aligned_at
void * mi_malloc_aligned_at(size_t size, size_t alignment, size_t offset)
Allocate size bytes aligned by alignment at a specified offset.
mi_heap_delete
void mi_heap_delete(mi_heap_t *heap)
Delete a previously allocated heap.
@@ -169,7 +174,7 @@ $(document).ready(function(){initNavTree('mimalloc-doc_8h_source.html','');});
mi_good_size
size_t mi_good_size(size_t size)
Return the used allocation size.
mi_heap_mallocn
void * mi_heap_mallocn(mi_heap_t *heap, size_t count, size_t size)
Allocate count elements in a specific heap.
mi_heap_area_t
An area of heap space contains blocks of a single size.
Definition: mimalloc-doc.h:572
-
mi_option_show_stats
Print statistics to stderr when the program is done.
Definition: mimalloc-doc.h:615
+
mi_option_show_stats
Print statistics to stderr when the program is done.
Definition: mimalloc-doc.h:613
mi_zalloc_aligned
void * mi_zalloc_aligned(size_t size, size_t alignment)
mi_heap_area_t::reserved
size_t reserved
bytes reserved for this area
Definition: mimalloc-doc.h:574
mi_heap_t
struct mi_heap_s mi_heap_t
Type of first-class heaps.
Definition: mimalloc-doc.h:407
@@ -179,6 +184,8 @@ $(document).ready(function(){initNavTree('mimalloc-doc_8h_source.html','');});
mi_collect
void mi_collect(bool force)
Eagerly free memory.
mi_heap_destroy
void mi_heap_destroy(mi_heap_t *heap)
Destroy a heap, freeing all its still allocated blocks.
mi_calloc_aligned_at
void * mi_calloc_aligned_at(size_t count, size_t size, size_t alignment, size_t offset)
+
mi_option_large_os_pages
Use large OS pages if possible.
Definition: mimalloc-doc.h:620
+
mi_option_secure
Experimental.
Definition: mimalloc-doc.h:617
mi_stats_reset
void mi_stats_reset()
Reset statistics.
mi_heap_reallocn
void * mi_heap_reallocn(mi_heap_t *heap, void *p, size_t count, size_t size)
mi_heap_realloc
void * mi_heap_realloc(mi_heap_t *heap, void *p, size_t newsize)
-- cgit v1.2.3