mirror of
https://github.com/microsoft/mimalloc.git
synced 2025-05-04 22:49:32 +03:00
refactor thread meta-data initilazation, upstream of python/cpython#113263
This commit is contained in:
parent
66052f135f
commit
710d6138c7
3 changed files with 43 additions and 28 deletions
|
@ -88,6 +88,7 @@ mi_threadid_t _mi_thread_id(void) mi_attr_noexcept;
|
||||||
mi_heap_t* _mi_heap_main_get(void); // statically allocated main backing heap
|
mi_heap_t* _mi_heap_main_get(void); // statically allocated main backing heap
|
||||||
void _mi_thread_done(mi_heap_t* heap);
|
void _mi_thread_done(mi_heap_t* heap);
|
||||||
void _mi_thread_data_collect(void);
|
void _mi_thread_data_collect(void);
|
||||||
|
void _mi_tld_init(mi_tld_t* tld, mi_heap_t* bheap);
|
||||||
|
|
||||||
// os.c
|
// os.c
|
||||||
void _mi_os_init(void); // called from process init
|
void _mi_os_init(void); // called from process init
|
||||||
|
@ -183,6 +184,7 @@ size_t _mi_bin_size(uint8_t bin); // for stats
|
||||||
uint8_t _mi_bin(size_t size); // for stats
|
uint8_t _mi_bin(size_t size); // for stats
|
||||||
|
|
||||||
// "heap.c"
|
// "heap.c"
|
||||||
|
void _mi_heap_init(mi_heap_t* heap, mi_tld_t* tld, mi_arena_id_t arena_id);
|
||||||
void _mi_heap_destroy_pages(mi_heap_t* heap);
|
void _mi_heap_destroy_pages(mi_heap_t* heap);
|
||||||
void _mi_heap_collect_abandon(mi_heap_t* heap);
|
void _mi_heap_collect_abandon(mi_heap_t* heap);
|
||||||
void _mi_heap_set_default_direct(mi_heap_t* heap);
|
void _mi_heap_set_default_direct(mi_heap_t* heap);
|
||||||
|
|
35
src/heap.c
35
src/heap.c
|
@ -123,6 +123,9 @@ static void mi_heap_collect_ex(mi_heap_t* heap, mi_collect_t collect)
|
||||||
const bool force = (collect >= MI_FORCE);
|
const bool force = (collect >= MI_FORCE);
|
||||||
_mi_deferred_free(heap, force);
|
_mi_deferred_free(heap, force);
|
||||||
|
|
||||||
|
// python/cpython#112532: we may be called from a thread that is not the owner of the heap
|
||||||
|
const bool is_main_thread = (_mi_is_main_thread() && heap->thread_id == _mi_thread_id());
|
||||||
|
|
||||||
// note: never reclaim on collect but leave it to threads that need storage to reclaim
|
// note: never reclaim on collect but leave it to threads that need storage to reclaim
|
||||||
if (
|
if (
|
||||||
#ifdef NDEBUG
|
#ifdef NDEBUG
|
||||||
|
@ -130,7 +133,7 @@ static void mi_heap_collect_ex(mi_heap_t* heap, mi_collect_t collect)
|
||||||
#else
|
#else
|
||||||
collect >= MI_FORCE
|
collect >= MI_FORCE
|
||||||
#endif
|
#endif
|
||||||
&& _mi_is_main_thread() && mi_heap_is_backing(heap) && !heap->no_reclaim)
|
&& is_main_thread && mi_heap_is_backing(heap) && !heap->no_reclaim)
|
||||||
{
|
{
|
||||||
// the main thread is abandoned (end-of-program), try to reclaim all abandoned segments.
|
// the main thread is abandoned (end-of-program), try to reclaim all abandoned segments.
|
||||||
// if all memory is freed by now, all segments should be freed.
|
// if all memory is freed by now, all segments should be freed.
|
||||||
|
@ -157,7 +160,7 @@ static void mi_heap_collect_ex(mi_heap_t* heap, mi_collect_t collect)
|
||||||
_mi_segments_collect(collect == MI_FORCE, &heap->tld->segments);
|
_mi_segments_collect(collect == MI_FORCE, &heap->tld->segments);
|
||||||
|
|
||||||
// if forced, collect thread data cache on program-exit (or shared library unload)
|
// if forced, collect thread data cache on program-exit (or shared library unload)
|
||||||
if (force && _mi_is_main_thread() && mi_heap_is_backing(heap)) {
|
if (force && is_main_thread && mi_heap_is_backing(heap)) {
|
||||||
_mi_thread_data_collect(); // collect thread data cache
|
_mi_thread_data_collect(); // collect thread data cache
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -201,19 +204,29 @@ mi_heap_t* mi_heap_get_backing(void) {
|
||||||
return bheap;
|
return bheap;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
void _mi_heap_init(mi_heap_t* heap, mi_tld_t* tld, mi_arena_id_t arena_id) {
|
||||||
|
_mi_memcpy_aligned(heap, &_mi_heap_empty, sizeof(mi_heap_t));
|
||||||
|
heap->tld = tld;
|
||||||
|
heap->thread_id = _mi_thread_id();
|
||||||
|
heap->arena_id = arena_id;
|
||||||
|
if (heap == tld->heap_backing) {
|
||||||
|
_mi_random_init(&heap->random);
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
_mi_random_split(&tld->heap_backing->random, &heap->random);
|
||||||
|
}
|
||||||
|
heap->cookie = _mi_heap_random_next(heap) | 1;
|
||||||
|
heap->keys[0] = _mi_heap_random_next(heap);
|
||||||
|
heap->keys[1] = _mi_heap_random_next(heap);
|
||||||
|
}
|
||||||
|
|
||||||
mi_decl_nodiscard mi_heap_t* mi_heap_new_in_arena(mi_arena_id_t arena_id) {
|
mi_decl_nodiscard mi_heap_t* mi_heap_new_in_arena(mi_arena_id_t arena_id) {
|
||||||
mi_heap_t* bheap = mi_heap_get_backing();
|
mi_heap_t* bheap = mi_heap_get_backing();
|
||||||
mi_heap_t* heap = mi_heap_malloc_tp(bheap, mi_heap_t); // todo: OS allocate in secure mode?
|
mi_heap_t* heap = mi_heap_malloc_tp(bheap, mi_heap_t); // todo: OS allocate in secure mode?
|
||||||
if (heap == NULL) return NULL;
|
if (heap == NULL) return NULL;
|
||||||
_mi_memcpy_aligned(heap, &_mi_heap_empty, sizeof(mi_heap_t));
|
_mi_heap_init(heap, bheap->tld, arena_id);
|
||||||
heap->tld = bheap->tld;
|
// don't reclaim abandoned pages or otherwise destroy is unsafe
|
||||||
heap->thread_id = _mi_thread_id();
|
heap->no_reclaim = true;
|
||||||
heap->arena_id = arena_id;
|
|
||||||
_mi_random_split(&bheap->random, &heap->random);
|
|
||||||
heap->cookie = _mi_heap_random_next(heap) | 1;
|
|
||||||
heap->keys[0] = _mi_heap_random_next(heap);
|
|
||||||
heap->keys[1] = _mi_heap_random_next(heap);
|
|
||||||
heap->no_reclaim = true; // don't reclaim abandoned pages or otherwise destroy is unsafe
|
|
||||||
// push on the thread local heaps list
|
// push on the thread local heaps list
|
||||||
heap->next = heap->tld->heaps;
|
heap->next = heap->tld->heaps;
|
||||||
heap->tld->heaps = heap;
|
heap->tld->heaps = heap;
|
||||||
|
|
34
src/init.c
34
src/init.c
|
@ -264,7 +264,7 @@ void _mi_thread_data_collect(void) {
|
||||||
}
|
}
|
||||||
|
|
||||||
// Initialize the thread local default heap, called from `mi_thread_init`
|
// Initialize the thread local default heap, called from `mi_thread_init`
|
||||||
static bool _mi_heap_init(void) {
|
static bool _mi_thread_heap_init(void) {
|
||||||
if (mi_heap_is_initialized(mi_prim_get_default_heap())) return true;
|
if (mi_heap_is_initialized(mi_prim_get_default_heap())) return true;
|
||||||
if (_mi_is_main_thread()) {
|
if (_mi_is_main_thread()) {
|
||||||
// mi_assert_internal(_mi_heap_main.thread_id != 0); // can happen on freeBSD where alloc is called before any initialization
|
// mi_assert_internal(_mi_heap_main.thread_id != 0); // can happen on freeBSD where alloc is called before any initialization
|
||||||
|
@ -280,25 +280,25 @@ static bool _mi_heap_init(void) {
|
||||||
|
|
||||||
mi_tld_t* tld = &td->tld;
|
mi_tld_t* tld = &td->tld;
|
||||||
mi_heap_t* heap = &td->heap;
|
mi_heap_t* heap = &td->heap;
|
||||||
_mi_memcpy_aligned(heap, &_mi_heap_empty, sizeof(*heap));
|
_mi_tld_init(tld, heap); // must be before `_mi_heap_init`
|
||||||
heap->thread_id = _mi_thread_id();
|
_mi_heap_init(heap, tld, _mi_arena_id_none());
|
||||||
_mi_random_init(&heap->random);
|
_mi_heap_set_default_direct(heap);
|
||||||
heap->cookie = _mi_heap_random_next(heap) | 1;
|
|
||||||
heap->keys[0] = _mi_heap_random_next(heap);
|
|
||||||
heap->keys[1] = _mi_heap_random_next(heap);
|
|
||||||
heap->tld = tld;
|
|
||||||
tld->heap_backing = heap;
|
|
||||||
tld->heaps = heap;
|
|
||||||
tld->segments.stats = &tld->stats;
|
|
||||||
tld->segments.os = &tld->os;
|
|
||||||
tld->os.stats = &tld->stats;
|
|
||||||
_mi_heap_set_default_direct(heap);
|
|
||||||
}
|
}
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// initialize thread local data
|
||||||
|
void _mi_tld_init(mi_tld_t* tld, mi_heap_t* bheap) {
|
||||||
|
_mi_memzero_aligned(tld,sizeof(mi_tld_t));
|
||||||
|
tld->heap_backing = bheap;
|
||||||
|
tld->heaps = bheap;
|
||||||
|
tld->segments.stats = &tld->stats;
|
||||||
|
tld->segments.os = &tld->os;
|
||||||
|
tld->os.stats = &tld->stats;
|
||||||
|
}
|
||||||
|
|
||||||
// Free the thread local default heap (called from `mi_thread_done`)
|
// Free the thread local default heap (called from `mi_thread_done`)
|
||||||
static bool _mi_heap_done(mi_heap_t* heap) {
|
static bool _mi_thread_heap_done(mi_heap_t* heap) {
|
||||||
if (!mi_heap_is_initialized(heap)) return true;
|
if (!mi_heap_is_initialized(heap)) return true;
|
||||||
|
|
||||||
// reset default heap
|
// reset default heap
|
||||||
|
@ -392,7 +392,7 @@ void mi_thread_init(void) mi_attr_noexcept
|
||||||
// initialize the thread local default heap
|
// initialize the thread local default heap
|
||||||
// (this will call `_mi_heap_set_default_direct` and thus set the
|
// (this will call `_mi_heap_set_default_direct` and thus set the
|
||||||
// fiber/pthread key to a non-zero value, ensuring `_mi_thread_done` is called)
|
// fiber/pthread key to a non-zero value, ensuring `_mi_thread_done` is called)
|
||||||
if (_mi_heap_init()) return; // returns true if already initialized
|
if (_mi_thread_heap_init()) return; // returns true if already initialized
|
||||||
|
|
||||||
_mi_stat_increase(&_mi_stats_main.threads, 1);
|
_mi_stat_increase(&_mi_stats_main.threads, 1);
|
||||||
mi_atomic_increment_relaxed(&thread_count);
|
mi_atomic_increment_relaxed(&thread_count);
|
||||||
|
@ -424,7 +424,7 @@ void _mi_thread_done(mi_heap_t* heap)
|
||||||
if (heap->thread_id != _mi_thread_id()) return;
|
if (heap->thread_id != _mi_thread_id()) return;
|
||||||
|
|
||||||
// abandon the thread local heap
|
// abandon the thread local heap
|
||||||
if (_mi_heap_done(heap)) return; // returns true if already ran
|
if (_mi_thread_heap_done(heap)) return; // returns true if already ran
|
||||||
}
|
}
|
||||||
|
|
||||||
void _mi_heap_set_default_direct(mi_heap_t* heap) {
|
void _mi_heap_set_default_direct(mi_heap_t* heap) {
|
||||||
|
|
Loading…
Add table
Reference in a new issue