kiper220/mimalloc
1
0
Fork 0
mirror of https://github.com/microsoft/mimalloc.git synced 2025-05-06 15:29:31 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions

fix issue #363 and disable assertion for now

Browse source
This commit is contained in:
Daan Leijen 2021-02-22 15:05:47 -08:00
parent 8f69e7095d
commit 47050371a1
3 changed files with 26 additions and 9 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

5
src/init.c
View file

@ -265,7 +265,10 @@ static bool _mi_heap_done(mi_heap_t* heap) {
// free if not the main thread // free if not the main thread
if (heap != &_mi_heap_main) { if (heap != &_mi_heap_main) {
mi_assert_internal(heap->tld->segments.count == 0 || heap->thread_id != _mi_thread_id()); // the following assertion does not always hold for huge segments as those are always treated
// as abondened: one may allocate it in one thread, but deallocate in another in which case
// the count can be too large or negative. todo: perhaps not count huge segments? see issue #363
// mi_assert_internal(heap->tld->segments.count == 0 || heap->thread_id != _mi_thread_id());
_mi_os_free(heap, sizeof(mi_thread_data_t), &_mi_stats_main); _mi_os_free(heap, sizeof(mi_thread_data_t), &_mi_stats_main);
} }
#if 0 #if 0

1
src/segment.c
View file

@ -1334,7 +1334,6 @@ void _mi_segment_huge_page_free(mi_segment_t* segment, mi_page_t* page, mi_block
page->is_zero = false; page->is_zero = false;
mi_assert(page->used == 0); mi_assert(page->used == 0);
mi_tld_t* tld = heap->tld; mi_tld_t* tld = heap->tld;
// mi_segments_track_size((long)segment->segment_size, tld);
_mi_segment_page_free(page, true, &tld->segments); _mi_segment_page_free(page, true, &tld->segments);
} }
#if (MI_DEBUG!=0) #if (MI_DEBUG!=0)

27
test/main-override.cpp
View file

@ -32,14 +32,17 @@ void heap_late_free(); // issue #204
void padding_shrink(); // issue #209 void padding_shrink(); // issue #209
void various_tests(); void various_tests();
void test_mt_shutdown(); void test_mt_shutdown();
void large_alloc(void); // issue #363
int main() { int main() {
mi_stats_reset(); // ignore earlier allocations mi_stats_reset(); // ignore earlier allocations
heap_thread_free_large(); large_alloc();
heap_no_delete();
heap_late_free(); //heap_thread_free_large();
padding_shrink(); //heap_no_delete();
various_tests(); //heap_late_free();
//padding_shrink();
//various_tests();
//test_mt_shutdown(); //test_mt_shutdown();
mi_stats_print(NULL); mi_stats_print(NULL);
return 0; return 0;
@ -176,7 +179,7 @@ void heap_thread_free_large_worker() {
void heap_thread_free_large() { void heap_thread_free_large() {
for (int i = 0; i < 100; i++) { for (int i = 0; i < 100; i++) {
shared_p = mi_malloc_aligned(2*1024*1024 + 1, 8); shared_p = mi_malloc_aligned(2 * 1024 * 1024 + 1, 8);
auto t1 = std::thread(heap_thread_free_large_worker); auto t1 = std::thread(heap_thread_free_large_worker);
t1.join(); t1.join();
} }
@ -207,3 +210,15 @@ void test_mt_shutdown()
std::cout << "done" << std::endl; std::cout << "done" << std::endl;
} }
// issue #363
using namespace std;
void large_alloc(void)
{
char* a = new char[1ull << 25];
thread th([&] {
delete[] a;
});
th.join();
}