mirror of
https://github.com/microsoft/mimalloc.git
synced 2025-05-12 02:09:32 +03:00
fix stats for delay purge commit
This commit is contained in:
commit
8339cefdeb
5 changed files with 43 additions and 28 deletions
|
@ -246,7 +246,15 @@ static mi_decl_noinline void* mi_arena_try_alloc_at(
|
||||||
}
|
}
|
||||||
else {
|
else {
|
||||||
// no need to commit, but check if already fully committed
|
// no need to commit, but check if already fully committed
|
||||||
|
// commit requested, but the range may not be committed as a whole: ensure it is committed now
|
||||||
memid->initially_committed = mi_bitmap_is_setN(arena->slices_committed, slice_index, slice_count);
|
memid->initially_committed = mi_bitmap_is_setN(arena->slices_committed, slice_index, slice_count);
|
||||||
|
if (!memid->initially_committed) {
|
||||||
|
// partly committed.. adjust stats
|
||||||
|
size_t already_committed_count = 0;
|
||||||
|
mi_bitmap_setN(arena->slices_committed, slice_index, slice_count, &already_committed_count);
|
||||||
|
mi_bitmap_clearN(arena->slices_committed, slice_index, slice_count);
|
||||||
|
mi_os_stat_decrease(committed, mi_size_of_slices(already_committed_count));
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
mi_assert_internal(mi_bitmap_is_clearN(arena->slices_free, slice_index, slice_count));
|
mi_assert_internal(mi_bitmap_is_clearN(arena->slices_free, slice_index, slice_count));
|
||||||
|
@ -824,6 +832,7 @@ void _mi_arenas_page_free(mi_page_t* page) {
|
||||||
const size_t total_slices = page->slice_committed / MI_ARENA_SLICE_SIZE; // conservative
|
const size_t total_slices = page->slice_committed / MI_ARENA_SLICE_SIZE; // conservative
|
||||||
//mi_assert_internal(mi_bitmap_is_clearN(arena->slices_committed, page->memid.mem.arena.slice_index, total_slices));
|
//mi_assert_internal(mi_bitmap_is_clearN(arena->slices_committed, page->memid.mem.arena.slice_index, total_slices));
|
||||||
mi_assert_internal(page->memid.mem.arena.slice_count >= total_slices);
|
mi_assert_internal(page->memid.mem.arena.slice_count >= total_slices);
|
||||||
|
mi_assert_internal(total_slices > 0);
|
||||||
if (total_slices > 0) {
|
if (total_slices > 0) {
|
||||||
mi_bitmap_setN(arena->slices_committed, page->memid.mem.arena.slice_index, total_slices, NULL);
|
mi_bitmap_setN(arena->slices_committed, page->memid.mem.arena.slice_index, total_slices, NULL);
|
||||||
}
|
}
|
||||||
|
|
37
src/os.c
37
src/os.c
|
@ -143,22 +143,21 @@ bool _mi_os_secure_guard_page_reset_before(void* addr) {
|
||||||
return _mi_os_secure_guard_page_reset_at((uint8_t*)addr - _mi_os_secure_guard_page_size());
|
return _mi_os_secure_guard_page_reset_at((uint8_t*)addr - _mi_os_secure_guard_page_size());
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
/* -----------------------------------------------------------
|
/* -----------------------------------------------------------
|
||||||
Free memory
|
Free memory
|
||||||
-------------------------------------------------------------- */
|
-------------------------------------------------------------- */
|
||||||
|
|
||||||
static void mi_os_free_huge_os_pages(void* p, size_t size);
|
static void mi_os_free_huge_os_pages(void* p, size_t size);
|
||||||
|
|
||||||
static void mi_os_prim_free(void* addr, size_t size, bool still_committed) {
|
static void mi_os_prim_free(void* addr, size_t size, size_t commit_size) {
|
||||||
mi_assert_internal((size % _mi_os_page_size()) == 0);
|
mi_assert_internal((size % _mi_os_page_size()) == 0);
|
||||||
if (addr == NULL || size == 0) return; // || _mi_os_is_huge_reserved(addr)
|
if (addr == NULL || size == 0) return; // || _mi_os_is_huge_reserved(addr)
|
||||||
int err = _mi_prim_free(addr, size);
|
int err = _mi_prim_free(addr, size);
|
||||||
if (err != 0) {
|
if (err != 0) {
|
||||||
_mi_warning_message("unable to free OS memory (error: %d (0x%x), size: 0x%zx bytes, address: %p)\n", err, err, size, addr);
|
_mi_warning_message("unable to free OS memory (error: %d (0x%x), size: 0x%zx bytes, address: %p)\n", err, err, size, addr);
|
||||||
}
|
}
|
||||||
if (still_committed) {
|
if (commit_size > 0) {
|
||||||
mi_os_stat_decrease(committed, size);
|
mi_os_stat_decrease(committed, commit_size);
|
||||||
}
|
}
|
||||||
mi_os_stat_decrease(reserved, size);
|
mi_os_stat_decrease(reserved, size);
|
||||||
}
|
}
|
||||||
|
@ -167,13 +166,19 @@ void _mi_os_free_ex(void* addr, size_t size, bool still_committed, mi_memid_t me
|
||||||
if (mi_memkind_is_os(memid.memkind)) {
|
if (mi_memkind_is_os(memid.memkind)) {
|
||||||
size_t csize = memid.mem.os.size;
|
size_t csize = memid.mem.os.size;
|
||||||
if (csize==0) { _mi_os_good_alloc_size(size); }
|
if (csize==0) { _mi_os_good_alloc_size(size); }
|
||||||
|
size_t commit_size = (still_committed ? csize : 0);
|
||||||
void* base = addr;
|
void* base = addr;
|
||||||
// different base? (due to alignment)
|
// different base? (due to alignment)
|
||||||
if (memid.mem.os.base != base) {
|
if (memid.mem.os.base != base) {
|
||||||
mi_assert(memid.mem.os.base <= addr);
|
mi_assert(memid.mem.os.base <= addr);
|
||||||
// mi_assert((uint8_t*)memid.mem.os.base + memid.mem.os.alignment >= (uint8_t*)addr);
|
|
||||||
base = memid.mem.os.base;
|
base = memid.mem.os.base;
|
||||||
if (memid.mem.os.size==0) { csize += ((uint8_t*)addr - (uint8_t*)memid.mem.os.base); }
|
const size_t diff = (uint8_t*)addr - (uint8_t*)memid.mem.os.base;
|
||||||
|
if (memid.mem.os.size==0) {
|
||||||
|
csize += diff;
|
||||||
|
}
|
||||||
|
if (still_committed) {
|
||||||
|
commit_size -= diff; // the (addr-base) part was already un-committed
|
||||||
|
}
|
||||||
}
|
}
|
||||||
// free it
|
// free it
|
||||||
if (memid.memkind == MI_MEM_OS_HUGE) {
|
if (memid.memkind == MI_MEM_OS_HUGE) {
|
||||||
|
@ -181,7 +186,7 @@ void _mi_os_free_ex(void* addr, size_t size, bool still_committed, mi_memid_t me
|
||||||
mi_os_free_huge_os_pages(base, csize);
|
mi_os_free_huge_os_pages(base, csize);
|
||||||
}
|
}
|
||||||
else {
|
else {
|
||||||
mi_os_prim_free(base, csize, still_committed);
|
mi_os_prim_free(base, csize, (still_committed ? commit_size : 0));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
else {
|
else {
|
||||||
|
@ -266,7 +271,7 @@ static void* mi_os_prim_alloc_aligned(size_t size, size_t alignment, bool commit
|
||||||
_mi_warning_message("unable to allocate aligned OS memory directly, fall back to over-allocation (size: 0x%zx bytes, address: %p, alignment: 0x%zx, commit: %d)\n", size, p, alignment, commit);
|
_mi_warning_message("unable to allocate aligned OS memory directly, fall back to over-allocation (size: 0x%zx bytes, address: %p, alignment: 0x%zx, commit: %d)\n", size, p, alignment, commit);
|
||||||
}
|
}
|
||||||
#endif
|
#endif
|
||||||
if (p != NULL) { mi_os_prim_free(p, size, commit); }
|
if (p != NULL) { mi_os_prim_free(p, size, (commit ? size : 0)); }
|
||||||
if (size >= (SIZE_MAX - alignment)) return NULL; // overflow
|
if (size >= (SIZE_MAX - alignment)) return NULL; // overflow
|
||||||
const size_t over_size = size + alignment;
|
const size_t over_size = size + alignment;
|
||||||
|
|
||||||
|
@ -297,8 +302,8 @@ static void* mi_os_prim_alloc_aligned(size_t size, size_t alignment, bool commit
|
||||||
size_t mid_size = _mi_align_up(size, _mi_os_page_size());
|
size_t mid_size = _mi_align_up(size, _mi_os_page_size());
|
||||||
size_t post_size = over_size - pre_size - mid_size;
|
size_t post_size = over_size - pre_size - mid_size;
|
||||||
mi_assert_internal(pre_size < over_size&& post_size < over_size&& mid_size >= size);
|
mi_assert_internal(pre_size < over_size&& post_size < over_size&& mid_size >= size);
|
||||||
if (pre_size > 0) { mi_os_prim_free(p, pre_size, commit); }
|
if (pre_size > 0) { mi_os_prim_free(p, pre_size, (commit ? pre_size : 0)); }
|
||||||
if (post_size > 0) { mi_os_prim_free((uint8_t*)aligned_p + mid_size, post_size, commit); }
|
if (post_size > 0) { mi_os_prim_free((uint8_t*)aligned_p + mid_size, post_size, (commit ? post_size : 0)); }
|
||||||
// we can return the aligned pointer on `mmap` systems
|
// we can return the aligned pointer on `mmap` systems
|
||||||
p = aligned_p;
|
p = aligned_p;
|
||||||
*base = aligned_p; // since we freed the pre part, `*base == p`.
|
*base = aligned_p; // since we freed the pre part, `*base == p`.
|
||||||
|
@ -454,9 +459,9 @@ bool _mi_os_commit(void* addr, size_t size, bool* is_zero) {
|
||||||
return _mi_os_commit_ex(addr, size, is_zero, size);
|
return _mi_os_commit_ex(addr, size, is_zero, size);
|
||||||
}
|
}
|
||||||
|
|
||||||
static bool mi_os_decommit_ex(void* addr, size_t size, bool* needs_recommit, size_t stats_size) {
|
static bool mi_os_decommit_ex(void* addr, size_t size, bool* needs_recommit, size_t stat_size) {
|
||||||
mi_assert_internal(needs_recommit!=NULL);
|
mi_assert_internal(needs_recommit!=NULL);
|
||||||
mi_os_stat_decrease(committed, stats_size);
|
mi_os_stat_decrease(committed, stat_size);
|
||||||
|
|
||||||
// page align
|
// page align
|
||||||
size_t csize;
|
size_t csize;
|
||||||
|
@ -505,7 +510,7 @@ bool _mi_os_reset(void* addr, size_t size) {
|
||||||
|
|
||||||
// either resets or decommits memory, returns true if the memory needs
|
// either resets or decommits memory, returns true if the memory needs
|
||||||
// to be recommitted if it is to be re-used later on.
|
// to be recommitted if it is to be re-used later on.
|
||||||
bool _mi_os_purge_ex(void* p, size_t size, bool allow_reset, size_t stats_size)
|
bool _mi_os_purge_ex(void* p, size_t size, bool allow_reset, size_t stat_size)
|
||||||
{
|
{
|
||||||
if (mi_option_get(mi_option_purge_delay) < 0) return false; // is purging allowed?
|
if (mi_option_get(mi_option_purge_delay) < 0) return false; // is purging allowed?
|
||||||
mi_os_stat_counter_increase(purge_calls, 1);
|
mi_os_stat_counter_increase(purge_calls, 1);
|
||||||
|
@ -515,7 +520,7 @@ bool _mi_os_purge_ex(void* p, size_t size, bool allow_reset, size_t stats_size)
|
||||||
!_mi_preloading()) // don't decommit during preloading (unsafe)
|
!_mi_preloading()) // don't decommit during preloading (unsafe)
|
||||||
{
|
{
|
||||||
bool needs_recommit = true;
|
bool needs_recommit = true;
|
||||||
mi_os_decommit_ex(p, size, &needs_recommit, stats_size);
|
mi_os_decommit_ex(p, size, &needs_recommit, stat_size);
|
||||||
return needs_recommit;
|
return needs_recommit;
|
||||||
}
|
}
|
||||||
else {
|
else {
|
||||||
|
@ -636,7 +641,7 @@ void* _mi_os_alloc_huge_os_pages(size_t pages, int numa_node, mi_msecs_t max_mse
|
||||||
// no success, issue a warning and break
|
// no success, issue a warning and break
|
||||||
if (p != NULL) {
|
if (p != NULL) {
|
||||||
_mi_warning_message("could not allocate contiguous huge OS page %zu at %p\n", page, addr);
|
_mi_warning_message("could not allocate contiguous huge OS page %zu at %p\n", page, addr);
|
||||||
mi_os_prim_free(p, MI_HUGE_OS_PAGE_SIZE, true);
|
mi_os_prim_free(p, MI_HUGE_OS_PAGE_SIZE, MI_HUGE_OS_PAGE_SIZE);
|
||||||
}
|
}
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
|
@ -682,7 +687,7 @@ static void mi_os_free_huge_os_pages(void* p, size_t size) {
|
||||||
if (p==NULL || size==0) return;
|
if (p==NULL || size==0) return;
|
||||||
uint8_t* base = (uint8_t*)p;
|
uint8_t* base = (uint8_t*)p;
|
||||||
while (size >= MI_HUGE_OS_PAGE_SIZE) {
|
while (size >= MI_HUGE_OS_PAGE_SIZE) {
|
||||||
mi_os_prim_free(base, MI_HUGE_OS_PAGE_SIZE, true);
|
mi_os_prim_free(base, MI_HUGE_OS_PAGE_SIZE, MI_HUGE_OS_PAGE_SIZE);
|
||||||
size -= MI_HUGE_OS_PAGE_SIZE;
|
size -= MI_HUGE_OS_PAGE_SIZE;
|
||||||
base += MI_HUGE_OS_PAGE_SIZE;
|
base += MI_HUGE_OS_PAGE_SIZE;
|
||||||
}
|
}
|
||||||
|
|
|
@ -48,7 +48,7 @@ static int ITER = 20;
|
||||||
static int THREADS = 32;
|
static int THREADS = 32;
|
||||||
static int SCALE = 50;
|
static int SCALE = 50;
|
||||||
static int ITER = 50;
|
static int ITER = 50;
|
||||||
#elif 1
|
#elif 0
|
||||||
static int THREADS = 32;
|
static int THREADS = 32;
|
||||||
static int SCALE = 25;
|
static int SCALE = 25;
|
||||||
static int ITER = 50;
|
static int ITER = 50;
|
||||||
|
@ -82,6 +82,7 @@ static bool main_participates = false; // main thread participates as a
|
||||||
#define custom_calloc(n,s) mi_calloc(n,s)
|
#define custom_calloc(n,s) mi_calloc(n,s)
|
||||||
#define custom_realloc(p,s) mi_realloc(p,s)
|
#define custom_realloc(p,s) mi_realloc(p,s)
|
||||||
#define custom_free(p) mi_free(p)
|
#define custom_free(p) mi_free(p)
|
||||||
|
|
||||||
#ifndef NDEBUG
|
#ifndef NDEBUG
|
||||||
#define xHEAP_WALK // walk the heap objects?
|
#define xHEAP_WALK // walk the heap objects?
|
||||||
#endif
|
#endif
|
||||||
|
|
Loading…
Add table
Reference in a new issue