lihao/jemalloc
1
0
Fork 0
mirror of https://github.com/jemalloc/jemalloc.git synced 2026-07-23 13:13:06 +00:00
Code Issues Packages Projects Releases Wiki Activity

Refactor base_alloc() to guarantee demand-zeroed memory.

Browse Source 
Refactor base_alloc() to guarantee that allocations are carved from
demand-zeroed virtual memory.  This supports sparse data structures such
as multi-page radix tree nodes.

Enhance base_alloc() to keep track of fragments which were too small to
support previous allocation requests, and try to consume them during
subsequent requests.  This becomes important when request sizes commonly
approach or exceed the chunk size (as could radix tree node
allocations).
This commit is contained in:
Jason Evans
2015-01-30 21:49:19 -08:00
parent 918a1a5b3f
commit f500a10b2e
5 changed files with 114 additions and 78 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
src/chunk.c
View File

@@ -232,15 +232,18 @@ chunk_alloc_base(size_t size)
void *ret;
bool zero;
zero = false;
ret = chunk_alloc_core(NULL, size, chunksize, true, &zero,
chunk_dss_prec_get());
if (ret == NULL)
return (NULL);
if (chunk_register(ret, size, true)) {
/*
* Directly call chunk_alloc_mmap() rather than chunk_alloc_core()
* because it's critical that chunk_alloc_base() return untouched
* demand-zeroed virtual memory.
*/
zero = true;
ret = chunk_alloc_mmap(size, chunksize, &zero);
if (ret != NULL && chunk_register(ret, size, true)) {
chunk_dalloc_core(ret, size);
return (NULL);
ret = NULL;
}
return (ret);
}