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

remove empty page removal on page search (no longer needed with retired collection and delayed freeing)

Browse source
This commit is contained in:
daan 2020-01-03 22:52:52 -08:00
parent d596f08569
commit a2a9230ad6
1 changed files with 1 additions and 24 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

23
src/page.c
View file

@ -660,9 +660,7 @@ static void mi_page_init(mi_heap_t* heap, mi_page_t* page, size_t block_size, mi
static mi_page_t* mi_page_queue_find_free_ex(mi_heap_t* heap, mi_page_queue_t* pq) static mi_page_t* mi_page_queue_find_free_ex(mi_heap_t* heap, mi_page_queue_t* pq)
{ {
// search through the pages in "next fit" order // search through the pages in "next fit" order
mi_page_t* rpage = NULL;
size_t count = 0; size_t count = 0;
size_t page_free_count = 0;
mi_page_t* page = pq->first; mi_page_t* page = pq->first;
while( page != NULL) while( page != NULL)
{ {
@ -674,21 +672,8 @@ static mi_page_t* mi_page_queue_find_free_ex(mi_heap_t* heap, mi_page_queue_t* p
// 1. if the page contains free blocks, we are done // 1. if the page contains free blocks, we are done
if (mi_page_immediate_available(page)) { if (mi_page_immediate_available(page)) {
// If all blocks are free, we might retire this page instead.
// do this at most 8 times to bound allocation time.
// (note: this can happen if a page was earlier not retired due
// to having neighbours that were mostly full or due to concurrent frees)
if (page_free_count < 8 && mi_page_all_free(page)) {
page_free_count++;
if (rpage != NULL) _mi_page_free(rpage,pq,false);
rpage = page;
page = next;
continue; // and keep looking
}
else {
break; // pick this one break; // pick this one
} }
}
// 2. Try to extend // 2. Try to extend
if (page->capacity < page->reserved) { if (page->capacity < page->reserved) {
@ -707,14 +692,6 @@ static mi_page_t* mi_page_queue_find_free_ex(mi_heap_t* heap, mi_page_queue_t* p
mi_stat_counter_increase(heap->tld->stats.searches,count); mi_stat_counter_increase(heap->tld->stats.searches,count);
if (page == NULL) {
page = rpage;
rpage = NULL;
}
if (rpage != NULL) {
_mi_page_free(rpage,pq,false);
}
if (page == NULL) { if (page == NULL) {
page = mi_page_fresh(heap, pq); page = mi_page_fresh(heap, pq);
} }