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

merge with new atomic macros

Browse source
This commit is contained in:
daan 2020-01-22 20:53:44 -08:00
parent e226ebcc97
commit a46d20a681
2 changed files with 12 additions and 12 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
include/mimalloc-types.h
View file

@ -89,7 +89,7 @@ terms of the MIT license. A copy of the license can be found in the file
// Main tuning parameters for segment and page sizes // Main tuning parameters for segment and page sizes
// Sizes for 64-bit, divide by two for 32-bit // Sizes for 64-bit, divide by two for 32-bit
#define MI_SEGMENT_SLICE_SHIFT (13 + MI_INTPTR_SHIFT) // 64kb #define MI_SEGMENT_SLICE_SHIFT (13 + MI_INTPTR_SHIFT) // 64kb
#define MI_SEGMENT_SHIFT ( 9 + MI_SEGMENT_SLICE_SHIFT) // 64mb #define MI_SEGMENT_SHIFT ( 8 + MI_SEGMENT_SLICE_SHIFT) // 16mb
#define MI_SMALL_PAGE_SHIFT (MI_SEGMENT_SLICE_SHIFT) // 64kb #define MI_SMALL_PAGE_SHIFT (MI_SEGMENT_SLICE_SHIFT) // 64kb
#define MI_MEDIUM_PAGE_SHIFT ( 3 + MI_SMALL_PAGE_SHIFT) // 512kb #define MI_MEDIUM_PAGE_SHIFT ( 3 + MI_SMALL_PAGE_SHIFT) // 512kb

22
src/arena.c
View file

@ -126,7 +126,7 @@ static bool mi_arena_alloc(mi_arena_t* arena, size_t blocks, mi_bitmap_index_t*
/* ----------------------------------------------------------- /* -----------------------------------------------------------
Arena cache Arena cache
----------------------------------------------------------- */ ----------------------------------------------------------- */
#define MI_CACHE_MAX (64) // ~4GiB #define MI_CACHE_MAX (128) // ~4GiB
#define MI_MAX_NUMA (16) #define MI_MAX_NUMA (16)
#define MI_SLOT_IN_USE ((void*)1) #define MI_SLOT_IN_USE ((void*)1)
@ -162,13 +162,13 @@ static void* mi_cache_pop(int numa_node, size_t size, size_t alignment, bool* co
for (int n = numa_min; n <= numa_max; n++) { for (int n = numa_min; n <= numa_max; n++) {
for (int i = 0; i < MI_CACHE_MAX; i++) { for (int i = 0; i < MI_CACHE_MAX; i++) {
slot = &cache[n][i]; slot = &cache[n][i];
void* p = mi_atomic_read_ptr_relaxed(&slot->p); void* p = mi_atomic_read_ptr_relaxed(mi_cache_slot_t,&slot->p);
if (p > MI_SLOT_IN_USE) { // not NULL or 1 if (p > MI_SLOT_IN_USE) { // not NULL or 1
if (mi_atomic_cas_ptr_weak(&slot->p, MI_SLOT_IN_USE, p)) { if (mi_atomic_cas_ptr_weak(mi_cache_slot_t, &slot->p, MI_SLOT_IN_USE, p)) {
// claimed // claimed
if (!*large && slot->is_large) { if (!*large && slot->is_large) {
// back out again // back out again
mi_atomic_write_ptr(&slot->p, p); // make it available again mi_atomic_write_ptr(mi_cache_slot_t, &slot->p, p); // make it available again
} }
else { else {
// keep it // keep it
@ -176,7 +176,7 @@ static void* mi_cache_pop(int numa_node, size_t size, size_t alignment, bool* co
*large = slot->is_large; *large = slot->is_large;
*is_zero = false; *is_zero = false;
bool committed = slot->is_committed; bool committed = slot->is_committed;
mi_atomic_write_ptr(&slot->p, NULL); // set it free mi_atomic_write_ptr(mi_cache_slot_t, &slot->p, NULL); // set it free
if (*commit && !committed) { if (*commit && !committed) {
bool commit_zero; bool commit_zero;
_mi_os_commit(p, MI_SEGMENT_SIZE, &commit_zero, tld->stats); _mi_os_commit(p, MI_SEGMENT_SIZE, &commit_zero, tld->stats);
@ -205,19 +205,19 @@ static void mi_cache_purge(mi_os_tld_t* tld) {
int purged = 0; int purged = 0;
for (int i = 0; i < MI_CACHE_MAX; i++) { for (int i = 0; i < MI_CACHE_MAX; i++) {
slot = &cache[numa_node][i]; slot = &cache[numa_node][i];
void* p = mi_atomic_read_ptr_relaxed(&slot->p); void* p = mi_atomic_read_ptr_relaxed(mi_cache_slot_t, &slot->p);
if (p > MI_SLOT_IN_USE && !slot->is_committed && !slot->is_large) { if (p > MI_SLOT_IN_USE && !slot->is_committed && !slot->is_large) {
mi_msecs_t expire = slot->expire; mi_msecs_t expire = slot->expire;
if (expire != 0 && now >= expire) { if (expire != 0 && now >= expire) {
// expired, try to claim it // expired, try to claim it
if (mi_atomic_cas_ptr_weak(&slot->p, MI_SLOT_IN_USE, p)) { if (mi_atomic_cas_ptr_weak(mi_cache_slot_t, &slot->p, MI_SLOT_IN_USE, p)) {
// claimed! test again // claimed! test again
if (slot->is_committed && !slot->is_large && now >= slot->expire) { if (slot->is_committed && !slot->is_large && now >= slot->expire) {
_mi_os_decommit(p, MI_SEGMENT_SIZE, tld->stats); _mi_os_decommit(p, MI_SEGMENT_SIZE, tld->stats);
slot->is_committed = false; slot->is_committed = false;
} }
// and unclaim again // and unclaim again
mi_atomic_write_ptr(&slot->p, p); mi_atomic_write_ptr(mi_cache_slot_t, &slot->p, p);
purged++; purged++;
if (purged >= 4) break; // limit to at most 4 decommits per push if (purged >= 4) break; // limit to at most 4 decommits per push
} }
@ -240,9 +240,9 @@ static bool mi_cache_push(void* start, size_t size, size_t memid, bool is_commit
mi_cache_slot_t* slot; mi_cache_slot_t* slot;
for (int i = 0; i < MI_CACHE_MAX; i++) { for (int i = 0; i < MI_CACHE_MAX; i++) {
slot = &cache[numa_node][i]; slot = &cache[numa_node][i];
void* p = mi_atomic_read_ptr_relaxed(&slot->p); void* p = mi_atomic_read_ptr_relaxed(mi_cache_slot_t, &slot->p);
if (p == NULL) { // free slot if (p == NULL) { // free slot
if (mi_atomic_cas_ptr_weak(&slot->p, MI_SLOT_IN_USE, NULL)) { if (mi_atomic_cas_ptr_weak(mi_cache_slot_t, &slot->p, MI_SLOT_IN_USE, NULL)) {
// claimed! // claimed!
slot->expire = 0; slot->expire = 0;
slot->is_committed = is_committed; slot->is_committed = is_committed;
@ -258,7 +258,7 @@ static bool mi_cache_push(void* start, size_t size, size_t memid, bool is_commit
slot->expire = _mi_clock_now() + delay; slot->expire = _mi_clock_now() + delay;
} }
} }
mi_atomic_write_ptr(&slot->p, start); // and make it available; mi_atomic_write_ptr(mi_cache_slot_t, &slot->p, start); // and make it available;
return true; return true;
} }
} }